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/bor3_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:07:29,624 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:07:29,626 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:07:29,642 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:07:29,643 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:07:29,647 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:07:29,649 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:07:29,651 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:07:29,655 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:07:29,656 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:07:29,658 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:07:29,658 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:07:29,659 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:07:29,661 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:07:29,664 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:07:29,665 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:07:29,665 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:07:29,671 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:07:29,673 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:07:29,680 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:07:29,683 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:07:29,686 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:07:29,691 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:07:29,692 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:07:29,692 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:07:29,693 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:07:29,694 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:07:29,694 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:07:29,696 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:07:29,697 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:07:29,697 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:07:29,698 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:07:29,698 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:07:29,699 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:07:29,700 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:07:29,700 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:07:29,701 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:07:29,715 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:07:29,716 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:07:29,716 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:07:29,717 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:07:29,717 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:07:29,717 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:07:29,718 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:07:29,718 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:07:29,718 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:07:29,718 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:07:29,718 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:07:29,719 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:07:29,719 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:07:29,719 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:07:29,719 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:07:29,719 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:07:29,720 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:07:29,720 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:07:29,720 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:07:29,720 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:07:29,720 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:07:29,721 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:07:29,721 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:07:29,721 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:07:29,721 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:07:29,721 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:07:29,721 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:07:29,722 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:07:29,722 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:07:29,722 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:07:29,775 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:07:29,789 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:07:29,793 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:07:29,794 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:07:29,795 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:07:29,796 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/bor3_true-unreach-call.i [2018-11-14 17:07:29,865 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cdf8de62/4bcb2aeeaf2f46099f4906e51b2631c1/FLAG659d7be89 [2018-11-14 17:07:30,299 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:07:30,300 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/bor3_true-unreach-call.i [2018-11-14 17:07:30,306 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cdf8de62/4bcb2aeeaf2f46099f4906e51b2631c1/FLAG659d7be89 [2018-11-14 17:07:30,321 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cdf8de62/4bcb2aeeaf2f46099f4906e51b2631c1 [2018-11-14 17:07:30,331 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:07:30,333 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:07:30,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:07:30,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:07:30,338 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:07:30,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:07:30" (1/1) ... [2018-11-14 17:07:30,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2fe28d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:07:30, skipping insertion in model container [2018-11-14 17:07:30,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:07:30" (1/1) ... [2018-11-14 17:07:30,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:07:30,376 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:07:30,653 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:07:30,664 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:07:30,693 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:07:30,711 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:07:30,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:07:30 WrapperNode [2018-11-14 17:07:30,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:07:30,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:07:30,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:07:30,713 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:07:30,728 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:07:30" (1/1) ... [2018-11-14 17:07:30,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:07:30" (1/1) ... [2018-11-14 17:07:30,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:07:30" (1/1) ... [2018-11-14 17:07:30,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:07:30" (1/1) ... [2018-11-14 17:07:30,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:07:30" (1/1) ... [2018-11-14 17:07:30,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:07:30" (1/1) ... [2018-11-14 17:07:30,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:07:30" (1/1) ... [2018-11-14 17:07:30,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:07:30,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:07:30,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:07:30,772 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:07:30,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:07:30" (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:07:30,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:07:30,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:07:30,901 INFO L138 BoogieDeclarations]: Found implementation of procedure bor [2018-11-14 17:07:30,901 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:07:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:07:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:07:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure bor [2018-11-14 17:07:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:07:30,902 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:07:30,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:07:30,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:07:30,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:07:30,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:07:30,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:07:30,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:07:31,662 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:07:31,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:07:31 BoogieIcfgContainer [2018-11-14 17:07:31,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:07:31,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:07:31,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:07:31,668 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:07:31,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:07:30" (1/3) ... [2018-11-14 17:07:31,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d1a94b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:07:31, skipping insertion in model container [2018-11-14 17:07:31,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:07:30" (2/3) ... [2018-11-14 17:07:31,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d1a94b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:07:31, skipping insertion in model container [2018-11-14 17:07:31,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:07:31" (3/3) ... [2018-11-14 17:07:31,672 INFO L112 eAbstractionObserver]: Analyzing ICFG bor3_true-unreach-call.i [2018-11-14 17:07:31,683 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:07:31,690 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:07:31,708 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:07:31,743 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:07:31,744 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:07:31,744 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:07:31,744 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:07:31,744 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:07:31,746 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:07:31,746 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:07:31,746 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:07:31,747 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:07:31,767 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-14 17:07:31,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 17:07:31,775 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:31,776 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:07:31,778 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:31,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:31,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1401494287, now seen corresponding path program 1 times [2018-11-14 17:07:31,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:31,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:31,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:31,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:07:31,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:31,993 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-14 17:07:31,998 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:07:31,998 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 17:07:31,999 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #69#return; {37#true} is VALID [2018-11-14 17:07:32,000 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret13 := main(); {37#true} is VALID [2018-11-14 17:07:32,000 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:07:32,013 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-14 17:07:32,014 INFO L256 TraceCheckUtils]: 7: Hoare triple {38#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {37#true} is VALID [2018-11-14 17:07:32,014 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:07:32,015 INFO L273 TraceCheckUtils]: 9: Hoare triple {37#true} assume !true; {37#true} is VALID [2018-11-14 17:07:32,015 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:07:32,016 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 17:07:32,016 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {37#true} {38#false} #73#return; {38#false} is VALID [2018-11-14 17:07:32,017 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:07:32,017 INFO L256 TraceCheckUtils]: 14: Hoare triple {38#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {37#true} is VALID [2018-11-14 17:07:32,017 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:07:32,018 INFO L273 TraceCheckUtils]: 16: Hoare triple {37#true} assume !true; {37#true} is VALID [2018-11-14 17:07:32,018 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:07:32,019 INFO L273 TraceCheckUtils]: 18: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 17:07:32,019 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {37#true} {38#false} #75#return; {38#false} is VALID [2018-11-14 17:07:32,019 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:07:32,020 INFO L273 TraceCheckUtils]: 21: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-14 17:07:32,020 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:07:32,021 INFO L256 TraceCheckUtils]: 23: Hoare triple {38#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {37#true} is VALID [2018-11-14 17:07:32,021 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:07:32,022 INFO L273 TraceCheckUtils]: 25: Hoare triple {37#true} assume !true; {37#true} is VALID [2018-11-14 17:07:32,022 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:07:32,022 INFO L273 TraceCheckUtils]: 27: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 17:07:32,023 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {37#true} {38#false} #77#return; {38#false} is VALID [2018-11-14 17:07:32,024 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:07:32,025 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:07:32,025 INFO L273 TraceCheckUtils]: 31: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-14 17:07:32,038 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:07:32,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:07:32,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:07:32,050 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 17:07:32,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:32,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:07:32,305 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:07:32,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:07:32,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:07:32,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:07:32,318 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-14 17:07:32,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:32,447 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2018-11-14 17:07:32,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:07:32,448 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 17:07:32,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:32,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:07:32,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-14 17:07:32,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:07:32,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-14 17:07:32,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 76 transitions. [2018-11-14 17:07:32,735 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:07:32,750 INFO L225 Difference]: With dead ends: 59 [2018-11-14 17:07:32,750 INFO L226 Difference]: Without dead ends: 29 [2018-11-14 17:07:32,754 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:07:32,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-14 17:07:32,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-14 17:07:32,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:32,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-14 17:07:32,820 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 17:07:32,820 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 17:07:32,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:32,826 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-14 17:07:32,826 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 17:07:32,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:32,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:32,831 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 17:07:32,831 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 17:07:32,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:32,836 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-14 17:07:32,836 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 17:07:32,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:32,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:32,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:32,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:32,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 17:07:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-14 17:07:32,844 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 32 [2018-11-14 17:07:32,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:32,844 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-14 17:07:32,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:07:32,845 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 17:07:32,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 17:07:32,847 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:32,847 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:07:32,847 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:32,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:32,848 INFO L82 PathProgramCache]: Analyzing trace with hash -741637549, now seen corresponding path program 1 times [2018-11-14 17:07:32,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:32,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:32,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:32,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:07:32,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:32,993 INFO L256 TraceCheckUtils]: 0: Hoare triple {215#true} call ULTIMATE.init(); {215#true} is VALID [2018-11-14 17:07:32,993 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:07:32,994 INFO L273 TraceCheckUtils]: 2: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:07:32,994 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} #69#return; {215#true} is VALID [2018-11-14 17:07:32,994 INFO L256 TraceCheckUtils]: 4: Hoare triple {215#true} call #t~ret13 := main(); {215#true} is VALID [2018-11-14 17:07:32,995 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:07:32,996 INFO L273 TraceCheckUtils]: 6: Hoare triple {217#(= main_~i~1 0)} assume true; {217#(= main_~i~1 0)} is VALID [2018-11-14 17:07:32,996 INFO L273 TraceCheckUtils]: 7: Hoare triple {217#(= main_~i~1 0)} assume !(~i~1 < 10000); {216#false} is VALID [2018-11-14 17:07:32,997 INFO L256 TraceCheckUtils]: 8: Hoare triple {216#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {215#true} is VALID [2018-11-14 17:07:32,997 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:07:32,997 INFO L273 TraceCheckUtils]: 10: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:07:32,997 INFO L273 TraceCheckUtils]: 11: Hoare triple {215#true} assume !(~i~0 < 10000); {215#true} is VALID [2018-11-14 17:07:32,998 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:07:32,998 INFO L273 TraceCheckUtils]: 13: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:07:32,998 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {215#true} {216#false} #73#return; {216#false} is VALID [2018-11-14 17:07:32,999 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:07:32,999 INFO L256 TraceCheckUtils]: 16: Hoare triple {216#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {215#true} is VALID [2018-11-14 17:07:32,999 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:07:33,000 INFO L273 TraceCheckUtils]: 18: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:07:33,000 INFO L273 TraceCheckUtils]: 19: Hoare triple {215#true} assume !(~i~0 < 10000); {215#true} is VALID [2018-11-14 17:07:33,000 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:07:33,001 INFO L273 TraceCheckUtils]: 21: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:07:33,001 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {215#true} {216#false} #75#return; {216#false} is VALID [2018-11-14 17:07:33,001 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:07:33,002 INFO L273 TraceCheckUtils]: 24: Hoare triple {216#false} assume true; {216#false} is VALID [2018-11-14 17:07:33,002 INFO L273 TraceCheckUtils]: 25: Hoare triple {216#false} assume !(~i~2 < 9999); {216#false} is VALID [2018-11-14 17:07:33,002 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:07:33,003 INFO L256 TraceCheckUtils]: 27: Hoare triple {216#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {215#true} is VALID [2018-11-14 17:07:33,003 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:07:33,003 INFO L273 TraceCheckUtils]: 29: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:07:33,004 INFO L273 TraceCheckUtils]: 30: Hoare triple {215#true} assume !(~i~0 < 10000); {215#true} is VALID [2018-11-14 17:07:33,004 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:07:33,004 INFO L273 TraceCheckUtils]: 32: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:07:33,005 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {215#true} {216#false} #77#return; {216#false} is VALID [2018-11-14 17:07:33,005 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:07:33,005 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:07:33,006 INFO L273 TraceCheckUtils]: 36: Hoare triple {216#false} assume !false; {216#false} is VALID [2018-11-14 17:07:33,008 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:07:33,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:07:33,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:07:33,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-14 17:07:33,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:33,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:07:33,117 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:07:33,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:07:33,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:07:33,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:07:33,118 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2018-11-14 17:07:33,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:33,587 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-14 17:07:33,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:07:33,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-14 17:07:33,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:33,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:07:33,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-14 17:07:33,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:07:33,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-14 17:07:33,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2018-11-14 17:07:33,859 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:33,863 INFO L225 Difference]: With dead ends: 52 [2018-11-14 17:07:33,864 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 17:07:33,866 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:07:33,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 17:07:33,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-14 17:07:33,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:33,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-14 17:07:33,893 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-14 17:07:33,893 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-14 17:07:33,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:33,897 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-14 17:07:33,897 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 17:07:33,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:33,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:33,899 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-14 17:07:33,899 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-14 17:07:33,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:33,902 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-14 17:07:33,902 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 17:07:33,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:33,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:33,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:33,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:33,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:07:33,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-14 17:07:33,907 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 37 [2018-11-14 17:07:33,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:33,907 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-14 17:07:33,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:07:33,908 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-14 17:07:33,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 17:07:33,909 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:33,909 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:07:33,910 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:33,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:33,910 INFO L82 PathProgramCache]: Analyzing trace with hash 989317657, now seen corresponding path program 1 times [2018-11-14 17:07:33,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:33,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:33,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:33,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:07:33,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:33,990 INFO L256 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2018-11-14 17:07:33,991 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:07:33,991 INFO L273 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:07:33,991 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #69#return; {397#true} is VALID [2018-11-14 17:07:33,991 INFO L256 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret13 := main(); {397#true} is VALID [2018-11-14 17:07:33,992 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:07:33,992 INFO L273 TraceCheckUtils]: 6: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:07:33,993 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:07:33,993 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:07:33,993 INFO L273 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:07:33,994 INFO L273 TraceCheckUtils]: 10: Hoare triple {397#true} assume !(~i~1 < 10000); {397#true} is VALID [2018-11-14 17:07:33,994 INFO L256 TraceCheckUtils]: 11: Hoare triple {397#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {397#true} is VALID [2018-11-14 17:07:33,995 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#(= bor_~i~0 1)} is VALID [2018-11-14 17:07:33,996 INFO L273 TraceCheckUtils]: 13: Hoare triple {399#(= bor_~i~0 1)} assume true; {399#(= bor_~i~0 1)} is VALID [2018-11-14 17:07:33,996 INFO L273 TraceCheckUtils]: 14: Hoare triple {399#(= bor_~i~0 1)} assume !(~i~0 < 10000); {398#false} is VALID [2018-11-14 17:07:33,997 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:07:33,997 INFO L273 TraceCheckUtils]: 16: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:07:33,997 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {398#false} {397#true} #73#return; {398#false} is VALID [2018-11-14 17:07:33,997 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:07:33,998 INFO L256 TraceCheckUtils]: 19: Hoare triple {398#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {397#true} is VALID [2018-11-14 17:07:33,998 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:07:33,998 INFO L273 TraceCheckUtils]: 21: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:07:33,999 INFO L273 TraceCheckUtils]: 22: Hoare triple {397#true} assume !(~i~0 < 10000); {397#true} is VALID [2018-11-14 17:07:33,999 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:07:33,999 INFO L273 TraceCheckUtils]: 24: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:07:34,000 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {397#true} {398#false} #75#return; {398#false} is VALID [2018-11-14 17:07:34,000 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:07:34,000 INFO L273 TraceCheckUtils]: 27: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:07:34,001 INFO L273 TraceCheckUtils]: 28: Hoare triple {398#false} assume !(~i~2 < 9999); {398#false} is VALID [2018-11-14 17:07:34,001 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:07:34,001 INFO L256 TraceCheckUtils]: 30: Hoare triple {398#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {397#true} is VALID [2018-11-14 17:07:34,002 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:07:34,002 INFO L273 TraceCheckUtils]: 32: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:07:34,002 INFO L273 TraceCheckUtils]: 33: Hoare triple {397#true} assume !(~i~0 < 10000); {397#true} is VALID [2018-11-14 17:07:34,003 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:07:34,003 INFO L273 TraceCheckUtils]: 35: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:07:34,003 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {397#true} {398#false} #77#return; {398#false} is VALID [2018-11-14 17:07:34,004 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:07:34,004 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:07:34,004 INFO L273 TraceCheckUtils]: 39: Hoare triple {398#false} assume !false; {398#false} is VALID [2018-11-14 17:07:34,007 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:07:34,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:34,007 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:07:34,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:07:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:34,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:34,553 INFO L256 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2018-11-14 17:07:34,554 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:07:34,554 INFO L273 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:07:34,555 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #69#return; {397#true} is VALID [2018-11-14 17:07:34,555 INFO L256 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret13 := main(); {397#true} is VALID [2018-11-14 17:07:34,556 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:07:34,556 INFO L273 TraceCheckUtils]: 6: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:07:34,557 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:07:34,557 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:07:34,558 INFO L273 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:07:34,558 INFO L273 TraceCheckUtils]: 10: Hoare triple {397#true} assume !(~i~1 < 10000); {397#true} is VALID [2018-11-14 17:07:34,558 INFO L256 TraceCheckUtils]: 11: Hoare triple {397#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {397#true} is VALID [2018-11-14 17:07:34,573 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#(<= bor_~i~0 1)} is VALID [2018-11-14 17:07:34,579 INFO L273 TraceCheckUtils]: 13: Hoare triple {439#(<= bor_~i~0 1)} assume true; {439#(<= bor_~i~0 1)} is VALID [2018-11-14 17:07:34,580 INFO L273 TraceCheckUtils]: 14: Hoare triple {439#(<= bor_~i~0 1)} assume !(~i~0 < 10000); {398#false} is VALID [2018-11-14 17:07:34,580 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:07:34,580 INFO L273 TraceCheckUtils]: 16: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:07:34,581 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {398#false} {397#true} #73#return; {398#false} is VALID [2018-11-14 17:07:34,581 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:07:34,581 INFO L256 TraceCheckUtils]: 19: Hoare triple {398#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {398#false} is VALID [2018-11-14 17:07:34,582 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:07:34,582 INFO L273 TraceCheckUtils]: 21: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:07:34,582 INFO L273 TraceCheckUtils]: 22: Hoare triple {398#false} assume !(~i~0 < 10000); {398#false} is VALID [2018-11-14 17:07:34,583 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:07:34,583 INFO L273 TraceCheckUtils]: 24: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:07:34,583 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {398#false} {398#false} #75#return; {398#false} is VALID [2018-11-14 17:07:34,583 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:07:34,584 INFO L273 TraceCheckUtils]: 27: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:07:34,584 INFO L273 TraceCheckUtils]: 28: Hoare triple {398#false} assume !(~i~2 < 9999); {398#false} is VALID [2018-11-14 17:07:34,584 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:07:34,585 INFO L256 TraceCheckUtils]: 30: Hoare triple {398#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {398#false} is VALID [2018-11-14 17:07:34,585 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:07:34,585 INFO L273 TraceCheckUtils]: 32: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:07:34,585 INFO L273 TraceCheckUtils]: 33: Hoare triple {398#false} assume !(~i~0 < 10000); {398#false} is VALID [2018-11-14 17:07:34,586 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:07:34,586 INFO L273 TraceCheckUtils]: 35: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:07:34,586 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {398#false} {398#false} #77#return; {398#false} is VALID [2018-11-14 17:07:34,587 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:07:34,587 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:07:34,587 INFO L273 TraceCheckUtils]: 39: Hoare triple {398#false} assume !false; {398#false} is VALID [2018-11-14 17:07:34,590 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:07:34,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:07:34,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-14 17:07:34,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-14 17:07:34,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:34,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:07:34,788 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:07:34,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:07:34,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:07:34,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:07:34,789 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2018-11-14 17:07:35,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:35,088 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-11-14 17:07:35,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:07:35,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-14 17:07:35,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:35,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:07:35,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 17:07:35,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:07:35,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 17:07:35,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2018-11-14 17:07:35,216 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:07:35,219 INFO L225 Difference]: With dead ends: 53 [2018-11-14 17:07:35,219 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 17:07:35,220 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:07:35,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 17:07:35,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-14 17:07:35,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:35,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-14 17:07:35,233 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-14 17:07:35,234 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-14 17:07:35,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:35,237 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-14 17:07:35,237 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 17:07:35,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:35,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:35,238 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-14 17:07:35,238 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-14 17:07:35,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:35,241 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-14 17:07:35,241 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 17:07:35,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:35,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:35,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:35,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:35,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 17:07:35,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-14 17:07:35,245 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 40 [2018-11-14 17:07:35,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:35,246 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-14 17:07:35,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:07:35,246 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-14 17:07:35,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 17:07:35,248 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:35,248 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:07:35,248 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:35,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:35,249 INFO L82 PathProgramCache]: Analyzing trace with hash 841579359, now seen corresponding path program 1 times [2018-11-14 17:07:35,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:35,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:35,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:35,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:07:35,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:35,358 INFO L256 TraceCheckUtils]: 0: Hoare triple {705#true} call ULTIMATE.init(); {705#true} is VALID [2018-11-14 17:07:35,358 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:07:35,359 INFO L273 TraceCheckUtils]: 2: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:07:35,359 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {705#true} {705#true} #69#return; {705#true} is VALID [2018-11-14 17:07:35,360 INFO L256 TraceCheckUtils]: 4: Hoare triple {705#true} call #t~ret13 := main(); {705#true} is VALID [2018-11-14 17:07:35,361 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:07:35,361 INFO L273 TraceCheckUtils]: 6: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:07:35,362 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:07:35,362 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:07:35,362 INFO L273 TraceCheckUtils]: 9: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:07:35,363 INFO L273 TraceCheckUtils]: 10: Hoare triple {705#true} assume !(~i~1 < 10000); {705#true} is VALID [2018-11-14 17:07:35,363 INFO L256 TraceCheckUtils]: 11: Hoare triple {705#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {705#true} is VALID [2018-11-14 17:07:35,363 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:07:35,363 INFO L273 TraceCheckUtils]: 13: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:07:35,364 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {705#true} is VALID [2018-11-14 17:07:35,364 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:07:35,364 INFO L273 TraceCheckUtils]: 16: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:07:35,365 INFO L273 TraceCheckUtils]: 17: Hoare triple {705#true} assume !(~i~0 < 10000); {705#true} is VALID [2018-11-14 17:07:35,365 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:07:35,365 INFO L273 TraceCheckUtils]: 19: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:07:35,365 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {705#true} {705#true} #73#return; {705#true} is VALID [2018-11-14 17:07:35,366 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:07:35,366 INFO L256 TraceCheckUtils]: 22: Hoare triple {705#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {705#true} is VALID [2018-11-14 17:07:35,366 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:07:35,367 INFO L273 TraceCheckUtils]: 24: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:07:35,367 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {705#true} is VALID [2018-11-14 17:07:35,367 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:07:35,367 INFO L273 TraceCheckUtils]: 27: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:07:35,368 INFO L273 TraceCheckUtils]: 28: Hoare triple {705#true} assume !(~i~0 < 10000); {705#true} is VALID [2018-11-14 17:07:35,368 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:07:35,368 INFO L273 TraceCheckUtils]: 30: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:07:35,368 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {705#true} {705#true} #75#return; {705#true} is VALID [2018-11-14 17:07:35,371 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:07:35,371 INFO L273 TraceCheckUtils]: 33: Hoare triple {707#(= main_~i~2 0)} assume true; {707#(= main_~i~2 0)} is VALID [2018-11-14 17:07:35,373 INFO L273 TraceCheckUtils]: 34: Hoare triple {707#(= main_~i~2 0)} assume !(~i~2 < 9999); {706#false} is VALID [2018-11-14 17:07:35,373 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:07:35,374 INFO L256 TraceCheckUtils]: 36: Hoare triple {706#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {705#true} is VALID [2018-11-14 17:07:35,374 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:07:35,374 INFO L273 TraceCheckUtils]: 38: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:07:35,375 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {705#true} is VALID [2018-11-14 17:07:35,375 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:07:35,375 INFO L273 TraceCheckUtils]: 41: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:07:35,375 INFO L273 TraceCheckUtils]: 42: Hoare triple {705#true} assume !(~i~0 < 10000); {705#true} is VALID [2018-11-14 17:07:35,375 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:07:35,376 INFO L273 TraceCheckUtils]: 44: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:07:35,376 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {705#true} {706#false} #77#return; {706#false} is VALID [2018-11-14 17:07:35,376 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:07:35,377 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:07:35,377 INFO L273 TraceCheckUtils]: 48: Hoare triple {706#false} assume !false; {706#false} is VALID [2018-11-14 17:07:35,380 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:07:35,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:07:35,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:07:35,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-14 17:07:35,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:35,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:07:35,459 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:07:35,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:07:35,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:07:35,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:07:35,461 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-11-14 17:07:35,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:35,552 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-14 17:07:35,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:07:35,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-14 17:07:35,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:35,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:07:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-14 17:07:35,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:07:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-14 17:07:35,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2018-11-14 17:07:35,738 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:07:35,740 INFO L225 Difference]: With dead ends: 51 [2018-11-14 17:07:35,740 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 17:07:35,741 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:07:35,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 17:07:35,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-14 17:07:35,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:35,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2018-11-14 17:07:35,759 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2018-11-14 17:07:35,759 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2018-11-14 17:07:35,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:35,762 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-14 17:07:35,762 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-14 17:07:35,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:35,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:35,764 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2018-11-14 17:07:35,764 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2018-11-14 17:07:35,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:35,767 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-14 17:07:35,767 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-14 17:07:35,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:35,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:35,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:35,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:35,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:07:35,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-14 17:07:35,771 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 49 [2018-11-14 17:07:35,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:35,771 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-14 17:07:35,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:07:35,772 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-14 17:07:35,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-14 17:07:35,773 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:35,773 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:07:35,774 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:35,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:35,774 INFO L82 PathProgramCache]: Analyzing trace with hash 611709709, now seen corresponding path program 1 times [2018-11-14 17:07:35,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:35,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:35,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:35,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:07:35,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:35,895 INFO L256 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2018-11-14 17:07:35,896 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:07:35,896 INFO L273 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:07:35,896 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #69#return; {900#true} is VALID [2018-11-14 17:07:35,896 INFO L256 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret13 := main(); {900#true} is VALID [2018-11-14 17:07:35,902 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:07:35,903 INFO L273 TraceCheckUtils]: 6: Hoare triple {902#(= main_~i~1 0)} assume true; {902#(= main_~i~1 0)} is VALID [2018-11-14 17:07:35,904 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:07:35,904 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:07:35,906 INFO L273 TraceCheckUtils]: 9: Hoare triple {903#(<= main_~i~1 1)} assume true; {903#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:35,906 INFO L273 TraceCheckUtils]: 10: Hoare triple {903#(<= main_~i~1 1)} assume !(~i~1 < 10000); {901#false} is VALID [2018-11-14 17:07:35,907 INFO L256 TraceCheckUtils]: 11: Hoare triple {901#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {900#true} is VALID [2018-11-14 17:07:35,907 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:07:35,907 INFO L273 TraceCheckUtils]: 13: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:07:35,907 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {900#true} is VALID [2018-11-14 17:07:35,908 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:07:35,908 INFO L273 TraceCheckUtils]: 16: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:07:35,909 INFO L273 TraceCheckUtils]: 17: Hoare triple {900#true} assume !(~i~0 < 10000); {900#true} is VALID [2018-11-14 17:07:35,909 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:07:35,912 INFO L273 TraceCheckUtils]: 19: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:07:35,912 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {900#true} {901#false} #73#return; {901#false} is VALID [2018-11-14 17:07:35,913 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:07:35,913 INFO L256 TraceCheckUtils]: 22: Hoare triple {901#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {900#true} is VALID [2018-11-14 17:07:35,913 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:07:35,914 INFO L273 TraceCheckUtils]: 24: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:07:35,915 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {900#true} is VALID [2018-11-14 17:07:35,915 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:07:35,915 INFO L273 TraceCheckUtils]: 27: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:07:35,916 INFO L273 TraceCheckUtils]: 28: Hoare triple {900#true} assume !(~i~0 < 10000); {900#true} is VALID [2018-11-14 17:07:35,916 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:07:35,916 INFO L273 TraceCheckUtils]: 30: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:07:35,916 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {900#true} {901#false} #75#return; {901#false} is VALID [2018-11-14 17:07:35,917 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:07:35,917 INFO L273 TraceCheckUtils]: 33: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:07:35,917 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:07:35,918 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:07:35,918 INFO L273 TraceCheckUtils]: 36: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:07:35,918 INFO L273 TraceCheckUtils]: 37: Hoare triple {901#false} assume !(~i~2 < 9999); {901#false} is VALID [2018-11-14 17:07:35,918 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:07:35,918 INFO L256 TraceCheckUtils]: 39: Hoare triple {901#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {900#true} is VALID [2018-11-14 17:07:35,919 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:07:35,919 INFO L273 TraceCheckUtils]: 41: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:07:35,919 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {900#true} is VALID [2018-11-14 17:07:35,919 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:07:35,920 INFO L273 TraceCheckUtils]: 44: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:07:35,920 INFO L273 TraceCheckUtils]: 45: Hoare triple {900#true} assume !(~i~0 < 10000); {900#true} is VALID [2018-11-14 17:07:35,920 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:07:35,920 INFO L273 TraceCheckUtils]: 47: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:07:35,920 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {900#true} {901#false} #77#return; {901#false} is VALID [2018-11-14 17:07:35,921 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:07:35,921 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:07:35,921 INFO L273 TraceCheckUtils]: 51: Hoare triple {901#false} assume !false; {901#false} is VALID [2018-11-14 17:07:35,924 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:07:35,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:35,924 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:07:35,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:07:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:36,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:36,470 INFO L256 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2018-11-14 17:07:36,470 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:07:36,471 INFO L273 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:07:36,471 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #69#return; {900#true} is VALID [2018-11-14 17:07:36,471 INFO L256 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret13 := main(); {900#true} is VALID [2018-11-14 17:07:36,473 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:07:36,474 INFO L273 TraceCheckUtils]: 6: Hoare triple {922#(<= main_~i~1 0)} assume true; {922#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:36,475 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:07:36,476 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:07:36,477 INFO L273 TraceCheckUtils]: 9: Hoare triple {903#(<= main_~i~1 1)} assume true; {903#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:36,478 INFO L273 TraceCheckUtils]: 10: Hoare triple {903#(<= main_~i~1 1)} assume !(~i~1 < 10000); {901#false} is VALID [2018-11-14 17:07:36,478 INFO L256 TraceCheckUtils]: 11: Hoare triple {901#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {901#false} is VALID [2018-11-14 17:07:36,478 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:07:36,479 INFO L273 TraceCheckUtils]: 13: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:07:36,479 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {901#false} is VALID [2018-11-14 17:07:36,479 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:07:36,480 INFO L273 TraceCheckUtils]: 16: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:07:36,480 INFO L273 TraceCheckUtils]: 17: Hoare triple {901#false} assume !(~i~0 < 10000); {901#false} is VALID [2018-11-14 17:07:36,481 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:07:36,481 INFO L273 TraceCheckUtils]: 19: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:07:36,482 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {901#false} {901#false} #73#return; {901#false} is VALID [2018-11-14 17:07:36,482 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:07:36,482 INFO L256 TraceCheckUtils]: 22: Hoare triple {901#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {901#false} is VALID [2018-11-14 17:07:36,483 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:07:36,483 INFO L273 TraceCheckUtils]: 24: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:07:36,483 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {901#false} is VALID [2018-11-14 17:07:36,483 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:07:36,484 INFO L273 TraceCheckUtils]: 27: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:07:36,484 INFO L273 TraceCheckUtils]: 28: Hoare triple {901#false} assume !(~i~0 < 10000); {901#false} is VALID [2018-11-14 17:07:36,484 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:07:36,484 INFO L273 TraceCheckUtils]: 30: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:07:36,485 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {901#false} {901#false} #75#return; {901#false} is VALID [2018-11-14 17:07:36,485 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:07:36,485 INFO L273 TraceCheckUtils]: 33: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:07:36,486 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:07:36,486 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:07:36,486 INFO L273 TraceCheckUtils]: 36: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:07:36,486 INFO L273 TraceCheckUtils]: 37: Hoare triple {901#false} assume !(~i~2 < 9999); {901#false} is VALID [2018-11-14 17:07:36,487 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:07:36,487 INFO L256 TraceCheckUtils]: 39: Hoare triple {901#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {901#false} is VALID [2018-11-14 17:07:36,487 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:07:36,487 INFO L273 TraceCheckUtils]: 41: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:07:36,488 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {901#false} is VALID [2018-11-14 17:07:36,488 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:07:36,488 INFO L273 TraceCheckUtils]: 44: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:07:36,488 INFO L273 TraceCheckUtils]: 45: Hoare triple {901#false} assume !(~i~0 < 10000); {901#false} is VALID [2018-11-14 17:07:36,489 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:07:36,489 INFO L273 TraceCheckUtils]: 47: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:07:36,489 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {901#false} {901#false} #77#return; {901#false} is VALID [2018-11-14 17:07:36,490 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:07:36,490 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:07:36,490 INFO L273 TraceCheckUtils]: 51: Hoare triple {901#false} assume !false; {901#false} is VALID [2018-11-14 17:07:36,493 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:07:36,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:36,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 17:07:36,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-14 17:07:36,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:36,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:07:36,612 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:07:36,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:07:36,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:07:36,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:07:36,613 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2018-11-14 17:07:36,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:36,763 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-11-14 17:07:36,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:07:36,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-14 17:07:36,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:36,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:07:36,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2018-11-14 17:07:36,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:07:36,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2018-11-14 17:07:36,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2018-11-14 17:07:36,985 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:07:36,988 INFO L225 Difference]: With dead ends: 63 [2018-11-14 17:07:36,988 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 17:07:36,989 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:07:36,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 17:07:37,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-14 17:07:37,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:37,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2018-11-14 17:07:37,005 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2018-11-14 17:07:37,005 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2018-11-14 17:07:37,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:37,008 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-14 17:07:37,008 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-14 17:07:37,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:37,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:37,009 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2018-11-14 17:07:37,009 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2018-11-14 17:07:37,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:37,012 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-14 17:07:37,012 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-14 17:07:37,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:37,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:37,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:37,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:37,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 17:07:37,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-14 17:07:37,016 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 52 [2018-11-14 17:07:37,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:37,016 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-14 17:07:37,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:07:37,017 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-14 17:07:37,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-14 17:07:37,018 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:37,018 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:07:37,018 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:37,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:37,019 INFO L82 PathProgramCache]: Analyzing trace with hash -349935993, now seen corresponding path program 2 times [2018-11-14 17:07:37,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:37,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:37,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:37,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:07:37,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:37,164 INFO L256 TraceCheckUtils]: 0: Hoare triple {1277#true} call ULTIMATE.init(); {1277#true} is VALID [2018-11-14 17:07:37,164 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:37,164 INFO L273 TraceCheckUtils]: 2: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:07:37,165 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1277#true} {1277#true} #69#return; {1277#true} is VALID [2018-11-14 17:07:37,165 INFO L256 TraceCheckUtils]: 4: Hoare triple {1277#true} call #t~ret13 := main(); {1277#true} is VALID [2018-11-14 17:07:37,166 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:07:37,170 INFO L273 TraceCheckUtils]: 6: Hoare triple {1279#(= main_~i~1 0)} assume true; {1279#(= main_~i~1 0)} is VALID [2018-11-14 17:07:37,171 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:07:37,171 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:07:37,172 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:37,172 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:37,173 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:37,174 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:37,175 INFO L273 TraceCheckUtils]: 13: Hoare triple {1281#(<= main_~i~1 2)} assume !(~i~1 < 10000); {1278#false} is VALID [2018-11-14 17:07:37,175 INFO L256 TraceCheckUtils]: 14: Hoare triple {1278#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {1277#true} is VALID [2018-11-14 17:07:37,175 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:07:37,176 INFO L273 TraceCheckUtils]: 16: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:07:37,176 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1277#true} is VALID [2018-11-14 17:07:37,176 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:07:37,177 INFO L273 TraceCheckUtils]: 19: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:07:37,177 INFO L273 TraceCheckUtils]: 20: Hoare triple {1277#true} assume !(~i~0 < 10000); {1277#true} is VALID [2018-11-14 17:07:37,177 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:07:37,177 INFO L273 TraceCheckUtils]: 22: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:07:37,178 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1277#true} {1278#false} #73#return; {1278#false} is VALID [2018-11-14 17:07:37,178 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:37,178 INFO L256 TraceCheckUtils]: 25: Hoare triple {1278#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {1277#true} is VALID [2018-11-14 17:07:37,179 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:07:37,179 INFO L273 TraceCheckUtils]: 27: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:07:37,179 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1277#true} is VALID [2018-11-14 17:07:37,179 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:07:37,179 INFO L273 TraceCheckUtils]: 30: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:07:37,180 INFO L273 TraceCheckUtils]: 31: Hoare triple {1277#true} assume !(~i~0 < 10000); {1277#true} is VALID [2018-11-14 17:07:37,180 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:07:37,180 INFO L273 TraceCheckUtils]: 33: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:07:37,180 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1277#true} {1278#false} #75#return; {1278#false} is VALID [2018-11-14 17:07:37,180 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:37,181 INFO L273 TraceCheckUtils]: 36: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:07:37,181 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:37,181 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:37,181 INFO L273 TraceCheckUtils]: 39: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:07:37,181 INFO L273 TraceCheckUtils]: 40: Hoare triple {1278#false} assume !(~i~2 < 9999); {1278#false} is VALID [2018-11-14 17:07:37,181 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:37,182 INFO L256 TraceCheckUtils]: 42: Hoare triple {1278#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {1277#true} is VALID [2018-11-14 17:07:37,182 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:07:37,182 INFO L273 TraceCheckUtils]: 44: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:07:37,182 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1277#true} is VALID [2018-11-14 17:07:37,182 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:07:37,183 INFO L273 TraceCheckUtils]: 47: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:07:37,183 INFO L273 TraceCheckUtils]: 48: Hoare triple {1277#true} assume !(~i~0 < 10000); {1277#true} is VALID [2018-11-14 17:07:37,183 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:07:37,183 INFO L273 TraceCheckUtils]: 50: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:07:37,183 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {1277#true} {1278#false} #77#return; {1278#false} is VALID [2018-11-14 17:07:37,184 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:37,184 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:37,184 INFO L273 TraceCheckUtils]: 54: Hoare triple {1278#false} assume !false; {1278#false} is VALID [2018-11-14 17:07:37,187 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:37,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:37,187 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:07:37,197 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:07:37,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:07:37,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:37,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:37,369 INFO L256 TraceCheckUtils]: 0: Hoare triple {1277#true} call ULTIMATE.init(); {1277#true} is VALID [2018-11-14 17:07:37,370 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:37,370 INFO L273 TraceCheckUtils]: 2: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:07:37,371 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1277#true} {1277#true} #69#return; {1277#true} is VALID [2018-11-14 17:07:37,371 INFO L256 TraceCheckUtils]: 4: Hoare triple {1277#true} call #t~ret13 := main(); {1277#true} is VALID [2018-11-14 17:07:37,379 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:37,379 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:37,380 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:37,381 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:37,381 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:37,381 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:37,382 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:37,382 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:37,383 INFO L273 TraceCheckUtils]: 13: Hoare triple {1281#(<= main_~i~1 2)} assume !(~i~1 < 10000); {1278#false} is VALID [2018-11-14 17:07:37,384 INFO L256 TraceCheckUtils]: 14: Hoare triple {1278#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {1278#false} is VALID [2018-11-14 17:07:37,384 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:37,384 INFO L273 TraceCheckUtils]: 16: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:07:37,385 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1278#false} is VALID [2018-11-14 17:07:37,385 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:37,385 INFO L273 TraceCheckUtils]: 19: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:07:37,386 INFO L273 TraceCheckUtils]: 20: Hoare triple {1278#false} assume !(~i~0 < 10000); {1278#false} is VALID [2018-11-14 17:07:37,386 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:37,386 INFO L273 TraceCheckUtils]: 22: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:07:37,386 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1278#false} {1278#false} #73#return; {1278#false} is VALID [2018-11-14 17:07:37,386 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:37,386 INFO L256 TraceCheckUtils]: 25: Hoare triple {1278#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {1278#false} is VALID [2018-11-14 17:07:37,387 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:37,387 INFO L273 TraceCheckUtils]: 27: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:07:37,387 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1278#false} is VALID [2018-11-14 17:07:37,387 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:37,387 INFO L273 TraceCheckUtils]: 30: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:07:37,387 INFO L273 TraceCheckUtils]: 31: Hoare triple {1278#false} assume !(~i~0 < 10000); {1278#false} is VALID [2018-11-14 17:07:37,388 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:37,388 INFO L273 TraceCheckUtils]: 33: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:07:37,388 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1278#false} {1278#false} #75#return; {1278#false} is VALID [2018-11-14 17:07:37,388 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:37,389 INFO L273 TraceCheckUtils]: 36: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:07:37,389 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:37,389 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:37,389 INFO L273 TraceCheckUtils]: 39: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:07:37,390 INFO L273 TraceCheckUtils]: 40: Hoare triple {1278#false} assume !(~i~2 < 9999); {1278#false} is VALID [2018-11-14 17:07:37,390 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:37,390 INFO L256 TraceCheckUtils]: 42: Hoare triple {1278#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {1278#false} is VALID [2018-11-14 17:07:37,390 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:37,391 INFO L273 TraceCheckUtils]: 44: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:07:37,391 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1278#false} is VALID [2018-11-14 17:07:37,391 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:37,391 INFO L273 TraceCheckUtils]: 47: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:07:37,392 INFO L273 TraceCheckUtils]: 48: Hoare triple {1278#false} assume !(~i~0 < 10000); {1278#false} is VALID [2018-11-14 17:07:37,392 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:37,392 INFO L273 TraceCheckUtils]: 50: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:07:37,392 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {1278#false} {1278#false} #77#return; {1278#false} is VALID [2018-11-14 17:07:37,392 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:37,392 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:37,393 INFO L273 TraceCheckUtils]: 54: Hoare triple {1278#false} assume !false; {1278#false} is VALID [2018-11-14 17:07:37,396 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:37,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:37,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 17:07:37,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-11-14 17:07:37,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:37,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:07:37,477 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:37,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:07:37,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:07:37,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:07:37,478 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 6 states. [2018-11-14 17:07:37,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:37,638 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-14 17:07:37,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:07:37,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-11-14 17:07:37,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:37,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:07:37,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2018-11-14 17:07:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:07:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2018-11-14 17:07:37,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2018-11-14 17:07:37,798 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:37,800 INFO L225 Difference]: With dead ends: 66 [2018-11-14 17:07:37,800 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 17:07:37,801 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:37,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 17:07:37,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-14 17:07:37,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:37,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2018-11-14 17:07:37,823 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2018-11-14 17:07:37,823 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2018-11-14 17:07:37,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:37,826 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-14 17:07:37,827 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 17:07:37,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:37,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:37,827 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2018-11-14 17:07:37,827 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2018-11-14 17:07:37,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:37,834 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-14 17:07:37,834 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 17:07:37,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:37,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:37,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:37,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:37,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 17:07:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-14 17:07:37,841 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 55 [2018-11-14 17:07:37,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:37,841 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-14 17:07:37,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:07:37,841 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-14 17:07:37,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-14 17:07:37,842 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:37,843 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:37,845 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:37,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:37,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1305179955, now seen corresponding path program 3 times [2018-11-14 17:07:37,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:37,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:37,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:37,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:37,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:37,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:38,114 INFO L256 TraceCheckUtils]: 0: Hoare triple {1678#true} call ULTIMATE.init(); {1678#true} is VALID [2018-11-14 17:07:38,114 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:38,115 INFO L273 TraceCheckUtils]: 2: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:38,115 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1678#true} {1678#true} #69#return; {1678#true} is VALID [2018-11-14 17:07:38,115 INFO L256 TraceCheckUtils]: 4: Hoare triple {1678#true} call #t~ret13 := main(); {1678#true} is VALID [2018-11-14 17:07:38,116 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:38,117 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:38,118 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:38,118 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:38,119 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:38,119 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:38,120 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:38,120 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:38,120 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:38,121 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:38,122 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:38,123 INFO L273 TraceCheckUtils]: 16: Hoare triple {1683#(<= main_~i~1 3)} assume !(~i~1 < 10000); {1679#false} is VALID [2018-11-14 17:07:38,123 INFO L256 TraceCheckUtils]: 17: Hoare triple {1679#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 17:07:38,123 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:38,124 INFO L273 TraceCheckUtils]: 19: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:38,124 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1678#true} is VALID [2018-11-14 17:07:38,124 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:38,125 INFO L273 TraceCheckUtils]: 22: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:38,125 INFO L273 TraceCheckUtils]: 23: Hoare triple {1678#true} assume !(~i~0 < 10000); {1678#true} is VALID [2018-11-14 17:07:38,125 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:38,126 INFO L273 TraceCheckUtils]: 25: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:38,126 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1678#true} {1679#false} #73#return; {1679#false} is VALID [2018-11-14 17:07:38,126 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:38,126 INFO L256 TraceCheckUtils]: 28: Hoare triple {1679#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 17:07:38,126 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:38,127 INFO L273 TraceCheckUtils]: 30: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:38,127 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1678#true} is VALID [2018-11-14 17:07:38,127 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:38,127 INFO L273 TraceCheckUtils]: 33: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:38,127 INFO L273 TraceCheckUtils]: 34: Hoare triple {1678#true} assume !(~i~0 < 10000); {1678#true} is VALID [2018-11-14 17:07:38,127 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:38,128 INFO L273 TraceCheckUtils]: 36: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:38,128 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1678#true} {1679#false} #75#return; {1679#false} is VALID [2018-11-14 17:07:38,128 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:38,128 INFO L273 TraceCheckUtils]: 39: Hoare triple {1679#false} assume true; {1679#false} is VALID [2018-11-14 17:07:38,128 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:38,128 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:38,129 INFO L273 TraceCheckUtils]: 42: Hoare triple {1679#false} assume true; {1679#false} is VALID [2018-11-14 17:07:38,129 INFO L273 TraceCheckUtils]: 43: Hoare triple {1679#false} assume !(~i~2 < 9999); {1679#false} is VALID [2018-11-14 17:07:38,129 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:38,129 INFO L256 TraceCheckUtils]: 45: Hoare triple {1679#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 17:07:38,129 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:38,129 INFO L273 TraceCheckUtils]: 47: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:38,130 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1678#true} is VALID [2018-11-14 17:07:38,130 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:38,130 INFO L273 TraceCheckUtils]: 50: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:38,130 INFO L273 TraceCheckUtils]: 51: Hoare triple {1678#true} assume !(~i~0 < 10000); {1678#true} is VALID [2018-11-14 17:07:38,130 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:38,131 INFO L273 TraceCheckUtils]: 53: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:38,131 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1678#true} {1679#false} #77#return; {1679#false} is VALID [2018-11-14 17:07:38,131 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:38,131 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:38,131 INFO L273 TraceCheckUtils]: 57: Hoare triple {1679#false} assume !false; {1679#false} is VALID [2018-11-14 17:07:38,134 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:38,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:38,135 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:38,144 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:07:38,171 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 17:07:38,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:38,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:38,401 INFO L256 TraceCheckUtils]: 0: Hoare triple {1678#true} call ULTIMATE.init(); {1678#true} is VALID [2018-11-14 17:07:38,401 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:38,401 INFO L273 TraceCheckUtils]: 2: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:38,402 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1678#true} {1678#true} #69#return; {1678#true} is VALID [2018-11-14 17:07:38,402 INFO L256 TraceCheckUtils]: 4: Hoare triple {1678#true} call #t~ret13 := main(); {1678#true} is VALID [2018-11-14 17:07:38,402 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:38,402 INFO L273 TraceCheckUtils]: 6: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:38,403 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:38,403 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:38,403 INFO L273 TraceCheckUtils]: 9: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:38,403 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:38,403 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:38,403 INFO L273 TraceCheckUtils]: 12: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:38,403 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:38,403 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:38,404 INFO L273 TraceCheckUtils]: 15: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:38,404 INFO L273 TraceCheckUtils]: 16: Hoare triple {1678#true} assume !(~i~1 < 10000); {1678#true} is VALID [2018-11-14 17:07:38,404 INFO L256 TraceCheckUtils]: 17: Hoare triple {1678#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 17:07:38,404 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:38,404 INFO L273 TraceCheckUtils]: 19: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:38,404 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1678#true} is VALID [2018-11-14 17:07:38,404 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:38,405 INFO L273 TraceCheckUtils]: 22: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:38,405 INFO L273 TraceCheckUtils]: 23: Hoare triple {1678#true} assume !(~i~0 < 10000); {1678#true} is VALID [2018-11-14 17:07:38,405 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:38,405 INFO L273 TraceCheckUtils]: 25: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:38,405 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1678#true} {1678#true} #73#return; {1678#true} is VALID [2018-11-14 17:07:38,405 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:38,405 INFO L256 TraceCheckUtils]: 28: Hoare triple {1678#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 17:07:38,406 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:38,406 INFO L273 TraceCheckUtils]: 30: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:38,406 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1678#true} is VALID [2018-11-14 17:07:38,406 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:38,406 INFO L273 TraceCheckUtils]: 33: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:38,406 INFO L273 TraceCheckUtils]: 34: Hoare triple {1678#true} assume !(~i~0 < 10000); {1678#true} is VALID [2018-11-14 17:07:38,406 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:38,406 INFO L273 TraceCheckUtils]: 36: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:38,407 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1678#true} {1678#true} #75#return; {1678#true} is VALID [2018-11-14 17:07:38,407 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:38,407 INFO L273 TraceCheckUtils]: 39: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:38,407 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:38,407 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:38,409 INFO L273 TraceCheckUtils]: 42: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:07:38,409 INFO L273 TraceCheckUtils]: 43: Hoare triple {1678#true} assume !(~i~2 < 9999); {1678#true} is VALID [2018-11-14 17:07:38,409 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:38,410 INFO L256 TraceCheckUtils]: 45: Hoare triple {1678#true} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 17:07:38,414 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#(<= bor_~i~0 1)} is VALID [2018-11-14 17:07:38,415 INFO L273 TraceCheckUtils]: 47: Hoare triple {1825#(<= bor_~i~0 1)} assume true; {1825#(<= bor_~i~0 1)} is VALID [2018-11-14 17:07:38,415 INFO L273 TraceCheckUtils]: 48: Hoare triple {1825#(<= bor_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1825#(<= bor_~i~0 1)} is VALID [2018-11-14 17:07:38,418 INFO L273 TraceCheckUtils]: 49: Hoare triple {1825#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1835#(<= bor_~i~0 2)} is VALID [2018-11-14 17:07:38,418 INFO L273 TraceCheckUtils]: 50: Hoare triple {1835#(<= bor_~i~0 2)} assume true; {1835#(<= bor_~i~0 2)} is VALID [2018-11-14 17:07:38,421 INFO L273 TraceCheckUtils]: 51: Hoare triple {1835#(<= bor_~i~0 2)} assume !(~i~0 < 10000); {1679#false} is VALID [2018-11-14 17:07:38,421 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:38,421 INFO L273 TraceCheckUtils]: 53: Hoare triple {1679#false} assume true; {1679#false} is VALID [2018-11-14 17:07:38,421 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1679#false} {1678#true} #77#return; {1679#false} is VALID [2018-11-14 17:07:38,421 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:38,422 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:38,422 INFO L273 TraceCheckUtils]: 57: Hoare triple {1679#false} assume !false; {1679#false} is VALID [2018-11-14 17:07:38,423 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:38,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:38,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-14 17:07:38,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-14 17:07:38,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:38,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:07:38,589 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:38,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:07:38,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:07:38,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:07:38,590 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-11-14 17:07:38,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:38,899 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2018-11-14 17:07:38,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:07:38,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-14 17:07:38,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:38,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:07:38,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2018-11-14 17:07:38,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:07:38,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2018-11-14 17:07:38,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2018-11-14 17:07:39,009 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:39,012 INFO L225 Difference]: With dead ends: 73 [2018-11-14 17:07:39,012 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 17:07:39,013 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:07:39,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 17:07:39,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-14 17:07:39,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:39,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-14 17:07:39,040 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-14 17:07:39,040 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-14 17:07:39,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:39,042 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-14 17:07:39,043 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-14 17:07:39,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:39,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:39,043 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-14 17:07:39,044 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-14 17:07:39,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:39,046 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-14 17:07:39,046 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-14 17:07:39,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:39,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:39,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:39,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:39,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 17:07:39,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-14 17:07:39,050 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 58 [2018-11-14 17:07:39,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:39,050 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-14 17:07:39,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:07:39,050 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-14 17:07:39,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-14 17:07:39,051 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:39,052 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:39,052 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:39,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:39,052 INFO L82 PathProgramCache]: Analyzing trace with hash 375282389, now seen corresponding path program 4 times [2018-11-14 17:07:39,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:39,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:39,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:39,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:39,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:39,358 INFO L256 TraceCheckUtils]: 0: Hoare triple {2121#true} call ULTIMATE.init(); {2121#true} is VALID [2018-11-14 17:07:39,359 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:39,359 INFO L273 TraceCheckUtils]: 2: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:07:39,359 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2121#true} {2121#true} #69#return; {2121#true} is VALID [2018-11-14 17:07:39,360 INFO L256 TraceCheckUtils]: 4: Hoare triple {2121#true} call #t~ret13 := main(); {2121#true} is VALID [2018-11-14 17:07:39,361 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:39,361 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:39,362 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:39,362 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:39,363 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:39,363 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:39,364 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:39,364 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:39,364 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:39,365 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:39,366 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:39,367 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:39,367 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:39,368 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:39,369 INFO L273 TraceCheckUtils]: 19: Hoare triple {2127#(<= main_~i~1 4)} assume !(~i~1 < 10000); {2122#false} is VALID [2018-11-14 17:07:39,369 INFO L256 TraceCheckUtils]: 20: Hoare triple {2122#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {2121#true} is VALID [2018-11-14 17:07:39,370 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:39,370 INFO L273 TraceCheckUtils]: 22: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:07:39,370 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 17:07:39,370 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:39,371 INFO L273 TraceCheckUtils]: 25: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:07:39,371 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 17:07:39,371 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:39,372 INFO L273 TraceCheckUtils]: 28: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:07:39,372 INFO L273 TraceCheckUtils]: 29: Hoare triple {2121#true} assume !(~i~0 < 10000); {2121#true} is VALID [2018-11-14 17:07:39,372 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:39,372 INFO L273 TraceCheckUtils]: 31: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:07:39,372 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2121#true} {2122#false} #73#return; {2122#false} is VALID [2018-11-14 17:07:39,373 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:39,373 INFO L256 TraceCheckUtils]: 34: Hoare triple {2122#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {2121#true} is VALID [2018-11-14 17:07:39,373 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:39,373 INFO L273 TraceCheckUtils]: 36: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:07:39,374 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 17:07:39,374 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:39,374 INFO L273 TraceCheckUtils]: 39: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:07:39,374 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 17:07:39,374 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:39,375 INFO L273 TraceCheckUtils]: 42: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:07:39,375 INFO L273 TraceCheckUtils]: 43: Hoare triple {2121#true} assume !(~i~0 < 10000); {2121#true} is VALID [2018-11-14 17:07:39,375 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:39,375 INFO L273 TraceCheckUtils]: 45: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:07:39,376 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {2121#true} {2122#false} #75#return; {2122#false} is VALID [2018-11-14 17:07:39,376 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:39,376 INFO L273 TraceCheckUtils]: 48: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:39,376 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:39,377 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:39,377 INFO L273 TraceCheckUtils]: 51: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:39,377 INFO L273 TraceCheckUtils]: 52: Hoare triple {2122#false} assume !(~i~2 < 9999); {2122#false} is VALID [2018-11-14 17:07:39,377 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:39,377 INFO L256 TraceCheckUtils]: 54: Hoare triple {2122#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {2121#true} is VALID [2018-11-14 17:07:39,378 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:39,378 INFO L273 TraceCheckUtils]: 56: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:07:39,378 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 17:07:39,378 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:39,378 INFO L273 TraceCheckUtils]: 59: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:07:39,379 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 17:07:39,379 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:39,379 INFO L273 TraceCheckUtils]: 62: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:07:39,379 INFO L273 TraceCheckUtils]: 63: Hoare triple {2121#true} assume !(~i~0 < 10000); {2121#true} is VALID [2018-11-14 17:07:39,380 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:39,380 INFO L273 TraceCheckUtils]: 65: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:07:39,380 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {2121#true} {2122#false} #77#return; {2122#false} is VALID [2018-11-14 17:07:39,380 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:39,380 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:39,381 INFO L273 TraceCheckUtils]: 69: Hoare triple {2122#false} assume !false; {2122#false} is VALID [2018-11-14 17:07:39,386 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:39,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:39,387 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:39,398 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:07:39,457 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:07:39,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:39,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:40,109 INFO L256 TraceCheckUtils]: 0: Hoare triple {2121#true} call ULTIMATE.init(); {2121#true} is VALID [2018-11-14 17:07:40,109 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:40,109 INFO L273 TraceCheckUtils]: 2: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:07:40,110 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2121#true} {2121#true} #69#return; {2121#true} is VALID [2018-11-14 17:07:40,110 INFO L256 TraceCheckUtils]: 4: Hoare triple {2121#true} call #t~ret13 := main(); {2121#true} is VALID [2018-11-14 17:07:40,110 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:40,111 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:40,111 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:40,112 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:40,115 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:40,115 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:40,116 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:40,116 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:40,117 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:40,117 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:40,117 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:40,118 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:40,118 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:40,119 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:40,119 INFO L273 TraceCheckUtils]: 19: Hoare triple {2127#(<= main_~i~1 4)} assume !(~i~1 < 10000); {2122#false} is VALID [2018-11-14 17:07:40,119 INFO L256 TraceCheckUtils]: 20: Hoare triple {2122#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {2122#false} is VALID [2018-11-14 17:07:40,120 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:40,120 INFO L273 TraceCheckUtils]: 22: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:40,120 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 17:07:40,120 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:40,121 INFO L273 TraceCheckUtils]: 25: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:40,121 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 17:07:40,121 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:40,121 INFO L273 TraceCheckUtils]: 28: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:40,121 INFO L273 TraceCheckUtils]: 29: Hoare triple {2122#false} assume !(~i~0 < 10000); {2122#false} is VALID [2018-11-14 17:07:40,122 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:40,122 INFO L273 TraceCheckUtils]: 31: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:40,122 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2122#false} {2122#false} #73#return; {2122#false} is VALID [2018-11-14 17:07:40,122 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:40,122 INFO L256 TraceCheckUtils]: 34: Hoare triple {2122#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {2122#false} is VALID [2018-11-14 17:07:40,122 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:40,122 INFO L273 TraceCheckUtils]: 36: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:40,123 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 17:07:40,123 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:40,123 INFO L273 TraceCheckUtils]: 39: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:40,123 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 17:07:40,123 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:40,123 INFO L273 TraceCheckUtils]: 42: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:40,123 INFO L273 TraceCheckUtils]: 43: Hoare triple {2122#false} assume !(~i~0 < 10000); {2122#false} is VALID [2018-11-14 17:07:40,124 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:40,124 INFO L273 TraceCheckUtils]: 45: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:40,124 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {2122#false} {2122#false} #75#return; {2122#false} is VALID [2018-11-14 17:07:40,124 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:40,124 INFO L273 TraceCheckUtils]: 48: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:40,125 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:40,125 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:40,125 INFO L273 TraceCheckUtils]: 51: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:40,125 INFO L273 TraceCheckUtils]: 52: Hoare triple {2122#false} assume !(~i~2 < 9999); {2122#false} is VALID [2018-11-14 17:07:40,125 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:40,126 INFO L256 TraceCheckUtils]: 54: Hoare triple {2122#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {2122#false} is VALID [2018-11-14 17:07:40,126 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:40,126 INFO L273 TraceCheckUtils]: 56: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:40,126 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 17:07:40,126 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:40,127 INFO L273 TraceCheckUtils]: 59: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:40,127 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 17:07:40,127 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:40,127 INFO L273 TraceCheckUtils]: 62: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:40,127 INFO L273 TraceCheckUtils]: 63: Hoare triple {2122#false} assume !(~i~0 < 10000); {2122#false} is VALID [2018-11-14 17:07:40,127 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:40,128 INFO L273 TraceCheckUtils]: 65: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:07:40,128 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {2122#false} {2122#false} #77#return; {2122#false} is VALID [2018-11-14 17:07:40,128 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:40,128 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:40,128 INFO L273 TraceCheckUtils]: 69: Hoare triple {2122#false} assume !false; {2122#false} is VALID [2018-11-14 17:07:40,133 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:40,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:40,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 17:07:40,163 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-11-14 17:07:40,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:40,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:07:40,264 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:40,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:07:40,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:07:40,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:07:40,265 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 8 states. [2018-11-14 17:07:40,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:40,501 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-14 17:07:40,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:07:40,501 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-11-14 17:07:40,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:40,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:07:40,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2018-11-14 17:07:40,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:07:40,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2018-11-14 17:07:40,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2018-11-14 17:07:40,695 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:40,699 INFO L225 Difference]: With dead ends: 78 [2018-11-14 17:07:40,699 INFO L226 Difference]: Without dead ends: 51 [2018-11-14 17:07:40,700 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:07:40,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-14 17:07:40,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-14 17:07:40,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:40,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 50 states. [2018-11-14 17:07:40,737 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 50 states. [2018-11-14 17:07:40,737 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 50 states. [2018-11-14 17:07:40,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:40,740 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-14 17:07:40,740 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-14 17:07:40,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:40,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:40,741 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 51 states. [2018-11-14 17:07:40,741 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 51 states. [2018-11-14 17:07:40,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:40,743 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-14 17:07:40,743 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-14 17:07:40,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:40,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:40,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:40,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:40,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 17:07:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-14 17:07:40,746 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 70 [2018-11-14 17:07:40,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:40,747 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-14 17:07:40,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:07:40,747 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-14 17:07:40,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-14 17:07:40,748 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:40,748 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:40,748 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:40,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:40,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1521001423, now seen corresponding path program 5 times [2018-11-14 17:07:40,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:40,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:40,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:40,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:40,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:40,982 INFO L256 TraceCheckUtils]: 0: Hoare triple {2615#true} call ULTIMATE.init(); {2615#true} is VALID [2018-11-14 17:07:40,983 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:40,983 INFO L273 TraceCheckUtils]: 2: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:40,983 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2615#true} {2615#true} #69#return; {2615#true} is VALID [2018-11-14 17:07:40,983 INFO L256 TraceCheckUtils]: 4: Hoare triple {2615#true} call #t~ret13 := main(); {2615#true} is VALID [2018-11-14 17:07:40,984 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:40,984 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:40,985 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:40,985 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:40,986 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:40,986 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:40,986 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:40,987 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:40,987 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:40,988 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:40,988 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:40,989 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:40,990 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:40,990 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:40,991 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:40,991 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:40,992 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:40,993 INFO L273 TraceCheckUtils]: 22: Hoare triple {2622#(<= main_~i~1 5)} assume !(~i~1 < 10000); {2616#false} is VALID [2018-11-14 17:07:40,993 INFO L256 TraceCheckUtils]: 23: Hoare triple {2616#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {2615#true} is VALID [2018-11-14 17:07:40,993 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:40,993 INFO L273 TraceCheckUtils]: 25: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:40,994 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 17:07:40,994 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:40,994 INFO L273 TraceCheckUtils]: 28: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:40,994 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 17:07:40,995 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:40,995 INFO L273 TraceCheckUtils]: 31: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:40,995 INFO L273 TraceCheckUtils]: 32: Hoare triple {2615#true} assume !(~i~0 < 10000); {2615#true} is VALID [2018-11-14 17:07:40,995 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:40,995 INFO L273 TraceCheckUtils]: 34: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:40,996 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2615#true} {2616#false} #73#return; {2616#false} is VALID [2018-11-14 17:07:40,996 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:40,996 INFO L256 TraceCheckUtils]: 37: Hoare triple {2616#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {2615#true} is VALID [2018-11-14 17:07:40,996 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:40,997 INFO L273 TraceCheckUtils]: 39: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:40,997 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 17:07:40,997 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:40,997 INFO L273 TraceCheckUtils]: 42: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:40,997 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 17:07:40,997 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:40,998 INFO L273 TraceCheckUtils]: 45: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:40,998 INFO L273 TraceCheckUtils]: 46: Hoare triple {2615#true} assume !(~i~0 < 10000); {2615#true} is VALID [2018-11-14 17:07:40,998 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:40,998 INFO L273 TraceCheckUtils]: 48: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:40,998 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {2615#true} {2616#false} #75#return; {2616#false} is VALID [2018-11-14 17:07:40,998 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:40,998 INFO L273 TraceCheckUtils]: 51: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:07:40,998 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:40,999 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:40,999 INFO L273 TraceCheckUtils]: 54: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:07:40,999 INFO L273 TraceCheckUtils]: 55: Hoare triple {2616#false} assume !(~i~2 < 9999); {2616#false} is VALID [2018-11-14 17:07:40,999 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:40,999 INFO L256 TraceCheckUtils]: 57: Hoare triple {2616#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {2615#true} is VALID [2018-11-14 17:07:40,999 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:41,000 INFO L273 TraceCheckUtils]: 59: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:41,000 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 17:07:41,000 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:41,000 INFO L273 TraceCheckUtils]: 62: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:41,000 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 17:07:41,000 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:41,001 INFO L273 TraceCheckUtils]: 65: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:41,001 INFO L273 TraceCheckUtils]: 66: Hoare triple {2615#true} assume !(~i~0 < 10000); {2615#true} is VALID [2018-11-14 17:07:41,001 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:41,001 INFO L273 TraceCheckUtils]: 68: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:41,001 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {2615#true} {2616#false} #77#return; {2616#false} is VALID [2018-11-14 17:07:41,002 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:41,002 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:41,002 INFO L273 TraceCheckUtils]: 72: Hoare triple {2616#false} assume !false; {2616#false} is VALID [2018-11-14 17:07:41,005 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:41,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:41,006 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:41,023 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:07:41,073 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 17:07:41,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:41,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:41,307 INFO L256 TraceCheckUtils]: 0: Hoare triple {2615#true} call ULTIMATE.init(); {2615#true} is VALID [2018-11-14 17:07:41,307 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:41,308 INFO L273 TraceCheckUtils]: 2: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:41,308 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2615#true} {2615#true} #69#return; {2615#true} is VALID [2018-11-14 17:07:41,308 INFO L256 TraceCheckUtils]: 4: Hoare triple {2615#true} call #t~ret13 := main(); {2615#true} is VALID [2018-11-14 17:07:41,308 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:41,309 INFO L273 TraceCheckUtils]: 6: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:41,309 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:41,309 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:41,309 INFO L273 TraceCheckUtils]: 9: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:41,309 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:41,310 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:41,310 INFO L273 TraceCheckUtils]: 12: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:41,310 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:41,310 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:41,310 INFO L273 TraceCheckUtils]: 15: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:41,310 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:41,310 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:41,311 INFO L273 TraceCheckUtils]: 18: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:41,311 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:41,311 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:41,311 INFO L273 TraceCheckUtils]: 21: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:07:41,311 INFO L273 TraceCheckUtils]: 22: Hoare triple {2615#true} assume !(~i~1 < 10000); {2615#true} is VALID [2018-11-14 17:07:41,311 INFO L256 TraceCheckUtils]: 23: Hoare triple {2615#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {2615#true} is VALID [2018-11-14 17:07:41,312 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#(<= bor_~i~0 1)} is VALID [2018-11-14 17:07:41,312 INFO L273 TraceCheckUtils]: 25: Hoare triple {2698#(<= bor_~i~0 1)} assume true; {2698#(<= bor_~i~0 1)} is VALID [2018-11-14 17:07:41,312 INFO L273 TraceCheckUtils]: 26: Hoare triple {2698#(<= bor_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2698#(<= bor_~i~0 1)} is VALID [2018-11-14 17:07:41,313 INFO L273 TraceCheckUtils]: 27: Hoare triple {2698#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2708#(<= bor_~i~0 2)} is VALID [2018-11-14 17:07:41,313 INFO L273 TraceCheckUtils]: 28: Hoare triple {2708#(<= bor_~i~0 2)} assume true; {2708#(<= bor_~i~0 2)} is VALID [2018-11-14 17:07:41,314 INFO L273 TraceCheckUtils]: 29: Hoare triple {2708#(<= bor_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2708#(<= bor_~i~0 2)} is VALID [2018-11-14 17:07:41,314 INFO L273 TraceCheckUtils]: 30: Hoare triple {2708#(<= bor_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2718#(<= bor_~i~0 3)} is VALID [2018-11-14 17:07:41,314 INFO L273 TraceCheckUtils]: 31: Hoare triple {2718#(<= bor_~i~0 3)} assume true; {2718#(<= bor_~i~0 3)} is VALID [2018-11-14 17:07:41,315 INFO L273 TraceCheckUtils]: 32: Hoare triple {2718#(<= bor_~i~0 3)} assume !(~i~0 < 10000); {2616#false} is VALID [2018-11-14 17:07:41,315 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:41,315 INFO L273 TraceCheckUtils]: 34: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:07:41,316 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2616#false} {2615#true} #73#return; {2616#false} is VALID [2018-11-14 17:07:41,316 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:41,316 INFO L256 TraceCheckUtils]: 37: Hoare triple {2616#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {2616#false} is VALID [2018-11-14 17:07:41,316 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:41,317 INFO L273 TraceCheckUtils]: 39: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:07:41,317 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2616#false} is VALID [2018-11-14 17:07:41,317 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:41,318 INFO L273 TraceCheckUtils]: 42: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:07:41,318 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2616#false} is VALID [2018-11-14 17:07:41,318 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:41,318 INFO L273 TraceCheckUtils]: 45: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:07:41,318 INFO L273 TraceCheckUtils]: 46: Hoare triple {2616#false} assume !(~i~0 < 10000); {2616#false} is VALID [2018-11-14 17:07:41,319 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:41,319 INFO L273 TraceCheckUtils]: 48: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:07:41,319 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {2616#false} {2616#false} #75#return; {2616#false} is VALID [2018-11-14 17:07:41,319 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:41,319 INFO L273 TraceCheckUtils]: 51: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:07:41,320 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:41,320 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:41,320 INFO L273 TraceCheckUtils]: 54: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:07:41,320 INFO L273 TraceCheckUtils]: 55: Hoare triple {2616#false} assume !(~i~2 < 9999); {2616#false} is VALID [2018-11-14 17:07:41,320 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:41,321 INFO L256 TraceCheckUtils]: 57: Hoare triple {2616#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {2616#false} is VALID [2018-11-14 17:07:41,321 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:41,321 INFO L273 TraceCheckUtils]: 59: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:07:41,321 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2616#false} is VALID [2018-11-14 17:07:41,321 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:41,321 INFO L273 TraceCheckUtils]: 62: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:07:41,322 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2616#false} is VALID [2018-11-14 17:07:41,322 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:41,322 INFO L273 TraceCheckUtils]: 65: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:07:41,322 INFO L273 TraceCheckUtils]: 66: Hoare triple {2616#false} assume !(~i~0 < 10000); {2616#false} is VALID [2018-11-14 17:07:41,322 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:41,323 INFO L273 TraceCheckUtils]: 68: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:07:41,323 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {2616#false} {2616#false} #77#return; {2616#false} is VALID [2018-11-14 17:07:41,323 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:41,323 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:41,323 INFO L273 TraceCheckUtils]: 72: Hoare triple {2616#false} assume !false; {2616#false} is VALID [2018-11-14 17:07:41,326 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:41,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:41,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-14 17:07:41,357 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2018-11-14 17:07:41,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:41,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 17:07:41,528 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:41,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 17:07:41,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 17:07:41,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:07:41,529 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 11 states. [2018-11-14 17:07:42,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:42,286 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2018-11-14 17:07:42,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 17:07:42,286 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2018-11-14 17:07:42,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:42,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:07:42,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2018-11-14 17:07:42,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:07:42,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2018-11-14 17:07:42,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 88 transitions. [2018-11-14 17:07:42,384 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:42,386 INFO L225 Difference]: With dead ends: 85 [2018-11-14 17:07:42,386 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 17:07:42,388 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:07:42,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 17:07:42,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-11-14 17:07:42,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:42,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 56 states. [2018-11-14 17:07:42,404 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 56 states. [2018-11-14 17:07:42,404 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 56 states. [2018-11-14 17:07:42,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:42,407 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-11-14 17:07:42,407 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-14 17:07:42,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:42,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:42,408 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 58 states. [2018-11-14 17:07:42,408 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 58 states. [2018-11-14 17:07:42,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:42,410 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-11-14 17:07:42,410 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-14 17:07:42,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:42,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:42,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:42,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:42,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 17:07:42,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-14 17:07:42,413 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 73 [2018-11-14 17:07:42,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:42,414 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-14 17:07:42,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 17:07:42,414 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-14 17:07:42,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-14 17:07:42,415 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:42,416 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:42,416 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:42,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:42,416 INFO L82 PathProgramCache]: Analyzing trace with hash -335328825, now seen corresponding path program 6 times [2018-11-14 17:07:42,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:42,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:42,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:42,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:42,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:42,908 INFO L256 TraceCheckUtils]: 0: Hoare triple {3152#true} call ULTIMATE.init(); {3152#true} is VALID [2018-11-14 17:07:42,909 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:42,909 INFO L273 TraceCheckUtils]: 2: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:42,909 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3152#true} {3152#true} #69#return; {3152#true} is VALID [2018-11-14 17:07:42,910 INFO L256 TraceCheckUtils]: 4: Hoare triple {3152#true} call #t~ret13 := main(); {3152#true} is VALID [2018-11-14 17:07:42,910 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:42,911 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:42,911 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:42,912 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:42,912 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:42,912 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:42,913 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:42,913 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:42,914 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:42,914 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:42,915 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:42,915 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:42,916 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:42,917 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:42,917 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:42,918 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:42,919 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:42,919 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:42,920 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:42,921 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:42,921 INFO L273 TraceCheckUtils]: 25: Hoare triple {3160#(<= main_~i~1 6)} assume !(~i~1 < 10000); {3153#false} is VALID [2018-11-14 17:07:42,921 INFO L256 TraceCheckUtils]: 26: Hoare triple {3153#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {3152#true} is VALID [2018-11-14 17:07:42,922 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:42,922 INFO L273 TraceCheckUtils]: 28: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:42,922 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:42,922 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:42,922 INFO L273 TraceCheckUtils]: 31: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:42,923 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:42,923 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:42,923 INFO L273 TraceCheckUtils]: 34: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:42,923 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:42,924 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:42,924 INFO L273 TraceCheckUtils]: 37: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:42,924 INFO L273 TraceCheckUtils]: 38: Hoare triple {3152#true} assume !(~i~0 < 10000); {3152#true} is VALID [2018-11-14 17:07:42,924 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:42,924 INFO L273 TraceCheckUtils]: 40: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:42,925 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {3152#true} {3153#false} #73#return; {3153#false} is VALID [2018-11-14 17:07:42,925 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:42,925 INFO L256 TraceCheckUtils]: 43: Hoare triple {3153#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {3152#true} is VALID [2018-11-14 17:07:42,925 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:42,925 INFO L273 TraceCheckUtils]: 45: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:42,926 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:42,926 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:42,926 INFO L273 TraceCheckUtils]: 48: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:42,926 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:42,926 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:42,926 INFO L273 TraceCheckUtils]: 51: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:42,926 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:42,927 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:42,927 INFO L273 TraceCheckUtils]: 54: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:42,927 INFO L273 TraceCheckUtils]: 55: Hoare triple {3152#true} assume !(~i~0 < 10000); {3152#true} is VALID [2018-11-14 17:07:42,927 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:42,927 INFO L273 TraceCheckUtils]: 57: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:42,927 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {3152#true} {3153#false} #75#return; {3153#false} is VALID [2018-11-14 17:07:42,927 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:42,927 INFO L273 TraceCheckUtils]: 60: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 17:07:42,928 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:42,928 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:42,928 INFO L273 TraceCheckUtils]: 63: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 17:07:42,928 INFO L273 TraceCheckUtils]: 64: Hoare triple {3153#false} assume !(~i~2 < 9999); {3153#false} is VALID [2018-11-14 17:07:42,928 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:42,928 INFO L256 TraceCheckUtils]: 66: Hoare triple {3153#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {3152#true} is VALID [2018-11-14 17:07:42,928 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:42,928 INFO L273 TraceCheckUtils]: 68: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:42,928 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:42,929 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:42,929 INFO L273 TraceCheckUtils]: 71: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:42,929 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:42,929 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:42,929 INFO L273 TraceCheckUtils]: 74: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:42,929 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:42,929 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:42,929 INFO L273 TraceCheckUtils]: 77: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:42,930 INFO L273 TraceCheckUtils]: 78: Hoare triple {3152#true} assume !(~i~0 < 10000); {3152#true} is VALID [2018-11-14 17:07:42,930 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:42,930 INFO L273 TraceCheckUtils]: 80: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:42,930 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {3152#true} {3153#false} #77#return; {3153#false} is VALID [2018-11-14 17:07:42,930 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:42,930 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:42,930 INFO L273 TraceCheckUtils]: 84: Hoare triple {3153#false} assume !false; {3153#false} is VALID [2018-11-14 17:07:42,934 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:42,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:42,935 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:42,943 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:07:42,989 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-14 17:07:42,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:43,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:43,320 INFO L256 TraceCheckUtils]: 0: Hoare triple {3152#true} call ULTIMATE.init(); {3152#true} is VALID [2018-11-14 17:07:43,321 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:43,321 INFO L273 TraceCheckUtils]: 2: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:43,321 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3152#true} {3152#true} #69#return; {3152#true} is VALID [2018-11-14 17:07:43,321 INFO L256 TraceCheckUtils]: 4: Hoare triple {3152#true} call #t~ret13 := main(); {3152#true} is VALID [2018-11-14 17:07:43,321 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:43,322 INFO L273 TraceCheckUtils]: 6: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:43,322 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:43,322 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:43,322 INFO L273 TraceCheckUtils]: 9: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:43,322 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:43,323 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:43,323 INFO L273 TraceCheckUtils]: 12: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:43,323 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:43,323 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:43,323 INFO L273 TraceCheckUtils]: 15: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:43,323 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:43,324 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:43,324 INFO L273 TraceCheckUtils]: 18: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:43,324 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:43,324 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:43,324 INFO L273 TraceCheckUtils]: 21: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:43,324 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:43,324 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:43,325 INFO L273 TraceCheckUtils]: 24: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:43,325 INFO L273 TraceCheckUtils]: 25: Hoare triple {3152#true} assume !(~i~1 < 10000); {3152#true} is VALID [2018-11-14 17:07:43,325 INFO L256 TraceCheckUtils]: 26: Hoare triple {3152#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {3152#true} is VALID [2018-11-14 17:07:43,325 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:43,325 INFO L273 TraceCheckUtils]: 28: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:43,325 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:43,326 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:43,326 INFO L273 TraceCheckUtils]: 31: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:43,326 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:43,326 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:43,326 INFO L273 TraceCheckUtils]: 34: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:43,326 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:43,326 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:43,326 INFO L273 TraceCheckUtils]: 37: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:43,326 INFO L273 TraceCheckUtils]: 38: Hoare triple {3152#true} assume !(~i~0 < 10000); {3152#true} is VALID [2018-11-14 17:07:43,327 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:43,327 INFO L273 TraceCheckUtils]: 40: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:43,327 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {3152#true} {3152#true} #73#return; {3152#true} is VALID [2018-11-14 17:07:43,327 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:43,327 INFO L256 TraceCheckUtils]: 43: Hoare triple {3152#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {3152#true} is VALID [2018-11-14 17:07:43,327 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:43,327 INFO L273 TraceCheckUtils]: 45: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:43,327 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:43,328 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:43,328 INFO L273 TraceCheckUtils]: 48: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:43,328 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:43,328 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:43,328 INFO L273 TraceCheckUtils]: 51: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:43,328 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:43,329 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:43,329 INFO L273 TraceCheckUtils]: 54: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:43,329 INFO L273 TraceCheckUtils]: 55: Hoare triple {3152#true} assume !(~i~0 < 10000); {3152#true} is VALID [2018-11-14 17:07:43,329 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:43,329 INFO L273 TraceCheckUtils]: 57: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:43,329 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {3152#true} {3152#true} #75#return; {3152#true} is VALID [2018-11-14 17:07:43,339 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:43,339 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:43,341 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:43,343 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:43,343 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:43,345 INFO L273 TraceCheckUtils]: 64: Hoare triple {3351#(<= main_~i~2 1)} assume !(~i~2 < 9999); {3153#false} is VALID [2018-11-14 17:07:43,345 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:43,345 INFO L256 TraceCheckUtils]: 66: Hoare triple {3153#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {3153#false} is VALID [2018-11-14 17:07:43,345 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:43,345 INFO L273 TraceCheckUtils]: 68: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 17:07:43,345 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3153#false} is VALID [2018-11-14 17:07:43,345 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:43,346 INFO L273 TraceCheckUtils]: 71: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 17:07:43,346 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3153#false} is VALID [2018-11-14 17:07:43,346 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:43,346 INFO L273 TraceCheckUtils]: 74: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 17:07:43,346 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3153#false} is VALID [2018-11-14 17:07:43,346 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:43,346 INFO L273 TraceCheckUtils]: 77: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 17:07:43,347 INFO L273 TraceCheckUtils]: 78: Hoare triple {3153#false} assume !(~i~0 < 10000); {3153#false} is VALID [2018-11-14 17:07:43,347 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:43,347 INFO L273 TraceCheckUtils]: 80: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 17:07:43,347 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {3153#false} {3153#false} #77#return; {3153#false} is VALID [2018-11-14 17:07:43,347 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:43,347 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:43,347 INFO L273 TraceCheckUtils]: 84: Hoare triple {3153#false} assume !false; {3153#false} is VALID [2018-11-14 17:07:43,351 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:43,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:43,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-11-14 17:07:43,374 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-11-14 17:07:43,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:43,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 17:07:43,457 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:43,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 17:07:43,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 17:07:43,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:07:43,458 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 11 states. [2018-11-14 17:07:43,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:43,854 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2018-11-14 17:07:43,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 17:07:43,854 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-11-14 17:07:43,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:43,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:07:43,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2018-11-14 17:07:43,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:07:43,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2018-11-14 17:07:43,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 85 transitions. [2018-11-14 17:07:43,972 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:43,973 INFO L225 Difference]: With dead ends: 94 [2018-11-14 17:07:43,974 INFO L226 Difference]: Without dead ends: 64 [2018-11-14 17:07:43,975 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:43,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-14 17:07:43,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-11-14 17:07:43,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:43,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 62 states. [2018-11-14 17:07:43,998 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 62 states. [2018-11-14 17:07:43,999 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 62 states. [2018-11-14 17:07:44,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:44,001 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-14 17:07:44,001 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-14 17:07:44,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:44,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:44,002 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 64 states. [2018-11-14 17:07:44,002 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 64 states. [2018-11-14 17:07:44,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:44,004 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-14 17:07:44,004 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-14 17:07:44,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:44,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:44,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:44,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:44,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-14 17:07:44,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-11-14 17:07:44,007 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 85 [2018-11-14 17:07:44,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:44,007 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-11-14 17:07:44,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 17:07:44,007 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-11-14 17:07:44,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-14 17:07:44,008 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:44,009 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:44,009 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:44,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:44,009 INFO L82 PathProgramCache]: Analyzing trace with hash 318027935, now seen corresponding path program 7 times [2018-11-14 17:07:44,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:44,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:44,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:44,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:44,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:44,196 INFO L256 TraceCheckUtils]: 0: Hoare triple {3757#true} call ULTIMATE.init(); {3757#true} is VALID [2018-11-14 17:07:44,196 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:44,196 INFO L273 TraceCheckUtils]: 2: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:44,197 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3757#true} {3757#true} #69#return; {3757#true} is VALID [2018-11-14 17:07:44,197 INFO L256 TraceCheckUtils]: 4: Hoare triple {3757#true} call #t~ret13 := main(); {3757#true} is VALID [2018-11-14 17:07:44,198 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:44,198 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:44,198 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:44,199 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:44,199 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:44,199 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:44,200 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:44,200 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:44,201 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:44,201 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:44,202 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:44,202 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:44,203 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:44,204 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:44,204 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:44,205 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:44,206 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:44,206 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:44,207 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:44,208 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:44,208 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:44,209 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:44,209 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:44,210 INFO L273 TraceCheckUtils]: 28: Hoare triple {3766#(<= main_~i~1 7)} assume !(~i~1 < 10000); {3758#false} is VALID [2018-11-14 17:07:44,210 INFO L256 TraceCheckUtils]: 29: Hoare triple {3758#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {3757#true} is VALID [2018-11-14 17:07:44,211 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:44,211 INFO L273 TraceCheckUtils]: 31: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:44,211 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 17:07:44,211 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:44,211 INFO L273 TraceCheckUtils]: 34: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:44,212 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 17:07:44,212 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:44,212 INFO L273 TraceCheckUtils]: 37: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:44,212 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 17:07:44,212 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:44,213 INFO L273 TraceCheckUtils]: 40: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:44,213 INFO L273 TraceCheckUtils]: 41: Hoare triple {3757#true} assume !(~i~0 < 10000); {3757#true} is VALID [2018-11-14 17:07:44,213 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:44,213 INFO L273 TraceCheckUtils]: 43: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:44,213 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {3757#true} {3758#false} #73#return; {3758#false} is VALID [2018-11-14 17:07:44,214 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:44,214 INFO L256 TraceCheckUtils]: 46: Hoare triple {3758#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {3757#true} is VALID [2018-11-14 17:07:44,214 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:44,214 INFO L273 TraceCheckUtils]: 48: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:44,214 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 17:07:44,215 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:44,215 INFO L273 TraceCheckUtils]: 51: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:44,215 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 17:07:44,215 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:44,215 INFO L273 TraceCheckUtils]: 54: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:44,215 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 17:07:44,215 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:44,215 INFO L273 TraceCheckUtils]: 57: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:44,215 INFO L273 TraceCheckUtils]: 58: Hoare triple {3757#true} assume !(~i~0 < 10000); {3757#true} is VALID [2018-11-14 17:07:44,216 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:44,216 INFO L273 TraceCheckUtils]: 60: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:44,216 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {3757#true} {3758#false} #75#return; {3758#false} is VALID [2018-11-14 17:07:44,216 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:44,216 INFO L273 TraceCheckUtils]: 63: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:44,216 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:44,216 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:44,216 INFO L273 TraceCheckUtils]: 66: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:44,217 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:44,217 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:44,217 INFO L273 TraceCheckUtils]: 69: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:44,217 INFO L273 TraceCheckUtils]: 70: Hoare triple {3758#false} assume !(~i~2 < 9999); {3758#false} is VALID [2018-11-14 17:07:44,217 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:44,217 INFO L256 TraceCheckUtils]: 72: Hoare triple {3758#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {3757#true} is VALID [2018-11-14 17:07:44,217 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:44,217 INFO L273 TraceCheckUtils]: 74: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:44,218 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 17:07:44,218 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:44,218 INFO L273 TraceCheckUtils]: 77: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:44,218 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 17:07:44,218 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:44,218 INFO L273 TraceCheckUtils]: 80: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:44,218 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 17:07:44,218 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:44,218 INFO L273 TraceCheckUtils]: 83: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:44,219 INFO L273 TraceCheckUtils]: 84: Hoare triple {3757#true} assume !(~i~0 < 10000); {3757#true} is VALID [2018-11-14 17:07:44,219 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:44,219 INFO L273 TraceCheckUtils]: 86: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:44,219 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {3757#true} {3758#false} #77#return; {3758#false} is VALID [2018-11-14 17:07:44,219 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:44,219 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:44,219 INFO L273 TraceCheckUtils]: 90: Hoare triple {3758#false} assume !false; {3758#false} is VALID [2018-11-14 17:07:44,224 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:44,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:44,224 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:44,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:07:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:44,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:44,466 INFO L256 TraceCheckUtils]: 0: Hoare triple {3757#true} call ULTIMATE.init(); {3757#true} is VALID [2018-11-14 17:07:44,466 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:44,466 INFO L273 TraceCheckUtils]: 2: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:44,467 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3757#true} {3757#true} #69#return; {3757#true} is VALID [2018-11-14 17:07:44,467 INFO L256 TraceCheckUtils]: 4: Hoare triple {3757#true} call #t~ret13 := main(); {3757#true} is VALID [2018-11-14 17:07:44,468 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:44,468 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:44,468 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:44,469 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:44,469 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:44,470 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:44,470 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:44,471 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:44,471 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:44,472 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:44,473 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:44,473 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:44,474 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:44,475 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:44,475 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:44,476 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:44,477 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:44,477 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:44,478 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:44,479 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:44,480 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:44,480 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:44,481 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:44,482 INFO L273 TraceCheckUtils]: 28: Hoare triple {3766#(<= main_~i~1 7)} assume !(~i~1 < 10000); {3758#false} is VALID [2018-11-14 17:07:44,482 INFO L256 TraceCheckUtils]: 29: Hoare triple {3758#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {3758#false} is VALID [2018-11-14 17:07:44,482 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:44,483 INFO L273 TraceCheckUtils]: 31: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:44,483 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 17:07:44,483 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:44,484 INFO L273 TraceCheckUtils]: 34: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:44,484 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 17:07:44,484 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:44,484 INFO L273 TraceCheckUtils]: 37: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:44,485 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 17:07:44,485 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:44,485 INFO L273 TraceCheckUtils]: 40: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:44,485 INFO L273 TraceCheckUtils]: 41: Hoare triple {3758#false} assume !(~i~0 < 10000); {3758#false} is VALID [2018-11-14 17:07:44,486 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:44,486 INFO L273 TraceCheckUtils]: 43: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:44,486 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {3758#false} {3758#false} #73#return; {3758#false} is VALID [2018-11-14 17:07:44,486 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:44,486 INFO L256 TraceCheckUtils]: 46: Hoare triple {3758#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {3758#false} is VALID [2018-11-14 17:07:44,486 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:44,487 INFO L273 TraceCheckUtils]: 48: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:44,487 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 17:07:44,487 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:44,487 INFO L273 TraceCheckUtils]: 51: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:44,487 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 17:07:44,487 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:44,488 INFO L273 TraceCheckUtils]: 54: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:44,488 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 17:07:44,488 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:44,488 INFO L273 TraceCheckUtils]: 57: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:44,488 INFO L273 TraceCheckUtils]: 58: Hoare triple {3758#false} assume !(~i~0 < 10000); {3758#false} is VALID [2018-11-14 17:07:44,488 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:44,488 INFO L273 TraceCheckUtils]: 60: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:44,489 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {3758#false} {3758#false} #75#return; {3758#false} is VALID [2018-11-14 17:07:44,489 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:44,489 INFO L273 TraceCheckUtils]: 63: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:44,489 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:44,489 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:44,489 INFO L273 TraceCheckUtils]: 66: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:44,490 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:44,490 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:44,490 INFO L273 TraceCheckUtils]: 69: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:44,490 INFO L273 TraceCheckUtils]: 70: Hoare triple {3758#false} assume !(~i~2 < 9999); {3758#false} is VALID [2018-11-14 17:07:44,490 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:44,490 INFO L256 TraceCheckUtils]: 72: Hoare triple {3758#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {3758#false} is VALID [2018-11-14 17:07:44,490 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:44,491 INFO L273 TraceCheckUtils]: 74: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:44,491 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 17:07:44,491 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:44,491 INFO L273 TraceCheckUtils]: 77: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:44,491 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 17:07:44,491 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:44,491 INFO L273 TraceCheckUtils]: 80: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:44,492 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 17:07:44,492 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:44,492 INFO L273 TraceCheckUtils]: 83: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:44,492 INFO L273 TraceCheckUtils]: 84: Hoare triple {3758#false} assume !(~i~0 < 10000); {3758#false} is VALID [2018-11-14 17:07:44,492 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:44,492 INFO L273 TraceCheckUtils]: 86: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:44,493 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {3758#false} {3758#false} #77#return; {3758#false} is VALID [2018-11-14 17:07:44,493 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:44,493 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:44,493 INFO L273 TraceCheckUtils]: 90: Hoare triple {3758#false} assume !false; {3758#false} is VALID [2018-11-14 17:07:44,499 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:44,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:44,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 17:07:44,520 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2018-11-14 17:07:44,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:44,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 17:07:44,593 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:44,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 17:07:44,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 17:07:44,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:07:44,594 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 11 states. [2018-11-14 17:07:44,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:44,902 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-11-14 17:07:44,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 17:07:44,902 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2018-11-14 17:07:44,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:44,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:07:44,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2018-11-14 17:07:44,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:07:44,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2018-11-14 17:07:44,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2018-11-14 17:07:45,019 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:45,021 INFO L225 Difference]: With dead ends: 99 [2018-11-14 17:07:45,021 INFO L226 Difference]: Without dead ends: 66 [2018-11-14 17:07:45,022 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:45,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-14 17:07:45,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-11-14 17:07:45,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:45,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 65 states. [2018-11-14 17:07:45,135 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 65 states. [2018-11-14 17:07:45,135 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 65 states. [2018-11-14 17:07:45,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:45,136 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-14 17:07:45,137 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-14 17:07:45,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:45,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:45,137 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 66 states. [2018-11-14 17:07:45,137 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 66 states. [2018-11-14 17:07:45,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:45,139 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-14 17:07:45,139 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-14 17:07:45,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:45,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:45,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:45,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-14 17:07:45,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-11-14 17:07:45,142 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 91 [2018-11-14 17:07:45,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:45,142 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-11-14 17:07:45,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 17:07:45,142 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-14 17:07:45,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-14 17:07:45,143 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:45,144 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:45,144 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:45,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:45,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1006612453, now seen corresponding path program 8 times [2018-11-14 17:07:45,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:45,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:45,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:45,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:07:45,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:45,778 INFO L256 TraceCheckUtils]: 0: Hoare triple {4395#true} call ULTIMATE.init(); {4395#true} is VALID [2018-11-14 17:07:45,779 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:45,779 INFO L273 TraceCheckUtils]: 2: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:45,779 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4395#true} {4395#true} #69#return; {4395#true} is VALID [2018-11-14 17:07:45,780 INFO L256 TraceCheckUtils]: 4: Hoare triple {4395#true} call #t~ret13 := main(); {4395#true} is VALID [2018-11-14 17:07:45,780 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:45,781 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:45,781 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:45,781 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:45,782 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:45,782 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:45,783 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:45,783 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:45,784 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:45,785 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:45,785 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:45,786 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:45,786 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:45,787 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:45,788 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:45,788 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:45,789 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:45,789 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:45,790 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:45,791 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:45,791 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:45,792 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:45,793 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:45,793 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:45,794 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:45,794 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:45,795 INFO L273 TraceCheckUtils]: 31: Hoare triple {4405#(<= main_~i~1 8)} assume !(~i~1 < 10000); {4396#false} is VALID [2018-11-14 17:07:45,795 INFO L256 TraceCheckUtils]: 32: Hoare triple {4396#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {4395#true} is VALID [2018-11-14 17:07:45,796 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:45,796 INFO L273 TraceCheckUtils]: 34: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:45,796 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 17:07:45,796 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:45,796 INFO L273 TraceCheckUtils]: 37: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:45,797 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 17:07:45,797 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:45,797 INFO L273 TraceCheckUtils]: 40: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:45,797 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 17:07:45,797 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:45,797 INFO L273 TraceCheckUtils]: 43: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:45,798 INFO L273 TraceCheckUtils]: 44: Hoare triple {4395#true} assume !(~i~0 < 10000); {4395#true} is VALID [2018-11-14 17:07:45,798 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:45,798 INFO L273 TraceCheckUtils]: 46: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:45,798 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {4395#true} {4396#false} #73#return; {4396#false} is VALID [2018-11-14 17:07:45,798 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:45,798 INFO L256 TraceCheckUtils]: 49: Hoare triple {4396#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {4395#true} is VALID [2018-11-14 17:07:45,798 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:45,798 INFO L273 TraceCheckUtils]: 51: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:45,799 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 17:07:45,799 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:45,799 INFO L273 TraceCheckUtils]: 54: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:45,799 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 17:07:45,799 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:45,799 INFO L273 TraceCheckUtils]: 57: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:45,799 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 17:07:45,799 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:45,799 INFO L273 TraceCheckUtils]: 60: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:45,800 INFO L273 TraceCheckUtils]: 61: Hoare triple {4395#true} assume !(~i~0 < 10000); {4395#true} is VALID [2018-11-14 17:07:45,800 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:45,800 INFO L273 TraceCheckUtils]: 63: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:45,800 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {4395#true} {4396#false} #75#return; {4396#false} is VALID [2018-11-14 17:07:45,800 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:45,800 INFO L273 TraceCheckUtils]: 66: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:45,800 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:45,800 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:45,801 INFO L273 TraceCheckUtils]: 69: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:45,801 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:45,801 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:45,801 INFO L273 TraceCheckUtils]: 72: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:45,801 INFO L273 TraceCheckUtils]: 73: Hoare triple {4396#false} assume !(~i~2 < 9999); {4396#false} is VALID [2018-11-14 17:07:45,801 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:45,801 INFO L256 TraceCheckUtils]: 75: Hoare triple {4396#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {4395#true} is VALID [2018-11-14 17:07:45,801 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:45,802 INFO L273 TraceCheckUtils]: 77: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:45,802 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 17:07:45,802 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:45,802 INFO L273 TraceCheckUtils]: 80: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:45,802 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 17:07:45,802 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:45,802 INFO L273 TraceCheckUtils]: 83: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:45,802 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 17:07:45,802 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:45,803 INFO L273 TraceCheckUtils]: 86: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:45,803 INFO L273 TraceCheckUtils]: 87: Hoare triple {4395#true} assume !(~i~0 < 10000); {4395#true} is VALID [2018-11-14 17:07:45,803 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:45,803 INFO L273 TraceCheckUtils]: 89: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:45,803 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {4395#true} {4396#false} #77#return; {4396#false} is VALID [2018-11-14 17:07:45,803 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:45,803 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:45,803 INFO L273 TraceCheckUtils]: 93: Hoare triple {4396#false} assume !false; {4396#false} is VALID [2018-11-14 17:07:45,808 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:45,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:45,809 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:45,817 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:07:45,857 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:07:45,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:45,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:46,015 INFO L256 TraceCheckUtils]: 0: Hoare triple {4395#true} call ULTIMATE.init(); {4395#true} is VALID [2018-11-14 17:07:46,016 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:46,016 INFO L273 TraceCheckUtils]: 2: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:46,016 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4395#true} {4395#true} #69#return; {4395#true} is VALID [2018-11-14 17:07:46,016 INFO L256 TraceCheckUtils]: 4: Hoare triple {4395#true} call #t~ret13 := main(); {4395#true} is VALID [2018-11-14 17:07:46,017 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:46,018 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:46,018 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:46,019 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:46,019 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:46,020 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:46,020 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:46,020 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:46,021 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:46,022 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:46,022 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:46,023 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:46,024 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:46,025 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:46,025 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:46,026 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:46,027 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:46,027 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:46,028 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:46,029 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:46,030 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:46,030 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:46,031 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:46,032 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:46,033 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:46,033 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:46,034 INFO L273 TraceCheckUtils]: 31: Hoare triple {4405#(<= main_~i~1 8)} assume !(~i~1 < 10000); {4396#false} is VALID [2018-11-14 17:07:46,034 INFO L256 TraceCheckUtils]: 32: Hoare triple {4396#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {4396#false} is VALID [2018-11-14 17:07:46,035 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:46,035 INFO L273 TraceCheckUtils]: 34: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:46,035 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 17:07:46,035 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:46,036 INFO L273 TraceCheckUtils]: 37: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:46,036 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 17:07:46,036 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:46,036 INFO L273 TraceCheckUtils]: 40: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:46,037 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 17:07:46,037 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:46,037 INFO L273 TraceCheckUtils]: 43: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:46,037 INFO L273 TraceCheckUtils]: 44: Hoare triple {4396#false} assume !(~i~0 < 10000); {4396#false} is VALID [2018-11-14 17:07:46,037 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:46,037 INFO L273 TraceCheckUtils]: 46: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:46,038 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {4396#false} {4396#false} #73#return; {4396#false} is VALID [2018-11-14 17:07:46,038 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:46,038 INFO L256 TraceCheckUtils]: 49: Hoare triple {4396#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {4396#false} is VALID [2018-11-14 17:07:46,038 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:46,038 INFO L273 TraceCheckUtils]: 51: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:46,038 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 17:07:46,039 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:46,039 INFO L273 TraceCheckUtils]: 54: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:46,039 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 17:07:46,039 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:46,039 INFO L273 TraceCheckUtils]: 57: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:46,039 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 17:07:46,039 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:46,040 INFO L273 TraceCheckUtils]: 60: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:46,040 INFO L273 TraceCheckUtils]: 61: Hoare triple {4396#false} assume !(~i~0 < 10000); {4396#false} is VALID [2018-11-14 17:07:46,040 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:46,040 INFO L273 TraceCheckUtils]: 63: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:46,040 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {4396#false} {4396#false} #75#return; {4396#false} is VALID [2018-11-14 17:07:46,040 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:46,041 INFO L273 TraceCheckUtils]: 66: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:46,041 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:46,041 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:46,041 INFO L273 TraceCheckUtils]: 69: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:46,041 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:46,041 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:46,041 INFO L273 TraceCheckUtils]: 72: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:46,042 INFO L273 TraceCheckUtils]: 73: Hoare triple {4396#false} assume !(~i~2 < 9999); {4396#false} is VALID [2018-11-14 17:07:46,042 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:46,042 INFO L256 TraceCheckUtils]: 75: Hoare triple {4396#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {4396#false} is VALID [2018-11-14 17:07:46,042 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:46,042 INFO L273 TraceCheckUtils]: 77: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:46,042 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 17:07:46,042 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:46,043 INFO L273 TraceCheckUtils]: 80: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:46,043 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 17:07:46,043 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:46,043 INFO L273 TraceCheckUtils]: 83: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:46,043 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 17:07:46,043 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:46,044 INFO L273 TraceCheckUtils]: 86: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:46,044 INFO L273 TraceCheckUtils]: 87: Hoare triple {4396#false} assume !(~i~0 < 10000); {4396#false} is VALID [2018-11-14 17:07:46,044 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:46,044 INFO L273 TraceCheckUtils]: 89: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:46,044 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {4396#false} {4396#false} #77#return; {4396#false} is VALID [2018-11-14 17:07:46,044 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:46,044 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:46,045 INFO L273 TraceCheckUtils]: 93: Hoare triple {4396#false} assume !false; {4396#false} is VALID [2018-11-14 17:07:46,053 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:46,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:46,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 17:07:46,075 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-11-14 17:07:46,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:46,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 17:07:46,173 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:46,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 17:07:46,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 17:07:46,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:07:46,174 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 12 states. [2018-11-14 17:07:46,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:46,492 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2018-11-14 17:07:46,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 17:07:46,492 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-11-14 17:07:46,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:46,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:07:46,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2018-11-14 17:07:46,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:07:46,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2018-11-14 17:07:46,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 84 transitions. [2018-11-14 17:07:46,675 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:46,677 INFO L225 Difference]: With dead ends: 102 [2018-11-14 17:07:46,678 INFO L226 Difference]: Without dead ends: 69 [2018-11-14 17:07:46,678 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:07:46,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-14 17:07:46,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-11-14 17:07:46,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:46,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 68 states. [2018-11-14 17:07:46,736 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 68 states. [2018-11-14 17:07:46,736 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 68 states. [2018-11-14 17:07:46,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:46,739 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-14 17:07:46,739 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-14 17:07:46,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:46,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:46,740 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 69 states. [2018-11-14 17:07:46,740 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 69 states. [2018-11-14 17:07:46,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:46,741 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-14 17:07:46,741 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-14 17:07:46,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:46,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:46,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:46,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:46,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-14 17:07:46,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-11-14 17:07:46,744 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 94 [2018-11-14 17:07:46,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:46,744 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-14 17:07:46,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 17:07:46,745 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-14 17:07:46,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-14 17:07:46,746 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:46,746 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:46,746 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:46,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:46,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1864182495, now seen corresponding path program 9 times [2018-11-14 17:07:46,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:46,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:46,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:46,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:46,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:47,171 INFO L256 TraceCheckUtils]: 0: Hoare triple {5057#true} call ULTIMATE.init(); {5057#true} is VALID [2018-11-14 17:07:47,171 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:47,171 INFO L273 TraceCheckUtils]: 2: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,172 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5057#true} {5057#true} #69#return; {5057#true} is VALID [2018-11-14 17:07:47,172 INFO L256 TraceCheckUtils]: 4: Hoare triple {5057#true} call #t~ret13 := main(); {5057#true} is VALID [2018-11-14 17:07:47,172 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:47,173 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:47,173 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:47,174 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:47,174 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:47,174 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:47,175 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:47,175 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:47,176 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:47,177 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:47,177 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:47,178 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:47,178 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:47,179 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:47,180 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:47,180 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:47,181 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:47,181 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:47,182 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:47,183 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:47,183 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:47,184 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:47,185 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:47,185 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:47,186 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:47,186 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:47,187 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:47,188 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:47,188 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:47,189 INFO L273 TraceCheckUtils]: 34: Hoare triple {5068#(<= main_~i~1 9)} assume !(~i~1 < 10000); {5058#false} is VALID [2018-11-14 17:07:47,189 INFO L256 TraceCheckUtils]: 35: Hoare triple {5058#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 17:07:47,189 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:47,190 INFO L273 TraceCheckUtils]: 37: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,190 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:47,190 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:47,190 INFO L273 TraceCheckUtils]: 40: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,190 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:47,191 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:47,191 INFO L273 TraceCheckUtils]: 43: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,191 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:47,191 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:47,191 INFO L273 TraceCheckUtils]: 46: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,192 INFO L273 TraceCheckUtils]: 47: Hoare triple {5057#true} assume !(~i~0 < 10000); {5057#true} is VALID [2018-11-14 17:07:47,192 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:47,192 INFO L273 TraceCheckUtils]: 49: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,192 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {5057#true} {5058#false} #73#return; {5058#false} is VALID [2018-11-14 17:07:47,192 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:47,193 INFO L256 TraceCheckUtils]: 52: Hoare triple {5058#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 17:07:47,193 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:47,193 INFO L273 TraceCheckUtils]: 54: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,194 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:47,194 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:47,194 INFO L273 TraceCheckUtils]: 57: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,194 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:47,194 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:47,195 INFO L273 TraceCheckUtils]: 60: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,195 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:47,195 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:47,195 INFO L273 TraceCheckUtils]: 63: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,195 INFO L273 TraceCheckUtils]: 64: Hoare triple {5057#true} assume !(~i~0 < 10000); {5057#true} is VALID [2018-11-14 17:07:47,196 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:47,196 INFO L273 TraceCheckUtils]: 66: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,196 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {5057#true} {5058#false} #75#return; {5058#false} is VALID [2018-11-14 17:07:47,196 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:47,196 INFO L273 TraceCheckUtils]: 69: Hoare triple {5058#false} assume true; {5058#false} is VALID [2018-11-14 17:07:47,196 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:47,197 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:47,197 INFO L273 TraceCheckUtils]: 72: Hoare triple {5058#false} assume true; {5058#false} is VALID [2018-11-14 17:07:47,197 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:47,197 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:47,197 INFO L273 TraceCheckUtils]: 75: Hoare triple {5058#false} assume true; {5058#false} is VALID [2018-11-14 17:07:47,197 INFO L273 TraceCheckUtils]: 76: Hoare triple {5058#false} assume !(~i~2 < 9999); {5058#false} is VALID [2018-11-14 17:07:47,197 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:47,198 INFO L256 TraceCheckUtils]: 78: Hoare triple {5058#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 17:07:47,198 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:47,198 INFO L273 TraceCheckUtils]: 80: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,198 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:47,198 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:47,198 INFO L273 TraceCheckUtils]: 83: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,199 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:47,199 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:47,199 INFO L273 TraceCheckUtils]: 86: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,199 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:47,199 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:47,199 INFO L273 TraceCheckUtils]: 89: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,200 INFO L273 TraceCheckUtils]: 90: Hoare triple {5057#true} assume !(~i~0 < 10000); {5057#true} is VALID [2018-11-14 17:07:47,200 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:47,200 INFO L273 TraceCheckUtils]: 92: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,200 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {5057#true} {5058#false} #77#return; {5058#false} is VALID [2018-11-14 17:07:47,200 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:47,200 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:47,201 INFO L273 TraceCheckUtils]: 96: Hoare triple {5058#false} assume !false; {5058#false} is VALID [2018-11-14 17:07:47,206 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:47,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:47,206 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:47,221 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:07:47,248 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 17:07:47,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:47,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:47,420 INFO L256 TraceCheckUtils]: 0: Hoare triple {5057#true} call ULTIMATE.init(); {5057#true} is VALID [2018-11-14 17:07:47,420 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:47,420 INFO L273 TraceCheckUtils]: 2: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,420 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5057#true} {5057#true} #69#return; {5057#true} is VALID [2018-11-14 17:07:47,421 INFO L256 TraceCheckUtils]: 4: Hoare triple {5057#true} call #t~ret13 := main(); {5057#true} is VALID [2018-11-14 17:07:47,421 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:47,421 INFO L273 TraceCheckUtils]: 6: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,421 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:47,421 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:47,422 INFO L273 TraceCheckUtils]: 9: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,422 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:47,422 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:47,422 INFO L273 TraceCheckUtils]: 12: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,422 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:47,422 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:47,422 INFO L273 TraceCheckUtils]: 15: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,422 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:47,423 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:47,423 INFO L273 TraceCheckUtils]: 18: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,423 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:47,423 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:47,423 INFO L273 TraceCheckUtils]: 21: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,423 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:47,423 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:47,423 INFO L273 TraceCheckUtils]: 24: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,423 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:47,424 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:47,424 INFO L273 TraceCheckUtils]: 27: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,424 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:47,424 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:47,424 INFO L273 TraceCheckUtils]: 30: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,424 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:47,424 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:47,424 INFO L273 TraceCheckUtils]: 33: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,425 INFO L273 TraceCheckUtils]: 34: Hoare triple {5057#true} assume !(~i~1 < 10000); {5057#true} is VALID [2018-11-14 17:07:47,425 INFO L256 TraceCheckUtils]: 35: Hoare triple {5057#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 17:07:47,425 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:47,425 INFO L273 TraceCheckUtils]: 37: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,425 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:47,425 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:47,425 INFO L273 TraceCheckUtils]: 40: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,425 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:47,425 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:47,426 INFO L273 TraceCheckUtils]: 43: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,426 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:47,426 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:47,426 INFO L273 TraceCheckUtils]: 46: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,426 INFO L273 TraceCheckUtils]: 47: Hoare triple {5057#true} assume !(~i~0 < 10000); {5057#true} is VALID [2018-11-14 17:07:47,426 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:47,426 INFO L273 TraceCheckUtils]: 49: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,426 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {5057#true} {5057#true} #73#return; {5057#true} is VALID [2018-11-14 17:07:47,427 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:47,427 INFO L256 TraceCheckUtils]: 52: Hoare triple {5057#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 17:07:47,427 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:47,427 INFO L273 TraceCheckUtils]: 54: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,427 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:47,427 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:47,427 INFO L273 TraceCheckUtils]: 57: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,427 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:47,428 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:47,428 INFO L273 TraceCheckUtils]: 60: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,428 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:47,428 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:47,428 INFO L273 TraceCheckUtils]: 63: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,428 INFO L273 TraceCheckUtils]: 64: Hoare triple {5057#true} assume !(~i~0 < 10000); {5057#true} is VALID [2018-11-14 17:07:47,428 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:47,428 INFO L273 TraceCheckUtils]: 66: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,428 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {5057#true} {5057#true} #75#return; {5057#true} is VALID [2018-11-14 17:07:47,429 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:47,429 INFO L273 TraceCheckUtils]: 69: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,429 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:47,429 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:47,429 INFO L273 TraceCheckUtils]: 72: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,429 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:47,429 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:47,429 INFO L273 TraceCheckUtils]: 75: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:47,429 INFO L273 TraceCheckUtils]: 76: Hoare triple {5057#true} assume !(~i~2 < 9999); {5057#true} is VALID [2018-11-14 17:07:47,430 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:47,430 INFO L256 TraceCheckUtils]: 78: Hoare triple {5057#true} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 17:07:47,431 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#(<= bor_~i~0 1)} is VALID [2018-11-14 17:07:47,431 INFO L273 TraceCheckUtils]: 80: Hoare triple {5309#(<= bor_~i~0 1)} assume true; {5309#(<= bor_~i~0 1)} is VALID [2018-11-14 17:07:47,431 INFO L273 TraceCheckUtils]: 81: Hoare triple {5309#(<= bor_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5309#(<= bor_~i~0 1)} is VALID [2018-11-14 17:07:47,432 INFO L273 TraceCheckUtils]: 82: Hoare triple {5309#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5319#(<= bor_~i~0 2)} is VALID [2018-11-14 17:07:47,433 INFO L273 TraceCheckUtils]: 83: Hoare triple {5319#(<= bor_~i~0 2)} assume true; {5319#(<= bor_~i~0 2)} is VALID [2018-11-14 17:07:47,433 INFO L273 TraceCheckUtils]: 84: Hoare triple {5319#(<= bor_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5319#(<= bor_~i~0 2)} is VALID [2018-11-14 17:07:47,434 INFO L273 TraceCheckUtils]: 85: Hoare triple {5319#(<= bor_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5329#(<= bor_~i~0 3)} is VALID [2018-11-14 17:07:47,454 INFO L273 TraceCheckUtils]: 86: Hoare triple {5329#(<= bor_~i~0 3)} assume true; {5329#(<= bor_~i~0 3)} is VALID [2018-11-14 17:07:47,457 INFO L273 TraceCheckUtils]: 87: Hoare triple {5329#(<= bor_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5329#(<= bor_~i~0 3)} is VALID [2018-11-14 17:07:47,458 INFO L273 TraceCheckUtils]: 88: Hoare triple {5329#(<= bor_~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5339#(<= bor_~i~0 4)} is VALID [2018-11-14 17:07:47,462 INFO L273 TraceCheckUtils]: 89: Hoare triple {5339#(<= bor_~i~0 4)} assume true; {5339#(<= bor_~i~0 4)} is VALID [2018-11-14 17:07:47,462 INFO L273 TraceCheckUtils]: 90: Hoare triple {5339#(<= bor_~i~0 4)} assume !(~i~0 < 10000); {5058#false} is VALID [2018-11-14 17:07:47,462 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:47,463 INFO L273 TraceCheckUtils]: 92: Hoare triple {5058#false} assume true; {5058#false} is VALID [2018-11-14 17:07:47,463 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {5058#false} {5057#true} #77#return; {5058#false} is VALID [2018-11-14 17:07:47,463 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:47,463 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:47,463 INFO L273 TraceCheckUtils]: 96: Hoare triple {5058#false} assume !false; {5058#false} is VALID [2018-11-14 17:07:47,467 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:47,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:47,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 16 [2018-11-14 17:07:47,488 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 97 [2018-11-14 17:07:47,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:47,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 17:07:47,571 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:47,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 17:07:47,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 17:07:47,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:07:47,572 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 16 states. [2018-11-14 17:07:48,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:48,020 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-11-14 17:07:48,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 17:07:48,020 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 97 [2018-11-14 17:07:48,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:48,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:07:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 103 transitions. [2018-11-14 17:07:48,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:07:48,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 103 transitions. [2018-11-14 17:07:48,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 103 transitions. [2018-11-14 17:07:49,022 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:49,025 INFO L225 Difference]: With dead ends: 109 [2018-11-14 17:07:49,025 INFO L226 Difference]: Without dead ends: 76 [2018-11-14 17:07:49,026 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:07:49,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-14 17:07:49,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-11-14 17:07:49,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:49,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 74 states. [2018-11-14 17:07:49,492 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 74 states. [2018-11-14 17:07:49,492 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 74 states. [2018-11-14 17:07:49,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:49,494 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-14 17:07:49,495 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-14 17:07:49,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:49,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:49,495 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 76 states. [2018-11-14 17:07:49,496 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 76 states. [2018-11-14 17:07:49,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:49,498 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-14 17:07:49,498 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-14 17:07:49,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:49,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:49,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:49,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:49,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-14 17:07:49,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-11-14 17:07:49,501 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 97 [2018-11-14 17:07:49,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:49,501 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-11-14 17:07:49,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 17:07:49,501 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-11-14 17:07:49,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-14 17:07:49,502 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:49,502 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:49,503 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:49,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:49,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1090680019, now seen corresponding path program 10 times [2018-11-14 17:07:49,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:49,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:49,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:49,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:49,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:50,530 INFO L256 TraceCheckUtils]: 0: Hoare triple {5763#true} call ULTIMATE.init(); {5763#true} is VALID [2018-11-14 17:07:50,530 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:50,530 INFO L273 TraceCheckUtils]: 2: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:50,530 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5763#true} {5763#true} #69#return; {5763#true} is VALID [2018-11-14 17:07:50,531 INFO L256 TraceCheckUtils]: 4: Hoare triple {5763#true} call #t~ret13 := main(); {5763#true} is VALID [2018-11-14 17:07:50,531 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:50,532 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:50,532 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:50,533 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:50,533 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:50,534 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:50,534 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:50,535 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:50,535 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:50,538 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:50,539 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:50,539 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:50,539 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:50,540 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:50,540 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:50,541 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:50,541 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:50,541 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:50,542 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:50,542 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:50,542 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:50,543 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:50,544 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:50,544 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:50,545 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:50,545 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:50,546 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:50,547 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:50,547 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:50,548 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:50,549 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:50,549 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:50,550 INFO L273 TraceCheckUtils]: 37: Hoare triple {5775#(<= main_~i~1 10)} assume !(~i~1 < 10000); {5764#false} is VALID [2018-11-14 17:07:50,550 INFO L256 TraceCheckUtils]: 38: Hoare triple {5764#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {5763#true} is VALID [2018-11-14 17:07:50,550 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:50,550 INFO L273 TraceCheckUtils]: 40: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:50,551 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:07:50,551 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:50,551 INFO L273 TraceCheckUtils]: 43: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:50,551 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:07:50,551 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:50,552 INFO L273 TraceCheckUtils]: 46: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:50,552 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:07:50,552 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:50,552 INFO L273 TraceCheckUtils]: 49: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:50,552 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:07:50,553 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:50,553 INFO L273 TraceCheckUtils]: 52: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:50,553 INFO L273 TraceCheckUtils]: 53: Hoare triple {5763#true} assume !(~i~0 < 10000); {5763#true} is VALID [2018-11-14 17:07:50,553 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:50,553 INFO L273 TraceCheckUtils]: 55: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:50,554 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {5763#true} {5764#false} #73#return; {5764#false} is VALID [2018-11-14 17:07:50,554 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:50,554 INFO L256 TraceCheckUtils]: 58: Hoare triple {5764#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {5763#true} is VALID [2018-11-14 17:07:50,554 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:50,554 INFO L273 TraceCheckUtils]: 60: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:50,555 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:07:50,555 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:50,555 INFO L273 TraceCheckUtils]: 63: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:50,555 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:07:50,555 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:50,555 INFO L273 TraceCheckUtils]: 66: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:50,555 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:07:50,555 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:50,555 INFO L273 TraceCheckUtils]: 69: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:50,556 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:07:50,556 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:50,556 INFO L273 TraceCheckUtils]: 72: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:50,556 INFO L273 TraceCheckUtils]: 73: Hoare triple {5763#true} assume !(~i~0 < 10000); {5763#true} is VALID [2018-11-14 17:07:50,556 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:50,556 INFO L273 TraceCheckUtils]: 75: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:50,556 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {5763#true} {5764#false} #75#return; {5764#false} is VALID [2018-11-14 17:07:50,556 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:50,556 INFO L273 TraceCheckUtils]: 78: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:50,557 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:50,557 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:50,557 INFO L273 TraceCheckUtils]: 81: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:50,557 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:50,557 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:50,557 INFO L273 TraceCheckUtils]: 84: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:50,557 INFO L273 TraceCheckUtils]: 85: Hoare triple {5764#false} assume !(~i~2 < 9999); {5764#false} is VALID [2018-11-14 17:07:50,557 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:50,558 INFO L256 TraceCheckUtils]: 87: Hoare triple {5764#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {5763#true} is VALID [2018-11-14 17:07:50,558 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:50,558 INFO L273 TraceCheckUtils]: 89: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:50,558 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:07:50,558 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:50,558 INFO L273 TraceCheckUtils]: 92: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:50,558 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:07:50,558 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:50,558 INFO L273 TraceCheckUtils]: 95: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:50,559 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:07:50,559 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:50,559 INFO L273 TraceCheckUtils]: 98: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:50,559 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:07:50,559 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:50,559 INFO L273 TraceCheckUtils]: 101: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:50,559 INFO L273 TraceCheckUtils]: 102: Hoare triple {5763#true} assume !(~i~0 < 10000); {5763#true} is VALID [2018-11-14 17:07:50,559 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:50,559 INFO L273 TraceCheckUtils]: 104: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:50,560 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {5763#true} {5764#false} #77#return; {5764#false} is VALID [2018-11-14 17:07:50,560 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:50,560 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:50,560 INFO L273 TraceCheckUtils]: 108: Hoare triple {5764#false} assume !false; {5764#false} is VALID [2018-11-14 17:07:50,565 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:50,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:50,565 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:50,577 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:07:50,621 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:07:50,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:50,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:50,808 INFO L256 TraceCheckUtils]: 0: Hoare triple {5763#true} call ULTIMATE.init(); {5763#true} is VALID [2018-11-14 17:07:50,809 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:50,809 INFO L273 TraceCheckUtils]: 2: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:50,810 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5763#true} {5763#true} #69#return; {5763#true} is VALID [2018-11-14 17:07:50,810 INFO L256 TraceCheckUtils]: 4: Hoare triple {5763#true} call #t~ret13 := main(); {5763#true} is VALID [2018-11-14 17:07:50,829 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:50,844 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:50,853 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:50,862 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:50,862 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:50,863 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:50,863 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:50,863 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:50,864 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:50,864 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:50,864 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:50,865 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:50,865 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:50,866 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:50,866 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:50,867 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:50,867 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:50,868 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:50,868 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:50,869 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:50,870 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:50,870 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:50,871 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:50,871 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:50,872 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:50,873 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:50,873 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:50,874 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:50,874 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:50,875 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:50,876 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:50,876 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:50,877 INFO L273 TraceCheckUtils]: 37: Hoare triple {5775#(<= main_~i~1 10)} assume !(~i~1 < 10000); {5764#false} is VALID [2018-11-14 17:07:50,877 INFO L256 TraceCheckUtils]: 38: Hoare triple {5764#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {5764#false} is VALID [2018-11-14 17:07:50,877 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:50,878 INFO L273 TraceCheckUtils]: 40: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:50,878 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:07:50,878 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:50,878 INFO L273 TraceCheckUtils]: 43: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:50,878 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:07:50,879 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:50,879 INFO L273 TraceCheckUtils]: 46: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:50,879 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:07:50,879 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:50,879 INFO L273 TraceCheckUtils]: 49: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:50,882 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:07:50,882 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:50,882 INFO L273 TraceCheckUtils]: 52: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:50,882 INFO L273 TraceCheckUtils]: 53: Hoare triple {5764#false} assume !(~i~0 < 10000); {5764#false} is VALID [2018-11-14 17:07:50,882 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:50,882 INFO L273 TraceCheckUtils]: 55: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:50,883 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {5764#false} {5764#false} #73#return; {5764#false} is VALID [2018-11-14 17:07:50,883 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:50,883 INFO L256 TraceCheckUtils]: 58: Hoare triple {5764#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {5764#false} is VALID [2018-11-14 17:07:50,883 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:50,883 INFO L273 TraceCheckUtils]: 60: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:50,883 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:07:50,884 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:50,884 INFO L273 TraceCheckUtils]: 63: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:50,884 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:07:50,884 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:50,884 INFO L273 TraceCheckUtils]: 66: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:50,884 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:07:50,885 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:50,885 INFO L273 TraceCheckUtils]: 69: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:50,885 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:07:50,885 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:50,885 INFO L273 TraceCheckUtils]: 72: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:50,885 INFO L273 TraceCheckUtils]: 73: Hoare triple {5764#false} assume !(~i~0 < 10000); {5764#false} is VALID [2018-11-14 17:07:50,885 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:50,886 INFO L273 TraceCheckUtils]: 75: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:50,886 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {5764#false} {5764#false} #75#return; {5764#false} is VALID [2018-11-14 17:07:50,886 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:50,886 INFO L273 TraceCheckUtils]: 78: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:50,886 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:50,886 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:50,887 INFO L273 TraceCheckUtils]: 81: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:50,887 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:50,887 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:50,887 INFO L273 TraceCheckUtils]: 84: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:50,887 INFO L273 TraceCheckUtils]: 85: Hoare triple {5764#false} assume !(~i~2 < 9999); {5764#false} is VALID [2018-11-14 17:07:50,887 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:50,888 INFO L256 TraceCheckUtils]: 87: Hoare triple {5764#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {5764#false} is VALID [2018-11-14 17:07:50,888 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:50,888 INFO L273 TraceCheckUtils]: 89: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:50,888 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:07:50,888 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:50,888 INFO L273 TraceCheckUtils]: 92: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:50,889 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:07:50,889 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:50,889 INFO L273 TraceCheckUtils]: 95: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:50,889 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:07:50,889 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:50,889 INFO L273 TraceCheckUtils]: 98: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:50,889 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:07:50,890 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:50,890 INFO L273 TraceCheckUtils]: 101: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:50,890 INFO L273 TraceCheckUtils]: 102: Hoare triple {5764#false} assume !(~i~0 < 10000); {5764#false} is VALID [2018-11-14 17:07:50,890 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:50,890 INFO L273 TraceCheckUtils]: 104: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:50,890 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {5764#false} {5764#false} #77#return; {5764#false} is VALID [2018-11-14 17:07:50,890 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:50,891 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:50,891 INFO L273 TraceCheckUtils]: 108: Hoare triple {5764#false} assume !false; {5764#false} is VALID [2018-11-14 17:07:50,896 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:50,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:50,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-14 17:07:50,917 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 109 [2018-11-14 17:07:50,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:50,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 17:07:50,996 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:50,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 17:07:50,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 17:07:50,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:07:50,997 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 14 states. [2018-11-14 17:07:51,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:51,355 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-11-14 17:07:51,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 17:07:51,355 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 109 [2018-11-14 17:07:51,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:51,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:07:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 90 transitions. [2018-11-14 17:07:51,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:07:51,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 90 transitions. [2018-11-14 17:07:51,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 90 transitions. [2018-11-14 17:07:52,220 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:52,222 INFO L225 Difference]: With dead ends: 114 [2018-11-14 17:07:52,223 INFO L226 Difference]: Without dead ends: 78 [2018-11-14 17:07:52,223 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:07:52,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-14 17:07:52,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-14 17:07:52,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:52,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-14 17:07:52,250 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-14 17:07:52,250 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-14 17:07:52,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:52,252 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-14 17:07:52,252 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-14 17:07:52,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:52,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:52,253 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-14 17:07:52,253 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-14 17:07:52,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:52,255 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-14 17:07:52,255 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-14 17:07:52,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:52,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:52,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:52,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:52,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-14 17:07:52,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-14 17:07:52,258 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 109 [2018-11-14 17:07:52,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:52,258 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-14 17:07:52,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 17:07:52,259 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-14 17:07:52,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-14 17:07:52,260 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:52,260 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:52,260 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:52,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:52,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1670093159, now seen corresponding path program 11 times [2018-11-14 17:07:52,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:52,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:52,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:52,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:52,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:52,797 INFO L256 TraceCheckUtils]: 0: Hoare triple {6518#true} call ULTIMATE.init(); {6518#true} is VALID [2018-11-14 17:07:52,797 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:52,797 INFO L273 TraceCheckUtils]: 2: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:52,797 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6518#true} {6518#true} #69#return; {6518#true} is VALID [2018-11-14 17:07:52,798 INFO L256 TraceCheckUtils]: 4: Hoare triple {6518#true} call #t~ret13 := main(); {6518#true} is VALID [2018-11-14 17:07:52,798 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:52,799 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:52,799 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:52,799 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:52,800 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:52,800 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:52,800 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:52,801 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:52,801 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:52,802 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:52,803 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:52,803 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:52,804 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:52,805 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:52,805 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:52,806 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:52,806 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:52,807 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:52,808 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:52,808 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:52,809 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:52,809 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:52,810 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:52,811 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:52,811 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:52,812 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:52,812 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:52,813 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:52,814 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:52,814 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:52,815 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:52,815 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:52,816 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:52,817 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:52,817 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:52,818 INFO L273 TraceCheckUtils]: 40: Hoare triple {6531#(<= main_~i~1 11)} assume !(~i~1 < 10000); {6519#false} is VALID [2018-11-14 17:07:52,818 INFO L256 TraceCheckUtils]: 41: Hoare triple {6519#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {6518#true} is VALID [2018-11-14 17:07:52,818 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:52,819 INFO L273 TraceCheckUtils]: 43: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:52,819 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:07:52,819 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:52,819 INFO L273 TraceCheckUtils]: 46: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:52,819 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:07:52,820 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:52,820 INFO L273 TraceCheckUtils]: 49: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:52,820 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:07:52,820 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:52,820 INFO L273 TraceCheckUtils]: 52: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:52,821 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:07:52,821 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:52,821 INFO L273 TraceCheckUtils]: 55: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:52,821 INFO L273 TraceCheckUtils]: 56: Hoare triple {6518#true} assume !(~i~0 < 10000); {6518#true} is VALID [2018-11-14 17:07:52,821 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:52,821 INFO L273 TraceCheckUtils]: 58: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:52,821 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {6518#true} {6519#false} #73#return; {6519#false} is VALID [2018-11-14 17:07:52,821 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:52,821 INFO L256 TraceCheckUtils]: 61: Hoare triple {6519#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {6518#true} is VALID [2018-11-14 17:07:52,822 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:52,822 INFO L273 TraceCheckUtils]: 63: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:52,822 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:07:52,822 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:52,822 INFO L273 TraceCheckUtils]: 66: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:52,822 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:07:52,822 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:52,822 INFO L273 TraceCheckUtils]: 69: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:52,823 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:07:52,823 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:52,823 INFO L273 TraceCheckUtils]: 72: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:52,823 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:07:52,823 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:52,823 INFO L273 TraceCheckUtils]: 75: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:52,823 INFO L273 TraceCheckUtils]: 76: Hoare triple {6518#true} assume !(~i~0 < 10000); {6518#true} is VALID [2018-11-14 17:07:52,823 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:52,823 INFO L273 TraceCheckUtils]: 78: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:52,824 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {6518#true} {6519#false} #75#return; {6519#false} is VALID [2018-11-14 17:07:52,824 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:52,824 INFO L273 TraceCheckUtils]: 81: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:52,824 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:52,824 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:52,824 INFO L273 TraceCheckUtils]: 84: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:52,824 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:52,824 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:52,824 INFO L273 TraceCheckUtils]: 87: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:52,825 INFO L273 TraceCheckUtils]: 88: Hoare triple {6519#false} assume !(~i~2 < 9999); {6519#false} is VALID [2018-11-14 17:07:52,825 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:52,825 INFO L256 TraceCheckUtils]: 90: Hoare triple {6519#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {6518#true} is VALID [2018-11-14 17:07:52,825 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:52,825 INFO L273 TraceCheckUtils]: 92: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:52,825 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:07:52,825 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:52,825 INFO L273 TraceCheckUtils]: 95: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:52,826 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:07:52,826 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:52,826 INFO L273 TraceCheckUtils]: 98: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:52,826 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:07:52,826 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:52,826 INFO L273 TraceCheckUtils]: 101: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:52,826 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:07:52,826 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:52,826 INFO L273 TraceCheckUtils]: 104: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:52,827 INFO L273 TraceCheckUtils]: 105: Hoare triple {6518#true} assume !(~i~0 < 10000); {6518#true} is VALID [2018-11-14 17:07:52,827 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:52,827 INFO L273 TraceCheckUtils]: 107: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:52,827 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {6518#true} {6519#false} #77#return; {6519#false} is VALID [2018-11-14 17:07:52,827 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:52,827 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:52,827 INFO L273 TraceCheckUtils]: 111: Hoare triple {6519#false} assume !false; {6519#false} is VALID [2018-11-14 17:07:52,833 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:52,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:52,833 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:52,842 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:07:53,153 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-14 17:07:53,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:53,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:53,336 INFO L256 TraceCheckUtils]: 0: Hoare triple {6518#true} call ULTIMATE.init(); {6518#true} is VALID [2018-11-14 17:07:53,336 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:53,336 INFO L273 TraceCheckUtils]: 2: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:53,336 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6518#true} {6518#true} #69#return; {6518#true} is VALID [2018-11-14 17:07:53,337 INFO L256 TraceCheckUtils]: 4: Hoare triple {6518#true} call #t~ret13 := main(); {6518#true} is VALID [2018-11-14 17:07:53,337 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:53,337 INFO L273 TraceCheckUtils]: 6: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:53,337 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:53,337 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:53,338 INFO L273 TraceCheckUtils]: 9: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:53,338 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:53,338 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:53,338 INFO L273 TraceCheckUtils]: 12: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:53,338 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:53,338 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:53,339 INFO L273 TraceCheckUtils]: 15: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:53,339 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:53,339 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:53,339 INFO L273 TraceCheckUtils]: 18: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:53,339 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:53,339 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:53,340 INFO L273 TraceCheckUtils]: 21: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:53,340 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:53,340 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:53,340 INFO L273 TraceCheckUtils]: 24: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:53,340 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:53,340 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:53,341 INFO L273 TraceCheckUtils]: 27: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:53,341 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:53,341 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:53,341 INFO L273 TraceCheckUtils]: 30: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:53,341 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:53,341 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:53,342 INFO L273 TraceCheckUtils]: 33: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:53,342 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:53,342 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:53,342 INFO L273 TraceCheckUtils]: 36: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:53,342 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:53,343 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:53,343 INFO L273 TraceCheckUtils]: 39: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:53,343 INFO L273 TraceCheckUtils]: 40: Hoare triple {6518#true} assume !(~i~1 < 10000); {6518#true} is VALID [2018-11-14 17:07:53,343 INFO L256 TraceCheckUtils]: 41: Hoare triple {6518#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {6518#true} is VALID [2018-11-14 17:07:53,359 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#(<= bor_~i~0 1)} is VALID [2018-11-14 17:07:53,368 INFO L273 TraceCheckUtils]: 43: Hoare triple {6661#(<= bor_~i~0 1)} assume true; {6661#(<= bor_~i~0 1)} is VALID [2018-11-14 17:07:53,381 INFO L273 TraceCheckUtils]: 44: Hoare triple {6661#(<= bor_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6661#(<= bor_~i~0 1)} is VALID [2018-11-14 17:07:53,390 INFO L273 TraceCheckUtils]: 45: Hoare triple {6661#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6671#(<= bor_~i~0 2)} is VALID [2018-11-14 17:07:53,399 INFO L273 TraceCheckUtils]: 46: Hoare triple {6671#(<= bor_~i~0 2)} assume true; {6671#(<= bor_~i~0 2)} is VALID [2018-11-14 17:07:53,411 INFO L273 TraceCheckUtils]: 47: Hoare triple {6671#(<= bor_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6671#(<= bor_~i~0 2)} is VALID [2018-11-14 17:07:53,424 INFO L273 TraceCheckUtils]: 48: Hoare triple {6671#(<= bor_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6681#(<= bor_~i~0 3)} is VALID [2018-11-14 17:07:53,431 INFO L273 TraceCheckUtils]: 49: Hoare triple {6681#(<= bor_~i~0 3)} assume true; {6681#(<= bor_~i~0 3)} is VALID [2018-11-14 17:07:53,431 INFO L273 TraceCheckUtils]: 50: Hoare triple {6681#(<= bor_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6681#(<= bor_~i~0 3)} is VALID [2018-11-14 17:07:53,433 INFO L273 TraceCheckUtils]: 51: Hoare triple {6681#(<= bor_~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6691#(<= bor_~i~0 4)} is VALID [2018-11-14 17:07:53,433 INFO L273 TraceCheckUtils]: 52: Hoare triple {6691#(<= bor_~i~0 4)} assume true; {6691#(<= bor_~i~0 4)} is VALID [2018-11-14 17:07:53,435 INFO L273 TraceCheckUtils]: 53: Hoare triple {6691#(<= bor_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6691#(<= bor_~i~0 4)} is VALID [2018-11-14 17:07:53,435 INFO L273 TraceCheckUtils]: 54: Hoare triple {6691#(<= bor_~i~0 4)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6701#(<= bor_~i~0 5)} is VALID [2018-11-14 17:07:53,435 INFO L273 TraceCheckUtils]: 55: Hoare triple {6701#(<= bor_~i~0 5)} assume true; {6701#(<= bor_~i~0 5)} is VALID [2018-11-14 17:07:53,436 INFO L273 TraceCheckUtils]: 56: Hoare triple {6701#(<= bor_~i~0 5)} assume !(~i~0 < 10000); {6519#false} is VALID [2018-11-14 17:07:53,436 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:53,436 INFO L273 TraceCheckUtils]: 58: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:53,436 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {6519#false} {6518#true} #73#return; {6519#false} is VALID [2018-11-14 17:07:53,436 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:53,437 INFO L256 TraceCheckUtils]: 61: Hoare triple {6519#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {6519#false} is VALID [2018-11-14 17:07:53,437 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:53,437 INFO L273 TraceCheckUtils]: 63: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:53,437 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 17:07:53,437 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:53,437 INFO L273 TraceCheckUtils]: 66: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:53,437 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 17:07:53,437 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:53,437 INFO L273 TraceCheckUtils]: 69: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:53,438 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 17:07:53,438 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:53,438 INFO L273 TraceCheckUtils]: 72: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:53,438 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 17:07:53,438 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:53,438 INFO L273 TraceCheckUtils]: 75: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:53,438 INFO L273 TraceCheckUtils]: 76: Hoare triple {6519#false} assume !(~i~0 < 10000); {6519#false} is VALID [2018-11-14 17:07:53,438 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:53,438 INFO L273 TraceCheckUtils]: 78: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:53,439 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {6519#false} {6519#false} #75#return; {6519#false} is VALID [2018-11-14 17:07:53,439 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:53,439 INFO L273 TraceCheckUtils]: 81: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:53,439 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:53,439 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:53,439 INFO L273 TraceCheckUtils]: 84: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:53,439 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:53,439 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:53,439 INFO L273 TraceCheckUtils]: 87: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:53,440 INFO L273 TraceCheckUtils]: 88: Hoare triple {6519#false} assume !(~i~2 < 9999); {6519#false} is VALID [2018-11-14 17:07:53,440 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:53,440 INFO L256 TraceCheckUtils]: 90: Hoare triple {6519#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {6519#false} is VALID [2018-11-14 17:07:53,440 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:53,440 INFO L273 TraceCheckUtils]: 92: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:53,440 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 17:07:53,440 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:53,440 INFO L273 TraceCheckUtils]: 95: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:53,440 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 17:07:53,441 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:53,441 INFO L273 TraceCheckUtils]: 98: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:53,441 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 17:07:53,441 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:53,441 INFO L273 TraceCheckUtils]: 101: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:53,441 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 17:07:53,441 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:53,441 INFO L273 TraceCheckUtils]: 104: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:53,442 INFO L273 TraceCheckUtils]: 105: Hoare triple {6519#false} assume !(~i~0 < 10000); {6519#false} is VALID [2018-11-14 17:07:53,442 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:53,442 INFO L273 TraceCheckUtils]: 107: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:53,442 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {6519#false} {6519#false} #77#return; {6519#false} is VALID [2018-11-14 17:07:53,442 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:53,442 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:53,442 INFO L273 TraceCheckUtils]: 111: Hoare triple {6519#false} assume !false; {6519#false} is VALID [2018-11-14 17:07:53,447 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:53,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:53,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2018-11-14 17:07:53,469 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 112 [2018-11-14 17:07:53,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:53,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 17:07:53,574 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:53,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 17:07:53,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 17:07:53,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-14 17:07:53,576 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 19 states. [2018-11-14 17:07:54,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:54,025 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2018-11-14 17:07:54,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 17:07:54,025 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 112 [2018-11-14 17:07:54,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:07:54,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 112 transitions. [2018-11-14 17:07:54,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:07:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 112 transitions. [2018-11-14 17:07:54,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 112 transitions. [2018-11-14 17:07:54,131 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:54,133 INFO L225 Difference]: With dead ends: 121 [2018-11-14 17:07:54,134 INFO L226 Difference]: Without dead ends: 85 [2018-11-14 17:07:54,134 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-14 17:07:54,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-14 17:07:54,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-11-14 17:07:54,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:54,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 83 states. [2018-11-14 17:07:54,240 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 83 states. [2018-11-14 17:07:54,240 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 83 states. [2018-11-14 17:07:54,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:54,242 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-11-14 17:07:54,242 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-14 17:07:54,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:54,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:54,243 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 85 states. [2018-11-14 17:07:54,243 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 85 states. [2018-11-14 17:07:54,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:54,246 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-11-14 17:07:54,246 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-14 17:07:54,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:54,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:54,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:54,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:54,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-14 17:07:54,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-11-14 17:07:54,249 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 112 [2018-11-14 17:07:54,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:54,249 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-11-14 17:07:54,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 17:07:54,249 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-14 17:07:54,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-14 17:07:54,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:54,251 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:54,251 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:54,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:54,251 INFO L82 PathProgramCache]: Analyzing trace with hash -167472347, now seen corresponding path program 12 times [2018-11-14 17:07:54,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:54,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:54,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:54,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:54,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:54,941 INFO L256 TraceCheckUtils]: 0: Hoare triple {7318#true} call ULTIMATE.init(); {7318#true} is VALID [2018-11-14 17:07:54,941 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:54,941 INFO L273 TraceCheckUtils]: 2: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:54,942 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7318#true} {7318#true} #69#return; {7318#true} is VALID [2018-11-14 17:07:54,942 INFO L256 TraceCheckUtils]: 4: Hoare triple {7318#true} call #t~ret13 := main(); {7318#true} is VALID [2018-11-14 17:07:54,942 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:54,943 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:54,943 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:54,944 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:54,944 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:54,945 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:54,945 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:54,945 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:54,946 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:54,947 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:54,947 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:54,948 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:54,948 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:54,949 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:54,950 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:54,950 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:54,951 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:54,951 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:54,952 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:54,953 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:54,953 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:54,954 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:54,954 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:54,955 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:54,956 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:54,956 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:54,957 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:54,958 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:54,958 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:54,959 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:54,959 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:54,960 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:54,960 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:54,961 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:54,962 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:54,962 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:54,963 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:54,964 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:54,964 INFO L273 TraceCheckUtils]: 43: Hoare triple {7332#(<= main_~i~1 12)} assume !(~i~1 < 10000); {7319#false} is VALID [2018-11-14 17:07:54,964 INFO L256 TraceCheckUtils]: 44: Hoare triple {7319#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {7318#true} is VALID [2018-11-14 17:07:54,965 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:54,965 INFO L273 TraceCheckUtils]: 46: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:54,965 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:54,965 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:54,965 INFO L273 TraceCheckUtils]: 49: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:54,966 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:54,966 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:54,966 INFO L273 TraceCheckUtils]: 52: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:54,966 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:54,966 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:54,967 INFO L273 TraceCheckUtils]: 55: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:54,967 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:54,967 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:54,967 INFO L273 TraceCheckUtils]: 58: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:54,967 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:54,968 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:54,968 INFO L273 TraceCheckUtils]: 61: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:54,968 INFO L273 TraceCheckUtils]: 62: Hoare triple {7318#true} assume !(~i~0 < 10000); {7318#true} is VALID [2018-11-14 17:07:54,968 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:54,968 INFO L273 TraceCheckUtils]: 64: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:54,969 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {7318#true} {7319#false} #73#return; {7319#false} is VALID [2018-11-14 17:07:54,969 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:54,969 INFO L256 TraceCheckUtils]: 67: Hoare triple {7319#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {7318#true} is VALID [2018-11-14 17:07:54,969 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:54,969 INFO L273 TraceCheckUtils]: 69: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:54,969 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:54,969 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:54,969 INFO L273 TraceCheckUtils]: 72: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:54,970 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:54,970 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:54,970 INFO L273 TraceCheckUtils]: 75: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:54,970 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:54,970 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:54,970 INFO L273 TraceCheckUtils]: 78: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:54,970 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:54,970 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:54,970 INFO L273 TraceCheckUtils]: 81: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:54,971 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:54,971 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:54,971 INFO L273 TraceCheckUtils]: 84: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:54,971 INFO L273 TraceCheckUtils]: 85: Hoare triple {7318#true} assume !(~i~0 < 10000); {7318#true} is VALID [2018-11-14 17:07:54,971 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:54,971 INFO L273 TraceCheckUtils]: 87: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:54,971 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {7318#true} {7319#false} #75#return; {7319#false} is VALID [2018-11-14 17:07:54,971 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:54,972 INFO L273 TraceCheckUtils]: 90: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:54,972 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:54,972 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:54,972 INFO L273 TraceCheckUtils]: 93: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:54,972 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:54,972 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:54,972 INFO L273 TraceCheckUtils]: 96: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:54,972 INFO L273 TraceCheckUtils]: 97: Hoare triple {7319#false} assume !(~i~2 < 9999); {7319#false} is VALID [2018-11-14 17:07:54,972 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:54,973 INFO L256 TraceCheckUtils]: 99: Hoare triple {7319#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {7318#true} is VALID [2018-11-14 17:07:54,973 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:54,973 INFO L273 TraceCheckUtils]: 101: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:54,973 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:54,973 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:54,973 INFO L273 TraceCheckUtils]: 104: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:54,973 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:54,973 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:54,973 INFO L273 TraceCheckUtils]: 107: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:54,974 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:54,974 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:54,974 INFO L273 TraceCheckUtils]: 110: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:54,974 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:54,974 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:54,974 INFO L273 TraceCheckUtils]: 113: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:54,974 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:54,974 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:54,974 INFO L273 TraceCheckUtils]: 116: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:54,975 INFO L273 TraceCheckUtils]: 117: Hoare triple {7318#true} assume !(~i~0 < 10000); {7318#true} is VALID [2018-11-14 17:07:54,975 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:54,975 INFO L273 TraceCheckUtils]: 119: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:54,975 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {7318#true} {7319#false} #77#return; {7319#false} is VALID [2018-11-14 17:07:54,975 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:54,975 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:54,975 INFO L273 TraceCheckUtils]: 123: Hoare triple {7319#false} assume !false; {7319#false} is VALID [2018-11-14 17:07:54,982 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:54,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:54,982 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:54,992 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:07:55,053 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 17:07:55,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:55,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:55,522 INFO L256 TraceCheckUtils]: 0: Hoare triple {7318#true} call ULTIMATE.init(); {7318#true} is VALID [2018-11-14 17:07:55,523 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:55,523 INFO L273 TraceCheckUtils]: 2: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:55,523 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7318#true} {7318#true} #69#return; {7318#true} is VALID [2018-11-14 17:07:55,524 INFO L256 TraceCheckUtils]: 4: Hoare triple {7318#true} call #t~ret13 := main(); {7318#true} is VALID [2018-11-14 17:07:55,524 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:55,524 INFO L273 TraceCheckUtils]: 6: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:55,525 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:55,525 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:55,525 INFO L273 TraceCheckUtils]: 9: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:55,525 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:55,525 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:55,525 INFO L273 TraceCheckUtils]: 12: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:55,525 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:55,526 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:55,526 INFO L273 TraceCheckUtils]: 15: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:55,526 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:55,526 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:55,526 INFO L273 TraceCheckUtils]: 18: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:55,526 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:55,526 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:55,527 INFO L273 TraceCheckUtils]: 21: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:55,527 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:55,527 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:55,527 INFO L273 TraceCheckUtils]: 24: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:55,527 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:55,527 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:55,528 INFO L273 TraceCheckUtils]: 27: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:55,528 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:55,528 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:55,528 INFO L273 TraceCheckUtils]: 30: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:55,528 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:55,528 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:55,528 INFO L273 TraceCheckUtils]: 33: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:55,529 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:55,529 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:55,529 INFO L273 TraceCheckUtils]: 36: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:55,529 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:55,529 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:55,529 INFO L273 TraceCheckUtils]: 39: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:55,529 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:55,530 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:55,530 INFO L273 TraceCheckUtils]: 42: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:55,530 INFO L273 TraceCheckUtils]: 43: Hoare triple {7318#true} assume !(~i~1 < 10000); {7318#true} is VALID [2018-11-14 17:07:55,530 INFO L256 TraceCheckUtils]: 44: Hoare triple {7318#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {7318#true} is VALID [2018-11-14 17:07:55,530 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:55,530 INFO L273 TraceCheckUtils]: 46: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:55,530 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:55,531 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:55,531 INFO L273 TraceCheckUtils]: 49: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:55,531 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:55,531 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:55,531 INFO L273 TraceCheckUtils]: 52: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:55,531 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:55,532 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:55,532 INFO L273 TraceCheckUtils]: 55: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:55,532 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:55,532 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:55,532 INFO L273 TraceCheckUtils]: 58: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:55,532 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:55,532 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:55,533 INFO L273 TraceCheckUtils]: 61: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:55,533 INFO L273 TraceCheckUtils]: 62: Hoare triple {7318#true} assume !(~i~0 < 10000); {7318#true} is VALID [2018-11-14 17:07:55,533 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:55,533 INFO L273 TraceCheckUtils]: 64: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:55,533 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {7318#true} {7318#true} #73#return; {7318#true} is VALID [2018-11-14 17:07:55,533 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:55,533 INFO L256 TraceCheckUtils]: 67: Hoare triple {7318#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {7318#true} is VALID [2018-11-14 17:07:55,534 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:55,534 INFO L273 TraceCheckUtils]: 69: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:55,534 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:55,534 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:55,534 INFO L273 TraceCheckUtils]: 72: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:55,534 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:55,534 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:55,535 INFO L273 TraceCheckUtils]: 75: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:55,535 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:55,535 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:55,535 INFO L273 TraceCheckUtils]: 78: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:55,535 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:55,535 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:55,535 INFO L273 TraceCheckUtils]: 81: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:55,536 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:55,536 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:55,536 INFO L273 TraceCheckUtils]: 84: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:55,536 INFO L273 TraceCheckUtils]: 85: Hoare triple {7318#true} assume !(~i~0 < 10000); {7318#true} is VALID [2018-11-14 17:07:55,536 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:55,536 INFO L273 TraceCheckUtils]: 87: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:55,536 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {7318#true} {7318#true} #75#return; {7318#true} is VALID [2018-11-14 17:07:55,537 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:55,538 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:55,538 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:55,538 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:55,539 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:55,539 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:55,540 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:55,540 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:55,541 INFO L273 TraceCheckUtils]: 97: Hoare triple {7623#(<= main_~i~2 2)} assume !(~i~2 < 9999); {7319#false} is VALID [2018-11-14 17:07:55,541 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:55,542 INFO L256 TraceCheckUtils]: 99: Hoare triple {7319#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {7319#false} is VALID [2018-11-14 17:07:55,542 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:55,542 INFO L273 TraceCheckUtils]: 101: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:55,542 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7319#false} is VALID [2018-11-14 17:07:55,543 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:55,543 INFO L273 TraceCheckUtils]: 104: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:55,543 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7319#false} is VALID [2018-11-14 17:07:55,543 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:55,544 INFO L273 TraceCheckUtils]: 107: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:55,544 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7319#false} is VALID [2018-11-14 17:07:55,544 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:55,544 INFO L273 TraceCheckUtils]: 110: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:55,544 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7319#false} is VALID [2018-11-14 17:07:55,544 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:55,545 INFO L273 TraceCheckUtils]: 113: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:55,545 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7319#false} is VALID [2018-11-14 17:07:55,545 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:55,545 INFO L273 TraceCheckUtils]: 116: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:55,545 INFO L273 TraceCheckUtils]: 117: Hoare triple {7319#false} assume !(~i~0 < 10000); {7319#false} is VALID [2018-11-14 17:07:55,545 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:55,545 INFO L273 TraceCheckUtils]: 119: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:55,546 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {7319#false} {7319#false} #77#return; {7319#false} is VALID [2018-11-14 17:07:55,546 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:55,546 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:55,546 INFO L273 TraceCheckUtils]: 123: Hoare triple {7319#false} assume !false; {7319#false} is VALID [2018-11-14 17:07:55,559 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:55,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:55,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2018-11-14 17:07:55,581 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 124 [2018-11-14 17:07:55,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:55,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 17:07:55,682 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:55,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 17:07:55,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 17:07:55,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:07:55,683 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 18 states. [2018-11-14 17:07:56,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:56,248 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-11-14 17:07:56,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 17:07:56,249 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 124 [2018-11-14 17:07:56,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:56,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:07:56,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 106 transitions. [2018-11-14 17:07:56,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:07:56,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 106 transitions. [2018-11-14 17:07:56,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 106 transitions. [2018-11-14 17:07:56,356 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:56,358 INFO L225 Difference]: With dead ends: 130 [2018-11-14 17:07:56,359 INFO L226 Difference]: Without dead ends: 91 [2018-11-14 17:07:56,359 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:56,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-14 17:07:56,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2018-11-14 17:07:56,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:56,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 89 states. [2018-11-14 17:07:56,381 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 89 states. [2018-11-14 17:07:56,382 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 89 states. [2018-11-14 17:07:56,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:56,384 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-11-14 17:07:56,384 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-11-14 17:07:56,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:56,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:56,385 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 91 states. [2018-11-14 17:07:56,385 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 91 states. [2018-11-14 17:07:56,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:56,387 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-11-14 17:07:56,387 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-11-14 17:07:56,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:56,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:56,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:56,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:56,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-14 17:07:56,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-11-14 17:07:56,390 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2018-11-14 17:07:56,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:56,391 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-11-14 17:07:56,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 17:07:56,391 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-14 17:07:56,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-14 17:07:56,392 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:56,392 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:56,392 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:56,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:56,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1755612877, now seen corresponding path program 13 times [2018-11-14 17:07:56,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:56,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:56,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:56,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:56,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:56,909 INFO L256 TraceCheckUtils]: 0: Hoare triple {8185#true} call ULTIMATE.init(); {8185#true} is VALID [2018-11-14 17:07:56,910 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:56,910 INFO L273 TraceCheckUtils]: 2: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:56,910 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8185#true} {8185#true} #69#return; {8185#true} is VALID [2018-11-14 17:07:56,910 INFO L256 TraceCheckUtils]: 4: Hoare triple {8185#true} call #t~ret13 := main(); {8185#true} is VALID [2018-11-14 17:07:56,911 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:56,912 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:56,912 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:56,913 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:56,913 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:56,913 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:56,914 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:56,914 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:56,914 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:56,915 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:56,915 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:56,916 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:56,917 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:56,917 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:56,918 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:56,919 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:56,919 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:56,920 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:56,940 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:56,957 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:56,966 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:56,979 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:56,988 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:57,001 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:57,010 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:57,025 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:57,034 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:57,058 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:57,070 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:57,072 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:57,072 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:57,074 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:57,074 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:57,076 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:57,076 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:57,078 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:57,078 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:57,078 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:57,079 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:57,079 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:57,080 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:57,080 INFO L273 TraceCheckUtils]: 46: Hoare triple {8200#(<= main_~i~1 13)} assume !(~i~1 < 10000); {8186#false} is VALID [2018-11-14 17:07:57,080 INFO L256 TraceCheckUtils]: 47: Hoare triple {8186#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {8185#true} is VALID [2018-11-14 17:07:57,080 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:57,080 INFO L273 TraceCheckUtils]: 49: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:57,080 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:57,081 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:57,081 INFO L273 TraceCheckUtils]: 52: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:57,081 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:57,081 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:57,081 INFO L273 TraceCheckUtils]: 55: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:57,081 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:57,081 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:57,081 INFO L273 TraceCheckUtils]: 58: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:57,081 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:57,082 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:57,082 INFO L273 TraceCheckUtils]: 61: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:57,082 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:57,082 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:57,082 INFO L273 TraceCheckUtils]: 64: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:57,083 INFO L273 TraceCheckUtils]: 65: Hoare triple {8185#true} assume !(~i~0 < 10000); {8185#true} is VALID [2018-11-14 17:07:57,083 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:57,083 INFO L273 TraceCheckUtils]: 67: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:57,083 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {8185#true} {8186#false} #73#return; {8186#false} is VALID [2018-11-14 17:07:57,083 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:57,084 INFO L256 TraceCheckUtils]: 70: Hoare triple {8186#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {8185#true} is VALID [2018-11-14 17:07:57,084 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:57,084 INFO L273 TraceCheckUtils]: 72: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:57,084 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:57,084 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:57,084 INFO L273 TraceCheckUtils]: 75: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:57,084 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:57,084 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:57,085 INFO L273 TraceCheckUtils]: 78: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:57,085 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:57,085 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:57,085 INFO L273 TraceCheckUtils]: 81: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:57,085 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:57,085 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:57,085 INFO L273 TraceCheckUtils]: 84: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:57,085 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:57,085 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:57,086 INFO L273 TraceCheckUtils]: 87: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:57,086 INFO L273 TraceCheckUtils]: 88: Hoare triple {8185#true} assume !(~i~0 < 10000); {8185#true} is VALID [2018-11-14 17:07:57,086 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:57,086 INFO L273 TraceCheckUtils]: 90: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:57,086 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {8185#true} {8186#false} #75#return; {8186#false} is VALID [2018-11-14 17:07:57,086 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:57,086 INFO L273 TraceCheckUtils]: 93: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,086 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:57,086 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:57,087 INFO L273 TraceCheckUtils]: 96: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,087 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:57,087 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:57,087 INFO L273 TraceCheckUtils]: 99: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,087 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:57,087 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:57,087 INFO L273 TraceCheckUtils]: 102: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,087 INFO L273 TraceCheckUtils]: 103: Hoare triple {8186#false} assume !(~i~2 < 9999); {8186#false} is VALID [2018-11-14 17:07:57,087 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:57,088 INFO L256 TraceCheckUtils]: 105: Hoare triple {8186#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {8185#true} is VALID [2018-11-14 17:07:57,088 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:57,088 INFO L273 TraceCheckUtils]: 107: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:57,088 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:57,088 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:57,088 INFO L273 TraceCheckUtils]: 110: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:57,088 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:57,088 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:57,089 INFO L273 TraceCheckUtils]: 113: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:57,089 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:57,089 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:57,089 INFO L273 TraceCheckUtils]: 116: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:57,089 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:57,089 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:57,089 INFO L273 TraceCheckUtils]: 119: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:57,089 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:57,089 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:57,090 INFO L273 TraceCheckUtils]: 122: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:57,090 INFO L273 TraceCheckUtils]: 123: Hoare triple {8185#true} assume !(~i~0 < 10000); {8185#true} is VALID [2018-11-14 17:07:57,090 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:57,090 INFO L273 TraceCheckUtils]: 125: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:57,090 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {8185#true} {8186#false} #77#return; {8186#false} is VALID [2018-11-14 17:07:57,090 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:57,090 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:57,090 INFO L273 TraceCheckUtils]: 129: Hoare triple {8186#false} assume !false; {8186#false} is VALID [2018-11-14 17:07:57,098 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:57,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:57,098 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:57,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:07:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:57,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:57,446 INFO L256 TraceCheckUtils]: 0: Hoare triple {8185#true} call ULTIMATE.init(); {8185#true} is VALID [2018-11-14 17:07:57,447 INFO L273 TraceCheckUtils]: 1: Hoare triple {8185#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8185#true} is VALID [2018-11-14 17:07:57,447 INFO L273 TraceCheckUtils]: 2: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:57,447 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8185#true} {8185#true} #69#return; {8185#true} is VALID [2018-11-14 17:07:57,447 INFO L256 TraceCheckUtils]: 4: Hoare triple {8185#true} call #t~ret13 := main(); {8185#true} is VALID [2018-11-14 17:07:57,448 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:57,449 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:57,449 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:57,449 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:57,450 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:57,450 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:57,451 INFO L273 TraceCheckUtils]: 11: Hoare triple {8188#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8189#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:57,451 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:57,452 INFO L273 TraceCheckUtils]: 13: Hoare triple {8189#(<= main_~i~1 2)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8189#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:57,452 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:57,453 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:57,453 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:57,454 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:57,455 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:57,455 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:57,456 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:57,457 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:57,457 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:57,458 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:57,458 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:57,459 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:57,460 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:57,460 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:57,461 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:57,461 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:57,462 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:57,462 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:57,463 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:57,464 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:57,464 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:57,465 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:57,466 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:57,466 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:57,467 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:57,467 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:57,468 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:57,469 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:57,469 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:57,470 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:57,470 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:57,471 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:57,472 INFO L273 TraceCheckUtils]: 46: Hoare triple {8200#(<= main_~i~1 13)} assume !(~i~1 < 10000); {8186#false} is VALID [2018-11-14 17:07:57,472 INFO L256 TraceCheckUtils]: 47: Hoare triple {8186#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {8186#false} is VALID [2018-11-14 17:07:57,472 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:57,472 INFO L273 TraceCheckUtils]: 49: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,472 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:57,473 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:57,473 INFO L273 TraceCheckUtils]: 52: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,473 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:57,473 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:57,473 INFO L273 TraceCheckUtils]: 55: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,474 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:57,474 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:57,474 INFO L273 TraceCheckUtils]: 58: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,474 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:57,474 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:57,475 INFO L273 TraceCheckUtils]: 61: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,475 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:57,475 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:57,475 INFO L273 TraceCheckUtils]: 64: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,475 INFO L273 TraceCheckUtils]: 65: Hoare triple {8186#false} assume !(~i~0 < 10000); {8186#false} is VALID [2018-11-14 17:07:57,475 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:57,475 INFO L273 TraceCheckUtils]: 67: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,475 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {8186#false} {8186#false} #73#return; {8186#false} is VALID [2018-11-14 17:07:57,475 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:57,476 INFO L256 TraceCheckUtils]: 70: Hoare triple {8186#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {8186#false} is VALID [2018-11-14 17:07:57,476 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:57,476 INFO L273 TraceCheckUtils]: 72: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,476 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:57,476 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:57,476 INFO L273 TraceCheckUtils]: 75: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,476 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:57,476 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:57,476 INFO L273 TraceCheckUtils]: 78: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,477 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:57,477 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:57,477 INFO L273 TraceCheckUtils]: 81: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,477 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:57,477 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:57,477 INFO L273 TraceCheckUtils]: 84: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,477 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:57,477 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:57,477 INFO L273 TraceCheckUtils]: 87: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,478 INFO L273 TraceCheckUtils]: 88: Hoare triple {8186#false} assume !(~i~0 < 10000); {8186#false} is VALID [2018-11-14 17:07:57,478 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:57,478 INFO L273 TraceCheckUtils]: 90: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,478 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {8186#false} {8186#false} #75#return; {8186#false} is VALID [2018-11-14 17:07:57,478 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:57,478 INFO L273 TraceCheckUtils]: 93: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,478 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:57,478 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:57,478 INFO L273 TraceCheckUtils]: 96: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,479 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:57,479 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:57,479 INFO L273 TraceCheckUtils]: 99: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,479 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:57,479 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:57,479 INFO L273 TraceCheckUtils]: 102: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,479 INFO L273 TraceCheckUtils]: 103: Hoare triple {8186#false} assume !(~i~2 < 9999); {8186#false} is VALID [2018-11-14 17:07:57,479 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:57,479 INFO L256 TraceCheckUtils]: 105: Hoare triple {8186#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {8186#false} is VALID [2018-11-14 17:07:57,479 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:57,480 INFO L273 TraceCheckUtils]: 107: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,480 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:57,480 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:57,480 INFO L273 TraceCheckUtils]: 110: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,480 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:57,480 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:57,480 INFO L273 TraceCheckUtils]: 113: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,480 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:57,480 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:57,481 INFO L273 TraceCheckUtils]: 116: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,481 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:57,481 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:57,481 INFO L273 TraceCheckUtils]: 119: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,481 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:57,481 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:57,481 INFO L273 TraceCheckUtils]: 122: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,481 INFO L273 TraceCheckUtils]: 123: Hoare triple {8186#false} assume !(~i~0 < 10000); {8186#false} is VALID [2018-11-14 17:07:57,481 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:57,481 INFO L273 TraceCheckUtils]: 125: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:57,482 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {8186#false} {8186#false} #77#return; {8186#false} is VALID [2018-11-14 17:07:57,482 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:57,482 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:57,482 INFO L273 TraceCheckUtils]: 129: Hoare triple {8186#false} assume !false; {8186#false} is VALID [2018-11-14 17:07:57,488 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:57,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:57,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-14 17:07:57,509 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 130 [2018-11-14 17:07:57,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:57,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 17:07:57,624 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:57,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 17:07:57,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 17:07:57,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 17:07:57,625 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 17 states. [2018-11-14 17:07:58,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:58,062 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2018-11-14 17:07:58,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 17:07:58,062 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 130 [2018-11-14 17:07:58,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:07:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2018-11-14 17:07:58,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:07:58,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2018-11-14 17:07:58,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 99 transitions. [2018-11-14 17:07:58,169 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:58,172 INFO L225 Difference]: With dead ends: 135 [2018-11-14 17:07:58,172 INFO L226 Difference]: Without dead ends: 93 [2018-11-14 17:07:58,172 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 17:07:58,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-14 17:07:58,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-11-14 17:07:58,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:58,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 92 states. [2018-11-14 17:07:58,200 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 92 states. [2018-11-14 17:07:58,200 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 92 states. [2018-11-14 17:07:58,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:58,203 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-11-14 17:07:58,203 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-14 17:07:58,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:58,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:58,204 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 93 states. [2018-11-14 17:07:58,204 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 93 states. [2018-11-14 17:07:58,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:58,206 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-11-14 17:07:58,206 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-14 17:07:58,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:58,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:58,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:58,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:58,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-14 17:07:58,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-11-14 17:07:58,209 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 130 [2018-11-14 17:07:58,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:58,209 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-11-14 17:07:58,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 17:07:58,209 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-14 17:07:58,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-14 17:07:58,210 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:58,210 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:58,211 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:58,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:58,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1039240391, now seen corresponding path program 14 times [2018-11-14 17:07:58,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:58,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:58,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:58,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:07:58,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:58,682 INFO L256 TraceCheckUtils]: 0: Hoare triple {9084#true} call ULTIMATE.init(); {9084#true} is VALID [2018-11-14 17:07:58,682 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:58,683 INFO L273 TraceCheckUtils]: 2: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:58,683 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9084#true} {9084#true} #69#return; {9084#true} is VALID [2018-11-14 17:07:58,683 INFO L256 TraceCheckUtils]: 4: Hoare triple {9084#true} call #t~ret13 := main(); {9084#true} is VALID [2018-11-14 17:07:58,684 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:58,684 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:58,685 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:58,685 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:58,686 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:58,686 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:58,686 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:58,687 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:58,687 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:58,688 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:58,688 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:58,689 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:58,690 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:58,690 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:58,691 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:58,691 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:58,692 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:58,693 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:58,693 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:58,694 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:58,694 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:58,695 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:58,696 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:58,696 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:58,697 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:58,697 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:58,698 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:58,699 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:58,699 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:58,700 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:58,700 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:58,701 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:58,702 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:58,702 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:58,703 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:58,703 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:58,704 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:58,705 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:58,705 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:58,706 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:58,706 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:58,707 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:58,708 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:58,708 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:58,709 INFO L273 TraceCheckUtils]: 49: Hoare triple {9100#(<= main_~i~1 14)} assume !(~i~1 < 10000); {9085#false} is VALID [2018-11-14 17:07:58,709 INFO L256 TraceCheckUtils]: 50: Hoare triple {9085#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {9084#true} is VALID [2018-11-14 17:07:58,709 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:58,710 INFO L273 TraceCheckUtils]: 52: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:58,710 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:58,710 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:58,710 INFO L273 TraceCheckUtils]: 55: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:58,710 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:58,711 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:58,711 INFO L273 TraceCheckUtils]: 58: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:58,711 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:58,711 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:58,711 INFO L273 TraceCheckUtils]: 61: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:58,712 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:58,712 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:58,712 INFO L273 TraceCheckUtils]: 64: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:58,712 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:58,712 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:58,712 INFO L273 TraceCheckUtils]: 67: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:58,712 INFO L273 TraceCheckUtils]: 68: Hoare triple {9084#true} assume !(~i~0 < 10000); {9084#true} is VALID [2018-11-14 17:07:58,712 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:58,713 INFO L273 TraceCheckUtils]: 70: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:58,713 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {9084#true} {9085#false} #73#return; {9085#false} is VALID [2018-11-14 17:07:58,713 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:58,713 INFO L256 TraceCheckUtils]: 73: Hoare triple {9085#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {9084#true} is VALID [2018-11-14 17:07:58,713 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:58,713 INFO L273 TraceCheckUtils]: 75: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:58,713 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:58,713 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:58,713 INFO L273 TraceCheckUtils]: 78: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:58,714 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:58,714 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:58,714 INFO L273 TraceCheckUtils]: 81: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:58,714 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:58,714 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:58,714 INFO L273 TraceCheckUtils]: 84: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:58,714 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:58,714 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:58,714 INFO L273 TraceCheckUtils]: 87: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:58,715 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:58,715 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:58,715 INFO L273 TraceCheckUtils]: 90: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:58,715 INFO L273 TraceCheckUtils]: 91: Hoare triple {9084#true} assume !(~i~0 < 10000); {9084#true} is VALID [2018-11-14 17:07:58,715 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:58,715 INFO L273 TraceCheckUtils]: 93: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:58,715 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {9084#true} {9085#false} #75#return; {9085#false} is VALID [2018-11-14 17:07:58,715 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:58,716 INFO L273 TraceCheckUtils]: 96: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:58,716 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:58,716 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:58,716 INFO L273 TraceCheckUtils]: 99: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:58,716 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:58,716 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:58,716 INFO L273 TraceCheckUtils]: 102: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:58,716 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:58,717 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:58,717 INFO L273 TraceCheckUtils]: 105: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:58,717 INFO L273 TraceCheckUtils]: 106: Hoare triple {9085#false} assume !(~i~2 < 9999); {9085#false} is VALID [2018-11-14 17:07:58,717 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:58,717 INFO L256 TraceCheckUtils]: 108: Hoare triple {9085#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {9084#true} is VALID [2018-11-14 17:07:58,717 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:58,717 INFO L273 TraceCheckUtils]: 110: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:58,717 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:58,717 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:58,718 INFO L273 TraceCheckUtils]: 113: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:58,718 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:58,718 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:58,718 INFO L273 TraceCheckUtils]: 116: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:58,718 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:58,718 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:58,718 INFO L273 TraceCheckUtils]: 119: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:58,718 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:58,718 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:58,719 INFO L273 TraceCheckUtils]: 122: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:58,719 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:58,719 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:58,719 INFO L273 TraceCheckUtils]: 125: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:58,719 INFO L273 TraceCheckUtils]: 126: Hoare triple {9084#true} assume !(~i~0 < 10000); {9084#true} is VALID [2018-11-14 17:07:58,719 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:58,719 INFO L273 TraceCheckUtils]: 128: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:58,719 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {9084#true} {9085#false} #77#return; {9085#false} is VALID [2018-11-14 17:07:58,720 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:58,720 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:58,720 INFO L273 TraceCheckUtils]: 132: Hoare triple {9085#false} assume !false; {9085#false} is VALID [2018-11-14 17:07:58,730 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:58,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:58,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 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:58,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:07:58,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:07:58,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:58,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:59,075 INFO L256 TraceCheckUtils]: 0: Hoare triple {9084#true} call ULTIMATE.init(); {9084#true} is VALID [2018-11-14 17:07:59,075 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:59,075 INFO L273 TraceCheckUtils]: 2: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:59,076 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9084#true} {9084#true} #69#return; {9084#true} is VALID [2018-11-14 17:07:59,076 INFO L256 TraceCheckUtils]: 4: Hoare triple {9084#true} call #t~ret13 := main(); {9084#true} is VALID [2018-11-14 17:07:59,077 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:59,077 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:59,078 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:59,078 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:59,078 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:59,079 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:59,079 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:59,079 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:59,080 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:59,081 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:59,081 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:59,089 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:59,089 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:59,090 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:59,090 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:59,090 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:59,091 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:59,091 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:59,092 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:59,092 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:59,092 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:59,093 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:59,093 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:59,094 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:59,095 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:59,095 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:59,096 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:59,096 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:59,097 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:59,097 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:59,098 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:59,099 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:59,099 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:59,100 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:59,100 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:59,101 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:59,102 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:59,102 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:59,103 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:59,104 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:59,104 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:59,105 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:59,105 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:59,106 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:59,107 INFO L273 TraceCheckUtils]: 49: Hoare triple {9100#(<= main_~i~1 14)} assume !(~i~1 < 10000); {9085#false} is VALID [2018-11-14 17:07:59,107 INFO L256 TraceCheckUtils]: 50: Hoare triple {9085#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {9085#false} is VALID [2018-11-14 17:07:59,107 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:59,107 INFO L273 TraceCheckUtils]: 52: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:59,107 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:59,108 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:59,108 INFO L273 TraceCheckUtils]: 55: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:59,108 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:59,108 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:59,109 INFO L273 TraceCheckUtils]: 58: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:59,109 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:59,109 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:59,109 INFO L273 TraceCheckUtils]: 61: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:59,109 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:59,110 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:59,110 INFO L273 TraceCheckUtils]: 64: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:59,110 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:59,110 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:59,110 INFO L273 TraceCheckUtils]: 67: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:59,110 INFO L273 TraceCheckUtils]: 68: Hoare triple {9085#false} assume !(~i~0 < 10000); {9085#false} is VALID [2018-11-14 17:07:59,110 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:59,110 INFO L273 TraceCheckUtils]: 70: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:59,110 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {9085#false} {9085#false} #73#return; {9085#false} is VALID [2018-11-14 17:07:59,111 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:59,111 INFO L256 TraceCheckUtils]: 73: Hoare triple {9085#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {9085#false} is VALID [2018-11-14 17:07:59,111 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:59,111 INFO L273 TraceCheckUtils]: 75: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:59,111 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:59,111 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:59,111 INFO L273 TraceCheckUtils]: 78: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:59,111 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:59,112 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:59,112 INFO L273 TraceCheckUtils]: 81: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:59,112 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:59,112 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:59,112 INFO L273 TraceCheckUtils]: 84: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:59,112 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:59,112 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:59,112 INFO L273 TraceCheckUtils]: 87: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:59,113 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:59,113 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:59,113 INFO L273 TraceCheckUtils]: 90: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:59,113 INFO L273 TraceCheckUtils]: 91: Hoare triple {9085#false} assume !(~i~0 < 10000); {9085#false} is VALID [2018-11-14 17:07:59,113 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:59,113 INFO L273 TraceCheckUtils]: 93: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:59,113 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {9085#false} {9085#false} #75#return; {9085#false} is VALID [2018-11-14 17:07:59,113 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:59,113 INFO L273 TraceCheckUtils]: 96: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:59,114 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:59,114 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:59,114 INFO L273 TraceCheckUtils]: 99: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:59,114 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:59,114 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:59,114 INFO L273 TraceCheckUtils]: 102: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:59,114 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:59,114 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:59,115 INFO L273 TraceCheckUtils]: 105: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:59,115 INFO L273 TraceCheckUtils]: 106: Hoare triple {9085#false} assume !(~i~2 < 9999); {9085#false} is VALID [2018-11-14 17:07:59,115 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:59,115 INFO L256 TraceCheckUtils]: 108: Hoare triple {9085#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {9085#false} is VALID [2018-11-14 17:07:59,115 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:59,115 INFO L273 TraceCheckUtils]: 110: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:59,115 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:59,115 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:59,115 INFO L273 TraceCheckUtils]: 113: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:59,116 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:59,116 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:59,116 INFO L273 TraceCheckUtils]: 116: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:59,116 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:59,116 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:59,116 INFO L273 TraceCheckUtils]: 119: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:59,116 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:59,116 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:59,117 INFO L273 TraceCheckUtils]: 122: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:59,117 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:59,117 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:59,117 INFO L273 TraceCheckUtils]: 125: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:59,117 INFO L273 TraceCheckUtils]: 126: Hoare triple {9085#false} assume !(~i~0 < 10000); {9085#false} is VALID [2018-11-14 17:07:59,117 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:59,118 INFO L273 TraceCheckUtils]: 128: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:59,118 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {9085#false} {9085#false} #77#return; {9085#false} is VALID [2018-11-14 17:07:59,118 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:59,118 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:59,118 INFO L273 TraceCheckUtils]: 132: Hoare triple {9085#false} assume !false; {9085#false} is VALID [2018-11-14 17:07:59,126 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:59,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:59,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-14 17:07:59,149 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 133 [2018-11-14 17:07:59,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:59,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 17:07:59,232 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:59,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 17:07:59,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 17:07:59,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:07:59,233 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 18 states. [2018-11-14 17:08:00,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:00,213 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-11-14 17:08:00,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 17:08:00,214 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 133 [2018-11-14 17:08:00,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:00,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:08:00,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 102 transitions. [2018-11-14 17:08:00,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:08:00,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 102 transitions. [2018-11-14 17:08:00,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 102 transitions. [2018-11-14 17:08:00,381 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:08:00,383 INFO L225 Difference]: With dead ends: 138 [2018-11-14 17:08:00,383 INFO L226 Difference]: Without dead ends: 96 [2018-11-14 17:08:00,383 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:08:00,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-14 17:08:00,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-14 17:08:00,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:00,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 95 states. [2018-11-14 17:08:00,485 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 95 states. [2018-11-14 17:08:00,485 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 95 states. [2018-11-14 17:08:00,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:00,487 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-14 17:08:00,487 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-14 17:08:00,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:00,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:00,488 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 96 states. [2018-11-14 17:08:00,488 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 96 states. [2018-11-14 17:08:00,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:00,489 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-14 17:08:00,489 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-14 17:08:00,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:00,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:00,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:00,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:00,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-14 17:08:00,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-11-14 17:08:00,492 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 133 [2018-11-14 17:08:00,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:00,492 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-11-14 17:08:00,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 17:08:00,493 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-14 17:08:00,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-14 17:08:00,494 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:00,494 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:08:00,494 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:00,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:00,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1279003789, now seen corresponding path program 15 times [2018-11-14 17:08:00,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:00,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:00,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:00,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:08:00,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:00,800 INFO L256 TraceCheckUtils]: 0: Hoare triple {10007#true} call ULTIMATE.init(); {10007#true} is VALID [2018-11-14 17:08:00,800 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:08:00,801 INFO L273 TraceCheckUtils]: 2: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:00,801 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10007#true} {10007#true} #69#return; {10007#true} is VALID [2018-11-14 17:08:00,801 INFO L256 TraceCheckUtils]: 4: Hoare triple {10007#true} call #t~ret13 := main(); {10007#true} is VALID [2018-11-14 17:08:00,801 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:08:00,802 INFO L273 TraceCheckUtils]: 6: Hoare triple {10009#(= main_~i~1 0)} assume true; {10009#(= main_~i~1 0)} is VALID [2018-11-14 17:08:00,803 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:08:00,803 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:08:00,803 INFO L273 TraceCheckUtils]: 9: Hoare triple {10010#(<= main_~i~1 1)} assume true; {10010#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:00,804 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:08:00,804 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:08:00,804 INFO L273 TraceCheckUtils]: 12: Hoare triple {10011#(<= main_~i~1 2)} assume true; {10011#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:00,805 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:08:00,806 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:08:00,806 INFO L273 TraceCheckUtils]: 15: Hoare triple {10012#(<= main_~i~1 3)} assume true; {10012#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:00,807 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:08:00,807 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:08:00,808 INFO L273 TraceCheckUtils]: 18: Hoare triple {10013#(<= main_~i~1 4)} assume true; {10013#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:00,809 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:08:00,809 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:08:00,810 INFO L273 TraceCheckUtils]: 21: Hoare triple {10014#(<= main_~i~1 5)} assume true; {10014#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:00,810 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:08:00,811 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:08:00,812 INFO L273 TraceCheckUtils]: 24: Hoare triple {10015#(<= main_~i~1 6)} assume true; {10015#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:00,812 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:08:00,813 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:08:00,813 INFO L273 TraceCheckUtils]: 27: Hoare triple {10016#(<= main_~i~1 7)} assume true; {10016#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:00,814 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:08:00,815 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:08:00,815 INFO L273 TraceCheckUtils]: 30: Hoare triple {10017#(<= main_~i~1 8)} assume true; {10017#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:00,816 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:08:00,817 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:08:00,817 INFO L273 TraceCheckUtils]: 33: Hoare triple {10018#(<= main_~i~1 9)} assume true; {10018#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:00,818 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:08:00,818 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:08:00,819 INFO L273 TraceCheckUtils]: 36: Hoare triple {10019#(<= main_~i~1 10)} assume true; {10019#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:00,819 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:08:00,820 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:08:00,821 INFO L273 TraceCheckUtils]: 39: Hoare triple {10020#(<= main_~i~1 11)} assume true; {10020#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:00,821 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:08:00,822 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:08:00,822 INFO L273 TraceCheckUtils]: 42: Hoare triple {10021#(<= main_~i~1 12)} assume true; {10021#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:00,823 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:08:00,824 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:08:00,824 INFO L273 TraceCheckUtils]: 45: Hoare triple {10022#(<= main_~i~1 13)} assume true; {10022#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:00,825 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:08:00,826 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:08:00,826 INFO L273 TraceCheckUtils]: 48: Hoare triple {10023#(<= main_~i~1 14)} assume true; {10023#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:00,827 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:08:00,827 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:08:00,828 INFO L273 TraceCheckUtils]: 51: Hoare triple {10024#(<= main_~i~1 15)} assume true; {10024#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:00,829 INFO L273 TraceCheckUtils]: 52: Hoare triple {10024#(<= main_~i~1 15)} assume !(~i~1 < 10000); {10008#false} is VALID [2018-11-14 17:08:00,829 INFO L256 TraceCheckUtils]: 53: Hoare triple {10008#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {10007#true} is VALID [2018-11-14 17:08:00,829 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:08:00,829 INFO L273 TraceCheckUtils]: 55: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:00,829 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:08:00,830 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:08:00,830 INFO L273 TraceCheckUtils]: 58: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:00,830 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:08:00,830 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:08:00,830 INFO L273 TraceCheckUtils]: 61: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:00,831 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:08:00,831 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:08:00,831 INFO L273 TraceCheckUtils]: 64: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:00,831 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:08:00,831 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:08:00,832 INFO L273 TraceCheckUtils]: 67: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:00,832 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:08:00,832 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:08:00,832 INFO L273 TraceCheckUtils]: 70: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:00,832 INFO L273 TraceCheckUtils]: 71: Hoare triple {10007#true} assume !(~i~0 < 10000); {10007#true} is VALID [2018-11-14 17:08:00,832 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:08:00,833 INFO L273 TraceCheckUtils]: 73: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:00,833 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {10007#true} {10008#false} #73#return; {10008#false} is VALID [2018-11-14 17:08:00,833 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:08:00,833 INFO L256 TraceCheckUtils]: 76: Hoare triple {10008#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {10007#true} is VALID [2018-11-14 17:08:00,833 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:08:00,834 INFO L273 TraceCheckUtils]: 78: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:00,834 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:08:00,834 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:08:00,834 INFO L273 TraceCheckUtils]: 81: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:00,834 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:08:00,834 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:08:00,834 INFO L273 TraceCheckUtils]: 84: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:00,835 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:08:00,835 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:08:00,835 INFO L273 TraceCheckUtils]: 87: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:00,835 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:08:00,835 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:08:00,835 INFO L273 TraceCheckUtils]: 90: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:00,835 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:08:00,835 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:08:00,835 INFO L273 TraceCheckUtils]: 93: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:00,836 INFO L273 TraceCheckUtils]: 94: Hoare triple {10007#true} assume !(~i~0 < 10000); {10007#true} is VALID [2018-11-14 17:08:00,836 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:08:00,836 INFO L273 TraceCheckUtils]: 96: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:00,836 INFO L268 TraceCheckUtils]: 97: Hoare quadruple {10007#true} {10008#false} #75#return; {10008#false} is VALID [2018-11-14 17:08:00,836 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:08:00,836 INFO L273 TraceCheckUtils]: 99: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:08:00,836 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:08:00,836 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:08:00,836 INFO L273 TraceCheckUtils]: 102: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:08:00,837 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:08:00,837 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:08:00,837 INFO L273 TraceCheckUtils]: 105: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:08:00,837 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:08:00,837 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:08:00,837 INFO L273 TraceCheckUtils]: 108: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:08:00,837 INFO L273 TraceCheckUtils]: 109: Hoare triple {10008#false} assume !(~i~2 < 9999); {10008#false} is VALID [2018-11-14 17:08:00,837 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:08:00,837 INFO L256 TraceCheckUtils]: 111: Hoare triple {10008#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {10007#true} is VALID [2018-11-14 17:08:00,838 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:08:00,838 INFO L273 TraceCheckUtils]: 113: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:00,838 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:08:00,838 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:08:00,838 INFO L273 TraceCheckUtils]: 116: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:00,838 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:08:00,838 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:08:00,838 INFO L273 TraceCheckUtils]: 119: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:00,838 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:08:00,839 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:08:00,839 INFO L273 TraceCheckUtils]: 122: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:00,839 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:08:00,839 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:08:00,839 INFO L273 TraceCheckUtils]: 125: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:00,839 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:08:00,839 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:08:00,839 INFO L273 TraceCheckUtils]: 128: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:00,840 INFO L273 TraceCheckUtils]: 129: Hoare triple {10007#true} assume !(~i~0 < 10000); {10007#true} is VALID [2018-11-14 17:08:00,840 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:08:00,840 INFO L273 TraceCheckUtils]: 131: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:00,840 INFO L268 TraceCheckUtils]: 132: Hoare quadruple {10007#true} {10008#false} #77#return; {10008#false} is VALID [2018-11-14 17:08:00,840 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:08:00,840 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:08:00,840 INFO L273 TraceCheckUtils]: 135: Hoare triple {10008#false} assume !false; {10008#false} is VALID [2018-11-14 17:08:00,848 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:08:00,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:00,849 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:08:00,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:08:00,901 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-14 17:08:00,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:08:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:00,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:01,106 INFO L256 TraceCheckUtils]: 0: Hoare triple {10007#true} call ULTIMATE.init(); {10007#true} is VALID [2018-11-14 17:08:01,107 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:08:01,107 INFO L273 TraceCheckUtils]: 2: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,107 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10007#true} {10007#true} #69#return; {10007#true} is VALID [2018-11-14 17:08:01,108 INFO L256 TraceCheckUtils]: 4: Hoare triple {10007#true} call #t~ret13 := main(); {10007#true} is VALID [2018-11-14 17:08:01,108 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:08:01,108 INFO L273 TraceCheckUtils]: 6: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,108 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:08:01,108 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:08:01,108 INFO L273 TraceCheckUtils]: 9: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,109 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:08:01,109 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:08:01,109 INFO L273 TraceCheckUtils]: 12: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,109 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:08:01,109 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:08:01,109 INFO L273 TraceCheckUtils]: 15: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,109 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:08:01,109 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:08:01,109 INFO L273 TraceCheckUtils]: 18: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,110 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:08:01,110 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:08:01,110 INFO L273 TraceCheckUtils]: 21: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,110 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:08:01,110 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:08:01,110 INFO L273 TraceCheckUtils]: 24: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,110 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:08:01,110 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:08:01,110 INFO L273 TraceCheckUtils]: 27: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,111 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:08:01,111 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:08:01,111 INFO L273 TraceCheckUtils]: 30: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,111 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:08:01,111 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:08:01,111 INFO L273 TraceCheckUtils]: 33: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,111 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:08:01,111 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:08:01,112 INFO L273 TraceCheckUtils]: 36: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,112 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:08:01,112 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:08:01,112 INFO L273 TraceCheckUtils]: 39: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,112 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:08:01,112 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:08:01,112 INFO L273 TraceCheckUtils]: 42: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,112 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:08:01,112 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:08:01,113 INFO L273 TraceCheckUtils]: 45: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,113 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:08:01,113 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:08:01,113 INFO L273 TraceCheckUtils]: 48: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,113 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:08:01,113 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:08:01,113 INFO L273 TraceCheckUtils]: 51: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,113 INFO L273 TraceCheckUtils]: 52: Hoare triple {10007#true} assume !(~i~1 < 10000); {10007#true} is VALID [2018-11-14 17:08:01,113 INFO L256 TraceCheckUtils]: 53: Hoare triple {10007#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {10007#true} is VALID [2018-11-14 17:08:01,114 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:08:01,114 INFO L273 TraceCheckUtils]: 55: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,114 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:08:01,114 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:08:01,114 INFO L273 TraceCheckUtils]: 58: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,114 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:08:01,114 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:08:01,114 INFO L273 TraceCheckUtils]: 61: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,114 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:08:01,115 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:08:01,115 INFO L273 TraceCheckUtils]: 64: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,115 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:08:01,115 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:08:01,115 INFO L273 TraceCheckUtils]: 67: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,115 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:08:01,115 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:08:01,115 INFO L273 TraceCheckUtils]: 70: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,116 INFO L273 TraceCheckUtils]: 71: Hoare triple {10007#true} assume !(~i~0 < 10000); {10007#true} is VALID [2018-11-14 17:08:01,116 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:08:01,116 INFO L273 TraceCheckUtils]: 73: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,116 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {10007#true} {10007#true} #73#return; {10007#true} is VALID [2018-11-14 17:08:01,116 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:08:01,116 INFO L256 TraceCheckUtils]: 76: Hoare triple {10007#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {10007#true} is VALID [2018-11-14 17:08:01,116 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:08:01,116 INFO L273 TraceCheckUtils]: 78: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,116 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:08:01,117 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:08:01,117 INFO L273 TraceCheckUtils]: 81: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,117 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:08:01,117 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:08:01,117 INFO L273 TraceCheckUtils]: 84: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,117 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:08:01,117 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:08:01,117 INFO L273 TraceCheckUtils]: 87: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,117 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:08:01,118 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:08:01,118 INFO L273 TraceCheckUtils]: 90: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,118 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:08:01,118 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:08:01,118 INFO L273 TraceCheckUtils]: 93: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,118 INFO L273 TraceCheckUtils]: 94: Hoare triple {10007#true} assume !(~i~0 < 10000); {10007#true} is VALID [2018-11-14 17:08:01,118 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:08:01,118 INFO L273 TraceCheckUtils]: 96: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:08:01,118 INFO L268 TraceCheckUtils]: 97: Hoare quadruple {10007#true} {10007#true} #75#return; {10007#true} is VALID [2018-11-14 17:08:01,119 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:08:01,119 INFO L273 TraceCheckUtils]: 99: Hoare triple {10322#(<= main_~i~2 0)} assume true; {10322#(<= main_~i~2 0)} is VALID [2018-11-14 17:08:01,120 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:08:01,120 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:08:01,121 INFO L273 TraceCheckUtils]: 102: Hoare triple {10332#(<= main_~i~2 1)} assume true; {10332#(<= main_~i~2 1)} is VALID [2018-11-14 17:08:01,121 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:08:01,121 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:08:01,122 INFO L273 TraceCheckUtils]: 105: Hoare triple {10342#(<= main_~i~2 2)} assume true; {10342#(<= main_~i~2 2)} is VALID [2018-11-14 17:08:01,122 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:08:01,123 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:08:01,124 INFO L273 TraceCheckUtils]: 108: Hoare triple {10352#(<= main_~i~2 3)} assume true; {10352#(<= main_~i~2 3)} is VALID [2018-11-14 17:08:01,124 INFO L273 TraceCheckUtils]: 109: Hoare triple {10352#(<= main_~i~2 3)} assume !(~i~2 < 9999); {10008#false} is VALID [2018-11-14 17:08:01,125 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:08:01,125 INFO L256 TraceCheckUtils]: 111: Hoare triple {10008#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {10008#false} is VALID [2018-11-14 17:08:01,125 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:08:01,125 INFO L273 TraceCheckUtils]: 113: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:08:01,125 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10008#false} is VALID [2018-11-14 17:08:01,126 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:08:01,126 INFO L273 TraceCheckUtils]: 116: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:08:01,126 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10008#false} is VALID [2018-11-14 17:08:01,126 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:08:01,126 INFO L273 TraceCheckUtils]: 119: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:08:01,127 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10008#false} is VALID [2018-11-14 17:08:01,127 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:08:01,127 INFO L273 TraceCheckUtils]: 122: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:08:01,127 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10008#false} is VALID [2018-11-14 17:08:01,127 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:08:01,127 INFO L273 TraceCheckUtils]: 125: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:08:01,128 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10008#false} is VALID [2018-11-14 17:08:01,128 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:08:01,128 INFO L273 TraceCheckUtils]: 128: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:08:01,128 INFO L273 TraceCheckUtils]: 129: Hoare triple {10008#false} assume !(~i~0 < 10000); {10008#false} is VALID [2018-11-14 17:08:01,128 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:08:01,128 INFO L273 TraceCheckUtils]: 131: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:08:01,128 INFO L268 TraceCheckUtils]: 132: Hoare quadruple {10008#false} {10008#false} #77#return; {10008#false} is VALID [2018-11-14 17:08:01,128 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:08:01,129 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:08:01,129 INFO L273 TraceCheckUtils]: 135: Hoare triple {10008#false} assume !false; {10008#false} is VALID [2018-11-14 17:08:01,138 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:08:01,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:01,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6] total 22 [2018-11-14 17:08:01,159 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 136 [2018-11-14 17:08:01,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:01,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 17:08:01,270 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:08:01,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 17:08:01,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 17:08:01,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-11-14 17:08:01,272 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 22 states. [2018-11-14 17:08:01,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:01,782 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-11-14 17:08:01,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 17:08:01,782 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 136 [2018-11-14 17:08:01,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:01,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 17:08:01,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 118 transitions. [2018-11-14 17:08:01,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 17:08:01,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 118 transitions. [2018-11-14 17:08:01,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 118 transitions. [2018-11-14 17:08:01,931 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:08:01,933 INFO L225 Difference]: With dead ends: 145 [2018-11-14 17:08:01,933 INFO L226 Difference]: Without dead ends: 103 [2018-11-14 17:08:01,934 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-11-14 17:08:01,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-14 17:08:01,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-11-14 17:08:01,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:01,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 101 states. [2018-11-14 17:08:01,972 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 101 states. [2018-11-14 17:08:01,972 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 101 states. [2018-11-14 17:08:01,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:01,974 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-11-14 17:08:01,974 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-14 17:08:01,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:01,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:01,975 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 103 states. [2018-11-14 17:08:01,991 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 103 states. [2018-11-14 17:08:01,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:01,996 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-11-14 17:08:01,996 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-14 17:08:01,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:01,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:01,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:01,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:01,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-14 17:08:02,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2018-11-14 17:08:02,000 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 136 [2018-11-14 17:08:02,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:02,001 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2018-11-14 17:08:02,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-14 17:08:02,001 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-14 17:08:02,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-14 17:08:02,002 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:02,002 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:08:02,002 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:02,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:02,003 INFO L82 PathProgramCache]: Analyzing trace with hash 562002789, now seen corresponding path program 16 times [2018-11-14 17:08:02,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:02,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:02,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:02,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:08:02,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:02,370 INFO L256 TraceCheckUtils]: 0: Hoare triple {10974#true} call ULTIMATE.init(); {10974#true} is VALID [2018-11-14 17:08:02,371 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:08:02,371 INFO L273 TraceCheckUtils]: 2: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,371 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10974#true} {10974#true} #69#return; {10974#true} is VALID [2018-11-14 17:08:02,371 INFO L256 TraceCheckUtils]: 4: Hoare triple {10974#true} call #t~ret13 := main(); {10974#true} is VALID [2018-11-14 17:08:02,372 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:08:02,372 INFO L273 TraceCheckUtils]: 6: Hoare triple {10976#(= main_~i~1 0)} assume true; {10976#(= main_~i~1 0)} is VALID [2018-11-14 17:08:02,373 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:08:02,373 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:08:02,374 INFO L273 TraceCheckUtils]: 9: Hoare triple {10977#(<= main_~i~1 1)} assume true; {10977#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:02,374 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:08:02,374 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:08:02,375 INFO L273 TraceCheckUtils]: 12: Hoare triple {10978#(<= main_~i~1 2)} assume true; {10978#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:02,375 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:08:02,376 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:08:02,377 INFO L273 TraceCheckUtils]: 15: Hoare triple {10979#(<= main_~i~1 3)} assume true; {10979#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:02,377 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:08:02,378 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:08:02,378 INFO L273 TraceCheckUtils]: 18: Hoare triple {10980#(<= main_~i~1 4)} assume true; {10980#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:02,379 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:08:02,380 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:08:02,380 INFO L273 TraceCheckUtils]: 21: Hoare triple {10981#(<= main_~i~1 5)} assume true; {10981#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:02,381 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:08:02,381 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:08:02,382 INFO L273 TraceCheckUtils]: 24: Hoare triple {10982#(<= main_~i~1 6)} assume true; {10982#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:02,382 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:08:02,383 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:08:02,384 INFO L273 TraceCheckUtils]: 27: Hoare triple {10983#(<= main_~i~1 7)} assume true; {10983#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:02,384 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:08:02,385 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:08:02,386 INFO L273 TraceCheckUtils]: 30: Hoare triple {10984#(<= main_~i~1 8)} assume true; {10984#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:02,386 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:08:02,387 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:08:02,387 INFO L273 TraceCheckUtils]: 33: Hoare triple {10985#(<= main_~i~1 9)} assume true; {10985#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:02,388 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:08:02,389 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:08:02,389 INFO L273 TraceCheckUtils]: 36: Hoare triple {10986#(<= main_~i~1 10)} assume true; {10986#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:02,390 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:08:02,390 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:08:02,391 INFO L273 TraceCheckUtils]: 39: Hoare triple {10987#(<= main_~i~1 11)} assume true; {10987#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:02,392 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:08:02,392 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:08:02,393 INFO L273 TraceCheckUtils]: 42: Hoare triple {10988#(<= main_~i~1 12)} assume true; {10988#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:02,393 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:08:02,394 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:08:02,395 INFO L273 TraceCheckUtils]: 45: Hoare triple {10989#(<= main_~i~1 13)} assume true; {10989#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:02,395 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:08:02,396 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:08:02,396 INFO L273 TraceCheckUtils]: 48: Hoare triple {10990#(<= main_~i~1 14)} assume true; {10990#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:02,397 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:08:02,398 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:08:02,398 INFO L273 TraceCheckUtils]: 51: Hoare triple {10991#(<= main_~i~1 15)} assume true; {10991#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:02,399 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:08:02,399 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:08:02,400 INFO L273 TraceCheckUtils]: 54: Hoare triple {10992#(<= main_~i~1 16)} assume true; {10992#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:02,401 INFO L273 TraceCheckUtils]: 55: Hoare triple {10992#(<= main_~i~1 16)} assume !(~i~1 < 10000); {10975#false} is VALID [2018-11-14 17:08:02,401 INFO L256 TraceCheckUtils]: 56: Hoare triple {10975#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 17:08:02,401 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:08:02,401 INFO L273 TraceCheckUtils]: 58: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,402 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:08:02,402 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:08:02,402 INFO L273 TraceCheckUtils]: 61: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,402 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:08:02,402 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:08:02,402 INFO L273 TraceCheckUtils]: 64: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,403 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:08:02,403 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:08:02,403 INFO L273 TraceCheckUtils]: 67: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,403 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:08:02,403 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:08:02,404 INFO L273 TraceCheckUtils]: 70: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,404 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:08:02,404 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:08:02,404 INFO L273 TraceCheckUtils]: 73: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,404 INFO L273 TraceCheckUtils]: 74: Hoare triple {10974#true} assume !(~i~0 < 10000); {10974#true} is VALID [2018-11-14 17:08:02,405 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:08:02,405 INFO L273 TraceCheckUtils]: 76: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,405 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {10974#true} {10975#false} #73#return; {10975#false} is VALID [2018-11-14 17:08:02,405 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:08:02,405 INFO L256 TraceCheckUtils]: 79: Hoare triple {10975#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 17:08:02,406 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:08:02,406 INFO L273 TraceCheckUtils]: 81: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,406 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:08:02,406 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:08:02,406 INFO L273 TraceCheckUtils]: 84: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,406 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:08:02,406 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:08:02,406 INFO L273 TraceCheckUtils]: 87: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,407 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:08:02,407 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:08:02,407 INFO L273 TraceCheckUtils]: 90: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,407 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:08:02,407 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:08:02,407 INFO L273 TraceCheckUtils]: 93: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,407 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:08:02,407 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:08:02,407 INFO L273 TraceCheckUtils]: 96: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,408 INFO L273 TraceCheckUtils]: 97: Hoare triple {10974#true} assume !(~i~0 < 10000); {10974#true} is VALID [2018-11-14 17:08:02,408 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:08:02,408 INFO L273 TraceCheckUtils]: 99: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,408 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {10974#true} {10975#false} #75#return; {10975#false} is VALID [2018-11-14 17:08:02,408 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:08:02,408 INFO L273 TraceCheckUtils]: 102: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 17:08:02,408 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:08:02,408 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:08:02,408 INFO L273 TraceCheckUtils]: 105: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 17:08:02,409 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:08:02,409 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:08:02,409 INFO L273 TraceCheckUtils]: 108: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 17:08:02,409 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:08:02,409 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:08:02,409 INFO L273 TraceCheckUtils]: 111: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 17:08:02,409 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:08:02,409 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:08:02,409 INFO L273 TraceCheckUtils]: 114: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 17:08:02,410 INFO L273 TraceCheckUtils]: 115: Hoare triple {10975#false} assume !(~i~2 < 9999); {10975#false} is VALID [2018-11-14 17:08:02,410 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:08:02,410 INFO L256 TraceCheckUtils]: 117: Hoare triple {10975#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 17:08:02,410 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:08:02,410 INFO L273 TraceCheckUtils]: 119: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,410 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:08:02,410 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:08:02,410 INFO L273 TraceCheckUtils]: 122: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,410 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:08:02,411 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:08:02,411 INFO L273 TraceCheckUtils]: 125: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,411 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:08:02,411 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:08:02,411 INFO L273 TraceCheckUtils]: 128: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,411 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:08:02,411 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:08:02,411 INFO L273 TraceCheckUtils]: 131: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,411 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:08:02,412 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:08:02,412 INFO L273 TraceCheckUtils]: 134: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,412 INFO L273 TraceCheckUtils]: 135: Hoare triple {10974#true} assume !(~i~0 < 10000); {10974#true} is VALID [2018-11-14 17:08:02,412 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:08:02,412 INFO L273 TraceCheckUtils]: 137: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,412 INFO L268 TraceCheckUtils]: 138: Hoare quadruple {10974#true} {10975#false} #77#return; {10975#false} is VALID [2018-11-14 17:08:02,412 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:08:02,412 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:08:02,413 INFO L273 TraceCheckUtils]: 141: Hoare triple {10975#false} assume !false; {10975#false} is VALID [2018-11-14 17:08:02,421 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:08:02,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:02,422 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:08:02,432 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:08:02,480 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:08:02,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:08:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:02,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:02,776 INFO L256 TraceCheckUtils]: 0: Hoare triple {10974#true} call ULTIMATE.init(); {10974#true} is VALID [2018-11-14 17:08:02,777 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:08:02,777 INFO L273 TraceCheckUtils]: 2: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,777 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10974#true} {10974#true} #69#return; {10974#true} is VALID [2018-11-14 17:08:02,777 INFO L256 TraceCheckUtils]: 4: Hoare triple {10974#true} call #t~ret13 := main(); {10974#true} is VALID [2018-11-14 17:08:02,778 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:08:02,778 INFO L273 TraceCheckUtils]: 6: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,778 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:08:02,778 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:08:02,778 INFO L273 TraceCheckUtils]: 9: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,779 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:08:02,779 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:08:02,779 INFO L273 TraceCheckUtils]: 12: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,779 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:08:02,779 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:08:02,779 INFO L273 TraceCheckUtils]: 15: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,779 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:08:02,779 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:08:02,779 INFO L273 TraceCheckUtils]: 18: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,780 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:08:02,780 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:08:02,780 INFO L273 TraceCheckUtils]: 21: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,780 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:08:02,780 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:08:02,780 INFO L273 TraceCheckUtils]: 24: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,780 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:08:02,780 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:08:02,780 INFO L273 TraceCheckUtils]: 27: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,781 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:08:02,781 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:08:02,781 INFO L273 TraceCheckUtils]: 30: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,781 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:08:02,781 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:08:02,781 INFO L273 TraceCheckUtils]: 33: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,781 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:08:02,781 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:08:02,782 INFO L273 TraceCheckUtils]: 36: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,782 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:08:02,782 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:08:02,782 INFO L273 TraceCheckUtils]: 39: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,782 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:08:02,782 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:08:02,782 INFO L273 TraceCheckUtils]: 42: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,782 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:08:02,782 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:08:02,783 INFO L273 TraceCheckUtils]: 45: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,783 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:08:02,783 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:08:02,783 INFO L273 TraceCheckUtils]: 48: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,783 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:08:02,783 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:08:02,783 INFO L273 TraceCheckUtils]: 51: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,783 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:08:02,783 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:08:02,784 INFO L273 TraceCheckUtils]: 54: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,784 INFO L273 TraceCheckUtils]: 55: Hoare triple {10974#true} assume !(~i~1 < 10000); {10974#true} is VALID [2018-11-14 17:08:02,784 INFO L256 TraceCheckUtils]: 56: Hoare triple {10974#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 17:08:02,784 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:08:02,784 INFO L273 TraceCheckUtils]: 58: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,784 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:08:02,784 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:08:02,784 INFO L273 TraceCheckUtils]: 61: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,784 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:08:02,785 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:08:02,785 INFO L273 TraceCheckUtils]: 64: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,785 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:08:02,785 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:08:02,785 INFO L273 TraceCheckUtils]: 67: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,785 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:08:02,785 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:08:02,785 INFO L273 TraceCheckUtils]: 70: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,786 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:08:02,786 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:08:02,786 INFO L273 TraceCheckUtils]: 73: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,786 INFO L273 TraceCheckUtils]: 74: Hoare triple {10974#true} assume !(~i~0 < 10000); {10974#true} is VALID [2018-11-14 17:08:02,786 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:08:02,786 INFO L273 TraceCheckUtils]: 76: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,786 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {10974#true} {10974#true} #73#return; {10974#true} is VALID [2018-11-14 17:08:02,786 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:08:02,786 INFO L256 TraceCheckUtils]: 79: Hoare triple {10974#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 17:08:02,787 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:08:02,787 INFO L273 TraceCheckUtils]: 81: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,787 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:08:02,787 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:08:02,787 INFO L273 TraceCheckUtils]: 84: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,787 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:08:02,787 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:08:02,787 INFO L273 TraceCheckUtils]: 87: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,787 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:08:02,788 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:08:02,788 INFO L273 TraceCheckUtils]: 90: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,788 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:08:02,788 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:08:02,788 INFO L273 TraceCheckUtils]: 93: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,788 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:08:02,788 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:08:02,789 INFO L273 TraceCheckUtils]: 96: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,789 INFO L273 TraceCheckUtils]: 97: Hoare triple {10974#true} assume !(~i~0 < 10000); {10974#true} is VALID [2018-11-14 17:08:02,789 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:08:02,789 INFO L273 TraceCheckUtils]: 99: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,789 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {10974#true} {10974#true} #75#return; {10974#true} is VALID [2018-11-14 17:08:02,789 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:08:02,790 INFO L273 TraceCheckUtils]: 102: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,790 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:08:02,790 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:08:02,790 INFO L273 TraceCheckUtils]: 105: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,790 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:08:02,790 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:08:02,791 INFO L273 TraceCheckUtils]: 108: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,791 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:08:02,791 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:08:02,791 INFO L273 TraceCheckUtils]: 111: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,791 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:08:02,792 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:08:02,792 INFO L273 TraceCheckUtils]: 114: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:08:02,792 INFO L273 TraceCheckUtils]: 115: Hoare triple {10974#true} assume !(~i~2 < 9999); {10974#true} is VALID [2018-11-14 17:08:02,792 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:08:02,792 INFO L256 TraceCheckUtils]: 117: Hoare triple {10974#true} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 17:08:02,814 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#(<= bor_~i~0 1)} is VALID [2018-11-14 17:08:02,829 INFO L273 TraceCheckUtils]: 119: Hoare triple {11350#(<= bor_~i~0 1)} assume true; {11350#(<= bor_~i~0 1)} is VALID [2018-11-14 17:08:02,838 INFO L273 TraceCheckUtils]: 120: Hoare triple {11350#(<= bor_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11350#(<= bor_~i~0 1)} is VALID [2018-11-14 17:08:02,853 INFO L273 TraceCheckUtils]: 121: Hoare triple {11350#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11360#(<= bor_~i~0 2)} is VALID [2018-11-14 17:08:02,862 INFO L273 TraceCheckUtils]: 122: Hoare triple {11360#(<= bor_~i~0 2)} assume true; {11360#(<= bor_~i~0 2)} is VALID [2018-11-14 17:08:02,875 INFO L273 TraceCheckUtils]: 123: Hoare triple {11360#(<= bor_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11360#(<= bor_~i~0 2)} is VALID [2018-11-14 17:08:02,884 INFO L273 TraceCheckUtils]: 124: Hoare triple {11360#(<= bor_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11370#(<= bor_~i~0 3)} is VALID [2018-11-14 17:08:02,896 INFO L273 TraceCheckUtils]: 125: Hoare triple {11370#(<= bor_~i~0 3)} assume true; {11370#(<= bor_~i~0 3)} is VALID [2018-11-14 17:08:02,909 INFO L273 TraceCheckUtils]: 126: Hoare triple {11370#(<= bor_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11370#(<= bor_~i~0 3)} is VALID [2018-11-14 17:08:02,923 INFO L273 TraceCheckUtils]: 127: Hoare triple {11370#(<= bor_~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11380#(<= bor_~i~0 4)} is VALID [2018-11-14 17:08:02,932 INFO L273 TraceCheckUtils]: 128: Hoare triple {11380#(<= bor_~i~0 4)} assume true; {11380#(<= bor_~i~0 4)} is VALID [2018-11-14 17:08:02,942 INFO L273 TraceCheckUtils]: 129: Hoare triple {11380#(<= bor_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11380#(<= bor_~i~0 4)} is VALID [2018-11-14 17:08:02,953 INFO L273 TraceCheckUtils]: 130: Hoare triple {11380#(<= bor_~i~0 4)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11390#(<= bor_~i~0 5)} is VALID [2018-11-14 17:08:02,966 INFO L273 TraceCheckUtils]: 131: Hoare triple {11390#(<= bor_~i~0 5)} assume true; {11390#(<= bor_~i~0 5)} is VALID [2018-11-14 17:08:02,979 INFO L273 TraceCheckUtils]: 132: Hoare triple {11390#(<= bor_~i~0 5)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11390#(<= bor_~i~0 5)} is VALID [2018-11-14 17:08:02,991 INFO L273 TraceCheckUtils]: 133: Hoare triple {11390#(<= bor_~i~0 5)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11400#(<= bor_~i~0 6)} is VALID [2018-11-14 17:08:03,004 INFO L273 TraceCheckUtils]: 134: Hoare triple {11400#(<= bor_~i~0 6)} assume true; {11400#(<= bor_~i~0 6)} is VALID [2018-11-14 17:08:03,017 INFO L273 TraceCheckUtils]: 135: Hoare triple {11400#(<= bor_~i~0 6)} assume !(~i~0 < 10000); {10975#false} is VALID [2018-11-14 17:08:03,017 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:08:03,017 INFO L273 TraceCheckUtils]: 137: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 17:08:03,018 INFO L268 TraceCheckUtils]: 138: Hoare quadruple {10975#false} {10974#true} #77#return; {10975#false} is VALID [2018-11-14 17:08:03,018 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:08:03,018 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:08:03,018 INFO L273 TraceCheckUtils]: 141: Hoare triple {10975#false} assume !false; {10975#false} is VALID [2018-11-14 17:08:03,030 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:08:03,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:03,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 8] total 25 [2018-11-14 17:08:03,063 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 142 [2018-11-14 17:08:03,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:03,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-14 17:08:03,212 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:08:03,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-14 17:08:03,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-14 17:08:03,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=402, Unknown=0, NotChecked=0, Total=600 [2018-11-14 17:08:03,213 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 25 states. [2018-11-14 17:08:04,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:04,384 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2018-11-14 17:08:04,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 17:08:04,385 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 142 [2018-11-14 17:08:04,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:04,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 17:08:04,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 130 transitions. [2018-11-14 17:08:04,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 17:08:04,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 130 transitions. [2018-11-14 17:08:04,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 130 transitions. [2018-11-14 17:08:04,574 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:08:04,577 INFO L225 Difference]: With dead ends: 154 [2018-11-14 17:08:04,577 INFO L226 Difference]: Without dead ends: 109 [2018-11-14 17:08:04,578 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=402, Unknown=0, NotChecked=0, Total=600 [2018-11-14 17:08:04,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-14 17:08:04,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-11-14 17:08:04,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:04,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 107 states. [2018-11-14 17:08:04,604 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 107 states. [2018-11-14 17:08:04,604 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 107 states. [2018-11-14 17:08:04,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:04,607 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-11-14 17:08:04,607 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-11-14 17:08:04,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:04,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:04,608 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 109 states. [2018-11-14 17:08:04,608 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 109 states. [2018-11-14 17:08:04,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:04,610 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-11-14 17:08:04,611 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-11-14 17:08:04,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:04,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:04,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:04,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:04,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-14 17:08:04,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-11-14 17:08:04,614 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 142 [2018-11-14 17:08:04,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:04,614 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-11-14 17:08:04,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-14 17:08:04,614 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-11-14 17:08:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-14 17:08:04,615 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:04,616 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:08:04,616 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:04,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:04,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1450365401, now seen corresponding path program 17 times [2018-11-14 17:08:04,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:04,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:04,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:04,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:08:04,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:05,796 INFO L256 TraceCheckUtils]: 0: Hoare triple {11994#true} call ULTIMATE.init(); {11994#true} is VALID [2018-11-14 17:08:05,796 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:08:05,796 INFO L273 TraceCheckUtils]: 2: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:05,797 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11994#true} {11994#true} #69#return; {11994#true} is VALID [2018-11-14 17:08:05,797 INFO L256 TraceCheckUtils]: 4: Hoare triple {11994#true} call #t~ret13 := main(); {11994#true} is VALID [2018-11-14 17:08:05,797 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:08:05,797 INFO L273 TraceCheckUtils]: 6: Hoare triple {11996#(= main_~i~1 0)} assume true; {11996#(= main_~i~1 0)} is VALID [2018-11-14 17:08:05,798 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:08:05,798 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:08:05,799 INFO L273 TraceCheckUtils]: 9: Hoare triple {11997#(<= main_~i~1 1)} assume true; {11997#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:05,799 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:08:05,799 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:08:05,800 INFO L273 TraceCheckUtils]: 12: Hoare triple {11998#(<= main_~i~1 2)} assume true; {11998#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:05,800 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:08:05,800 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:08:05,801 INFO L273 TraceCheckUtils]: 15: Hoare triple {11999#(<= main_~i~1 3)} assume true; {11999#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:05,801 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:08:05,801 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:08:05,802 INFO L273 TraceCheckUtils]: 18: Hoare triple {12000#(<= main_~i~1 4)} assume true; {12000#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:05,803 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:08:05,803 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:08:05,804 INFO L273 TraceCheckUtils]: 21: Hoare triple {12001#(<= main_~i~1 5)} assume true; {12001#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:05,804 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:08:05,805 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:08:05,806 INFO L273 TraceCheckUtils]: 24: Hoare triple {12002#(<= main_~i~1 6)} assume true; {12002#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:05,806 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:08:05,807 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:08:05,807 INFO L273 TraceCheckUtils]: 27: Hoare triple {12003#(<= main_~i~1 7)} assume true; {12003#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:05,808 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:08:05,809 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:08:05,809 INFO L273 TraceCheckUtils]: 30: Hoare triple {12004#(<= main_~i~1 8)} assume true; {12004#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:05,810 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:08:05,810 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:08:05,811 INFO L273 TraceCheckUtils]: 33: Hoare triple {12005#(<= main_~i~1 9)} assume true; {12005#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:05,811 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:08:05,812 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:08:05,813 INFO L273 TraceCheckUtils]: 36: Hoare triple {12006#(<= main_~i~1 10)} assume true; {12006#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:05,813 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:08:05,814 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:08:05,814 INFO L273 TraceCheckUtils]: 39: Hoare triple {12007#(<= main_~i~1 11)} assume true; {12007#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:05,815 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:08:05,816 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:08:05,816 INFO L273 TraceCheckUtils]: 42: Hoare triple {12008#(<= main_~i~1 12)} assume true; {12008#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:05,817 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:08:05,817 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:08:05,818 INFO L273 TraceCheckUtils]: 45: Hoare triple {12009#(<= main_~i~1 13)} assume true; {12009#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:05,818 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:08:05,819 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:08:05,820 INFO L273 TraceCheckUtils]: 48: Hoare triple {12010#(<= main_~i~1 14)} assume true; {12010#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:05,820 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:08:05,821 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:08:05,821 INFO L273 TraceCheckUtils]: 51: Hoare triple {12011#(<= main_~i~1 15)} assume true; {12011#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:05,822 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:08:05,823 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:08:05,823 INFO L273 TraceCheckUtils]: 54: Hoare triple {12012#(<= main_~i~1 16)} assume true; {12012#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:05,824 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:08:05,825 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:08:05,825 INFO L273 TraceCheckUtils]: 57: Hoare triple {12013#(<= main_~i~1 17)} assume true; {12013#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:05,826 INFO L273 TraceCheckUtils]: 58: Hoare triple {12013#(<= main_~i~1 17)} assume !(~i~1 < 10000); {11995#false} is VALID [2018-11-14 17:08:05,826 INFO L256 TraceCheckUtils]: 59: Hoare triple {11995#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {11994#true} is VALID [2018-11-14 17:08:05,826 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:08:05,826 INFO L273 TraceCheckUtils]: 61: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:05,827 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:08:05,827 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:08:05,827 INFO L273 TraceCheckUtils]: 64: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:05,827 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:08:05,827 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:08:05,827 INFO L273 TraceCheckUtils]: 67: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:05,828 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:08:05,828 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:08:05,828 INFO L273 TraceCheckUtils]: 70: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:05,828 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:08:05,828 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:08:05,828 INFO L273 TraceCheckUtils]: 73: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:05,829 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:08:05,829 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:08:05,829 INFO L273 TraceCheckUtils]: 76: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:05,829 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:08:05,829 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:08:05,829 INFO L273 TraceCheckUtils]: 79: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:05,829 INFO L273 TraceCheckUtils]: 80: Hoare triple {11994#true} assume !(~i~0 < 10000); {11994#true} is VALID [2018-11-14 17:08:05,829 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:08:05,829 INFO L273 TraceCheckUtils]: 82: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:05,830 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {11994#true} {11995#false} #73#return; {11995#false} is VALID [2018-11-14 17:08:05,830 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:08:05,830 INFO L256 TraceCheckUtils]: 85: Hoare triple {11995#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {11994#true} is VALID [2018-11-14 17:08:05,830 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:08:05,830 INFO L273 TraceCheckUtils]: 87: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:05,830 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:08:05,830 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:08:05,830 INFO L273 TraceCheckUtils]: 90: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:05,830 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:08:05,831 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:08:05,831 INFO L273 TraceCheckUtils]: 93: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:05,831 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:08:05,831 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:08:05,831 INFO L273 TraceCheckUtils]: 96: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:05,831 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:08:05,831 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:08:05,831 INFO L273 TraceCheckUtils]: 99: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:05,831 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:08:05,832 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:08:05,832 INFO L273 TraceCheckUtils]: 102: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:05,832 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:08:05,832 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:08:05,832 INFO L273 TraceCheckUtils]: 105: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:05,832 INFO L273 TraceCheckUtils]: 106: Hoare triple {11994#true} assume !(~i~0 < 10000); {11994#true} is VALID [2018-11-14 17:08:05,832 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:08:05,832 INFO L273 TraceCheckUtils]: 108: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:05,832 INFO L268 TraceCheckUtils]: 109: Hoare quadruple {11994#true} {11995#false} #75#return; {11995#false} is VALID [2018-11-14 17:08:05,832 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:08:05,833 INFO L273 TraceCheckUtils]: 111: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:08:05,833 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:08:05,833 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:08:05,833 INFO L273 TraceCheckUtils]: 114: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:08:05,833 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:08:05,833 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:08:05,833 INFO L273 TraceCheckUtils]: 117: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:08:05,833 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:08:05,833 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:08:05,834 INFO L273 TraceCheckUtils]: 120: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:08:05,834 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:08:05,834 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:08:05,834 INFO L273 TraceCheckUtils]: 123: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:08:05,834 INFO L273 TraceCheckUtils]: 124: Hoare triple {11995#false} assume !(~i~2 < 9999); {11995#false} is VALID [2018-11-14 17:08:05,834 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:08:05,834 INFO L256 TraceCheckUtils]: 126: Hoare triple {11995#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {11994#true} is VALID [2018-11-14 17:08:05,834 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:08:05,834 INFO L273 TraceCheckUtils]: 128: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:05,835 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:08:05,835 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:08:05,835 INFO L273 TraceCheckUtils]: 131: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:05,835 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:08:05,835 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:08:05,835 INFO L273 TraceCheckUtils]: 134: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:05,835 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:08:05,835 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:08:05,835 INFO L273 TraceCheckUtils]: 137: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:05,836 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:08:05,836 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:08:05,836 INFO L273 TraceCheckUtils]: 140: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:05,836 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:08:05,836 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:08:05,836 INFO L273 TraceCheckUtils]: 143: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:05,836 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:08:05,836 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:08:05,836 INFO L273 TraceCheckUtils]: 146: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:05,837 INFO L273 TraceCheckUtils]: 147: Hoare triple {11994#true} assume !(~i~0 < 10000); {11994#true} is VALID [2018-11-14 17:08:05,837 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:08:05,837 INFO L273 TraceCheckUtils]: 149: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:05,837 INFO L268 TraceCheckUtils]: 150: Hoare quadruple {11994#true} {11995#false} #77#return; {11995#false} is VALID [2018-11-14 17:08:05,837 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:08:05,837 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:08:05,837 INFO L273 TraceCheckUtils]: 153: Hoare triple {11995#false} assume !false; {11995#false} is VALID [2018-11-14 17:08:05,851 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:08:05,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:05,851 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:08:05,868 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:08:06,465 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-11-14 17:08:06,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:08:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:06,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:06,706 INFO L256 TraceCheckUtils]: 0: Hoare triple {11994#true} call ULTIMATE.init(); {11994#true} is VALID [2018-11-14 17:08:06,706 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:08:06,707 INFO L273 TraceCheckUtils]: 2: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:06,707 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11994#true} {11994#true} #69#return; {11994#true} is VALID [2018-11-14 17:08:06,707 INFO L256 TraceCheckUtils]: 4: Hoare triple {11994#true} call #t~ret13 := main(); {11994#true} is VALID [2018-11-14 17:08:06,707 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:08:06,707 INFO L273 TraceCheckUtils]: 6: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:06,708 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:08:06,708 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:08:06,708 INFO L273 TraceCheckUtils]: 9: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:06,708 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:08:06,708 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:08:06,709 INFO L273 TraceCheckUtils]: 12: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:06,709 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:08:06,709 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:08:06,709 INFO L273 TraceCheckUtils]: 15: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:06,709 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:08:06,710 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:08:06,710 INFO L273 TraceCheckUtils]: 18: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:06,710 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:08:06,710 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:08:06,710 INFO L273 TraceCheckUtils]: 21: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:06,710 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:08:06,711 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:08:06,711 INFO L273 TraceCheckUtils]: 24: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:06,711 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:08:06,711 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:08:06,711 INFO L273 TraceCheckUtils]: 27: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:06,711 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:08:06,712 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:08:06,712 INFO L273 TraceCheckUtils]: 30: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:06,712 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:08:06,712 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:08:06,712 INFO L273 TraceCheckUtils]: 33: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:06,712 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:08:06,713 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:08:06,713 INFO L273 TraceCheckUtils]: 36: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:06,713 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:08:06,713 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:08:06,713 INFO L273 TraceCheckUtils]: 39: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:06,713 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:08:06,714 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:08:06,714 INFO L273 TraceCheckUtils]: 42: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:06,714 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:08:06,714 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:08:06,714 INFO L273 TraceCheckUtils]: 45: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:06,714 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:08:06,715 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:08:06,715 INFO L273 TraceCheckUtils]: 48: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:06,715 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:08:06,715 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:08:06,715 INFO L273 TraceCheckUtils]: 51: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:06,715 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:08:06,716 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:08:06,716 INFO L273 TraceCheckUtils]: 54: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:06,716 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:08:06,716 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:08:06,716 INFO L273 TraceCheckUtils]: 57: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:08:06,716 INFO L273 TraceCheckUtils]: 58: Hoare triple {11994#true} assume !(~i~1 < 10000); {11994#true} is VALID [2018-11-14 17:08:06,717 INFO L256 TraceCheckUtils]: 59: Hoare triple {11994#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {11994#true} is VALID [2018-11-14 17:08:06,735 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#(<= bor_~i~0 1)} is VALID [2018-11-14 17:08:06,750 INFO L273 TraceCheckUtils]: 61: Hoare triple {12197#(<= bor_~i~0 1)} assume true; {12197#(<= bor_~i~0 1)} is VALID [2018-11-14 17:08:06,755 INFO L273 TraceCheckUtils]: 62: Hoare triple {12197#(<= bor_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12197#(<= bor_~i~0 1)} is VALID [2018-11-14 17:08:06,755 INFO L273 TraceCheckUtils]: 63: Hoare triple {12197#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12207#(<= bor_~i~0 2)} is VALID [2018-11-14 17:08:06,756 INFO L273 TraceCheckUtils]: 64: Hoare triple {12207#(<= bor_~i~0 2)} assume true; {12207#(<= bor_~i~0 2)} is VALID [2018-11-14 17:08:06,758 INFO L273 TraceCheckUtils]: 65: Hoare triple {12207#(<= bor_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12207#(<= bor_~i~0 2)} is VALID [2018-11-14 17:08:06,758 INFO L273 TraceCheckUtils]: 66: Hoare triple {12207#(<= bor_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12217#(<= bor_~i~0 3)} is VALID [2018-11-14 17:08:06,761 INFO L273 TraceCheckUtils]: 67: Hoare triple {12217#(<= bor_~i~0 3)} assume true; {12217#(<= bor_~i~0 3)} is VALID [2018-11-14 17:08:06,761 INFO L273 TraceCheckUtils]: 68: Hoare triple {12217#(<= bor_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12217#(<= bor_~i~0 3)} is VALID [2018-11-14 17:08:06,764 INFO L273 TraceCheckUtils]: 69: Hoare triple {12217#(<= bor_~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12227#(<= bor_~i~0 4)} is VALID [2018-11-14 17:08:06,764 INFO L273 TraceCheckUtils]: 70: Hoare triple {12227#(<= bor_~i~0 4)} assume true; {12227#(<= bor_~i~0 4)} is VALID [2018-11-14 17:08:06,764 INFO L273 TraceCheckUtils]: 71: Hoare triple {12227#(<= bor_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12227#(<= bor_~i~0 4)} is VALID [2018-11-14 17:08:06,765 INFO L273 TraceCheckUtils]: 72: Hoare triple {12227#(<= bor_~i~0 4)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12237#(<= bor_~i~0 5)} is VALID [2018-11-14 17:08:06,765 INFO L273 TraceCheckUtils]: 73: Hoare triple {12237#(<= bor_~i~0 5)} assume true; {12237#(<= bor_~i~0 5)} is VALID [2018-11-14 17:08:06,765 INFO L273 TraceCheckUtils]: 74: Hoare triple {12237#(<= bor_~i~0 5)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12237#(<= bor_~i~0 5)} is VALID [2018-11-14 17:08:06,766 INFO L273 TraceCheckUtils]: 75: Hoare triple {12237#(<= bor_~i~0 5)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12247#(<= bor_~i~0 6)} is VALID [2018-11-14 17:08:06,766 INFO L273 TraceCheckUtils]: 76: Hoare triple {12247#(<= bor_~i~0 6)} assume true; {12247#(<= bor_~i~0 6)} is VALID [2018-11-14 17:08:06,766 INFO L273 TraceCheckUtils]: 77: Hoare triple {12247#(<= bor_~i~0 6)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12247#(<= bor_~i~0 6)} is VALID [2018-11-14 17:08:06,767 INFO L273 TraceCheckUtils]: 78: Hoare triple {12247#(<= bor_~i~0 6)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12257#(<= bor_~i~0 7)} is VALID [2018-11-14 17:08:06,767 INFO L273 TraceCheckUtils]: 79: Hoare triple {12257#(<= bor_~i~0 7)} assume true; {12257#(<= bor_~i~0 7)} is VALID [2018-11-14 17:08:06,768 INFO L273 TraceCheckUtils]: 80: Hoare triple {12257#(<= bor_~i~0 7)} assume !(~i~0 < 10000); {11995#false} is VALID [2018-11-14 17:08:06,768 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:08:06,768 INFO L273 TraceCheckUtils]: 82: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:08:06,768 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {11995#false} {11994#true} #73#return; {11995#false} is VALID [2018-11-14 17:08:06,768 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:08:06,768 INFO L256 TraceCheckUtils]: 85: Hoare triple {11995#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {11995#false} is VALID [2018-11-14 17:08:06,769 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:08:06,769 INFO L273 TraceCheckUtils]: 87: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:08:06,769 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:08:06,769 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:08:06,769 INFO L273 TraceCheckUtils]: 90: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:08:06,769 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:08:06,770 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:08:06,770 INFO L273 TraceCheckUtils]: 93: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:08:06,770 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:08:06,770 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:08:06,770 INFO L273 TraceCheckUtils]: 96: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:08:06,771 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:08:06,771 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:08:06,771 INFO L273 TraceCheckUtils]: 99: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:08:06,771 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:08:06,771 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:08:06,772 INFO L273 TraceCheckUtils]: 102: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:08:06,772 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:08:06,772 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:08:06,772 INFO L273 TraceCheckUtils]: 105: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:08:06,772 INFO L273 TraceCheckUtils]: 106: Hoare triple {11995#false} assume !(~i~0 < 10000); {11995#false} is VALID [2018-11-14 17:08:06,772 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:08:06,773 INFO L273 TraceCheckUtils]: 108: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:08:06,773 INFO L268 TraceCheckUtils]: 109: Hoare quadruple {11995#false} {11995#false} #75#return; {11995#false} is VALID [2018-11-14 17:08:06,773 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:08:06,773 INFO L273 TraceCheckUtils]: 111: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:08:06,773 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:08:06,773 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:08:06,773 INFO L273 TraceCheckUtils]: 114: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:08:06,774 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:08:06,774 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:08:06,774 INFO L273 TraceCheckUtils]: 117: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:08:06,774 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:08:06,774 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:08:06,774 INFO L273 TraceCheckUtils]: 120: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:08:06,774 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:08:06,774 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:08:06,774 INFO L273 TraceCheckUtils]: 123: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:08:06,775 INFO L273 TraceCheckUtils]: 124: Hoare triple {11995#false} assume !(~i~2 < 9999); {11995#false} is VALID [2018-11-14 17:08:06,775 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:08:06,775 INFO L256 TraceCheckUtils]: 126: Hoare triple {11995#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {11995#false} is VALID [2018-11-14 17:08:06,775 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:08:06,775 INFO L273 TraceCheckUtils]: 128: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:08:06,775 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:08:06,775 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:08:06,775 INFO L273 TraceCheckUtils]: 131: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:08:06,775 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:08:06,775 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:08:06,776 INFO L273 TraceCheckUtils]: 134: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:08:06,776 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:08:06,776 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:08:06,776 INFO L273 TraceCheckUtils]: 137: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:08:06,776 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:08:06,776 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:08:06,776 INFO L273 TraceCheckUtils]: 140: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:08:06,776 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:08:06,776 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:08:06,777 INFO L273 TraceCheckUtils]: 143: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:08:06,777 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:08:06,777 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:08:06,777 INFO L273 TraceCheckUtils]: 146: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:08:06,777 INFO L273 TraceCheckUtils]: 147: Hoare triple {11995#false} assume !(~i~0 < 10000); {11995#false} is VALID [2018-11-14 17:08:06,777 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:08:06,777 INFO L273 TraceCheckUtils]: 149: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:08:06,777 INFO L268 TraceCheckUtils]: 150: Hoare quadruple {11995#false} {11995#false} #77#return; {11995#false} is VALID [2018-11-14 17:08:06,777 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:08:06,778 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:08:06,778 INFO L273 TraceCheckUtils]: 153: Hoare triple {11995#false} assume !false; {11995#false} is VALID [2018-11-14 17:08:06,785 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:08:06,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:06,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2018-11-14 17:08:06,807 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 154 [2018-11-14 17:08:06,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:06,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-14 17:08:06,918 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:08:06,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-14 17:08:06,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-14 17:08:06,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-14 17:08:06,919 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 27 states. [2018-11-14 17:08:07,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:07,782 INFO L93 Difference]: Finished difference Result 163 states and 175 transitions. [2018-11-14 17:08:07,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-14 17:08:07,782 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 154 [2018-11-14 17:08:07,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:07,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:08:07,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 136 transitions. [2018-11-14 17:08:07,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:08:07,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 136 transitions. [2018-11-14 17:08:07,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 136 transitions. [2018-11-14 17:08:07,914 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:08:07,917 INFO L225 Difference]: With dead ends: 163 [2018-11-14 17:08:07,917 INFO L226 Difference]: Without dead ends: 115 [2018-11-14 17:08:07,918 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:08:07,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-14 17:08:07,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-11-14 17:08:07,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:07,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 113 states. [2018-11-14 17:08:07,960 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 113 states. [2018-11-14 17:08:07,960 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 113 states. [2018-11-14 17:08:07,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:07,962 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-11-14 17:08:07,962 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-14 17:08:07,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:07,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:07,963 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 115 states. [2018-11-14 17:08:07,963 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 115 states. [2018-11-14 17:08:07,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:07,966 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-11-14 17:08:07,966 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-14 17:08:07,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:07,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:07,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:07,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:07,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-14 17:08:07,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2018-11-14 17:08:07,969 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 154 [2018-11-14 17:08:07,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:07,969 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2018-11-14 17:08:07,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-14 17:08:07,970 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-14 17:08:07,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-14 17:08:07,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:07,971 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:08:07,971 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:07,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:07,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1920636699, now seen corresponding path program 18 times [2018-11-14 17:08:07,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:07,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:07,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:07,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:08:07,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:08,415 INFO L256 TraceCheckUtils]: 0: Hoare triple {13084#true} call ULTIMATE.init(); {13084#true} is VALID [2018-11-14 17:08:08,416 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:08:08,416 INFO L273 TraceCheckUtils]: 2: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:08,416 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13084#true} {13084#true} #69#return; {13084#true} is VALID [2018-11-14 17:08:08,416 INFO L256 TraceCheckUtils]: 4: Hoare triple {13084#true} call #t~ret13 := main(); {13084#true} is VALID [2018-11-14 17:08:08,417 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:08:08,417 INFO L273 TraceCheckUtils]: 6: Hoare triple {13086#(= main_~i~1 0)} assume true; {13086#(= main_~i~1 0)} is VALID [2018-11-14 17:08:08,418 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:08:08,418 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:08:08,419 INFO L273 TraceCheckUtils]: 9: Hoare triple {13087#(<= main_~i~1 1)} assume true; {13087#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:08,419 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:08:08,419 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:08:08,420 INFO L273 TraceCheckUtils]: 12: Hoare triple {13088#(<= main_~i~1 2)} assume true; {13088#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:08,420 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:08:08,421 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:08:08,421 INFO L273 TraceCheckUtils]: 15: Hoare triple {13089#(<= main_~i~1 3)} assume true; {13089#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:08,421 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:08:08,422 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:08:08,423 INFO L273 TraceCheckUtils]: 18: Hoare triple {13090#(<= main_~i~1 4)} assume true; {13090#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:08,423 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:08:08,424 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:08:08,424 INFO L273 TraceCheckUtils]: 21: Hoare triple {13091#(<= main_~i~1 5)} assume true; {13091#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:08,425 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:08:08,426 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:08:08,426 INFO L273 TraceCheckUtils]: 24: Hoare triple {13092#(<= main_~i~1 6)} assume true; {13092#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:08,427 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:08:08,427 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:08:08,428 INFO L273 TraceCheckUtils]: 27: Hoare triple {13093#(<= main_~i~1 7)} assume true; {13093#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:08,428 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:08:08,429 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:08:08,430 INFO L273 TraceCheckUtils]: 30: Hoare triple {13094#(<= main_~i~1 8)} assume true; {13094#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:08,430 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:08:08,431 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:08:08,431 INFO L273 TraceCheckUtils]: 33: Hoare triple {13095#(<= main_~i~1 9)} assume true; {13095#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:08,432 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:08:08,433 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:08:08,433 INFO L273 TraceCheckUtils]: 36: Hoare triple {13096#(<= main_~i~1 10)} assume true; {13096#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:08,434 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:08:08,434 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:08:08,435 INFO L273 TraceCheckUtils]: 39: Hoare triple {13097#(<= main_~i~1 11)} assume true; {13097#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:08,439 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:08:08,439 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:08:08,440 INFO L273 TraceCheckUtils]: 42: Hoare triple {13098#(<= main_~i~1 12)} assume true; {13098#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:08,440 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:08:08,441 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:08:08,441 INFO L273 TraceCheckUtils]: 45: Hoare triple {13099#(<= main_~i~1 13)} assume true; {13099#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:08,441 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:08:08,442 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:08:08,442 INFO L273 TraceCheckUtils]: 48: Hoare triple {13100#(<= main_~i~1 14)} assume true; {13100#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:08,443 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:08:08,444 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:08:08,444 INFO L273 TraceCheckUtils]: 51: Hoare triple {13101#(<= main_~i~1 15)} assume true; {13101#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:08,445 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:08:08,445 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:08:08,446 INFO L273 TraceCheckUtils]: 54: Hoare triple {13102#(<= main_~i~1 16)} assume true; {13102#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:08,446 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:08:08,447 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:08:08,448 INFO L273 TraceCheckUtils]: 57: Hoare triple {13103#(<= main_~i~1 17)} assume true; {13103#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:08,448 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:08:08,449 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:08:08,450 INFO L273 TraceCheckUtils]: 60: Hoare triple {13104#(<= main_~i~1 18)} assume true; {13104#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:08,450 INFO L273 TraceCheckUtils]: 61: Hoare triple {13104#(<= main_~i~1 18)} assume !(~i~1 < 10000); {13085#false} is VALID [2018-11-14 17:08:08,450 INFO L256 TraceCheckUtils]: 62: Hoare triple {13085#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {13084#true} is VALID [2018-11-14 17:08:08,451 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:08:08,451 INFO L273 TraceCheckUtils]: 64: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:08,451 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:08,451 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:08:08,451 INFO L273 TraceCheckUtils]: 67: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:08,452 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:08,452 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:08:08,452 INFO L273 TraceCheckUtils]: 70: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:08,452 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:08,452 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:08:08,452 INFO L273 TraceCheckUtils]: 73: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:08,453 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:08,453 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:08:08,453 INFO L273 TraceCheckUtils]: 76: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:08,453 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:08,453 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:08:08,454 INFO L273 TraceCheckUtils]: 79: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:08,454 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:08,454 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:08:08,454 INFO L273 TraceCheckUtils]: 82: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:08,454 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:08,454 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:08:08,454 INFO L273 TraceCheckUtils]: 85: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:08,455 INFO L273 TraceCheckUtils]: 86: Hoare triple {13084#true} assume !(~i~0 < 10000); {13084#true} is VALID [2018-11-14 17:08:08,455 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:08:08,455 INFO L273 TraceCheckUtils]: 88: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:08,455 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {13084#true} {13085#false} #73#return; {13085#false} is VALID [2018-11-14 17:08:08,455 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:08:08,455 INFO L256 TraceCheckUtils]: 91: Hoare triple {13085#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {13084#true} is VALID [2018-11-14 17:08:08,455 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:08:08,455 INFO L273 TraceCheckUtils]: 93: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:08,455 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:08,456 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:08:08,456 INFO L273 TraceCheckUtils]: 96: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:08,456 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:08,456 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:08:08,456 INFO L273 TraceCheckUtils]: 99: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:08,456 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:08,456 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:08:08,456 INFO L273 TraceCheckUtils]: 102: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:08,456 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:08,457 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:08:08,457 INFO L273 TraceCheckUtils]: 105: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:08,457 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:08,457 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:08:08,457 INFO L273 TraceCheckUtils]: 108: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:08,457 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:08,457 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:08:08,457 INFO L273 TraceCheckUtils]: 111: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:08,457 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:08,457 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:08:08,458 INFO L273 TraceCheckUtils]: 114: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:08,458 INFO L273 TraceCheckUtils]: 115: Hoare triple {13084#true} assume !(~i~0 < 10000); {13084#true} is VALID [2018-11-14 17:08:08,458 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:08:08,458 INFO L273 TraceCheckUtils]: 117: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:08,458 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {13084#true} {13085#false} #75#return; {13085#false} is VALID [2018-11-14 17:08:08,458 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:08:08,458 INFO L273 TraceCheckUtils]: 120: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:08:08,458 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:08:08,458 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:08:08,459 INFO L273 TraceCheckUtils]: 123: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:08:08,459 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:08:08,459 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:08:08,459 INFO L273 TraceCheckUtils]: 126: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:08:08,459 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:08:08,459 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:08:08,459 INFO L273 TraceCheckUtils]: 129: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:08:08,459 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:08:08,459 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:08:08,460 INFO L273 TraceCheckUtils]: 132: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:08:08,460 INFO L273 TraceCheckUtils]: 133: Hoare triple {13085#false} assume !(~i~2 < 9999); {13085#false} is VALID [2018-11-14 17:08:08,460 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:08:08,460 INFO L256 TraceCheckUtils]: 135: Hoare triple {13085#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {13084#true} is VALID [2018-11-14 17:08:08,460 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:08:08,460 INFO L273 TraceCheckUtils]: 137: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:08,460 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:08,461 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:08:08,461 INFO L273 TraceCheckUtils]: 140: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:08,461 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:08,461 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:08:08,461 INFO L273 TraceCheckUtils]: 143: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:08,461 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:08,461 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:08:08,462 INFO L273 TraceCheckUtils]: 146: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:08,462 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:08,462 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:08:08,462 INFO L273 TraceCheckUtils]: 149: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:08,462 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:08,462 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:08:08,463 INFO L273 TraceCheckUtils]: 152: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:08,463 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:08,463 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:08:08,463 INFO L273 TraceCheckUtils]: 155: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:08,463 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:08,463 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:08:08,464 INFO L273 TraceCheckUtils]: 158: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:08,464 INFO L273 TraceCheckUtils]: 159: Hoare triple {13084#true} assume !(~i~0 < 10000); {13084#true} is VALID [2018-11-14 17:08:08,464 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:08:08,464 INFO L273 TraceCheckUtils]: 161: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:08,464 INFO L268 TraceCheckUtils]: 162: Hoare quadruple {13084#true} {13085#false} #77#return; {13085#false} is VALID [2018-11-14 17:08:08,464 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:08:08,464 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:08:08,465 INFO L273 TraceCheckUtils]: 165: Hoare triple {13085#false} assume !false; {13085#false} is VALID [2018-11-14 17:08:08,477 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:08:08,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:08,478 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:08:08,487 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:08:08,832 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-14 17:08:08,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:08:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:08,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:09,170 INFO L256 TraceCheckUtils]: 0: Hoare triple {13084#true} call ULTIMATE.init(); {13084#true} is VALID [2018-11-14 17:08:09,170 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:08:09,171 INFO L273 TraceCheckUtils]: 2: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,171 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13084#true} {13084#true} #69#return; {13084#true} is VALID [2018-11-14 17:08:09,171 INFO L256 TraceCheckUtils]: 4: Hoare triple {13084#true} call #t~ret13 := main(); {13084#true} is VALID [2018-11-14 17:08:09,171 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:08:09,171 INFO L273 TraceCheckUtils]: 6: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,172 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:08:09,172 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:08:09,172 INFO L273 TraceCheckUtils]: 9: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,173 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:08:09,173 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:08:09,173 INFO L273 TraceCheckUtils]: 12: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,173 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:08:09,173 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:08:09,174 INFO L273 TraceCheckUtils]: 15: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,174 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:08:09,174 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:08:09,174 INFO L273 TraceCheckUtils]: 18: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,174 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:08:09,175 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:08:09,175 INFO L273 TraceCheckUtils]: 21: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,175 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:08:09,175 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:08:09,175 INFO L273 TraceCheckUtils]: 24: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,176 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:08:09,176 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:08:09,176 INFO L273 TraceCheckUtils]: 27: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,176 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:08:09,176 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:08:09,176 INFO L273 TraceCheckUtils]: 30: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,177 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:08:09,177 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:08:09,177 INFO L273 TraceCheckUtils]: 33: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,177 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:08:09,177 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:08:09,178 INFO L273 TraceCheckUtils]: 36: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,178 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:08:09,178 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:08:09,178 INFO L273 TraceCheckUtils]: 39: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,178 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:08:09,179 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:08:09,179 INFO L273 TraceCheckUtils]: 42: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,179 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:08:09,179 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:08:09,179 INFO L273 TraceCheckUtils]: 45: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,179 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:08:09,180 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:08:09,180 INFO L273 TraceCheckUtils]: 48: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,180 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:08:09,180 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:08:09,180 INFO L273 TraceCheckUtils]: 51: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,181 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:08:09,181 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:08:09,181 INFO L273 TraceCheckUtils]: 54: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,181 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:08:09,181 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:08:09,182 INFO L273 TraceCheckUtils]: 57: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,182 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; {13084#true} is VALID [2018-11-14 17:08:09,182 INFO L273 TraceCheckUtils]: 59: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:08:09,182 INFO L273 TraceCheckUtils]: 60: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,182 INFO L273 TraceCheckUtils]: 61: Hoare triple {13084#true} assume !(~i~1 < 10000); {13084#true} is VALID [2018-11-14 17:08:09,182 INFO L256 TraceCheckUtils]: 62: Hoare triple {13084#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {13084#true} is VALID [2018-11-14 17:08:09,183 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:08:09,183 INFO L273 TraceCheckUtils]: 64: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,183 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:09,183 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:08:09,183 INFO L273 TraceCheckUtils]: 67: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,184 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:09,184 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:08:09,184 INFO L273 TraceCheckUtils]: 70: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,184 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:09,184 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:08:09,184 INFO L273 TraceCheckUtils]: 73: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,185 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:09,185 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:08:09,185 INFO L273 TraceCheckUtils]: 76: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,185 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:09,185 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:08:09,185 INFO L273 TraceCheckUtils]: 79: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,185 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:09,185 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:08:09,186 INFO L273 TraceCheckUtils]: 82: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,186 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:09,186 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:08:09,186 INFO L273 TraceCheckUtils]: 85: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,186 INFO L273 TraceCheckUtils]: 86: Hoare triple {13084#true} assume !(~i~0 < 10000); {13084#true} is VALID [2018-11-14 17:08:09,186 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:08:09,186 INFO L273 TraceCheckUtils]: 88: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,187 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {13084#true} {13084#true} #73#return; {13084#true} is VALID [2018-11-14 17:08:09,187 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:08:09,187 INFO L256 TraceCheckUtils]: 91: Hoare triple {13084#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {13084#true} is VALID [2018-11-14 17:08:09,187 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:08:09,187 INFO L273 TraceCheckUtils]: 93: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,187 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:09,187 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:08:09,188 INFO L273 TraceCheckUtils]: 96: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,188 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:09,188 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:08:09,188 INFO L273 TraceCheckUtils]: 99: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,188 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:09,188 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:08:09,188 INFO L273 TraceCheckUtils]: 102: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,189 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:09,189 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:08:09,189 INFO L273 TraceCheckUtils]: 105: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,189 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:09,189 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:08:09,189 INFO L273 TraceCheckUtils]: 108: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,189 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:09,190 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:08:09,190 INFO L273 TraceCheckUtils]: 111: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,190 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:08:09,190 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:08:09,190 INFO L273 TraceCheckUtils]: 114: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,190 INFO L273 TraceCheckUtils]: 115: Hoare triple {13084#true} assume !(~i~0 < 10000); {13084#true} is VALID [2018-11-14 17:08:09,190 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:08:09,191 INFO L273 TraceCheckUtils]: 117: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:08:09,191 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {13084#true} {13084#true} #75#return; {13084#true} is VALID [2018-11-14 17:08:09,191 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; {13465#(<= main_~i~2 0)} is VALID [2018-11-14 17:08:09,192 INFO L273 TraceCheckUtils]: 120: Hoare triple {13465#(<= main_~i~2 0)} assume true; {13465#(<= main_~i~2 0)} is VALID [2018-11-14 17:08:09,194 INFO L273 TraceCheckUtils]: 121: Hoare triple {13465#(<= 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; {13465#(<= main_~i~2 0)} is VALID [2018-11-14 17:08:09,194 INFO L273 TraceCheckUtils]: 122: Hoare triple {13465#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13475#(<= main_~i~2 1)} is VALID [2018-11-14 17:08:09,196 INFO L273 TraceCheckUtils]: 123: Hoare triple {13475#(<= main_~i~2 1)} assume true; {13475#(<= main_~i~2 1)} is VALID [2018-11-14 17:08:09,196 INFO L273 TraceCheckUtils]: 124: Hoare triple {13475#(<= 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; {13475#(<= main_~i~2 1)} is VALID [2018-11-14 17:08:09,198 INFO L273 TraceCheckUtils]: 125: Hoare triple {13475#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13485#(<= main_~i~2 2)} is VALID [2018-11-14 17:08:09,198 INFO L273 TraceCheckUtils]: 126: Hoare triple {13485#(<= main_~i~2 2)} assume true; {13485#(<= main_~i~2 2)} is VALID [2018-11-14 17:08:09,200 INFO L273 TraceCheckUtils]: 127: Hoare triple {13485#(<= 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; {13485#(<= main_~i~2 2)} is VALID [2018-11-14 17:08:09,200 INFO L273 TraceCheckUtils]: 128: Hoare triple {13485#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13495#(<= main_~i~2 3)} is VALID [2018-11-14 17:08:09,203 INFO L273 TraceCheckUtils]: 129: Hoare triple {13495#(<= main_~i~2 3)} assume true; {13495#(<= main_~i~2 3)} is VALID [2018-11-14 17:08:09,203 INFO L273 TraceCheckUtils]: 130: Hoare triple {13495#(<= 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; {13495#(<= main_~i~2 3)} is VALID [2018-11-14 17:08:09,205 INFO L273 TraceCheckUtils]: 131: Hoare triple {13495#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13505#(<= main_~i~2 4)} is VALID [2018-11-14 17:08:09,205 INFO L273 TraceCheckUtils]: 132: Hoare triple {13505#(<= main_~i~2 4)} assume true; {13505#(<= main_~i~2 4)} is VALID [2018-11-14 17:08:09,206 INFO L273 TraceCheckUtils]: 133: Hoare triple {13505#(<= main_~i~2 4)} assume !(~i~2 < 9999); {13085#false} is VALID [2018-11-14 17:08:09,206 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:08:09,206 INFO L256 TraceCheckUtils]: 135: Hoare triple {13085#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {13085#false} is VALID [2018-11-14 17:08:09,206 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:08:09,207 INFO L273 TraceCheckUtils]: 137: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:08:09,207 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 17:08:09,207 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:08:09,207 INFO L273 TraceCheckUtils]: 140: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:08:09,207 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 17:08:09,207 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:08:09,207 INFO L273 TraceCheckUtils]: 143: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:08:09,208 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 17:08:09,208 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:08:09,208 INFO L273 TraceCheckUtils]: 146: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:08:09,208 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 17:08:09,208 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:08:09,209 INFO L273 TraceCheckUtils]: 149: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:08:09,209 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 17:08:09,209 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:08:09,209 INFO L273 TraceCheckUtils]: 152: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:08:09,210 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 17:08:09,210 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:08:09,210 INFO L273 TraceCheckUtils]: 155: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:08:09,210 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 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 17:08:09,211 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:08:09,211 INFO L273 TraceCheckUtils]: 158: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:08:09,211 INFO L273 TraceCheckUtils]: 159: Hoare triple {13085#false} assume !(~i~0 < 10000); {13085#false} is VALID [2018-11-14 17:08:09,211 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:08:09,211 INFO L273 TraceCheckUtils]: 161: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:08:09,211 INFO L268 TraceCheckUtils]: 162: Hoare quadruple {13085#false} {13085#false} #77#return; {13085#false} is VALID [2018-11-14 17:08:09,211 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:08:09,212 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:08:09,212 INFO L273 TraceCheckUtils]: 165: Hoare triple {13085#false} assume !false; {13085#false} is VALID [2018-11-14 17:08:09,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 362 proven. 26 refuted. 0 times theorem prover too weak. 907 trivial. 0 not checked. [2018-11-14 17:08:09,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:09,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7] total 26 [2018-11-14 17:08:09,258 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 166 [2018-11-14 17:08:09,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:09,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 17:08:09,397 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:09,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 17:08:09,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 17:08:09,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2018-11-14 17:08:09,398 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 26 states. [2018-11-14 17:08:10,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:10,028 INFO L93 Difference]: Finished difference Result 172 states and 181 transitions. [2018-11-14 17:08:10,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-14 17:08:10,028 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 166 [2018-11-14 17:08:10,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:10,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:08:10,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 130 transitions. [2018-11-14 17:08:10,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:08:10,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 130 transitions. [2018-11-14 17:08:10,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 130 transitions. [2018-11-14 17:08:10,167 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:08:10,170 INFO L225 Difference]: With dead ends: 172 [2018-11-14 17:08:10,170 INFO L226 Difference]: Without dead ends: 121 [2018-11-14 17:08:10,171 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2018-11-14 17:08:10,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-14 17:08:10,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-11-14 17:08:10,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:10,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 119 states. [2018-11-14 17:08:10,219 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 119 states. [2018-11-14 17:08:10,220 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 119 states. [2018-11-14 17:08:10,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:10,222 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-14 17:08:10,222 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-14 17:08:10,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:10,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:10,223 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 121 states. [2018-11-14 17:08:10,223 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 121 states. [2018-11-14 17:08:10,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:10,225 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-14 17:08:10,225 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-14 17:08:10,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:10,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:10,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:10,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-14 17:08:10,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2018-11-14 17:08:10,228 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 166 [2018-11-14 17:08:10,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:10,229 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2018-11-14 17:08:10,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 17:08:10,229 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-11-14 17:08:10,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-14 17:08:10,230 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:10,230 INFO L375 BasicCegarLoop]: trace histogram [24, 21, 21, 20, 19, 19, 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:08:10,230 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:10,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:10,231 INFO L82 PathProgramCache]: Analyzing trace with hash 625651725, now seen corresponding path program 19 times [2018-11-14 17:08:10,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:10,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:10,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:10,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:08:10,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:11,002 INFO L256 TraceCheckUtils]: 0: Hoare triple {14241#true} call ULTIMATE.init(); {14241#true} is VALID [2018-11-14 17:08:11,002 INFO L273 TraceCheckUtils]: 1: Hoare triple {14241#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14241#true} is VALID [2018-11-14 17:08:11,003 INFO L273 TraceCheckUtils]: 2: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,003 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14241#true} {14241#true} #69#return; {14241#true} is VALID [2018-11-14 17:08:11,003 INFO L256 TraceCheckUtils]: 4: Hoare triple {14241#true} call #t~ret13 := main(); {14241#true} is VALID [2018-11-14 17:08:11,004 INFO L273 TraceCheckUtils]: 5: Hoare triple {14241#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; {14243#(= main_~i~1 0)} is VALID [2018-11-14 17:08:11,004 INFO L273 TraceCheckUtils]: 6: Hoare triple {14243#(= main_~i~1 0)} assume true; {14243#(= main_~i~1 0)} is VALID [2018-11-14 17:08:11,005 INFO L273 TraceCheckUtils]: 7: Hoare triple {14243#(= 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; {14243#(= main_~i~1 0)} is VALID [2018-11-14 17:08:11,005 INFO L273 TraceCheckUtils]: 8: Hoare triple {14243#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14244#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:11,006 INFO L273 TraceCheckUtils]: 9: Hoare triple {14244#(<= main_~i~1 1)} assume true; {14244#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:11,006 INFO L273 TraceCheckUtils]: 10: Hoare triple {14244#(<= 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; {14244#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:11,007 INFO L273 TraceCheckUtils]: 11: Hoare triple {14244#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14245#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:11,008 INFO L273 TraceCheckUtils]: 12: Hoare triple {14245#(<= main_~i~1 2)} assume true; {14245#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:11,008 INFO L273 TraceCheckUtils]: 13: Hoare triple {14245#(<= 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; {14245#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:11,009 INFO L273 TraceCheckUtils]: 14: Hoare triple {14245#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14246#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:11,009 INFO L273 TraceCheckUtils]: 15: Hoare triple {14246#(<= main_~i~1 3)} assume true; {14246#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:11,010 INFO L273 TraceCheckUtils]: 16: Hoare triple {14246#(<= 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; {14246#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:11,011 INFO L273 TraceCheckUtils]: 17: Hoare triple {14246#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14247#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:11,011 INFO L273 TraceCheckUtils]: 18: Hoare triple {14247#(<= main_~i~1 4)} assume true; {14247#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:11,012 INFO L273 TraceCheckUtils]: 19: Hoare triple {14247#(<= 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; {14247#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:11,012 INFO L273 TraceCheckUtils]: 20: Hoare triple {14247#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14248#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:11,013 INFO L273 TraceCheckUtils]: 21: Hoare triple {14248#(<= main_~i~1 5)} assume true; {14248#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:11,013 INFO L273 TraceCheckUtils]: 22: Hoare triple {14248#(<= 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; {14248#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:11,014 INFO L273 TraceCheckUtils]: 23: Hoare triple {14248#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14249#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:11,015 INFO L273 TraceCheckUtils]: 24: Hoare triple {14249#(<= main_~i~1 6)} assume true; {14249#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:11,015 INFO L273 TraceCheckUtils]: 25: Hoare triple {14249#(<= 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; {14249#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:11,016 INFO L273 TraceCheckUtils]: 26: Hoare triple {14249#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14250#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:11,016 INFO L273 TraceCheckUtils]: 27: Hoare triple {14250#(<= main_~i~1 7)} assume true; {14250#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:11,017 INFO L273 TraceCheckUtils]: 28: Hoare triple {14250#(<= 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; {14250#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:11,018 INFO L273 TraceCheckUtils]: 29: Hoare triple {14250#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14251#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:11,018 INFO L273 TraceCheckUtils]: 30: Hoare triple {14251#(<= main_~i~1 8)} assume true; {14251#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:11,019 INFO L273 TraceCheckUtils]: 31: Hoare triple {14251#(<= 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; {14251#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:11,019 INFO L273 TraceCheckUtils]: 32: Hoare triple {14251#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14252#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:11,020 INFO L273 TraceCheckUtils]: 33: Hoare triple {14252#(<= main_~i~1 9)} assume true; {14252#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:11,020 INFO L273 TraceCheckUtils]: 34: Hoare triple {14252#(<= 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; {14252#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:11,021 INFO L273 TraceCheckUtils]: 35: Hoare triple {14252#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14253#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:11,022 INFO L273 TraceCheckUtils]: 36: Hoare triple {14253#(<= main_~i~1 10)} assume true; {14253#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:11,022 INFO L273 TraceCheckUtils]: 37: Hoare triple {14253#(<= 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; {14253#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:11,023 INFO L273 TraceCheckUtils]: 38: Hoare triple {14253#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14254#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:11,023 INFO L273 TraceCheckUtils]: 39: Hoare triple {14254#(<= main_~i~1 11)} assume true; {14254#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:11,024 INFO L273 TraceCheckUtils]: 40: Hoare triple {14254#(<= 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; {14254#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:11,025 INFO L273 TraceCheckUtils]: 41: Hoare triple {14254#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14255#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:11,025 INFO L273 TraceCheckUtils]: 42: Hoare triple {14255#(<= main_~i~1 12)} assume true; {14255#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:11,026 INFO L273 TraceCheckUtils]: 43: Hoare triple {14255#(<= 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; {14255#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:11,026 INFO L273 TraceCheckUtils]: 44: Hoare triple {14255#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14256#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:11,027 INFO L273 TraceCheckUtils]: 45: Hoare triple {14256#(<= main_~i~1 13)} assume true; {14256#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:11,032 INFO L273 TraceCheckUtils]: 46: Hoare triple {14256#(<= 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; {14256#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:11,033 INFO L273 TraceCheckUtils]: 47: Hoare triple {14256#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14257#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:11,033 INFO L273 TraceCheckUtils]: 48: Hoare triple {14257#(<= main_~i~1 14)} assume true; {14257#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:11,033 INFO L273 TraceCheckUtils]: 49: Hoare triple {14257#(<= 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; {14257#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:11,034 INFO L273 TraceCheckUtils]: 50: Hoare triple {14257#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14258#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:11,034 INFO L273 TraceCheckUtils]: 51: Hoare triple {14258#(<= main_~i~1 15)} assume true; {14258#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:11,034 INFO L273 TraceCheckUtils]: 52: Hoare triple {14258#(<= 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; {14258#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:11,035 INFO L273 TraceCheckUtils]: 53: Hoare triple {14258#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14259#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:11,035 INFO L273 TraceCheckUtils]: 54: Hoare triple {14259#(<= main_~i~1 16)} assume true; {14259#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:11,035 INFO L273 TraceCheckUtils]: 55: Hoare triple {14259#(<= 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; {14259#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:11,036 INFO L273 TraceCheckUtils]: 56: Hoare triple {14259#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14260#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:11,036 INFO L273 TraceCheckUtils]: 57: Hoare triple {14260#(<= main_~i~1 17)} assume true; {14260#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:11,036 INFO L273 TraceCheckUtils]: 58: Hoare triple {14260#(<= 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; {14260#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:11,037 INFO L273 TraceCheckUtils]: 59: Hoare triple {14260#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14261#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:11,038 INFO L273 TraceCheckUtils]: 60: Hoare triple {14261#(<= main_~i~1 18)} assume true; {14261#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:11,038 INFO L273 TraceCheckUtils]: 61: Hoare triple {14261#(<= 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; {14261#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:11,039 INFO L273 TraceCheckUtils]: 62: Hoare triple {14261#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14262#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:11,039 INFO L273 TraceCheckUtils]: 63: Hoare triple {14262#(<= main_~i~1 19)} assume true; {14262#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:11,040 INFO L273 TraceCheckUtils]: 64: Hoare triple {14262#(<= main_~i~1 19)} assume !(~i~1 < 10000); {14242#false} is VALID [2018-11-14 17:08:11,040 INFO L256 TraceCheckUtils]: 65: Hoare triple {14242#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {14241#true} is VALID [2018-11-14 17:08:11,041 INFO L273 TraceCheckUtils]: 66: Hoare triple {14241#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; {14241#true} is VALID [2018-11-14 17:08:11,041 INFO L273 TraceCheckUtils]: 67: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,041 INFO L273 TraceCheckUtils]: 68: Hoare triple {14241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:08:11,041 INFO L273 TraceCheckUtils]: 69: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:08:11,041 INFO L273 TraceCheckUtils]: 70: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,041 INFO L273 TraceCheckUtils]: 71: Hoare triple {14241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:08:11,042 INFO L273 TraceCheckUtils]: 72: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:08:11,042 INFO L273 TraceCheckUtils]: 73: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,042 INFO L273 TraceCheckUtils]: 74: Hoare triple {14241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:08:11,042 INFO L273 TraceCheckUtils]: 75: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:08:11,042 INFO L273 TraceCheckUtils]: 76: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,042 INFO L273 TraceCheckUtils]: 77: Hoare triple {14241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:08:11,042 INFO L273 TraceCheckUtils]: 78: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:08:11,043 INFO L273 TraceCheckUtils]: 79: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,043 INFO L273 TraceCheckUtils]: 80: Hoare triple {14241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:08:11,043 INFO L273 TraceCheckUtils]: 81: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:08:11,043 INFO L273 TraceCheckUtils]: 82: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,043 INFO L273 TraceCheckUtils]: 83: Hoare triple {14241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:08:11,043 INFO L273 TraceCheckUtils]: 84: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:08:11,043 INFO L273 TraceCheckUtils]: 85: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,043 INFO L273 TraceCheckUtils]: 86: Hoare triple {14241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:08:11,043 INFO L273 TraceCheckUtils]: 87: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:08:11,044 INFO L273 TraceCheckUtils]: 88: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,044 INFO L273 TraceCheckUtils]: 89: Hoare triple {14241#true} assume !(~i~0 < 10000); {14241#true} is VALID [2018-11-14 17:08:11,044 INFO L273 TraceCheckUtils]: 90: Hoare triple {14241#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14241#true} is VALID [2018-11-14 17:08:11,044 INFO L273 TraceCheckUtils]: 91: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,044 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {14241#true} {14242#false} #73#return; {14242#false} is VALID [2018-11-14 17:08:11,044 INFO L273 TraceCheckUtils]: 93: Hoare triple {14242#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); {14242#false} is VALID [2018-11-14 17:08:11,044 INFO L256 TraceCheckUtils]: 94: Hoare triple {14242#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {14241#true} is VALID [2018-11-14 17:08:11,044 INFO L273 TraceCheckUtils]: 95: Hoare triple {14241#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; {14241#true} is VALID [2018-11-14 17:08:11,044 INFO L273 TraceCheckUtils]: 96: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,045 INFO L273 TraceCheckUtils]: 97: Hoare triple {14241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:08:11,045 INFO L273 TraceCheckUtils]: 98: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:08:11,045 INFO L273 TraceCheckUtils]: 99: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,045 INFO L273 TraceCheckUtils]: 100: Hoare triple {14241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:08:11,045 INFO L273 TraceCheckUtils]: 101: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:08:11,045 INFO L273 TraceCheckUtils]: 102: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,045 INFO L273 TraceCheckUtils]: 103: Hoare triple {14241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:08:11,045 INFO L273 TraceCheckUtils]: 104: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:08:11,045 INFO L273 TraceCheckUtils]: 105: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,046 INFO L273 TraceCheckUtils]: 106: Hoare triple {14241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:08:11,046 INFO L273 TraceCheckUtils]: 107: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:08:11,046 INFO L273 TraceCheckUtils]: 108: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,046 INFO L273 TraceCheckUtils]: 109: Hoare triple {14241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:08:11,046 INFO L273 TraceCheckUtils]: 110: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:08:11,046 INFO L273 TraceCheckUtils]: 111: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,046 INFO L273 TraceCheckUtils]: 112: Hoare triple {14241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:08:11,046 INFO L273 TraceCheckUtils]: 113: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:08:11,046 INFO L273 TraceCheckUtils]: 114: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,047 INFO L273 TraceCheckUtils]: 115: Hoare triple {14241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:08:11,047 INFO L273 TraceCheckUtils]: 116: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:08:11,047 INFO L273 TraceCheckUtils]: 117: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,047 INFO L273 TraceCheckUtils]: 118: Hoare triple {14241#true} assume !(~i~0 < 10000); {14241#true} is VALID [2018-11-14 17:08:11,047 INFO L273 TraceCheckUtils]: 119: Hoare triple {14241#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14241#true} is VALID [2018-11-14 17:08:11,047 INFO L273 TraceCheckUtils]: 120: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,047 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {14241#true} {14242#false} #75#return; {14242#false} is VALID [2018-11-14 17:08:11,047 INFO L273 TraceCheckUtils]: 122: Hoare triple {14242#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; {14242#false} is VALID [2018-11-14 17:08:11,047 INFO L273 TraceCheckUtils]: 123: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,047 INFO L273 TraceCheckUtils]: 124: Hoare triple {14242#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:08:11,048 INFO L273 TraceCheckUtils]: 125: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:08:11,048 INFO L273 TraceCheckUtils]: 126: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,048 INFO L273 TraceCheckUtils]: 127: Hoare triple {14242#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:08:11,048 INFO L273 TraceCheckUtils]: 128: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:08:11,048 INFO L273 TraceCheckUtils]: 129: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,048 INFO L273 TraceCheckUtils]: 130: Hoare triple {14242#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:08:11,048 INFO L273 TraceCheckUtils]: 131: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:08:11,048 INFO L273 TraceCheckUtils]: 132: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,048 INFO L273 TraceCheckUtils]: 133: Hoare triple {14242#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:08:11,049 INFO L273 TraceCheckUtils]: 134: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:08:11,049 INFO L273 TraceCheckUtils]: 135: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,049 INFO L273 TraceCheckUtils]: 136: Hoare triple {14242#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:08:11,049 INFO L273 TraceCheckUtils]: 137: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:08:11,049 INFO L273 TraceCheckUtils]: 138: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,049 INFO L273 TraceCheckUtils]: 139: Hoare triple {14242#false} assume !(~i~2 < 9999); {14242#false} is VALID [2018-11-14 17:08:11,049 INFO L273 TraceCheckUtils]: 140: Hoare triple {14242#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {14242#false} is VALID [2018-11-14 17:08:11,049 INFO L256 TraceCheckUtils]: 141: Hoare triple {14242#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {14241#true} is VALID [2018-11-14 17:08:11,049 INFO L273 TraceCheckUtils]: 142: Hoare triple {14241#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; {14241#true} is VALID [2018-11-14 17:08:11,050 INFO L273 TraceCheckUtils]: 143: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,050 INFO L273 TraceCheckUtils]: 144: Hoare triple {14241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:08:11,050 INFO L273 TraceCheckUtils]: 145: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:08:11,050 INFO L273 TraceCheckUtils]: 146: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,050 INFO L273 TraceCheckUtils]: 147: Hoare triple {14241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:08:11,050 INFO L273 TraceCheckUtils]: 148: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:08:11,050 INFO L273 TraceCheckUtils]: 149: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,050 INFO L273 TraceCheckUtils]: 150: Hoare triple {14241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:08:11,050 INFO L273 TraceCheckUtils]: 151: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:08:11,051 INFO L273 TraceCheckUtils]: 152: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,051 INFO L273 TraceCheckUtils]: 153: Hoare triple {14241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:08:11,051 INFO L273 TraceCheckUtils]: 154: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:08:11,051 INFO L273 TraceCheckUtils]: 155: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,051 INFO L273 TraceCheckUtils]: 156: Hoare triple {14241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:08:11,051 INFO L273 TraceCheckUtils]: 157: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:08:11,051 INFO L273 TraceCheckUtils]: 158: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,051 INFO L273 TraceCheckUtils]: 159: Hoare triple {14241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:08:11,051 INFO L273 TraceCheckUtils]: 160: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:08:11,051 INFO L273 TraceCheckUtils]: 161: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,052 INFO L273 TraceCheckUtils]: 162: Hoare triple {14241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:08:11,052 INFO L273 TraceCheckUtils]: 163: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:08:11,052 INFO L273 TraceCheckUtils]: 164: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,052 INFO L273 TraceCheckUtils]: 165: Hoare triple {14241#true} assume !(~i~0 < 10000); {14241#true} is VALID [2018-11-14 17:08:11,052 INFO L273 TraceCheckUtils]: 166: Hoare triple {14241#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14241#true} is VALID [2018-11-14 17:08:11,052 INFO L273 TraceCheckUtils]: 167: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,052 INFO L268 TraceCheckUtils]: 168: Hoare quadruple {14241#true} {14242#false} #77#return; {14242#false} is VALID [2018-11-14 17:08:11,052 INFO L273 TraceCheckUtils]: 169: Hoare triple {14242#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {14242#false} is VALID [2018-11-14 17:08:11,052 INFO L273 TraceCheckUtils]: 170: Hoare triple {14242#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {14242#false} is VALID [2018-11-14 17:08:11,053 INFO L273 TraceCheckUtils]: 171: Hoare triple {14242#false} assume !false; {14242#false} is VALID [2018-11-14 17:08:11,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2018-11-14 17:08:11,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:11,066 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:08:11,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:08:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:11,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:11,489 INFO L256 TraceCheckUtils]: 0: Hoare triple {14241#true} call ULTIMATE.init(); {14241#true} is VALID [2018-11-14 17:08:11,490 INFO L273 TraceCheckUtils]: 1: Hoare triple {14241#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14241#true} is VALID [2018-11-14 17:08:11,490 INFO L273 TraceCheckUtils]: 2: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:08:11,490 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14241#true} {14241#true} #69#return; {14241#true} is VALID [2018-11-14 17:08:11,490 INFO L256 TraceCheckUtils]: 4: Hoare triple {14241#true} call #t~ret13 := main(); {14241#true} is VALID [2018-11-14 17:08:11,491 INFO L273 TraceCheckUtils]: 5: Hoare triple {14241#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; {14281#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:11,491 INFO L273 TraceCheckUtils]: 6: Hoare triple {14281#(<= main_~i~1 0)} assume true; {14281#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:11,492 INFO L273 TraceCheckUtils]: 7: Hoare triple {14281#(<= 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; {14281#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:11,493 INFO L273 TraceCheckUtils]: 8: Hoare triple {14281#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14244#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:11,493 INFO L273 TraceCheckUtils]: 9: Hoare triple {14244#(<= main_~i~1 1)} assume true; {14244#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:11,494 INFO L273 TraceCheckUtils]: 10: Hoare triple {14244#(<= 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; {14244#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:11,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {14244#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14245#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:11,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {14245#(<= main_~i~1 2)} assume true; {14245#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:11,496 INFO L273 TraceCheckUtils]: 13: Hoare triple {14245#(<= 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; {14245#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:11,496 INFO L273 TraceCheckUtils]: 14: Hoare triple {14245#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14246#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:11,497 INFO L273 TraceCheckUtils]: 15: Hoare triple {14246#(<= main_~i~1 3)} assume true; {14246#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:11,497 INFO L273 TraceCheckUtils]: 16: Hoare triple {14246#(<= 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; {14246#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:11,498 INFO L273 TraceCheckUtils]: 17: Hoare triple {14246#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14247#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:11,499 INFO L273 TraceCheckUtils]: 18: Hoare triple {14247#(<= main_~i~1 4)} assume true; {14247#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:11,499 INFO L273 TraceCheckUtils]: 19: Hoare triple {14247#(<= 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; {14247#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:11,500 INFO L273 TraceCheckUtils]: 20: Hoare triple {14247#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14248#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:11,500 INFO L273 TraceCheckUtils]: 21: Hoare triple {14248#(<= main_~i~1 5)} assume true; {14248#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:11,501 INFO L273 TraceCheckUtils]: 22: Hoare triple {14248#(<= 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; {14248#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:11,502 INFO L273 TraceCheckUtils]: 23: Hoare triple {14248#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14249#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:11,502 INFO L273 TraceCheckUtils]: 24: Hoare triple {14249#(<= main_~i~1 6)} assume true; {14249#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:11,503 INFO L273 TraceCheckUtils]: 25: Hoare triple {14249#(<= 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; {14249#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:11,503 INFO L273 TraceCheckUtils]: 26: Hoare triple {14249#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14250#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:11,504 INFO L273 TraceCheckUtils]: 27: Hoare triple {14250#(<= main_~i~1 7)} assume true; {14250#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:11,504 INFO L273 TraceCheckUtils]: 28: Hoare triple {14250#(<= 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; {14250#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:11,505 INFO L273 TraceCheckUtils]: 29: Hoare triple {14250#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14251#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:11,506 INFO L273 TraceCheckUtils]: 30: Hoare triple {14251#(<= main_~i~1 8)} assume true; {14251#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:11,506 INFO L273 TraceCheckUtils]: 31: Hoare triple {14251#(<= 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; {14251#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:11,507 INFO L273 TraceCheckUtils]: 32: Hoare triple {14251#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14252#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:11,507 INFO L273 TraceCheckUtils]: 33: Hoare triple {14252#(<= main_~i~1 9)} assume true; {14252#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:11,508 INFO L273 TraceCheckUtils]: 34: Hoare triple {14252#(<= 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; {14252#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:11,509 INFO L273 TraceCheckUtils]: 35: Hoare triple {14252#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14253#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:11,509 INFO L273 TraceCheckUtils]: 36: Hoare triple {14253#(<= main_~i~1 10)} assume true; {14253#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:11,510 INFO L273 TraceCheckUtils]: 37: Hoare triple {14253#(<= 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; {14253#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:11,510 INFO L273 TraceCheckUtils]: 38: Hoare triple {14253#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14254#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:11,511 INFO L273 TraceCheckUtils]: 39: Hoare triple {14254#(<= main_~i~1 11)} assume true; {14254#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:11,511 INFO L273 TraceCheckUtils]: 40: Hoare triple {14254#(<= 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; {14254#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:11,512 INFO L273 TraceCheckUtils]: 41: Hoare triple {14254#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14255#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:11,513 INFO L273 TraceCheckUtils]: 42: Hoare triple {14255#(<= main_~i~1 12)} assume true; {14255#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:11,513 INFO L273 TraceCheckUtils]: 43: Hoare triple {14255#(<= 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; {14255#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:11,514 INFO L273 TraceCheckUtils]: 44: Hoare triple {14255#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14256#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:11,514 INFO L273 TraceCheckUtils]: 45: Hoare triple {14256#(<= main_~i~1 13)} assume true; {14256#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:11,515 INFO L273 TraceCheckUtils]: 46: Hoare triple {14256#(<= 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; {14256#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:11,516 INFO L273 TraceCheckUtils]: 47: Hoare triple {14256#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14257#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:11,516 INFO L273 TraceCheckUtils]: 48: Hoare triple {14257#(<= main_~i~1 14)} assume true; {14257#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:11,517 INFO L273 TraceCheckUtils]: 49: Hoare triple {14257#(<= 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; {14257#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:11,518 INFO L273 TraceCheckUtils]: 50: Hoare triple {14257#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14258#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:11,518 INFO L273 TraceCheckUtils]: 51: Hoare triple {14258#(<= main_~i~1 15)} assume true; {14258#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:11,519 INFO L273 TraceCheckUtils]: 52: Hoare triple {14258#(<= 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; {14258#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:11,519 INFO L273 TraceCheckUtils]: 53: Hoare triple {14258#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14259#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:11,520 INFO L273 TraceCheckUtils]: 54: Hoare triple {14259#(<= main_~i~1 16)} assume true; {14259#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:11,520 INFO L273 TraceCheckUtils]: 55: Hoare triple {14259#(<= 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; {14259#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:11,521 INFO L273 TraceCheckUtils]: 56: Hoare triple {14259#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14260#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:11,522 INFO L273 TraceCheckUtils]: 57: Hoare triple {14260#(<= main_~i~1 17)} assume true; {14260#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:11,522 INFO L273 TraceCheckUtils]: 58: Hoare triple {14260#(<= 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; {14260#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:11,523 INFO L273 TraceCheckUtils]: 59: Hoare triple {14260#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14261#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:11,523 INFO L273 TraceCheckUtils]: 60: Hoare triple {14261#(<= main_~i~1 18)} assume true; {14261#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:11,524 INFO L273 TraceCheckUtils]: 61: Hoare triple {14261#(<= 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; {14261#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:11,525 INFO L273 TraceCheckUtils]: 62: Hoare triple {14261#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14262#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:11,525 INFO L273 TraceCheckUtils]: 63: Hoare triple {14262#(<= main_~i~1 19)} assume true; {14262#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:11,526 INFO L273 TraceCheckUtils]: 64: Hoare triple {14262#(<= main_~i~1 19)} assume !(~i~1 < 10000); {14242#false} is VALID [2018-11-14 17:08:11,526 INFO L256 TraceCheckUtils]: 65: Hoare triple {14242#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {14242#false} is VALID [2018-11-14 17:08:11,526 INFO L273 TraceCheckUtils]: 66: Hoare triple {14242#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; {14242#false} is VALID [2018-11-14 17:08:11,526 INFO L273 TraceCheckUtils]: 67: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,527 INFO L273 TraceCheckUtils]: 68: Hoare triple {14242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:08:11,527 INFO L273 TraceCheckUtils]: 69: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:08:11,527 INFO L273 TraceCheckUtils]: 70: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,527 INFO L273 TraceCheckUtils]: 71: Hoare triple {14242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:08:11,527 INFO L273 TraceCheckUtils]: 72: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:08:11,527 INFO L273 TraceCheckUtils]: 73: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,528 INFO L273 TraceCheckUtils]: 74: Hoare triple {14242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:08:11,528 INFO L273 TraceCheckUtils]: 75: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:08:11,528 INFO L273 TraceCheckUtils]: 76: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,528 INFO L273 TraceCheckUtils]: 77: Hoare triple {14242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:08:11,528 INFO L273 TraceCheckUtils]: 78: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:08:11,529 INFO L273 TraceCheckUtils]: 79: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,529 INFO L273 TraceCheckUtils]: 80: Hoare triple {14242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:08:11,529 INFO L273 TraceCheckUtils]: 81: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:08:11,529 INFO L273 TraceCheckUtils]: 82: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,529 INFO L273 TraceCheckUtils]: 83: Hoare triple {14242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:08:11,529 INFO L273 TraceCheckUtils]: 84: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:08:11,529 INFO L273 TraceCheckUtils]: 85: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,530 INFO L273 TraceCheckUtils]: 86: Hoare triple {14242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:08:11,530 INFO L273 TraceCheckUtils]: 87: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:08:11,530 INFO L273 TraceCheckUtils]: 88: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,530 INFO L273 TraceCheckUtils]: 89: Hoare triple {14242#false} assume !(~i~0 < 10000); {14242#false} is VALID [2018-11-14 17:08:11,530 INFO L273 TraceCheckUtils]: 90: Hoare triple {14242#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14242#false} is VALID [2018-11-14 17:08:11,530 INFO L273 TraceCheckUtils]: 91: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,530 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {14242#false} {14242#false} #73#return; {14242#false} is VALID [2018-11-14 17:08:11,530 INFO L273 TraceCheckUtils]: 93: Hoare triple {14242#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); {14242#false} is VALID [2018-11-14 17:08:11,530 INFO L256 TraceCheckUtils]: 94: Hoare triple {14242#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {14242#false} is VALID [2018-11-14 17:08:11,530 INFO L273 TraceCheckUtils]: 95: Hoare triple {14242#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; {14242#false} is VALID [2018-11-14 17:08:11,531 INFO L273 TraceCheckUtils]: 96: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,531 INFO L273 TraceCheckUtils]: 97: Hoare triple {14242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:08:11,531 INFO L273 TraceCheckUtils]: 98: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:08:11,531 INFO L273 TraceCheckUtils]: 99: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,531 INFO L273 TraceCheckUtils]: 100: Hoare triple {14242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:08:11,531 INFO L273 TraceCheckUtils]: 101: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:08:11,531 INFO L273 TraceCheckUtils]: 102: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,531 INFO L273 TraceCheckUtils]: 103: Hoare triple {14242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:08:11,531 INFO L273 TraceCheckUtils]: 104: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:08:11,532 INFO L273 TraceCheckUtils]: 105: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,532 INFO L273 TraceCheckUtils]: 106: Hoare triple {14242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:08:11,532 INFO L273 TraceCheckUtils]: 107: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:08:11,532 INFO L273 TraceCheckUtils]: 108: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,532 INFO L273 TraceCheckUtils]: 109: Hoare triple {14242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:08:11,532 INFO L273 TraceCheckUtils]: 110: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:08:11,532 INFO L273 TraceCheckUtils]: 111: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,532 INFO L273 TraceCheckUtils]: 112: Hoare triple {14242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:08:11,532 INFO L273 TraceCheckUtils]: 113: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:08:11,533 INFO L273 TraceCheckUtils]: 114: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,533 INFO L273 TraceCheckUtils]: 115: Hoare triple {14242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:08:11,533 INFO L273 TraceCheckUtils]: 116: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:08:11,533 INFO L273 TraceCheckUtils]: 117: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,533 INFO L273 TraceCheckUtils]: 118: Hoare triple {14242#false} assume !(~i~0 < 10000); {14242#false} is VALID [2018-11-14 17:08:11,533 INFO L273 TraceCheckUtils]: 119: Hoare triple {14242#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14242#false} is VALID [2018-11-14 17:08:11,533 INFO L273 TraceCheckUtils]: 120: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,533 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {14242#false} {14242#false} #75#return; {14242#false} is VALID [2018-11-14 17:08:11,533 INFO L273 TraceCheckUtils]: 122: Hoare triple {14242#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; {14242#false} is VALID [2018-11-14 17:08:11,534 INFO L273 TraceCheckUtils]: 123: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,534 INFO L273 TraceCheckUtils]: 124: Hoare triple {14242#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:08:11,534 INFO L273 TraceCheckUtils]: 125: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:08:11,534 INFO L273 TraceCheckUtils]: 126: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,534 INFO L273 TraceCheckUtils]: 127: Hoare triple {14242#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:08:11,534 INFO L273 TraceCheckUtils]: 128: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:08:11,534 INFO L273 TraceCheckUtils]: 129: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,534 INFO L273 TraceCheckUtils]: 130: Hoare triple {14242#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:08:11,534 INFO L273 TraceCheckUtils]: 131: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:08:11,535 INFO L273 TraceCheckUtils]: 132: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,535 INFO L273 TraceCheckUtils]: 133: Hoare triple {14242#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:08:11,535 INFO L273 TraceCheckUtils]: 134: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:08:11,535 INFO L273 TraceCheckUtils]: 135: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,535 INFO L273 TraceCheckUtils]: 136: Hoare triple {14242#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:08:11,535 INFO L273 TraceCheckUtils]: 137: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:08:11,535 INFO L273 TraceCheckUtils]: 138: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,535 INFO L273 TraceCheckUtils]: 139: Hoare triple {14242#false} assume !(~i~2 < 9999); {14242#false} is VALID [2018-11-14 17:08:11,535 INFO L273 TraceCheckUtils]: 140: Hoare triple {14242#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {14242#false} is VALID [2018-11-14 17:08:11,535 INFO L256 TraceCheckUtils]: 141: Hoare triple {14242#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {14242#false} is VALID [2018-11-14 17:08:11,536 INFO L273 TraceCheckUtils]: 142: Hoare triple {14242#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; {14242#false} is VALID [2018-11-14 17:08:11,536 INFO L273 TraceCheckUtils]: 143: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,536 INFO L273 TraceCheckUtils]: 144: Hoare triple {14242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:08:11,536 INFO L273 TraceCheckUtils]: 145: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:08:11,536 INFO L273 TraceCheckUtils]: 146: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,536 INFO L273 TraceCheckUtils]: 147: Hoare triple {14242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:08:11,536 INFO L273 TraceCheckUtils]: 148: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:08:11,536 INFO L273 TraceCheckUtils]: 149: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,536 INFO L273 TraceCheckUtils]: 150: Hoare triple {14242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:08:11,537 INFO L273 TraceCheckUtils]: 151: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:08:11,537 INFO L273 TraceCheckUtils]: 152: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,537 INFO L273 TraceCheckUtils]: 153: Hoare triple {14242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:08:11,537 INFO L273 TraceCheckUtils]: 154: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:08:11,537 INFO L273 TraceCheckUtils]: 155: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,537 INFO L273 TraceCheckUtils]: 156: Hoare triple {14242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:08:11,537 INFO L273 TraceCheckUtils]: 157: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:08:11,537 INFO L273 TraceCheckUtils]: 158: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,537 INFO L273 TraceCheckUtils]: 159: Hoare triple {14242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:08:11,538 INFO L273 TraceCheckUtils]: 160: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:08:11,538 INFO L273 TraceCheckUtils]: 161: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,538 INFO L273 TraceCheckUtils]: 162: Hoare triple {14242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:08:11,538 INFO L273 TraceCheckUtils]: 163: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:08:11,538 INFO L273 TraceCheckUtils]: 164: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,538 INFO L273 TraceCheckUtils]: 165: Hoare triple {14242#false} assume !(~i~0 < 10000); {14242#false} is VALID [2018-11-14 17:08:11,538 INFO L273 TraceCheckUtils]: 166: Hoare triple {14242#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14242#false} is VALID [2018-11-14 17:08:11,538 INFO L273 TraceCheckUtils]: 167: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:08:11,538 INFO L268 TraceCheckUtils]: 168: Hoare quadruple {14242#false} {14242#false} #77#return; {14242#false} is VALID [2018-11-14 17:08:11,539 INFO L273 TraceCheckUtils]: 169: Hoare triple {14242#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {14242#false} is VALID [2018-11-14 17:08:11,539 INFO L273 TraceCheckUtils]: 170: Hoare triple {14242#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {14242#false} is VALID [2018-11-14 17:08:11,539 INFO L273 TraceCheckUtils]: 171: Hoare triple {14242#false} assume !false; {14242#false} is VALID [2018-11-14 17:08:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2018-11-14 17:08:11,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:11,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-14 17:08:11,575 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 172 [2018-11-14 17:08:11,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:11,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-14 17:08:11,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:11,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-14 17:08:11,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-14 17:08:11,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-14 17:08:11,672 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 23 states. [2018-11-14 17:08:12,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:12,602 INFO L93 Difference]: Finished difference Result 177 states and 185 transitions. [2018-11-14 17:08:12,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 17:08:12,602 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 172 [2018-11-14 17:08:12,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:12,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 17:08:12,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 117 transitions. [2018-11-14 17:08:12,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 17:08:12,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 117 transitions. [2018-11-14 17:08:12,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 117 transitions. [2018-11-14 17:08:12,714 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:08:12,717 INFO L225 Difference]: With dead ends: 177 [2018-11-14 17:08:12,717 INFO L226 Difference]: Without dead ends: 123 [2018-11-14 17:08:12,717 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-14 17:08:12,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-14 17:08:12,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-11-14 17:08:12,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:12,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 122 states. [2018-11-14 17:08:12,748 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 122 states. [2018-11-14 17:08:12,749 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 122 states. [2018-11-14 17:08:12,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:12,751 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-11-14 17:08:12,751 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-14 17:08:12,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:12,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:12,752 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 123 states. [2018-11-14 17:08:12,752 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 123 states. [2018-11-14 17:08:12,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:12,754 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-11-14 17:08:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-14 17:08:12,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:12,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:12,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:12,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:12,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-14 17:08:12,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2018-11-14 17:08:12,757 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 172 [2018-11-14 17:08:12,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:12,758 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2018-11-14 17:08:12,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-14 17:08:12,758 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2018-11-14 17:08:12,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-14 17:08:12,759 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:12,759 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:08:12,759 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:12,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:12,760 INFO L82 PathProgramCache]: Analyzing trace with hash 862428551, now seen corresponding path program 20 times [2018-11-14 17:08:12,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:12,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:12,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:12,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:08:12,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:13,240 INFO L256 TraceCheckUtils]: 0: Hoare triple {15428#true} call ULTIMATE.init(); {15428#true} is VALID [2018-11-14 17:08:13,241 INFO L273 TraceCheckUtils]: 1: Hoare triple {15428#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15428#true} is VALID [2018-11-14 17:08:13,241 INFO L273 TraceCheckUtils]: 2: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:13,241 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15428#true} {15428#true} #69#return; {15428#true} is VALID [2018-11-14 17:08:13,241 INFO L256 TraceCheckUtils]: 4: Hoare triple {15428#true} call #t~ret13 := main(); {15428#true} is VALID [2018-11-14 17:08:13,242 INFO L273 TraceCheckUtils]: 5: Hoare triple {15428#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; {15430#(= main_~i~1 0)} is VALID [2018-11-14 17:08:13,242 INFO L273 TraceCheckUtils]: 6: Hoare triple {15430#(= main_~i~1 0)} assume true; {15430#(= main_~i~1 0)} is VALID [2018-11-14 17:08:13,243 INFO L273 TraceCheckUtils]: 7: Hoare triple {15430#(= 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; {15430#(= main_~i~1 0)} is VALID [2018-11-14 17:08:13,243 INFO L273 TraceCheckUtils]: 8: Hoare triple {15430#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15431#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:13,243 INFO L273 TraceCheckUtils]: 9: Hoare triple {15431#(<= main_~i~1 1)} assume true; {15431#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:13,244 INFO L273 TraceCheckUtils]: 10: Hoare triple {15431#(<= 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; {15431#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:13,244 INFO L273 TraceCheckUtils]: 11: Hoare triple {15431#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15432#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:13,244 INFO L273 TraceCheckUtils]: 12: Hoare triple {15432#(<= main_~i~1 2)} assume true; {15432#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:13,245 INFO L273 TraceCheckUtils]: 13: Hoare triple {15432#(<= 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; {15432#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:13,245 INFO L273 TraceCheckUtils]: 14: Hoare triple {15432#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15433#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:13,246 INFO L273 TraceCheckUtils]: 15: Hoare triple {15433#(<= main_~i~1 3)} assume true; {15433#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:13,246 INFO L273 TraceCheckUtils]: 16: Hoare triple {15433#(<= 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; {15433#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:13,247 INFO L273 TraceCheckUtils]: 17: Hoare triple {15433#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15434#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:13,248 INFO L273 TraceCheckUtils]: 18: Hoare triple {15434#(<= main_~i~1 4)} assume true; {15434#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:13,248 INFO L273 TraceCheckUtils]: 19: Hoare triple {15434#(<= 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; {15434#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:13,249 INFO L273 TraceCheckUtils]: 20: Hoare triple {15434#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15435#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:13,249 INFO L273 TraceCheckUtils]: 21: Hoare triple {15435#(<= main_~i~1 5)} assume true; {15435#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:13,250 INFO L273 TraceCheckUtils]: 22: Hoare triple {15435#(<= 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; {15435#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:13,251 INFO L273 TraceCheckUtils]: 23: Hoare triple {15435#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15436#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:13,251 INFO L273 TraceCheckUtils]: 24: Hoare triple {15436#(<= main_~i~1 6)} assume true; {15436#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:13,252 INFO L273 TraceCheckUtils]: 25: Hoare triple {15436#(<= 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; {15436#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:13,252 INFO L273 TraceCheckUtils]: 26: Hoare triple {15436#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15437#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:13,253 INFO L273 TraceCheckUtils]: 27: Hoare triple {15437#(<= main_~i~1 7)} assume true; {15437#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:13,253 INFO L273 TraceCheckUtils]: 28: Hoare triple {15437#(<= 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; {15437#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:13,254 INFO L273 TraceCheckUtils]: 29: Hoare triple {15437#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15438#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:13,255 INFO L273 TraceCheckUtils]: 30: Hoare triple {15438#(<= main_~i~1 8)} assume true; {15438#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:13,255 INFO L273 TraceCheckUtils]: 31: Hoare triple {15438#(<= 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; {15438#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:13,256 INFO L273 TraceCheckUtils]: 32: Hoare triple {15438#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15439#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:13,256 INFO L273 TraceCheckUtils]: 33: Hoare triple {15439#(<= main_~i~1 9)} assume true; {15439#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:13,257 INFO L273 TraceCheckUtils]: 34: Hoare triple {15439#(<= 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; {15439#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:13,258 INFO L273 TraceCheckUtils]: 35: Hoare triple {15439#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15440#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:13,258 INFO L273 TraceCheckUtils]: 36: Hoare triple {15440#(<= main_~i~1 10)} assume true; {15440#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:13,259 INFO L273 TraceCheckUtils]: 37: Hoare triple {15440#(<= 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; {15440#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:13,259 INFO L273 TraceCheckUtils]: 38: Hoare triple {15440#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15441#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:13,260 INFO L273 TraceCheckUtils]: 39: Hoare triple {15441#(<= main_~i~1 11)} assume true; {15441#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:13,260 INFO L273 TraceCheckUtils]: 40: Hoare triple {15441#(<= 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; {15441#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:13,261 INFO L273 TraceCheckUtils]: 41: Hoare triple {15441#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15442#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:13,262 INFO L273 TraceCheckUtils]: 42: Hoare triple {15442#(<= main_~i~1 12)} assume true; {15442#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:13,262 INFO L273 TraceCheckUtils]: 43: Hoare triple {15442#(<= 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; {15442#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:13,263 INFO L273 TraceCheckUtils]: 44: Hoare triple {15442#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15443#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:13,263 INFO L273 TraceCheckUtils]: 45: Hoare triple {15443#(<= main_~i~1 13)} assume true; {15443#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:13,264 INFO L273 TraceCheckUtils]: 46: Hoare triple {15443#(<= 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; {15443#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:13,265 INFO L273 TraceCheckUtils]: 47: Hoare triple {15443#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15444#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:13,265 INFO L273 TraceCheckUtils]: 48: Hoare triple {15444#(<= main_~i~1 14)} assume true; {15444#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:13,266 INFO L273 TraceCheckUtils]: 49: Hoare triple {15444#(<= 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; {15444#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:13,266 INFO L273 TraceCheckUtils]: 50: Hoare triple {15444#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15445#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:13,267 INFO L273 TraceCheckUtils]: 51: Hoare triple {15445#(<= main_~i~1 15)} assume true; {15445#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:13,267 INFO L273 TraceCheckUtils]: 52: Hoare triple {15445#(<= 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; {15445#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:13,268 INFO L273 TraceCheckUtils]: 53: Hoare triple {15445#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15446#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:13,269 INFO L273 TraceCheckUtils]: 54: Hoare triple {15446#(<= main_~i~1 16)} assume true; {15446#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:13,269 INFO L273 TraceCheckUtils]: 55: Hoare triple {15446#(<= 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; {15446#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:13,270 INFO L273 TraceCheckUtils]: 56: Hoare triple {15446#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15447#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:13,271 INFO L273 TraceCheckUtils]: 57: Hoare triple {15447#(<= main_~i~1 17)} assume true; {15447#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:13,271 INFO L273 TraceCheckUtils]: 58: Hoare triple {15447#(<= 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; {15447#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:13,272 INFO L273 TraceCheckUtils]: 59: Hoare triple {15447#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15448#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:13,272 INFO L273 TraceCheckUtils]: 60: Hoare triple {15448#(<= main_~i~1 18)} assume true; {15448#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:13,273 INFO L273 TraceCheckUtils]: 61: Hoare triple {15448#(<= 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; {15448#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:13,274 INFO L273 TraceCheckUtils]: 62: Hoare triple {15448#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15449#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:13,274 INFO L273 TraceCheckUtils]: 63: Hoare triple {15449#(<= main_~i~1 19)} assume true; {15449#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:13,275 INFO L273 TraceCheckUtils]: 64: Hoare triple {15449#(<= 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; {15449#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:13,275 INFO L273 TraceCheckUtils]: 65: Hoare triple {15449#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15450#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:13,276 INFO L273 TraceCheckUtils]: 66: Hoare triple {15450#(<= main_~i~1 20)} assume true; {15450#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:13,277 INFO L273 TraceCheckUtils]: 67: Hoare triple {15450#(<= main_~i~1 20)} assume !(~i~1 < 10000); {15429#false} is VALID [2018-11-14 17:08:13,277 INFO L256 TraceCheckUtils]: 68: Hoare triple {15429#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {15428#true} is VALID [2018-11-14 17:08:13,277 INFO L273 TraceCheckUtils]: 69: Hoare triple {15428#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; {15428#true} is VALID [2018-11-14 17:08:13,277 INFO L273 TraceCheckUtils]: 70: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:13,277 INFO L273 TraceCheckUtils]: 71: Hoare triple {15428#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:08:13,278 INFO L273 TraceCheckUtils]: 72: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:08:13,278 INFO L273 TraceCheckUtils]: 73: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:13,278 INFO L273 TraceCheckUtils]: 74: Hoare triple {15428#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:08:13,278 INFO L273 TraceCheckUtils]: 75: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:08:13,278 INFO L273 TraceCheckUtils]: 76: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:13,279 INFO L273 TraceCheckUtils]: 77: Hoare triple {15428#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:08:13,279 INFO L273 TraceCheckUtils]: 78: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:08:13,279 INFO L273 TraceCheckUtils]: 79: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:13,279 INFO L273 TraceCheckUtils]: 80: Hoare triple {15428#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:08:13,279 INFO L273 TraceCheckUtils]: 81: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:08:13,279 INFO L273 TraceCheckUtils]: 82: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:13,280 INFO L273 TraceCheckUtils]: 83: Hoare triple {15428#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:08:13,280 INFO L273 TraceCheckUtils]: 84: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:08:13,280 INFO L273 TraceCheckUtils]: 85: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:13,280 INFO L273 TraceCheckUtils]: 86: Hoare triple {15428#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:08:13,280 INFO L273 TraceCheckUtils]: 87: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:08:13,280 INFO L273 TraceCheckUtils]: 88: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:13,280 INFO L273 TraceCheckUtils]: 89: Hoare triple {15428#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:08:13,280 INFO L273 TraceCheckUtils]: 90: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:08:13,280 INFO L273 TraceCheckUtils]: 91: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:13,281 INFO L273 TraceCheckUtils]: 92: Hoare triple {15428#true} assume !(~i~0 < 10000); {15428#true} is VALID [2018-11-14 17:08:13,281 INFO L273 TraceCheckUtils]: 93: Hoare triple {15428#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15428#true} is VALID [2018-11-14 17:08:13,281 INFO L273 TraceCheckUtils]: 94: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:13,281 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {15428#true} {15429#false} #73#return; {15429#false} is VALID [2018-11-14 17:08:13,281 INFO L273 TraceCheckUtils]: 96: Hoare triple {15429#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); {15429#false} is VALID [2018-11-14 17:08:13,281 INFO L256 TraceCheckUtils]: 97: Hoare triple {15429#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {15428#true} is VALID [2018-11-14 17:08:13,281 INFO L273 TraceCheckUtils]: 98: Hoare triple {15428#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; {15428#true} is VALID [2018-11-14 17:08:13,281 INFO L273 TraceCheckUtils]: 99: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:13,281 INFO L273 TraceCheckUtils]: 100: Hoare triple {15428#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:08:13,282 INFO L273 TraceCheckUtils]: 101: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:08:13,282 INFO L273 TraceCheckUtils]: 102: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:13,282 INFO L273 TraceCheckUtils]: 103: Hoare triple {15428#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:08:13,282 INFO L273 TraceCheckUtils]: 104: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:08:13,282 INFO L273 TraceCheckUtils]: 105: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:13,282 INFO L273 TraceCheckUtils]: 106: Hoare triple {15428#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:08:13,282 INFO L273 TraceCheckUtils]: 107: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:08:13,282 INFO L273 TraceCheckUtils]: 108: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:13,282 INFO L273 TraceCheckUtils]: 109: Hoare triple {15428#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:08:13,283 INFO L273 TraceCheckUtils]: 110: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:08:13,283 INFO L273 TraceCheckUtils]: 111: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:13,283 INFO L273 TraceCheckUtils]: 112: Hoare triple {15428#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:08:13,283 INFO L273 TraceCheckUtils]: 113: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:08:13,283 INFO L273 TraceCheckUtils]: 114: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:13,283 INFO L273 TraceCheckUtils]: 115: Hoare triple {15428#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:08:13,283 INFO L273 TraceCheckUtils]: 116: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:08:13,283 INFO L273 TraceCheckUtils]: 117: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:13,283 INFO L273 TraceCheckUtils]: 118: Hoare triple {15428#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:08:13,283 INFO L273 TraceCheckUtils]: 119: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:08:13,284 INFO L273 TraceCheckUtils]: 120: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:13,284 INFO L273 TraceCheckUtils]: 121: Hoare triple {15428#true} assume !(~i~0 < 10000); {15428#true} is VALID [2018-11-14 17:08:13,284 INFO L273 TraceCheckUtils]: 122: Hoare triple {15428#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15428#true} is VALID [2018-11-14 17:08:13,284 INFO L273 TraceCheckUtils]: 123: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:13,284 INFO L268 TraceCheckUtils]: 124: Hoare quadruple {15428#true} {15429#false} #75#return; {15429#false} is VALID [2018-11-14 17:08:13,284 INFO L273 TraceCheckUtils]: 125: Hoare triple {15429#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; {15429#false} is VALID [2018-11-14 17:08:13,284 INFO L273 TraceCheckUtils]: 126: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:13,284 INFO L273 TraceCheckUtils]: 127: Hoare triple {15429#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:08:13,284 INFO L273 TraceCheckUtils]: 128: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:08:13,285 INFO L273 TraceCheckUtils]: 129: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:13,285 INFO L273 TraceCheckUtils]: 130: Hoare triple {15429#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:08:13,285 INFO L273 TraceCheckUtils]: 131: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:08:13,285 INFO L273 TraceCheckUtils]: 132: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:13,285 INFO L273 TraceCheckUtils]: 133: Hoare triple {15429#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:08:13,285 INFO L273 TraceCheckUtils]: 134: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:08:13,285 INFO L273 TraceCheckUtils]: 135: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:13,285 INFO L273 TraceCheckUtils]: 136: Hoare triple {15429#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:08:13,285 INFO L273 TraceCheckUtils]: 137: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:08:13,286 INFO L273 TraceCheckUtils]: 138: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:13,286 INFO L273 TraceCheckUtils]: 139: Hoare triple {15429#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:08:13,286 INFO L273 TraceCheckUtils]: 140: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:08:13,286 INFO L273 TraceCheckUtils]: 141: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:13,286 INFO L273 TraceCheckUtils]: 142: Hoare triple {15429#false} assume !(~i~2 < 9999); {15429#false} is VALID [2018-11-14 17:08:13,286 INFO L273 TraceCheckUtils]: 143: Hoare triple {15429#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {15429#false} is VALID [2018-11-14 17:08:13,286 INFO L256 TraceCheckUtils]: 144: Hoare triple {15429#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {15428#true} is VALID [2018-11-14 17:08:13,286 INFO L273 TraceCheckUtils]: 145: Hoare triple {15428#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; {15428#true} is VALID [2018-11-14 17:08:13,286 INFO L273 TraceCheckUtils]: 146: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:13,287 INFO L273 TraceCheckUtils]: 147: Hoare triple {15428#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:08:13,287 INFO L273 TraceCheckUtils]: 148: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:08:13,287 INFO L273 TraceCheckUtils]: 149: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:13,287 INFO L273 TraceCheckUtils]: 150: Hoare triple {15428#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:08:13,287 INFO L273 TraceCheckUtils]: 151: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:08:13,287 INFO L273 TraceCheckUtils]: 152: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:13,287 INFO L273 TraceCheckUtils]: 153: Hoare triple {15428#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:08:13,287 INFO L273 TraceCheckUtils]: 154: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:08:13,287 INFO L273 TraceCheckUtils]: 155: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:13,288 INFO L273 TraceCheckUtils]: 156: Hoare triple {15428#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:08:13,288 INFO L273 TraceCheckUtils]: 157: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:08:13,288 INFO L273 TraceCheckUtils]: 158: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:13,288 INFO L273 TraceCheckUtils]: 159: Hoare triple {15428#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:08:13,288 INFO L273 TraceCheckUtils]: 160: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:08:13,288 INFO L273 TraceCheckUtils]: 161: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:13,288 INFO L273 TraceCheckUtils]: 162: Hoare triple {15428#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:08:13,288 INFO L273 TraceCheckUtils]: 163: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:08:13,288 INFO L273 TraceCheckUtils]: 164: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:13,288 INFO L273 TraceCheckUtils]: 165: Hoare triple {15428#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:08:13,289 INFO L273 TraceCheckUtils]: 166: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:08:13,289 INFO L273 TraceCheckUtils]: 167: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:13,289 INFO L273 TraceCheckUtils]: 168: Hoare triple {15428#true} assume !(~i~0 < 10000); {15428#true} is VALID [2018-11-14 17:08:13,289 INFO L273 TraceCheckUtils]: 169: Hoare triple {15428#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15428#true} is VALID [2018-11-14 17:08:13,289 INFO L273 TraceCheckUtils]: 170: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:13,289 INFO L268 TraceCheckUtils]: 171: Hoare quadruple {15428#true} {15429#false} #77#return; {15429#false} is VALID [2018-11-14 17:08:13,289 INFO L273 TraceCheckUtils]: 172: Hoare triple {15429#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {15429#false} is VALID [2018-11-14 17:08:13,289 INFO L273 TraceCheckUtils]: 173: Hoare triple {15429#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {15429#false} is VALID [2018-11-14 17:08:13,289 INFO L273 TraceCheckUtils]: 174: Hoare triple {15429#false} assume !false; {15429#false} is VALID [2018-11-14 17:08:13,303 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:08:13,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:13,303 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:08:13,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:08:13,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:08:13,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:08:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:13,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:14,738 INFO L256 TraceCheckUtils]: 0: Hoare triple {15428#true} call ULTIMATE.init(); {15428#true} is VALID [2018-11-14 17:08:14,738 INFO L273 TraceCheckUtils]: 1: Hoare triple {15428#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15428#true} is VALID [2018-11-14 17:08:14,738 INFO L273 TraceCheckUtils]: 2: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:08:14,739 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15428#true} {15428#true} #69#return; {15428#true} is VALID [2018-11-14 17:08:14,739 INFO L256 TraceCheckUtils]: 4: Hoare triple {15428#true} call #t~ret13 := main(); {15428#true} is VALID [2018-11-14 17:08:14,739 INFO L273 TraceCheckUtils]: 5: Hoare triple {15428#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; {15469#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:14,740 INFO L273 TraceCheckUtils]: 6: Hoare triple {15469#(<= main_~i~1 0)} assume true; {15469#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:14,740 INFO L273 TraceCheckUtils]: 7: Hoare triple {15469#(<= 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; {15469#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:14,741 INFO L273 TraceCheckUtils]: 8: Hoare triple {15469#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15431#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:14,741 INFO L273 TraceCheckUtils]: 9: Hoare triple {15431#(<= main_~i~1 1)} assume true; {15431#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:14,741 INFO L273 TraceCheckUtils]: 10: Hoare triple {15431#(<= 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; {15431#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:14,742 INFO L273 TraceCheckUtils]: 11: Hoare triple {15431#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15432#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:14,742 INFO L273 TraceCheckUtils]: 12: Hoare triple {15432#(<= main_~i~1 2)} assume true; {15432#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:14,742 INFO L273 TraceCheckUtils]: 13: Hoare triple {15432#(<= 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; {15432#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:14,743 INFO L273 TraceCheckUtils]: 14: Hoare triple {15432#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15433#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:14,744 INFO L273 TraceCheckUtils]: 15: Hoare triple {15433#(<= main_~i~1 3)} assume true; {15433#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:14,744 INFO L273 TraceCheckUtils]: 16: Hoare triple {15433#(<= 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; {15433#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:14,745 INFO L273 TraceCheckUtils]: 17: Hoare triple {15433#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15434#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:14,745 INFO L273 TraceCheckUtils]: 18: Hoare triple {15434#(<= main_~i~1 4)} assume true; {15434#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:14,746 INFO L273 TraceCheckUtils]: 19: Hoare triple {15434#(<= 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; {15434#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:14,747 INFO L273 TraceCheckUtils]: 20: Hoare triple {15434#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15435#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:14,747 INFO L273 TraceCheckUtils]: 21: Hoare triple {15435#(<= main_~i~1 5)} assume true; {15435#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:14,748 INFO L273 TraceCheckUtils]: 22: Hoare triple {15435#(<= 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; {15435#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:14,748 INFO L273 TraceCheckUtils]: 23: Hoare triple {15435#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15436#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:14,749 INFO L273 TraceCheckUtils]: 24: Hoare triple {15436#(<= main_~i~1 6)} assume true; {15436#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:14,749 INFO L273 TraceCheckUtils]: 25: Hoare triple {15436#(<= 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; {15436#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:14,750 INFO L273 TraceCheckUtils]: 26: Hoare triple {15436#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15437#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:14,751 INFO L273 TraceCheckUtils]: 27: Hoare triple {15437#(<= main_~i~1 7)} assume true; {15437#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:14,751 INFO L273 TraceCheckUtils]: 28: Hoare triple {15437#(<= 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; {15437#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:14,752 INFO L273 TraceCheckUtils]: 29: Hoare triple {15437#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15438#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:14,752 INFO L273 TraceCheckUtils]: 30: Hoare triple {15438#(<= main_~i~1 8)} assume true; {15438#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:14,753 INFO L273 TraceCheckUtils]: 31: Hoare triple {15438#(<= 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; {15438#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:14,754 INFO L273 TraceCheckUtils]: 32: Hoare triple {15438#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15439#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:14,754 INFO L273 TraceCheckUtils]: 33: Hoare triple {15439#(<= main_~i~1 9)} assume true; {15439#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:14,755 INFO L273 TraceCheckUtils]: 34: Hoare triple {15439#(<= 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; {15439#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:14,755 INFO L273 TraceCheckUtils]: 35: Hoare triple {15439#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15440#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:14,756 INFO L273 TraceCheckUtils]: 36: Hoare triple {15440#(<= main_~i~1 10)} assume true; {15440#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:14,756 INFO L273 TraceCheckUtils]: 37: Hoare triple {15440#(<= 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; {15440#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:14,757 INFO L273 TraceCheckUtils]: 38: Hoare triple {15440#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15441#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:14,758 INFO L273 TraceCheckUtils]: 39: Hoare triple {15441#(<= main_~i~1 11)} assume true; {15441#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:14,758 INFO L273 TraceCheckUtils]: 40: Hoare triple {15441#(<= 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; {15441#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:14,759 INFO L273 TraceCheckUtils]: 41: Hoare triple {15441#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15442#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:14,759 INFO L273 TraceCheckUtils]: 42: Hoare triple {15442#(<= main_~i~1 12)} assume true; {15442#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:14,760 INFO L273 TraceCheckUtils]: 43: Hoare triple {15442#(<= 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; {15442#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:14,761 INFO L273 TraceCheckUtils]: 44: Hoare triple {15442#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15443#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:14,761 INFO L273 TraceCheckUtils]: 45: Hoare triple {15443#(<= main_~i~1 13)} assume true; {15443#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:14,762 INFO L273 TraceCheckUtils]: 46: Hoare triple {15443#(<= 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; {15443#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:14,762 INFO L273 TraceCheckUtils]: 47: Hoare triple {15443#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15444#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:14,763 INFO L273 TraceCheckUtils]: 48: Hoare triple {15444#(<= main_~i~1 14)} assume true; {15444#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:14,764 INFO L273 TraceCheckUtils]: 49: Hoare triple {15444#(<= 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; {15444#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:14,764 INFO L273 TraceCheckUtils]: 50: Hoare triple {15444#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15445#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:14,765 INFO L273 TraceCheckUtils]: 51: Hoare triple {15445#(<= main_~i~1 15)} assume true; {15445#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:14,765 INFO L273 TraceCheckUtils]: 52: Hoare triple {15445#(<= 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; {15445#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:14,766 INFO L273 TraceCheckUtils]: 53: Hoare triple {15445#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15446#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:14,767 INFO L273 TraceCheckUtils]: 54: Hoare triple {15446#(<= main_~i~1 16)} assume true; {15446#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:14,767 INFO L273 TraceCheckUtils]: 55: Hoare triple {15446#(<= 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; {15446#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:14,768 INFO L273 TraceCheckUtils]: 56: Hoare triple {15446#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15447#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:14,768 INFO L273 TraceCheckUtils]: 57: Hoare triple {15447#(<= main_~i~1 17)} assume true; {15447#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:14,769 INFO L273 TraceCheckUtils]: 58: Hoare triple {15447#(<= 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; {15447#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:14,770 INFO L273 TraceCheckUtils]: 59: Hoare triple {15447#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15448#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:14,770 INFO L273 TraceCheckUtils]: 60: Hoare triple {15448#(<= main_~i~1 18)} assume true; {15448#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:14,771 INFO L273 TraceCheckUtils]: 61: Hoare triple {15448#(<= 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; {15448#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:14,791 INFO L273 TraceCheckUtils]: 62: Hoare triple {15448#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15449#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:14,806 INFO L273 TraceCheckUtils]: 63: Hoare triple {15449#(<= main_~i~1 19)} assume true; {15449#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:14,815 INFO L273 TraceCheckUtils]: 64: Hoare triple {15449#(<= 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; {15449#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:14,819 INFO L273 TraceCheckUtils]: 65: Hoare triple {15449#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15450#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:14,819 INFO L273 TraceCheckUtils]: 66: Hoare triple {15450#(<= main_~i~1 20)} assume true; {15450#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:14,820 INFO L273 TraceCheckUtils]: 67: Hoare triple {15450#(<= main_~i~1 20)} assume !(~i~1 < 10000); {15429#false} is VALID [2018-11-14 17:08:14,820 INFO L256 TraceCheckUtils]: 68: Hoare triple {15429#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {15429#false} is VALID [2018-11-14 17:08:14,820 INFO L273 TraceCheckUtils]: 69: Hoare triple {15429#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; {15429#false} is VALID [2018-11-14 17:08:14,820 INFO L273 TraceCheckUtils]: 70: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,820 INFO L273 TraceCheckUtils]: 71: Hoare triple {15429#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:08:14,821 INFO L273 TraceCheckUtils]: 72: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:08:14,821 INFO L273 TraceCheckUtils]: 73: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,821 INFO L273 TraceCheckUtils]: 74: Hoare triple {15429#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:08:14,821 INFO L273 TraceCheckUtils]: 75: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:08:14,821 INFO L273 TraceCheckUtils]: 76: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,821 INFO L273 TraceCheckUtils]: 77: Hoare triple {15429#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:08:14,821 INFO L273 TraceCheckUtils]: 78: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:08:14,821 INFO L273 TraceCheckUtils]: 79: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,821 INFO L273 TraceCheckUtils]: 80: Hoare triple {15429#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:08:14,821 INFO L273 TraceCheckUtils]: 81: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:08:14,822 INFO L273 TraceCheckUtils]: 82: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,822 INFO L273 TraceCheckUtils]: 83: Hoare triple {15429#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:08:14,822 INFO L273 TraceCheckUtils]: 84: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:08:14,822 INFO L273 TraceCheckUtils]: 85: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,822 INFO L273 TraceCheckUtils]: 86: Hoare triple {15429#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:08:14,822 INFO L273 TraceCheckUtils]: 87: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:08:14,822 INFO L273 TraceCheckUtils]: 88: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,822 INFO L273 TraceCheckUtils]: 89: Hoare triple {15429#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:08:14,822 INFO L273 TraceCheckUtils]: 90: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:08:14,822 INFO L273 TraceCheckUtils]: 91: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,823 INFO L273 TraceCheckUtils]: 92: Hoare triple {15429#false} assume !(~i~0 < 10000); {15429#false} is VALID [2018-11-14 17:08:14,823 INFO L273 TraceCheckUtils]: 93: Hoare triple {15429#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15429#false} is VALID [2018-11-14 17:08:14,823 INFO L273 TraceCheckUtils]: 94: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,823 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {15429#false} {15429#false} #73#return; {15429#false} is VALID [2018-11-14 17:08:14,823 INFO L273 TraceCheckUtils]: 96: Hoare triple {15429#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); {15429#false} is VALID [2018-11-14 17:08:14,823 INFO L256 TraceCheckUtils]: 97: Hoare triple {15429#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {15429#false} is VALID [2018-11-14 17:08:14,823 INFO L273 TraceCheckUtils]: 98: Hoare triple {15429#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; {15429#false} is VALID [2018-11-14 17:08:14,823 INFO L273 TraceCheckUtils]: 99: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,823 INFO L273 TraceCheckUtils]: 100: Hoare triple {15429#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:08:14,824 INFO L273 TraceCheckUtils]: 101: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:08:14,824 INFO L273 TraceCheckUtils]: 102: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,824 INFO L273 TraceCheckUtils]: 103: Hoare triple {15429#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:08:14,824 INFO L273 TraceCheckUtils]: 104: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:08:14,824 INFO L273 TraceCheckUtils]: 105: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,824 INFO L273 TraceCheckUtils]: 106: Hoare triple {15429#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:08:14,824 INFO L273 TraceCheckUtils]: 107: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:08:14,824 INFO L273 TraceCheckUtils]: 108: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,824 INFO L273 TraceCheckUtils]: 109: Hoare triple {15429#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:08:14,825 INFO L273 TraceCheckUtils]: 110: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:08:14,825 INFO L273 TraceCheckUtils]: 111: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,825 INFO L273 TraceCheckUtils]: 112: Hoare triple {15429#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:08:14,825 INFO L273 TraceCheckUtils]: 113: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:08:14,825 INFO L273 TraceCheckUtils]: 114: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,825 INFO L273 TraceCheckUtils]: 115: Hoare triple {15429#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:08:14,825 INFO L273 TraceCheckUtils]: 116: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:08:14,825 INFO L273 TraceCheckUtils]: 117: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,825 INFO L273 TraceCheckUtils]: 118: Hoare triple {15429#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:08:14,825 INFO L273 TraceCheckUtils]: 119: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:08:14,826 INFO L273 TraceCheckUtils]: 120: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,826 INFO L273 TraceCheckUtils]: 121: Hoare triple {15429#false} assume !(~i~0 < 10000); {15429#false} is VALID [2018-11-14 17:08:14,826 INFO L273 TraceCheckUtils]: 122: Hoare triple {15429#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15429#false} is VALID [2018-11-14 17:08:14,826 INFO L273 TraceCheckUtils]: 123: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,826 INFO L268 TraceCheckUtils]: 124: Hoare quadruple {15429#false} {15429#false} #75#return; {15429#false} is VALID [2018-11-14 17:08:14,826 INFO L273 TraceCheckUtils]: 125: Hoare triple {15429#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; {15429#false} is VALID [2018-11-14 17:08:14,826 INFO L273 TraceCheckUtils]: 126: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,826 INFO L273 TraceCheckUtils]: 127: Hoare triple {15429#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:08:14,826 INFO L273 TraceCheckUtils]: 128: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:08:14,826 INFO L273 TraceCheckUtils]: 129: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,827 INFO L273 TraceCheckUtils]: 130: Hoare triple {15429#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:08:14,827 INFO L273 TraceCheckUtils]: 131: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:08:14,827 INFO L273 TraceCheckUtils]: 132: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,827 INFO L273 TraceCheckUtils]: 133: Hoare triple {15429#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:08:14,827 INFO L273 TraceCheckUtils]: 134: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:08:14,827 INFO L273 TraceCheckUtils]: 135: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,827 INFO L273 TraceCheckUtils]: 136: Hoare triple {15429#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:08:14,827 INFO L273 TraceCheckUtils]: 137: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:08:14,827 INFO L273 TraceCheckUtils]: 138: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,828 INFO L273 TraceCheckUtils]: 139: Hoare triple {15429#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:08:14,828 INFO L273 TraceCheckUtils]: 140: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:08:14,828 INFO L273 TraceCheckUtils]: 141: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,828 INFO L273 TraceCheckUtils]: 142: Hoare triple {15429#false} assume !(~i~2 < 9999); {15429#false} is VALID [2018-11-14 17:08:14,828 INFO L273 TraceCheckUtils]: 143: Hoare triple {15429#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {15429#false} is VALID [2018-11-14 17:08:14,828 INFO L256 TraceCheckUtils]: 144: Hoare triple {15429#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {15429#false} is VALID [2018-11-14 17:08:14,828 INFO L273 TraceCheckUtils]: 145: Hoare triple {15429#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; {15429#false} is VALID [2018-11-14 17:08:14,828 INFO L273 TraceCheckUtils]: 146: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,828 INFO L273 TraceCheckUtils]: 147: Hoare triple {15429#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:08:14,828 INFO L273 TraceCheckUtils]: 148: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:08:14,829 INFO L273 TraceCheckUtils]: 149: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,829 INFO L273 TraceCheckUtils]: 150: Hoare triple {15429#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:08:14,829 INFO L273 TraceCheckUtils]: 151: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:08:14,829 INFO L273 TraceCheckUtils]: 152: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,829 INFO L273 TraceCheckUtils]: 153: Hoare triple {15429#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:08:14,829 INFO L273 TraceCheckUtils]: 154: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:08:14,829 INFO L273 TraceCheckUtils]: 155: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,829 INFO L273 TraceCheckUtils]: 156: Hoare triple {15429#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:08:14,829 INFO L273 TraceCheckUtils]: 157: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:08:14,830 INFO L273 TraceCheckUtils]: 158: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,830 INFO L273 TraceCheckUtils]: 159: Hoare triple {15429#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:08:14,830 INFO L273 TraceCheckUtils]: 160: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:08:14,830 INFO L273 TraceCheckUtils]: 161: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,830 INFO L273 TraceCheckUtils]: 162: Hoare triple {15429#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:08:14,830 INFO L273 TraceCheckUtils]: 163: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:08:14,830 INFO L273 TraceCheckUtils]: 164: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,830 INFO L273 TraceCheckUtils]: 165: Hoare triple {15429#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:08:14,830 INFO L273 TraceCheckUtils]: 166: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:08:14,830 INFO L273 TraceCheckUtils]: 167: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,831 INFO L273 TraceCheckUtils]: 168: Hoare triple {15429#false} assume !(~i~0 < 10000); {15429#false} is VALID [2018-11-14 17:08:14,831 INFO L273 TraceCheckUtils]: 169: Hoare triple {15429#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15429#false} is VALID [2018-11-14 17:08:14,831 INFO L273 TraceCheckUtils]: 170: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:08:14,831 INFO L268 TraceCheckUtils]: 171: Hoare quadruple {15429#false} {15429#false} #77#return; {15429#false} is VALID [2018-11-14 17:08:14,831 INFO L273 TraceCheckUtils]: 172: Hoare triple {15429#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {15429#false} is VALID [2018-11-14 17:08:14,831 INFO L273 TraceCheckUtils]: 173: Hoare triple {15429#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {15429#false} is VALID [2018-11-14 17:08:14,831 INFO L273 TraceCheckUtils]: 174: Hoare triple {15429#false} assume !false; {15429#false} is VALID [2018-11-14 17:08:14,845 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:08:14,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:14,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-14 17:08:14,866 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2018-11-14 17:08:14,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:14,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 17:08:14,966 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:08:14,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 17:08:14,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 17:08:14,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 17:08:14,968 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand 24 states. [2018-11-14 17:08:15,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:15,723 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2018-11-14 17:08:15,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-14 17:08:15,723 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2018-11-14 17:08:15,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:15,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:08:15,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 120 transitions. [2018-11-14 17:08:15,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:08:15,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 120 transitions. [2018-11-14 17:08:15,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 120 transitions. [2018-11-14 17:08:15,865 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:08:15,868 INFO L225 Difference]: With dead ends: 180 [2018-11-14 17:08:15,868 INFO L226 Difference]: Without dead ends: 126 [2018-11-14 17:08:15,868 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 17:08:15,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-14 17:08:15,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-11-14 17:08:15,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:15,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 125 states. [2018-11-14 17:08:15,943 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 125 states. [2018-11-14 17:08:15,943 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 125 states. [2018-11-14 17:08:15,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:15,945 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-14 17:08:15,945 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-14 17:08:15,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:15,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:15,946 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 126 states. [2018-11-14 17:08:15,946 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 126 states. [2018-11-14 17:08:15,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:15,949 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-14 17:08:15,949 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-14 17:08:15,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:15,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:15,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:15,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:15,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-14 17:08:15,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-11-14 17:08:15,952 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 175 [2018-11-14 17:08:15,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:15,952 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-11-14 17:08:15,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 17:08:15,952 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-14 17:08:15,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-14 17:08:15,953 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:15,953 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:08:15,954 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:15,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:15,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1950415411, now seen corresponding path program 21 times [2018-11-14 17:08:15,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:15,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:15,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:15,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:08:15,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:16,349 INFO L256 TraceCheckUtils]: 0: Hoare triple {16639#true} call ULTIMATE.init(); {16639#true} is VALID [2018-11-14 17:08:16,350 INFO L273 TraceCheckUtils]: 1: Hoare triple {16639#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16639#true} is VALID [2018-11-14 17:08:16,350 INFO L273 TraceCheckUtils]: 2: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,350 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16639#true} {16639#true} #69#return; {16639#true} is VALID [2018-11-14 17:08:16,350 INFO L256 TraceCheckUtils]: 4: Hoare triple {16639#true} call #t~ret13 := main(); {16639#true} is VALID [2018-11-14 17:08:16,351 INFO L273 TraceCheckUtils]: 5: Hoare triple {16639#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; {16641#(= main_~i~1 0)} is VALID [2018-11-14 17:08:16,351 INFO L273 TraceCheckUtils]: 6: Hoare triple {16641#(= main_~i~1 0)} assume true; {16641#(= main_~i~1 0)} is VALID [2018-11-14 17:08:16,352 INFO L273 TraceCheckUtils]: 7: Hoare triple {16641#(= 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; {16641#(= main_~i~1 0)} is VALID [2018-11-14 17:08:16,352 INFO L273 TraceCheckUtils]: 8: Hoare triple {16641#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16642#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:16,352 INFO L273 TraceCheckUtils]: 9: Hoare triple {16642#(<= main_~i~1 1)} assume true; {16642#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:16,353 INFO L273 TraceCheckUtils]: 10: Hoare triple {16642#(<= 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; {16642#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:16,353 INFO L273 TraceCheckUtils]: 11: Hoare triple {16642#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16643#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:16,353 INFO L273 TraceCheckUtils]: 12: Hoare triple {16643#(<= main_~i~1 2)} assume true; {16643#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:16,354 INFO L273 TraceCheckUtils]: 13: Hoare triple {16643#(<= 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; {16643#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:16,354 INFO L273 TraceCheckUtils]: 14: Hoare triple {16643#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16644#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:16,355 INFO L273 TraceCheckUtils]: 15: Hoare triple {16644#(<= main_~i~1 3)} assume true; {16644#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:16,355 INFO L273 TraceCheckUtils]: 16: Hoare triple {16644#(<= 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; {16644#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:16,356 INFO L273 TraceCheckUtils]: 17: Hoare triple {16644#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16645#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:16,356 INFO L273 TraceCheckUtils]: 18: Hoare triple {16645#(<= main_~i~1 4)} assume true; {16645#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:16,357 INFO L273 TraceCheckUtils]: 19: Hoare triple {16645#(<= 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; {16645#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:16,357 INFO L273 TraceCheckUtils]: 20: Hoare triple {16645#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16646#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:16,358 INFO L273 TraceCheckUtils]: 21: Hoare triple {16646#(<= main_~i~1 5)} assume true; {16646#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:16,358 INFO L273 TraceCheckUtils]: 22: Hoare triple {16646#(<= 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; {16646#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:16,359 INFO L273 TraceCheckUtils]: 23: Hoare triple {16646#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16647#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:16,359 INFO L273 TraceCheckUtils]: 24: Hoare triple {16647#(<= main_~i~1 6)} assume true; {16647#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:16,360 INFO L273 TraceCheckUtils]: 25: Hoare triple {16647#(<= 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; {16647#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:16,361 INFO L273 TraceCheckUtils]: 26: Hoare triple {16647#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16648#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:16,361 INFO L273 TraceCheckUtils]: 27: Hoare triple {16648#(<= main_~i~1 7)} assume true; {16648#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:16,362 INFO L273 TraceCheckUtils]: 28: Hoare triple {16648#(<= 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; {16648#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:16,362 INFO L273 TraceCheckUtils]: 29: Hoare triple {16648#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16649#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:16,363 INFO L273 TraceCheckUtils]: 30: Hoare triple {16649#(<= main_~i~1 8)} assume true; {16649#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:16,363 INFO L273 TraceCheckUtils]: 31: Hoare triple {16649#(<= 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; {16649#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:16,364 INFO L273 TraceCheckUtils]: 32: Hoare triple {16649#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16650#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:16,364 INFO L273 TraceCheckUtils]: 33: Hoare triple {16650#(<= main_~i~1 9)} assume true; {16650#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:16,365 INFO L273 TraceCheckUtils]: 34: Hoare triple {16650#(<= 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; {16650#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:16,365 INFO L273 TraceCheckUtils]: 35: Hoare triple {16650#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16651#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:16,366 INFO L273 TraceCheckUtils]: 36: Hoare triple {16651#(<= main_~i~1 10)} assume true; {16651#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:16,366 INFO L273 TraceCheckUtils]: 37: Hoare triple {16651#(<= 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; {16651#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:16,367 INFO L273 TraceCheckUtils]: 38: Hoare triple {16651#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16652#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:16,368 INFO L273 TraceCheckUtils]: 39: Hoare triple {16652#(<= main_~i~1 11)} assume true; {16652#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:16,368 INFO L273 TraceCheckUtils]: 40: Hoare triple {16652#(<= 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; {16652#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:16,369 INFO L273 TraceCheckUtils]: 41: Hoare triple {16652#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16653#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:16,369 INFO L273 TraceCheckUtils]: 42: Hoare triple {16653#(<= main_~i~1 12)} assume true; {16653#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:16,370 INFO L273 TraceCheckUtils]: 43: Hoare triple {16653#(<= 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; {16653#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:16,370 INFO L273 TraceCheckUtils]: 44: Hoare triple {16653#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16654#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:16,371 INFO L273 TraceCheckUtils]: 45: Hoare triple {16654#(<= main_~i~1 13)} assume true; {16654#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:16,371 INFO L273 TraceCheckUtils]: 46: Hoare triple {16654#(<= 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; {16654#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:16,372 INFO L273 TraceCheckUtils]: 47: Hoare triple {16654#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16655#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:16,372 INFO L273 TraceCheckUtils]: 48: Hoare triple {16655#(<= main_~i~1 14)} assume true; {16655#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:16,373 INFO L273 TraceCheckUtils]: 49: Hoare triple {16655#(<= 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; {16655#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:16,374 INFO L273 TraceCheckUtils]: 50: Hoare triple {16655#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16656#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:16,374 INFO L273 TraceCheckUtils]: 51: Hoare triple {16656#(<= main_~i~1 15)} assume true; {16656#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:16,375 INFO L273 TraceCheckUtils]: 52: Hoare triple {16656#(<= 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; {16656#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:16,375 INFO L273 TraceCheckUtils]: 53: Hoare triple {16656#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16657#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:16,376 INFO L273 TraceCheckUtils]: 54: Hoare triple {16657#(<= main_~i~1 16)} assume true; {16657#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:16,376 INFO L273 TraceCheckUtils]: 55: Hoare triple {16657#(<= 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; {16657#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:16,377 INFO L273 TraceCheckUtils]: 56: Hoare triple {16657#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16658#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:16,377 INFO L273 TraceCheckUtils]: 57: Hoare triple {16658#(<= main_~i~1 17)} assume true; {16658#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:16,378 INFO L273 TraceCheckUtils]: 58: Hoare triple {16658#(<= 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; {16658#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:16,379 INFO L273 TraceCheckUtils]: 59: Hoare triple {16658#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16659#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:16,379 INFO L273 TraceCheckUtils]: 60: Hoare triple {16659#(<= main_~i~1 18)} assume true; {16659#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:16,380 INFO L273 TraceCheckUtils]: 61: Hoare triple {16659#(<= 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; {16659#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:16,380 INFO L273 TraceCheckUtils]: 62: Hoare triple {16659#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16660#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:16,381 INFO L273 TraceCheckUtils]: 63: Hoare triple {16660#(<= main_~i~1 19)} assume true; {16660#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:16,381 INFO L273 TraceCheckUtils]: 64: Hoare triple {16660#(<= 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; {16660#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:16,382 INFO L273 TraceCheckUtils]: 65: Hoare triple {16660#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16661#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:16,382 INFO L273 TraceCheckUtils]: 66: Hoare triple {16661#(<= main_~i~1 20)} assume true; {16661#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:16,383 INFO L273 TraceCheckUtils]: 67: Hoare triple {16661#(<= 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; {16661#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:16,384 INFO L273 TraceCheckUtils]: 68: Hoare triple {16661#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16662#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:16,384 INFO L273 TraceCheckUtils]: 69: Hoare triple {16662#(<= main_~i~1 21)} assume true; {16662#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:16,385 INFO L273 TraceCheckUtils]: 70: Hoare triple {16662#(<= main_~i~1 21)} assume !(~i~1 < 10000); {16640#false} is VALID [2018-11-14 17:08:16,385 INFO L256 TraceCheckUtils]: 71: Hoare triple {16640#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {16639#true} is VALID [2018-11-14 17:08:16,385 INFO L273 TraceCheckUtils]: 72: Hoare triple {16639#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; {16639#true} is VALID [2018-11-14 17:08:16,385 INFO L273 TraceCheckUtils]: 73: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,385 INFO L273 TraceCheckUtils]: 74: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,386 INFO L273 TraceCheckUtils]: 75: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,386 INFO L273 TraceCheckUtils]: 76: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,386 INFO L273 TraceCheckUtils]: 77: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,386 INFO L273 TraceCheckUtils]: 78: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,386 INFO L273 TraceCheckUtils]: 79: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,386 INFO L273 TraceCheckUtils]: 80: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,387 INFO L273 TraceCheckUtils]: 81: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,387 INFO L273 TraceCheckUtils]: 82: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,387 INFO L273 TraceCheckUtils]: 83: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,387 INFO L273 TraceCheckUtils]: 84: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,387 INFO L273 TraceCheckUtils]: 85: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,387 INFO L273 TraceCheckUtils]: 86: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,387 INFO L273 TraceCheckUtils]: 87: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,388 INFO L273 TraceCheckUtils]: 88: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,388 INFO L273 TraceCheckUtils]: 89: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,388 INFO L273 TraceCheckUtils]: 90: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,388 INFO L273 TraceCheckUtils]: 91: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,388 INFO L273 TraceCheckUtils]: 92: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,388 INFO L273 TraceCheckUtils]: 93: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,388 INFO L273 TraceCheckUtils]: 94: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,388 INFO L273 TraceCheckUtils]: 95: Hoare triple {16639#true} assume !(~i~0 < 10000); {16639#true} is VALID [2018-11-14 17:08:16,388 INFO L273 TraceCheckUtils]: 96: Hoare triple {16639#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16639#true} is VALID [2018-11-14 17:08:16,389 INFO L273 TraceCheckUtils]: 97: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,389 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {16639#true} {16640#false} #73#return; {16640#false} is VALID [2018-11-14 17:08:16,389 INFO L273 TraceCheckUtils]: 99: Hoare triple {16640#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); {16640#false} is VALID [2018-11-14 17:08:16,389 INFO L256 TraceCheckUtils]: 100: Hoare triple {16640#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {16639#true} is VALID [2018-11-14 17:08:16,389 INFO L273 TraceCheckUtils]: 101: Hoare triple {16639#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; {16639#true} is VALID [2018-11-14 17:08:16,389 INFO L273 TraceCheckUtils]: 102: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,389 INFO L273 TraceCheckUtils]: 103: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,389 INFO L273 TraceCheckUtils]: 104: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,389 INFO L273 TraceCheckUtils]: 105: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,389 INFO L273 TraceCheckUtils]: 106: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,390 INFO L273 TraceCheckUtils]: 107: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,390 INFO L273 TraceCheckUtils]: 108: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,390 INFO L273 TraceCheckUtils]: 109: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,390 INFO L273 TraceCheckUtils]: 110: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,390 INFO L273 TraceCheckUtils]: 111: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,390 INFO L273 TraceCheckUtils]: 112: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,390 INFO L273 TraceCheckUtils]: 113: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,390 INFO L273 TraceCheckUtils]: 114: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,390 INFO L273 TraceCheckUtils]: 115: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,391 INFO L273 TraceCheckUtils]: 116: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,391 INFO L273 TraceCheckUtils]: 117: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,391 INFO L273 TraceCheckUtils]: 118: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,391 INFO L273 TraceCheckUtils]: 119: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,391 INFO L273 TraceCheckUtils]: 120: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,391 INFO L273 TraceCheckUtils]: 121: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,391 INFO L273 TraceCheckUtils]: 122: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,391 INFO L273 TraceCheckUtils]: 123: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,391 INFO L273 TraceCheckUtils]: 124: Hoare triple {16639#true} assume !(~i~0 < 10000); {16639#true} is VALID [2018-11-14 17:08:16,391 INFO L273 TraceCheckUtils]: 125: Hoare triple {16639#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16639#true} is VALID [2018-11-14 17:08:16,392 INFO L273 TraceCheckUtils]: 126: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,392 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {16639#true} {16640#false} #75#return; {16640#false} is VALID [2018-11-14 17:08:16,392 INFO L273 TraceCheckUtils]: 128: Hoare triple {16640#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; {16640#false} is VALID [2018-11-14 17:08:16,392 INFO L273 TraceCheckUtils]: 129: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:08:16,392 INFO L273 TraceCheckUtils]: 130: Hoare triple {16640#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {16640#false} is VALID [2018-11-14 17:08:16,392 INFO L273 TraceCheckUtils]: 131: Hoare triple {16640#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {16640#false} is VALID [2018-11-14 17:08:16,392 INFO L273 TraceCheckUtils]: 132: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:08:16,392 INFO L273 TraceCheckUtils]: 133: Hoare triple {16640#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {16640#false} is VALID [2018-11-14 17:08:16,392 INFO L273 TraceCheckUtils]: 134: Hoare triple {16640#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {16640#false} is VALID [2018-11-14 17:08:16,393 INFO L273 TraceCheckUtils]: 135: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:08:16,393 INFO L273 TraceCheckUtils]: 136: Hoare triple {16640#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {16640#false} is VALID [2018-11-14 17:08:16,393 INFO L273 TraceCheckUtils]: 137: Hoare triple {16640#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {16640#false} is VALID [2018-11-14 17:08:16,393 INFO L273 TraceCheckUtils]: 138: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:08:16,393 INFO L273 TraceCheckUtils]: 139: Hoare triple {16640#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {16640#false} is VALID [2018-11-14 17:08:16,393 INFO L273 TraceCheckUtils]: 140: Hoare triple {16640#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {16640#false} is VALID [2018-11-14 17:08:16,393 INFO L273 TraceCheckUtils]: 141: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:08:16,393 INFO L273 TraceCheckUtils]: 142: Hoare triple {16640#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {16640#false} is VALID [2018-11-14 17:08:16,393 INFO L273 TraceCheckUtils]: 143: Hoare triple {16640#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {16640#false} is VALID [2018-11-14 17:08:16,394 INFO L273 TraceCheckUtils]: 144: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:08:16,394 INFO L273 TraceCheckUtils]: 145: Hoare triple {16640#false} assume !(~i~2 < 9999); {16640#false} is VALID [2018-11-14 17:08:16,394 INFO L273 TraceCheckUtils]: 146: Hoare triple {16640#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {16640#false} is VALID [2018-11-14 17:08:16,394 INFO L256 TraceCheckUtils]: 147: Hoare triple {16640#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {16639#true} is VALID [2018-11-14 17:08:16,394 INFO L273 TraceCheckUtils]: 148: Hoare triple {16639#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; {16639#true} is VALID [2018-11-14 17:08:16,394 INFO L273 TraceCheckUtils]: 149: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,395 INFO L273 TraceCheckUtils]: 150: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,395 INFO L273 TraceCheckUtils]: 151: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,395 INFO L273 TraceCheckUtils]: 152: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,395 INFO L273 TraceCheckUtils]: 153: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,395 INFO L273 TraceCheckUtils]: 154: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,395 INFO L273 TraceCheckUtils]: 155: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,396 INFO L273 TraceCheckUtils]: 156: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,396 INFO L273 TraceCheckUtils]: 157: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,396 INFO L273 TraceCheckUtils]: 158: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,396 INFO L273 TraceCheckUtils]: 159: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,396 INFO L273 TraceCheckUtils]: 160: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,396 INFO L273 TraceCheckUtils]: 161: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,397 INFO L273 TraceCheckUtils]: 162: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,397 INFO L273 TraceCheckUtils]: 163: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,397 INFO L273 TraceCheckUtils]: 164: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,397 INFO L273 TraceCheckUtils]: 165: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,397 INFO L273 TraceCheckUtils]: 166: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,397 INFO L273 TraceCheckUtils]: 167: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,398 INFO L273 TraceCheckUtils]: 168: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,398 INFO L273 TraceCheckUtils]: 169: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,398 INFO L273 TraceCheckUtils]: 170: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,398 INFO L273 TraceCheckUtils]: 171: Hoare triple {16639#true} assume !(~i~0 < 10000); {16639#true} is VALID [2018-11-14 17:08:16,398 INFO L273 TraceCheckUtils]: 172: Hoare triple {16639#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16639#true} is VALID [2018-11-14 17:08:16,398 INFO L273 TraceCheckUtils]: 173: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,398 INFO L268 TraceCheckUtils]: 174: Hoare quadruple {16639#true} {16640#false} #77#return; {16640#false} is VALID [2018-11-14 17:08:16,399 INFO L273 TraceCheckUtils]: 175: Hoare triple {16640#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {16640#false} is VALID [2018-11-14 17:08:16,399 INFO L273 TraceCheckUtils]: 176: Hoare triple {16640#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {16640#false} is VALID [2018-11-14 17:08:16,399 INFO L273 TraceCheckUtils]: 177: Hoare triple {16640#false} assume !false; {16640#false} is VALID [2018-11-14 17:08:16,418 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:08:16,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:16,418 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:08:16,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:08:16,541 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-14 17:08:16,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:08:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:16,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:16,792 INFO L256 TraceCheckUtils]: 0: Hoare triple {16639#true} call ULTIMATE.init(); {16639#true} is VALID [2018-11-14 17:08:16,793 INFO L273 TraceCheckUtils]: 1: Hoare triple {16639#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16639#true} is VALID [2018-11-14 17:08:16,793 INFO L273 TraceCheckUtils]: 2: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,793 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16639#true} {16639#true} #69#return; {16639#true} is VALID [2018-11-14 17:08:16,793 INFO L256 TraceCheckUtils]: 4: Hoare triple {16639#true} call #t~ret13 := main(); {16639#true} is VALID [2018-11-14 17:08:16,793 INFO L273 TraceCheckUtils]: 5: Hoare triple {16639#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; {16639#true} is VALID [2018-11-14 17:08:16,794 INFO L273 TraceCheckUtils]: 6: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,794 INFO L273 TraceCheckUtils]: 7: Hoare triple {16639#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:08:16,794 INFO L273 TraceCheckUtils]: 8: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:08:16,794 INFO L273 TraceCheckUtils]: 9: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,794 INFO L273 TraceCheckUtils]: 10: Hoare triple {16639#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:08:16,795 INFO L273 TraceCheckUtils]: 11: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:08:16,795 INFO L273 TraceCheckUtils]: 12: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,795 INFO L273 TraceCheckUtils]: 13: Hoare triple {16639#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:08:16,795 INFO L273 TraceCheckUtils]: 14: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:08:16,795 INFO L273 TraceCheckUtils]: 15: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,795 INFO L273 TraceCheckUtils]: 16: Hoare triple {16639#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:08:16,795 INFO L273 TraceCheckUtils]: 17: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:08:16,795 INFO L273 TraceCheckUtils]: 18: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,796 INFO L273 TraceCheckUtils]: 19: Hoare triple {16639#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:08:16,796 INFO L273 TraceCheckUtils]: 20: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:08:16,796 INFO L273 TraceCheckUtils]: 21: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,796 INFO L273 TraceCheckUtils]: 22: Hoare triple {16639#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:08:16,796 INFO L273 TraceCheckUtils]: 23: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:08:16,796 INFO L273 TraceCheckUtils]: 24: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,796 INFO L273 TraceCheckUtils]: 25: Hoare triple {16639#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:08:16,796 INFO L273 TraceCheckUtils]: 26: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:08:16,796 INFO L273 TraceCheckUtils]: 27: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,796 INFO L273 TraceCheckUtils]: 28: Hoare triple {16639#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:08:16,797 INFO L273 TraceCheckUtils]: 29: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:08:16,797 INFO L273 TraceCheckUtils]: 30: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,797 INFO L273 TraceCheckUtils]: 31: Hoare triple {16639#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:08:16,797 INFO L273 TraceCheckUtils]: 32: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:08:16,797 INFO L273 TraceCheckUtils]: 33: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,797 INFO L273 TraceCheckUtils]: 34: Hoare triple {16639#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:08:16,797 INFO L273 TraceCheckUtils]: 35: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:08:16,797 INFO L273 TraceCheckUtils]: 36: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,797 INFO L273 TraceCheckUtils]: 37: Hoare triple {16639#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:08:16,798 INFO L273 TraceCheckUtils]: 38: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:08:16,798 INFO L273 TraceCheckUtils]: 39: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,798 INFO L273 TraceCheckUtils]: 40: Hoare triple {16639#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:08:16,798 INFO L273 TraceCheckUtils]: 41: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:08:16,798 INFO L273 TraceCheckUtils]: 42: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,798 INFO L273 TraceCheckUtils]: 43: Hoare triple {16639#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:08:16,798 INFO L273 TraceCheckUtils]: 44: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:08:16,798 INFO L273 TraceCheckUtils]: 45: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,798 INFO L273 TraceCheckUtils]: 46: Hoare triple {16639#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:08:16,798 INFO L273 TraceCheckUtils]: 47: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:08:16,799 INFO L273 TraceCheckUtils]: 48: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,799 INFO L273 TraceCheckUtils]: 49: Hoare triple {16639#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:08:16,799 INFO L273 TraceCheckUtils]: 50: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:08:16,799 INFO L273 TraceCheckUtils]: 51: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,799 INFO L273 TraceCheckUtils]: 52: Hoare triple {16639#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:08:16,799 INFO L273 TraceCheckUtils]: 53: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:08:16,799 INFO L273 TraceCheckUtils]: 54: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,799 INFO L273 TraceCheckUtils]: 55: Hoare triple {16639#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:08:16,799 INFO L273 TraceCheckUtils]: 56: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:08:16,800 INFO L273 TraceCheckUtils]: 57: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,800 INFO L273 TraceCheckUtils]: 58: Hoare triple {16639#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:08:16,800 INFO L273 TraceCheckUtils]: 59: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:08:16,800 INFO L273 TraceCheckUtils]: 60: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,800 INFO L273 TraceCheckUtils]: 61: Hoare triple {16639#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:08:16,800 INFO L273 TraceCheckUtils]: 62: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:08:16,800 INFO L273 TraceCheckUtils]: 63: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,800 INFO L273 TraceCheckUtils]: 64: Hoare triple {16639#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:08:16,800 INFO L273 TraceCheckUtils]: 65: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:08:16,800 INFO L273 TraceCheckUtils]: 66: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,801 INFO L273 TraceCheckUtils]: 67: Hoare triple {16639#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:08:16,801 INFO L273 TraceCheckUtils]: 68: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:08:16,801 INFO L273 TraceCheckUtils]: 69: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,801 INFO L273 TraceCheckUtils]: 70: Hoare triple {16639#true} assume !(~i~1 < 10000); {16639#true} is VALID [2018-11-14 17:08:16,801 INFO L256 TraceCheckUtils]: 71: Hoare triple {16639#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {16639#true} is VALID [2018-11-14 17:08:16,801 INFO L273 TraceCheckUtils]: 72: Hoare triple {16639#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; {16639#true} is VALID [2018-11-14 17:08:16,801 INFO L273 TraceCheckUtils]: 73: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,801 INFO L273 TraceCheckUtils]: 74: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,801 INFO L273 TraceCheckUtils]: 75: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,802 INFO L273 TraceCheckUtils]: 76: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,802 INFO L273 TraceCheckUtils]: 77: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,802 INFO L273 TraceCheckUtils]: 78: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,802 INFO L273 TraceCheckUtils]: 79: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,802 INFO L273 TraceCheckUtils]: 80: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,802 INFO L273 TraceCheckUtils]: 81: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,802 INFO L273 TraceCheckUtils]: 82: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,802 INFO L273 TraceCheckUtils]: 83: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,802 INFO L273 TraceCheckUtils]: 84: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,802 INFO L273 TraceCheckUtils]: 85: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,803 INFO L273 TraceCheckUtils]: 86: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,803 INFO L273 TraceCheckUtils]: 87: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,803 INFO L273 TraceCheckUtils]: 88: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,803 INFO L273 TraceCheckUtils]: 89: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,803 INFO L273 TraceCheckUtils]: 90: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,803 INFO L273 TraceCheckUtils]: 91: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,803 INFO L273 TraceCheckUtils]: 92: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,803 INFO L273 TraceCheckUtils]: 93: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,803 INFO L273 TraceCheckUtils]: 94: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,803 INFO L273 TraceCheckUtils]: 95: Hoare triple {16639#true} assume !(~i~0 < 10000); {16639#true} is VALID [2018-11-14 17:08:16,804 INFO L273 TraceCheckUtils]: 96: Hoare triple {16639#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16639#true} is VALID [2018-11-14 17:08:16,804 INFO L273 TraceCheckUtils]: 97: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,804 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {16639#true} {16639#true} #73#return; {16639#true} is VALID [2018-11-14 17:08:16,804 INFO L273 TraceCheckUtils]: 99: Hoare triple {16639#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); {16639#true} is VALID [2018-11-14 17:08:16,804 INFO L256 TraceCheckUtils]: 100: Hoare triple {16639#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {16639#true} is VALID [2018-11-14 17:08:16,804 INFO L273 TraceCheckUtils]: 101: Hoare triple {16639#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; {16639#true} is VALID [2018-11-14 17:08:16,804 INFO L273 TraceCheckUtils]: 102: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,804 INFO L273 TraceCheckUtils]: 103: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,804 INFO L273 TraceCheckUtils]: 104: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,805 INFO L273 TraceCheckUtils]: 105: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,805 INFO L273 TraceCheckUtils]: 106: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,805 INFO L273 TraceCheckUtils]: 107: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,805 INFO L273 TraceCheckUtils]: 108: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,805 INFO L273 TraceCheckUtils]: 109: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,805 INFO L273 TraceCheckUtils]: 110: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,805 INFO L273 TraceCheckUtils]: 111: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,805 INFO L273 TraceCheckUtils]: 112: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,805 INFO L273 TraceCheckUtils]: 113: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,805 INFO L273 TraceCheckUtils]: 114: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,806 INFO L273 TraceCheckUtils]: 115: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,806 INFO L273 TraceCheckUtils]: 116: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,806 INFO L273 TraceCheckUtils]: 117: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,806 INFO L273 TraceCheckUtils]: 118: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,806 INFO L273 TraceCheckUtils]: 119: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,806 INFO L273 TraceCheckUtils]: 120: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,806 INFO L273 TraceCheckUtils]: 121: Hoare triple {16639#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:08:16,806 INFO L273 TraceCheckUtils]: 122: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:08:16,806 INFO L273 TraceCheckUtils]: 123: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,806 INFO L273 TraceCheckUtils]: 124: Hoare triple {16639#true} assume !(~i~0 < 10000); {16639#true} is VALID [2018-11-14 17:08:16,807 INFO L273 TraceCheckUtils]: 125: Hoare triple {16639#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16639#true} is VALID [2018-11-14 17:08:16,807 INFO L273 TraceCheckUtils]: 126: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:08:16,807 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {16639#true} {16639#true} #75#return; {16639#true} is VALID [2018-11-14 17:08:16,807 INFO L273 TraceCheckUtils]: 128: Hoare triple {16639#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; {17050#(<= main_~i~2 0)} is VALID [2018-11-14 17:08:16,808 INFO L273 TraceCheckUtils]: 129: Hoare triple {17050#(<= main_~i~2 0)} assume true; {17050#(<= main_~i~2 0)} is VALID [2018-11-14 17:08:16,808 INFO L273 TraceCheckUtils]: 130: Hoare triple {17050#(<= 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; {17050#(<= main_~i~2 0)} is VALID [2018-11-14 17:08:16,808 INFO L273 TraceCheckUtils]: 131: Hoare triple {17050#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17060#(<= main_~i~2 1)} is VALID [2018-11-14 17:08:16,809 INFO L273 TraceCheckUtils]: 132: Hoare triple {17060#(<= main_~i~2 1)} assume true; {17060#(<= main_~i~2 1)} is VALID [2018-11-14 17:08:16,809 INFO L273 TraceCheckUtils]: 133: Hoare triple {17060#(<= 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; {17060#(<= main_~i~2 1)} is VALID [2018-11-14 17:08:16,809 INFO L273 TraceCheckUtils]: 134: Hoare triple {17060#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17070#(<= main_~i~2 2)} is VALID [2018-11-14 17:08:16,810 INFO L273 TraceCheckUtils]: 135: Hoare triple {17070#(<= main_~i~2 2)} assume true; {17070#(<= main_~i~2 2)} is VALID [2018-11-14 17:08:16,810 INFO L273 TraceCheckUtils]: 136: Hoare triple {17070#(<= 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; {17070#(<= main_~i~2 2)} is VALID [2018-11-14 17:08:16,811 INFO L273 TraceCheckUtils]: 137: Hoare triple {17070#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17080#(<= main_~i~2 3)} is VALID [2018-11-14 17:08:16,811 INFO L273 TraceCheckUtils]: 138: Hoare triple {17080#(<= main_~i~2 3)} assume true; {17080#(<= main_~i~2 3)} is VALID [2018-11-14 17:08:16,812 INFO L273 TraceCheckUtils]: 139: Hoare triple {17080#(<= 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; {17080#(<= main_~i~2 3)} is VALID [2018-11-14 17:08:16,813 INFO L273 TraceCheckUtils]: 140: Hoare triple {17080#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17090#(<= main_~i~2 4)} is VALID [2018-11-14 17:08:16,813 INFO L273 TraceCheckUtils]: 141: Hoare triple {17090#(<= main_~i~2 4)} assume true; {17090#(<= main_~i~2 4)} is VALID [2018-11-14 17:08:16,814 INFO L273 TraceCheckUtils]: 142: Hoare triple {17090#(<= 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; {17090#(<= main_~i~2 4)} is VALID [2018-11-14 17:08:16,814 INFO L273 TraceCheckUtils]: 143: Hoare triple {17090#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17100#(<= main_~i~2 5)} is VALID [2018-11-14 17:08:16,815 INFO L273 TraceCheckUtils]: 144: Hoare triple {17100#(<= main_~i~2 5)} assume true; {17100#(<= main_~i~2 5)} is VALID [2018-11-14 17:08:16,816 INFO L273 TraceCheckUtils]: 145: Hoare triple {17100#(<= main_~i~2 5)} assume !(~i~2 < 9999); {16640#false} is VALID [2018-11-14 17:08:16,816 INFO L273 TraceCheckUtils]: 146: Hoare triple {16640#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {16640#false} is VALID [2018-11-14 17:08:16,816 INFO L256 TraceCheckUtils]: 147: Hoare triple {16640#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {16640#false} is VALID [2018-11-14 17:08:16,816 INFO L273 TraceCheckUtils]: 148: Hoare triple {16640#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; {16640#false} is VALID [2018-11-14 17:08:16,816 INFO L273 TraceCheckUtils]: 149: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:08:16,817 INFO L273 TraceCheckUtils]: 150: Hoare triple {16640#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16640#false} is VALID [2018-11-14 17:08:16,817 INFO L273 TraceCheckUtils]: 151: Hoare triple {16640#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16640#false} is VALID [2018-11-14 17:08:16,817 INFO L273 TraceCheckUtils]: 152: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:08:16,817 INFO L273 TraceCheckUtils]: 153: Hoare triple {16640#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16640#false} is VALID [2018-11-14 17:08:16,817 INFO L273 TraceCheckUtils]: 154: Hoare triple {16640#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16640#false} is VALID [2018-11-14 17:08:16,817 INFO L273 TraceCheckUtils]: 155: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:08:16,818 INFO L273 TraceCheckUtils]: 156: Hoare triple {16640#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16640#false} is VALID [2018-11-14 17:08:16,818 INFO L273 TraceCheckUtils]: 157: Hoare triple {16640#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16640#false} is VALID [2018-11-14 17:08:16,818 INFO L273 TraceCheckUtils]: 158: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:08:16,818 INFO L273 TraceCheckUtils]: 159: Hoare triple {16640#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16640#false} is VALID [2018-11-14 17:08:16,818 INFO L273 TraceCheckUtils]: 160: Hoare triple {16640#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16640#false} is VALID [2018-11-14 17:08:16,819 INFO L273 TraceCheckUtils]: 161: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:08:16,819 INFO L273 TraceCheckUtils]: 162: Hoare triple {16640#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16640#false} is VALID [2018-11-14 17:08:16,819 INFO L273 TraceCheckUtils]: 163: Hoare triple {16640#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16640#false} is VALID [2018-11-14 17:08:16,819 INFO L273 TraceCheckUtils]: 164: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:08:16,819 INFO L273 TraceCheckUtils]: 165: Hoare triple {16640#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16640#false} is VALID [2018-11-14 17:08:16,819 INFO L273 TraceCheckUtils]: 166: Hoare triple {16640#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16640#false} is VALID [2018-11-14 17:08:16,819 INFO L273 TraceCheckUtils]: 167: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:08:16,819 INFO L273 TraceCheckUtils]: 168: Hoare triple {16640#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16640#false} is VALID [2018-11-14 17:08:16,819 INFO L273 TraceCheckUtils]: 169: Hoare triple {16640#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16640#false} is VALID [2018-11-14 17:08:16,820 INFO L273 TraceCheckUtils]: 170: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:08:16,820 INFO L273 TraceCheckUtils]: 171: Hoare triple {16640#false} assume !(~i~0 < 10000); {16640#false} is VALID [2018-11-14 17:08:16,820 INFO L273 TraceCheckUtils]: 172: Hoare triple {16640#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16640#false} is VALID [2018-11-14 17:08:16,820 INFO L273 TraceCheckUtils]: 173: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:08:16,820 INFO L268 TraceCheckUtils]: 174: Hoare quadruple {16640#false} {16640#false} #77#return; {16640#false} is VALID [2018-11-14 17:08:16,820 INFO L273 TraceCheckUtils]: 175: Hoare triple {16640#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {16640#false} is VALID [2018-11-14 17:08:16,820 INFO L273 TraceCheckUtils]: 176: Hoare triple {16640#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {16640#false} is VALID [2018-11-14 17:08:16,820 INFO L273 TraceCheckUtils]: 177: Hoare triple {16640#false} assume !false; {16640#false} is VALID [2018-11-14 17:08:16,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1486 backedges. 362 proven. 40 refuted. 0 times theorem prover too weak. 1084 trivial. 0 not checked. [2018-11-14 17:08:16,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:16,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 30 [2018-11-14 17:08:16,854 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 178 [2018-11-14 17:08:16,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:16,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-14 17:08:16,978 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:16,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-14 17:08:16,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-14 17:08:16,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2018-11-14 17:08:16,980 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 30 states. [2018-11-14 17:08:18,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:18,685 INFO L93 Difference]: Finished difference Result 187 states and 196 transitions. [2018-11-14 17:08:18,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-14 17:08:18,685 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 178 [2018-11-14 17:08:18,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:18,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 17:08:18,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 142 transitions. [2018-11-14 17:08:18,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 17:08:18,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 142 transitions. [2018-11-14 17:08:18,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 142 transitions. [2018-11-14 17:08:18,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:18,820 INFO L225 Difference]: With dead ends: 187 [2018-11-14 17:08:18,820 INFO L226 Difference]: Without dead ends: 133 [2018-11-14 17:08:18,821 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2018-11-14 17:08:18,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-14 17:08:18,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-11-14 17:08:18,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:18,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 131 states. [2018-11-14 17:08:18,866 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 131 states. [2018-11-14 17:08:18,866 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 131 states. [2018-11-14 17:08:18,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:18,869 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-11-14 17:08:18,869 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-14 17:08:18,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:18,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:18,869 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 133 states. [2018-11-14 17:08:18,869 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 133 states. [2018-11-14 17:08:18,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:18,871 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-11-14 17:08:18,871 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-14 17:08:18,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:18,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:18,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:18,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:18,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-14 17:08:18,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2018-11-14 17:08:18,873 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 178 [2018-11-14 17:08:18,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:18,874 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2018-11-14 17:08:18,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-14 17:08:18,874 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2018-11-14 17:08:18,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-14 17:08:18,875 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:18,875 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 22, 22, 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:08:18,875 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:18,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:18,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1792938277, now seen corresponding path program 22 times [2018-11-14 17:08:18,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:18,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:18,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:18,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:08:18,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:19,352 INFO L256 TraceCheckUtils]: 0: Hoare triple {17896#true} call ULTIMATE.init(); {17896#true} is VALID [2018-11-14 17:08:19,352 INFO L273 TraceCheckUtils]: 1: Hoare triple {17896#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17896#true} is VALID [2018-11-14 17:08:19,352 INFO L273 TraceCheckUtils]: 2: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,352 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17896#true} {17896#true} #69#return; {17896#true} is VALID [2018-11-14 17:08:19,353 INFO L256 TraceCheckUtils]: 4: Hoare triple {17896#true} call #t~ret13 := main(); {17896#true} is VALID [2018-11-14 17:08:19,353 INFO L273 TraceCheckUtils]: 5: Hoare triple {17896#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; {17898#(= main_~i~1 0)} is VALID [2018-11-14 17:08:19,354 INFO L273 TraceCheckUtils]: 6: Hoare triple {17898#(= main_~i~1 0)} assume true; {17898#(= main_~i~1 0)} is VALID [2018-11-14 17:08:19,354 INFO L273 TraceCheckUtils]: 7: Hoare triple {17898#(= 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; {17898#(= main_~i~1 0)} is VALID [2018-11-14 17:08:19,355 INFO L273 TraceCheckUtils]: 8: Hoare triple {17898#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17899#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:19,355 INFO L273 TraceCheckUtils]: 9: Hoare triple {17899#(<= main_~i~1 1)} assume true; {17899#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:19,355 INFO L273 TraceCheckUtils]: 10: Hoare triple {17899#(<= 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; {17899#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:19,356 INFO L273 TraceCheckUtils]: 11: Hoare triple {17899#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17900#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:19,356 INFO L273 TraceCheckUtils]: 12: Hoare triple {17900#(<= main_~i~1 2)} assume true; {17900#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:19,356 INFO L273 TraceCheckUtils]: 13: Hoare triple {17900#(<= 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; {17900#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:19,357 INFO L273 TraceCheckUtils]: 14: Hoare triple {17900#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17901#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:19,357 INFO L273 TraceCheckUtils]: 15: Hoare triple {17901#(<= main_~i~1 3)} assume true; {17901#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:19,357 INFO L273 TraceCheckUtils]: 16: Hoare triple {17901#(<= 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; {17901#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:19,358 INFO L273 TraceCheckUtils]: 17: Hoare triple {17901#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17902#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:19,359 INFO L273 TraceCheckUtils]: 18: Hoare triple {17902#(<= main_~i~1 4)} assume true; {17902#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:19,359 INFO L273 TraceCheckUtils]: 19: Hoare triple {17902#(<= 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; {17902#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:19,360 INFO L273 TraceCheckUtils]: 20: Hoare triple {17902#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17903#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:19,360 INFO L273 TraceCheckUtils]: 21: Hoare triple {17903#(<= main_~i~1 5)} assume true; {17903#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:19,361 INFO L273 TraceCheckUtils]: 22: Hoare triple {17903#(<= 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; {17903#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:19,362 INFO L273 TraceCheckUtils]: 23: Hoare triple {17903#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17904#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:19,362 INFO L273 TraceCheckUtils]: 24: Hoare triple {17904#(<= main_~i~1 6)} assume true; {17904#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:19,363 INFO L273 TraceCheckUtils]: 25: Hoare triple {17904#(<= 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; {17904#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:19,363 INFO L273 TraceCheckUtils]: 26: Hoare triple {17904#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17905#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:19,364 INFO L273 TraceCheckUtils]: 27: Hoare triple {17905#(<= main_~i~1 7)} assume true; {17905#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:19,364 INFO L273 TraceCheckUtils]: 28: Hoare triple {17905#(<= 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; {17905#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:19,365 INFO L273 TraceCheckUtils]: 29: Hoare triple {17905#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17906#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:19,366 INFO L273 TraceCheckUtils]: 30: Hoare triple {17906#(<= main_~i~1 8)} assume true; {17906#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:19,366 INFO L273 TraceCheckUtils]: 31: Hoare triple {17906#(<= 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; {17906#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:19,367 INFO L273 TraceCheckUtils]: 32: Hoare triple {17906#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17907#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:19,367 INFO L273 TraceCheckUtils]: 33: Hoare triple {17907#(<= main_~i~1 9)} assume true; {17907#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:19,368 INFO L273 TraceCheckUtils]: 34: Hoare triple {17907#(<= 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; {17907#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:19,369 INFO L273 TraceCheckUtils]: 35: Hoare triple {17907#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17908#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:19,369 INFO L273 TraceCheckUtils]: 36: Hoare triple {17908#(<= main_~i~1 10)} assume true; {17908#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:19,370 INFO L273 TraceCheckUtils]: 37: Hoare triple {17908#(<= 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; {17908#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:19,370 INFO L273 TraceCheckUtils]: 38: Hoare triple {17908#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17909#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:19,371 INFO L273 TraceCheckUtils]: 39: Hoare triple {17909#(<= main_~i~1 11)} assume true; {17909#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:19,371 INFO L273 TraceCheckUtils]: 40: Hoare triple {17909#(<= 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; {17909#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:19,372 INFO L273 TraceCheckUtils]: 41: Hoare triple {17909#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17910#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:19,373 INFO L273 TraceCheckUtils]: 42: Hoare triple {17910#(<= main_~i~1 12)} assume true; {17910#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:19,373 INFO L273 TraceCheckUtils]: 43: Hoare triple {17910#(<= 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; {17910#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:19,374 INFO L273 TraceCheckUtils]: 44: Hoare triple {17910#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17911#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:19,374 INFO L273 TraceCheckUtils]: 45: Hoare triple {17911#(<= main_~i~1 13)} assume true; {17911#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:19,375 INFO L273 TraceCheckUtils]: 46: Hoare triple {17911#(<= 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; {17911#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:19,375 INFO L273 TraceCheckUtils]: 47: Hoare triple {17911#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17912#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:19,376 INFO L273 TraceCheckUtils]: 48: Hoare triple {17912#(<= main_~i~1 14)} assume true; {17912#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:19,376 INFO L273 TraceCheckUtils]: 49: Hoare triple {17912#(<= 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; {17912#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:19,377 INFO L273 TraceCheckUtils]: 50: Hoare triple {17912#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17913#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:19,378 INFO L273 TraceCheckUtils]: 51: Hoare triple {17913#(<= main_~i~1 15)} assume true; {17913#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:19,378 INFO L273 TraceCheckUtils]: 52: Hoare triple {17913#(<= 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; {17913#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:19,379 INFO L273 TraceCheckUtils]: 53: Hoare triple {17913#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17914#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:19,379 INFO L273 TraceCheckUtils]: 54: Hoare triple {17914#(<= main_~i~1 16)} assume true; {17914#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:19,380 INFO L273 TraceCheckUtils]: 55: Hoare triple {17914#(<= 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; {17914#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:19,381 INFO L273 TraceCheckUtils]: 56: Hoare triple {17914#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17915#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:19,381 INFO L273 TraceCheckUtils]: 57: Hoare triple {17915#(<= main_~i~1 17)} assume true; {17915#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:19,382 INFO L273 TraceCheckUtils]: 58: Hoare triple {17915#(<= 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; {17915#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:19,382 INFO L273 TraceCheckUtils]: 59: Hoare triple {17915#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17916#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:19,383 INFO L273 TraceCheckUtils]: 60: Hoare triple {17916#(<= main_~i~1 18)} assume true; {17916#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:19,383 INFO L273 TraceCheckUtils]: 61: Hoare triple {17916#(<= 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; {17916#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:19,384 INFO L273 TraceCheckUtils]: 62: Hoare triple {17916#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17917#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:19,385 INFO L273 TraceCheckUtils]: 63: Hoare triple {17917#(<= main_~i~1 19)} assume true; {17917#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:19,385 INFO L273 TraceCheckUtils]: 64: Hoare triple {17917#(<= 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; {17917#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:19,386 INFO L273 TraceCheckUtils]: 65: Hoare triple {17917#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17918#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:19,386 INFO L273 TraceCheckUtils]: 66: Hoare triple {17918#(<= main_~i~1 20)} assume true; {17918#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:19,387 INFO L273 TraceCheckUtils]: 67: Hoare triple {17918#(<= 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; {17918#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:19,388 INFO L273 TraceCheckUtils]: 68: Hoare triple {17918#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17919#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:19,388 INFO L273 TraceCheckUtils]: 69: Hoare triple {17919#(<= main_~i~1 21)} assume true; {17919#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:19,389 INFO L273 TraceCheckUtils]: 70: Hoare triple {17919#(<= 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; {17919#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:19,389 INFO L273 TraceCheckUtils]: 71: Hoare triple {17919#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17920#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:19,390 INFO L273 TraceCheckUtils]: 72: Hoare triple {17920#(<= main_~i~1 22)} assume true; {17920#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:19,390 INFO L273 TraceCheckUtils]: 73: Hoare triple {17920#(<= main_~i~1 22)} assume !(~i~1 < 10000); {17897#false} is VALID [2018-11-14 17:08:19,391 INFO L256 TraceCheckUtils]: 74: Hoare triple {17897#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {17896#true} is VALID [2018-11-14 17:08:19,391 INFO L273 TraceCheckUtils]: 75: Hoare triple {17896#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; {17896#true} is VALID [2018-11-14 17:08:19,391 INFO L273 TraceCheckUtils]: 76: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,391 INFO L273 TraceCheckUtils]: 77: Hoare triple {17896#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:08:19,391 INFO L273 TraceCheckUtils]: 78: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:08:19,392 INFO L273 TraceCheckUtils]: 79: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,392 INFO L273 TraceCheckUtils]: 80: Hoare triple {17896#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:08:19,392 INFO L273 TraceCheckUtils]: 81: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:08:19,392 INFO L273 TraceCheckUtils]: 82: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,392 INFO L273 TraceCheckUtils]: 83: Hoare triple {17896#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:08:19,393 INFO L273 TraceCheckUtils]: 84: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:08:19,393 INFO L273 TraceCheckUtils]: 85: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,393 INFO L273 TraceCheckUtils]: 86: Hoare triple {17896#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:08:19,393 INFO L273 TraceCheckUtils]: 87: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:08:19,393 INFO L273 TraceCheckUtils]: 88: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,393 INFO L273 TraceCheckUtils]: 89: Hoare triple {17896#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:08:19,394 INFO L273 TraceCheckUtils]: 90: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:08:19,394 INFO L273 TraceCheckUtils]: 91: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,394 INFO L273 TraceCheckUtils]: 92: Hoare triple {17896#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:08:19,394 INFO L273 TraceCheckUtils]: 93: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:08:19,394 INFO L273 TraceCheckUtils]: 94: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,394 INFO L273 TraceCheckUtils]: 95: Hoare triple {17896#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:08:19,394 INFO L273 TraceCheckUtils]: 96: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:08:19,394 INFO L273 TraceCheckUtils]: 97: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,394 INFO L273 TraceCheckUtils]: 98: Hoare triple {17896#true} assume !(~i~0 < 10000); {17896#true} is VALID [2018-11-14 17:08:19,395 INFO L273 TraceCheckUtils]: 99: Hoare triple {17896#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17896#true} is VALID [2018-11-14 17:08:19,395 INFO L273 TraceCheckUtils]: 100: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,395 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {17896#true} {17897#false} #73#return; {17897#false} is VALID [2018-11-14 17:08:19,395 INFO L273 TraceCheckUtils]: 102: Hoare triple {17897#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); {17897#false} is VALID [2018-11-14 17:08:19,395 INFO L256 TraceCheckUtils]: 103: Hoare triple {17897#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {17896#true} is VALID [2018-11-14 17:08:19,395 INFO L273 TraceCheckUtils]: 104: Hoare triple {17896#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; {17896#true} is VALID [2018-11-14 17:08:19,395 INFO L273 TraceCheckUtils]: 105: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,395 INFO L273 TraceCheckUtils]: 106: Hoare triple {17896#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:08:19,395 INFO L273 TraceCheckUtils]: 107: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:08:19,396 INFO L273 TraceCheckUtils]: 108: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,396 INFO L273 TraceCheckUtils]: 109: Hoare triple {17896#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:08:19,396 INFO L273 TraceCheckUtils]: 110: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:08:19,396 INFO L273 TraceCheckUtils]: 111: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,396 INFO L273 TraceCheckUtils]: 112: Hoare triple {17896#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:08:19,396 INFO L273 TraceCheckUtils]: 113: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:08:19,396 INFO L273 TraceCheckUtils]: 114: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,396 INFO L273 TraceCheckUtils]: 115: Hoare triple {17896#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:08:19,396 INFO L273 TraceCheckUtils]: 116: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:08:19,396 INFO L273 TraceCheckUtils]: 117: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,397 INFO L273 TraceCheckUtils]: 118: Hoare triple {17896#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:08:19,397 INFO L273 TraceCheckUtils]: 119: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:08:19,397 INFO L273 TraceCheckUtils]: 120: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,397 INFO L273 TraceCheckUtils]: 121: Hoare triple {17896#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:08:19,397 INFO L273 TraceCheckUtils]: 122: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:08:19,397 INFO L273 TraceCheckUtils]: 123: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,397 INFO L273 TraceCheckUtils]: 124: Hoare triple {17896#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:08:19,397 INFO L273 TraceCheckUtils]: 125: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:08:19,397 INFO L273 TraceCheckUtils]: 126: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,398 INFO L273 TraceCheckUtils]: 127: Hoare triple {17896#true} assume !(~i~0 < 10000); {17896#true} is VALID [2018-11-14 17:08:19,398 INFO L273 TraceCheckUtils]: 128: Hoare triple {17896#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17896#true} is VALID [2018-11-14 17:08:19,398 INFO L273 TraceCheckUtils]: 129: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,398 INFO L268 TraceCheckUtils]: 130: Hoare quadruple {17896#true} {17897#false} #75#return; {17897#false} is VALID [2018-11-14 17:08:19,398 INFO L273 TraceCheckUtils]: 131: Hoare triple {17897#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; {17897#false} is VALID [2018-11-14 17:08:19,398 INFO L273 TraceCheckUtils]: 132: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,398 INFO L273 TraceCheckUtils]: 133: Hoare triple {17897#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 17:08:19,398 INFO L273 TraceCheckUtils]: 134: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 17:08:19,398 INFO L273 TraceCheckUtils]: 135: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,398 INFO L273 TraceCheckUtils]: 136: Hoare triple {17897#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 17:08:19,399 INFO L273 TraceCheckUtils]: 137: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 17:08:19,399 INFO L273 TraceCheckUtils]: 138: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,399 INFO L273 TraceCheckUtils]: 139: Hoare triple {17897#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 17:08:19,399 INFO L273 TraceCheckUtils]: 140: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 17:08:19,399 INFO L273 TraceCheckUtils]: 141: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,399 INFO L273 TraceCheckUtils]: 142: Hoare triple {17897#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 17:08:19,399 INFO L273 TraceCheckUtils]: 143: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 17:08:19,399 INFO L273 TraceCheckUtils]: 144: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,399 INFO L273 TraceCheckUtils]: 145: Hoare triple {17897#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 17:08:19,399 INFO L273 TraceCheckUtils]: 146: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 17:08:19,400 INFO L273 TraceCheckUtils]: 147: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,400 INFO L273 TraceCheckUtils]: 148: Hoare triple {17897#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 17:08:19,400 INFO L273 TraceCheckUtils]: 149: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 17:08:19,400 INFO L273 TraceCheckUtils]: 150: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,400 INFO L273 TraceCheckUtils]: 151: Hoare triple {17897#false} assume !(~i~2 < 9999); {17897#false} is VALID [2018-11-14 17:08:19,400 INFO L273 TraceCheckUtils]: 152: Hoare triple {17897#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {17897#false} is VALID [2018-11-14 17:08:19,400 INFO L256 TraceCheckUtils]: 153: Hoare triple {17897#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {17896#true} is VALID [2018-11-14 17:08:19,400 INFO L273 TraceCheckUtils]: 154: Hoare triple {17896#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; {17896#true} is VALID [2018-11-14 17:08:19,400 INFO L273 TraceCheckUtils]: 155: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,401 INFO L273 TraceCheckUtils]: 156: Hoare triple {17896#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:08:19,401 INFO L273 TraceCheckUtils]: 157: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:08:19,401 INFO L273 TraceCheckUtils]: 158: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,401 INFO L273 TraceCheckUtils]: 159: Hoare triple {17896#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:08:19,401 INFO L273 TraceCheckUtils]: 160: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:08:19,401 INFO L273 TraceCheckUtils]: 161: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,401 INFO L273 TraceCheckUtils]: 162: Hoare triple {17896#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:08:19,401 INFO L273 TraceCheckUtils]: 163: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:08:19,401 INFO L273 TraceCheckUtils]: 164: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,401 INFO L273 TraceCheckUtils]: 165: Hoare triple {17896#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:08:19,402 INFO L273 TraceCheckUtils]: 166: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:08:19,402 INFO L273 TraceCheckUtils]: 167: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,402 INFO L273 TraceCheckUtils]: 168: Hoare triple {17896#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:08:19,402 INFO L273 TraceCheckUtils]: 169: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:08:19,402 INFO L273 TraceCheckUtils]: 170: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,402 INFO L273 TraceCheckUtils]: 171: Hoare triple {17896#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:08:19,402 INFO L273 TraceCheckUtils]: 172: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:08:19,402 INFO L273 TraceCheckUtils]: 173: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,402 INFO L273 TraceCheckUtils]: 174: Hoare triple {17896#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:08:19,403 INFO L273 TraceCheckUtils]: 175: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:08:19,403 INFO L273 TraceCheckUtils]: 176: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,403 INFO L273 TraceCheckUtils]: 177: Hoare triple {17896#true} assume !(~i~0 < 10000); {17896#true} is VALID [2018-11-14 17:08:19,403 INFO L273 TraceCheckUtils]: 178: Hoare triple {17896#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17896#true} is VALID [2018-11-14 17:08:19,403 INFO L273 TraceCheckUtils]: 179: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,403 INFO L268 TraceCheckUtils]: 180: Hoare quadruple {17896#true} {17897#false} #77#return; {17897#false} is VALID [2018-11-14 17:08:19,403 INFO L273 TraceCheckUtils]: 181: Hoare triple {17897#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {17897#false} is VALID [2018-11-14 17:08:19,403 INFO L273 TraceCheckUtils]: 182: Hoare triple {17897#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {17897#false} is VALID [2018-11-14 17:08:19,403 INFO L273 TraceCheckUtils]: 183: Hoare triple {17897#false} assume !false; {17897#false} is VALID [2018-11-14 17:08:19,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2018-11-14 17:08:19,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:19,419 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:08:19,428 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:08:19,494 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:08:19,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:08:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:19,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:19,784 INFO L256 TraceCheckUtils]: 0: Hoare triple {17896#true} call ULTIMATE.init(); {17896#true} is VALID [2018-11-14 17:08:19,784 INFO L273 TraceCheckUtils]: 1: Hoare triple {17896#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17896#true} is VALID [2018-11-14 17:08:19,785 INFO L273 TraceCheckUtils]: 2: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:08:19,785 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17896#true} {17896#true} #69#return; {17896#true} is VALID [2018-11-14 17:08:19,785 INFO L256 TraceCheckUtils]: 4: Hoare triple {17896#true} call #t~ret13 := main(); {17896#true} is VALID [2018-11-14 17:08:19,785 INFO L273 TraceCheckUtils]: 5: Hoare triple {17896#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; {17939#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:19,786 INFO L273 TraceCheckUtils]: 6: Hoare triple {17939#(<= main_~i~1 0)} assume true; {17939#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:19,786 INFO L273 TraceCheckUtils]: 7: Hoare triple {17939#(<= 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; {17939#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:19,786 INFO L273 TraceCheckUtils]: 8: Hoare triple {17939#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17899#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:19,787 INFO L273 TraceCheckUtils]: 9: Hoare triple {17899#(<= main_~i~1 1)} assume true; {17899#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:19,787 INFO L273 TraceCheckUtils]: 10: Hoare triple {17899#(<= 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; {17899#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:19,787 INFO L273 TraceCheckUtils]: 11: Hoare triple {17899#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17900#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:19,788 INFO L273 TraceCheckUtils]: 12: Hoare triple {17900#(<= main_~i~1 2)} assume true; {17900#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:19,788 INFO L273 TraceCheckUtils]: 13: Hoare triple {17900#(<= 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; {17900#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:19,788 INFO L273 TraceCheckUtils]: 14: Hoare triple {17900#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17901#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:19,789 INFO L273 TraceCheckUtils]: 15: Hoare triple {17901#(<= main_~i~1 3)} assume true; {17901#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:19,789 INFO L273 TraceCheckUtils]: 16: Hoare triple {17901#(<= 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; {17901#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:19,790 INFO L273 TraceCheckUtils]: 17: Hoare triple {17901#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17902#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:19,790 INFO L273 TraceCheckUtils]: 18: Hoare triple {17902#(<= main_~i~1 4)} assume true; {17902#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:19,791 INFO L273 TraceCheckUtils]: 19: Hoare triple {17902#(<= 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; {17902#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:19,792 INFO L273 TraceCheckUtils]: 20: Hoare triple {17902#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17903#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:19,792 INFO L273 TraceCheckUtils]: 21: Hoare triple {17903#(<= main_~i~1 5)} assume true; {17903#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:19,793 INFO L273 TraceCheckUtils]: 22: Hoare triple {17903#(<= 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; {17903#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:19,793 INFO L273 TraceCheckUtils]: 23: Hoare triple {17903#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17904#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:19,794 INFO L273 TraceCheckUtils]: 24: Hoare triple {17904#(<= main_~i~1 6)} assume true; {17904#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:19,794 INFO L273 TraceCheckUtils]: 25: Hoare triple {17904#(<= 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; {17904#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:19,795 INFO L273 TraceCheckUtils]: 26: Hoare triple {17904#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17905#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:19,796 INFO L273 TraceCheckUtils]: 27: Hoare triple {17905#(<= main_~i~1 7)} assume true; {17905#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:19,796 INFO L273 TraceCheckUtils]: 28: Hoare triple {17905#(<= 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; {17905#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:19,797 INFO L273 TraceCheckUtils]: 29: Hoare triple {17905#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17906#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:19,797 INFO L273 TraceCheckUtils]: 30: Hoare triple {17906#(<= main_~i~1 8)} assume true; {17906#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:19,798 INFO L273 TraceCheckUtils]: 31: Hoare triple {17906#(<= 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; {17906#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:19,799 INFO L273 TraceCheckUtils]: 32: Hoare triple {17906#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17907#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:19,799 INFO L273 TraceCheckUtils]: 33: Hoare triple {17907#(<= main_~i~1 9)} assume true; {17907#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:19,800 INFO L273 TraceCheckUtils]: 34: Hoare triple {17907#(<= 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; {17907#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:19,800 INFO L273 TraceCheckUtils]: 35: Hoare triple {17907#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17908#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:19,801 INFO L273 TraceCheckUtils]: 36: Hoare triple {17908#(<= main_~i~1 10)} assume true; {17908#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:19,801 INFO L273 TraceCheckUtils]: 37: Hoare triple {17908#(<= 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; {17908#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:19,802 INFO L273 TraceCheckUtils]: 38: Hoare triple {17908#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17909#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:19,803 INFO L273 TraceCheckUtils]: 39: Hoare triple {17909#(<= main_~i~1 11)} assume true; {17909#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:19,803 INFO L273 TraceCheckUtils]: 40: Hoare triple {17909#(<= 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; {17909#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:19,804 INFO L273 TraceCheckUtils]: 41: Hoare triple {17909#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17910#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:19,804 INFO L273 TraceCheckUtils]: 42: Hoare triple {17910#(<= main_~i~1 12)} assume true; {17910#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:19,805 INFO L273 TraceCheckUtils]: 43: Hoare triple {17910#(<= 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; {17910#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:19,806 INFO L273 TraceCheckUtils]: 44: Hoare triple {17910#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17911#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:19,806 INFO L273 TraceCheckUtils]: 45: Hoare triple {17911#(<= main_~i~1 13)} assume true; {17911#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:19,807 INFO L273 TraceCheckUtils]: 46: Hoare triple {17911#(<= 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; {17911#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:19,807 INFO L273 TraceCheckUtils]: 47: Hoare triple {17911#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17912#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:19,808 INFO L273 TraceCheckUtils]: 48: Hoare triple {17912#(<= main_~i~1 14)} assume true; {17912#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:19,808 INFO L273 TraceCheckUtils]: 49: Hoare triple {17912#(<= 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; {17912#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:19,809 INFO L273 TraceCheckUtils]: 50: Hoare triple {17912#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17913#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:19,810 INFO L273 TraceCheckUtils]: 51: Hoare triple {17913#(<= main_~i~1 15)} assume true; {17913#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:19,810 INFO L273 TraceCheckUtils]: 52: Hoare triple {17913#(<= 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; {17913#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:19,811 INFO L273 TraceCheckUtils]: 53: Hoare triple {17913#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17914#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:19,811 INFO L273 TraceCheckUtils]: 54: Hoare triple {17914#(<= main_~i~1 16)} assume true; {17914#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:19,812 INFO L273 TraceCheckUtils]: 55: Hoare triple {17914#(<= 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; {17914#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:19,813 INFO L273 TraceCheckUtils]: 56: Hoare triple {17914#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17915#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:19,813 INFO L273 TraceCheckUtils]: 57: Hoare triple {17915#(<= main_~i~1 17)} assume true; {17915#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:19,814 INFO L273 TraceCheckUtils]: 58: Hoare triple {17915#(<= 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; {17915#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:19,814 INFO L273 TraceCheckUtils]: 59: Hoare triple {17915#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17916#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:19,815 INFO L273 TraceCheckUtils]: 60: Hoare triple {17916#(<= main_~i~1 18)} assume true; {17916#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:19,815 INFO L273 TraceCheckUtils]: 61: Hoare triple {17916#(<= 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; {17916#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:19,816 INFO L273 TraceCheckUtils]: 62: Hoare triple {17916#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17917#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:19,817 INFO L273 TraceCheckUtils]: 63: Hoare triple {17917#(<= main_~i~1 19)} assume true; {17917#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:19,817 INFO L273 TraceCheckUtils]: 64: Hoare triple {17917#(<= 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; {17917#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:19,818 INFO L273 TraceCheckUtils]: 65: Hoare triple {17917#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17918#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:19,818 INFO L273 TraceCheckUtils]: 66: Hoare triple {17918#(<= main_~i~1 20)} assume true; {17918#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:19,819 INFO L273 TraceCheckUtils]: 67: Hoare triple {17918#(<= 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; {17918#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:19,819 INFO L273 TraceCheckUtils]: 68: Hoare triple {17918#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17919#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:19,820 INFO L273 TraceCheckUtils]: 69: Hoare triple {17919#(<= main_~i~1 21)} assume true; {17919#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:19,820 INFO L273 TraceCheckUtils]: 70: Hoare triple {17919#(<= 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; {17919#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:19,821 INFO L273 TraceCheckUtils]: 71: Hoare triple {17919#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17920#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:19,822 INFO L273 TraceCheckUtils]: 72: Hoare triple {17920#(<= main_~i~1 22)} assume true; {17920#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:19,822 INFO L273 TraceCheckUtils]: 73: Hoare triple {17920#(<= main_~i~1 22)} assume !(~i~1 < 10000); {17897#false} is VALID [2018-11-14 17:08:19,823 INFO L256 TraceCheckUtils]: 74: Hoare triple {17897#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {17897#false} is VALID [2018-11-14 17:08:19,823 INFO L273 TraceCheckUtils]: 75: Hoare triple {17897#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; {17897#false} is VALID [2018-11-14 17:08:19,823 INFO L273 TraceCheckUtils]: 76: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,823 INFO L273 TraceCheckUtils]: 77: Hoare triple {17897#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:08:19,823 INFO L273 TraceCheckUtils]: 78: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:08:19,824 INFO L273 TraceCheckUtils]: 79: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,824 INFO L273 TraceCheckUtils]: 80: Hoare triple {17897#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:08:19,824 INFO L273 TraceCheckUtils]: 81: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:08:19,824 INFO L273 TraceCheckUtils]: 82: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,824 INFO L273 TraceCheckUtils]: 83: Hoare triple {17897#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:08:19,824 INFO L273 TraceCheckUtils]: 84: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:08:19,825 INFO L273 TraceCheckUtils]: 85: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,825 INFO L273 TraceCheckUtils]: 86: Hoare triple {17897#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:08:19,825 INFO L273 TraceCheckUtils]: 87: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:08:19,825 INFO L273 TraceCheckUtils]: 88: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,825 INFO L273 TraceCheckUtils]: 89: Hoare triple {17897#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:08:19,826 INFO L273 TraceCheckUtils]: 90: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:08:19,826 INFO L273 TraceCheckUtils]: 91: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,826 INFO L273 TraceCheckUtils]: 92: Hoare triple {17897#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:08:19,826 INFO L273 TraceCheckUtils]: 93: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:08:19,826 INFO L273 TraceCheckUtils]: 94: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,826 INFO L273 TraceCheckUtils]: 95: Hoare triple {17897#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:08:19,827 INFO L273 TraceCheckUtils]: 96: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:08:19,827 INFO L273 TraceCheckUtils]: 97: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,827 INFO L273 TraceCheckUtils]: 98: Hoare triple {17897#false} assume !(~i~0 < 10000); {17897#false} is VALID [2018-11-14 17:08:19,827 INFO L273 TraceCheckUtils]: 99: Hoare triple {17897#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17897#false} is VALID [2018-11-14 17:08:19,827 INFO L273 TraceCheckUtils]: 100: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,827 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {17897#false} {17897#false} #73#return; {17897#false} is VALID [2018-11-14 17:08:19,828 INFO L273 TraceCheckUtils]: 102: Hoare triple {17897#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); {17897#false} is VALID [2018-11-14 17:08:19,828 INFO L256 TraceCheckUtils]: 103: Hoare triple {17897#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {17897#false} is VALID [2018-11-14 17:08:19,828 INFO L273 TraceCheckUtils]: 104: Hoare triple {17897#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; {17897#false} is VALID [2018-11-14 17:08:19,828 INFO L273 TraceCheckUtils]: 105: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,828 INFO L273 TraceCheckUtils]: 106: Hoare triple {17897#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:08:19,828 INFO L273 TraceCheckUtils]: 107: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:08:19,828 INFO L273 TraceCheckUtils]: 108: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,828 INFO L273 TraceCheckUtils]: 109: Hoare triple {17897#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:08:19,828 INFO L273 TraceCheckUtils]: 110: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:08:19,829 INFO L273 TraceCheckUtils]: 111: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,829 INFO L273 TraceCheckUtils]: 112: Hoare triple {17897#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:08:19,829 INFO L273 TraceCheckUtils]: 113: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:08:19,829 INFO L273 TraceCheckUtils]: 114: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,829 INFO L273 TraceCheckUtils]: 115: Hoare triple {17897#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:08:19,829 INFO L273 TraceCheckUtils]: 116: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:08:19,829 INFO L273 TraceCheckUtils]: 117: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,829 INFO L273 TraceCheckUtils]: 118: Hoare triple {17897#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:08:19,829 INFO L273 TraceCheckUtils]: 119: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:08:19,830 INFO L273 TraceCheckUtils]: 120: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,830 INFO L273 TraceCheckUtils]: 121: Hoare triple {17897#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:08:19,830 INFO L273 TraceCheckUtils]: 122: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:08:19,830 INFO L273 TraceCheckUtils]: 123: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,830 INFO L273 TraceCheckUtils]: 124: Hoare triple {17897#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:08:19,830 INFO L273 TraceCheckUtils]: 125: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:08:19,830 INFO L273 TraceCheckUtils]: 126: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,830 INFO L273 TraceCheckUtils]: 127: Hoare triple {17897#false} assume !(~i~0 < 10000); {17897#false} is VALID [2018-11-14 17:08:19,830 INFO L273 TraceCheckUtils]: 128: Hoare triple {17897#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17897#false} is VALID [2018-11-14 17:08:19,830 INFO L273 TraceCheckUtils]: 129: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,831 INFO L268 TraceCheckUtils]: 130: Hoare quadruple {17897#false} {17897#false} #75#return; {17897#false} is VALID [2018-11-14 17:08:19,831 INFO L273 TraceCheckUtils]: 131: Hoare triple {17897#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; {17897#false} is VALID [2018-11-14 17:08:19,831 INFO L273 TraceCheckUtils]: 132: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,831 INFO L273 TraceCheckUtils]: 133: Hoare triple {17897#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 17:08:19,831 INFO L273 TraceCheckUtils]: 134: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 17:08:19,831 INFO L273 TraceCheckUtils]: 135: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,831 INFO L273 TraceCheckUtils]: 136: Hoare triple {17897#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 17:08:19,831 INFO L273 TraceCheckUtils]: 137: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 17:08:19,831 INFO L273 TraceCheckUtils]: 138: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,832 INFO L273 TraceCheckUtils]: 139: Hoare triple {17897#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 17:08:19,832 INFO L273 TraceCheckUtils]: 140: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 17:08:19,832 INFO L273 TraceCheckUtils]: 141: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,832 INFO L273 TraceCheckUtils]: 142: Hoare triple {17897#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 17:08:19,832 INFO L273 TraceCheckUtils]: 143: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 17:08:19,832 INFO L273 TraceCheckUtils]: 144: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,832 INFO L273 TraceCheckUtils]: 145: Hoare triple {17897#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 17:08:19,832 INFO L273 TraceCheckUtils]: 146: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 17:08:19,832 INFO L273 TraceCheckUtils]: 147: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,832 INFO L273 TraceCheckUtils]: 148: Hoare triple {17897#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 17:08:19,833 INFO L273 TraceCheckUtils]: 149: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 17:08:19,833 INFO L273 TraceCheckUtils]: 150: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,833 INFO L273 TraceCheckUtils]: 151: Hoare triple {17897#false} assume !(~i~2 < 9999); {17897#false} is VALID [2018-11-14 17:08:19,833 INFO L273 TraceCheckUtils]: 152: Hoare triple {17897#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {17897#false} is VALID [2018-11-14 17:08:19,833 INFO L256 TraceCheckUtils]: 153: Hoare triple {17897#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {17897#false} is VALID [2018-11-14 17:08:19,833 INFO L273 TraceCheckUtils]: 154: Hoare triple {17897#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; {17897#false} is VALID [2018-11-14 17:08:19,833 INFO L273 TraceCheckUtils]: 155: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,833 INFO L273 TraceCheckUtils]: 156: Hoare triple {17897#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:08:19,833 INFO L273 TraceCheckUtils]: 157: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:08:19,833 INFO L273 TraceCheckUtils]: 158: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,834 INFO L273 TraceCheckUtils]: 159: Hoare triple {17897#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:08:19,834 INFO L273 TraceCheckUtils]: 160: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:08:19,834 INFO L273 TraceCheckUtils]: 161: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,834 INFO L273 TraceCheckUtils]: 162: Hoare triple {17897#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:08:19,834 INFO L273 TraceCheckUtils]: 163: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:08:19,834 INFO L273 TraceCheckUtils]: 164: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,834 INFO L273 TraceCheckUtils]: 165: Hoare triple {17897#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:08:19,834 INFO L273 TraceCheckUtils]: 166: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:08:19,834 INFO L273 TraceCheckUtils]: 167: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,834 INFO L273 TraceCheckUtils]: 168: Hoare triple {17897#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:08:19,835 INFO L273 TraceCheckUtils]: 169: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:08:19,835 INFO L273 TraceCheckUtils]: 170: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,835 INFO L273 TraceCheckUtils]: 171: Hoare triple {17897#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:08:19,835 INFO L273 TraceCheckUtils]: 172: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:08:19,835 INFO L273 TraceCheckUtils]: 173: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,835 INFO L273 TraceCheckUtils]: 174: Hoare triple {17897#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:08:19,835 INFO L273 TraceCheckUtils]: 175: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:08:19,835 INFO L273 TraceCheckUtils]: 176: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,835 INFO L273 TraceCheckUtils]: 177: Hoare triple {17897#false} assume !(~i~0 < 10000); {17897#false} is VALID [2018-11-14 17:08:19,836 INFO L273 TraceCheckUtils]: 178: Hoare triple {17897#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17897#false} is VALID [2018-11-14 17:08:19,836 INFO L273 TraceCheckUtils]: 179: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:08:19,836 INFO L268 TraceCheckUtils]: 180: Hoare quadruple {17897#false} {17897#false} #77#return; {17897#false} is VALID [2018-11-14 17:08:19,836 INFO L273 TraceCheckUtils]: 181: Hoare triple {17897#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {17897#false} is VALID [2018-11-14 17:08:19,836 INFO L273 TraceCheckUtils]: 182: Hoare triple {17897#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {17897#false} is VALID [2018-11-14 17:08:19,836 INFO L273 TraceCheckUtils]: 183: Hoare triple {17897#false} assume !false; {17897#false} is VALID [2018-11-14 17:08:19,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2018-11-14 17:08:19,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:19,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-14 17:08:19,873 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 184 [2018-11-14 17:08:19,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:19,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 17:08:19,981 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:19,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 17:08:19,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 17:08:19,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-14 17:08:19,982 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 26 states. [2018-11-14 17:08:20,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:20,210 INFO L93 Difference]: Finished difference Result 192 states and 200 transitions. [2018-11-14 17:08:20,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 17:08:20,210 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 184 [2018-11-14 17:08:20,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:20,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:08:20,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 126 transitions. [2018-11-14 17:08:20,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:08:20,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 126 transitions. [2018-11-14 17:08:20,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 126 transitions. [2018-11-14 17:08:20,326 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:20,329 INFO L225 Difference]: With dead ends: 192 [2018-11-14 17:08:20,329 INFO L226 Difference]: Without dead ends: 135 [2018-11-14 17:08:20,330 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-14 17:08:20,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-14 17:08:20,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-11-14 17:08:20,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:20,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand 134 states. [2018-11-14 17:08:20,366 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 134 states. [2018-11-14 17:08:20,367 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 134 states. [2018-11-14 17:08:20,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:20,369 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2018-11-14 17:08:20,369 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-11-14 17:08:20,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:20,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:20,370 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 135 states. [2018-11-14 17:08:20,370 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 135 states. [2018-11-14 17:08:20,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:20,372 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2018-11-14 17:08:20,372 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-11-14 17:08:20,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:20,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:20,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:20,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:20,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-14 17:08:20,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 138 transitions. [2018-11-14 17:08:20,375 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 138 transitions. Word has length 184 [2018-11-14 17:08:20,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:20,376 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 138 transitions. [2018-11-14 17:08:20,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 17:08:20,376 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 138 transitions. [2018-11-14 17:08:20,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-14 17:08:20,377 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:20,377 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:08:20,377 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:20,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:20,378 INFO L82 PathProgramCache]: Analyzing trace with hash 644913055, now seen corresponding path program 23 times [2018-11-14 17:08:20,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:20,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:20,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:20,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:08:20,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:21,220 INFO L256 TraceCheckUtils]: 0: Hoare triple {19182#true} call ULTIMATE.init(); {19182#true} is VALID [2018-11-14 17:08:21,220 INFO L273 TraceCheckUtils]: 1: Hoare triple {19182#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19182#true} is VALID [2018-11-14 17:08:21,221 INFO L273 TraceCheckUtils]: 2: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:21,221 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19182#true} {19182#true} #69#return; {19182#true} is VALID [2018-11-14 17:08:21,221 INFO L256 TraceCheckUtils]: 4: Hoare triple {19182#true} call #t~ret13 := main(); {19182#true} is VALID [2018-11-14 17:08:21,222 INFO L273 TraceCheckUtils]: 5: Hoare triple {19182#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; {19184#(= main_~i~1 0)} is VALID [2018-11-14 17:08:21,222 INFO L273 TraceCheckUtils]: 6: Hoare triple {19184#(= main_~i~1 0)} assume true; {19184#(= main_~i~1 0)} is VALID [2018-11-14 17:08:21,222 INFO L273 TraceCheckUtils]: 7: Hoare triple {19184#(= 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; {19184#(= main_~i~1 0)} is VALID [2018-11-14 17:08:21,223 INFO L273 TraceCheckUtils]: 8: Hoare triple {19184#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19185#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:21,223 INFO L273 TraceCheckUtils]: 9: Hoare triple {19185#(<= main_~i~1 1)} assume true; {19185#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:21,224 INFO L273 TraceCheckUtils]: 10: Hoare triple {19185#(<= 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; {19185#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:21,224 INFO L273 TraceCheckUtils]: 11: Hoare triple {19185#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19186#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:21,224 INFO L273 TraceCheckUtils]: 12: Hoare triple {19186#(<= main_~i~1 2)} assume true; {19186#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:21,225 INFO L273 TraceCheckUtils]: 13: Hoare triple {19186#(<= 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; {19186#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:21,225 INFO L273 TraceCheckUtils]: 14: Hoare triple {19186#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19187#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:21,226 INFO L273 TraceCheckUtils]: 15: Hoare triple {19187#(<= main_~i~1 3)} assume true; {19187#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:21,226 INFO L273 TraceCheckUtils]: 16: Hoare triple {19187#(<= 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; {19187#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:21,227 INFO L273 TraceCheckUtils]: 17: Hoare triple {19187#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19188#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:21,228 INFO L273 TraceCheckUtils]: 18: Hoare triple {19188#(<= main_~i~1 4)} assume true; {19188#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:21,228 INFO L273 TraceCheckUtils]: 19: Hoare triple {19188#(<= 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; {19188#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:21,229 INFO L273 TraceCheckUtils]: 20: Hoare triple {19188#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19189#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:21,229 INFO L273 TraceCheckUtils]: 21: Hoare triple {19189#(<= main_~i~1 5)} assume true; {19189#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:21,232 INFO L273 TraceCheckUtils]: 22: Hoare triple {19189#(<= 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; {19189#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:21,232 INFO L273 TraceCheckUtils]: 23: Hoare triple {19189#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19190#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:21,233 INFO L273 TraceCheckUtils]: 24: Hoare triple {19190#(<= main_~i~1 6)} assume true; {19190#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:21,233 INFO L273 TraceCheckUtils]: 25: Hoare triple {19190#(<= 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; {19190#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:21,233 INFO L273 TraceCheckUtils]: 26: Hoare triple {19190#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19191#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:21,234 INFO L273 TraceCheckUtils]: 27: Hoare triple {19191#(<= main_~i~1 7)} assume true; {19191#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:21,234 INFO L273 TraceCheckUtils]: 28: Hoare triple {19191#(<= 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; {19191#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:21,235 INFO L273 TraceCheckUtils]: 29: Hoare triple {19191#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19192#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:21,235 INFO L273 TraceCheckUtils]: 30: Hoare triple {19192#(<= main_~i~1 8)} assume true; {19192#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:21,236 INFO L273 TraceCheckUtils]: 31: Hoare triple {19192#(<= 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; {19192#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:21,236 INFO L273 TraceCheckUtils]: 32: Hoare triple {19192#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19193#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:21,237 INFO L273 TraceCheckUtils]: 33: Hoare triple {19193#(<= main_~i~1 9)} assume true; {19193#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:21,237 INFO L273 TraceCheckUtils]: 34: Hoare triple {19193#(<= 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; {19193#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:21,238 INFO L273 TraceCheckUtils]: 35: Hoare triple {19193#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19194#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:21,239 INFO L273 TraceCheckUtils]: 36: Hoare triple {19194#(<= main_~i~1 10)} assume true; {19194#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:21,239 INFO L273 TraceCheckUtils]: 37: Hoare triple {19194#(<= 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; {19194#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:21,240 INFO L273 TraceCheckUtils]: 38: Hoare triple {19194#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19195#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:21,240 INFO L273 TraceCheckUtils]: 39: Hoare triple {19195#(<= main_~i~1 11)} assume true; {19195#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:21,241 INFO L273 TraceCheckUtils]: 40: Hoare triple {19195#(<= 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; {19195#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:21,242 INFO L273 TraceCheckUtils]: 41: Hoare triple {19195#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19196#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:21,242 INFO L273 TraceCheckUtils]: 42: Hoare triple {19196#(<= main_~i~1 12)} assume true; {19196#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:21,243 INFO L273 TraceCheckUtils]: 43: Hoare triple {19196#(<= 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; {19196#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:21,243 INFO L273 TraceCheckUtils]: 44: Hoare triple {19196#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19197#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:21,244 INFO L273 TraceCheckUtils]: 45: Hoare triple {19197#(<= main_~i~1 13)} assume true; {19197#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:21,244 INFO L273 TraceCheckUtils]: 46: Hoare triple {19197#(<= 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; {19197#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:21,245 INFO L273 TraceCheckUtils]: 47: Hoare triple {19197#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19198#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:21,246 INFO L273 TraceCheckUtils]: 48: Hoare triple {19198#(<= main_~i~1 14)} assume true; {19198#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:21,246 INFO L273 TraceCheckUtils]: 49: Hoare triple {19198#(<= 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; {19198#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:21,247 INFO L273 TraceCheckUtils]: 50: Hoare triple {19198#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19199#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:21,247 INFO L273 TraceCheckUtils]: 51: Hoare triple {19199#(<= main_~i~1 15)} assume true; {19199#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:21,248 INFO L273 TraceCheckUtils]: 52: Hoare triple {19199#(<= 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; {19199#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:21,249 INFO L273 TraceCheckUtils]: 53: Hoare triple {19199#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19200#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:21,249 INFO L273 TraceCheckUtils]: 54: Hoare triple {19200#(<= main_~i~1 16)} assume true; {19200#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:21,250 INFO L273 TraceCheckUtils]: 55: Hoare triple {19200#(<= 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; {19200#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:21,250 INFO L273 TraceCheckUtils]: 56: Hoare triple {19200#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19201#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:21,251 INFO L273 TraceCheckUtils]: 57: Hoare triple {19201#(<= main_~i~1 17)} assume true; {19201#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:21,251 INFO L273 TraceCheckUtils]: 58: Hoare triple {19201#(<= 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; {19201#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:21,252 INFO L273 TraceCheckUtils]: 59: Hoare triple {19201#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19202#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:21,253 INFO L273 TraceCheckUtils]: 60: Hoare triple {19202#(<= main_~i~1 18)} assume true; {19202#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:21,253 INFO L273 TraceCheckUtils]: 61: Hoare triple {19202#(<= 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; {19202#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:21,254 INFO L273 TraceCheckUtils]: 62: Hoare triple {19202#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19203#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:21,254 INFO L273 TraceCheckUtils]: 63: Hoare triple {19203#(<= main_~i~1 19)} assume true; {19203#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:21,255 INFO L273 TraceCheckUtils]: 64: Hoare triple {19203#(<= 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; {19203#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:21,256 INFO L273 TraceCheckUtils]: 65: Hoare triple {19203#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19204#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:21,256 INFO L273 TraceCheckUtils]: 66: Hoare triple {19204#(<= main_~i~1 20)} assume true; {19204#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:21,257 INFO L273 TraceCheckUtils]: 67: Hoare triple {19204#(<= 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; {19204#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:21,257 INFO L273 TraceCheckUtils]: 68: Hoare triple {19204#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19205#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:21,258 INFO L273 TraceCheckUtils]: 69: Hoare triple {19205#(<= main_~i~1 21)} assume true; {19205#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:21,258 INFO L273 TraceCheckUtils]: 70: Hoare triple {19205#(<= 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; {19205#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:21,259 INFO L273 TraceCheckUtils]: 71: Hoare triple {19205#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19206#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:21,260 INFO L273 TraceCheckUtils]: 72: Hoare triple {19206#(<= main_~i~1 22)} assume true; {19206#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:21,260 INFO L273 TraceCheckUtils]: 73: Hoare triple {19206#(<= 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; {19206#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:21,261 INFO L273 TraceCheckUtils]: 74: Hoare triple {19206#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19207#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:21,261 INFO L273 TraceCheckUtils]: 75: Hoare triple {19207#(<= main_~i~1 23)} assume true; {19207#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:21,262 INFO L273 TraceCheckUtils]: 76: Hoare triple {19207#(<= main_~i~1 23)} assume !(~i~1 < 10000); {19183#false} is VALID [2018-11-14 17:08:21,262 INFO L256 TraceCheckUtils]: 77: Hoare triple {19183#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {19182#true} is VALID [2018-11-14 17:08:21,262 INFO L273 TraceCheckUtils]: 78: Hoare triple {19182#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; {19182#true} is VALID [2018-11-14 17:08:21,263 INFO L273 TraceCheckUtils]: 79: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:21,263 INFO L273 TraceCheckUtils]: 80: Hoare triple {19182#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:08:21,263 INFO L273 TraceCheckUtils]: 81: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:08:21,263 INFO L273 TraceCheckUtils]: 82: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:21,263 INFO L273 TraceCheckUtils]: 83: Hoare triple {19182#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:08:21,263 INFO L273 TraceCheckUtils]: 84: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:08:21,264 INFO L273 TraceCheckUtils]: 85: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:21,264 INFO L273 TraceCheckUtils]: 86: Hoare triple {19182#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:08:21,264 INFO L273 TraceCheckUtils]: 87: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:08:21,264 INFO L273 TraceCheckUtils]: 88: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:21,264 INFO L273 TraceCheckUtils]: 89: Hoare triple {19182#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:08:21,264 INFO L273 TraceCheckUtils]: 90: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:08:21,265 INFO L273 TraceCheckUtils]: 91: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:21,265 INFO L273 TraceCheckUtils]: 92: Hoare triple {19182#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:08:21,265 INFO L273 TraceCheckUtils]: 93: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:08:21,265 INFO L273 TraceCheckUtils]: 94: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:21,265 INFO L273 TraceCheckUtils]: 95: Hoare triple {19182#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:08:21,265 INFO L273 TraceCheckUtils]: 96: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:08:21,265 INFO L273 TraceCheckUtils]: 97: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:21,265 INFO L273 TraceCheckUtils]: 98: Hoare triple {19182#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:08:21,265 INFO L273 TraceCheckUtils]: 99: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:08:21,266 INFO L273 TraceCheckUtils]: 100: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:21,266 INFO L273 TraceCheckUtils]: 101: Hoare triple {19182#true} assume !(~i~0 < 10000); {19182#true} is VALID [2018-11-14 17:08:21,266 INFO L273 TraceCheckUtils]: 102: Hoare triple {19182#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19182#true} is VALID [2018-11-14 17:08:21,266 INFO L273 TraceCheckUtils]: 103: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:21,266 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {19182#true} {19183#false} #73#return; {19183#false} is VALID [2018-11-14 17:08:21,266 INFO L273 TraceCheckUtils]: 105: Hoare triple {19183#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); {19183#false} is VALID [2018-11-14 17:08:21,266 INFO L256 TraceCheckUtils]: 106: Hoare triple {19183#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {19182#true} is VALID [2018-11-14 17:08:21,266 INFO L273 TraceCheckUtils]: 107: Hoare triple {19182#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; {19182#true} is VALID [2018-11-14 17:08:21,266 INFO L273 TraceCheckUtils]: 108: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:21,266 INFO L273 TraceCheckUtils]: 109: Hoare triple {19182#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:08:21,267 INFO L273 TraceCheckUtils]: 110: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:08:21,267 INFO L273 TraceCheckUtils]: 111: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:21,267 INFO L273 TraceCheckUtils]: 112: Hoare triple {19182#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:08:21,267 INFO L273 TraceCheckUtils]: 113: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:08:21,267 INFO L273 TraceCheckUtils]: 114: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:21,267 INFO L273 TraceCheckUtils]: 115: Hoare triple {19182#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:08:21,267 INFO L273 TraceCheckUtils]: 116: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:08:21,267 INFO L273 TraceCheckUtils]: 117: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:21,267 INFO L273 TraceCheckUtils]: 118: Hoare triple {19182#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:08:21,268 INFO L273 TraceCheckUtils]: 119: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:08:21,268 INFO L273 TraceCheckUtils]: 120: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:21,268 INFO L273 TraceCheckUtils]: 121: Hoare triple {19182#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:08:21,268 INFO L273 TraceCheckUtils]: 122: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:08:21,268 INFO L273 TraceCheckUtils]: 123: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:21,268 INFO L273 TraceCheckUtils]: 124: Hoare triple {19182#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:08:21,268 INFO L273 TraceCheckUtils]: 125: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:08:21,268 INFO L273 TraceCheckUtils]: 126: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:21,268 INFO L273 TraceCheckUtils]: 127: Hoare triple {19182#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:08:21,268 INFO L273 TraceCheckUtils]: 128: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:08:21,269 INFO L273 TraceCheckUtils]: 129: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:21,269 INFO L273 TraceCheckUtils]: 130: Hoare triple {19182#true} assume !(~i~0 < 10000); {19182#true} is VALID [2018-11-14 17:08:21,269 INFO L273 TraceCheckUtils]: 131: Hoare triple {19182#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19182#true} is VALID [2018-11-14 17:08:21,269 INFO L273 TraceCheckUtils]: 132: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:21,269 INFO L268 TraceCheckUtils]: 133: Hoare quadruple {19182#true} {19183#false} #75#return; {19183#false} is VALID [2018-11-14 17:08:21,269 INFO L273 TraceCheckUtils]: 134: Hoare triple {19183#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; {19183#false} is VALID [2018-11-14 17:08:21,269 INFO L273 TraceCheckUtils]: 135: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:21,269 INFO L273 TraceCheckUtils]: 136: Hoare triple {19183#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 17:08:21,269 INFO L273 TraceCheckUtils]: 137: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 17:08:21,269 INFO L273 TraceCheckUtils]: 138: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:21,270 INFO L273 TraceCheckUtils]: 139: Hoare triple {19183#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 17:08:21,270 INFO L273 TraceCheckUtils]: 140: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 17:08:21,270 INFO L273 TraceCheckUtils]: 141: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:21,270 INFO L273 TraceCheckUtils]: 142: Hoare triple {19183#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 17:08:21,270 INFO L273 TraceCheckUtils]: 143: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 17:08:21,270 INFO L273 TraceCheckUtils]: 144: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:21,270 INFO L273 TraceCheckUtils]: 145: Hoare triple {19183#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 17:08:21,270 INFO L273 TraceCheckUtils]: 146: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 17:08:21,270 INFO L273 TraceCheckUtils]: 147: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:21,271 INFO L273 TraceCheckUtils]: 148: Hoare triple {19183#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 17:08:21,271 INFO L273 TraceCheckUtils]: 149: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 17:08:21,271 INFO L273 TraceCheckUtils]: 150: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:21,271 INFO L273 TraceCheckUtils]: 151: Hoare triple {19183#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 17:08:21,271 INFO L273 TraceCheckUtils]: 152: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 17:08:21,271 INFO L273 TraceCheckUtils]: 153: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:21,271 INFO L273 TraceCheckUtils]: 154: Hoare triple {19183#false} assume !(~i~2 < 9999); {19183#false} is VALID [2018-11-14 17:08:21,272 INFO L273 TraceCheckUtils]: 155: Hoare triple {19183#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {19183#false} is VALID [2018-11-14 17:08:21,272 INFO L256 TraceCheckUtils]: 156: Hoare triple {19183#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {19182#true} is VALID [2018-11-14 17:08:21,272 INFO L273 TraceCheckUtils]: 157: Hoare triple {19182#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; {19182#true} is VALID [2018-11-14 17:08:21,272 INFO L273 TraceCheckUtils]: 158: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:21,272 INFO L273 TraceCheckUtils]: 159: Hoare triple {19182#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:08:21,272 INFO L273 TraceCheckUtils]: 160: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:08:21,272 INFO L273 TraceCheckUtils]: 161: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:21,273 INFO L273 TraceCheckUtils]: 162: Hoare triple {19182#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:08:21,273 INFO L273 TraceCheckUtils]: 163: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:08:21,273 INFO L273 TraceCheckUtils]: 164: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:21,273 INFO L273 TraceCheckUtils]: 165: Hoare triple {19182#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:08:21,273 INFO L273 TraceCheckUtils]: 166: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:08:21,273 INFO L273 TraceCheckUtils]: 167: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:21,273 INFO L273 TraceCheckUtils]: 168: Hoare triple {19182#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:08:21,274 INFO L273 TraceCheckUtils]: 169: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:08:21,274 INFO L273 TraceCheckUtils]: 170: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:21,274 INFO L273 TraceCheckUtils]: 171: Hoare triple {19182#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:08:21,274 INFO L273 TraceCheckUtils]: 172: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:08:21,274 INFO L273 TraceCheckUtils]: 173: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:21,274 INFO L273 TraceCheckUtils]: 174: Hoare triple {19182#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:08:21,274 INFO L273 TraceCheckUtils]: 175: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:08:21,274 INFO L273 TraceCheckUtils]: 176: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:21,275 INFO L273 TraceCheckUtils]: 177: Hoare triple {19182#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:08:21,275 INFO L273 TraceCheckUtils]: 178: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:08:21,275 INFO L273 TraceCheckUtils]: 179: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:21,275 INFO L273 TraceCheckUtils]: 180: Hoare triple {19182#true} assume !(~i~0 < 10000); {19182#true} is VALID [2018-11-14 17:08:21,275 INFO L273 TraceCheckUtils]: 181: Hoare triple {19182#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19182#true} is VALID [2018-11-14 17:08:21,275 INFO L273 TraceCheckUtils]: 182: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:21,275 INFO L268 TraceCheckUtils]: 183: Hoare quadruple {19182#true} {19183#false} #77#return; {19183#false} is VALID [2018-11-14 17:08:21,275 INFO L273 TraceCheckUtils]: 184: Hoare triple {19183#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {19183#false} is VALID [2018-11-14 17:08:21,275 INFO L273 TraceCheckUtils]: 185: Hoare triple {19183#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {19183#false} is VALID [2018-11-14 17:08:21,276 INFO L273 TraceCheckUtils]: 186: Hoare triple {19183#false} assume !false; {19183#false} is VALID [2018-11-14 17:08:21,291 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:08:21,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:21,291 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:08:21,300 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:08:25,409 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2018-11-14 17:08:25,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:08:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:25,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:26,475 INFO L256 TraceCheckUtils]: 0: Hoare triple {19182#true} call ULTIMATE.init(); {19182#true} is VALID [2018-11-14 17:08:26,475 INFO L273 TraceCheckUtils]: 1: Hoare triple {19182#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19182#true} is VALID [2018-11-14 17:08:26,475 INFO L273 TraceCheckUtils]: 2: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:26,476 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19182#true} {19182#true} #69#return; {19182#true} is VALID [2018-11-14 17:08:26,476 INFO L256 TraceCheckUtils]: 4: Hoare triple {19182#true} call #t~ret13 := main(); {19182#true} is VALID [2018-11-14 17:08:26,476 INFO L273 TraceCheckUtils]: 5: Hoare triple {19182#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; {19182#true} is VALID [2018-11-14 17:08:26,476 INFO L273 TraceCheckUtils]: 6: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:26,476 INFO L273 TraceCheckUtils]: 7: Hoare triple {19182#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:08:26,477 INFO L273 TraceCheckUtils]: 8: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:08:26,477 INFO L273 TraceCheckUtils]: 9: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:26,477 INFO L273 TraceCheckUtils]: 10: Hoare triple {19182#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:08:26,477 INFO L273 TraceCheckUtils]: 11: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:08:26,477 INFO L273 TraceCheckUtils]: 12: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:26,477 INFO L273 TraceCheckUtils]: 13: Hoare triple {19182#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:08:26,477 INFO L273 TraceCheckUtils]: 14: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:08:26,478 INFO L273 TraceCheckUtils]: 15: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:26,478 INFO L273 TraceCheckUtils]: 16: Hoare triple {19182#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:08:26,478 INFO L273 TraceCheckUtils]: 17: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:08:26,478 INFO L273 TraceCheckUtils]: 18: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:26,478 INFO L273 TraceCheckUtils]: 19: Hoare triple {19182#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:08:26,478 INFO L273 TraceCheckUtils]: 20: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:08:26,478 INFO L273 TraceCheckUtils]: 21: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:26,478 INFO L273 TraceCheckUtils]: 22: Hoare triple {19182#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:08:26,478 INFO L273 TraceCheckUtils]: 23: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:08:26,479 INFO L273 TraceCheckUtils]: 24: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:26,479 INFO L273 TraceCheckUtils]: 25: Hoare triple {19182#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:08:26,479 INFO L273 TraceCheckUtils]: 26: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:08:26,479 INFO L273 TraceCheckUtils]: 27: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:26,479 INFO L273 TraceCheckUtils]: 28: Hoare triple {19182#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:08:26,479 INFO L273 TraceCheckUtils]: 29: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:08:26,479 INFO L273 TraceCheckUtils]: 30: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:26,479 INFO L273 TraceCheckUtils]: 31: Hoare triple {19182#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:08:26,479 INFO L273 TraceCheckUtils]: 32: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:08:26,479 INFO L273 TraceCheckUtils]: 33: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:26,480 INFO L273 TraceCheckUtils]: 34: Hoare triple {19182#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:08:26,480 INFO L273 TraceCheckUtils]: 35: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:08:26,480 INFO L273 TraceCheckUtils]: 36: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:26,480 INFO L273 TraceCheckUtils]: 37: Hoare triple {19182#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:08:26,480 INFO L273 TraceCheckUtils]: 38: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:08:26,480 INFO L273 TraceCheckUtils]: 39: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:26,480 INFO L273 TraceCheckUtils]: 40: Hoare triple {19182#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:08:26,480 INFO L273 TraceCheckUtils]: 41: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:08:26,480 INFO L273 TraceCheckUtils]: 42: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:26,481 INFO L273 TraceCheckUtils]: 43: Hoare triple {19182#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:08:26,481 INFO L273 TraceCheckUtils]: 44: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:08:26,481 INFO L273 TraceCheckUtils]: 45: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:26,481 INFO L273 TraceCheckUtils]: 46: Hoare triple {19182#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:08:26,481 INFO L273 TraceCheckUtils]: 47: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:08:26,481 INFO L273 TraceCheckUtils]: 48: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:26,481 INFO L273 TraceCheckUtils]: 49: Hoare triple {19182#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:08:26,481 INFO L273 TraceCheckUtils]: 50: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:08:26,481 INFO L273 TraceCheckUtils]: 51: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:26,481 INFO L273 TraceCheckUtils]: 52: Hoare triple {19182#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:08:26,482 INFO L273 TraceCheckUtils]: 53: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:08:26,482 INFO L273 TraceCheckUtils]: 54: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:26,482 INFO L273 TraceCheckUtils]: 55: Hoare triple {19182#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:08:26,482 INFO L273 TraceCheckUtils]: 56: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:08:26,482 INFO L273 TraceCheckUtils]: 57: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:26,482 INFO L273 TraceCheckUtils]: 58: Hoare triple {19182#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:08:26,482 INFO L273 TraceCheckUtils]: 59: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:08:26,482 INFO L273 TraceCheckUtils]: 60: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:26,482 INFO L273 TraceCheckUtils]: 61: Hoare triple {19182#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:08:26,483 INFO L273 TraceCheckUtils]: 62: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:08:26,483 INFO L273 TraceCheckUtils]: 63: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:26,483 INFO L273 TraceCheckUtils]: 64: Hoare triple {19182#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:08:26,483 INFO L273 TraceCheckUtils]: 65: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:08:26,483 INFO L273 TraceCheckUtils]: 66: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:26,483 INFO L273 TraceCheckUtils]: 67: Hoare triple {19182#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:08:26,483 INFO L273 TraceCheckUtils]: 68: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:08:26,484 INFO L273 TraceCheckUtils]: 69: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:26,484 INFO L273 TraceCheckUtils]: 70: Hoare triple {19182#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:08:26,484 INFO L273 TraceCheckUtils]: 71: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:08:26,484 INFO L273 TraceCheckUtils]: 72: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:26,484 INFO L273 TraceCheckUtils]: 73: Hoare triple {19182#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:08:26,484 INFO L273 TraceCheckUtils]: 74: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:08:26,485 INFO L273 TraceCheckUtils]: 75: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:08:26,485 INFO L273 TraceCheckUtils]: 76: Hoare triple {19182#true} assume !(~i~1 < 10000); {19182#true} is VALID [2018-11-14 17:08:26,485 INFO L256 TraceCheckUtils]: 77: Hoare triple {19182#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {19182#true} is VALID [2018-11-14 17:08:26,501 INFO L273 TraceCheckUtils]: 78: Hoare triple {19182#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; {19445#(<= bor_~i~0 1)} is VALID [2018-11-14 17:08:26,514 INFO L273 TraceCheckUtils]: 79: Hoare triple {19445#(<= bor_~i~0 1)} assume true; {19445#(<= bor_~i~0 1)} is VALID [2018-11-14 17:08:26,529 INFO L273 TraceCheckUtils]: 80: Hoare triple {19445#(<= bor_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19445#(<= bor_~i~0 1)} is VALID [2018-11-14 17:08:26,538 INFO L273 TraceCheckUtils]: 81: Hoare triple {19445#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19455#(<= bor_~i~0 2)} is VALID [2018-11-14 17:08:26,552 INFO L273 TraceCheckUtils]: 82: Hoare triple {19455#(<= bor_~i~0 2)} assume true; {19455#(<= bor_~i~0 2)} is VALID [2018-11-14 17:08:26,552 INFO L273 TraceCheckUtils]: 83: Hoare triple {19455#(<= bor_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19455#(<= bor_~i~0 2)} is VALID [2018-11-14 17:08:26,554 INFO L273 TraceCheckUtils]: 84: Hoare triple {19455#(<= bor_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19465#(<= bor_~i~0 3)} is VALID [2018-11-14 17:08:26,554 INFO L273 TraceCheckUtils]: 85: Hoare triple {19465#(<= bor_~i~0 3)} assume true; {19465#(<= bor_~i~0 3)} is VALID [2018-11-14 17:08:26,554 INFO L273 TraceCheckUtils]: 86: Hoare triple {19465#(<= bor_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19465#(<= bor_~i~0 3)} is VALID [2018-11-14 17:08:26,555 INFO L273 TraceCheckUtils]: 87: Hoare triple {19465#(<= bor_~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19475#(<= bor_~i~0 4)} is VALID [2018-11-14 17:08:26,555 INFO L273 TraceCheckUtils]: 88: Hoare triple {19475#(<= bor_~i~0 4)} assume true; {19475#(<= bor_~i~0 4)} is VALID [2018-11-14 17:08:26,555 INFO L273 TraceCheckUtils]: 89: Hoare triple {19475#(<= bor_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19475#(<= bor_~i~0 4)} is VALID [2018-11-14 17:08:26,556 INFO L273 TraceCheckUtils]: 90: Hoare triple {19475#(<= bor_~i~0 4)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19485#(<= bor_~i~0 5)} is VALID [2018-11-14 17:08:26,556 INFO L273 TraceCheckUtils]: 91: Hoare triple {19485#(<= bor_~i~0 5)} assume true; {19485#(<= bor_~i~0 5)} is VALID [2018-11-14 17:08:26,556 INFO L273 TraceCheckUtils]: 92: Hoare triple {19485#(<= bor_~i~0 5)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19485#(<= bor_~i~0 5)} is VALID [2018-11-14 17:08:26,557 INFO L273 TraceCheckUtils]: 93: Hoare triple {19485#(<= bor_~i~0 5)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19495#(<= bor_~i~0 6)} is VALID [2018-11-14 17:08:26,557 INFO L273 TraceCheckUtils]: 94: Hoare triple {19495#(<= bor_~i~0 6)} assume true; {19495#(<= bor_~i~0 6)} is VALID [2018-11-14 17:08:26,557 INFO L273 TraceCheckUtils]: 95: Hoare triple {19495#(<= bor_~i~0 6)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19495#(<= bor_~i~0 6)} is VALID [2018-11-14 17:08:26,558 INFO L273 TraceCheckUtils]: 96: Hoare triple {19495#(<= bor_~i~0 6)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19505#(<= bor_~i~0 7)} is VALID [2018-11-14 17:08:26,559 INFO L273 TraceCheckUtils]: 97: Hoare triple {19505#(<= bor_~i~0 7)} assume true; {19505#(<= bor_~i~0 7)} is VALID [2018-11-14 17:08:26,559 INFO L273 TraceCheckUtils]: 98: Hoare triple {19505#(<= bor_~i~0 7)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19505#(<= bor_~i~0 7)} is VALID [2018-11-14 17:08:26,560 INFO L273 TraceCheckUtils]: 99: Hoare triple {19505#(<= bor_~i~0 7)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19515#(<= bor_~i~0 8)} is VALID [2018-11-14 17:08:26,560 INFO L273 TraceCheckUtils]: 100: Hoare triple {19515#(<= bor_~i~0 8)} assume true; {19515#(<= bor_~i~0 8)} is VALID [2018-11-14 17:08:26,561 INFO L273 TraceCheckUtils]: 101: Hoare triple {19515#(<= bor_~i~0 8)} assume !(~i~0 < 10000); {19183#false} is VALID [2018-11-14 17:08:26,561 INFO L273 TraceCheckUtils]: 102: Hoare triple {19183#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19183#false} is VALID [2018-11-14 17:08:26,561 INFO L273 TraceCheckUtils]: 103: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:26,562 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {19183#false} {19182#true} #73#return; {19183#false} is VALID [2018-11-14 17:08:26,562 INFO L273 TraceCheckUtils]: 105: Hoare triple {19183#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); {19183#false} is VALID [2018-11-14 17:08:26,563 INFO L256 TraceCheckUtils]: 106: Hoare triple {19183#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {19183#false} is VALID [2018-11-14 17:08:26,563 INFO L273 TraceCheckUtils]: 107: Hoare triple {19183#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; {19183#false} is VALID [2018-11-14 17:08:26,563 INFO L273 TraceCheckUtils]: 108: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:26,563 INFO L273 TraceCheckUtils]: 109: Hoare triple {19183#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 17:08:26,564 INFO L273 TraceCheckUtils]: 110: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 17:08:26,564 INFO L273 TraceCheckUtils]: 111: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:26,564 INFO L273 TraceCheckUtils]: 112: Hoare triple {19183#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 17:08:26,564 INFO L273 TraceCheckUtils]: 113: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 17:08:26,564 INFO L273 TraceCheckUtils]: 114: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:26,564 INFO L273 TraceCheckUtils]: 115: Hoare triple {19183#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 17:08:26,564 INFO L273 TraceCheckUtils]: 116: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 17:08:26,565 INFO L273 TraceCheckUtils]: 117: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:26,565 INFO L273 TraceCheckUtils]: 118: Hoare triple {19183#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 17:08:26,565 INFO L273 TraceCheckUtils]: 119: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 17:08:26,565 INFO L273 TraceCheckUtils]: 120: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:26,565 INFO L273 TraceCheckUtils]: 121: Hoare triple {19183#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 17:08:26,565 INFO L273 TraceCheckUtils]: 122: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 17:08:26,566 INFO L273 TraceCheckUtils]: 123: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:26,566 INFO L273 TraceCheckUtils]: 124: Hoare triple {19183#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 17:08:26,566 INFO L273 TraceCheckUtils]: 125: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 17:08:26,566 INFO L273 TraceCheckUtils]: 126: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:26,566 INFO L273 TraceCheckUtils]: 127: Hoare triple {19183#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 17:08:26,566 INFO L273 TraceCheckUtils]: 128: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 17:08:26,566 INFO L273 TraceCheckUtils]: 129: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:26,567 INFO L273 TraceCheckUtils]: 130: Hoare triple {19183#false} assume !(~i~0 < 10000); {19183#false} is VALID [2018-11-14 17:08:26,567 INFO L273 TraceCheckUtils]: 131: Hoare triple {19183#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19183#false} is VALID [2018-11-14 17:08:26,567 INFO L273 TraceCheckUtils]: 132: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:26,567 INFO L268 TraceCheckUtils]: 133: Hoare quadruple {19183#false} {19183#false} #75#return; {19183#false} is VALID [2018-11-14 17:08:26,567 INFO L273 TraceCheckUtils]: 134: Hoare triple {19183#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; {19183#false} is VALID [2018-11-14 17:08:26,567 INFO L273 TraceCheckUtils]: 135: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:26,567 INFO L273 TraceCheckUtils]: 136: Hoare triple {19183#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 17:08:26,568 INFO L273 TraceCheckUtils]: 137: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 17:08:26,568 INFO L273 TraceCheckUtils]: 138: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:26,568 INFO L273 TraceCheckUtils]: 139: Hoare triple {19183#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 17:08:26,568 INFO L273 TraceCheckUtils]: 140: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 17:08:26,568 INFO L273 TraceCheckUtils]: 141: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:26,568 INFO L273 TraceCheckUtils]: 142: Hoare triple {19183#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 17:08:26,569 INFO L273 TraceCheckUtils]: 143: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 17:08:26,569 INFO L273 TraceCheckUtils]: 144: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:26,569 INFO L273 TraceCheckUtils]: 145: Hoare triple {19183#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 17:08:26,569 INFO L273 TraceCheckUtils]: 146: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 17:08:26,569 INFO L273 TraceCheckUtils]: 147: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:26,569 INFO L273 TraceCheckUtils]: 148: Hoare triple {19183#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 17:08:26,569 INFO L273 TraceCheckUtils]: 149: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 17:08:26,570 INFO L273 TraceCheckUtils]: 150: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:26,570 INFO L273 TraceCheckUtils]: 151: Hoare triple {19183#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 17:08:26,570 INFO L273 TraceCheckUtils]: 152: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 17:08:26,570 INFO L273 TraceCheckUtils]: 153: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:26,570 INFO L273 TraceCheckUtils]: 154: Hoare triple {19183#false} assume !(~i~2 < 9999); {19183#false} is VALID [2018-11-14 17:08:26,570 INFO L273 TraceCheckUtils]: 155: Hoare triple {19183#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {19183#false} is VALID [2018-11-14 17:08:26,570 INFO L256 TraceCheckUtils]: 156: Hoare triple {19183#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {19183#false} is VALID [2018-11-14 17:08:26,571 INFO L273 TraceCheckUtils]: 157: Hoare triple {19183#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; {19183#false} is VALID [2018-11-14 17:08:26,571 INFO L273 TraceCheckUtils]: 158: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:26,571 INFO L273 TraceCheckUtils]: 159: Hoare triple {19183#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 17:08:26,571 INFO L273 TraceCheckUtils]: 160: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 17:08:26,571 INFO L273 TraceCheckUtils]: 161: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:26,571 INFO L273 TraceCheckUtils]: 162: Hoare triple {19183#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 17:08:26,571 INFO L273 TraceCheckUtils]: 163: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 17:08:26,572 INFO L273 TraceCheckUtils]: 164: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:26,572 INFO L273 TraceCheckUtils]: 165: Hoare triple {19183#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 17:08:26,572 INFO L273 TraceCheckUtils]: 166: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 17:08:26,572 INFO L273 TraceCheckUtils]: 167: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:26,572 INFO L273 TraceCheckUtils]: 168: Hoare triple {19183#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 17:08:26,572 INFO L273 TraceCheckUtils]: 169: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 17:08:26,573 INFO L273 TraceCheckUtils]: 170: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:26,573 INFO L273 TraceCheckUtils]: 171: Hoare triple {19183#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 17:08:26,573 INFO L273 TraceCheckUtils]: 172: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 17:08:26,573 INFO L273 TraceCheckUtils]: 173: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:26,573 INFO L273 TraceCheckUtils]: 174: Hoare triple {19183#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 17:08:26,573 INFO L273 TraceCheckUtils]: 175: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 17:08:26,573 INFO L273 TraceCheckUtils]: 176: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:26,574 INFO L273 TraceCheckUtils]: 177: Hoare triple {19183#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 17:08:26,574 INFO L273 TraceCheckUtils]: 178: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 17:08:26,574 INFO L273 TraceCheckUtils]: 179: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:26,574 INFO L273 TraceCheckUtils]: 180: Hoare triple {19183#false} assume !(~i~0 < 10000); {19183#false} is VALID [2018-11-14 17:08:26,574 INFO L273 TraceCheckUtils]: 181: Hoare triple {19183#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19183#false} is VALID [2018-11-14 17:08:26,574 INFO L273 TraceCheckUtils]: 182: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:08:26,574 INFO L268 TraceCheckUtils]: 183: Hoare quadruple {19183#false} {19183#false} #77#return; {19183#false} is VALID [2018-11-14 17:08:26,575 INFO L273 TraceCheckUtils]: 184: Hoare triple {19183#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {19183#false} is VALID [2018-11-14 17:08:26,575 INFO L273 TraceCheckUtils]: 185: Hoare triple {19183#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {19183#false} is VALID [2018-11-14 17:08:26,575 INFO L273 TraceCheckUtils]: 186: Hoare triple {19183#false} assume !false; {19183#false} is VALID [2018-11-14 17:08:26,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1636 backedges. 356 proven. 77 refuted. 0 times theorem prover too weak. 1203 trivial. 0 not checked. [2018-11-14 17:08:26,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:26,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10] total 34 [2018-11-14 17:08:26,622 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 187 [2018-11-14 17:08:26,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:26,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-14 17:08:26,993 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:26,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-14 17:08:26,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-14 17:08:26,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 17:08:26,995 INFO L87 Difference]: Start difference. First operand 134 states and 138 transitions. Second operand 34 states. [2018-11-14 17:08:28,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:28,104 INFO L93 Difference]: Finished difference Result 199 states and 211 transitions. [2018-11-14 17:08:28,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-14 17:08:28,104 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 187 [2018-11-14 17:08:28,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:28,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 17:08:28,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 157 transitions. [2018-11-14 17:08:28,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 17:08:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 157 transitions. [2018-11-14 17:08:28,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 157 transitions. [2018-11-14 17:08:28,289 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:28,292 INFO L225 Difference]: With dead ends: 199 [2018-11-14 17:08:28,292 INFO L226 Difference]: Without dead ends: 142 [2018-11-14 17:08:28,293 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 17:08:28,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-14 17:08:28,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-11-14 17:08:28,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:28,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 140 states. [2018-11-14 17:08:28,334 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 140 states. [2018-11-14 17:08:28,334 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 140 states. [2018-11-14 17:08:28,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:28,336 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2018-11-14 17:08:28,336 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 146 transitions. [2018-11-14 17:08:28,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:28,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:28,337 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 142 states. [2018-11-14 17:08:28,337 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 142 states. [2018-11-14 17:08:28,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:28,340 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2018-11-14 17:08:28,340 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 146 transitions. [2018-11-14 17:08:28,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:28,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:28,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:28,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:28,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-14 17:08:28,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2018-11-14 17:08:28,344 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 187 [2018-11-14 17:08:28,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:28,344 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2018-11-14 17:08:28,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-14 17:08:28,344 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2018-11-14 17:08:28,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-14 17:08:28,345 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:28,345 INFO L375 BasicCegarLoop]: trace histogram [27, 25, 24, 24, 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:08:28,346 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:28,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:28,346 INFO L82 PathProgramCache]: Analyzing trace with hash -895619949, now seen corresponding path program 24 times [2018-11-14 17:08:28,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:28,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:28,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:28,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:08:28,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:28,869 INFO L256 TraceCheckUtils]: 0: Hoare triple {20516#true} call ULTIMATE.init(); {20516#true} is VALID [2018-11-14 17:08:28,870 INFO L273 TraceCheckUtils]: 1: Hoare triple {20516#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20516#true} is VALID [2018-11-14 17:08:28,870 INFO L273 TraceCheckUtils]: 2: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,870 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20516#true} {20516#true} #69#return; {20516#true} is VALID [2018-11-14 17:08:28,870 INFO L256 TraceCheckUtils]: 4: Hoare triple {20516#true} call #t~ret13 := main(); {20516#true} is VALID [2018-11-14 17:08:28,871 INFO L273 TraceCheckUtils]: 5: Hoare triple {20516#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; {20518#(= main_~i~1 0)} is VALID [2018-11-14 17:08:28,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {20518#(= main_~i~1 0)} assume true; {20518#(= main_~i~1 0)} is VALID [2018-11-14 17:08:28,872 INFO L273 TraceCheckUtils]: 7: Hoare triple {20518#(= 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; {20518#(= main_~i~1 0)} is VALID [2018-11-14 17:08:28,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {20518#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20519#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:28,873 INFO L273 TraceCheckUtils]: 9: Hoare triple {20519#(<= main_~i~1 1)} assume true; {20519#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:28,873 INFO L273 TraceCheckUtils]: 10: Hoare triple {20519#(<= 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; {20519#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:28,874 INFO L273 TraceCheckUtils]: 11: Hoare triple {20519#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20520#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:28,874 INFO L273 TraceCheckUtils]: 12: Hoare triple {20520#(<= main_~i~1 2)} assume true; {20520#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:28,875 INFO L273 TraceCheckUtils]: 13: Hoare triple {20520#(<= 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; {20520#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:28,875 INFO L273 TraceCheckUtils]: 14: Hoare triple {20520#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20521#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:28,876 INFO L273 TraceCheckUtils]: 15: Hoare triple {20521#(<= main_~i~1 3)} assume true; {20521#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:28,876 INFO L273 TraceCheckUtils]: 16: Hoare triple {20521#(<= 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; {20521#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:28,877 INFO L273 TraceCheckUtils]: 17: Hoare triple {20521#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20522#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:28,877 INFO L273 TraceCheckUtils]: 18: Hoare triple {20522#(<= main_~i~1 4)} assume true; {20522#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:28,878 INFO L273 TraceCheckUtils]: 19: Hoare triple {20522#(<= 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; {20522#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:28,878 INFO L273 TraceCheckUtils]: 20: Hoare triple {20522#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20523#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:28,879 INFO L273 TraceCheckUtils]: 21: Hoare triple {20523#(<= main_~i~1 5)} assume true; {20523#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:28,879 INFO L273 TraceCheckUtils]: 22: Hoare triple {20523#(<= 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; {20523#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:28,880 INFO L273 TraceCheckUtils]: 23: Hoare triple {20523#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20524#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:28,881 INFO L273 TraceCheckUtils]: 24: Hoare triple {20524#(<= main_~i~1 6)} assume true; {20524#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:28,881 INFO L273 TraceCheckUtils]: 25: Hoare triple {20524#(<= 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; {20524#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:28,882 INFO L273 TraceCheckUtils]: 26: Hoare triple {20524#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20525#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:28,882 INFO L273 TraceCheckUtils]: 27: Hoare triple {20525#(<= main_~i~1 7)} assume true; {20525#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:28,883 INFO L273 TraceCheckUtils]: 28: Hoare triple {20525#(<= 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; {20525#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:28,884 INFO L273 TraceCheckUtils]: 29: Hoare triple {20525#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20526#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:28,884 INFO L273 TraceCheckUtils]: 30: Hoare triple {20526#(<= main_~i~1 8)} assume true; {20526#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:28,885 INFO L273 TraceCheckUtils]: 31: Hoare triple {20526#(<= 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; {20526#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:28,885 INFO L273 TraceCheckUtils]: 32: Hoare triple {20526#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20527#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:28,886 INFO L273 TraceCheckUtils]: 33: Hoare triple {20527#(<= main_~i~1 9)} assume true; {20527#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:28,886 INFO L273 TraceCheckUtils]: 34: Hoare triple {20527#(<= 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; {20527#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:28,887 INFO L273 TraceCheckUtils]: 35: Hoare triple {20527#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20528#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:28,887 INFO L273 TraceCheckUtils]: 36: Hoare triple {20528#(<= main_~i~1 10)} assume true; {20528#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:28,888 INFO L273 TraceCheckUtils]: 37: Hoare triple {20528#(<= 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; {20528#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:28,889 INFO L273 TraceCheckUtils]: 38: Hoare triple {20528#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20529#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:28,889 INFO L273 TraceCheckUtils]: 39: Hoare triple {20529#(<= main_~i~1 11)} assume true; {20529#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:28,890 INFO L273 TraceCheckUtils]: 40: Hoare triple {20529#(<= 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; {20529#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:28,890 INFO L273 TraceCheckUtils]: 41: Hoare triple {20529#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20530#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:28,891 INFO L273 TraceCheckUtils]: 42: Hoare triple {20530#(<= main_~i~1 12)} assume true; {20530#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:28,891 INFO L273 TraceCheckUtils]: 43: Hoare triple {20530#(<= 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; {20530#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:28,892 INFO L273 TraceCheckUtils]: 44: Hoare triple {20530#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20531#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:28,893 INFO L273 TraceCheckUtils]: 45: Hoare triple {20531#(<= main_~i~1 13)} assume true; {20531#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:28,893 INFO L273 TraceCheckUtils]: 46: Hoare triple {20531#(<= 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; {20531#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:28,894 INFO L273 TraceCheckUtils]: 47: Hoare triple {20531#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20532#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:28,894 INFO L273 TraceCheckUtils]: 48: Hoare triple {20532#(<= main_~i~1 14)} assume true; {20532#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:28,895 INFO L273 TraceCheckUtils]: 49: Hoare triple {20532#(<= 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; {20532#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:28,896 INFO L273 TraceCheckUtils]: 50: Hoare triple {20532#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20533#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:28,896 INFO L273 TraceCheckUtils]: 51: Hoare triple {20533#(<= main_~i~1 15)} assume true; {20533#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:28,897 INFO L273 TraceCheckUtils]: 52: Hoare triple {20533#(<= 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; {20533#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:28,897 INFO L273 TraceCheckUtils]: 53: Hoare triple {20533#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20534#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:28,898 INFO L273 TraceCheckUtils]: 54: Hoare triple {20534#(<= main_~i~1 16)} assume true; {20534#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:28,898 INFO L273 TraceCheckUtils]: 55: Hoare triple {20534#(<= 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; {20534#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:28,899 INFO L273 TraceCheckUtils]: 56: Hoare triple {20534#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20535#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:28,899 INFO L273 TraceCheckUtils]: 57: Hoare triple {20535#(<= main_~i~1 17)} assume true; {20535#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:28,900 INFO L273 TraceCheckUtils]: 58: Hoare triple {20535#(<= 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; {20535#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:28,900 INFO L273 TraceCheckUtils]: 59: Hoare triple {20535#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20536#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:28,901 INFO L273 TraceCheckUtils]: 60: Hoare triple {20536#(<= main_~i~1 18)} assume true; {20536#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:28,901 INFO L273 TraceCheckUtils]: 61: Hoare triple {20536#(<= 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; {20536#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:28,902 INFO L273 TraceCheckUtils]: 62: Hoare triple {20536#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20537#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:28,903 INFO L273 TraceCheckUtils]: 63: Hoare triple {20537#(<= main_~i~1 19)} assume true; {20537#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:28,903 INFO L273 TraceCheckUtils]: 64: Hoare triple {20537#(<= 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; {20537#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:28,904 INFO L273 TraceCheckUtils]: 65: Hoare triple {20537#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20538#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:28,904 INFO L273 TraceCheckUtils]: 66: Hoare triple {20538#(<= main_~i~1 20)} assume true; {20538#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:28,905 INFO L273 TraceCheckUtils]: 67: Hoare triple {20538#(<= 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; {20538#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:28,905 INFO L273 TraceCheckUtils]: 68: Hoare triple {20538#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20539#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:28,906 INFO L273 TraceCheckUtils]: 69: Hoare triple {20539#(<= main_~i~1 21)} assume true; {20539#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:28,906 INFO L273 TraceCheckUtils]: 70: Hoare triple {20539#(<= 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; {20539#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:28,907 INFO L273 TraceCheckUtils]: 71: Hoare triple {20539#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20540#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:28,908 INFO L273 TraceCheckUtils]: 72: Hoare triple {20540#(<= main_~i~1 22)} assume true; {20540#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:28,908 INFO L273 TraceCheckUtils]: 73: Hoare triple {20540#(<= 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; {20540#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:28,909 INFO L273 TraceCheckUtils]: 74: Hoare triple {20540#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20541#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:28,909 INFO L273 TraceCheckUtils]: 75: Hoare triple {20541#(<= main_~i~1 23)} assume true; {20541#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:28,910 INFO L273 TraceCheckUtils]: 76: Hoare triple {20541#(<= 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; {20541#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:28,910 INFO L273 TraceCheckUtils]: 77: Hoare triple {20541#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20542#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:28,911 INFO L273 TraceCheckUtils]: 78: Hoare triple {20542#(<= main_~i~1 24)} assume true; {20542#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:28,911 INFO L273 TraceCheckUtils]: 79: Hoare triple {20542#(<= main_~i~1 24)} assume !(~i~1 < 10000); {20517#false} is VALID [2018-11-14 17:08:28,912 INFO L256 TraceCheckUtils]: 80: Hoare triple {20517#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {20516#true} is VALID [2018-11-14 17:08:28,912 INFO L273 TraceCheckUtils]: 81: Hoare triple {20516#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; {20516#true} is VALID [2018-11-14 17:08:28,912 INFO L273 TraceCheckUtils]: 82: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,912 INFO L273 TraceCheckUtils]: 83: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:28,912 INFO L273 TraceCheckUtils]: 84: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:28,912 INFO L273 TraceCheckUtils]: 85: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,913 INFO L273 TraceCheckUtils]: 86: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:28,913 INFO L273 TraceCheckUtils]: 87: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:28,913 INFO L273 TraceCheckUtils]: 88: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,913 INFO L273 TraceCheckUtils]: 89: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:28,914 INFO L273 TraceCheckUtils]: 90: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:28,914 INFO L273 TraceCheckUtils]: 91: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,914 INFO L273 TraceCheckUtils]: 92: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:28,914 INFO L273 TraceCheckUtils]: 93: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:28,915 INFO L273 TraceCheckUtils]: 94: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,915 INFO L273 TraceCheckUtils]: 95: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:28,915 INFO L273 TraceCheckUtils]: 96: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:28,915 INFO L273 TraceCheckUtils]: 97: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,915 INFO L273 TraceCheckUtils]: 98: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:28,916 INFO L273 TraceCheckUtils]: 99: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:28,916 INFO L273 TraceCheckUtils]: 100: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,916 INFO L273 TraceCheckUtils]: 101: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:28,916 INFO L273 TraceCheckUtils]: 102: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:28,916 INFO L273 TraceCheckUtils]: 103: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,916 INFO L273 TraceCheckUtils]: 104: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:28,916 INFO L273 TraceCheckUtils]: 105: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:28,916 INFO L273 TraceCheckUtils]: 106: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,917 INFO L273 TraceCheckUtils]: 107: Hoare triple {20516#true} assume !(~i~0 < 10000); {20516#true} is VALID [2018-11-14 17:08:28,917 INFO L273 TraceCheckUtils]: 108: Hoare triple {20516#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20516#true} is VALID [2018-11-14 17:08:28,917 INFO L273 TraceCheckUtils]: 109: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,917 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {20516#true} {20517#false} #73#return; {20517#false} is VALID [2018-11-14 17:08:28,917 INFO L273 TraceCheckUtils]: 111: Hoare triple {20517#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); {20517#false} is VALID [2018-11-14 17:08:28,917 INFO L256 TraceCheckUtils]: 112: Hoare triple {20517#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {20516#true} is VALID [2018-11-14 17:08:28,917 INFO L273 TraceCheckUtils]: 113: Hoare triple {20516#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; {20516#true} is VALID [2018-11-14 17:08:28,917 INFO L273 TraceCheckUtils]: 114: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,917 INFO L273 TraceCheckUtils]: 115: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:28,917 INFO L273 TraceCheckUtils]: 116: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:28,918 INFO L273 TraceCheckUtils]: 117: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,918 INFO L273 TraceCheckUtils]: 118: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:28,918 INFO L273 TraceCheckUtils]: 119: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:28,918 INFO L273 TraceCheckUtils]: 120: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,918 INFO L273 TraceCheckUtils]: 121: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:28,918 INFO L273 TraceCheckUtils]: 122: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:28,918 INFO L273 TraceCheckUtils]: 123: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,918 INFO L273 TraceCheckUtils]: 124: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:28,918 INFO L273 TraceCheckUtils]: 125: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:28,918 INFO L273 TraceCheckUtils]: 126: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,919 INFO L273 TraceCheckUtils]: 127: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:28,919 INFO L273 TraceCheckUtils]: 128: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:28,919 INFO L273 TraceCheckUtils]: 129: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,919 INFO L273 TraceCheckUtils]: 130: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:28,919 INFO L273 TraceCheckUtils]: 131: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:28,919 INFO L273 TraceCheckUtils]: 132: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,919 INFO L273 TraceCheckUtils]: 133: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:28,919 INFO L273 TraceCheckUtils]: 134: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:28,919 INFO L273 TraceCheckUtils]: 135: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,919 INFO L273 TraceCheckUtils]: 136: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:28,920 INFO L273 TraceCheckUtils]: 137: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:28,920 INFO L273 TraceCheckUtils]: 138: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,920 INFO L273 TraceCheckUtils]: 139: Hoare triple {20516#true} assume !(~i~0 < 10000); {20516#true} is VALID [2018-11-14 17:08:28,920 INFO L273 TraceCheckUtils]: 140: Hoare triple {20516#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20516#true} is VALID [2018-11-14 17:08:28,920 INFO L273 TraceCheckUtils]: 141: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,920 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {20516#true} {20517#false} #75#return; {20517#false} is VALID [2018-11-14 17:08:28,920 INFO L273 TraceCheckUtils]: 143: Hoare triple {20517#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; {20517#false} is VALID [2018-11-14 17:08:28,920 INFO L273 TraceCheckUtils]: 144: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:08:28,920 INFO L273 TraceCheckUtils]: 145: Hoare triple {20517#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20517#false} is VALID [2018-11-14 17:08:28,921 INFO L273 TraceCheckUtils]: 146: Hoare triple {20517#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20517#false} is VALID [2018-11-14 17:08:28,921 INFO L273 TraceCheckUtils]: 147: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:08:28,921 INFO L273 TraceCheckUtils]: 148: Hoare triple {20517#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20517#false} is VALID [2018-11-14 17:08:28,921 INFO L273 TraceCheckUtils]: 149: Hoare triple {20517#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20517#false} is VALID [2018-11-14 17:08:28,921 INFO L273 TraceCheckUtils]: 150: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:08:28,921 INFO L273 TraceCheckUtils]: 151: Hoare triple {20517#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20517#false} is VALID [2018-11-14 17:08:28,921 INFO L273 TraceCheckUtils]: 152: Hoare triple {20517#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20517#false} is VALID [2018-11-14 17:08:28,921 INFO L273 TraceCheckUtils]: 153: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:08:28,921 INFO L273 TraceCheckUtils]: 154: Hoare triple {20517#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20517#false} is VALID [2018-11-14 17:08:28,921 INFO L273 TraceCheckUtils]: 155: Hoare triple {20517#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20517#false} is VALID [2018-11-14 17:08:28,922 INFO L273 TraceCheckUtils]: 156: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:08:28,922 INFO L273 TraceCheckUtils]: 157: Hoare triple {20517#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20517#false} is VALID [2018-11-14 17:08:28,922 INFO L273 TraceCheckUtils]: 158: Hoare triple {20517#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20517#false} is VALID [2018-11-14 17:08:28,922 INFO L273 TraceCheckUtils]: 159: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:08:28,922 INFO L273 TraceCheckUtils]: 160: Hoare triple {20517#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20517#false} is VALID [2018-11-14 17:08:28,922 INFO L273 TraceCheckUtils]: 161: Hoare triple {20517#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20517#false} is VALID [2018-11-14 17:08:28,922 INFO L273 TraceCheckUtils]: 162: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:08:28,922 INFO L273 TraceCheckUtils]: 163: Hoare triple {20517#false} assume !(~i~2 < 9999); {20517#false} is VALID [2018-11-14 17:08:28,922 INFO L273 TraceCheckUtils]: 164: Hoare triple {20517#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {20517#false} is VALID [2018-11-14 17:08:28,922 INFO L256 TraceCheckUtils]: 165: Hoare triple {20517#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {20516#true} is VALID [2018-11-14 17:08:28,923 INFO L273 TraceCheckUtils]: 166: Hoare triple {20516#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; {20516#true} is VALID [2018-11-14 17:08:28,923 INFO L273 TraceCheckUtils]: 167: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,923 INFO L273 TraceCheckUtils]: 168: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:28,923 INFO L273 TraceCheckUtils]: 169: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:28,923 INFO L273 TraceCheckUtils]: 170: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,923 INFO L273 TraceCheckUtils]: 171: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:28,923 INFO L273 TraceCheckUtils]: 172: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:28,923 INFO L273 TraceCheckUtils]: 173: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,923 INFO L273 TraceCheckUtils]: 174: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:28,924 INFO L273 TraceCheckUtils]: 175: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:28,924 INFO L273 TraceCheckUtils]: 176: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,924 INFO L273 TraceCheckUtils]: 177: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:28,924 INFO L273 TraceCheckUtils]: 178: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:28,924 INFO L273 TraceCheckUtils]: 179: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,924 INFO L273 TraceCheckUtils]: 180: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:28,924 INFO L273 TraceCheckUtils]: 181: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:28,924 INFO L273 TraceCheckUtils]: 182: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,924 INFO L273 TraceCheckUtils]: 183: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:28,924 INFO L273 TraceCheckUtils]: 184: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:28,925 INFO L273 TraceCheckUtils]: 185: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,925 INFO L273 TraceCheckUtils]: 186: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:28,925 INFO L273 TraceCheckUtils]: 187: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:28,925 INFO L273 TraceCheckUtils]: 188: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,925 INFO L273 TraceCheckUtils]: 189: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:28,925 INFO L273 TraceCheckUtils]: 190: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:28,925 INFO L273 TraceCheckUtils]: 191: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,925 INFO L273 TraceCheckUtils]: 192: Hoare triple {20516#true} assume !(~i~0 < 10000); {20516#true} is VALID [2018-11-14 17:08:28,925 INFO L273 TraceCheckUtils]: 193: Hoare triple {20516#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20516#true} is VALID [2018-11-14 17:08:28,925 INFO L273 TraceCheckUtils]: 194: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:28,926 INFO L268 TraceCheckUtils]: 195: Hoare quadruple {20516#true} {20517#false} #77#return; {20517#false} is VALID [2018-11-14 17:08:28,926 INFO L273 TraceCheckUtils]: 196: Hoare triple {20517#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {20517#false} is VALID [2018-11-14 17:08:28,926 INFO L273 TraceCheckUtils]: 197: Hoare triple {20517#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {20517#false} is VALID [2018-11-14 17:08:28,926 INFO L273 TraceCheckUtils]: 198: Hoare triple {20517#false} assume !false; {20517#false} is VALID [2018-11-14 17:08:28,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1923 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2018-11-14 17:08:28,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:28,946 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:08:28,954 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:08:29,812 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-11-14 17:08:29,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:08:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:29,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:30,103 INFO L256 TraceCheckUtils]: 0: Hoare triple {20516#true} call ULTIMATE.init(); {20516#true} is VALID [2018-11-14 17:08:30,103 INFO L273 TraceCheckUtils]: 1: Hoare triple {20516#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20516#true} is VALID [2018-11-14 17:08:30,103 INFO L273 TraceCheckUtils]: 2: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,103 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20516#true} {20516#true} #69#return; {20516#true} is VALID [2018-11-14 17:08:30,104 INFO L256 TraceCheckUtils]: 4: Hoare triple {20516#true} call #t~ret13 := main(); {20516#true} is VALID [2018-11-14 17:08:30,104 INFO L273 TraceCheckUtils]: 5: Hoare triple {20516#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; {20516#true} is VALID [2018-11-14 17:08:30,104 INFO L273 TraceCheckUtils]: 6: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,104 INFO L273 TraceCheckUtils]: 7: Hoare triple {20516#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:08:30,104 INFO L273 TraceCheckUtils]: 8: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:08:30,104 INFO L273 TraceCheckUtils]: 9: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,104 INFO L273 TraceCheckUtils]: 10: Hoare triple {20516#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:08:30,105 INFO L273 TraceCheckUtils]: 11: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:08:30,105 INFO L273 TraceCheckUtils]: 12: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,105 INFO L273 TraceCheckUtils]: 13: Hoare triple {20516#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:08:30,105 INFO L273 TraceCheckUtils]: 14: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:08:30,105 INFO L273 TraceCheckUtils]: 15: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,105 INFO L273 TraceCheckUtils]: 16: Hoare triple {20516#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:08:30,105 INFO L273 TraceCheckUtils]: 17: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:08:30,105 INFO L273 TraceCheckUtils]: 18: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,105 INFO L273 TraceCheckUtils]: 19: Hoare triple {20516#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:08:30,105 INFO L273 TraceCheckUtils]: 20: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:08:30,106 INFO L273 TraceCheckUtils]: 21: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,106 INFO L273 TraceCheckUtils]: 22: Hoare triple {20516#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:08:30,106 INFO L273 TraceCheckUtils]: 23: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:08:30,106 INFO L273 TraceCheckUtils]: 24: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,106 INFO L273 TraceCheckUtils]: 25: Hoare triple {20516#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:08:30,106 INFO L273 TraceCheckUtils]: 26: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:08:30,106 INFO L273 TraceCheckUtils]: 27: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,106 INFO L273 TraceCheckUtils]: 28: Hoare triple {20516#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:08:30,106 INFO L273 TraceCheckUtils]: 29: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:08:30,106 INFO L273 TraceCheckUtils]: 30: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,107 INFO L273 TraceCheckUtils]: 31: Hoare triple {20516#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:08:30,107 INFO L273 TraceCheckUtils]: 32: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:08:30,107 INFO L273 TraceCheckUtils]: 33: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,107 INFO L273 TraceCheckUtils]: 34: Hoare triple {20516#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:08:30,107 INFO L273 TraceCheckUtils]: 35: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:08:30,107 INFO L273 TraceCheckUtils]: 36: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,107 INFO L273 TraceCheckUtils]: 37: Hoare triple {20516#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:08:30,107 INFO L273 TraceCheckUtils]: 38: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:08:30,107 INFO L273 TraceCheckUtils]: 39: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,107 INFO L273 TraceCheckUtils]: 40: Hoare triple {20516#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:08:30,108 INFO L273 TraceCheckUtils]: 41: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:08:30,108 INFO L273 TraceCheckUtils]: 42: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,108 INFO L273 TraceCheckUtils]: 43: Hoare triple {20516#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:08:30,108 INFO L273 TraceCheckUtils]: 44: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:08:30,108 INFO L273 TraceCheckUtils]: 45: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,108 INFO L273 TraceCheckUtils]: 46: Hoare triple {20516#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:08:30,108 INFO L273 TraceCheckUtils]: 47: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:08:30,108 INFO L273 TraceCheckUtils]: 48: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,108 INFO L273 TraceCheckUtils]: 49: Hoare triple {20516#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:08:30,109 INFO L273 TraceCheckUtils]: 50: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:08:30,109 INFO L273 TraceCheckUtils]: 51: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,109 INFO L273 TraceCheckUtils]: 52: Hoare triple {20516#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:08:30,109 INFO L273 TraceCheckUtils]: 53: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:08:30,109 INFO L273 TraceCheckUtils]: 54: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,109 INFO L273 TraceCheckUtils]: 55: Hoare triple {20516#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:08:30,109 INFO L273 TraceCheckUtils]: 56: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:08:30,109 INFO L273 TraceCheckUtils]: 57: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,109 INFO L273 TraceCheckUtils]: 58: Hoare triple {20516#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:08:30,109 INFO L273 TraceCheckUtils]: 59: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:08:30,110 INFO L273 TraceCheckUtils]: 60: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,110 INFO L273 TraceCheckUtils]: 61: Hoare triple {20516#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:08:30,110 INFO L273 TraceCheckUtils]: 62: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:08:30,110 INFO L273 TraceCheckUtils]: 63: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,110 INFO L273 TraceCheckUtils]: 64: Hoare triple {20516#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:08:30,110 INFO L273 TraceCheckUtils]: 65: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:08:30,110 INFO L273 TraceCheckUtils]: 66: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,110 INFO L273 TraceCheckUtils]: 67: Hoare triple {20516#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:08:30,110 INFO L273 TraceCheckUtils]: 68: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:08:30,111 INFO L273 TraceCheckUtils]: 69: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,111 INFO L273 TraceCheckUtils]: 70: Hoare triple {20516#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:08:30,111 INFO L273 TraceCheckUtils]: 71: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:08:30,111 INFO L273 TraceCheckUtils]: 72: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,111 INFO L273 TraceCheckUtils]: 73: Hoare triple {20516#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:08:30,111 INFO L273 TraceCheckUtils]: 74: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:08:30,111 INFO L273 TraceCheckUtils]: 75: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,111 INFO L273 TraceCheckUtils]: 76: Hoare triple {20516#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:08:30,111 INFO L273 TraceCheckUtils]: 77: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:08:30,111 INFO L273 TraceCheckUtils]: 78: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,112 INFO L273 TraceCheckUtils]: 79: Hoare triple {20516#true} assume !(~i~1 < 10000); {20516#true} is VALID [2018-11-14 17:08:30,112 INFO L256 TraceCheckUtils]: 80: Hoare triple {20516#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {20516#true} is VALID [2018-11-14 17:08:30,112 INFO L273 TraceCheckUtils]: 81: Hoare triple {20516#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; {20516#true} is VALID [2018-11-14 17:08:30,112 INFO L273 TraceCheckUtils]: 82: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,112 INFO L273 TraceCheckUtils]: 83: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:30,112 INFO L273 TraceCheckUtils]: 84: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:30,112 INFO L273 TraceCheckUtils]: 85: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,112 INFO L273 TraceCheckUtils]: 86: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:30,112 INFO L273 TraceCheckUtils]: 87: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:30,112 INFO L273 TraceCheckUtils]: 88: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,113 INFO L273 TraceCheckUtils]: 89: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:30,113 INFO L273 TraceCheckUtils]: 90: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:30,113 INFO L273 TraceCheckUtils]: 91: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,113 INFO L273 TraceCheckUtils]: 92: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:30,113 INFO L273 TraceCheckUtils]: 93: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:30,113 INFO L273 TraceCheckUtils]: 94: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,113 INFO L273 TraceCheckUtils]: 95: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:30,113 INFO L273 TraceCheckUtils]: 96: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:30,113 INFO L273 TraceCheckUtils]: 97: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,113 INFO L273 TraceCheckUtils]: 98: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:30,114 INFO L273 TraceCheckUtils]: 99: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:30,114 INFO L273 TraceCheckUtils]: 100: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,114 INFO L273 TraceCheckUtils]: 101: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:30,114 INFO L273 TraceCheckUtils]: 102: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:30,114 INFO L273 TraceCheckUtils]: 103: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,114 INFO L273 TraceCheckUtils]: 104: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:30,114 INFO L273 TraceCheckUtils]: 105: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:30,114 INFO L273 TraceCheckUtils]: 106: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,114 INFO L273 TraceCheckUtils]: 107: Hoare triple {20516#true} assume !(~i~0 < 10000); {20516#true} is VALID [2018-11-14 17:08:30,115 INFO L273 TraceCheckUtils]: 108: Hoare triple {20516#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20516#true} is VALID [2018-11-14 17:08:30,115 INFO L273 TraceCheckUtils]: 109: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,115 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {20516#true} {20516#true} #73#return; {20516#true} is VALID [2018-11-14 17:08:30,115 INFO L273 TraceCheckUtils]: 111: Hoare triple {20516#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); {20516#true} is VALID [2018-11-14 17:08:30,115 INFO L256 TraceCheckUtils]: 112: Hoare triple {20516#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {20516#true} is VALID [2018-11-14 17:08:30,115 INFO L273 TraceCheckUtils]: 113: Hoare triple {20516#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; {20516#true} is VALID [2018-11-14 17:08:30,115 INFO L273 TraceCheckUtils]: 114: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,115 INFO L273 TraceCheckUtils]: 115: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:30,115 INFO L273 TraceCheckUtils]: 116: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:30,115 INFO L273 TraceCheckUtils]: 117: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,116 INFO L273 TraceCheckUtils]: 118: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:30,116 INFO L273 TraceCheckUtils]: 119: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:30,116 INFO L273 TraceCheckUtils]: 120: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,116 INFO L273 TraceCheckUtils]: 121: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:30,116 INFO L273 TraceCheckUtils]: 122: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:30,116 INFO L273 TraceCheckUtils]: 123: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,116 INFO L273 TraceCheckUtils]: 124: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:30,116 INFO L273 TraceCheckUtils]: 125: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:30,116 INFO L273 TraceCheckUtils]: 126: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,116 INFO L273 TraceCheckUtils]: 127: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:30,117 INFO L273 TraceCheckUtils]: 128: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:30,117 INFO L273 TraceCheckUtils]: 129: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,117 INFO L273 TraceCheckUtils]: 130: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:30,117 INFO L273 TraceCheckUtils]: 131: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:30,117 INFO L273 TraceCheckUtils]: 132: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,117 INFO L273 TraceCheckUtils]: 133: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:30,117 INFO L273 TraceCheckUtils]: 134: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:30,117 INFO L273 TraceCheckUtils]: 135: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,117 INFO L273 TraceCheckUtils]: 136: Hoare triple {20516#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:08:30,118 INFO L273 TraceCheckUtils]: 137: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:08:30,118 INFO L273 TraceCheckUtils]: 138: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,118 INFO L273 TraceCheckUtils]: 139: Hoare triple {20516#true} assume !(~i~0 < 10000); {20516#true} is VALID [2018-11-14 17:08:30,118 INFO L273 TraceCheckUtils]: 140: Hoare triple {20516#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20516#true} is VALID [2018-11-14 17:08:30,118 INFO L273 TraceCheckUtils]: 141: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:08:30,118 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {20516#true} {20516#true} #75#return; {20516#true} is VALID [2018-11-14 17:08:30,119 INFO L273 TraceCheckUtils]: 143: Hoare triple {20516#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; {20975#(<= main_~i~2 0)} is VALID [2018-11-14 17:08:30,119 INFO L273 TraceCheckUtils]: 144: Hoare triple {20975#(<= main_~i~2 0)} assume true; {20975#(<= main_~i~2 0)} is VALID [2018-11-14 17:08:30,119 INFO L273 TraceCheckUtils]: 145: Hoare triple {20975#(<= 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; {20975#(<= main_~i~2 0)} is VALID [2018-11-14 17:08:30,120 INFO L273 TraceCheckUtils]: 146: Hoare triple {20975#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20985#(<= main_~i~2 1)} is VALID [2018-11-14 17:08:30,120 INFO L273 TraceCheckUtils]: 147: Hoare triple {20985#(<= main_~i~2 1)} assume true; {20985#(<= main_~i~2 1)} is VALID [2018-11-14 17:08:30,120 INFO L273 TraceCheckUtils]: 148: Hoare triple {20985#(<= 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; {20985#(<= main_~i~2 1)} is VALID [2018-11-14 17:08:30,121 INFO L273 TraceCheckUtils]: 149: Hoare triple {20985#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20995#(<= main_~i~2 2)} is VALID [2018-11-14 17:08:30,121 INFO L273 TraceCheckUtils]: 150: Hoare triple {20995#(<= main_~i~2 2)} assume true; {20995#(<= main_~i~2 2)} is VALID [2018-11-14 17:08:30,121 INFO L273 TraceCheckUtils]: 151: Hoare triple {20995#(<= 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; {20995#(<= main_~i~2 2)} is VALID [2018-11-14 17:08:30,122 INFO L273 TraceCheckUtils]: 152: Hoare triple {20995#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21005#(<= main_~i~2 3)} is VALID [2018-11-14 17:08:30,122 INFO L273 TraceCheckUtils]: 153: Hoare triple {21005#(<= main_~i~2 3)} assume true; {21005#(<= main_~i~2 3)} is VALID [2018-11-14 17:08:30,123 INFO L273 TraceCheckUtils]: 154: Hoare triple {21005#(<= 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; {21005#(<= main_~i~2 3)} is VALID [2018-11-14 17:08:30,123 INFO L273 TraceCheckUtils]: 155: Hoare triple {21005#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21015#(<= main_~i~2 4)} is VALID [2018-11-14 17:08:30,124 INFO L273 TraceCheckUtils]: 156: Hoare triple {21015#(<= main_~i~2 4)} assume true; {21015#(<= main_~i~2 4)} is VALID [2018-11-14 17:08:30,124 INFO L273 TraceCheckUtils]: 157: Hoare triple {21015#(<= 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; {21015#(<= main_~i~2 4)} is VALID [2018-11-14 17:08:30,125 INFO L273 TraceCheckUtils]: 158: Hoare triple {21015#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21025#(<= main_~i~2 5)} is VALID [2018-11-14 17:08:30,126 INFO L273 TraceCheckUtils]: 159: Hoare triple {21025#(<= main_~i~2 5)} assume true; {21025#(<= main_~i~2 5)} is VALID [2018-11-14 17:08:30,126 INFO L273 TraceCheckUtils]: 160: Hoare triple {21025#(<= 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; {21025#(<= main_~i~2 5)} is VALID [2018-11-14 17:08:30,127 INFO L273 TraceCheckUtils]: 161: Hoare triple {21025#(<= main_~i~2 5)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21035#(<= main_~i~2 6)} is VALID [2018-11-14 17:08:30,127 INFO L273 TraceCheckUtils]: 162: Hoare triple {21035#(<= main_~i~2 6)} assume true; {21035#(<= main_~i~2 6)} is VALID [2018-11-14 17:08:30,128 INFO L273 TraceCheckUtils]: 163: Hoare triple {21035#(<= main_~i~2 6)} assume !(~i~2 < 9999); {20517#false} is VALID [2018-11-14 17:08:30,128 INFO L273 TraceCheckUtils]: 164: Hoare triple {20517#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {20517#false} is VALID [2018-11-14 17:08:30,128 INFO L256 TraceCheckUtils]: 165: Hoare triple {20517#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {20517#false} is VALID [2018-11-14 17:08:30,129 INFO L273 TraceCheckUtils]: 166: Hoare triple {20517#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; {20517#false} is VALID [2018-11-14 17:08:30,129 INFO L273 TraceCheckUtils]: 167: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:08:30,129 INFO L273 TraceCheckUtils]: 168: Hoare triple {20517#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20517#false} is VALID [2018-11-14 17:08:30,129 INFO L273 TraceCheckUtils]: 169: Hoare triple {20517#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20517#false} is VALID [2018-11-14 17:08:30,129 INFO L273 TraceCheckUtils]: 170: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:08:30,129 INFO L273 TraceCheckUtils]: 171: Hoare triple {20517#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20517#false} is VALID [2018-11-14 17:08:30,130 INFO L273 TraceCheckUtils]: 172: Hoare triple {20517#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20517#false} is VALID [2018-11-14 17:08:30,130 INFO L273 TraceCheckUtils]: 173: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:08:30,130 INFO L273 TraceCheckUtils]: 174: Hoare triple {20517#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20517#false} is VALID [2018-11-14 17:08:30,130 INFO L273 TraceCheckUtils]: 175: Hoare triple {20517#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20517#false} is VALID [2018-11-14 17:08:30,130 INFO L273 TraceCheckUtils]: 176: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:08:30,130 INFO L273 TraceCheckUtils]: 177: Hoare triple {20517#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20517#false} is VALID [2018-11-14 17:08:30,131 INFO L273 TraceCheckUtils]: 178: Hoare triple {20517#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20517#false} is VALID [2018-11-14 17:08:30,131 INFO L273 TraceCheckUtils]: 179: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:08:30,131 INFO L273 TraceCheckUtils]: 180: Hoare triple {20517#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20517#false} is VALID [2018-11-14 17:08:30,131 INFO L273 TraceCheckUtils]: 181: Hoare triple {20517#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20517#false} is VALID [2018-11-14 17:08:30,131 INFO L273 TraceCheckUtils]: 182: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:08:30,132 INFO L273 TraceCheckUtils]: 183: Hoare triple {20517#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20517#false} is VALID [2018-11-14 17:08:30,132 INFO L273 TraceCheckUtils]: 184: Hoare triple {20517#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20517#false} is VALID [2018-11-14 17:08:30,132 INFO L273 TraceCheckUtils]: 185: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:08:30,132 INFO L273 TraceCheckUtils]: 186: Hoare triple {20517#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20517#false} is VALID [2018-11-14 17:08:30,132 INFO L273 TraceCheckUtils]: 187: Hoare triple {20517#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20517#false} is VALID [2018-11-14 17:08:30,132 INFO L273 TraceCheckUtils]: 188: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:08:30,132 INFO L273 TraceCheckUtils]: 189: Hoare triple {20517#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20517#false} is VALID [2018-11-14 17:08:30,133 INFO L273 TraceCheckUtils]: 190: Hoare triple {20517#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20517#false} is VALID [2018-11-14 17:08:30,133 INFO L273 TraceCheckUtils]: 191: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:08:30,133 INFO L273 TraceCheckUtils]: 192: Hoare triple {20517#false} assume !(~i~0 < 10000); {20517#false} is VALID [2018-11-14 17:08:30,133 INFO L273 TraceCheckUtils]: 193: Hoare triple {20517#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20517#false} is VALID [2018-11-14 17:08:30,133 INFO L273 TraceCheckUtils]: 194: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:08:30,133 INFO L268 TraceCheckUtils]: 195: Hoare quadruple {20517#false} {20517#false} #77#return; {20517#false} is VALID [2018-11-14 17:08:30,133 INFO L273 TraceCheckUtils]: 196: Hoare triple {20517#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {20517#false} is VALID [2018-11-14 17:08:30,133 INFO L273 TraceCheckUtils]: 197: Hoare triple {20517#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {20517#false} is VALID [2018-11-14 17:08:30,133 INFO L273 TraceCheckUtils]: 198: Hoare triple {20517#false} assume !false; {20517#false} is VALID [2018-11-14 17:08:30,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1923 backedges. 460 proven. 57 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-11-14 17:08:30,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:30,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 9] total 34 [2018-11-14 17:08:30,170 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 199 [2018-11-14 17:08:30,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:30,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-14 17:08:30,301 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:30,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-14 17:08:30,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-14 17:08:30,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 17:08:30,302 INFO L87 Difference]: Start difference. First operand 140 states and 144 transitions. Second operand 34 states. [2018-11-14 17:08:31,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:31,420 INFO L93 Difference]: Finished difference Result 208 states and 217 transitions. [2018-11-14 17:08:31,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-14 17:08:31,420 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 199 [2018-11-14 17:08:31,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:31,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 17:08:31,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 154 transitions. [2018-11-14 17:08:31,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 17:08:31,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 154 transitions. [2018-11-14 17:08:31,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 154 transitions. [2018-11-14 17:08:31,557 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:31,560 INFO L225 Difference]: With dead ends: 208 [2018-11-14 17:08:31,560 INFO L226 Difference]: Without dead ends: 148 [2018-11-14 17:08:31,561 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 17:08:31,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-14 17:08:31,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-11-14 17:08:31,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:31,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 146 states. [2018-11-14 17:08:31,605 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 146 states. [2018-11-14 17:08:31,605 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 146 states. [2018-11-14 17:08:31,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:31,608 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-11-14 17:08:31,608 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2018-11-14 17:08:31,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:31,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:31,609 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 148 states. [2018-11-14 17:08:31,609 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 148 states. [2018-11-14 17:08:31,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:31,612 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-11-14 17:08:31,612 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2018-11-14 17:08:31,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:31,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:31,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:31,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:31,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-14 17:08:31,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 150 transitions. [2018-11-14 17:08:31,615 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 150 transitions. Word has length 199 [2018-11-14 17:08:31,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:31,616 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 150 transitions. [2018-11-14 17:08:31,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-14 17:08:31,616 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2018-11-14 17:08:31,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-14 17:08:31,617 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:31,617 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 25, 25, 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:31,618 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:31,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:31,618 INFO L82 PathProgramCache]: Analyzing trace with hash -442425137, now seen corresponding path program 25 times [2018-11-14 17:08:31,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:31,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:31,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:31,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:08:31,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:32,251 INFO L256 TraceCheckUtils]: 0: Hoare triple {21918#true} call ULTIMATE.init(); {21918#true} is VALID [2018-11-14 17:08:32,251 INFO L273 TraceCheckUtils]: 1: Hoare triple {21918#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21918#true} is VALID [2018-11-14 17:08:32,252 INFO L273 TraceCheckUtils]: 2: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,252 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21918#true} {21918#true} #69#return; {21918#true} is VALID [2018-11-14 17:08:32,252 INFO L256 TraceCheckUtils]: 4: Hoare triple {21918#true} call #t~ret13 := main(); {21918#true} is VALID [2018-11-14 17:08:32,253 INFO L273 TraceCheckUtils]: 5: Hoare triple {21918#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; {21920#(= main_~i~1 0)} is VALID [2018-11-14 17:08:32,253 INFO L273 TraceCheckUtils]: 6: Hoare triple {21920#(= main_~i~1 0)} assume true; {21920#(= main_~i~1 0)} is VALID [2018-11-14 17:08:32,253 INFO L273 TraceCheckUtils]: 7: Hoare triple {21920#(= 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; {21920#(= main_~i~1 0)} is VALID [2018-11-14 17:08:32,254 INFO L273 TraceCheckUtils]: 8: Hoare triple {21920#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21921#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:32,254 INFO L273 TraceCheckUtils]: 9: Hoare triple {21921#(<= main_~i~1 1)} assume true; {21921#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:32,254 INFO L273 TraceCheckUtils]: 10: Hoare triple {21921#(<= 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; {21921#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:32,255 INFO L273 TraceCheckUtils]: 11: Hoare triple {21921#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21922#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:32,255 INFO L273 TraceCheckUtils]: 12: Hoare triple {21922#(<= main_~i~1 2)} assume true; {21922#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:32,256 INFO L273 TraceCheckUtils]: 13: Hoare triple {21922#(<= 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; {21922#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:32,256 INFO L273 TraceCheckUtils]: 14: Hoare triple {21922#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21923#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:32,256 INFO L273 TraceCheckUtils]: 15: Hoare triple {21923#(<= main_~i~1 3)} assume true; {21923#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:32,257 INFO L273 TraceCheckUtils]: 16: Hoare triple {21923#(<= 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; {21923#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:32,258 INFO L273 TraceCheckUtils]: 17: Hoare triple {21923#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21924#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:32,258 INFO L273 TraceCheckUtils]: 18: Hoare triple {21924#(<= main_~i~1 4)} assume true; {21924#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:32,259 INFO L273 TraceCheckUtils]: 19: Hoare triple {21924#(<= 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; {21924#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:32,259 INFO L273 TraceCheckUtils]: 20: Hoare triple {21924#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21925#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:32,260 INFO L273 TraceCheckUtils]: 21: Hoare triple {21925#(<= main_~i~1 5)} assume true; {21925#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:32,260 INFO L273 TraceCheckUtils]: 22: Hoare triple {21925#(<= 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; {21925#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:32,261 INFO L273 TraceCheckUtils]: 23: Hoare triple {21925#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21926#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:32,262 INFO L273 TraceCheckUtils]: 24: Hoare triple {21926#(<= main_~i~1 6)} assume true; {21926#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:32,262 INFO L273 TraceCheckUtils]: 25: Hoare triple {21926#(<= 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; {21926#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:32,263 INFO L273 TraceCheckUtils]: 26: Hoare triple {21926#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21927#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:32,263 INFO L273 TraceCheckUtils]: 27: Hoare triple {21927#(<= main_~i~1 7)} assume true; {21927#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:32,264 INFO L273 TraceCheckUtils]: 28: Hoare triple {21927#(<= 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; {21927#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:32,265 INFO L273 TraceCheckUtils]: 29: Hoare triple {21927#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21928#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:32,265 INFO L273 TraceCheckUtils]: 30: Hoare triple {21928#(<= main_~i~1 8)} assume true; {21928#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:32,266 INFO L273 TraceCheckUtils]: 31: Hoare triple {21928#(<= 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; {21928#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:32,266 INFO L273 TraceCheckUtils]: 32: Hoare triple {21928#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21929#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:32,267 INFO L273 TraceCheckUtils]: 33: Hoare triple {21929#(<= main_~i~1 9)} assume true; {21929#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:32,267 INFO L273 TraceCheckUtils]: 34: Hoare triple {21929#(<= 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; {21929#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:32,268 INFO L273 TraceCheckUtils]: 35: Hoare triple {21929#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21930#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:32,269 INFO L273 TraceCheckUtils]: 36: Hoare triple {21930#(<= main_~i~1 10)} assume true; {21930#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:32,269 INFO L273 TraceCheckUtils]: 37: Hoare triple {21930#(<= 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; {21930#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:32,270 INFO L273 TraceCheckUtils]: 38: Hoare triple {21930#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21931#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:32,270 INFO L273 TraceCheckUtils]: 39: Hoare triple {21931#(<= main_~i~1 11)} assume true; {21931#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:32,271 INFO L273 TraceCheckUtils]: 40: Hoare triple {21931#(<= 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; {21931#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:32,271 INFO L273 TraceCheckUtils]: 41: Hoare triple {21931#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21932#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:32,272 INFO L273 TraceCheckUtils]: 42: Hoare triple {21932#(<= main_~i~1 12)} assume true; {21932#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:32,272 INFO L273 TraceCheckUtils]: 43: Hoare triple {21932#(<= 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; {21932#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:32,273 INFO L273 TraceCheckUtils]: 44: Hoare triple {21932#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21933#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:32,274 INFO L273 TraceCheckUtils]: 45: Hoare triple {21933#(<= main_~i~1 13)} assume true; {21933#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:32,274 INFO L273 TraceCheckUtils]: 46: Hoare triple {21933#(<= 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; {21933#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:32,275 INFO L273 TraceCheckUtils]: 47: Hoare triple {21933#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21934#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:32,275 INFO L273 TraceCheckUtils]: 48: Hoare triple {21934#(<= main_~i~1 14)} assume true; {21934#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:32,276 INFO L273 TraceCheckUtils]: 49: Hoare triple {21934#(<= 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; {21934#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:32,277 INFO L273 TraceCheckUtils]: 50: Hoare triple {21934#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21935#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:32,277 INFO L273 TraceCheckUtils]: 51: Hoare triple {21935#(<= main_~i~1 15)} assume true; {21935#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:32,278 INFO L273 TraceCheckUtils]: 52: Hoare triple {21935#(<= 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; {21935#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:32,278 INFO L273 TraceCheckUtils]: 53: Hoare triple {21935#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21936#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:32,279 INFO L273 TraceCheckUtils]: 54: Hoare triple {21936#(<= main_~i~1 16)} assume true; {21936#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:32,279 INFO L273 TraceCheckUtils]: 55: Hoare triple {21936#(<= 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; {21936#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:32,280 INFO L273 TraceCheckUtils]: 56: Hoare triple {21936#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21937#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:32,281 INFO L273 TraceCheckUtils]: 57: Hoare triple {21937#(<= main_~i~1 17)} assume true; {21937#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:32,281 INFO L273 TraceCheckUtils]: 58: Hoare triple {21937#(<= 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; {21937#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:32,282 INFO L273 TraceCheckUtils]: 59: Hoare triple {21937#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21938#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:32,282 INFO L273 TraceCheckUtils]: 60: Hoare triple {21938#(<= main_~i~1 18)} assume true; {21938#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:32,283 INFO L273 TraceCheckUtils]: 61: Hoare triple {21938#(<= 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; {21938#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:32,284 INFO L273 TraceCheckUtils]: 62: Hoare triple {21938#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21939#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:32,284 INFO L273 TraceCheckUtils]: 63: Hoare triple {21939#(<= main_~i~1 19)} assume true; {21939#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:32,285 INFO L273 TraceCheckUtils]: 64: Hoare triple {21939#(<= 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; {21939#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:32,285 INFO L273 TraceCheckUtils]: 65: Hoare triple {21939#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21940#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:32,286 INFO L273 TraceCheckUtils]: 66: Hoare triple {21940#(<= main_~i~1 20)} assume true; {21940#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:32,286 INFO L273 TraceCheckUtils]: 67: Hoare triple {21940#(<= 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; {21940#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:32,287 INFO L273 TraceCheckUtils]: 68: Hoare triple {21940#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21941#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:32,288 INFO L273 TraceCheckUtils]: 69: Hoare triple {21941#(<= main_~i~1 21)} assume true; {21941#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:32,288 INFO L273 TraceCheckUtils]: 70: Hoare triple {21941#(<= 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; {21941#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:32,289 INFO L273 TraceCheckUtils]: 71: Hoare triple {21941#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21942#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:32,289 INFO L273 TraceCheckUtils]: 72: Hoare triple {21942#(<= main_~i~1 22)} assume true; {21942#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:32,290 INFO L273 TraceCheckUtils]: 73: Hoare triple {21942#(<= 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; {21942#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:32,291 INFO L273 TraceCheckUtils]: 74: Hoare triple {21942#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21943#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:32,291 INFO L273 TraceCheckUtils]: 75: Hoare triple {21943#(<= main_~i~1 23)} assume true; {21943#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:32,292 INFO L273 TraceCheckUtils]: 76: Hoare triple {21943#(<= 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; {21943#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:32,292 INFO L273 TraceCheckUtils]: 77: Hoare triple {21943#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21944#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:32,293 INFO L273 TraceCheckUtils]: 78: Hoare triple {21944#(<= main_~i~1 24)} assume true; {21944#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:32,293 INFO L273 TraceCheckUtils]: 79: Hoare triple {21944#(<= 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; {21944#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:32,294 INFO L273 TraceCheckUtils]: 80: Hoare triple {21944#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21945#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:32,294 INFO L273 TraceCheckUtils]: 81: Hoare triple {21945#(<= main_~i~1 25)} assume true; {21945#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:32,295 INFO L273 TraceCheckUtils]: 82: Hoare triple {21945#(<= main_~i~1 25)} assume !(~i~1 < 10000); {21919#false} is VALID [2018-11-14 17:08:32,295 INFO L256 TraceCheckUtils]: 83: Hoare triple {21919#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {21918#true} is VALID [2018-11-14 17:08:32,295 INFO L273 TraceCheckUtils]: 84: Hoare triple {21918#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; {21918#true} is VALID [2018-11-14 17:08:32,296 INFO L273 TraceCheckUtils]: 85: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,296 INFO L273 TraceCheckUtils]: 86: Hoare triple {21918#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:08:32,296 INFO L273 TraceCheckUtils]: 87: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:08:32,296 INFO L273 TraceCheckUtils]: 88: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,296 INFO L273 TraceCheckUtils]: 89: Hoare triple {21918#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:08:32,296 INFO L273 TraceCheckUtils]: 90: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:08:32,297 INFO L273 TraceCheckUtils]: 91: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,297 INFO L273 TraceCheckUtils]: 92: Hoare triple {21918#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:08:32,297 INFO L273 TraceCheckUtils]: 93: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:08:32,297 INFO L273 TraceCheckUtils]: 94: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,297 INFO L273 TraceCheckUtils]: 95: Hoare triple {21918#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:08:32,297 INFO L273 TraceCheckUtils]: 96: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:08:32,297 INFO L273 TraceCheckUtils]: 97: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,298 INFO L273 TraceCheckUtils]: 98: Hoare triple {21918#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:08:32,298 INFO L273 TraceCheckUtils]: 99: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:08:32,298 INFO L273 TraceCheckUtils]: 100: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,298 INFO L273 TraceCheckUtils]: 101: Hoare triple {21918#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:08:32,298 INFO L273 TraceCheckUtils]: 102: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:08:32,298 INFO L273 TraceCheckUtils]: 103: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,298 INFO L273 TraceCheckUtils]: 104: Hoare triple {21918#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:08:32,298 INFO L273 TraceCheckUtils]: 105: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:08:32,298 INFO L273 TraceCheckUtils]: 106: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,298 INFO L273 TraceCheckUtils]: 107: Hoare triple {21918#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:08:32,299 INFO L273 TraceCheckUtils]: 108: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:08:32,299 INFO L273 TraceCheckUtils]: 109: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,299 INFO L273 TraceCheckUtils]: 110: Hoare triple {21918#true} assume !(~i~0 < 10000); {21918#true} is VALID [2018-11-14 17:08:32,299 INFO L273 TraceCheckUtils]: 111: Hoare triple {21918#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21918#true} is VALID [2018-11-14 17:08:32,299 INFO L273 TraceCheckUtils]: 112: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,299 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {21918#true} {21919#false} #73#return; {21919#false} is VALID [2018-11-14 17:08:32,299 INFO L273 TraceCheckUtils]: 114: Hoare triple {21919#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); {21919#false} is VALID [2018-11-14 17:08:32,299 INFO L256 TraceCheckUtils]: 115: Hoare triple {21919#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {21918#true} is VALID [2018-11-14 17:08:32,299 INFO L273 TraceCheckUtils]: 116: Hoare triple {21918#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; {21918#true} is VALID [2018-11-14 17:08:32,300 INFO L273 TraceCheckUtils]: 117: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,300 INFO L273 TraceCheckUtils]: 118: Hoare triple {21918#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:08:32,300 INFO L273 TraceCheckUtils]: 119: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:08:32,300 INFO L273 TraceCheckUtils]: 120: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,300 INFO L273 TraceCheckUtils]: 121: Hoare triple {21918#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:08:32,300 INFO L273 TraceCheckUtils]: 122: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:08:32,300 INFO L273 TraceCheckUtils]: 123: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,300 INFO L273 TraceCheckUtils]: 124: Hoare triple {21918#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:08:32,300 INFO L273 TraceCheckUtils]: 125: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:08:32,300 INFO L273 TraceCheckUtils]: 126: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,301 INFO L273 TraceCheckUtils]: 127: Hoare triple {21918#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:08:32,301 INFO L273 TraceCheckUtils]: 128: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:08:32,301 INFO L273 TraceCheckUtils]: 129: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,301 INFO L273 TraceCheckUtils]: 130: Hoare triple {21918#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:08:32,301 INFO L273 TraceCheckUtils]: 131: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:08:32,301 INFO L273 TraceCheckUtils]: 132: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,301 INFO L273 TraceCheckUtils]: 133: Hoare triple {21918#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:08:32,301 INFO L273 TraceCheckUtils]: 134: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:08:32,301 INFO L273 TraceCheckUtils]: 135: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,301 INFO L273 TraceCheckUtils]: 136: Hoare triple {21918#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:08:32,302 INFO L273 TraceCheckUtils]: 137: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:08:32,302 INFO L273 TraceCheckUtils]: 138: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,302 INFO L273 TraceCheckUtils]: 139: Hoare triple {21918#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:08:32,302 INFO L273 TraceCheckUtils]: 140: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:08:32,302 INFO L273 TraceCheckUtils]: 141: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,302 INFO L273 TraceCheckUtils]: 142: Hoare triple {21918#true} assume !(~i~0 < 10000); {21918#true} is VALID [2018-11-14 17:08:32,302 INFO L273 TraceCheckUtils]: 143: Hoare triple {21918#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21918#true} is VALID [2018-11-14 17:08:32,302 INFO L273 TraceCheckUtils]: 144: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,302 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {21918#true} {21919#false} #75#return; {21919#false} is VALID [2018-11-14 17:08:32,302 INFO L273 TraceCheckUtils]: 146: Hoare triple {21919#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; {21919#false} is VALID [2018-11-14 17:08:32,303 INFO L273 TraceCheckUtils]: 147: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,303 INFO L273 TraceCheckUtils]: 148: Hoare triple {21919#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 17:08:32,303 INFO L273 TraceCheckUtils]: 149: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 17:08:32,303 INFO L273 TraceCheckUtils]: 150: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,303 INFO L273 TraceCheckUtils]: 151: Hoare triple {21919#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 17:08:32,303 INFO L273 TraceCheckUtils]: 152: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 17:08:32,303 INFO L273 TraceCheckUtils]: 153: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,303 INFO L273 TraceCheckUtils]: 154: Hoare triple {21919#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 17:08:32,303 INFO L273 TraceCheckUtils]: 155: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 17:08:32,303 INFO L273 TraceCheckUtils]: 156: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,304 INFO L273 TraceCheckUtils]: 157: Hoare triple {21919#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 17:08:32,304 INFO L273 TraceCheckUtils]: 158: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 17:08:32,304 INFO L273 TraceCheckUtils]: 159: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,304 INFO L273 TraceCheckUtils]: 160: Hoare triple {21919#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 17:08:32,304 INFO L273 TraceCheckUtils]: 161: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 17:08:32,304 INFO L273 TraceCheckUtils]: 162: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,304 INFO L273 TraceCheckUtils]: 163: Hoare triple {21919#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 17:08:32,304 INFO L273 TraceCheckUtils]: 164: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 17:08:32,304 INFO L273 TraceCheckUtils]: 165: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,305 INFO L273 TraceCheckUtils]: 166: Hoare triple {21919#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 17:08:32,305 INFO L273 TraceCheckUtils]: 167: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 17:08:32,305 INFO L273 TraceCheckUtils]: 168: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,305 INFO L273 TraceCheckUtils]: 169: Hoare triple {21919#false} assume !(~i~2 < 9999); {21919#false} is VALID [2018-11-14 17:08:32,305 INFO L273 TraceCheckUtils]: 170: Hoare triple {21919#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {21919#false} is VALID [2018-11-14 17:08:32,305 INFO L256 TraceCheckUtils]: 171: Hoare triple {21919#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {21918#true} is VALID [2018-11-14 17:08:32,305 INFO L273 TraceCheckUtils]: 172: Hoare triple {21918#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; {21918#true} is VALID [2018-11-14 17:08:32,305 INFO L273 TraceCheckUtils]: 173: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,305 INFO L273 TraceCheckUtils]: 174: Hoare triple {21918#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:08:32,305 INFO L273 TraceCheckUtils]: 175: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:08:32,306 INFO L273 TraceCheckUtils]: 176: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,306 INFO L273 TraceCheckUtils]: 177: Hoare triple {21918#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:08:32,306 INFO L273 TraceCheckUtils]: 178: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:08:32,306 INFO L273 TraceCheckUtils]: 179: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,306 INFO L273 TraceCheckUtils]: 180: Hoare triple {21918#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:08:32,306 INFO L273 TraceCheckUtils]: 181: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:08:32,306 INFO L273 TraceCheckUtils]: 182: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,306 INFO L273 TraceCheckUtils]: 183: Hoare triple {21918#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:08:32,306 INFO L273 TraceCheckUtils]: 184: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:08:32,306 INFO L273 TraceCheckUtils]: 185: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,307 INFO L273 TraceCheckUtils]: 186: Hoare triple {21918#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:08:32,307 INFO L273 TraceCheckUtils]: 187: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:08:32,307 INFO L273 TraceCheckUtils]: 188: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,307 INFO L273 TraceCheckUtils]: 189: Hoare triple {21918#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:08:32,307 INFO L273 TraceCheckUtils]: 190: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:08:32,307 INFO L273 TraceCheckUtils]: 191: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,307 INFO L273 TraceCheckUtils]: 192: Hoare triple {21918#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:08:32,307 INFO L273 TraceCheckUtils]: 193: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:08:32,307 INFO L273 TraceCheckUtils]: 194: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,307 INFO L273 TraceCheckUtils]: 195: Hoare triple {21918#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:08:32,308 INFO L273 TraceCheckUtils]: 196: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:08:32,308 INFO L273 TraceCheckUtils]: 197: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,308 INFO L273 TraceCheckUtils]: 198: Hoare triple {21918#true} assume !(~i~0 < 10000); {21918#true} is VALID [2018-11-14 17:08:32,308 INFO L273 TraceCheckUtils]: 199: Hoare triple {21918#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21918#true} is VALID [2018-11-14 17:08:32,308 INFO L273 TraceCheckUtils]: 200: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,308 INFO L268 TraceCheckUtils]: 201: Hoare quadruple {21918#true} {21919#false} #77#return; {21919#false} is VALID [2018-11-14 17:08:32,308 INFO L273 TraceCheckUtils]: 202: Hoare triple {21919#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {21919#false} is VALID [2018-11-14 17:08:32,308 INFO L273 TraceCheckUtils]: 203: Hoare triple {21919#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {21919#false} is VALID [2018-11-14 17:08:32,308 INFO L273 TraceCheckUtils]: 204: Hoare triple {21919#false} assume !false; {21919#false} is VALID [2018-11-14 17:08:32,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-11-14 17:08:32,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:32,327 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:32,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:08:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:32,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:32,832 INFO L256 TraceCheckUtils]: 0: Hoare triple {21918#true} call ULTIMATE.init(); {21918#true} is VALID [2018-11-14 17:08:32,832 INFO L273 TraceCheckUtils]: 1: Hoare triple {21918#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21918#true} is VALID [2018-11-14 17:08:32,833 INFO L273 TraceCheckUtils]: 2: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:08:32,833 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21918#true} {21918#true} #69#return; {21918#true} is VALID [2018-11-14 17:08:32,833 INFO L256 TraceCheckUtils]: 4: Hoare triple {21918#true} call #t~ret13 := main(); {21918#true} is VALID [2018-11-14 17:08:32,834 INFO L273 TraceCheckUtils]: 5: Hoare triple {21918#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; {21964#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:32,834 INFO L273 TraceCheckUtils]: 6: Hoare triple {21964#(<= main_~i~1 0)} assume true; {21964#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:32,835 INFO L273 TraceCheckUtils]: 7: Hoare triple {21964#(<= 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; {21964#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:32,835 INFO L273 TraceCheckUtils]: 8: Hoare triple {21964#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21921#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:32,835 INFO L273 TraceCheckUtils]: 9: Hoare triple {21921#(<= main_~i~1 1)} assume true; {21921#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:32,836 INFO L273 TraceCheckUtils]: 10: Hoare triple {21921#(<= 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; {21921#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:32,836 INFO L273 TraceCheckUtils]: 11: Hoare triple {21921#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21922#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:32,837 INFO L273 TraceCheckUtils]: 12: Hoare triple {21922#(<= main_~i~1 2)} assume true; {21922#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:32,837 INFO L273 TraceCheckUtils]: 13: Hoare triple {21922#(<= 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; {21922#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:32,838 INFO L273 TraceCheckUtils]: 14: Hoare triple {21922#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21923#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:32,838 INFO L273 TraceCheckUtils]: 15: Hoare triple {21923#(<= main_~i~1 3)} assume true; {21923#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:32,839 INFO L273 TraceCheckUtils]: 16: Hoare triple {21923#(<= 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; {21923#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:32,839 INFO L273 TraceCheckUtils]: 17: Hoare triple {21923#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21924#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:32,840 INFO L273 TraceCheckUtils]: 18: Hoare triple {21924#(<= main_~i~1 4)} assume true; {21924#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:32,840 INFO L273 TraceCheckUtils]: 19: Hoare triple {21924#(<= 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; {21924#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:32,841 INFO L273 TraceCheckUtils]: 20: Hoare triple {21924#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21925#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:32,842 INFO L273 TraceCheckUtils]: 21: Hoare triple {21925#(<= main_~i~1 5)} assume true; {21925#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:32,842 INFO L273 TraceCheckUtils]: 22: Hoare triple {21925#(<= 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; {21925#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:32,843 INFO L273 TraceCheckUtils]: 23: Hoare triple {21925#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21926#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:32,843 INFO L273 TraceCheckUtils]: 24: Hoare triple {21926#(<= main_~i~1 6)} assume true; {21926#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:32,844 INFO L273 TraceCheckUtils]: 25: Hoare triple {21926#(<= 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; {21926#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:32,845 INFO L273 TraceCheckUtils]: 26: Hoare triple {21926#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21927#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:32,845 INFO L273 TraceCheckUtils]: 27: Hoare triple {21927#(<= main_~i~1 7)} assume true; {21927#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:32,846 INFO L273 TraceCheckUtils]: 28: Hoare triple {21927#(<= 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; {21927#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:32,846 INFO L273 TraceCheckUtils]: 29: Hoare triple {21927#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21928#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:32,847 INFO L273 TraceCheckUtils]: 30: Hoare triple {21928#(<= main_~i~1 8)} assume true; {21928#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:32,847 INFO L273 TraceCheckUtils]: 31: Hoare triple {21928#(<= 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; {21928#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:32,848 INFO L273 TraceCheckUtils]: 32: Hoare triple {21928#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21929#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:32,849 INFO L273 TraceCheckUtils]: 33: Hoare triple {21929#(<= main_~i~1 9)} assume true; {21929#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:32,849 INFO L273 TraceCheckUtils]: 34: Hoare triple {21929#(<= 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; {21929#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:32,850 INFO L273 TraceCheckUtils]: 35: Hoare triple {21929#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21930#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:32,850 INFO L273 TraceCheckUtils]: 36: Hoare triple {21930#(<= main_~i~1 10)} assume true; {21930#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:32,851 INFO L273 TraceCheckUtils]: 37: Hoare triple {21930#(<= 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; {21930#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:32,852 INFO L273 TraceCheckUtils]: 38: Hoare triple {21930#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21931#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:32,852 INFO L273 TraceCheckUtils]: 39: Hoare triple {21931#(<= main_~i~1 11)} assume true; {21931#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:32,853 INFO L273 TraceCheckUtils]: 40: Hoare triple {21931#(<= 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; {21931#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:32,853 INFO L273 TraceCheckUtils]: 41: Hoare triple {21931#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21932#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:32,854 INFO L273 TraceCheckUtils]: 42: Hoare triple {21932#(<= main_~i~1 12)} assume true; {21932#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:32,854 INFO L273 TraceCheckUtils]: 43: Hoare triple {21932#(<= 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; {21932#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:32,855 INFO L273 TraceCheckUtils]: 44: Hoare triple {21932#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21933#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:32,855 INFO L273 TraceCheckUtils]: 45: Hoare triple {21933#(<= main_~i~1 13)} assume true; {21933#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:32,856 INFO L273 TraceCheckUtils]: 46: Hoare triple {21933#(<= 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; {21933#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:32,857 INFO L273 TraceCheckUtils]: 47: Hoare triple {21933#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21934#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:32,857 INFO L273 TraceCheckUtils]: 48: Hoare triple {21934#(<= main_~i~1 14)} assume true; {21934#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:32,858 INFO L273 TraceCheckUtils]: 49: Hoare triple {21934#(<= 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; {21934#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:32,858 INFO L273 TraceCheckUtils]: 50: Hoare triple {21934#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21935#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:32,859 INFO L273 TraceCheckUtils]: 51: Hoare triple {21935#(<= main_~i~1 15)} assume true; {21935#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:32,859 INFO L273 TraceCheckUtils]: 52: Hoare triple {21935#(<= 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; {21935#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:32,860 INFO L273 TraceCheckUtils]: 53: Hoare triple {21935#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21936#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:32,861 INFO L273 TraceCheckUtils]: 54: Hoare triple {21936#(<= main_~i~1 16)} assume true; {21936#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:32,861 INFO L273 TraceCheckUtils]: 55: Hoare triple {21936#(<= 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; {21936#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:32,862 INFO L273 TraceCheckUtils]: 56: Hoare triple {21936#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21937#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:32,862 INFO L273 TraceCheckUtils]: 57: Hoare triple {21937#(<= main_~i~1 17)} assume true; {21937#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:32,863 INFO L273 TraceCheckUtils]: 58: Hoare triple {21937#(<= 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; {21937#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:32,871 INFO L273 TraceCheckUtils]: 59: Hoare triple {21937#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21938#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:32,872 INFO L273 TraceCheckUtils]: 60: Hoare triple {21938#(<= main_~i~1 18)} assume true; {21938#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:32,872 INFO L273 TraceCheckUtils]: 61: Hoare triple {21938#(<= 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; {21938#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:32,872 INFO L273 TraceCheckUtils]: 62: Hoare triple {21938#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21939#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:32,873 INFO L273 TraceCheckUtils]: 63: Hoare triple {21939#(<= main_~i~1 19)} assume true; {21939#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:32,873 INFO L273 TraceCheckUtils]: 64: Hoare triple {21939#(<= 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; {21939#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:32,873 INFO L273 TraceCheckUtils]: 65: Hoare triple {21939#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21940#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:32,874 INFO L273 TraceCheckUtils]: 66: Hoare triple {21940#(<= main_~i~1 20)} assume true; {21940#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:32,874 INFO L273 TraceCheckUtils]: 67: Hoare triple {21940#(<= 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; {21940#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:32,874 INFO L273 TraceCheckUtils]: 68: Hoare triple {21940#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21941#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:32,875 INFO L273 TraceCheckUtils]: 69: Hoare triple {21941#(<= main_~i~1 21)} assume true; {21941#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:32,875 INFO L273 TraceCheckUtils]: 70: Hoare triple {21941#(<= 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; {21941#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:32,876 INFO L273 TraceCheckUtils]: 71: Hoare triple {21941#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21942#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:32,877 INFO L273 TraceCheckUtils]: 72: Hoare triple {21942#(<= main_~i~1 22)} assume true; {21942#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:32,877 INFO L273 TraceCheckUtils]: 73: Hoare triple {21942#(<= 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; {21942#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:32,878 INFO L273 TraceCheckUtils]: 74: Hoare triple {21942#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21943#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:32,878 INFO L273 TraceCheckUtils]: 75: Hoare triple {21943#(<= main_~i~1 23)} assume true; {21943#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:32,879 INFO L273 TraceCheckUtils]: 76: Hoare triple {21943#(<= 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; {21943#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:32,880 INFO L273 TraceCheckUtils]: 77: Hoare triple {21943#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21944#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:32,880 INFO L273 TraceCheckUtils]: 78: Hoare triple {21944#(<= main_~i~1 24)} assume true; {21944#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:32,881 INFO L273 TraceCheckUtils]: 79: Hoare triple {21944#(<= 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; {21944#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:32,881 INFO L273 TraceCheckUtils]: 80: Hoare triple {21944#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21945#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:32,882 INFO L273 TraceCheckUtils]: 81: Hoare triple {21945#(<= main_~i~1 25)} assume true; {21945#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:32,882 INFO L273 TraceCheckUtils]: 82: Hoare triple {21945#(<= main_~i~1 25)} assume !(~i~1 < 10000); {21919#false} is VALID [2018-11-14 17:08:32,883 INFO L256 TraceCheckUtils]: 83: Hoare triple {21919#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {21919#false} is VALID [2018-11-14 17:08:32,883 INFO L273 TraceCheckUtils]: 84: Hoare triple {21919#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; {21919#false} is VALID [2018-11-14 17:08:32,883 INFO L273 TraceCheckUtils]: 85: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,883 INFO L273 TraceCheckUtils]: 86: Hoare triple {21919#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:08:32,883 INFO L273 TraceCheckUtils]: 87: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:08:32,884 INFO L273 TraceCheckUtils]: 88: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,884 INFO L273 TraceCheckUtils]: 89: Hoare triple {21919#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:08:32,884 INFO L273 TraceCheckUtils]: 90: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:08:32,884 INFO L273 TraceCheckUtils]: 91: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,884 INFO L273 TraceCheckUtils]: 92: Hoare triple {21919#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:08:32,884 INFO L273 TraceCheckUtils]: 93: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:08:32,885 INFO L273 TraceCheckUtils]: 94: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,885 INFO L273 TraceCheckUtils]: 95: Hoare triple {21919#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:08:32,885 INFO L273 TraceCheckUtils]: 96: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:08:32,885 INFO L273 TraceCheckUtils]: 97: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,885 INFO L273 TraceCheckUtils]: 98: Hoare triple {21919#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:08:32,885 INFO L273 TraceCheckUtils]: 99: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:08:32,886 INFO L273 TraceCheckUtils]: 100: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,886 INFO L273 TraceCheckUtils]: 101: Hoare triple {21919#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:08:32,886 INFO L273 TraceCheckUtils]: 102: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:08:32,886 INFO L273 TraceCheckUtils]: 103: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,886 INFO L273 TraceCheckUtils]: 104: Hoare triple {21919#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:08:32,886 INFO L273 TraceCheckUtils]: 105: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:08:32,887 INFO L273 TraceCheckUtils]: 106: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,887 INFO L273 TraceCheckUtils]: 107: Hoare triple {21919#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:08:32,887 INFO L273 TraceCheckUtils]: 108: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:08:32,887 INFO L273 TraceCheckUtils]: 109: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,887 INFO L273 TraceCheckUtils]: 110: Hoare triple {21919#false} assume !(~i~0 < 10000); {21919#false} is VALID [2018-11-14 17:08:32,887 INFO L273 TraceCheckUtils]: 111: Hoare triple {21919#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21919#false} is VALID [2018-11-14 17:08:32,887 INFO L273 TraceCheckUtils]: 112: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,887 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {21919#false} {21919#false} #73#return; {21919#false} is VALID [2018-11-14 17:08:32,887 INFO L273 TraceCheckUtils]: 114: Hoare triple {21919#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); {21919#false} is VALID [2018-11-14 17:08:32,887 INFO L256 TraceCheckUtils]: 115: Hoare triple {21919#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {21919#false} is VALID [2018-11-14 17:08:32,888 INFO L273 TraceCheckUtils]: 116: Hoare triple {21919#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; {21919#false} is VALID [2018-11-14 17:08:32,888 INFO L273 TraceCheckUtils]: 117: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,888 INFO L273 TraceCheckUtils]: 118: Hoare triple {21919#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:08:32,888 INFO L273 TraceCheckUtils]: 119: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:08:32,888 INFO L273 TraceCheckUtils]: 120: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,888 INFO L273 TraceCheckUtils]: 121: Hoare triple {21919#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:08:32,888 INFO L273 TraceCheckUtils]: 122: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:08:32,888 INFO L273 TraceCheckUtils]: 123: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,888 INFO L273 TraceCheckUtils]: 124: Hoare triple {21919#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:08:32,888 INFO L273 TraceCheckUtils]: 125: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:08:32,889 INFO L273 TraceCheckUtils]: 126: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,889 INFO L273 TraceCheckUtils]: 127: Hoare triple {21919#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:08:32,889 INFO L273 TraceCheckUtils]: 128: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:08:32,889 INFO L273 TraceCheckUtils]: 129: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,889 INFO L273 TraceCheckUtils]: 130: Hoare triple {21919#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:08:32,889 INFO L273 TraceCheckUtils]: 131: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:08:32,889 INFO L273 TraceCheckUtils]: 132: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,889 INFO L273 TraceCheckUtils]: 133: Hoare triple {21919#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:08:32,889 INFO L273 TraceCheckUtils]: 134: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:08:32,889 INFO L273 TraceCheckUtils]: 135: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,890 INFO L273 TraceCheckUtils]: 136: Hoare triple {21919#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:08:32,890 INFO L273 TraceCheckUtils]: 137: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:08:32,890 INFO L273 TraceCheckUtils]: 138: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,890 INFO L273 TraceCheckUtils]: 139: Hoare triple {21919#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:08:32,890 INFO L273 TraceCheckUtils]: 140: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:08:32,890 INFO L273 TraceCheckUtils]: 141: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,890 INFO L273 TraceCheckUtils]: 142: Hoare triple {21919#false} assume !(~i~0 < 10000); {21919#false} is VALID [2018-11-14 17:08:32,890 INFO L273 TraceCheckUtils]: 143: Hoare triple {21919#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21919#false} is VALID [2018-11-14 17:08:32,890 INFO L273 TraceCheckUtils]: 144: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,890 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {21919#false} {21919#false} #75#return; {21919#false} is VALID [2018-11-14 17:08:32,891 INFO L273 TraceCheckUtils]: 146: Hoare triple {21919#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; {21919#false} is VALID [2018-11-14 17:08:32,891 INFO L273 TraceCheckUtils]: 147: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,891 INFO L273 TraceCheckUtils]: 148: Hoare triple {21919#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 17:08:32,891 INFO L273 TraceCheckUtils]: 149: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 17:08:32,891 INFO L273 TraceCheckUtils]: 150: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,891 INFO L273 TraceCheckUtils]: 151: Hoare triple {21919#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 17:08:32,891 INFO L273 TraceCheckUtils]: 152: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 17:08:32,891 INFO L273 TraceCheckUtils]: 153: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,891 INFO L273 TraceCheckUtils]: 154: Hoare triple {21919#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 17:08:32,892 INFO L273 TraceCheckUtils]: 155: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 17:08:32,892 INFO L273 TraceCheckUtils]: 156: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,892 INFO L273 TraceCheckUtils]: 157: Hoare triple {21919#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 17:08:32,892 INFO L273 TraceCheckUtils]: 158: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 17:08:32,892 INFO L273 TraceCheckUtils]: 159: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,892 INFO L273 TraceCheckUtils]: 160: Hoare triple {21919#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 17:08:32,892 INFO L273 TraceCheckUtils]: 161: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 17:08:32,892 INFO L273 TraceCheckUtils]: 162: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,892 INFO L273 TraceCheckUtils]: 163: Hoare triple {21919#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 17:08:32,892 INFO L273 TraceCheckUtils]: 164: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 17:08:32,893 INFO L273 TraceCheckUtils]: 165: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,893 INFO L273 TraceCheckUtils]: 166: Hoare triple {21919#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 17:08:32,893 INFO L273 TraceCheckUtils]: 167: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 17:08:32,893 INFO L273 TraceCheckUtils]: 168: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,893 INFO L273 TraceCheckUtils]: 169: Hoare triple {21919#false} assume !(~i~2 < 9999); {21919#false} is VALID [2018-11-14 17:08:32,893 INFO L273 TraceCheckUtils]: 170: Hoare triple {21919#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {21919#false} is VALID [2018-11-14 17:08:32,893 INFO L256 TraceCheckUtils]: 171: Hoare triple {21919#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {21919#false} is VALID [2018-11-14 17:08:32,893 INFO L273 TraceCheckUtils]: 172: Hoare triple {21919#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; {21919#false} is VALID [2018-11-14 17:08:32,893 INFO L273 TraceCheckUtils]: 173: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,893 INFO L273 TraceCheckUtils]: 174: Hoare triple {21919#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:08:32,894 INFO L273 TraceCheckUtils]: 175: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:08:32,894 INFO L273 TraceCheckUtils]: 176: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,894 INFO L273 TraceCheckUtils]: 177: Hoare triple {21919#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:08:32,894 INFO L273 TraceCheckUtils]: 178: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:08:32,894 INFO L273 TraceCheckUtils]: 179: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,894 INFO L273 TraceCheckUtils]: 180: Hoare triple {21919#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:08:32,894 INFO L273 TraceCheckUtils]: 181: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:08:32,894 INFO L273 TraceCheckUtils]: 182: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,894 INFO L273 TraceCheckUtils]: 183: Hoare triple {21919#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:08:32,894 INFO L273 TraceCheckUtils]: 184: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:08:32,895 INFO L273 TraceCheckUtils]: 185: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,895 INFO L273 TraceCheckUtils]: 186: Hoare triple {21919#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:08:32,895 INFO L273 TraceCheckUtils]: 187: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:08:32,895 INFO L273 TraceCheckUtils]: 188: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,895 INFO L273 TraceCheckUtils]: 189: Hoare triple {21919#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:08:32,895 INFO L273 TraceCheckUtils]: 190: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:08:32,895 INFO L273 TraceCheckUtils]: 191: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,895 INFO L273 TraceCheckUtils]: 192: Hoare triple {21919#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:08:32,895 INFO L273 TraceCheckUtils]: 193: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:08:32,895 INFO L273 TraceCheckUtils]: 194: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,896 INFO L273 TraceCheckUtils]: 195: Hoare triple {21919#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:08:32,896 INFO L273 TraceCheckUtils]: 196: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:08:32,896 INFO L273 TraceCheckUtils]: 197: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,896 INFO L273 TraceCheckUtils]: 198: Hoare triple {21919#false} assume !(~i~0 < 10000); {21919#false} is VALID [2018-11-14 17:08:32,896 INFO L273 TraceCheckUtils]: 199: Hoare triple {21919#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21919#false} is VALID [2018-11-14 17:08:32,896 INFO L273 TraceCheckUtils]: 200: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:08:32,897 INFO L268 TraceCheckUtils]: 201: Hoare quadruple {21919#false} {21919#false} #77#return; {21919#false} is VALID [2018-11-14 17:08:32,897 INFO L273 TraceCheckUtils]: 202: Hoare triple {21919#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {21919#false} is VALID [2018-11-14 17:08:32,897 INFO L273 TraceCheckUtils]: 203: Hoare triple {21919#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {21919#false} is VALID [2018-11-14 17:08:32,897 INFO L273 TraceCheckUtils]: 204: Hoare triple {21919#false} assume !false; {21919#false} is VALID [2018-11-14 17:08:32,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-11-14 17:08:32,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:32,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-14 17:08:32,957 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 205 [2018-11-14 17:08:32,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:32,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-14 17:08:33,076 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:08:33,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-14 17:08:33,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-14 17:08:33,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-14 17:08:33,077 INFO L87 Difference]: Start difference. First operand 146 states and 150 transitions. Second operand 29 states. [2018-11-14 17:08:33,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:33,887 INFO L93 Difference]: Finished difference Result 213 states and 221 transitions. [2018-11-14 17:08:33,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-14 17:08:33,887 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 205 [2018-11-14 17:08:33,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:33,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 17:08:33,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 135 transitions. [2018-11-14 17:08:33,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 17:08:33,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 135 transitions. [2018-11-14 17:08:33,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 135 transitions. [2018-11-14 17:08:34,014 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:34,018 INFO L225 Difference]: With dead ends: 213 [2018-11-14 17:08:34,018 INFO L226 Difference]: Without dead ends: 150 [2018-11-14 17:08:34,019 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-14 17:08:34,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-14 17:08:34,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-11-14 17:08:34,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:34,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand 149 states. [2018-11-14 17:08:34,063 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 149 states. [2018-11-14 17:08:34,063 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 149 states. [2018-11-14 17:08:34,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:34,066 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2018-11-14 17:08:34,066 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2018-11-14 17:08:34,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:34,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:34,067 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 150 states. [2018-11-14 17:08:34,067 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 150 states. [2018-11-14 17:08:34,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:34,070 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2018-11-14 17:08:34,070 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2018-11-14 17:08:34,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:34,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:34,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:34,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:34,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-14 17:08:34,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 153 transitions. [2018-11-14 17:08:34,073 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 153 transitions. Word has length 205 [2018-11-14 17:08:34,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:34,073 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 153 transitions. [2018-11-14 17:08:34,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-14 17:08:34,074 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 153 transitions. [2018-11-14 17:08:34,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-11-14 17:08:34,075 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:34,075 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 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:34,075 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:34,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:34,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1799796075, now seen corresponding path program 26 times [2018-11-14 17:08:34,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:34,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:34,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:34,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:08:34,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:34,699 INFO L256 TraceCheckUtils]: 0: Hoare triple {23348#true} call ULTIMATE.init(); {23348#true} is VALID [2018-11-14 17:08:34,700 INFO L273 TraceCheckUtils]: 1: Hoare triple {23348#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23348#true} is VALID [2018-11-14 17:08:34,700 INFO L273 TraceCheckUtils]: 2: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,700 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23348#true} {23348#true} #69#return; {23348#true} is VALID [2018-11-14 17:08:34,700 INFO L256 TraceCheckUtils]: 4: Hoare triple {23348#true} call #t~ret13 := main(); {23348#true} is VALID [2018-11-14 17:08:34,701 INFO L273 TraceCheckUtils]: 5: Hoare triple {23348#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; {23350#(= main_~i~1 0)} is VALID [2018-11-14 17:08:34,701 INFO L273 TraceCheckUtils]: 6: Hoare triple {23350#(= main_~i~1 0)} assume true; {23350#(= main_~i~1 0)} is VALID [2018-11-14 17:08:34,702 INFO L273 TraceCheckUtils]: 7: Hoare triple {23350#(= 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; {23350#(= main_~i~1 0)} is VALID [2018-11-14 17:08:34,702 INFO L273 TraceCheckUtils]: 8: Hoare triple {23350#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23351#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:34,703 INFO L273 TraceCheckUtils]: 9: Hoare triple {23351#(<= main_~i~1 1)} assume true; {23351#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:34,703 INFO L273 TraceCheckUtils]: 10: Hoare triple {23351#(<= 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; {23351#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:34,703 INFO L273 TraceCheckUtils]: 11: Hoare triple {23351#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23352#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:34,704 INFO L273 TraceCheckUtils]: 12: Hoare triple {23352#(<= main_~i~1 2)} assume true; {23352#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:34,704 INFO L273 TraceCheckUtils]: 13: Hoare triple {23352#(<= 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; {23352#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:34,705 INFO L273 TraceCheckUtils]: 14: Hoare triple {23352#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23353#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:34,705 INFO L273 TraceCheckUtils]: 15: Hoare triple {23353#(<= main_~i~1 3)} assume true; {23353#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:34,706 INFO L273 TraceCheckUtils]: 16: Hoare triple {23353#(<= 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; {23353#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:34,707 INFO L273 TraceCheckUtils]: 17: Hoare triple {23353#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23354#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:34,707 INFO L273 TraceCheckUtils]: 18: Hoare triple {23354#(<= main_~i~1 4)} assume true; {23354#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:34,708 INFO L273 TraceCheckUtils]: 19: Hoare triple {23354#(<= 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; {23354#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:34,708 INFO L273 TraceCheckUtils]: 20: Hoare triple {23354#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23355#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:34,709 INFO L273 TraceCheckUtils]: 21: Hoare triple {23355#(<= main_~i~1 5)} assume true; {23355#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:34,709 INFO L273 TraceCheckUtils]: 22: Hoare triple {23355#(<= 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; {23355#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:34,710 INFO L273 TraceCheckUtils]: 23: Hoare triple {23355#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23356#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:34,711 INFO L273 TraceCheckUtils]: 24: Hoare triple {23356#(<= main_~i~1 6)} assume true; {23356#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:34,711 INFO L273 TraceCheckUtils]: 25: Hoare triple {23356#(<= 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; {23356#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:34,712 INFO L273 TraceCheckUtils]: 26: Hoare triple {23356#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23357#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:34,712 INFO L273 TraceCheckUtils]: 27: Hoare triple {23357#(<= main_~i~1 7)} assume true; {23357#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:34,713 INFO L273 TraceCheckUtils]: 28: Hoare triple {23357#(<= 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; {23357#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:34,713 INFO L273 TraceCheckUtils]: 29: Hoare triple {23357#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23358#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:34,714 INFO L273 TraceCheckUtils]: 30: Hoare triple {23358#(<= main_~i~1 8)} assume true; {23358#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:34,714 INFO L273 TraceCheckUtils]: 31: Hoare triple {23358#(<= 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; {23358#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:34,715 INFO L273 TraceCheckUtils]: 32: Hoare triple {23358#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23359#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:34,716 INFO L273 TraceCheckUtils]: 33: Hoare triple {23359#(<= main_~i~1 9)} assume true; {23359#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:34,716 INFO L273 TraceCheckUtils]: 34: Hoare triple {23359#(<= 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; {23359#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:34,717 INFO L273 TraceCheckUtils]: 35: Hoare triple {23359#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23360#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:34,717 INFO L273 TraceCheckUtils]: 36: Hoare triple {23360#(<= main_~i~1 10)} assume true; {23360#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:34,718 INFO L273 TraceCheckUtils]: 37: Hoare triple {23360#(<= 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; {23360#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:34,719 INFO L273 TraceCheckUtils]: 38: Hoare triple {23360#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23361#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:34,719 INFO L273 TraceCheckUtils]: 39: Hoare triple {23361#(<= main_~i~1 11)} assume true; {23361#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:34,720 INFO L273 TraceCheckUtils]: 40: Hoare triple {23361#(<= 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; {23361#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:34,720 INFO L273 TraceCheckUtils]: 41: Hoare triple {23361#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23362#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:34,721 INFO L273 TraceCheckUtils]: 42: Hoare triple {23362#(<= main_~i~1 12)} assume true; {23362#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:34,721 INFO L273 TraceCheckUtils]: 43: Hoare triple {23362#(<= 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; {23362#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:34,722 INFO L273 TraceCheckUtils]: 44: Hoare triple {23362#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23363#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:34,723 INFO L273 TraceCheckUtils]: 45: Hoare triple {23363#(<= main_~i~1 13)} assume true; {23363#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:34,723 INFO L273 TraceCheckUtils]: 46: Hoare triple {23363#(<= 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; {23363#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:34,724 INFO L273 TraceCheckUtils]: 47: Hoare triple {23363#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23364#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:34,724 INFO L273 TraceCheckUtils]: 48: Hoare triple {23364#(<= main_~i~1 14)} assume true; {23364#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:34,725 INFO L273 TraceCheckUtils]: 49: Hoare triple {23364#(<= 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; {23364#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:34,726 INFO L273 TraceCheckUtils]: 50: Hoare triple {23364#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23365#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:34,726 INFO L273 TraceCheckUtils]: 51: Hoare triple {23365#(<= main_~i~1 15)} assume true; {23365#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:34,727 INFO L273 TraceCheckUtils]: 52: Hoare triple {23365#(<= 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; {23365#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:34,727 INFO L273 TraceCheckUtils]: 53: Hoare triple {23365#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23366#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:34,728 INFO L273 TraceCheckUtils]: 54: Hoare triple {23366#(<= main_~i~1 16)} assume true; {23366#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:34,728 INFO L273 TraceCheckUtils]: 55: Hoare triple {23366#(<= 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; {23366#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:34,729 INFO L273 TraceCheckUtils]: 56: Hoare triple {23366#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23367#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:34,730 INFO L273 TraceCheckUtils]: 57: Hoare triple {23367#(<= main_~i~1 17)} assume true; {23367#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:34,730 INFO L273 TraceCheckUtils]: 58: Hoare triple {23367#(<= 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; {23367#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:34,731 INFO L273 TraceCheckUtils]: 59: Hoare triple {23367#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23368#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:34,731 INFO L273 TraceCheckUtils]: 60: Hoare triple {23368#(<= main_~i~1 18)} assume true; {23368#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:34,736 INFO L273 TraceCheckUtils]: 61: Hoare triple {23368#(<= 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; {23368#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:34,736 INFO L273 TraceCheckUtils]: 62: Hoare triple {23368#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23369#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:34,737 INFO L273 TraceCheckUtils]: 63: Hoare triple {23369#(<= main_~i~1 19)} assume true; {23369#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:34,737 INFO L273 TraceCheckUtils]: 64: Hoare triple {23369#(<= 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; {23369#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:34,737 INFO L273 TraceCheckUtils]: 65: Hoare triple {23369#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23370#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:34,738 INFO L273 TraceCheckUtils]: 66: Hoare triple {23370#(<= main_~i~1 20)} assume true; {23370#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:34,738 INFO L273 TraceCheckUtils]: 67: Hoare triple {23370#(<= 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; {23370#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:34,739 INFO L273 TraceCheckUtils]: 68: Hoare triple {23370#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23371#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:34,739 INFO L273 TraceCheckUtils]: 69: Hoare triple {23371#(<= main_~i~1 21)} assume true; {23371#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:34,740 INFO L273 TraceCheckUtils]: 70: Hoare triple {23371#(<= 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; {23371#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:34,741 INFO L273 TraceCheckUtils]: 71: Hoare triple {23371#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23372#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:34,741 INFO L273 TraceCheckUtils]: 72: Hoare triple {23372#(<= main_~i~1 22)} assume true; {23372#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:34,742 INFO L273 TraceCheckUtils]: 73: Hoare triple {23372#(<= 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; {23372#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:34,742 INFO L273 TraceCheckUtils]: 74: Hoare triple {23372#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23373#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:34,743 INFO L273 TraceCheckUtils]: 75: Hoare triple {23373#(<= main_~i~1 23)} assume true; {23373#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:34,743 INFO L273 TraceCheckUtils]: 76: Hoare triple {23373#(<= 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; {23373#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:34,744 INFO L273 TraceCheckUtils]: 77: Hoare triple {23373#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23374#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:34,745 INFO L273 TraceCheckUtils]: 78: Hoare triple {23374#(<= main_~i~1 24)} assume true; {23374#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:34,745 INFO L273 TraceCheckUtils]: 79: Hoare triple {23374#(<= 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; {23374#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:34,746 INFO L273 TraceCheckUtils]: 80: Hoare triple {23374#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23375#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:34,746 INFO L273 TraceCheckUtils]: 81: Hoare triple {23375#(<= main_~i~1 25)} assume true; {23375#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:34,747 INFO L273 TraceCheckUtils]: 82: Hoare triple {23375#(<= 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; {23375#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:34,748 INFO L273 TraceCheckUtils]: 83: Hoare triple {23375#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23376#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:34,748 INFO L273 TraceCheckUtils]: 84: Hoare triple {23376#(<= main_~i~1 26)} assume true; {23376#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:34,749 INFO L273 TraceCheckUtils]: 85: Hoare triple {23376#(<= main_~i~1 26)} assume !(~i~1 < 10000); {23349#false} is VALID [2018-11-14 17:08:34,749 INFO L256 TraceCheckUtils]: 86: Hoare triple {23349#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {23348#true} is VALID [2018-11-14 17:08:34,749 INFO L273 TraceCheckUtils]: 87: Hoare triple {23348#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; {23348#true} is VALID [2018-11-14 17:08:34,749 INFO L273 TraceCheckUtils]: 88: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,749 INFO L273 TraceCheckUtils]: 89: Hoare triple {23348#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:08:34,750 INFO L273 TraceCheckUtils]: 90: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:08:34,750 INFO L273 TraceCheckUtils]: 91: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,750 INFO L273 TraceCheckUtils]: 92: Hoare triple {23348#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:08:34,750 INFO L273 TraceCheckUtils]: 93: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:08:34,750 INFO L273 TraceCheckUtils]: 94: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,750 INFO L273 TraceCheckUtils]: 95: Hoare triple {23348#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:08:34,751 INFO L273 TraceCheckUtils]: 96: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:08:34,751 INFO L273 TraceCheckUtils]: 97: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,751 INFO L273 TraceCheckUtils]: 98: Hoare triple {23348#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:08:34,751 INFO L273 TraceCheckUtils]: 99: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:08:34,752 INFO L273 TraceCheckUtils]: 100: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,752 INFO L273 TraceCheckUtils]: 101: Hoare triple {23348#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:08:34,752 INFO L273 TraceCheckUtils]: 102: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:08:34,752 INFO L273 TraceCheckUtils]: 103: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,752 INFO L273 TraceCheckUtils]: 104: Hoare triple {23348#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:08:34,753 INFO L273 TraceCheckUtils]: 105: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:08:34,753 INFO L273 TraceCheckUtils]: 106: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,753 INFO L273 TraceCheckUtils]: 107: Hoare triple {23348#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:08:34,753 INFO L273 TraceCheckUtils]: 108: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:08:34,753 INFO L273 TraceCheckUtils]: 109: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,753 INFO L273 TraceCheckUtils]: 110: Hoare triple {23348#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:08:34,753 INFO L273 TraceCheckUtils]: 111: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:08:34,754 INFO L273 TraceCheckUtils]: 112: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,754 INFO L273 TraceCheckUtils]: 113: Hoare triple {23348#true} assume !(~i~0 < 10000); {23348#true} is VALID [2018-11-14 17:08:34,754 INFO L273 TraceCheckUtils]: 114: Hoare triple {23348#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23348#true} is VALID [2018-11-14 17:08:34,754 INFO L273 TraceCheckUtils]: 115: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,754 INFO L268 TraceCheckUtils]: 116: Hoare quadruple {23348#true} {23349#false} #73#return; {23349#false} is VALID [2018-11-14 17:08:34,754 INFO L273 TraceCheckUtils]: 117: Hoare triple {23349#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); {23349#false} is VALID [2018-11-14 17:08:34,755 INFO L256 TraceCheckUtils]: 118: Hoare triple {23349#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {23348#true} is VALID [2018-11-14 17:08:34,755 INFO L273 TraceCheckUtils]: 119: Hoare triple {23348#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; {23348#true} is VALID [2018-11-14 17:08:34,755 INFO L273 TraceCheckUtils]: 120: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,755 INFO L273 TraceCheckUtils]: 121: Hoare triple {23348#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:08:34,755 INFO L273 TraceCheckUtils]: 122: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:08:34,755 INFO L273 TraceCheckUtils]: 123: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,756 INFO L273 TraceCheckUtils]: 124: Hoare triple {23348#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:08:34,756 INFO L273 TraceCheckUtils]: 125: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:08:34,756 INFO L273 TraceCheckUtils]: 126: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,756 INFO L273 TraceCheckUtils]: 127: Hoare triple {23348#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:08:34,756 INFO L273 TraceCheckUtils]: 128: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:08:34,756 INFO L273 TraceCheckUtils]: 129: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,756 INFO L273 TraceCheckUtils]: 130: Hoare triple {23348#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:08:34,757 INFO L273 TraceCheckUtils]: 131: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:08:34,757 INFO L273 TraceCheckUtils]: 132: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,757 INFO L273 TraceCheckUtils]: 133: Hoare triple {23348#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:08:34,757 INFO L273 TraceCheckUtils]: 134: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:08:34,757 INFO L273 TraceCheckUtils]: 135: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,757 INFO L273 TraceCheckUtils]: 136: Hoare triple {23348#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:08:34,757 INFO L273 TraceCheckUtils]: 137: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:08:34,758 INFO L273 TraceCheckUtils]: 138: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,758 INFO L273 TraceCheckUtils]: 139: Hoare triple {23348#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:08:34,758 INFO L273 TraceCheckUtils]: 140: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:08:34,758 INFO L273 TraceCheckUtils]: 141: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,758 INFO L273 TraceCheckUtils]: 142: Hoare triple {23348#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:08:34,758 INFO L273 TraceCheckUtils]: 143: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:08:34,758 INFO L273 TraceCheckUtils]: 144: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,759 INFO L273 TraceCheckUtils]: 145: Hoare triple {23348#true} assume !(~i~0 < 10000); {23348#true} is VALID [2018-11-14 17:08:34,759 INFO L273 TraceCheckUtils]: 146: Hoare triple {23348#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23348#true} is VALID [2018-11-14 17:08:34,759 INFO L273 TraceCheckUtils]: 147: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,759 INFO L268 TraceCheckUtils]: 148: Hoare quadruple {23348#true} {23349#false} #75#return; {23349#false} is VALID [2018-11-14 17:08:34,759 INFO L273 TraceCheckUtils]: 149: Hoare triple {23349#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; {23349#false} is VALID [2018-11-14 17:08:34,759 INFO L273 TraceCheckUtils]: 150: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:34,760 INFO L273 TraceCheckUtils]: 151: Hoare triple {23349#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 17:08:34,760 INFO L273 TraceCheckUtils]: 152: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 17:08:34,760 INFO L273 TraceCheckUtils]: 153: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:34,760 INFO L273 TraceCheckUtils]: 154: Hoare triple {23349#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 17:08:34,760 INFO L273 TraceCheckUtils]: 155: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 17:08:34,760 INFO L273 TraceCheckUtils]: 156: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:34,760 INFO L273 TraceCheckUtils]: 157: Hoare triple {23349#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 17:08:34,761 INFO L273 TraceCheckUtils]: 158: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 17:08:34,761 INFO L273 TraceCheckUtils]: 159: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:34,761 INFO L273 TraceCheckUtils]: 160: Hoare triple {23349#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 17:08:34,761 INFO L273 TraceCheckUtils]: 161: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 17:08:34,761 INFO L273 TraceCheckUtils]: 162: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:34,761 INFO L273 TraceCheckUtils]: 163: Hoare triple {23349#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 17:08:34,761 INFO L273 TraceCheckUtils]: 164: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 17:08:34,762 INFO L273 TraceCheckUtils]: 165: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:34,762 INFO L273 TraceCheckUtils]: 166: Hoare triple {23349#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 17:08:34,762 INFO L273 TraceCheckUtils]: 167: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 17:08:34,762 INFO L273 TraceCheckUtils]: 168: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:34,762 INFO L273 TraceCheckUtils]: 169: Hoare triple {23349#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 17:08:34,762 INFO L273 TraceCheckUtils]: 170: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 17:08:34,762 INFO L273 TraceCheckUtils]: 171: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:34,763 INFO L273 TraceCheckUtils]: 172: Hoare triple {23349#false} assume !(~i~2 < 9999); {23349#false} is VALID [2018-11-14 17:08:34,763 INFO L273 TraceCheckUtils]: 173: Hoare triple {23349#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {23349#false} is VALID [2018-11-14 17:08:34,763 INFO L256 TraceCheckUtils]: 174: Hoare triple {23349#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {23348#true} is VALID [2018-11-14 17:08:34,763 INFO L273 TraceCheckUtils]: 175: Hoare triple {23348#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; {23348#true} is VALID [2018-11-14 17:08:34,763 INFO L273 TraceCheckUtils]: 176: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,763 INFO L273 TraceCheckUtils]: 177: Hoare triple {23348#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:08:34,763 INFO L273 TraceCheckUtils]: 178: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:08:34,764 INFO L273 TraceCheckUtils]: 179: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,764 INFO L273 TraceCheckUtils]: 180: Hoare triple {23348#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:08:34,764 INFO L273 TraceCheckUtils]: 181: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:08:34,764 INFO L273 TraceCheckUtils]: 182: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,764 INFO L273 TraceCheckUtils]: 183: Hoare triple {23348#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:08:34,764 INFO L273 TraceCheckUtils]: 184: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:08:34,764 INFO L273 TraceCheckUtils]: 185: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,765 INFO L273 TraceCheckUtils]: 186: Hoare triple {23348#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:08:34,765 INFO L273 TraceCheckUtils]: 187: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:08:34,765 INFO L273 TraceCheckUtils]: 188: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,765 INFO L273 TraceCheckUtils]: 189: Hoare triple {23348#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:08:34,765 INFO L273 TraceCheckUtils]: 190: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:08:34,765 INFO L273 TraceCheckUtils]: 191: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,765 INFO L273 TraceCheckUtils]: 192: Hoare triple {23348#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:08:34,766 INFO L273 TraceCheckUtils]: 193: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:08:34,766 INFO L273 TraceCheckUtils]: 194: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,766 INFO L273 TraceCheckUtils]: 195: Hoare triple {23348#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:08:34,766 INFO L273 TraceCheckUtils]: 196: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:08:34,766 INFO L273 TraceCheckUtils]: 197: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,766 INFO L273 TraceCheckUtils]: 198: Hoare triple {23348#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:08:34,767 INFO L273 TraceCheckUtils]: 199: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:08:34,767 INFO L273 TraceCheckUtils]: 200: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,767 INFO L273 TraceCheckUtils]: 201: Hoare triple {23348#true} assume !(~i~0 < 10000); {23348#true} is VALID [2018-11-14 17:08:34,767 INFO L273 TraceCheckUtils]: 202: Hoare triple {23348#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23348#true} is VALID [2018-11-14 17:08:34,767 INFO L273 TraceCheckUtils]: 203: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:34,767 INFO L268 TraceCheckUtils]: 204: Hoare quadruple {23348#true} {23349#false} #77#return; {23349#false} is VALID [2018-11-14 17:08:34,767 INFO L273 TraceCheckUtils]: 205: Hoare triple {23349#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {23349#false} is VALID [2018-11-14 17:08:34,768 INFO L273 TraceCheckUtils]: 206: Hoare triple {23349#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {23349#false} is VALID [2018-11-14 17:08:34,768 INFO L273 TraceCheckUtils]: 207: Hoare triple {23349#false} assume !false; {23349#false} is VALID [2018-11-14 17:08:34,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2094 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-11-14 17:08:34,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:34,794 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:34,810 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:08:34,881 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:08:34,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:08:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:34,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:35,222 INFO L256 TraceCheckUtils]: 0: Hoare triple {23348#true} call ULTIMATE.init(); {23348#true} is VALID [2018-11-14 17:08:35,222 INFO L273 TraceCheckUtils]: 1: Hoare triple {23348#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23348#true} is VALID [2018-11-14 17:08:35,222 INFO L273 TraceCheckUtils]: 2: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:08:35,223 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23348#true} {23348#true} #69#return; {23348#true} is VALID [2018-11-14 17:08:35,223 INFO L256 TraceCheckUtils]: 4: Hoare triple {23348#true} call #t~ret13 := main(); {23348#true} is VALID [2018-11-14 17:08:35,223 INFO L273 TraceCheckUtils]: 5: Hoare triple {23348#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; {23395#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:35,224 INFO L273 TraceCheckUtils]: 6: Hoare triple {23395#(<= main_~i~1 0)} assume true; {23395#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:35,224 INFO L273 TraceCheckUtils]: 7: Hoare triple {23395#(<= 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; {23395#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:35,225 INFO L273 TraceCheckUtils]: 8: Hoare triple {23395#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23351#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:35,225 INFO L273 TraceCheckUtils]: 9: Hoare triple {23351#(<= main_~i~1 1)} assume true; {23351#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:35,226 INFO L273 TraceCheckUtils]: 10: Hoare triple {23351#(<= 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; {23351#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:35,226 INFO L273 TraceCheckUtils]: 11: Hoare triple {23351#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23352#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:35,226 INFO L273 TraceCheckUtils]: 12: Hoare triple {23352#(<= main_~i~1 2)} assume true; {23352#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:35,227 INFO L273 TraceCheckUtils]: 13: Hoare triple {23352#(<= 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; {23352#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:35,227 INFO L273 TraceCheckUtils]: 14: Hoare triple {23352#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23353#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:35,228 INFO L273 TraceCheckUtils]: 15: Hoare triple {23353#(<= main_~i~1 3)} assume true; {23353#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:35,228 INFO L273 TraceCheckUtils]: 16: Hoare triple {23353#(<= 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; {23353#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:35,229 INFO L273 TraceCheckUtils]: 17: Hoare triple {23353#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23354#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:35,230 INFO L273 TraceCheckUtils]: 18: Hoare triple {23354#(<= main_~i~1 4)} assume true; {23354#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:35,230 INFO L273 TraceCheckUtils]: 19: Hoare triple {23354#(<= 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; {23354#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:35,231 INFO L273 TraceCheckUtils]: 20: Hoare triple {23354#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23355#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:35,231 INFO L273 TraceCheckUtils]: 21: Hoare triple {23355#(<= main_~i~1 5)} assume true; {23355#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:35,232 INFO L273 TraceCheckUtils]: 22: Hoare triple {23355#(<= 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; {23355#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:35,232 INFO L273 TraceCheckUtils]: 23: Hoare triple {23355#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23356#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:35,233 INFO L273 TraceCheckUtils]: 24: Hoare triple {23356#(<= main_~i~1 6)} assume true; {23356#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:35,233 INFO L273 TraceCheckUtils]: 25: Hoare triple {23356#(<= 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; {23356#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:35,234 INFO L273 TraceCheckUtils]: 26: Hoare triple {23356#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23357#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:35,235 INFO L273 TraceCheckUtils]: 27: Hoare triple {23357#(<= main_~i~1 7)} assume true; {23357#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:35,235 INFO L273 TraceCheckUtils]: 28: Hoare triple {23357#(<= 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; {23357#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:35,236 INFO L273 TraceCheckUtils]: 29: Hoare triple {23357#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23358#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:35,236 INFO L273 TraceCheckUtils]: 30: Hoare triple {23358#(<= main_~i~1 8)} assume true; {23358#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:35,237 INFO L273 TraceCheckUtils]: 31: Hoare triple {23358#(<= 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; {23358#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:35,237 INFO L273 TraceCheckUtils]: 32: Hoare triple {23358#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23359#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:35,238 INFO L273 TraceCheckUtils]: 33: Hoare triple {23359#(<= main_~i~1 9)} assume true; {23359#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:35,238 INFO L273 TraceCheckUtils]: 34: Hoare triple {23359#(<= 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; {23359#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:35,239 INFO L273 TraceCheckUtils]: 35: Hoare triple {23359#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23360#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:35,240 INFO L273 TraceCheckUtils]: 36: Hoare triple {23360#(<= main_~i~1 10)} assume true; {23360#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:35,240 INFO L273 TraceCheckUtils]: 37: Hoare triple {23360#(<= 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; {23360#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:35,241 INFO L273 TraceCheckUtils]: 38: Hoare triple {23360#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23361#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:35,241 INFO L273 TraceCheckUtils]: 39: Hoare triple {23361#(<= main_~i~1 11)} assume true; {23361#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:35,242 INFO L273 TraceCheckUtils]: 40: Hoare triple {23361#(<= 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; {23361#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:35,243 INFO L273 TraceCheckUtils]: 41: Hoare triple {23361#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23362#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:35,243 INFO L273 TraceCheckUtils]: 42: Hoare triple {23362#(<= main_~i~1 12)} assume true; {23362#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:35,244 INFO L273 TraceCheckUtils]: 43: Hoare triple {23362#(<= 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; {23362#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:35,244 INFO L273 TraceCheckUtils]: 44: Hoare triple {23362#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23363#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:35,245 INFO L273 TraceCheckUtils]: 45: Hoare triple {23363#(<= main_~i~1 13)} assume true; {23363#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:35,245 INFO L273 TraceCheckUtils]: 46: Hoare triple {23363#(<= 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; {23363#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:35,246 INFO L273 TraceCheckUtils]: 47: Hoare triple {23363#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23364#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:35,246 INFO L273 TraceCheckUtils]: 48: Hoare triple {23364#(<= main_~i~1 14)} assume true; {23364#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:35,247 INFO L273 TraceCheckUtils]: 49: Hoare triple {23364#(<= 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; {23364#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:35,248 INFO L273 TraceCheckUtils]: 50: Hoare triple {23364#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23365#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:35,248 INFO L273 TraceCheckUtils]: 51: Hoare triple {23365#(<= main_~i~1 15)} assume true; {23365#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:35,249 INFO L273 TraceCheckUtils]: 52: Hoare triple {23365#(<= 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; {23365#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:35,249 INFO L273 TraceCheckUtils]: 53: Hoare triple {23365#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23366#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:35,250 INFO L273 TraceCheckUtils]: 54: Hoare triple {23366#(<= main_~i~1 16)} assume true; {23366#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:35,250 INFO L273 TraceCheckUtils]: 55: Hoare triple {23366#(<= 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; {23366#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:35,251 INFO L273 TraceCheckUtils]: 56: Hoare triple {23366#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23367#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:35,252 INFO L273 TraceCheckUtils]: 57: Hoare triple {23367#(<= main_~i~1 17)} assume true; {23367#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:35,252 INFO L273 TraceCheckUtils]: 58: Hoare triple {23367#(<= 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; {23367#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:35,253 INFO L273 TraceCheckUtils]: 59: Hoare triple {23367#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23368#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:35,253 INFO L273 TraceCheckUtils]: 60: Hoare triple {23368#(<= main_~i~1 18)} assume true; {23368#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:35,254 INFO L273 TraceCheckUtils]: 61: Hoare triple {23368#(<= 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; {23368#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:35,255 INFO L273 TraceCheckUtils]: 62: Hoare triple {23368#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23369#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:35,255 INFO L273 TraceCheckUtils]: 63: Hoare triple {23369#(<= main_~i~1 19)} assume true; {23369#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:35,256 INFO L273 TraceCheckUtils]: 64: Hoare triple {23369#(<= 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; {23369#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:35,256 INFO L273 TraceCheckUtils]: 65: Hoare triple {23369#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23370#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:35,257 INFO L273 TraceCheckUtils]: 66: Hoare triple {23370#(<= main_~i~1 20)} assume true; {23370#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:35,257 INFO L273 TraceCheckUtils]: 67: Hoare triple {23370#(<= 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; {23370#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:35,258 INFO L273 TraceCheckUtils]: 68: Hoare triple {23370#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23371#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:35,258 INFO L273 TraceCheckUtils]: 69: Hoare triple {23371#(<= main_~i~1 21)} assume true; {23371#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:35,259 INFO L273 TraceCheckUtils]: 70: Hoare triple {23371#(<= 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; {23371#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:35,260 INFO L273 TraceCheckUtils]: 71: Hoare triple {23371#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23372#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:35,260 INFO L273 TraceCheckUtils]: 72: Hoare triple {23372#(<= main_~i~1 22)} assume true; {23372#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:35,261 INFO L273 TraceCheckUtils]: 73: Hoare triple {23372#(<= 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; {23372#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:35,261 INFO L273 TraceCheckUtils]: 74: Hoare triple {23372#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23373#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:35,262 INFO L273 TraceCheckUtils]: 75: Hoare triple {23373#(<= main_~i~1 23)} assume true; {23373#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:35,262 INFO L273 TraceCheckUtils]: 76: Hoare triple {23373#(<= 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; {23373#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:35,263 INFO L273 TraceCheckUtils]: 77: Hoare triple {23373#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23374#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:35,264 INFO L273 TraceCheckUtils]: 78: Hoare triple {23374#(<= main_~i~1 24)} assume true; {23374#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:35,264 INFO L273 TraceCheckUtils]: 79: Hoare triple {23374#(<= 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; {23374#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:35,265 INFO L273 TraceCheckUtils]: 80: Hoare triple {23374#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23375#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:35,265 INFO L273 TraceCheckUtils]: 81: Hoare triple {23375#(<= main_~i~1 25)} assume true; {23375#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:35,266 INFO L273 TraceCheckUtils]: 82: Hoare triple {23375#(<= 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; {23375#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:35,266 INFO L273 TraceCheckUtils]: 83: Hoare triple {23375#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23376#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:35,267 INFO L273 TraceCheckUtils]: 84: Hoare triple {23376#(<= main_~i~1 26)} assume true; {23376#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:35,268 INFO L273 TraceCheckUtils]: 85: Hoare triple {23376#(<= main_~i~1 26)} assume !(~i~1 < 10000); {23349#false} is VALID [2018-11-14 17:08:35,268 INFO L256 TraceCheckUtils]: 86: Hoare triple {23349#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {23349#false} is VALID [2018-11-14 17:08:35,268 INFO L273 TraceCheckUtils]: 87: Hoare triple {23349#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; {23349#false} is VALID [2018-11-14 17:08:35,268 INFO L273 TraceCheckUtils]: 88: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,268 INFO L273 TraceCheckUtils]: 89: Hoare triple {23349#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:08:35,268 INFO L273 TraceCheckUtils]: 90: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:08:35,269 INFO L273 TraceCheckUtils]: 91: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,269 INFO L273 TraceCheckUtils]: 92: Hoare triple {23349#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:08:35,269 INFO L273 TraceCheckUtils]: 93: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:08:35,269 INFO L273 TraceCheckUtils]: 94: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,269 INFO L273 TraceCheckUtils]: 95: Hoare triple {23349#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:08:35,270 INFO L273 TraceCheckUtils]: 96: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:08:35,270 INFO L273 TraceCheckUtils]: 97: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,270 INFO L273 TraceCheckUtils]: 98: Hoare triple {23349#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:08:35,270 INFO L273 TraceCheckUtils]: 99: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:08:35,270 INFO L273 TraceCheckUtils]: 100: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,270 INFO L273 TraceCheckUtils]: 101: Hoare triple {23349#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:08:35,271 INFO L273 TraceCheckUtils]: 102: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:08:35,271 INFO L273 TraceCheckUtils]: 103: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,271 INFO L273 TraceCheckUtils]: 104: Hoare triple {23349#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:08:35,271 INFO L273 TraceCheckUtils]: 105: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:08:35,271 INFO L273 TraceCheckUtils]: 106: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,271 INFO L273 TraceCheckUtils]: 107: Hoare triple {23349#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:08:35,272 INFO L273 TraceCheckUtils]: 108: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:08:35,272 INFO L273 TraceCheckUtils]: 109: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,272 INFO L273 TraceCheckUtils]: 110: Hoare triple {23349#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:08:35,272 INFO L273 TraceCheckUtils]: 111: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:08:35,272 INFO L273 TraceCheckUtils]: 112: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,272 INFO L273 TraceCheckUtils]: 113: Hoare triple {23349#false} assume !(~i~0 < 10000); {23349#false} is VALID [2018-11-14 17:08:35,272 INFO L273 TraceCheckUtils]: 114: Hoare triple {23349#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23349#false} is VALID [2018-11-14 17:08:35,272 INFO L273 TraceCheckUtils]: 115: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,273 INFO L268 TraceCheckUtils]: 116: Hoare quadruple {23349#false} {23349#false} #73#return; {23349#false} is VALID [2018-11-14 17:08:35,273 INFO L273 TraceCheckUtils]: 117: Hoare triple {23349#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); {23349#false} is VALID [2018-11-14 17:08:35,273 INFO L256 TraceCheckUtils]: 118: Hoare triple {23349#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {23349#false} is VALID [2018-11-14 17:08:35,273 INFO L273 TraceCheckUtils]: 119: Hoare triple {23349#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; {23349#false} is VALID [2018-11-14 17:08:35,273 INFO L273 TraceCheckUtils]: 120: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,273 INFO L273 TraceCheckUtils]: 121: Hoare triple {23349#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:08:35,273 INFO L273 TraceCheckUtils]: 122: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:08:35,273 INFO L273 TraceCheckUtils]: 123: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,273 INFO L273 TraceCheckUtils]: 124: Hoare triple {23349#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:08:35,273 INFO L273 TraceCheckUtils]: 125: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:08:35,274 INFO L273 TraceCheckUtils]: 126: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,274 INFO L273 TraceCheckUtils]: 127: Hoare triple {23349#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:08:35,274 INFO L273 TraceCheckUtils]: 128: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:08:35,274 INFO L273 TraceCheckUtils]: 129: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,274 INFO L273 TraceCheckUtils]: 130: Hoare triple {23349#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:08:35,274 INFO L273 TraceCheckUtils]: 131: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:08:35,274 INFO L273 TraceCheckUtils]: 132: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,274 INFO L273 TraceCheckUtils]: 133: Hoare triple {23349#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:08:35,274 INFO L273 TraceCheckUtils]: 134: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:08:35,274 INFO L273 TraceCheckUtils]: 135: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,275 INFO L273 TraceCheckUtils]: 136: Hoare triple {23349#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:08:35,275 INFO L273 TraceCheckUtils]: 137: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:08:35,275 INFO L273 TraceCheckUtils]: 138: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,275 INFO L273 TraceCheckUtils]: 139: Hoare triple {23349#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:08:35,275 INFO L273 TraceCheckUtils]: 140: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:08:35,275 INFO L273 TraceCheckUtils]: 141: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,275 INFO L273 TraceCheckUtils]: 142: Hoare triple {23349#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:08:35,275 INFO L273 TraceCheckUtils]: 143: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:08:35,275 INFO L273 TraceCheckUtils]: 144: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,275 INFO L273 TraceCheckUtils]: 145: Hoare triple {23349#false} assume !(~i~0 < 10000); {23349#false} is VALID [2018-11-14 17:08:35,276 INFO L273 TraceCheckUtils]: 146: Hoare triple {23349#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23349#false} is VALID [2018-11-14 17:08:35,276 INFO L273 TraceCheckUtils]: 147: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,276 INFO L268 TraceCheckUtils]: 148: Hoare quadruple {23349#false} {23349#false} #75#return; {23349#false} is VALID [2018-11-14 17:08:35,276 INFO L273 TraceCheckUtils]: 149: Hoare triple {23349#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; {23349#false} is VALID [2018-11-14 17:08:35,276 INFO L273 TraceCheckUtils]: 150: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,276 INFO L273 TraceCheckUtils]: 151: Hoare triple {23349#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 17:08:35,276 INFO L273 TraceCheckUtils]: 152: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 17:08:35,276 INFO L273 TraceCheckUtils]: 153: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,276 INFO L273 TraceCheckUtils]: 154: Hoare triple {23349#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 17:08:35,276 INFO L273 TraceCheckUtils]: 155: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 17:08:35,277 INFO L273 TraceCheckUtils]: 156: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,277 INFO L273 TraceCheckUtils]: 157: Hoare triple {23349#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 17:08:35,277 INFO L273 TraceCheckUtils]: 158: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 17:08:35,277 INFO L273 TraceCheckUtils]: 159: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,277 INFO L273 TraceCheckUtils]: 160: Hoare triple {23349#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 17:08:35,277 INFO L273 TraceCheckUtils]: 161: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 17:08:35,277 INFO L273 TraceCheckUtils]: 162: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,277 INFO L273 TraceCheckUtils]: 163: Hoare triple {23349#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 17:08:35,277 INFO L273 TraceCheckUtils]: 164: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 17:08:35,277 INFO L273 TraceCheckUtils]: 165: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,278 INFO L273 TraceCheckUtils]: 166: Hoare triple {23349#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 17:08:35,278 INFO L273 TraceCheckUtils]: 167: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 17:08:35,278 INFO L273 TraceCheckUtils]: 168: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,278 INFO L273 TraceCheckUtils]: 169: Hoare triple {23349#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 17:08:35,278 INFO L273 TraceCheckUtils]: 170: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 17:08:35,278 INFO L273 TraceCheckUtils]: 171: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,278 INFO L273 TraceCheckUtils]: 172: Hoare triple {23349#false} assume !(~i~2 < 9999); {23349#false} is VALID [2018-11-14 17:08:35,278 INFO L273 TraceCheckUtils]: 173: Hoare triple {23349#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {23349#false} is VALID [2018-11-14 17:08:35,278 INFO L256 TraceCheckUtils]: 174: Hoare triple {23349#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {23349#false} is VALID [2018-11-14 17:08:35,278 INFO L273 TraceCheckUtils]: 175: Hoare triple {23349#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; {23349#false} is VALID [2018-11-14 17:08:35,279 INFO L273 TraceCheckUtils]: 176: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,279 INFO L273 TraceCheckUtils]: 177: Hoare triple {23349#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:08:35,279 INFO L273 TraceCheckUtils]: 178: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:08:35,279 INFO L273 TraceCheckUtils]: 179: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,279 INFO L273 TraceCheckUtils]: 180: Hoare triple {23349#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:08:35,279 INFO L273 TraceCheckUtils]: 181: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:08:35,279 INFO L273 TraceCheckUtils]: 182: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,279 INFO L273 TraceCheckUtils]: 183: Hoare triple {23349#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:08:35,279 INFO L273 TraceCheckUtils]: 184: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:08:35,279 INFO L273 TraceCheckUtils]: 185: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,280 INFO L273 TraceCheckUtils]: 186: Hoare triple {23349#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:08:35,280 INFO L273 TraceCheckUtils]: 187: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:08:35,280 INFO L273 TraceCheckUtils]: 188: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,280 INFO L273 TraceCheckUtils]: 189: Hoare triple {23349#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:08:35,280 INFO L273 TraceCheckUtils]: 190: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:08:35,280 INFO L273 TraceCheckUtils]: 191: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,280 INFO L273 TraceCheckUtils]: 192: Hoare triple {23349#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:08:35,280 INFO L273 TraceCheckUtils]: 193: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:08:35,280 INFO L273 TraceCheckUtils]: 194: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,280 INFO L273 TraceCheckUtils]: 195: Hoare triple {23349#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:08:35,281 INFO L273 TraceCheckUtils]: 196: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:08:35,281 INFO L273 TraceCheckUtils]: 197: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,281 INFO L273 TraceCheckUtils]: 198: Hoare triple {23349#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:08:35,281 INFO L273 TraceCheckUtils]: 199: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:08:35,281 INFO L273 TraceCheckUtils]: 200: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,281 INFO L273 TraceCheckUtils]: 201: Hoare triple {23349#false} assume !(~i~0 < 10000); {23349#false} is VALID [2018-11-14 17:08:35,281 INFO L273 TraceCheckUtils]: 202: Hoare triple {23349#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23349#false} is VALID [2018-11-14 17:08:35,281 INFO L273 TraceCheckUtils]: 203: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:08:35,281 INFO L268 TraceCheckUtils]: 204: Hoare quadruple {23349#false} {23349#false} #77#return; {23349#false} is VALID [2018-11-14 17:08:35,281 INFO L273 TraceCheckUtils]: 205: Hoare triple {23349#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {23349#false} is VALID [2018-11-14 17:08:35,281 INFO L273 TraceCheckUtils]: 206: Hoare triple {23349#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {23349#false} is VALID [2018-11-14 17:08:35,282 INFO L273 TraceCheckUtils]: 207: Hoare triple {23349#false} assume !false; {23349#false} is VALID [2018-11-14 17:08:35,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2094 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-11-14 17:08:35,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:35,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-14 17:08:35,322 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 208 [2018-11-14 17:08:35,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:35,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-14 17:08:35,432 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:35,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-14 17:08:35,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-14 17:08:35,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-14 17:08:35,434 INFO L87 Difference]: Start difference. First operand 149 states and 153 transitions. Second operand 30 states. [2018-11-14 17:08:36,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:36,061 INFO L93 Difference]: Finished difference Result 216 states and 224 transitions. [2018-11-14 17:08:36,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-14 17:08:36,061 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 208 [2018-11-14 17:08:36,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:36,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 17:08:36,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 138 transitions. [2018-11-14 17:08:36,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 17:08:36,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 138 transitions. [2018-11-14 17:08:36,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 138 transitions. [2018-11-14 17:08:36,228 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:36,231 INFO L225 Difference]: With dead ends: 216 [2018-11-14 17:08:36,232 INFO L226 Difference]: Without dead ends: 153 [2018-11-14 17:08:36,233 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-14 17:08:36,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-14 17:08:36,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2018-11-14 17:08:36,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:36,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 152 states. [2018-11-14 17:08:36,338 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 152 states. [2018-11-14 17:08:36,338 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 152 states. [2018-11-14 17:08:36,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:36,341 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-11-14 17:08:36,341 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-14 17:08:36,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:36,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:36,342 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 153 states. [2018-11-14 17:08:36,342 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 153 states. [2018-11-14 17:08:36,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:36,344 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-11-14 17:08:36,345 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-14 17:08:36,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:36,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:36,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:36,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:36,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-14 17:08:36,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2018-11-14 17:08:36,347 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 208 [2018-11-14 17:08:36,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:36,347 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2018-11-14 17:08:36,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-14 17:08:36,348 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2018-11-14 17:08:36,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-14 17:08:36,348 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:36,349 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:36,349 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:36,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:36,349 INFO L82 PathProgramCache]: Analyzing trace with hash -2120318193, now seen corresponding path program 27 times [2018-11-14 17:08:36,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:36,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:36,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:36,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:08:36,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:36,911 INFO L256 TraceCheckUtils]: 0: Hoare triple {24802#true} call ULTIMATE.init(); {24802#true} is VALID [2018-11-14 17:08:36,911 INFO L273 TraceCheckUtils]: 1: Hoare triple {24802#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24802#true} is VALID [2018-11-14 17:08:36,911 INFO L273 TraceCheckUtils]: 2: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,911 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24802#true} {24802#true} #69#return; {24802#true} is VALID [2018-11-14 17:08:36,912 INFO L256 TraceCheckUtils]: 4: Hoare triple {24802#true} call #t~ret13 := main(); {24802#true} is VALID [2018-11-14 17:08:36,912 INFO L273 TraceCheckUtils]: 5: Hoare triple {24802#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; {24804#(= main_~i~1 0)} is VALID [2018-11-14 17:08:36,912 INFO L273 TraceCheckUtils]: 6: Hoare triple {24804#(= main_~i~1 0)} assume true; {24804#(= main_~i~1 0)} is VALID [2018-11-14 17:08:36,913 INFO L273 TraceCheckUtils]: 7: Hoare triple {24804#(= 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; {24804#(= main_~i~1 0)} is VALID [2018-11-14 17:08:36,914 INFO L273 TraceCheckUtils]: 8: Hoare triple {24804#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24805#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:36,914 INFO L273 TraceCheckUtils]: 9: Hoare triple {24805#(<= main_~i~1 1)} assume true; {24805#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:36,915 INFO L273 TraceCheckUtils]: 10: Hoare triple {24805#(<= 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; {24805#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:36,915 INFO L273 TraceCheckUtils]: 11: Hoare triple {24805#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24806#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:36,916 INFO L273 TraceCheckUtils]: 12: Hoare triple {24806#(<= main_~i~1 2)} assume true; {24806#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:36,916 INFO L273 TraceCheckUtils]: 13: Hoare triple {24806#(<= 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; {24806#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:36,917 INFO L273 TraceCheckUtils]: 14: Hoare triple {24806#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24807#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:36,917 INFO L273 TraceCheckUtils]: 15: Hoare triple {24807#(<= main_~i~1 3)} assume true; {24807#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:36,918 INFO L273 TraceCheckUtils]: 16: Hoare triple {24807#(<= 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; {24807#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:36,918 INFO L273 TraceCheckUtils]: 17: Hoare triple {24807#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24808#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:36,919 INFO L273 TraceCheckUtils]: 18: Hoare triple {24808#(<= main_~i~1 4)} assume true; {24808#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:36,919 INFO L273 TraceCheckUtils]: 19: Hoare triple {24808#(<= 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; {24808#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:36,920 INFO L273 TraceCheckUtils]: 20: Hoare triple {24808#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24809#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:36,921 INFO L273 TraceCheckUtils]: 21: Hoare triple {24809#(<= main_~i~1 5)} assume true; {24809#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:36,921 INFO L273 TraceCheckUtils]: 22: Hoare triple {24809#(<= 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; {24809#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:36,922 INFO L273 TraceCheckUtils]: 23: Hoare triple {24809#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24810#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:36,922 INFO L273 TraceCheckUtils]: 24: Hoare triple {24810#(<= main_~i~1 6)} assume true; {24810#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:36,923 INFO L273 TraceCheckUtils]: 25: Hoare triple {24810#(<= 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; {24810#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:36,923 INFO L273 TraceCheckUtils]: 26: Hoare triple {24810#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24811#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:36,924 INFO L273 TraceCheckUtils]: 27: Hoare triple {24811#(<= main_~i~1 7)} assume true; {24811#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:36,924 INFO L273 TraceCheckUtils]: 28: Hoare triple {24811#(<= 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; {24811#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:36,925 INFO L273 TraceCheckUtils]: 29: Hoare triple {24811#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24812#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:36,925 INFO L273 TraceCheckUtils]: 30: Hoare triple {24812#(<= main_~i~1 8)} assume true; {24812#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:36,926 INFO L273 TraceCheckUtils]: 31: Hoare triple {24812#(<= 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; {24812#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:36,926 INFO L273 TraceCheckUtils]: 32: Hoare triple {24812#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24813#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:36,927 INFO L273 TraceCheckUtils]: 33: Hoare triple {24813#(<= main_~i~1 9)} assume true; {24813#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:36,927 INFO L273 TraceCheckUtils]: 34: Hoare triple {24813#(<= 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; {24813#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:36,928 INFO L273 TraceCheckUtils]: 35: Hoare triple {24813#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24814#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:36,929 INFO L273 TraceCheckUtils]: 36: Hoare triple {24814#(<= main_~i~1 10)} assume true; {24814#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:36,929 INFO L273 TraceCheckUtils]: 37: Hoare triple {24814#(<= 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; {24814#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:36,930 INFO L273 TraceCheckUtils]: 38: Hoare triple {24814#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24815#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:36,930 INFO L273 TraceCheckUtils]: 39: Hoare triple {24815#(<= main_~i~1 11)} assume true; {24815#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:36,931 INFO L273 TraceCheckUtils]: 40: Hoare triple {24815#(<= 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; {24815#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:36,931 INFO L273 TraceCheckUtils]: 41: Hoare triple {24815#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24816#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:36,932 INFO L273 TraceCheckUtils]: 42: Hoare triple {24816#(<= main_~i~1 12)} assume true; {24816#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:36,932 INFO L273 TraceCheckUtils]: 43: Hoare triple {24816#(<= 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; {24816#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:36,933 INFO L273 TraceCheckUtils]: 44: Hoare triple {24816#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24817#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:36,933 INFO L273 TraceCheckUtils]: 45: Hoare triple {24817#(<= main_~i~1 13)} assume true; {24817#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:36,934 INFO L273 TraceCheckUtils]: 46: Hoare triple {24817#(<= 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; {24817#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:36,934 INFO L273 TraceCheckUtils]: 47: Hoare triple {24817#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24818#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:36,935 INFO L273 TraceCheckUtils]: 48: Hoare triple {24818#(<= main_~i~1 14)} assume true; {24818#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:36,935 INFO L273 TraceCheckUtils]: 49: Hoare triple {24818#(<= 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; {24818#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:36,936 INFO L273 TraceCheckUtils]: 50: Hoare triple {24818#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24819#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:36,937 INFO L273 TraceCheckUtils]: 51: Hoare triple {24819#(<= main_~i~1 15)} assume true; {24819#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:36,937 INFO L273 TraceCheckUtils]: 52: Hoare triple {24819#(<= 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; {24819#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:36,938 INFO L273 TraceCheckUtils]: 53: Hoare triple {24819#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24820#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:36,938 INFO L273 TraceCheckUtils]: 54: Hoare triple {24820#(<= main_~i~1 16)} assume true; {24820#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:36,939 INFO L273 TraceCheckUtils]: 55: Hoare triple {24820#(<= 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; {24820#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:36,939 INFO L273 TraceCheckUtils]: 56: Hoare triple {24820#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24821#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:36,940 INFO L273 TraceCheckUtils]: 57: Hoare triple {24821#(<= main_~i~1 17)} assume true; {24821#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:36,940 INFO L273 TraceCheckUtils]: 58: Hoare triple {24821#(<= 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; {24821#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:36,941 INFO L273 TraceCheckUtils]: 59: Hoare triple {24821#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24822#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:36,941 INFO L273 TraceCheckUtils]: 60: Hoare triple {24822#(<= main_~i~1 18)} assume true; {24822#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:36,942 INFO L273 TraceCheckUtils]: 61: Hoare triple {24822#(<= 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; {24822#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:36,942 INFO L273 TraceCheckUtils]: 62: Hoare triple {24822#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24823#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:36,943 INFO L273 TraceCheckUtils]: 63: Hoare triple {24823#(<= main_~i~1 19)} assume true; {24823#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:36,943 INFO L273 TraceCheckUtils]: 64: Hoare triple {24823#(<= 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; {24823#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:36,944 INFO L273 TraceCheckUtils]: 65: Hoare triple {24823#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24824#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:36,945 INFO L273 TraceCheckUtils]: 66: Hoare triple {24824#(<= main_~i~1 20)} assume true; {24824#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:36,945 INFO L273 TraceCheckUtils]: 67: Hoare triple {24824#(<= 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; {24824#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:36,946 INFO L273 TraceCheckUtils]: 68: Hoare triple {24824#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24825#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:36,946 INFO L273 TraceCheckUtils]: 69: Hoare triple {24825#(<= main_~i~1 21)} assume true; {24825#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:36,947 INFO L273 TraceCheckUtils]: 70: Hoare triple {24825#(<= 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; {24825#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:36,948 INFO L273 TraceCheckUtils]: 71: Hoare triple {24825#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24826#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:36,948 INFO L273 TraceCheckUtils]: 72: Hoare triple {24826#(<= main_~i~1 22)} assume true; {24826#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:36,949 INFO L273 TraceCheckUtils]: 73: Hoare triple {24826#(<= 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; {24826#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:36,949 INFO L273 TraceCheckUtils]: 74: Hoare triple {24826#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24827#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:36,950 INFO L273 TraceCheckUtils]: 75: Hoare triple {24827#(<= main_~i~1 23)} assume true; {24827#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:36,950 INFO L273 TraceCheckUtils]: 76: Hoare triple {24827#(<= 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; {24827#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:36,951 INFO L273 TraceCheckUtils]: 77: Hoare triple {24827#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24828#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:36,951 INFO L273 TraceCheckUtils]: 78: Hoare triple {24828#(<= main_~i~1 24)} assume true; {24828#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:36,952 INFO L273 TraceCheckUtils]: 79: Hoare triple {24828#(<= 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; {24828#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:36,953 INFO L273 TraceCheckUtils]: 80: Hoare triple {24828#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24829#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:36,953 INFO L273 TraceCheckUtils]: 81: Hoare triple {24829#(<= main_~i~1 25)} assume true; {24829#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:36,954 INFO L273 TraceCheckUtils]: 82: Hoare triple {24829#(<= 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; {24829#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:36,954 INFO L273 TraceCheckUtils]: 83: Hoare triple {24829#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24830#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:36,955 INFO L273 TraceCheckUtils]: 84: Hoare triple {24830#(<= main_~i~1 26)} assume true; {24830#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:36,955 INFO L273 TraceCheckUtils]: 85: Hoare triple {24830#(<= 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; {24830#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:36,956 INFO L273 TraceCheckUtils]: 86: Hoare triple {24830#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24831#(<= main_~i~1 27)} is VALID [2018-11-14 17:08:36,956 INFO L273 TraceCheckUtils]: 87: Hoare triple {24831#(<= main_~i~1 27)} assume true; {24831#(<= main_~i~1 27)} is VALID [2018-11-14 17:08:36,957 INFO L273 TraceCheckUtils]: 88: Hoare triple {24831#(<= main_~i~1 27)} assume !(~i~1 < 10000); {24803#false} is VALID [2018-11-14 17:08:36,957 INFO L256 TraceCheckUtils]: 89: Hoare triple {24803#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {24802#true} is VALID [2018-11-14 17:08:36,958 INFO L273 TraceCheckUtils]: 90: Hoare triple {24802#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; {24802#true} is VALID [2018-11-14 17:08:36,958 INFO L273 TraceCheckUtils]: 91: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,958 INFO L273 TraceCheckUtils]: 92: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:36,958 INFO L273 TraceCheckUtils]: 93: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:36,958 INFO L273 TraceCheckUtils]: 94: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,958 INFO L273 TraceCheckUtils]: 95: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:36,959 INFO L273 TraceCheckUtils]: 96: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:36,959 INFO L273 TraceCheckUtils]: 97: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,959 INFO L273 TraceCheckUtils]: 98: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:36,959 INFO L273 TraceCheckUtils]: 99: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:36,959 INFO L273 TraceCheckUtils]: 100: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,959 INFO L273 TraceCheckUtils]: 101: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:36,959 INFO L273 TraceCheckUtils]: 102: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:36,960 INFO L273 TraceCheckUtils]: 103: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,960 INFO L273 TraceCheckUtils]: 104: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:36,960 INFO L273 TraceCheckUtils]: 105: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:36,960 INFO L273 TraceCheckUtils]: 106: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,960 INFO L273 TraceCheckUtils]: 107: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:36,960 INFO L273 TraceCheckUtils]: 108: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:36,960 INFO L273 TraceCheckUtils]: 109: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,960 INFO L273 TraceCheckUtils]: 110: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:36,960 INFO L273 TraceCheckUtils]: 111: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:36,960 INFO L273 TraceCheckUtils]: 112: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,960 INFO L273 TraceCheckUtils]: 113: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:36,961 INFO L273 TraceCheckUtils]: 114: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:36,961 INFO L273 TraceCheckUtils]: 115: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,961 INFO L273 TraceCheckUtils]: 116: Hoare triple {24802#true} assume !(~i~0 < 10000); {24802#true} is VALID [2018-11-14 17:08:36,961 INFO L273 TraceCheckUtils]: 117: Hoare triple {24802#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24802#true} is VALID [2018-11-14 17:08:36,961 INFO L273 TraceCheckUtils]: 118: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,961 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {24802#true} {24803#false} #73#return; {24803#false} is VALID [2018-11-14 17:08:36,961 INFO L273 TraceCheckUtils]: 120: Hoare triple {24803#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); {24803#false} is VALID [2018-11-14 17:08:36,961 INFO L256 TraceCheckUtils]: 121: Hoare triple {24803#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {24802#true} is VALID [2018-11-14 17:08:36,961 INFO L273 TraceCheckUtils]: 122: Hoare triple {24802#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; {24802#true} is VALID [2018-11-14 17:08:36,961 INFO L273 TraceCheckUtils]: 123: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,962 INFO L273 TraceCheckUtils]: 124: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:36,962 INFO L273 TraceCheckUtils]: 125: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:36,962 INFO L273 TraceCheckUtils]: 126: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,962 INFO L273 TraceCheckUtils]: 127: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:36,962 INFO L273 TraceCheckUtils]: 128: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:36,962 INFO L273 TraceCheckUtils]: 129: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,962 INFO L273 TraceCheckUtils]: 130: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:36,962 INFO L273 TraceCheckUtils]: 131: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:36,962 INFO L273 TraceCheckUtils]: 132: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,963 INFO L273 TraceCheckUtils]: 133: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:36,963 INFO L273 TraceCheckUtils]: 134: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:36,963 INFO L273 TraceCheckUtils]: 135: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,963 INFO L273 TraceCheckUtils]: 136: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:36,963 INFO L273 TraceCheckUtils]: 137: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:36,963 INFO L273 TraceCheckUtils]: 138: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,963 INFO L273 TraceCheckUtils]: 139: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:36,963 INFO L273 TraceCheckUtils]: 140: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:36,963 INFO L273 TraceCheckUtils]: 141: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,963 INFO L273 TraceCheckUtils]: 142: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:36,963 INFO L273 TraceCheckUtils]: 143: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:36,964 INFO L273 TraceCheckUtils]: 144: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,964 INFO L273 TraceCheckUtils]: 145: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:36,964 INFO L273 TraceCheckUtils]: 146: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:36,964 INFO L273 TraceCheckUtils]: 147: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,964 INFO L273 TraceCheckUtils]: 148: Hoare triple {24802#true} assume !(~i~0 < 10000); {24802#true} is VALID [2018-11-14 17:08:36,964 INFO L273 TraceCheckUtils]: 149: Hoare triple {24802#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24802#true} is VALID [2018-11-14 17:08:36,964 INFO L273 TraceCheckUtils]: 150: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,964 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {24802#true} {24803#false} #75#return; {24803#false} is VALID [2018-11-14 17:08:36,964 INFO L273 TraceCheckUtils]: 152: Hoare triple {24803#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; {24803#false} is VALID [2018-11-14 17:08:36,965 INFO L273 TraceCheckUtils]: 153: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:08:36,965 INFO L273 TraceCheckUtils]: 154: Hoare triple {24803#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {24803#false} is VALID [2018-11-14 17:08:36,965 INFO L273 TraceCheckUtils]: 155: Hoare triple {24803#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {24803#false} is VALID [2018-11-14 17:08:36,965 INFO L273 TraceCheckUtils]: 156: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:08:36,965 INFO L273 TraceCheckUtils]: 157: Hoare triple {24803#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {24803#false} is VALID [2018-11-14 17:08:36,965 INFO L273 TraceCheckUtils]: 158: Hoare triple {24803#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {24803#false} is VALID [2018-11-14 17:08:36,965 INFO L273 TraceCheckUtils]: 159: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:08:36,965 INFO L273 TraceCheckUtils]: 160: Hoare triple {24803#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {24803#false} is VALID [2018-11-14 17:08:36,965 INFO L273 TraceCheckUtils]: 161: Hoare triple {24803#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {24803#false} is VALID [2018-11-14 17:08:36,965 INFO L273 TraceCheckUtils]: 162: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:08:36,966 INFO L273 TraceCheckUtils]: 163: Hoare triple {24803#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {24803#false} is VALID [2018-11-14 17:08:36,966 INFO L273 TraceCheckUtils]: 164: Hoare triple {24803#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {24803#false} is VALID [2018-11-14 17:08:36,966 INFO L273 TraceCheckUtils]: 165: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:08:36,966 INFO L273 TraceCheckUtils]: 166: Hoare triple {24803#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {24803#false} is VALID [2018-11-14 17:08:36,966 INFO L273 TraceCheckUtils]: 167: Hoare triple {24803#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {24803#false} is VALID [2018-11-14 17:08:36,966 INFO L273 TraceCheckUtils]: 168: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:08:36,966 INFO L273 TraceCheckUtils]: 169: Hoare triple {24803#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {24803#false} is VALID [2018-11-14 17:08:36,966 INFO L273 TraceCheckUtils]: 170: Hoare triple {24803#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {24803#false} is VALID [2018-11-14 17:08:36,966 INFO L273 TraceCheckUtils]: 171: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:08:36,966 INFO L273 TraceCheckUtils]: 172: Hoare triple {24803#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {24803#false} is VALID [2018-11-14 17:08:36,967 INFO L273 TraceCheckUtils]: 173: Hoare triple {24803#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {24803#false} is VALID [2018-11-14 17:08:36,967 INFO L273 TraceCheckUtils]: 174: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:08:36,967 INFO L273 TraceCheckUtils]: 175: Hoare triple {24803#false} assume !(~i~2 < 9999); {24803#false} is VALID [2018-11-14 17:08:36,967 INFO L273 TraceCheckUtils]: 176: Hoare triple {24803#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {24803#false} is VALID [2018-11-14 17:08:36,967 INFO L256 TraceCheckUtils]: 177: Hoare triple {24803#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {24802#true} is VALID [2018-11-14 17:08:36,967 INFO L273 TraceCheckUtils]: 178: Hoare triple {24802#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; {24802#true} is VALID [2018-11-14 17:08:36,967 INFO L273 TraceCheckUtils]: 179: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,967 INFO L273 TraceCheckUtils]: 180: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:36,967 INFO L273 TraceCheckUtils]: 181: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:36,967 INFO L273 TraceCheckUtils]: 182: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,968 INFO L273 TraceCheckUtils]: 183: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:36,968 INFO L273 TraceCheckUtils]: 184: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:36,968 INFO L273 TraceCheckUtils]: 185: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,968 INFO L273 TraceCheckUtils]: 186: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:36,968 INFO L273 TraceCheckUtils]: 187: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:36,968 INFO L273 TraceCheckUtils]: 188: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,968 INFO L273 TraceCheckUtils]: 189: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:36,968 INFO L273 TraceCheckUtils]: 190: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:36,968 INFO L273 TraceCheckUtils]: 191: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,968 INFO L273 TraceCheckUtils]: 192: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:36,969 INFO L273 TraceCheckUtils]: 193: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:36,969 INFO L273 TraceCheckUtils]: 194: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,969 INFO L273 TraceCheckUtils]: 195: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:36,969 INFO L273 TraceCheckUtils]: 196: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:36,969 INFO L273 TraceCheckUtils]: 197: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,969 INFO L273 TraceCheckUtils]: 198: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:36,969 INFO L273 TraceCheckUtils]: 199: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:36,969 INFO L273 TraceCheckUtils]: 200: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,969 INFO L273 TraceCheckUtils]: 201: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:36,969 INFO L273 TraceCheckUtils]: 202: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:36,970 INFO L273 TraceCheckUtils]: 203: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,970 INFO L273 TraceCheckUtils]: 204: Hoare triple {24802#true} assume !(~i~0 < 10000); {24802#true} is VALID [2018-11-14 17:08:36,970 INFO L273 TraceCheckUtils]: 205: Hoare triple {24802#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24802#true} is VALID [2018-11-14 17:08:36,970 INFO L273 TraceCheckUtils]: 206: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:36,970 INFO L268 TraceCheckUtils]: 207: Hoare quadruple {24802#true} {24803#false} #77#return; {24803#false} is VALID [2018-11-14 17:08:36,970 INFO L273 TraceCheckUtils]: 208: Hoare triple {24803#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {24803#false} is VALID [2018-11-14 17:08:36,970 INFO L273 TraceCheckUtils]: 209: Hoare triple {24803#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {24803#false} is VALID [2018-11-14 17:08:36,970 INFO L273 TraceCheckUtils]: 210: Hoare triple {24803#false} assume !false; {24803#false} is VALID [2018-11-14 17:08:36,988 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:36,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:36,989 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:36,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:08:37,261 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-14 17:08:37,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:08:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:37,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:37,631 INFO L256 TraceCheckUtils]: 0: Hoare triple {24802#true} call ULTIMATE.init(); {24802#true} is VALID [2018-11-14 17:08:37,632 INFO L273 TraceCheckUtils]: 1: Hoare triple {24802#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24802#true} is VALID [2018-11-14 17:08:37,632 INFO L273 TraceCheckUtils]: 2: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,632 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24802#true} {24802#true} #69#return; {24802#true} is VALID [2018-11-14 17:08:37,632 INFO L256 TraceCheckUtils]: 4: Hoare triple {24802#true} call #t~ret13 := main(); {24802#true} is VALID [2018-11-14 17:08:37,633 INFO L273 TraceCheckUtils]: 5: Hoare triple {24802#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; {24802#true} is VALID [2018-11-14 17:08:37,633 INFO L273 TraceCheckUtils]: 6: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,633 INFO L273 TraceCheckUtils]: 7: Hoare triple {24802#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:08:37,633 INFO L273 TraceCheckUtils]: 8: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:08:37,633 INFO L273 TraceCheckUtils]: 9: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,633 INFO L273 TraceCheckUtils]: 10: Hoare triple {24802#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:08:37,634 INFO L273 TraceCheckUtils]: 11: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:08:37,634 INFO L273 TraceCheckUtils]: 12: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,634 INFO L273 TraceCheckUtils]: 13: Hoare triple {24802#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:08:37,634 INFO L273 TraceCheckUtils]: 14: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:08:37,634 INFO L273 TraceCheckUtils]: 15: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,634 INFO L273 TraceCheckUtils]: 16: Hoare triple {24802#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:08:37,634 INFO L273 TraceCheckUtils]: 17: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:08:37,634 INFO L273 TraceCheckUtils]: 18: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,634 INFO L273 TraceCheckUtils]: 19: Hoare triple {24802#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:08:37,634 INFO L273 TraceCheckUtils]: 20: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:08:37,635 INFO L273 TraceCheckUtils]: 21: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,635 INFO L273 TraceCheckUtils]: 22: Hoare triple {24802#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:08:37,635 INFO L273 TraceCheckUtils]: 23: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:08:37,635 INFO L273 TraceCheckUtils]: 24: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,635 INFO L273 TraceCheckUtils]: 25: Hoare triple {24802#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:08:37,635 INFO L273 TraceCheckUtils]: 26: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:08:37,635 INFO L273 TraceCheckUtils]: 27: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,635 INFO L273 TraceCheckUtils]: 28: Hoare triple {24802#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:08:37,635 INFO L273 TraceCheckUtils]: 29: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:08:37,635 INFO L273 TraceCheckUtils]: 30: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,636 INFO L273 TraceCheckUtils]: 31: Hoare triple {24802#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:08:37,636 INFO L273 TraceCheckUtils]: 32: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:08:37,636 INFO L273 TraceCheckUtils]: 33: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,636 INFO L273 TraceCheckUtils]: 34: Hoare triple {24802#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:08:37,636 INFO L273 TraceCheckUtils]: 35: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:08:37,636 INFO L273 TraceCheckUtils]: 36: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,636 INFO L273 TraceCheckUtils]: 37: Hoare triple {24802#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:08:37,636 INFO L273 TraceCheckUtils]: 38: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:08:37,636 INFO L273 TraceCheckUtils]: 39: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,636 INFO L273 TraceCheckUtils]: 40: Hoare triple {24802#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:08:37,637 INFO L273 TraceCheckUtils]: 41: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:08:37,637 INFO L273 TraceCheckUtils]: 42: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,637 INFO L273 TraceCheckUtils]: 43: Hoare triple {24802#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:08:37,637 INFO L273 TraceCheckUtils]: 44: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:08:37,637 INFO L273 TraceCheckUtils]: 45: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,637 INFO L273 TraceCheckUtils]: 46: Hoare triple {24802#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:08:37,637 INFO L273 TraceCheckUtils]: 47: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:08:37,637 INFO L273 TraceCheckUtils]: 48: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,637 INFO L273 TraceCheckUtils]: 49: Hoare triple {24802#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:08:37,637 INFO L273 TraceCheckUtils]: 50: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:08:37,638 INFO L273 TraceCheckUtils]: 51: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,638 INFO L273 TraceCheckUtils]: 52: Hoare triple {24802#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:08:37,638 INFO L273 TraceCheckUtils]: 53: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:08:37,638 INFO L273 TraceCheckUtils]: 54: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,638 INFO L273 TraceCheckUtils]: 55: Hoare triple {24802#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:08:37,638 INFO L273 TraceCheckUtils]: 56: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:08:37,638 INFO L273 TraceCheckUtils]: 57: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,638 INFO L273 TraceCheckUtils]: 58: Hoare triple {24802#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:08:37,638 INFO L273 TraceCheckUtils]: 59: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:08:37,638 INFO L273 TraceCheckUtils]: 60: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,639 INFO L273 TraceCheckUtils]: 61: Hoare triple {24802#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:08:37,639 INFO L273 TraceCheckUtils]: 62: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:08:37,639 INFO L273 TraceCheckUtils]: 63: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,639 INFO L273 TraceCheckUtils]: 64: Hoare triple {24802#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:08:37,639 INFO L273 TraceCheckUtils]: 65: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:08:37,639 INFO L273 TraceCheckUtils]: 66: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,639 INFO L273 TraceCheckUtils]: 67: Hoare triple {24802#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:08:37,639 INFO L273 TraceCheckUtils]: 68: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:08:37,639 INFO L273 TraceCheckUtils]: 69: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,639 INFO L273 TraceCheckUtils]: 70: Hoare triple {24802#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:08:37,640 INFO L273 TraceCheckUtils]: 71: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:08:37,640 INFO L273 TraceCheckUtils]: 72: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,640 INFO L273 TraceCheckUtils]: 73: Hoare triple {24802#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:08:37,640 INFO L273 TraceCheckUtils]: 74: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:08:37,640 INFO L273 TraceCheckUtils]: 75: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,640 INFO L273 TraceCheckUtils]: 76: Hoare triple {24802#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:08:37,640 INFO L273 TraceCheckUtils]: 77: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:08:37,640 INFO L273 TraceCheckUtils]: 78: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,640 INFO L273 TraceCheckUtils]: 79: Hoare triple {24802#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:08:37,640 INFO L273 TraceCheckUtils]: 80: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:08:37,641 INFO L273 TraceCheckUtils]: 81: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,641 INFO L273 TraceCheckUtils]: 82: Hoare triple {24802#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:08:37,641 INFO L273 TraceCheckUtils]: 83: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:08:37,641 INFO L273 TraceCheckUtils]: 84: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,641 INFO L273 TraceCheckUtils]: 85: Hoare triple {24802#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:08:37,641 INFO L273 TraceCheckUtils]: 86: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:08:37,641 INFO L273 TraceCheckUtils]: 87: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,641 INFO L273 TraceCheckUtils]: 88: Hoare triple {24802#true} assume !(~i~1 < 10000); {24802#true} is VALID [2018-11-14 17:08:37,641 INFO L256 TraceCheckUtils]: 89: Hoare triple {24802#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {24802#true} is VALID [2018-11-14 17:08:37,641 INFO L273 TraceCheckUtils]: 90: Hoare triple {24802#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; {24802#true} is VALID [2018-11-14 17:08:37,642 INFO L273 TraceCheckUtils]: 91: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,642 INFO L273 TraceCheckUtils]: 92: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:37,642 INFO L273 TraceCheckUtils]: 93: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:37,642 INFO L273 TraceCheckUtils]: 94: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,642 INFO L273 TraceCheckUtils]: 95: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:37,642 INFO L273 TraceCheckUtils]: 96: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:37,642 INFO L273 TraceCheckUtils]: 97: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,642 INFO L273 TraceCheckUtils]: 98: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:37,642 INFO L273 TraceCheckUtils]: 99: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:37,642 INFO L273 TraceCheckUtils]: 100: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,643 INFO L273 TraceCheckUtils]: 101: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:37,643 INFO L273 TraceCheckUtils]: 102: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:37,643 INFO L273 TraceCheckUtils]: 103: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,643 INFO L273 TraceCheckUtils]: 104: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:37,643 INFO L273 TraceCheckUtils]: 105: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:37,643 INFO L273 TraceCheckUtils]: 106: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,643 INFO L273 TraceCheckUtils]: 107: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:37,643 INFO L273 TraceCheckUtils]: 108: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:37,643 INFO L273 TraceCheckUtils]: 109: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,643 INFO L273 TraceCheckUtils]: 110: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:37,644 INFO L273 TraceCheckUtils]: 111: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:37,644 INFO L273 TraceCheckUtils]: 112: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,644 INFO L273 TraceCheckUtils]: 113: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:37,644 INFO L273 TraceCheckUtils]: 114: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:37,644 INFO L273 TraceCheckUtils]: 115: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,644 INFO L273 TraceCheckUtils]: 116: Hoare triple {24802#true} assume !(~i~0 < 10000); {24802#true} is VALID [2018-11-14 17:08:37,644 INFO L273 TraceCheckUtils]: 117: Hoare triple {24802#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24802#true} is VALID [2018-11-14 17:08:37,644 INFO L273 TraceCheckUtils]: 118: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,644 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {24802#true} {24802#true} #73#return; {24802#true} is VALID [2018-11-14 17:08:37,644 INFO L273 TraceCheckUtils]: 120: Hoare triple {24802#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); {24802#true} is VALID [2018-11-14 17:08:37,645 INFO L256 TraceCheckUtils]: 121: Hoare triple {24802#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {24802#true} is VALID [2018-11-14 17:08:37,645 INFO L273 TraceCheckUtils]: 122: Hoare triple {24802#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; {24802#true} is VALID [2018-11-14 17:08:37,645 INFO L273 TraceCheckUtils]: 123: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,645 INFO L273 TraceCheckUtils]: 124: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:37,645 INFO L273 TraceCheckUtils]: 125: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:37,645 INFO L273 TraceCheckUtils]: 126: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,645 INFO L273 TraceCheckUtils]: 127: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:37,645 INFO L273 TraceCheckUtils]: 128: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:37,645 INFO L273 TraceCheckUtils]: 129: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,645 INFO L273 TraceCheckUtils]: 130: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:37,646 INFO L273 TraceCheckUtils]: 131: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:37,646 INFO L273 TraceCheckUtils]: 132: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,646 INFO L273 TraceCheckUtils]: 133: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:37,646 INFO L273 TraceCheckUtils]: 134: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:37,646 INFO L273 TraceCheckUtils]: 135: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,646 INFO L273 TraceCheckUtils]: 136: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:37,646 INFO L273 TraceCheckUtils]: 137: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:37,646 INFO L273 TraceCheckUtils]: 138: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,646 INFO L273 TraceCheckUtils]: 139: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:37,646 INFO L273 TraceCheckUtils]: 140: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:37,647 INFO L273 TraceCheckUtils]: 141: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,647 INFO L273 TraceCheckUtils]: 142: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:37,647 INFO L273 TraceCheckUtils]: 143: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:37,647 INFO L273 TraceCheckUtils]: 144: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,647 INFO L273 TraceCheckUtils]: 145: Hoare triple {24802#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:08:37,647 INFO L273 TraceCheckUtils]: 146: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:08:37,647 INFO L273 TraceCheckUtils]: 147: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,647 INFO L273 TraceCheckUtils]: 148: Hoare triple {24802#true} assume !(~i~0 < 10000); {24802#true} is VALID [2018-11-14 17:08:37,647 INFO L273 TraceCheckUtils]: 149: Hoare triple {24802#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24802#true} is VALID [2018-11-14 17:08:37,647 INFO L273 TraceCheckUtils]: 150: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:08:37,648 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {24802#true} {24802#true} #75#return; {24802#true} is VALID [2018-11-14 17:08:37,648 INFO L273 TraceCheckUtils]: 152: Hoare triple {24802#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; {25291#(<= main_~i~2 0)} is VALID [2018-11-14 17:08:37,648 INFO L273 TraceCheckUtils]: 153: Hoare triple {25291#(<= main_~i~2 0)} assume true; {25291#(<= main_~i~2 0)} is VALID [2018-11-14 17:08:37,649 INFO L273 TraceCheckUtils]: 154: Hoare triple {25291#(<= 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; {25291#(<= main_~i~2 0)} is VALID [2018-11-14 17:08:37,649 INFO L273 TraceCheckUtils]: 155: Hoare triple {25291#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25301#(<= main_~i~2 1)} is VALID [2018-11-14 17:08:37,649 INFO L273 TraceCheckUtils]: 156: Hoare triple {25301#(<= main_~i~2 1)} assume true; {25301#(<= main_~i~2 1)} is VALID [2018-11-14 17:08:37,650 INFO L273 TraceCheckUtils]: 157: Hoare triple {25301#(<= 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; {25301#(<= main_~i~2 1)} is VALID [2018-11-14 17:08:37,650 INFO L273 TraceCheckUtils]: 158: Hoare triple {25301#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25311#(<= main_~i~2 2)} is VALID [2018-11-14 17:08:37,651 INFO L273 TraceCheckUtils]: 159: Hoare triple {25311#(<= main_~i~2 2)} assume true; {25311#(<= main_~i~2 2)} is VALID [2018-11-14 17:08:37,651 INFO L273 TraceCheckUtils]: 160: Hoare triple {25311#(<= 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; {25311#(<= main_~i~2 2)} is VALID [2018-11-14 17:08:37,652 INFO L273 TraceCheckUtils]: 161: Hoare triple {25311#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25321#(<= main_~i~2 3)} is VALID [2018-11-14 17:08:37,652 INFO L273 TraceCheckUtils]: 162: Hoare triple {25321#(<= main_~i~2 3)} assume true; {25321#(<= main_~i~2 3)} is VALID [2018-11-14 17:08:37,653 INFO L273 TraceCheckUtils]: 163: Hoare triple {25321#(<= 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; {25321#(<= main_~i~2 3)} is VALID [2018-11-14 17:08:37,653 INFO L273 TraceCheckUtils]: 164: Hoare triple {25321#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25331#(<= main_~i~2 4)} is VALID [2018-11-14 17:08:37,654 INFO L273 TraceCheckUtils]: 165: Hoare triple {25331#(<= main_~i~2 4)} assume true; {25331#(<= main_~i~2 4)} is VALID [2018-11-14 17:08:37,654 INFO L273 TraceCheckUtils]: 166: Hoare triple {25331#(<= 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; {25331#(<= main_~i~2 4)} is VALID [2018-11-14 17:08:37,655 INFO L273 TraceCheckUtils]: 167: Hoare triple {25331#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25341#(<= main_~i~2 5)} is VALID [2018-11-14 17:08:37,656 INFO L273 TraceCheckUtils]: 168: Hoare triple {25341#(<= main_~i~2 5)} assume true; {25341#(<= main_~i~2 5)} is VALID [2018-11-14 17:08:37,656 INFO L273 TraceCheckUtils]: 169: Hoare triple {25341#(<= 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; {25341#(<= main_~i~2 5)} is VALID [2018-11-14 17:08:37,657 INFO L273 TraceCheckUtils]: 170: Hoare triple {25341#(<= main_~i~2 5)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25351#(<= main_~i~2 6)} is VALID [2018-11-14 17:08:37,657 INFO L273 TraceCheckUtils]: 171: Hoare triple {25351#(<= main_~i~2 6)} assume true; {25351#(<= main_~i~2 6)} is VALID [2018-11-14 17:08:37,658 INFO L273 TraceCheckUtils]: 172: Hoare triple {25351#(<= main_~i~2 6)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25351#(<= main_~i~2 6)} is VALID [2018-11-14 17:08:37,659 INFO L273 TraceCheckUtils]: 173: Hoare triple {25351#(<= main_~i~2 6)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25361#(<= main_~i~2 7)} is VALID [2018-11-14 17:08:37,659 INFO L273 TraceCheckUtils]: 174: Hoare triple {25361#(<= main_~i~2 7)} assume true; {25361#(<= main_~i~2 7)} is VALID [2018-11-14 17:08:37,660 INFO L273 TraceCheckUtils]: 175: Hoare triple {25361#(<= main_~i~2 7)} assume !(~i~2 < 9999); {24803#false} is VALID [2018-11-14 17:08:37,660 INFO L273 TraceCheckUtils]: 176: Hoare triple {24803#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {24803#false} is VALID [2018-11-14 17:08:37,660 INFO L256 TraceCheckUtils]: 177: Hoare triple {24803#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {24803#false} is VALID [2018-11-14 17:08:37,660 INFO L273 TraceCheckUtils]: 178: Hoare triple {24803#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; {24803#false} is VALID [2018-11-14 17:08:37,660 INFO L273 TraceCheckUtils]: 179: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:08:37,661 INFO L273 TraceCheckUtils]: 180: Hoare triple {24803#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24803#false} is VALID [2018-11-14 17:08:37,661 INFO L273 TraceCheckUtils]: 181: Hoare triple {24803#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24803#false} is VALID [2018-11-14 17:08:37,661 INFO L273 TraceCheckUtils]: 182: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:08:37,661 INFO L273 TraceCheckUtils]: 183: Hoare triple {24803#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24803#false} is VALID [2018-11-14 17:08:37,661 INFO L273 TraceCheckUtils]: 184: Hoare triple {24803#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24803#false} is VALID [2018-11-14 17:08:37,662 INFO L273 TraceCheckUtils]: 185: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:08:37,662 INFO L273 TraceCheckUtils]: 186: Hoare triple {24803#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24803#false} is VALID [2018-11-14 17:08:37,662 INFO L273 TraceCheckUtils]: 187: Hoare triple {24803#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24803#false} is VALID [2018-11-14 17:08:37,662 INFO L273 TraceCheckUtils]: 188: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:08:37,662 INFO L273 TraceCheckUtils]: 189: Hoare triple {24803#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24803#false} is VALID [2018-11-14 17:08:37,662 INFO L273 TraceCheckUtils]: 190: Hoare triple {24803#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24803#false} is VALID [2018-11-14 17:08:37,663 INFO L273 TraceCheckUtils]: 191: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:08:37,663 INFO L273 TraceCheckUtils]: 192: Hoare triple {24803#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24803#false} is VALID [2018-11-14 17:08:37,663 INFO L273 TraceCheckUtils]: 193: Hoare triple {24803#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24803#false} is VALID [2018-11-14 17:08:37,663 INFO L273 TraceCheckUtils]: 194: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:08:37,663 INFO L273 TraceCheckUtils]: 195: Hoare triple {24803#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24803#false} is VALID [2018-11-14 17:08:37,663 INFO L273 TraceCheckUtils]: 196: Hoare triple {24803#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24803#false} is VALID [2018-11-14 17:08:37,664 INFO L273 TraceCheckUtils]: 197: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:08:37,664 INFO L273 TraceCheckUtils]: 198: Hoare triple {24803#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24803#false} is VALID [2018-11-14 17:08:37,664 INFO L273 TraceCheckUtils]: 199: Hoare triple {24803#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24803#false} is VALID [2018-11-14 17:08:37,664 INFO L273 TraceCheckUtils]: 200: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:08:37,664 INFO L273 TraceCheckUtils]: 201: Hoare triple {24803#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24803#false} is VALID [2018-11-14 17:08:37,664 INFO L273 TraceCheckUtils]: 202: Hoare triple {24803#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24803#false} is VALID [2018-11-14 17:08:37,665 INFO L273 TraceCheckUtils]: 203: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:08:37,665 INFO L273 TraceCheckUtils]: 204: Hoare triple {24803#false} assume !(~i~0 < 10000); {24803#false} is VALID [2018-11-14 17:08:37,665 INFO L273 TraceCheckUtils]: 205: Hoare triple {24803#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24803#false} is VALID [2018-11-14 17:08:37,665 INFO L273 TraceCheckUtils]: 206: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:08:37,665 INFO L268 TraceCheckUtils]: 207: Hoare quadruple {24803#false} {24803#false} #77#return; {24803#false} is VALID [2018-11-14 17:08:37,665 INFO L273 TraceCheckUtils]: 208: Hoare triple {24803#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {24803#false} is VALID [2018-11-14 17:08:37,665 INFO L273 TraceCheckUtils]: 209: Hoare triple {24803#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {24803#false} is VALID [2018-11-14 17:08:37,665 INFO L273 TraceCheckUtils]: 210: Hoare triple {24803#false} assume !false; {24803#false} is VALID [2018-11-14 17:08:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2174 backedges. 460 proven. 77 refuted. 0 times theorem prover too weak. 1637 trivial. 0 not checked. [2018-11-14 17:08:37,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:37,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10] total 38 [2018-11-14 17:08:37,702 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 211 [2018-11-14 17:08:37,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:37,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-14 17:08:37,920 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:37,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-14 17:08:37,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-14 17:08:37,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 17:08:37,922 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand 38 states. [2018-11-14 17:08:38,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:38,916 INFO L93 Difference]: Finished difference Result 223 states and 232 transitions. [2018-11-14 17:08:38,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-14 17:08:38,916 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 211 [2018-11-14 17:08:38,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:38,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 17:08:38,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2018-11-14 17:08:38,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 17:08:38,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2018-11-14 17:08:38,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 166 transitions. [2018-11-14 17:08:39,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:39,070 INFO L225 Difference]: With dead ends: 223 [2018-11-14 17:08:39,070 INFO L226 Difference]: Without dead ends: 160 [2018-11-14 17:08:39,071 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 17:08:39,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-14 17:08:39,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2018-11-14 17:08:39,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:39,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand 158 states. [2018-11-14 17:08:39,204 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 158 states. [2018-11-14 17:08:39,204 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 158 states. [2018-11-14 17:08:39,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:39,206 INFO L93 Difference]: Finished difference Result 160 states and 164 transitions. [2018-11-14 17:08:39,207 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 164 transitions. [2018-11-14 17:08:39,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:39,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:39,207 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 160 states. [2018-11-14 17:08:39,207 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 160 states. [2018-11-14 17:08:39,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:39,210 INFO L93 Difference]: Finished difference Result 160 states and 164 transitions. [2018-11-14 17:08:39,210 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 164 transitions. [2018-11-14 17:08:39,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:39,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:39,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:39,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:39,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-14 17:08:39,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 162 transitions. [2018-11-14 17:08:39,213 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 162 transitions. Word has length 211 [2018-11-14 17:08:39,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:39,214 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 162 transitions. [2018-11-14 17:08:39,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-14 17:08:39,214 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 162 transitions. [2018-11-14 17:08:39,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-14 17:08:39,215 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:39,215 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 27, 24, 24, 9, 8, 8, 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:39,216 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:39,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:39,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1519582765, now seen corresponding path program 28 times [2018-11-14 17:08:39,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:39,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:39,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:39,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:08:39,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:39,957 INFO L256 TraceCheckUtils]: 0: Hoare triple {26304#true} call ULTIMATE.init(); {26304#true} is VALID [2018-11-14 17:08:39,957 INFO L273 TraceCheckUtils]: 1: Hoare triple {26304#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26304#true} is VALID [2018-11-14 17:08:39,957 INFO L273 TraceCheckUtils]: 2: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:39,957 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26304#true} {26304#true} #69#return; {26304#true} is VALID [2018-11-14 17:08:39,958 INFO L256 TraceCheckUtils]: 4: Hoare triple {26304#true} call #t~ret13 := main(); {26304#true} is VALID [2018-11-14 17:08:39,958 INFO L273 TraceCheckUtils]: 5: Hoare triple {26304#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; {26306#(= main_~i~1 0)} is VALID [2018-11-14 17:08:39,958 INFO L273 TraceCheckUtils]: 6: Hoare triple {26306#(= main_~i~1 0)} assume true; {26306#(= main_~i~1 0)} is VALID [2018-11-14 17:08:39,959 INFO L273 TraceCheckUtils]: 7: Hoare triple {26306#(= 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; {26306#(= main_~i~1 0)} is VALID [2018-11-14 17:08:39,960 INFO L273 TraceCheckUtils]: 8: Hoare triple {26306#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26307#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:39,960 INFO L273 TraceCheckUtils]: 9: Hoare triple {26307#(<= main_~i~1 1)} assume true; {26307#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:39,961 INFO L273 TraceCheckUtils]: 10: Hoare triple {26307#(<= 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; {26307#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:39,962 INFO L273 TraceCheckUtils]: 11: Hoare triple {26307#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26308#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:39,962 INFO L273 TraceCheckUtils]: 12: Hoare triple {26308#(<= main_~i~1 2)} assume true; {26308#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:39,963 INFO L273 TraceCheckUtils]: 13: Hoare triple {26308#(<= 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; {26308#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:39,963 INFO L273 TraceCheckUtils]: 14: Hoare triple {26308#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26309#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:39,964 INFO L273 TraceCheckUtils]: 15: Hoare triple {26309#(<= main_~i~1 3)} assume true; {26309#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:39,964 INFO L273 TraceCheckUtils]: 16: Hoare triple {26309#(<= 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; {26309#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:39,965 INFO L273 TraceCheckUtils]: 17: Hoare triple {26309#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26310#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:39,966 INFO L273 TraceCheckUtils]: 18: Hoare triple {26310#(<= main_~i~1 4)} assume true; {26310#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:39,966 INFO L273 TraceCheckUtils]: 19: Hoare triple {26310#(<= 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; {26310#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:39,967 INFO L273 TraceCheckUtils]: 20: Hoare triple {26310#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26311#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:39,967 INFO L273 TraceCheckUtils]: 21: Hoare triple {26311#(<= main_~i~1 5)} assume true; {26311#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:39,968 INFO L273 TraceCheckUtils]: 22: Hoare triple {26311#(<= 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; {26311#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:39,969 INFO L273 TraceCheckUtils]: 23: Hoare triple {26311#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26312#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:39,969 INFO L273 TraceCheckUtils]: 24: Hoare triple {26312#(<= main_~i~1 6)} assume true; {26312#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:39,970 INFO L273 TraceCheckUtils]: 25: Hoare triple {26312#(<= 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; {26312#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:39,970 INFO L273 TraceCheckUtils]: 26: Hoare triple {26312#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26313#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:39,971 INFO L273 TraceCheckUtils]: 27: Hoare triple {26313#(<= main_~i~1 7)} assume true; {26313#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:39,971 INFO L273 TraceCheckUtils]: 28: Hoare triple {26313#(<= 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; {26313#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:39,972 INFO L273 TraceCheckUtils]: 29: Hoare triple {26313#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26314#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:39,972 INFO L273 TraceCheckUtils]: 30: Hoare triple {26314#(<= main_~i~1 8)} assume true; {26314#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:39,973 INFO L273 TraceCheckUtils]: 31: Hoare triple {26314#(<= 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; {26314#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:39,974 INFO L273 TraceCheckUtils]: 32: Hoare triple {26314#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26315#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:39,974 INFO L273 TraceCheckUtils]: 33: Hoare triple {26315#(<= main_~i~1 9)} assume true; {26315#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:39,975 INFO L273 TraceCheckUtils]: 34: Hoare triple {26315#(<= 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; {26315#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:39,975 INFO L273 TraceCheckUtils]: 35: Hoare triple {26315#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26316#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:39,976 INFO L273 TraceCheckUtils]: 36: Hoare triple {26316#(<= main_~i~1 10)} assume true; {26316#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:39,976 INFO L273 TraceCheckUtils]: 37: Hoare triple {26316#(<= 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; {26316#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:39,977 INFO L273 TraceCheckUtils]: 38: Hoare triple {26316#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26317#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:39,978 INFO L273 TraceCheckUtils]: 39: Hoare triple {26317#(<= main_~i~1 11)} assume true; {26317#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:39,978 INFO L273 TraceCheckUtils]: 40: Hoare triple {26317#(<= 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; {26317#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:39,979 INFO L273 TraceCheckUtils]: 41: Hoare triple {26317#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26318#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:39,979 INFO L273 TraceCheckUtils]: 42: Hoare triple {26318#(<= main_~i~1 12)} assume true; {26318#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:39,980 INFO L273 TraceCheckUtils]: 43: Hoare triple {26318#(<= 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; {26318#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:39,981 INFO L273 TraceCheckUtils]: 44: Hoare triple {26318#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26319#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:39,981 INFO L273 TraceCheckUtils]: 45: Hoare triple {26319#(<= main_~i~1 13)} assume true; {26319#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:39,982 INFO L273 TraceCheckUtils]: 46: Hoare triple {26319#(<= 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; {26319#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:39,982 INFO L273 TraceCheckUtils]: 47: Hoare triple {26319#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26320#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:39,983 INFO L273 TraceCheckUtils]: 48: Hoare triple {26320#(<= main_~i~1 14)} assume true; {26320#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:39,983 INFO L273 TraceCheckUtils]: 49: Hoare triple {26320#(<= 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; {26320#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:39,984 INFO L273 TraceCheckUtils]: 50: Hoare triple {26320#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26321#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:39,985 INFO L273 TraceCheckUtils]: 51: Hoare triple {26321#(<= main_~i~1 15)} assume true; {26321#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:39,985 INFO L273 TraceCheckUtils]: 52: Hoare triple {26321#(<= 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; {26321#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:39,986 INFO L273 TraceCheckUtils]: 53: Hoare triple {26321#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26322#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:39,986 INFO L273 TraceCheckUtils]: 54: Hoare triple {26322#(<= main_~i~1 16)} assume true; {26322#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:39,987 INFO L273 TraceCheckUtils]: 55: Hoare triple {26322#(<= 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; {26322#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:39,987 INFO L273 TraceCheckUtils]: 56: Hoare triple {26322#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26323#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:39,988 INFO L273 TraceCheckUtils]: 57: Hoare triple {26323#(<= main_~i~1 17)} assume true; {26323#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:39,988 INFO L273 TraceCheckUtils]: 58: Hoare triple {26323#(<= 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; {26323#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:39,989 INFO L273 TraceCheckUtils]: 59: Hoare triple {26323#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26324#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:39,990 INFO L273 TraceCheckUtils]: 60: Hoare triple {26324#(<= main_~i~1 18)} assume true; {26324#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:39,990 INFO L273 TraceCheckUtils]: 61: Hoare triple {26324#(<= 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; {26324#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:39,991 INFO L273 TraceCheckUtils]: 62: Hoare triple {26324#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26325#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:39,991 INFO L273 TraceCheckUtils]: 63: Hoare triple {26325#(<= main_~i~1 19)} assume true; {26325#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:39,992 INFO L273 TraceCheckUtils]: 64: Hoare triple {26325#(<= 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; {26325#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:39,993 INFO L273 TraceCheckUtils]: 65: Hoare triple {26325#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26326#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:39,993 INFO L273 TraceCheckUtils]: 66: Hoare triple {26326#(<= main_~i~1 20)} assume true; {26326#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:39,994 INFO L273 TraceCheckUtils]: 67: Hoare triple {26326#(<= 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; {26326#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:39,994 INFO L273 TraceCheckUtils]: 68: Hoare triple {26326#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26327#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:39,995 INFO L273 TraceCheckUtils]: 69: Hoare triple {26327#(<= main_~i~1 21)} assume true; {26327#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:39,995 INFO L273 TraceCheckUtils]: 70: Hoare triple {26327#(<= 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; {26327#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:39,996 INFO L273 TraceCheckUtils]: 71: Hoare triple {26327#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26328#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:39,996 INFO L273 TraceCheckUtils]: 72: Hoare triple {26328#(<= main_~i~1 22)} assume true; {26328#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:39,997 INFO L273 TraceCheckUtils]: 73: Hoare triple {26328#(<= 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; {26328#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:39,998 INFO L273 TraceCheckUtils]: 74: Hoare triple {26328#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26329#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:39,998 INFO L273 TraceCheckUtils]: 75: Hoare triple {26329#(<= main_~i~1 23)} assume true; {26329#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:39,999 INFO L273 TraceCheckUtils]: 76: Hoare triple {26329#(<= 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; {26329#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:39,999 INFO L273 TraceCheckUtils]: 77: Hoare triple {26329#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26330#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:40,000 INFO L273 TraceCheckUtils]: 78: Hoare triple {26330#(<= main_~i~1 24)} assume true; {26330#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:40,000 INFO L273 TraceCheckUtils]: 79: Hoare triple {26330#(<= 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; {26330#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:40,001 INFO L273 TraceCheckUtils]: 80: Hoare triple {26330#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26331#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:40,002 INFO L273 TraceCheckUtils]: 81: Hoare triple {26331#(<= main_~i~1 25)} assume true; {26331#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:40,002 INFO L273 TraceCheckUtils]: 82: Hoare triple {26331#(<= 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; {26331#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:40,003 INFO L273 TraceCheckUtils]: 83: Hoare triple {26331#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26332#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:40,003 INFO L273 TraceCheckUtils]: 84: Hoare triple {26332#(<= main_~i~1 26)} assume true; {26332#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:40,004 INFO L273 TraceCheckUtils]: 85: Hoare triple {26332#(<= 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; {26332#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:40,005 INFO L273 TraceCheckUtils]: 86: Hoare triple {26332#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26333#(<= main_~i~1 27)} is VALID [2018-11-14 17:08:40,005 INFO L273 TraceCheckUtils]: 87: Hoare triple {26333#(<= main_~i~1 27)} assume true; {26333#(<= main_~i~1 27)} is VALID [2018-11-14 17:08:40,006 INFO L273 TraceCheckUtils]: 88: Hoare triple {26333#(<= 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; {26333#(<= main_~i~1 27)} is VALID [2018-11-14 17:08:40,006 INFO L273 TraceCheckUtils]: 89: Hoare triple {26333#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26334#(<= main_~i~1 28)} is VALID [2018-11-14 17:08:40,007 INFO L273 TraceCheckUtils]: 90: Hoare triple {26334#(<= main_~i~1 28)} assume true; {26334#(<= main_~i~1 28)} is VALID [2018-11-14 17:08:40,007 INFO L273 TraceCheckUtils]: 91: Hoare triple {26334#(<= main_~i~1 28)} assume !(~i~1 < 10000); {26305#false} is VALID [2018-11-14 17:08:40,008 INFO L256 TraceCheckUtils]: 92: Hoare triple {26305#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {26304#true} is VALID [2018-11-14 17:08:40,008 INFO L273 TraceCheckUtils]: 93: Hoare triple {26304#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; {26304#true} is VALID [2018-11-14 17:08:40,008 INFO L273 TraceCheckUtils]: 94: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,008 INFO L273 TraceCheckUtils]: 95: Hoare triple {26304#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:40,008 INFO L273 TraceCheckUtils]: 96: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:40,009 INFO L273 TraceCheckUtils]: 97: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,009 INFO L273 TraceCheckUtils]: 98: Hoare triple {26304#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:40,009 INFO L273 TraceCheckUtils]: 99: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:40,009 INFO L273 TraceCheckUtils]: 100: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,009 INFO L273 TraceCheckUtils]: 101: Hoare triple {26304#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:40,009 INFO L273 TraceCheckUtils]: 102: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:40,010 INFO L273 TraceCheckUtils]: 103: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,010 INFO L273 TraceCheckUtils]: 104: Hoare triple {26304#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:40,010 INFO L273 TraceCheckUtils]: 105: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:40,010 INFO L273 TraceCheckUtils]: 106: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,010 INFO L273 TraceCheckUtils]: 107: Hoare triple {26304#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:40,010 INFO L273 TraceCheckUtils]: 108: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:40,011 INFO L273 TraceCheckUtils]: 109: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,011 INFO L273 TraceCheckUtils]: 110: Hoare triple {26304#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:40,011 INFO L273 TraceCheckUtils]: 111: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:40,011 INFO L273 TraceCheckUtils]: 112: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,011 INFO L273 TraceCheckUtils]: 113: Hoare triple {26304#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:40,011 INFO L273 TraceCheckUtils]: 114: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:40,012 INFO L273 TraceCheckUtils]: 115: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,012 INFO L273 TraceCheckUtils]: 116: Hoare triple {26304#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:40,012 INFO L273 TraceCheckUtils]: 117: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:40,012 INFO L273 TraceCheckUtils]: 118: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,012 INFO L273 TraceCheckUtils]: 119: Hoare triple {26304#true} assume !(~i~0 < 10000); {26304#true} is VALID [2018-11-14 17:08:40,013 INFO L273 TraceCheckUtils]: 120: Hoare triple {26304#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26304#true} is VALID [2018-11-14 17:08:40,013 INFO L273 TraceCheckUtils]: 121: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,013 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {26304#true} {26305#false} #73#return; {26305#false} is VALID [2018-11-14 17:08:40,013 INFO L273 TraceCheckUtils]: 123: Hoare triple {26305#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); {26305#false} is VALID [2018-11-14 17:08:40,013 INFO L256 TraceCheckUtils]: 124: Hoare triple {26305#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {26304#true} is VALID [2018-11-14 17:08:40,013 INFO L273 TraceCheckUtils]: 125: Hoare triple {26304#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; {26304#true} is VALID [2018-11-14 17:08:40,013 INFO L273 TraceCheckUtils]: 126: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,013 INFO L273 TraceCheckUtils]: 127: Hoare triple {26304#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:40,013 INFO L273 TraceCheckUtils]: 128: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:40,014 INFO L273 TraceCheckUtils]: 129: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,014 INFO L273 TraceCheckUtils]: 130: Hoare triple {26304#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:40,014 INFO L273 TraceCheckUtils]: 131: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:40,014 INFO L273 TraceCheckUtils]: 132: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,014 INFO L273 TraceCheckUtils]: 133: Hoare triple {26304#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:40,014 INFO L273 TraceCheckUtils]: 134: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:40,014 INFO L273 TraceCheckUtils]: 135: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,014 INFO L273 TraceCheckUtils]: 136: Hoare triple {26304#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:40,014 INFO L273 TraceCheckUtils]: 137: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:40,014 INFO L273 TraceCheckUtils]: 138: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,015 INFO L273 TraceCheckUtils]: 139: Hoare triple {26304#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:40,015 INFO L273 TraceCheckUtils]: 140: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:40,015 INFO L273 TraceCheckUtils]: 141: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,015 INFO L273 TraceCheckUtils]: 142: Hoare triple {26304#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:40,015 INFO L273 TraceCheckUtils]: 143: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:40,015 INFO L273 TraceCheckUtils]: 144: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,015 INFO L273 TraceCheckUtils]: 145: Hoare triple {26304#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:40,015 INFO L273 TraceCheckUtils]: 146: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:40,015 INFO L273 TraceCheckUtils]: 147: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,015 INFO L273 TraceCheckUtils]: 148: Hoare triple {26304#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:40,016 INFO L273 TraceCheckUtils]: 149: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:40,016 INFO L273 TraceCheckUtils]: 150: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,016 INFO L273 TraceCheckUtils]: 151: Hoare triple {26304#true} assume !(~i~0 < 10000); {26304#true} is VALID [2018-11-14 17:08:40,016 INFO L273 TraceCheckUtils]: 152: Hoare triple {26304#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26304#true} is VALID [2018-11-14 17:08:40,016 INFO L273 TraceCheckUtils]: 153: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,016 INFO L268 TraceCheckUtils]: 154: Hoare quadruple {26304#true} {26305#false} #75#return; {26305#false} is VALID [2018-11-14 17:08:40,016 INFO L273 TraceCheckUtils]: 155: Hoare triple {26305#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; {26305#false} is VALID [2018-11-14 17:08:40,016 INFO L273 TraceCheckUtils]: 156: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,016 INFO L273 TraceCheckUtils]: 157: Hoare triple {26305#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:40,017 INFO L273 TraceCheckUtils]: 158: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:40,017 INFO L273 TraceCheckUtils]: 159: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,017 INFO L273 TraceCheckUtils]: 160: Hoare triple {26305#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:40,017 INFO L273 TraceCheckUtils]: 161: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:40,017 INFO L273 TraceCheckUtils]: 162: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,017 INFO L273 TraceCheckUtils]: 163: Hoare triple {26305#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:40,017 INFO L273 TraceCheckUtils]: 164: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:40,017 INFO L273 TraceCheckUtils]: 165: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,017 INFO L273 TraceCheckUtils]: 166: Hoare triple {26305#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:40,017 INFO L273 TraceCheckUtils]: 167: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:40,018 INFO L273 TraceCheckUtils]: 168: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,018 INFO L273 TraceCheckUtils]: 169: Hoare triple {26305#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:40,018 INFO L273 TraceCheckUtils]: 170: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:40,018 INFO L273 TraceCheckUtils]: 171: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,018 INFO L273 TraceCheckUtils]: 172: Hoare triple {26305#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:40,018 INFO L273 TraceCheckUtils]: 173: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:40,018 INFO L273 TraceCheckUtils]: 174: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,018 INFO L273 TraceCheckUtils]: 175: Hoare triple {26305#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:40,018 INFO L273 TraceCheckUtils]: 176: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:40,018 INFO L273 TraceCheckUtils]: 177: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,019 INFO L273 TraceCheckUtils]: 178: Hoare triple {26305#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:40,019 INFO L273 TraceCheckUtils]: 179: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:40,019 INFO L273 TraceCheckUtils]: 180: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,019 INFO L273 TraceCheckUtils]: 181: Hoare triple {26305#false} assume !(~i~2 < 9999); {26305#false} is VALID [2018-11-14 17:08:40,019 INFO L273 TraceCheckUtils]: 182: Hoare triple {26305#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {26305#false} is VALID [2018-11-14 17:08:40,019 INFO L256 TraceCheckUtils]: 183: Hoare triple {26305#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {26304#true} is VALID [2018-11-14 17:08:40,019 INFO L273 TraceCheckUtils]: 184: Hoare triple {26304#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; {26304#true} is VALID [2018-11-14 17:08:40,019 INFO L273 TraceCheckUtils]: 185: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,019 INFO L273 TraceCheckUtils]: 186: Hoare triple {26304#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:40,019 INFO L273 TraceCheckUtils]: 187: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:40,020 INFO L273 TraceCheckUtils]: 188: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,020 INFO L273 TraceCheckUtils]: 189: Hoare triple {26304#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:40,020 INFO L273 TraceCheckUtils]: 190: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:40,020 INFO L273 TraceCheckUtils]: 191: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,020 INFO L273 TraceCheckUtils]: 192: Hoare triple {26304#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:40,020 INFO L273 TraceCheckUtils]: 193: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:40,020 INFO L273 TraceCheckUtils]: 194: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,020 INFO L273 TraceCheckUtils]: 195: Hoare triple {26304#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:40,020 INFO L273 TraceCheckUtils]: 196: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:40,020 INFO L273 TraceCheckUtils]: 197: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,021 INFO L273 TraceCheckUtils]: 198: Hoare triple {26304#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:40,021 INFO L273 TraceCheckUtils]: 199: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:40,021 INFO L273 TraceCheckUtils]: 200: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,021 INFO L273 TraceCheckUtils]: 201: Hoare triple {26304#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:40,021 INFO L273 TraceCheckUtils]: 202: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:40,021 INFO L273 TraceCheckUtils]: 203: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,021 INFO L273 TraceCheckUtils]: 204: Hoare triple {26304#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:40,021 INFO L273 TraceCheckUtils]: 205: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:40,021 INFO L273 TraceCheckUtils]: 206: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,021 INFO L273 TraceCheckUtils]: 207: Hoare triple {26304#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:40,022 INFO L273 TraceCheckUtils]: 208: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:40,022 INFO L273 TraceCheckUtils]: 209: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,022 INFO L273 TraceCheckUtils]: 210: Hoare triple {26304#true} assume !(~i~0 < 10000); {26304#true} is VALID [2018-11-14 17:08:40,022 INFO L273 TraceCheckUtils]: 211: Hoare triple {26304#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26304#true} is VALID [2018-11-14 17:08:40,022 INFO L273 TraceCheckUtils]: 212: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,022 INFO L268 TraceCheckUtils]: 213: Hoare quadruple {26304#true} {26305#false} #77#return; {26305#false} is VALID [2018-11-14 17:08:40,022 INFO L273 TraceCheckUtils]: 214: Hoare triple {26305#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {26305#false} is VALID [2018-11-14 17:08:40,022 INFO L273 TraceCheckUtils]: 215: Hoare triple {26305#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {26305#false} is VALID [2018-11-14 17:08:40,022 INFO L273 TraceCheckUtils]: 216: Hoare triple {26305#false} assume !false; {26305#false} is VALID [2018-11-14 17:08:40,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2018-11-14 17:08:40,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:40,044 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:40,053 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:08:40,125 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:08:40,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:08:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:40,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:40,506 INFO L256 TraceCheckUtils]: 0: Hoare triple {26304#true} call ULTIMATE.init(); {26304#true} is VALID [2018-11-14 17:08:40,506 INFO L273 TraceCheckUtils]: 1: Hoare triple {26304#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26304#true} is VALID [2018-11-14 17:08:40,506 INFO L273 TraceCheckUtils]: 2: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:40,506 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26304#true} {26304#true} #69#return; {26304#true} is VALID [2018-11-14 17:08:40,506 INFO L256 TraceCheckUtils]: 4: Hoare triple {26304#true} call #t~ret13 := main(); {26304#true} is VALID [2018-11-14 17:08:40,507 INFO L273 TraceCheckUtils]: 5: Hoare triple {26304#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; {26353#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:40,508 INFO L273 TraceCheckUtils]: 6: Hoare triple {26353#(<= main_~i~1 0)} assume true; {26353#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:40,508 INFO L273 TraceCheckUtils]: 7: Hoare triple {26353#(<= 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; {26353#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:40,509 INFO L273 TraceCheckUtils]: 8: Hoare triple {26353#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26307#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:40,509 INFO L273 TraceCheckUtils]: 9: Hoare triple {26307#(<= main_~i~1 1)} assume true; {26307#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:40,510 INFO L273 TraceCheckUtils]: 10: Hoare triple {26307#(<= 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; {26307#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:40,511 INFO L273 TraceCheckUtils]: 11: Hoare triple {26307#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26308#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:40,511 INFO L273 TraceCheckUtils]: 12: Hoare triple {26308#(<= main_~i~1 2)} assume true; {26308#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:40,512 INFO L273 TraceCheckUtils]: 13: Hoare triple {26308#(<= 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; {26308#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:40,512 INFO L273 TraceCheckUtils]: 14: Hoare triple {26308#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26309#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:40,513 INFO L273 TraceCheckUtils]: 15: Hoare triple {26309#(<= main_~i~1 3)} assume true; {26309#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:40,513 INFO L273 TraceCheckUtils]: 16: Hoare triple {26309#(<= 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; {26309#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:40,514 INFO L273 TraceCheckUtils]: 17: Hoare triple {26309#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26310#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:40,515 INFO L273 TraceCheckUtils]: 18: Hoare triple {26310#(<= main_~i~1 4)} assume true; {26310#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:40,515 INFO L273 TraceCheckUtils]: 19: Hoare triple {26310#(<= 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; {26310#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:40,516 INFO L273 TraceCheckUtils]: 20: Hoare triple {26310#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26311#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:40,516 INFO L273 TraceCheckUtils]: 21: Hoare triple {26311#(<= main_~i~1 5)} assume true; {26311#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:40,517 INFO L273 TraceCheckUtils]: 22: Hoare triple {26311#(<= 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; {26311#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:40,518 INFO L273 TraceCheckUtils]: 23: Hoare triple {26311#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26312#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:40,518 INFO L273 TraceCheckUtils]: 24: Hoare triple {26312#(<= main_~i~1 6)} assume true; {26312#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:40,519 INFO L273 TraceCheckUtils]: 25: Hoare triple {26312#(<= 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; {26312#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:40,519 INFO L273 TraceCheckUtils]: 26: Hoare triple {26312#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26313#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:40,520 INFO L273 TraceCheckUtils]: 27: Hoare triple {26313#(<= main_~i~1 7)} assume true; {26313#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:40,520 INFO L273 TraceCheckUtils]: 28: Hoare triple {26313#(<= 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; {26313#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:40,521 INFO L273 TraceCheckUtils]: 29: Hoare triple {26313#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26314#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:40,522 INFO L273 TraceCheckUtils]: 30: Hoare triple {26314#(<= main_~i~1 8)} assume true; {26314#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:40,522 INFO L273 TraceCheckUtils]: 31: Hoare triple {26314#(<= 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; {26314#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:40,523 INFO L273 TraceCheckUtils]: 32: Hoare triple {26314#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26315#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:40,523 INFO L273 TraceCheckUtils]: 33: Hoare triple {26315#(<= main_~i~1 9)} assume true; {26315#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:40,524 INFO L273 TraceCheckUtils]: 34: Hoare triple {26315#(<= 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; {26315#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:40,524 INFO L273 TraceCheckUtils]: 35: Hoare triple {26315#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26316#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:40,525 INFO L273 TraceCheckUtils]: 36: Hoare triple {26316#(<= main_~i~1 10)} assume true; {26316#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:40,526 INFO L273 TraceCheckUtils]: 37: Hoare triple {26316#(<= 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; {26316#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:40,526 INFO L273 TraceCheckUtils]: 38: Hoare triple {26316#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26317#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:40,527 INFO L273 TraceCheckUtils]: 39: Hoare triple {26317#(<= main_~i~1 11)} assume true; {26317#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:40,527 INFO L273 TraceCheckUtils]: 40: Hoare triple {26317#(<= 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; {26317#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:40,528 INFO L273 TraceCheckUtils]: 41: Hoare triple {26317#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26318#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:40,528 INFO L273 TraceCheckUtils]: 42: Hoare triple {26318#(<= main_~i~1 12)} assume true; {26318#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:40,529 INFO L273 TraceCheckUtils]: 43: Hoare triple {26318#(<= 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; {26318#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:40,530 INFO L273 TraceCheckUtils]: 44: Hoare triple {26318#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26319#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:40,530 INFO L273 TraceCheckUtils]: 45: Hoare triple {26319#(<= main_~i~1 13)} assume true; {26319#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:40,531 INFO L273 TraceCheckUtils]: 46: Hoare triple {26319#(<= 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; {26319#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:40,531 INFO L273 TraceCheckUtils]: 47: Hoare triple {26319#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26320#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:40,532 INFO L273 TraceCheckUtils]: 48: Hoare triple {26320#(<= main_~i~1 14)} assume true; {26320#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:40,532 INFO L273 TraceCheckUtils]: 49: Hoare triple {26320#(<= 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; {26320#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:40,533 INFO L273 TraceCheckUtils]: 50: Hoare triple {26320#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26321#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:40,534 INFO L273 TraceCheckUtils]: 51: Hoare triple {26321#(<= main_~i~1 15)} assume true; {26321#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:40,534 INFO L273 TraceCheckUtils]: 52: Hoare triple {26321#(<= 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; {26321#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:40,535 INFO L273 TraceCheckUtils]: 53: Hoare triple {26321#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26322#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:40,535 INFO L273 TraceCheckUtils]: 54: Hoare triple {26322#(<= main_~i~1 16)} assume true; {26322#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:40,536 INFO L273 TraceCheckUtils]: 55: Hoare triple {26322#(<= 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; {26322#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:40,536 INFO L273 TraceCheckUtils]: 56: Hoare triple {26322#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26323#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:40,537 INFO L273 TraceCheckUtils]: 57: Hoare triple {26323#(<= main_~i~1 17)} assume true; {26323#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:40,537 INFO L273 TraceCheckUtils]: 58: Hoare triple {26323#(<= 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; {26323#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:40,538 INFO L273 TraceCheckUtils]: 59: Hoare triple {26323#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26324#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:40,539 INFO L273 TraceCheckUtils]: 60: Hoare triple {26324#(<= main_~i~1 18)} assume true; {26324#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:40,539 INFO L273 TraceCheckUtils]: 61: Hoare triple {26324#(<= 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; {26324#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:40,540 INFO L273 TraceCheckUtils]: 62: Hoare triple {26324#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26325#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:40,540 INFO L273 TraceCheckUtils]: 63: Hoare triple {26325#(<= main_~i~1 19)} assume true; {26325#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:40,541 INFO L273 TraceCheckUtils]: 64: Hoare triple {26325#(<= 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; {26325#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:40,542 INFO L273 TraceCheckUtils]: 65: Hoare triple {26325#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26326#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:40,542 INFO L273 TraceCheckUtils]: 66: Hoare triple {26326#(<= main_~i~1 20)} assume true; {26326#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:40,543 INFO L273 TraceCheckUtils]: 67: Hoare triple {26326#(<= 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; {26326#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:40,543 INFO L273 TraceCheckUtils]: 68: Hoare triple {26326#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26327#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:40,544 INFO L273 TraceCheckUtils]: 69: Hoare triple {26327#(<= main_~i~1 21)} assume true; {26327#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:40,544 INFO L273 TraceCheckUtils]: 70: Hoare triple {26327#(<= 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; {26327#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:40,545 INFO L273 TraceCheckUtils]: 71: Hoare triple {26327#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26328#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:40,546 INFO L273 TraceCheckUtils]: 72: Hoare triple {26328#(<= main_~i~1 22)} assume true; {26328#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:40,546 INFO L273 TraceCheckUtils]: 73: Hoare triple {26328#(<= 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; {26328#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:40,547 INFO L273 TraceCheckUtils]: 74: Hoare triple {26328#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26329#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:40,547 INFO L273 TraceCheckUtils]: 75: Hoare triple {26329#(<= main_~i~1 23)} assume true; {26329#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:40,548 INFO L273 TraceCheckUtils]: 76: Hoare triple {26329#(<= 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; {26329#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:40,549 INFO L273 TraceCheckUtils]: 77: Hoare triple {26329#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26330#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:40,549 INFO L273 TraceCheckUtils]: 78: Hoare triple {26330#(<= main_~i~1 24)} assume true; {26330#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:40,550 INFO L273 TraceCheckUtils]: 79: Hoare triple {26330#(<= 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; {26330#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:40,550 INFO L273 TraceCheckUtils]: 80: Hoare triple {26330#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26331#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:40,551 INFO L273 TraceCheckUtils]: 81: Hoare triple {26331#(<= main_~i~1 25)} assume true; {26331#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:40,551 INFO L273 TraceCheckUtils]: 82: Hoare triple {26331#(<= 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; {26331#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:40,552 INFO L273 TraceCheckUtils]: 83: Hoare triple {26331#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26332#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:40,553 INFO L273 TraceCheckUtils]: 84: Hoare triple {26332#(<= main_~i~1 26)} assume true; {26332#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:40,553 INFO L273 TraceCheckUtils]: 85: Hoare triple {26332#(<= 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; {26332#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:40,554 INFO L273 TraceCheckUtils]: 86: Hoare triple {26332#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26333#(<= main_~i~1 27)} is VALID [2018-11-14 17:08:40,554 INFO L273 TraceCheckUtils]: 87: Hoare triple {26333#(<= main_~i~1 27)} assume true; {26333#(<= main_~i~1 27)} is VALID [2018-11-14 17:08:40,555 INFO L273 TraceCheckUtils]: 88: Hoare triple {26333#(<= 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; {26333#(<= main_~i~1 27)} is VALID [2018-11-14 17:08:40,555 INFO L273 TraceCheckUtils]: 89: Hoare triple {26333#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26334#(<= main_~i~1 28)} is VALID [2018-11-14 17:08:40,556 INFO L273 TraceCheckUtils]: 90: Hoare triple {26334#(<= main_~i~1 28)} assume true; {26334#(<= main_~i~1 28)} is VALID [2018-11-14 17:08:40,557 INFO L273 TraceCheckUtils]: 91: Hoare triple {26334#(<= main_~i~1 28)} assume !(~i~1 < 10000); {26305#false} is VALID [2018-11-14 17:08:40,557 INFO L256 TraceCheckUtils]: 92: Hoare triple {26305#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {26305#false} is VALID [2018-11-14 17:08:40,557 INFO L273 TraceCheckUtils]: 93: Hoare triple {26305#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; {26305#false} is VALID [2018-11-14 17:08:40,557 INFO L273 TraceCheckUtils]: 94: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,557 INFO L273 TraceCheckUtils]: 95: Hoare triple {26305#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:40,558 INFO L273 TraceCheckUtils]: 96: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:40,558 INFO L273 TraceCheckUtils]: 97: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,558 INFO L273 TraceCheckUtils]: 98: Hoare triple {26305#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:40,558 INFO L273 TraceCheckUtils]: 99: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:40,558 INFO L273 TraceCheckUtils]: 100: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,558 INFO L273 TraceCheckUtils]: 101: Hoare triple {26305#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:40,559 INFO L273 TraceCheckUtils]: 102: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:40,559 INFO L273 TraceCheckUtils]: 103: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,559 INFO L273 TraceCheckUtils]: 104: Hoare triple {26305#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:40,559 INFO L273 TraceCheckUtils]: 105: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:40,559 INFO L273 TraceCheckUtils]: 106: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,559 INFO L273 TraceCheckUtils]: 107: Hoare triple {26305#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:40,560 INFO L273 TraceCheckUtils]: 108: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:40,560 INFO L273 TraceCheckUtils]: 109: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,560 INFO L273 TraceCheckUtils]: 110: Hoare triple {26305#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:40,560 INFO L273 TraceCheckUtils]: 111: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:40,560 INFO L273 TraceCheckUtils]: 112: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,560 INFO L273 TraceCheckUtils]: 113: Hoare triple {26305#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:40,561 INFO L273 TraceCheckUtils]: 114: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:40,561 INFO L273 TraceCheckUtils]: 115: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,561 INFO L273 TraceCheckUtils]: 116: Hoare triple {26305#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:40,561 INFO L273 TraceCheckUtils]: 117: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:40,561 INFO L273 TraceCheckUtils]: 118: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,562 INFO L273 TraceCheckUtils]: 119: Hoare triple {26305#false} assume !(~i~0 < 10000); {26305#false} is VALID [2018-11-14 17:08:40,562 INFO L273 TraceCheckUtils]: 120: Hoare triple {26305#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26305#false} is VALID [2018-11-14 17:08:40,562 INFO L273 TraceCheckUtils]: 121: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,562 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {26305#false} {26305#false} #73#return; {26305#false} is VALID [2018-11-14 17:08:40,562 INFO L273 TraceCheckUtils]: 123: Hoare triple {26305#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); {26305#false} is VALID [2018-11-14 17:08:40,562 INFO L256 TraceCheckUtils]: 124: Hoare triple {26305#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {26305#false} is VALID [2018-11-14 17:08:40,562 INFO L273 TraceCheckUtils]: 125: Hoare triple {26305#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; {26305#false} is VALID [2018-11-14 17:08:40,562 INFO L273 TraceCheckUtils]: 126: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,562 INFO L273 TraceCheckUtils]: 127: Hoare triple {26305#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:40,563 INFO L273 TraceCheckUtils]: 128: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:40,563 INFO L273 TraceCheckUtils]: 129: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,563 INFO L273 TraceCheckUtils]: 130: Hoare triple {26305#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:40,563 INFO L273 TraceCheckUtils]: 131: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:40,563 INFO L273 TraceCheckUtils]: 132: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,563 INFO L273 TraceCheckUtils]: 133: Hoare triple {26305#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:40,563 INFO L273 TraceCheckUtils]: 134: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:40,563 INFO L273 TraceCheckUtils]: 135: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,563 INFO L273 TraceCheckUtils]: 136: Hoare triple {26305#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:40,563 INFO L273 TraceCheckUtils]: 137: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:40,564 INFO L273 TraceCheckUtils]: 138: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,564 INFO L273 TraceCheckUtils]: 139: Hoare triple {26305#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:40,564 INFO L273 TraceCheckUtils]: 140: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:40,564 INFO L273 TraceCheckUtils]: 141: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,564 INFO L273 TraceCheckUtils]: 142: Hoare triple {26305#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:40,564 INFO L273 TraceCheckUtils]: 143: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:40,564 INFO L273 TraceCheckUtils]: 144: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,564 INFO L273 TraceCheckUtils]: 145: Hoare triple {26305#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:40,564 INFO L273 TraceCheckUtils]: 146: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:40,564 INFO L273 TraceCheckUtils]: 147: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,565 INFO L273 TraceCheckUtils]: 148: Hoare triple {26305#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:40,565 INFO L273 TraceCheckUtils]: 149: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:40,565 INFO L273 TraceCheckUtils]: 150: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,565 INFO L273 TraceCheckUtils]: 151: Hoare triple {26305#false} assume !(~i~0 < 10000); {26305#false} is VALID [2018-11-14 17:08:40,565 INFO L273 TraceCheckUtils]: 152: Hoare triple {26305#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26305#false} is VALID [2018-11-14 17:08:40,565 INFO L273 TraceCheckUtils]: 153: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,565 INFO L268 TraceCheckUtils]: 154: Hoare quadruple {26305#false} {26305#false} #75#return; {26305#false} is VALID [2018-11-14 17:08:40,565 INFO L273 TraceCheckUtils]: 155: Hoare triple {26305#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; {26305#false} is VALID [2018-11-14 17:08:40,565 INFO L273 TraceCheckUtils]: 156: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,565 INFO L273 TraceCheckUtils]: 157: Hoare triple {26305#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:40,566 INFO L273 TraceCheckUtils]: 158: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:40,566 INFO L273 TraceCheckUtils]: 159: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,566 INFO L273 TraceCheckUtils]: 160: Hoare triple {26305#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:40,566 INFO L273 TraceCheckUtils]: 161: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:40,566 INFO L273 TraceCheckUtils]: 162: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,566 INFO L273 TraceCheckUtils]: 163: Hoare triple {26305#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:40,566 INFO L273 TraceCheckUtils]: 164: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:40,566 INFO L273 TraceCheckUtils]: 165: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,566 INFO L273 TraceCheckUtils]: 166: Hoare triple {26305#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:40,567 INFO L273 TraceCheckUtils]: 167: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:40,567 INFO L273 TraceCheckUtils]: 168: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,567 INFO L273 TraceCheckUtils]: 169: Hoare triple {26305#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:40,567 INFO L273 TraceCheckUtils]: 170: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:40,567 INFO L273 TraceCheckUtils]: 171: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,567 INFO L273 TraceCheckUtils]: 172: Hoare triple {26305#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:40,567 INFO L273 TraceCheckUtils]: 173: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:40,567 INFO L273 TraceCheckUtils]: 174: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,567 INFO L273 TraceCheckUtils]: 175: Hoare triple {26305#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:40,567 INFO L273 TraceCheckUtils]: 176: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:40,567 INFO L273 TraceCheckUtils]: 177: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,568 INFO L273 TraceCheckUtils]: 178: Hoare triple {26305#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:40,568 INFO L273 TraceCheckUtils]: 179: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:40,568 INFO L273 TraceCheckUtils]: 180: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,568 INFO L273 TraceCheckUtils]: 181: Hoare triple {26305#false} assume !(~i~2 < 9999); {26305#false} is VALID [2018-11-14 17:08:40,568 INFO L273 TraceCheckUtils]: 182: Hoare triple {26305#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {26305#false} is VALID [2018-11-14 17:08:40,568 INFO L256 TraceCheckUtils]: 183: Hoare triple {26305#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {26305#false} is VALID [2018-11-14 17:08:40,568 INFO L273 TraceCheckUtils]: 184: Hoare triple {26305#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; {26305#false} is VALID [2018-11-14 17:08:40,568 INFO L273 TraceCheckUtils]: 185: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,568 INFO L273 TraceCheckUtils]: 186: Hoare triple {26305#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:40,568 INFO L273 TraceCheckUtils]: 187: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:40,569 INFO L273 TraceCheckUtils]: 188: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,569 INFO L273 TraceCheckUtils]: 189: Hoare triple {26305#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:40,569 INFO L273 TraceCheckUtils]: 190: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:40,569 INFO L273 TraceCheckUtils]: 191: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,569 INFO L273 TraceCheckUtils]: 192: Hoare triple {26305#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:40,569 INFO L273 TraceCheckUtils]: 193: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:40,570 INFO L273 TraceCheckUtils]: 194: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,570 INFO L273 TraceCheckUtils]: 195: Hoare triple {26305#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:40,570 INFO L273 TraceCheckUtils]: 196: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:40,570 INFO L273 TraceCheckUtils]: 197: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,570 INFO L273 TraceCheckUtils]: 198: Hoare triple {26305#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:40,570 INFO L273 TraceCheckUtils]: 199: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:40,570 INFO L273 TraceCheckUtils]: 200: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,570 INFO L273 TraceCheckUtils]: 201: Hoare triple {26305#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:40,571 INFO L273 TraceCheckUtils]: 202: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:40,571 INFO L273 TraceCheckUtils]: 203: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,571 INFO L273 TraceCheckUtils]: 204: Hoare triple {26305#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:40,571 INFO L273 TraceCheckUtils]: 205: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:40,571 INFO L273 TraceCheckUtils]: 206: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,571 INFO L273 TraceCheckUtils]: 207: Hoare triple {26305#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:40,571 INFO L273 TraceCheckUtils]: 208: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:40,571 INFO L273 TraceCheckUtils]: 209: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,571 INFO L273 TraceCheckUtils]: 210: Hoare triple {26305#false} assume !(~i~0 < 10000); {26305#false} is VALID [2018-11-14 17:08:40,571 INFO L273 TraceCheckUtils]: 211: Hoare triple {26305#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26305#false} is VALID [2018-11-14 17:08:40,572 INFO L273 TraceCheckUtils]: 212: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:40,572 INFO L268 TraceCheckUtils]: 213: Hoare quadruple {26305#false} {26305#false} #77#return; {26305#false} is VALID [2018-11-14 17:08:40,572 INFO L273 TraceCheckUtils]: 214: Hoare triple {26305#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {26305#false} is VALID [2018-11-14 17:08:40,572 INFO L273 TraceCheckUtils]: 215: Hoare triple {26305#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {26305#false} is VALID [2018-11-14 17:08:40,572 INFO L273 TraceCheckUtils]: 216: Hoare triple {26305#false} assume !false; {26305#false} is VALID [2018-11-14 17:08:40,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2018-11-14 17:08:40,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:40,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-14 17:08:40,614 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 217 [2018-11-14 17:08:40,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:40,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-14 17:08:40,752 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:40,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-14 17:08:40,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-14 17:08:40,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-14 17:08:40,753 INFO L87 Difference]: Start difference. First operand 158 states and 162 transitions. Second operand 32 states. [2018-11-14 17:08:42,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:42,142 INFO L93 Difference]: Finished difference Result 228 states and 236 transitions. [2018-11-14 17:08:42,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-14 17:08:42,142 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 217 [2018-11-14 17:08:42,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:42,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 17:08:42,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 144 transitions. [2018-11-14 17:08:42,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 17:08:42,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 144 transitions. [2018-11-14 17:08:42,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 144 transitions. [2018-11-14 17:08:42,274 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:42,277 INFO L225 Difference]: With dead ends: 228 [2018-11-14 17:08:42,277 INFO L226 Difference]: Without dead ends: 162 [2018-11-14 17:08:42,277 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-14 17:08:42,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-14 17:08:42,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-11-14 17:08:42,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:42,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand 161 states. [2018-11-14 17:08:42,573 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 161 states. [2018-11-14 17:08:42,574 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 161 states. [2018-11-14 17:08:42,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:42,577 INFO L93 Difference]: Finished difference Result 162 states and 166 transitions. [2018-11-14 17:08:42,577 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 166 transitions. [2018-11-14 17:08:42,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:42,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:42,578 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 162 states. [2018-11-14 17:08:42,578 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 162 states. [2018-11-14 17:08:42,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:42,581 INFO L93 Difference]: Finished difference Result 162 states and 166 transitions. [2018-11-14 17:08:42,581 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 166 transitions. [2018-11-14 17:08:42,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:42,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:42,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:42,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:42,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-14 17:08:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2018-11-14 17:08:42,585 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 217 [2018-11-14 17:08:42,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:42,585 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2018-11-14 17:08:42,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-14 17:08:42,585 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2018-11-14 17:08:42,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-14 17:08:42,586 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:42,587 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 27, 24, 24, 9, 8, 8, 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:42,587 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:42,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:42,587 INFO L82 PathProgramCache]: Analyzing trace with hash -437865831, now seen corresponding path program 29 times [2018-11-14 17:08:42,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:42,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:42,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:42,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:08:42,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:43,214 INFO L256 TraceCheckUtils]: 0: Hoare triple {27833#true} call ULTIMATE.init(); {27833#true} is VALID [2018-11-14 17:08:43,214 INFO L273 TraceCheckUtils]: 1: Hoare triple {27833#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27833#true} is VALID [2018-11-14 17:08:43,214 INFO L273 TraceCheckUtils]: 2: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,215 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27833#true} {27833#true} #69#return; {27833#true} is VALID [2018-11-14 17:08:43,215 INFO L256 TraceCheckUtils]: 4: Hoare triple {27833#true} call #t~ret13 := main(); {27833#true} is VALID [2018-11-14 17:08:43,215 INFO L273 TraceCheckUtils]: 5: Hoare triple {27833#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; {27835#(= main_~i~1 0)} is VALID [2018-11-14 17:08:43,216 INFO L273 TraceCheckUtils]: 6: Hoare triple {27835#(= main_~i~1 0)} assume true; {27835#(= main_~i~1 0)} is VALID [2018-11-14 17:08:43,216 INFO L273 TraceCheckUtils]: 7: Hoare triple {27835#(= 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; {27835#(= main_~i~1 0)} is VALID [2018-11-14 17:08:43,217 INFO L273 TraceCheckUtils]: 8: Hoare triple {27835#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27836#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:43,218 INFO L273 TraceCheckUtils]: 9: Hoare triple {27836#(<= main_~i~1 1)} assume true; {27836#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:43,218 INFO L273 TraceCheckUtils]: 10: Hoare triple {27836#(<= 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; {27836#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:43,219 INFO L273 TraceCheckUtils]: 11: Hoare triple {27836#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27837#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:43,219 INFO L273 TraceCheckUtils]: 12: Hoare triple {27837#(<= main_~i~1 2)} assume true; {27837#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:43,220 INFO L273 TraceCheckUtils]: 13: Hoare triple {27837#(<= 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; {27837#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:43,220 INFO L273 TraceCheckUtils]: 14: Hoare triple {27837#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27838#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:43,221 INFO L273 TraceCheckUtils]: 15: Hoare triple {27838#(<= main_~i~1 3)} assume true; {27838#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:43,221 INFO L273 TraceCheckUtils]: 16: Hoare triple {27838#(<= 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; {27838#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:43,222 INFO L273 TraceCheckUtils]: 17: Hoare triple {27838#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27839#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:43,223 INFO L273 TraceCheckUtils]: 18: Hoare triple {27839#(<= main_~i~1 4)} assume true; {27839#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:43,223 INFO L273 TraceCheckUtils]: 19: Hoare triple {27839#(<= 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; {27839#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:43,224 INFO L273 TraceCheckUtils]: 20: Hoare triple {27839#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27840#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:43,224 INFO L273 TraceCheckUtils]: 21: Hoare triple {27840#(<= main_~i~1 5)} assume true; {27840#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:43,225 INFO L273 TraceCheckUtils]: 22: Hoare triple {27840#(<= 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; {27840#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:43,226 INFO L273 TraceCheckUtils]: 23: Hoare triple {27840#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27841#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:43,226 INFO L273 TraceCheckUtils]: 24: Hoare triple {27841#(<= main_~i~1 6)} assume true; {27841#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:43,227 INFO L273 TraceCheckUtils]: 25: Hoare triple {27841#(<= 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; {27841#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:43,227 INFO L273 TraceCheckUtils]: 26: Hoare triple {27841#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27842#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:43,228 INFO L273 TraceCheckUtils]: 27: Hoare triple {27842#(<= main_~i~1 7)} assume true; {27842#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:43,228 INFO L273 TraceCheckUtils]: 28: Hoare triple {27842#(<= 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; {27842#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:43,229 INFO L273 TraceCheckUtils]: 29: Hoare triple {27842#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27843#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:43,230 INFO L273 TraceCheckUtils]: 30: Hoare triple {27843#(<= main_~i~1 8)} assume true; {27843#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:43,230 INFO L273 TraceCheckUtils]: 31: Hoare triple {27843#(<= 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; {27843#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:43,231 INFO L273 TraceCheckUtils]: 32: Hoare triple {27843#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27844#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:43,231 INFO L273 TraceCheckUtils]: 33: Hoare triple {27844#(<= main_~i~1 9)} assume true; {27844#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:43,232 INFO L273 TraceCheckUtils]: 34: Hoare triple {27844#(<= 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; {27844#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:43,232 INFO L273 TraceCheckUtils]: 35: Hoare triple {27844#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27845#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:43,233 INFO L273 TraceCheckUtils]: 36: Hoare triple {27845#(<= main_~i~1 10)} assume true; {27845#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:43,233 INFO L273 TraceCheckUtils]: 37: Hoare triple {27845#(<= 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; {27845#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:43,234 INFO L273 TraceCheckUtils]: 38: Hoare triple {27845#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27846#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:43,235 INFO L273 TraceCheckUtils]: 39: Hoare triple {27846#(<= main_~i~1 11)} assume true; {27846#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:43,235 INFO L273 TraceCheckUtils]: 40: Hoare triple {27846#(<= 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; {27846#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:43,236 INFO L273 TraceCheckUtils]: 41: Hoare triple {27846#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27847#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:43,236 INFO L273 TraceCheckUtils]: 42: Hoare triple {27847#(<= main_~i~1 12)} assume true; {27847#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:43,237 INFO L273 TraceCheckUtils]: 43: Hoare triple {27847#(<= 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; {27847#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:43,238 INFO L273 TraceCheckUtils]: 44: Hoare triple {27847#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27848#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:43,238 INFO L273 TraceCheckUtils]: 45: Hoare triple {27848#(<= main_~i~1 13)} assume true; {27848#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:43,239 INFO L273 TraceCheckUtils]: 46: Hoare triple {27848#(<= 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; {27848#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:43,239 INFO L273 TraceCheckUtils]: 47: Hoare triple {27848#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27849#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:43,240 INFO L273 TraceCheckUtils]: 48: Hoare triple {27849#(<= main_~i~1 14)} assume true; {27849#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:43,240 INFO L273 TraceCheckUtils]: 49: Hoare triple {27849#(<= 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; {27849#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:43,241 INFO L273 TraceCheckUtils]: 50: Hoare triple {27849#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27850#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:43,241 INFO L273 TraceCheckUtils]: 51: Hoare triple {27850#(<= main_~i~1 15)} assume true; {27850#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:43,242 INFO L273 TraceCheckUtils]: 52: Hoare triple {27850#(<= 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; {27850#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:43,243 INFO L273 TraceCheckUtils]: 53: Hoare triple {27850#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27851#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:43,243 INFO L273 TraceCheckUtils]: 54: Hoare triple {27851#(<= main_~i~1 16)} assume true; {27851#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:43,244 INFO L273 TraceCheckUtils]: 55: Hoare triple {27851#(<= 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; {27851#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:43,244 INFO L273 TraceCheckUtils]: 56: Hoare triple {27851#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27852#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:43,245 INFO L273 TraceCheckUtils]: 57: Hoare triple {27852#(<= main_~i~1 17)} assume true; {27852#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:43,245 INFO L273 TraceCheckUtils]: 58: Hoare triple {27852#(<= 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; {27852#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:43,246 INFO L273 TraceCheckUtils]: 59: Hoare triple {27852#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27853#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:43,247 INFO L273 TraceCheckUtils]: 60: Hoare triple {27853#(<= main_~i~1 18)} assume true; {27853#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:43,247 INFO L273 TraceCheckUtils]: 61: Hoare triple {27853#(<= 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; {27853#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:43,248 INFO L273 TraceCheckUtils]: 62: Hoare triple {27853#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27854#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:43,248 INFO L273 TraceCheckUtils]: 63: Hoare triple {27854#(<= main_~i~1 19)} assume true; {27854#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:43,249 INFO L273 TraceCheckUtils]: 64: Hoare triple {27854#(<= 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; {27854#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:43,250 INFO L273 TraceCheckUtils]: 65: Hoare triple {27854#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27855#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:43,250 INFO L273 TraceCheckUtils]: 66: Hoare triple {27855#(<= main_~i~1 20)} assume true; {27855#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:43,251 INFO L273 TraceCheckUtils]: 67: Hoare triple {27855#(<= 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; {27855#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:43,251 INFO L273 TraceCheckUtils]: 68: Hoare triple {27855#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27856#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:43,252 INFO L273 TraceCheckUtils]: 69: Hoare triple {27856#(<= main_~i~1 21)} assume true; {27856#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:43,252 INFO L273 TraceCheckUtils]: 70: Hoare triple {27856#(<= 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; {27856#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:43,253 INFO L273 TraceCheckUtils]: 71: Hoare triple {27856#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27857#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:43,253 INFO L273 TraceCheckUtils]: 72: Hoare triple {27857#(<= main_~i~1 22)} assume true; {27857#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:43,254 INFO L273 TraceCheckUtils]: 73: Hoare triple {27857#(<= 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; {27857#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:43,255 INFO L273 TraceCheckUtils]: 74: Hoare triple {27857#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27858#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:43,255 INFO L273 TraceCheckUtils]: 75: Hoare triple {27858#(<= main_~i~1 23)} assume true; {27858#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:43,256 INFO L273 TraceCheckUtils]: 76: Hoare triple {27858#(<= 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; {27858#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:43,256 INFO L273 TraceCheckUtils]: 77: Hoare triple {27858#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27859#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:43,257 INFO L273 TraceCheckUtils]: 78: Hoare triple {27859#(<= main_~i~1 24)} assume true; {27859#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:43,257 INFO L273 TraceCheckUtils]: 79: Hoare triple {27859#(<= 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; {27859#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:43,258 INFO L273 TraceCheckUtils]: 80: Hoare triple {27859#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27860#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:43,259 INFO L273 TraceCheckUtils]: 81: Hoare triple {27860#(<= main_~i~1 25)} assume true; {27860#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:43,259 INFO L273 TraceCheckUtils]: 82: Hoare triple {27860#(<= 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; {27860#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:43,260 INFO L273 TraceCheckUtils]: 83: Hoare triple {27860#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27861#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:43,260 INFO L273 TraceCheckUtils]: 84: Hoare triple {27861#(<= main_~i~1 26)} assume true; {27861#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:43,261 INFO L273 TraceCheckUtils]: 85: Hoare triple {27861#(<= 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; {27861#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:43,262 INFO L273 TraceCheckUtils]: 86: Hoare triple {27861#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27862#(<= main_~i~1 27)} is VALID [2018-11-14 17:08:43,262 INFO L273 TraceCheckUtils]: 87: Hoare triple {27862#(<= main_~i~1 27)} assume true; {27862#(<= main_~i~1 27)} is VALID [2018-11-14 17:08:43,263 INFO L273 TraceCheckUtils]: 88: Hoare triple {27862#(<= 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; {27862#(<= main_~i~1 27)} is VALID [2018-11-14 17:08:43,263 INFO L273 TraceCheckUtils]: 89: Hoare triple {27862#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27863#(<= main_~i~1 28)} is VALID [2018-11-14 17:08:43,264 INFO L273 TraceCheckUtils]: 90: Hoare triple {27863#(<= main_~i~1 28)} assume true; {27863#(<= main_~i~1 28)} is VALID [2018-11-14 17:08:43,264 INFO L273 TraceCheckUtils]: 91: Hoare triple {27863#(<= 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; {27863#(<= main_~i~1 28)} is VALID [2018-11-14 17:08:43,265 INFO L273 TraceCheckUtils]: 92: Hoare triple {27863#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27864#(<= main_~i~1 29)} is VALID [2018-11-14 17:08:43,265 INFO L273 TraceCheckUtils]: 93: Hoare triple {27864#(<= main_~i~1 29)} assume true; {27864#(<= main_~i~1 29)} is VALID [2018-11-14 17:08:43,266 INFO L273 TraceCheckUtils]: 94: Hoare triple {27864#(<= main_~i~1 29)} assume !(~i~1 < 10000); {27834#false} is VALID [2018-11-14 17:08:43,266 INFO L256 TraceCheckUtils]: 95: Hoare triple {27834#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {27833#true} is VALID [2018-11-14 17:08:43,267 INFO L273 TraceCheckUtils]: 96: Hoare triple {27833#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; {27833#true} is VALID [2018-11-14 17:08:43,267 INFO L273 TraceCheckUtils]: 97: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,267 INFO L273 TraceCheckUtils]: 98: Hoare triple {27833#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:43,267 INFO L273 TraceCheckUtils]: 99: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:43,267 INFO L273 TraceCheckUtils]: 100: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,267 INFO L273 TraceCheckUtils]: 101: Hoare triple {27833#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:43,268 INFO L273 TraceCheckUtils]: 102: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:43,268 INFO L273 TraceCheckUtils]: 103: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,268 INFO L273 TraceCheckUtils]: 104: Hoare triple {27833#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:43,268 INFO L273 TraceCheckUtils]: 105: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:43,268 INFO L273 TraceCheckUtils]: 106: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,268 INFO L273 TraceCheckUtils]: 107: Hoare triple {27833#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:43,268 INFO L273 TraceCheckUtils]: 108: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:43,268 INFO L273 TraceCheckUtils]: 109: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,269 INFO L273 TraceCheckUtils]: 110: Hoare triple {27833#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:43,269 INFO L273 TraceCheckUtils]: 111: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:43,269 INFO L273 TraceCheckUtils]: 112: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,269 INFO L273 TraceCheckUtils]: 113: Hoare triple {27833#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:43,269 INFO L273 TraceCheckUtils]: 114: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:43,269 INFO L273 TraceCheckUtils]: 115: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,269 INFO L273 TraceCheckUtils]: 116: Hoare triple {27833#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:43,269 INFO L273 TraceCheckUtils]: 117: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:43,269 INFO L273 TraceCheckUtils]: 118: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,269 INFO L273 TraceCheckUtils]: 119: Hoare triple {27833#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:43,270 INFO L273 TraceCheckUtils]: 120: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:43,270 INFO L273 TraceCheckUtils]: 121: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,270 INFO L273 TraceCheckUtils]: 122: Hoare triple {27833#true} assume !(~i~0 < 10000); {27833#true} is VALID [2018-11-14 17:08:43,270 INFO L273 TraceCheckUtils]: 123: Hoare triple {27833#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27833#true} is VALID [2018-11-14 17:08:43,270 INFO L273 TraceCheckUtils]: 124: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,270 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {27833#true} {27834#false} #73#return; {27834#false} is VALID [2018-11-14 17:08:43,270 INFO L273 TraceCheckUtils]: 126: Hoare triple {27834#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); {27834#false} is VALID [2018-11-14 17:08:43,270 INFO L256 TraceCheckUtils]: 127: Hoare triple {27834#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {27833#true} is VALID [2018-11-14 17:08:43,270 INFO L273 TraceCheckUtils]: 128: Hoare triple {27833#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; {27833#true} is VALID [2018-11-14 17:08:43,270 INFO L273 TraceCheckUtils]: 129: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,271 INFO L273 TraceCheckUtils]: 130: Hoare triple {27833#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:43,271 INFO L273 TraceCheckUtils]: 131: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:43,271 INFO L273 TraceCheckUtils]: 132: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,271 INFO L273 TraceCheckUtils]: 133: Hoare triple {27833#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:43,271 INFO L273 TraceCheckUtils]: 134: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:43,271 INFO L273 TraceCheckUtils]: 135: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,271 INFO L273 TraceCheckUtils]: 136: Hoare triple {27833#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:43,271 INFO L273 TraceCheckUtils]: 137: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:43,271 INFO L273 TraceCheckUtils]: 138: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,271 INFO L273 TraceCheckUtils]: 139: Hoare triple {27833#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:43,272 INFO L273 TraceCheckUtils]: 140: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:43,272 INFO L273 TraceCheckUtils]: 141: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,272 INFO L273 TraceCheckUtils]: 142: Hoare triple {27833#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:43,272 INFO L273 TraceCheckUtils]: 143: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:43,272 INFO L273 TraceCheckUtils]: 144: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,272 INFO L273 TraceCheckUtils]: 145: Hoare triple {27833#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:43,272 INFO L273 TraceCheckUtils]: 146: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:43,272 INFO L273 TraceCheckUtils]: 147: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,272 INFO L273 TraceCheckUtils]: 148: Hoare triple {27833#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:43,272 INFO L273 TraceCheckUtils]: 149: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:43,273 INFO L273 TraceCheckUtils]: 150: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,273 INFO L273 TraceCheckUtils]: 151: Hoare triple {27833#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:43,273 INFO L273 TraceCheckUtils]: 152: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:43,273 INFO L273 TraceCheckUtils]: 153: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,273 INFO L273 TraceCheckUtils]: 154: Hoare triple {27833#true} assume !(~i~0 < 10000); {27833#true} is VALID [2018-11-14 17:08:43,273 INFO L273 TraceCheckUtils]: 155: Hoare triple {27833#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27833#true} is VALID [2018-11-14 17:08:43,273 INFO L273 TraceCheckUtils]: 156: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,273 INFO L268 TraceCheckUtils]: 157: Hoare quadruple {27833#true} {27834#false} #75#return; {27834#false} is VALID [2018-11-14 17:08:43,273 INFO L273 TraceCheckUtils]: 158: Hoare triple {27834#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; {27834#false} is VALID [2018-11-14 17:08:43,274 INFO L273 TraceCheckUtils]: 159: Hoare triple {27834#false} assume true; {27834#false} is VALID [2018-11-14 17:08:43,274 INFO L273 TraceCheckUtils]: 160: Hoare triple {27834#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {27834#false} is VALID [2018-11-14 17:08:43,274 INFO L273 TraceCheckUtils]: 161: Hoare triple {27834#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {27834#false} is VALID [2018-11-14 17:08:43,274 INFO L273 TraceCheckUtils]: 162: Hoare triple {27834#false} assume true; {27834#false} is VALID [2018-11-14 17:08:43,274 INFO L273 TraceCheckUtils]: 163: Hoare triple {27834#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {27834#false} is VALID [2018-11-14 17:08:43,274 INFO L273 TraceCheckUtils]: 164: Hoare triple {27834#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {27834#false} is VALID [2018-11-14 17:08:43,274 INFO L273 TraceCheckUtils]: 165: Hoare triple {27834#false} assume true; {27834#false} is VALID [2018-11-14 17:08:43,274 INFO L273 TraceCheckUtils]: 166: Hoare triple {27834#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {27834#false} is VALID [2018-11-14 17:08:43,274 INFO L273 TraceCheckUtils]: 167: Hoare triple {27834#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {27834#false} is VALID [2018-11-14 17:08:43,274 INFO L273 TraceCheckUtils]: 168: Hoare triple {27834#false} assume true; {27834#false} is VALID [2018-11-14 17:08:43,275 INFO L273 TraceCheckUtils]: 169: Hoare triple {27834#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {27834#false} is VALID [2018-11-14 17:08:43,275 INFO L273 TraceCheckUtils]: 170: Hoare triple {27834#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {27834#false} is VALID [2018-11-14 17:08:43,275 INFO L273 TraceCheckUtils]: 171: Hoare triple {27834#false} assume true; {27834#false} is VALID [2018-11-14 17:08:43,275 INFO L273 TraceCheckUtils]: 172: Hoare triple {27834#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {27834#false} is VALID [2018-11-14 17:08:43,275 INFO L273 TraceCheckUtils]: 173: Hoare triple {27834#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {27834#false} is VALID [2018-11-14 17:08:43,275 INFO L273 TraceCheckUtils]: 174: Hoare triple {27834#false} assume true; {27834#false} is VALID [2018-11-14 17:08:43,275 INFO L273 TraceCheckUtils]: 175: Hoare triple {27834#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {27834#false} is VALID [2018-11-14 17:08:43,275 INFO L273 TraceCheckUtils]: 176: Hoare triple {27834#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {27834#false} is VALID [2018-11-14 17:08:43,275 INFO L273 TraceCheckUtils]: 177: Hoare triple {27834#false} assume true; {27834#false} is VALID [2018-11-14 17:08:43,275 INFO L273 TraceCheckUtils]: 178: Hoare triple {27834#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {27834#false} is VALID [2018-11-14 17:08:43,276 INFO L273 TraceCheckUtils]: 179: Hoare triple {27834#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {27834#false} is VALID [2018-11-14 17:08:43,276 INFO L273 TraceCheckUtils]: 180: Hoare triple {27834#false} assume true; {27834#false} is VALID [2018-11-14 17:08:43,276 INFO L273 TraceCheckUtils]: 181: Hoare triple {27834#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {27834#false} is VALID [2018-11-14 17:08:43,276 INFO L273 TraceCheckUtils]: 182: Hoare triple {27834#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {27834#false} is VALID [2018-11-14 17:08:43,276 INFO L273 TraceCheckUtils]: 183: Hoare triple {27834#false} assume true; {27834#false} is VALID [2018-11-14 17:08:43,276 INFO L273 TraceCheckUtils]: 184: Hoare triple {27834#false} assume !(~i~2 < 9999); {27834#false} is VALID [2018-11-14 17:08:43,276 INFO L273 TraceCheckUtils]: 185: Hoare triple {27834#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 39996, 4); {27834#false} is VALID [2018-11-14 17:08:43,276 INFO L256 TraceCheckUtils]: 186: Hoare triple {27834#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {27833#true} is VALID [2018-11-14 17:08:43,276 INFO L273 TraceCheckUtils]: 187: Hoare triple {27833#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; {27833#true} is VALID [2018-11-14 17:08:43,276 INFO L273 TraceCheckUtils]: 188: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,277 INFO L273 TraceCheckUtils]: 189: Hoare triple {27833#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:43,277 INFO L273 TraceCheckUtils]: 190: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:43,277 INFO L273 TraceCheckUtils]: 191: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,277 INFO L273 TraceCheckUtils]: 192: Hoare triple {27833#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:43,277 INFO L273 TraceCheckUtils]: 193: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:43,277 INFO L273 TraceCheckUtils]: 194: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,277 INFO L273 TraceCheckUtils]: 195: Hoare triple {27833#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:43,277 INFO L273 TraceCheckUtils]: 196: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:43,277 INFO L273 TraceCheckUtils]: 197: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,277 INFO L273 TraceCheckUtils]: 198: Hoare triple {27833#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:43,278 INFO L273 TraceCheckUtils]: 199: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:43,278 INFO L273 TraceCheckUtils]: 200: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,278 INFO L273 TraceCheckUtils]: 201: Hoare triple {27833#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:43,278 INFO L273 TraceCheckUtils]: 202: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:43,278 INFO L273 TraceCheckUtils]: 203: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,278 INFO L273 TraceCheckUtils]: 204: Hoare triple {27833#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:43,278 INFO L273 TraceCheckUtils]: 205: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:43,278 INFO L273 TraceCheckUtils]: 206: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,278 INFO L273 TraceCheckUtils]: 207: Hoare triple {27833#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:43,278 INFO L273 TraceCheckUtils]: 208: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:43,279 INFO L273 TraceCheckUtils]: 209: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,279 INFO L273 TraceCheckUtils]: 210: Hoare triple {27833#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:43,279 INFO L273 TraceCheckUtils]: 211: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:43,279 INFO L273 TraceCheckUtils]: 212: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,279 INFO L273 TraceCheckUtils]: 213: Hoare triple {27833#true} assume !(~i~0 < 10000); {27833#true} is VALID [2018-11-14 17:08:43,279 INFO L273 TraceCheckUtils]: 214: Hoare triple {27833#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27833#true} is VALID [2018-11-14 17:08:43,279 INFO L273 TraceCheckUtils]: 215: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:43,279 INFO L268 TraceCheckUtils]: 216: Hoare quadruple {27833#true} {27834#false} #77#return; {27834#false} is VALID [2018-11-14 17:08:43,279 INFO L273 TraceCheckUtils]: 217: Hoare triple {27834#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {27834#false} is VALID [2018-11-14 17:08:43,279 INFO L273 TraceCheckUtils]: 218: Hoare triple {27834#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {27834#false} is VALID [2018-11-14 17:08:43,280 INFO L273 TraceCheckUtils]: 219: Hoare triple {27834#false} assume !false; {27834#false} is VALID [2018-11-14 17:08:43,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2366 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2018-11-14 17:08:43,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:43,301 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:08:43,312 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1