java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-crafted/bor3_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:25:53,494 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:25:53,497 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:25:53,512 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:25:53,512 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:25:53,514 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:25:53,515 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:25:53,517 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:25:53,518 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:25:53,519 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:25:53,520 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:25:53,521 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:25:53,522 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:25:53,523 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:25:53,524 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:25:53,525 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:25:53,526 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:25:53,531 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:25:53,534 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:25:53,537 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:25:53,538 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:25:53,542 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:25:53,550 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:25:53,550 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:25:53,550 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:25:53,551 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:25:53,554 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:25:53,555 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:25:53,558 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:25:53,560 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:25:53,561 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:25:53,562 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:25:53,562 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:25:53,562 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:25:53,565 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:25:53,567 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:25:53,567 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:25:53,594 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:25:53,594 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:25:53,595 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:25:53,595 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:25:53,596 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:25:53,596 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:25:53,596 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:25:53,596 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:25:53,597 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:25:53,597 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:25:53,597 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:25:53,597 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:25:53,597 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:25:53,598 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:25:53,598 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:25:53,598 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:25:53,598 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:25:53,598 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:25:53,599 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:25:53,599 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:25:53,599 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:25:53,599 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:25:53,599 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:25:53,600 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:25:53,600 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:25:53,600 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:25:53,600 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:25:53,600 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:25:53,602 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:25:53,602 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:25:53,602 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:25:53,654 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:25:53,666 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:25:53,670 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:25:53,672 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:25:53,672 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:25:53,673 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-23 12:25:53,734 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6449d596e/a47be9dcdc334eae833b91433f5917d4/FLAG878b7191e [2018-11-23 12:25:54,180 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:25:54,180 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/bor3_true-unreach-call.i [2018-11-23 12:25:54,190 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6449d596e/a47be9dcdc334eae833b91433f5917d4/FLAG878b7191e [2018-11-23 12:25:54,565 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6449d596e/a47be9dcdc334eae833b91433f5917d4 [2018-11-23 12:25:54,575 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:25:54,576 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:25:54,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:25:54,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:25:54,581 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:25:54,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:25:54" (1/1) ... [2018-11-23 12:25:54,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f894052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:25:54, skipping insertion in model container [2018-11-23 12:25:54,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:25:54" (1/1) ... [2018-11-23 12:25:54,596 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:25:54,627 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:25:54,915 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:25:54,928 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:25:54,960 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:25:54,980 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:25:54,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:25:54 WrapperNode [2018-11-23 12:25:54,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:25:54,982 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:25:54,982 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:25:54,982 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:25:54,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:25:54" (1/1) ... [2018-11-23 12:25:55,001 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:25:54" (1/1) ... [2018-11-23 12:25:55,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:25:55,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:25:55,008 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:25:55,009 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:25:55,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:25:54" (1/1) ... [2018-11-23 12:25:55,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:25:54" (1/1) ... [2018-11-23 12:25:55,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:25:54" (1/1) ... [2018-11-23 12:25:55,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:25:54" (1/1) ... [2018-11-23 12:25:55,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:25:54" (1/1) ... [2018-11-23 12:25:55,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:25:54" (1/1) ... [2018-11-23 12:25:55,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:25:54" (1/1) ... [2018-11-23 12:25:55,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:25:55,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:25:55,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:25:55,051 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:25:55,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:25:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:25:55,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:25:55,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:25:55,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:25:55,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:25:55,183 INFO L130 BoogieDeclarations]: Found specification of procedure bor [2018-11-23 12:25:55,183 INFO L138 BoogieDeclarations]: Found implementation of procedure bor [2018-11-23 12:25:55,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:25:55,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:25:55,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:25:55,184 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:25:55,184 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:25:55,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:25:55,870 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:25:55,871 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:25:55,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:25:55 BoogieIcfgContainer [2018-11-23 12:25:55,871 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:25:55,873 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:25:55,873 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:25:55,876 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:25:55,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:25:54" (1/3) ... [2018-11-23 12:25:55,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589bf7b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:25:55, skipping insertion in model container [2018-11-23 12:25:55,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:25:54" (2/3) ... [2018-11-23 12:25:55,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589bf7b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:25:55, skipping insertion in model container [2018-11-23 12:25:55,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:25:55" (3/3) ... [2018-11-23 12:25:55,880 INFO L112 eAbstractionObserver]: Analyzing ICFG bor3_true-unreach-call.i [2018-11-23 12:25:55,889 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:25:55,897 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:25:55,914 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:25:55,947 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:25:55,948 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:25:55,948 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:25:55,948 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:25:55,949 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:25:55,949 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:25:55,949 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:25:55,949 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:25:55,949 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:25:55,968 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 12:25:55,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:25:55,975 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:25:55,976 INFO L402 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-23 12:25:55,979 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:25:55,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:25:55,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1283808693, now seen corresponding path program 1 times [2018-11-23 12:25:55,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:25:55,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:25:56,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:56,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:25:56,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:56,174 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 12:25:56,178 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34#true} is VALID [2018-11-23 12:25:56,179 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:25:56,180 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #66#return; {34#true} is VALID [2018-11-23 12:25:56,180 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret13 := main(); {34#true} is VALID [2018-11-23 12:25:56,180 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#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; {34#true} is VALID [2018-11-23 12:25:56,194 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 12:25:56,195 INFO L256 TraceCheckUtils]: 7: Hoare triple {35#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:25:56,195 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34#true} is VALID [2018-11-23 12:25:56,195 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#true} assume !(~i~0 < 10000); {34#true} is VALID [2018-11-23 12:25:56,196 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:25:56,196 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:25:56,196 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {34#true} {35#false} #70#return; {35#false} is VALID [2018-11-23 12:25:56,198 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {35#false} is VALID [2018-11-23 12:25:56,199 INFO L256 TraceCheckUtils]: 14: Hoare triple {35#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:25:56,199 INFO L273 TraceCheckUtils]: 15: Hoare triple {34#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34#true} is VALID [2018-11-23 12:25:56,199 INFO L273 TraceCheckUtils]: 16: Hoare triple {34#true} assume !(~i~0 < 10000); {34#true} is VALID [2018-11-23 12:25:56,200 INFO L273 TraceCheckUtils]: 17: Hoare triple {34#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:25:56,200 INFO L273 TraceCheckUtils]: 18: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:25:56,200 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {34#true} {35#false} #72#return; {35#false} is VALID [2018-11-23 12:25:56,201 INFO L273 TraceCheckUtils]: 20: Hoare triple {35#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {35#false} is VALID [2018-11-23 12:25:56,201 INFO L273 TraceCheckUtils]: 21: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 12:25:56,201 INFO L273 TraceCheckUtils]: 22: Hoare triple {35#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {35#false} is VALID [2018-11-23 12:25:56,203 INFO L256 TraceCheckUtils]: 23: Hoare triple {35#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:25:56,203 INFO L273 TraceCheckUtils]: 24: Hoare triple {34#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34#true} is VALID [2018-11-23 12:25:56,203 INFO L273 TraceCheckUtils]: 25: Hoare triple {34#true} assume !(~i~0 < 10000); {34#true} is VALID [2018-11-23 12:25:56,204 INFO L273 TraceCheckUtils]: 26: Hoare triple {34#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:25:56,204 INFO L273 TraceCheckUtils]: 27: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:25:56,204 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {34#true} {35#false} #74#return; {35#false} is VALID [2018-11-23 12:25:56,206 INFO L273 TraceCheckUtils]: 29: Hoare triple {35#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {35#false} is VALID [2018-11-23 12:25:56,206 INFO L273 TraceCheckUtils]: 30: Hoare triple {35#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {35#false} is VALID [2018-11-23 12:25:56,207 INFO L273 TraceCheckUtils]: 31: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 12:25:56,214 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-23 12:25:56,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:25:56,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:25:56,230 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:25:56,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:25:56,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:25:56,367 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-23 12:25:56,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:25:56,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:25:56,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:25:56,380 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 12:25:56,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:56,858 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2018-11-23 12:25:56,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:25:56,859 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:25:56,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:25:56,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:25:56,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:25:56,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:25:56,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:25:56,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2018-11-23 12:25:57,127 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:25:57,140 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:25:57,140 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:25:57,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:25:57,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:25:57,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 12:25:57,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:25:57,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 12:25:57,199 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:25:57,199 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:25:57,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:57,207 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:25:57,207 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:25:57,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:57,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:57,208 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:25:57,208 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:25:57,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:57,213 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:25:57,214 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:25:57,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:57,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:57,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:25:57,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:25:57,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:25:57,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 12:25:57,221 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2018-11-23 12:25:57,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:25:57,221 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 12:25:57,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:25:57,222 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:25:57,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:25:57,223 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:25:57,224 INFO L402 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-23 12:25:57,224 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:25:57,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:25:57,224 INFO L82 PathProgramCache]: Analyzing trace with hash 721846027, now seen corresponding path program 1 times [2018-11-23 12:25:57,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:25:57,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:25:57,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:57,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:25:57,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:57,340 INFO L256 TraceCheckUtils]: 0: Hoare triple {198#true} call ULTIMATE.init(); {198#true} is VALID [2018-11-23 12:25:57,340 INFO L273 TraceCheckUtils]: 1: Hoare triple {198#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {198#true} is VALID [2018-11-23 12:25:57,341 INFO L273 TraceCheckUtils]: 2: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:25:57,341 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} #66#return; {198#true} is VALID [2018-11-23 12:25:57,341 INFO L256 TraceCheckUtils]: 4: Hoare triple {198#true} call #t~ret13 := main(); {198#true} is VALID [2018-11-23 12:25:57,346 INFO L273 TraceCheckUtils]: 5: Hoare triple {198#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; {200#(= main_~i~1 0)} is VALID [2018-11-23 12:25:57,346 INFO L273 TraceCheckUtils]: 6: Hoare triple {200#(= main_~i~1 0)} assume !(~i~1 < 10000); {199#false} is VALID [2018-11-23 12:25:57,347 INFO L256 TraceCheckUtils]: 7: Hoare triple {199#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {198#true} is VALID [2018-11-23 12:25:57,347 INFO L273 TraceCheckUtils]: 8: Hoare triple {198#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {198#true} is VALID [2018-11-23 12:25:57,347 INFO L273 TraceCheckUtils]: 9: Hoare triple {198#true} assume !(~i~0 < 10000); {198#true} is VALID [2018-11-23 12:25:57,347 INFO L273 TraceCheckUtils]: 10: Hoare triple {198#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:25:57,348 INFO L273 TraceCheckUtils]: 11: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:25:57,348 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {198#true} {199#false} #70#return; {199#false} is VALID [2018-11-23 12:25:57,348 INFO L273 TraceCheckUtils]: 13: Hoare triple {199#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {199#false} is VALID [2018-11-23 12:25:57,349 INFO L256 TraceCheckUtils]: 14: Hoare triple {199#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {198#true} is VALID [2018-11-23 12:25:57,350 INFO L273 TraceCheckUtils]: 15: Hoare triple {198#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {198#true} is VALID [2018-11-23 12:25:57,350 INFO L273 TraceCheckUtils]: 16: Hoare triple {198#true} assume !(~i~0 < 10000); {198#true} is VALID [2018-11-23 12:25:57,350 INFO L273 TraceCheckUtils]: 17: Hoare triple {198#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:25:57,354 INFO L273 TraceCheckUtils]: 18: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:25:57,354 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {198#true} {199#false} #72#return; {199#false} is VALID [2018-11-23 12:25:57,355 INFO L273 TraceCheckUtils]: 20: Hoare triple {199#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {199#false} is VALID [2018-11-23 12:25:57,355 INFO L273 TraceCheckUtils]: 21: Hoare triple {199#false} assume !(~i~2 < 9999); {199#false} is VALID [2018-11-23 12:25:57,355 INFO L273 TraceCheckUtils]: 22: Hoare triple {199#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {199#false} is VALID [2018-11-23 12:25:57,357 INFO L256 TraceCheckUtils]: 23: Hoare triple {199#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {198#true} is VALID [2018-11-23 12:25:57,357 INFO L273 TraceCheckUtils]: 24: Hoare triple {198#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {198#true} is VALID [2018-11-23 12:25:57,357 INFO L273 TraceCheckUtils]: 25: Hoare triple {198#true} assume !(~i~0 < 10000); {198#true} is VALID [2018-11-23 12:25:57,358 INFO L273 TraceCheckUtils]: 26: Hoare triple {198#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:25:57,358 INFO L273 TraceCheckUtils]: 27: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:25:57,358 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {198#true} {199#false} #74#return; {199#false} is VALID [2018-11-23 12:25:57,359 INFO L273 TraceCheckUtils]: 29: Hoare triple {199#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {199#false} is VALID [2018-11-23 12:25:57,359 INFO L273 TraceCheckUtils]: 30: Hoare triple {199#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {199#false} is VALID [2018-11-23 12:25:57,359 INFO L273 TraceCheckUtils]: 31: Hoare triple {199#false} assume !false; {199#false} is VALID [2018-11-23 12:25:57,364 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-23 12:25:57,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:25:57,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:25:57,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:25:57,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:25:57,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:25:57,436 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-23 12:25:57,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:25:57,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:25:57,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:25:57,438 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2018-11-23 12:25:57,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:57,780 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 12:25:57,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:25:57,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:25:57,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:25:57,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:25:57,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:25:57,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:25:57,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:25:57,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2018-11-23 12:25:58,161 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:25:58,164 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:25:58,165 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:25:58,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:25:58,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:25:58,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 12:25:58,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:25:58,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 12:25:58,187 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 12:25:58,188 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 12:25:58,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:58,192 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:25:58,192 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:25:58,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:58,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:58,194 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 12:25:58,194 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 12:25:58,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:58,197 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:25:58,197 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:25:58,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:58,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:58,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:25:58,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:25:58,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:25:58,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 12:25:58,201 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2018-11-23 12:25:58,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:25:58,202 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 12:25:58,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:25:58,202 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:25:58,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:25:58,204 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:25:58,204 INFO L402 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, 1, 1] [2018-11-23 12:25:58,204 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:25:58,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:25:58,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1487444845, now seen corresponding path program 1 times [2018-11-23 12:25:58,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:25:58,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:25:58,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:58,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:25:58,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:58,324 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 12:25:58,325 INFO L273 TraceCheckUtils]: 1: Hoare triple {362#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {362#true} is VALID [2018-11-23 12:25:58,325 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:25:58,326 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #66#return; {362#true} is VALID [2018-11-23 12:25:58,326 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret13 := main(); {362#true} is VALID [2018-11-23 12:25:58,326 INFO L273 TraceCheckUtils]: 5: Hoare triple {362#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; {362#true} is VALID [2018-11-23 12:25:58,326 INFO L273 TraceCheckUtils]: 6: Hoare triple {362#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {362#true} is VALID [2018-11-23 12:25:58,327 INFO L273 TraceCheckUtils]: 7: Hoare triple {362#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {362#true} is VALID [2018-11-23 12:25:58,327 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~i~1 < 10000); {362#true} is VALID [2018-11-23 12:25:58,327 INFO L256 TraceCheckUtils]: 9: Hoare triple {362#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:25:58,328 INFO L273 TraceCheckUtils]: 10: Hoare triple {362#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {364#(= bor_~i~0 1)} is VALID [2018-11-23 12:25:58,333 INFO L273 TraceCheckUtils]: 11: Hoare triple {364#(= bor_~i~0 1)} assume !(~i~0 < 10000); {363#false} is VALID [2018-11-23 12:25:58,333 INFO L273 TraceCheckUtils]: 12: Hoare triple {363#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:25:58,333 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:25:58,334 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {363#false} {362#true} #70#return; {363#false} is VALID [2018-11-23 12:25:58,334 INFO L273 TraceCheckUtils]: 15: Hoare triple {363#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:25:58,334 INFO L256 TraceCheckUtils]: 16: Hoare triple {363#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:25:58,334 INFO L273 TraceCheckUtils]: 17: Hoare triple {362#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {362#true} is VALID [2018-11-23 12:25:58,335 INFO L273 TraceCheckUtils]: 18: Hoare triple {362#true} assume !(~i~0 < 10000); {362#true} is VALID [2018-11-23 12:25:58,335 INFO L273 TraceCheckUtils]: 19: Hoare triple {362#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {362#true} is VALID [2018-11-23 12:25:58,335 INFO L273 TraceCheckUtils]: 20: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:25:58,336 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {362#true} {363#false} #72#return; {363#false} is VALID [2018-11-23 12:25:58,336 INFO L273 TraceCheckUtils]: 22: Hoare triple {363#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {363#false} is VALID [2018-11-23 12:25:58,336 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#false} assume !(~i~2 < 9999); {363#false} is VALID [2018-11-23 12:25:58,337 INFO L273 TraceCheckUtils]: 24: Hoare triple {363#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:25:58,337 INFO L256 TraceCheckUtils]: 25: Hoare triple {363#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:25:58,337 INFO L273 TraceCheckUtils]: 26: Hoare triple {362#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {362#true} is VALID [2018-11-23 12:25:58,337 INFO L273 TraceCheckUtils]: 27: Hoare triple {362#true} assume !(~i~0 < 10000); {362#true} is VALID [2018-11-23 12:25:58,338 INFO L273 TraceCheckUtils]: 28: Hoare triple {362#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {362#true} is VALID [2018-11-23 12:25:58,338 INFO L273 TraceCheckUtils]: 29: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:25:58,338 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {362#true} {363#false} #74#return; {363#false} is VALID [2018-11-23 12:25:58,339 INFO L273 TraceCheckUtils]: 31: Hoare triple {363#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {363#false} is VALID [2018-11-23 12:25:58,339 INFO L273 TraceCheckUtils]: 32: Hoare triple {363#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {363#false} is VALID [2018-11-23 12:25:58,339 INFO L273 TraceCheckUtils]: 33: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 12:25:58,342 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 12:25:58,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:25:58,342 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:25:58,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:25:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:58,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:25:58,581 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 12:25:58,581 INFO L273 TraceCheckUtils]: 1: Hoare triple {362#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {362#true} is VALID [2018-11-23 12:25:58,581 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:25:58,582 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #66#return; {362#true} is VALID [2018-11-23 12:25:58,582 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret13 := main(); {362#true} is VALID [2018-11-23 12:25:58,582 INFO L273 TraceCheckUtils]: 5: Hoare triple {362#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; {362#true} is VALID [2018-11-23 12:25:58,582 INFO L273 TraceCheckUtils]: 6: Hoare triple {362#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {362#true} is VALID [2018-11-23 12:25:58,583 INFO L273 TraceCheckUtils]: 7: Hoare triple {362#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {362#true} is VALID [2018-11-23 12:25:58,583 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~i~1 < 10000); {362#true} is VALID [2018-11-23 12:25:58,583 INFO L256 TraceCheckUtils]: 9: Hoare triple {362#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:25:58,587 INFO L273 TraceCheckUtils]: 10: Hoare triple {362#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {398#(<= bor_~i~0 1)} is VALID [2018-11-23 12:25:58,589 INFO L273 TraceCheckUtils]: 11: Hoare triple {398#(<= bor_~i~0 1)} assume !(~i~0 < 10000); {363#false} is VALID [2018-11-23 12:25:58,589 INFO L273 TraceCheckUtils]: 12: Hoare triple {363#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:25:58,589 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:25:58,590 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {363#false} {362#true} #70#return; {363#false} is VALID [2018-11-23 12:25:58,590 INFO L273 TraceCheckUtils]: 15: Hoare triple {363#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:25:58,591 INFO L256 TraceCheckUtils]: 16: Hoare triple {363#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {363#false} is VALID [2018-11-23 12:25:58,591 INFO L273 TraceCheckUtils]: 17: Hoare triple {363#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {363#false} is VALID [2018-11-23 12:25:58,591 INFO L273 TraceCheckUtils]: 18: Hoare triple {363#false} assume !(~i~0 < 10000); {363#false} is VALID [2018-11-23 12:25:58,592 INFO L273 TraceCheckUtils]: 19: Hoare triple {363#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:25:58,592 INFO L273 TraceCheckUtils]: 20: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:25:58,592 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {363#false} {363#false} #72#return; {363#false} is VALID [2018-11-23 12:25:58,592 INFO L273 TraceCheckUtils]: 22: Hoare triple {363#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {363#false} is VALID [2018-11-23 12:25:58,593 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#false} assume !(~i~2 < 9999); {363#false} is VALID [2018-11-23 12:25:58,593 INFO L273 TraceCheckUtils]: 24: Hoare triple {363#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:25:58,593 INFO L256 TraceCheckUtils]: 25: Hoare triple {363#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {363#false} is VALID [2018-11-23 12:25:58,594 INFO L273 TraceCheckUtils]: 26: Hoare triple {363#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {363#false} is VALID [2018-11-23 12:25:58,594 INFO L273 TraceCheckUtils]: 27: Hoare triple {363#false} assume !(~i~0 < 10000); {363#false} is VALID [2018-11-23 12:25:58,594 INFO L273 TraceCheckUtils]: 28: Hoare triple {363#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:25:58,595 INFO L273 TraceCheckUtils]: 29: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:25:58,595 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {363#false} {363#false} #74#return; {363#false} is VALID [2018-11-23 12:25:58,595 INFO L273 TraceCheckUtils]: 31: Hoare triple {363#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {363#false} is VALID [2018-11-23 12:25:58,596 INFO L273 TraceCheckUtils]: 32: Hoare triple {363#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {363#false} is VALID [2018-11-23 12:25:58,596 INFO L273 TraceCheckUtils]: 33: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 12:25:58,598 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:25:58,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:25:58,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-23 12:25:58,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:25:58,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:25:58,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:25:58,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:25:58,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:25:58,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:25:58,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:25:58,693 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2018-11-23 12:25:59,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:59,004 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-23 12:25:59,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:25:59,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:25:59,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:25:59,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:25:59,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:25:59,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:25:59,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:25:59,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2018-11-23 12:25:59,133 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:25:59,136 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:25:59,136 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:25:59,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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-23 12:25:59,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:25:59,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 12:25:59,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:25:59,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 12:25:59,153 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 12:25:59,153 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 12:25:59,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:59,157 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:25:59,157 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:25:59,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:59,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:59,158 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 12:25:59,158 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 12:25:59,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:59,161 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:25:59,161 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:25:59,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:59,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:59,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:25:59,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:25:59,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:25:59,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-23 12:25:59,165 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2018-11-23 12:25:59,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:25:59,166 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-23 12:25:59,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:25:59,166 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:25:59,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:25:59,167 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:25:59,167 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:25:59,168 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:25:59,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:25:59,168 INFO L82 PathProgramCache]: Analyzing trace with hash 2063023467, now seen corresponding path program 1 times [2018-11-23 12:25:59,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:25:59,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:25:59,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:59,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:25:59,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:59,275 INFO L256 TraceCheckUtils]: 0: Hoare triple {630#true} call ULTIMATE.init(); {630#true} is VALID [2018-11-23 12:25:59,276 INFO L273 TraceCheckUtils]: 1: Hoare triple {630#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {630#true} is VALID [2018-11-23 12:25:59,276 INFO L273 TraceCheckUtils]: 2: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:25:59,276 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {630#true} {630#true} #66#return; {630#true} is VALID [2018-11-23 12:25:59,276 INFO L256 TraceCheckUtils]: 4: Hoare triple {630#true} call #t~ret13 := main(); {630#true} is VALID [2018-11-23 12:25:59,276 INFO L273 TraceCheckUtils]: 5: Hoare triple {630#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; {630#true} is VALID [2018-11-23 12:25:59,277 INFO L273 TraceCheckUtils]: 6: Hoare triple {630#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {630#true} is VALID [2018-11-23 12:25:59,277 INFO L273 TraceCheckUtils]: 7: Hoare triple {630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {630#true} is VALID [2018-11-23 12:25:59,277 INFO L273 TraceCheckUtils]: 8: Hoare triple {630#true} assume !(~i~1 < 10000); {630#true} is VALID [2018-11-23 12:25:59,278 INFO L256 TraceCheckUtils]: 9: Hoare triple {630#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {630#true} is VALID [2018-11-23 12:25:59,278 INFO L273 TraceCheckUtils]: 10: Hoare triple {630#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {630#true} is VALID [2018-11-23 12:25:59,278 INFO L273 TraceCheckUtils]: 11: Hoare triple {630#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {630#true} is VALID [2018-11-23 12:25:59,279 INFO L273 TraceCheckUtils]: 12: Hoare triple {630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {630#true} is VALID [2018-11-23 12:25:59,279 INFO L273 TraceCheckUtils]: 13: Hoare triple {630#true} assume !(~i~0 < 10000); {630#true} is VALID [2018-11-23 12:25:59,279 INFO L273 TraceCheckUtils]: 14: Hoare triple {630#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:25:59,280 INFO L273 TraceCheckUtils]: 15: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:25:59,280 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {630#true} {630#true} #70#return; {630#true} is VALID [2018-11-23 12:25:59,280 INFO L273 TraceCheckUtils]: 17: Hoare triple {630#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {630#true} is VALID [2018-11-23 12:25:59,286 INFO L256 TraceCheckUtils]: 18: Hoare triple {630#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {630#true} is VALID [2018-11-23 12:25:59,286 INFO L273 TraceCheckUtils]: 19: Hoare triple {630#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {630#true} is VALID [2018-11-23 12:25:59,287 INFO L273 TraceCheckUtils]: 20: Hoare triple {630#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {630#true} is VALID [2018-11-23 12:25:59,287 INFO L273 TraceCheckUtils]: 21: Hoare triple {630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {630#true} is VALID [2018-11-23 12:25:59,287 INFO L273 TraceCheckUtils]: 22: Hoare triple {630#true} assume !(~i~0 < 10000); {630#true} is VALID [2018-11-23 12:25:59,287 INFO L273 TraceCheckUtils]: 23: Hoare triple {630#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:25:59,288 INFO L273 TraceCheckUtils]: 24: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:25:59,288 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {630#true} {630#true} #72#return; {630#true} is VALID [2018-11-23 12:25:59,289 INFO L273 TraceCheckUtils]: 26: Hoare triple {630#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {632#(= main_~i~2 0)} is VALID [2018-11-23 12:25:59,294 INFO L273 TraceCheckUtils]: 27: Hoare triple {632#(= main_~i~2 0)} assume !(~i~2 < 9999); {631#false} is VALID [2018-11-23 12:25:59,294 INFO L273 TraceCheckUtils]: 28: Hoare triple {631#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {631#false} is VALID [2018-11-23 12:25:59,294 INFO L256 TraceCheckUtils]: 29: Hoare triple {631#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {630#true} is VALID [2018-11-23 12:25:59,294 INFO L273 TraceCheckUtils]: 30: Hoare triple {630#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {630#true} is VALID [2018-11-23 12:25:59,295 INFO L273 TraceCheckUtils]: 31: Hoare triple {630#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {630#true} is VALID [2018-11-23 12:25:59,295 INFO L273 TraceCheckUtils]: 32: Hoare triple {630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {630#true} is VALID [2018-11-23 12:25:59,295 INFO L273 TraceCheckUtils]: 33: Hoare triple {630#true} assume !(~i~0 < 10000); {630#true} is VALID [2018-11-23 12:25:59,295 INFO L273 TraceCheckUtils]: 34: Hoare triple {630#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:25:59,295 INFO L273 TraceCheckUtils]: 35: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:25:59,296 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {630#true} {631#false} #74#return; {631#false} is VALID [2018-11-23 12:25:59,296 INFO L273 TraceCheckUtils]: 37: Hoare triple {631#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {631#false} is VALID [2018-11-23 12:25:59,296 INFO L273 TraceCheckUtils]: 38: Hoare triple {631#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {631#false} is VALID [2018-11-23 12:25:59,296 INFO L273 TraceCheckUtils]: 39: Hoare triple {631#false} assume !false; {631#false} is VALID [2018-11-23 12:25:59,299 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:25:59,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:25:59,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:25:59,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:25:59,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:25:59,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:25:59,389 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:25:59,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:25:59,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:25:59,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:25:59,390 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2018-11-23 12:25:59,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:59,477 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 12:25:59,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:25:59,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:25:59,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:25:59,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:25:59,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:25:59,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:25:59,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:25:59,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2018-11-23 12:25:59,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:25:59,630 INFO L225 Difference]: With dead ends: 43 [2018-11-23 12:25:59,630 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:25:59,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:25:59,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:25:59,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 12:25:59,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:25:59,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 12:25:59,650 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 12:25:59,651 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 12:25:59,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:59,654 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:25:59,654 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:25:59,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:59,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:59,655 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 12:25:59,656 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 12:25:59,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:59,658 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:25:59,658 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:25:59,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:59,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:59,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:25:59,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:25:59,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:25:59,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 12:25:59,662 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2018-11-23 12:25:59,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:25:59,662 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 12:25:59,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:25:59,663 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:25:59,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 12:25:59,664 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:25:59,664 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:25:59,664 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:25:59,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:25:59,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1550668567, now seen corresponding path program 1 times [2018-11-23 12:25:59,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:25:59,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:25:59,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:59,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:25:59,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:59,769 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 12:25:59,769 INFO L273 TraceCheckUtils]: 1: Hoare triple {799#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {799#true} is VALID [2018-11-23 12:25:59,769 INFO L273 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:25:59,770 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #66#return; {799#true} is VALID [2018-11-23 12:25:59,770 INFO L256 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret13 := main(); {799#true} is VALID [2018-11-23 12:25:59,771 INFO L273 TraceCheckUtils]: 5: Hoare triple {799#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; {801#(= main_~i~1 0)} is VALID [2018-11-23 12:25:59,772 INFO L273 TraceCheckUtils]: 6: Hoare triple {801#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {801#(= main_~i~1 0)} is VALID [2018-11-23 12:25:59,772 INFO L273 TraceCheckUtils]: 7: Hoare triple {801#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {802#(<= main_~i~1 1)} is VALID [2018-11-23 12:25:59,774 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~1 1)} assume !(~i~1 < 10000); {800#false} is VALID [2018-11-23 12:25:59,774 INFO L256 TraceCheckUtils]: 9: Hoare triple {800#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {799#true} is VALID [2018-11-23 12:25:59,774 INFO L273 TraceCheckUtils]: 10: Hoare triple {799#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {799#true} is VALID [2018-11-23 12:25:59,775 INFO L273 TraceCheckUtils]: 11: Hoare triple {799#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {799#true} is VALID [2018-11-23 12:25:59,775 INFO L273 TraceCheckUtils]: 12: Hoare triple {799#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {799#true} is VALID [2018-11-23 12:25:59,775 INFO L273 TraceCheckUtils]: 13: Hoare triple {799#true} assume !(~i~0 < 10000); {799#true} is VALID [2018-11-23 12:25:59,776 INFO L273 TraceCheckUtils]: 14: Hoare triple {799#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:25:59,776 INFO L273 TraceCheckUtils]: 15: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:25:59,777 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {799#true} {800#false} #70#return; {800#false} is VALID [2018-11-23 12:25:59,777 INFO L273 TraceCheckUtils]: 17: Hoare triple {800#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:25:59,777 INFO L256 TraceCheckUtils]: 18: Hoare triple {800#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {799#true} is VALID [2018-11-23 12:25:59,778 INFO L273 TraceCheckUtils]: 19: Hoare triple {799#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {799#true} is VALID [2018-11-23 12:25:59,778 INFO L273 TraceCheckUtils]: 20: Hoare triple {799#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {799#true} is VALID [2018-11-23 12:25:59,778 INFO L273 TraceCheckUtils]: 21: Hoare triple {799#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {799#true} is VALID [2018-11-23 12:25:59,778 INFO L273 TraceCheckUtils]: 22: Hoare triple {799#true} assume !(~i~0 < 10000); {799#true} is VALID [2018-11-23 12:25:59,779 INFO L273 TraceCheckUtils]: 23: Hoare triple {799#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:25:59,779 INFO L273 TraceCheckUtils]: 24: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:25:59,779 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {799#true} {800#false} #72#return; {800#false} is VALID [2018-11-23 12:25:59,780 INFO L273 TraceCheckUtils]: 26: Hoare triple {800#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {800#false} is VALID [2018-11-23 12:25:59,780 INFO L273 TraceCheckUtils]: 27: Hoare triple {800#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {800#false} is VALID [2018-11-23 12:25:59,780 INFO L273 TraceCheckUtils]: 28: Hoare triple {800#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {800#false} is VALID [2018-11-23 12:25:59,781 INFO L273 TraceCheckUtils]: 29: Hoare triple {800#false} assume !(~i~2 < 9999); {800#false} is VALID [2018-11-23 12:25:59,781 INFO L273 TraceCheckUtils]: 30: Hoare triple {800#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:25:59,781 INFO L256 TraceCheckUtils]: 31: Hoare triple {800#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {799#true} is VALID [2018-11-23 12:25:59,781 INFO L273 TraceCheckUtils]: 32: Hoare triple {799#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {799#true} is VALID [2018-11-23 12:25:59,782 INFO L273 TraceCheckUtils]: 33: Hoare triple {799#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {799#true} is VALID [2018-11-23 12:25:59,782 INFO L273 TraceCheckUtils]: 34: Hoare triple {799#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {799#true} is VALID [2018-11-23 12:25:59,782 INFO L273 TraceCheckUtils]: 35: Hoare triple {799#true} assume !(~i~0 < 10000); {799#true} is VALID [2018-11-23 12:25:59,782 INFO L273 TraceCheckUtils]: 36: Hoare triple {799#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:25:59,783 INFO L273 TraceCheckUtils]: 37: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:25:59,783 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {799#true} {800#false} #74#return; {800#false} is VALID [2018-11-23 12:25:59,783 INFO L273 TraceCheckUtils]: 39: Hoare triple {800#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {800#false} is VALID [2018-11-23 12:25:59,783 INFO L273 TraceCheckUtils]: 40: Hoare triple {800#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {800#false} is VALID [2018-11-23 12:25:59,784 INFO L273 TraceCheckUtils]: 41: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 12:25:59,786 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:25:59,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:25:59,787 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:25:59,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:25:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:59,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:00,110 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 12:26:00,111 INFO L273 TraceCheckUtils]: 1: Hoare triple {799#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {799#true} is VALID [2018-11-23 12:26:00,111 INFO L273 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:26:00,112 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #66#return; {799#true} is VALID [2018-11-23 12:26:00,112 INFO L256 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret13 := main(); {799#true} is VALID [2018-11-23 12:26:00,113 INFO L273 TraceCheckUtils]: 5: Hoare triple {799#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; {821#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:00,114 INFO L273 TraceCheckUtils]: 6: Hoare triple {821#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {821#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:00,114 INFO L273 TraceCheckUtils]: 7: Hoare triple {821#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {802#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:00,115 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~1 1)} assume !(~i~1 < 10000); {800#false} is VALID [2018-11-23 12:26:00,115 INFO L256 TraceCheckUtils]: 9: Hoare triple {800#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {800#false} is VALID [2018-11-23 12:26:00,115 INFO L273 TraceCheckUtils]: 10: Hoare triple {800#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {800#false} is VALID [2018-11-23 12:26:00,116 INFO L273 TraceCheckUtils]: 11: Hoare triple {800#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {800#false} is VALID [2018-11-23 12:26:00,116 INFO L273 TraceCheckUtils]: 12: Hoare triple {800#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {800#false} is VALID [2018-11-23 12:26:00,116 INFO L273 TraceCheckUtils]: 13: Hoare triple {800#false} assume !(~i~0 < 10000); {800#false} is VALID [2018-11-23 12:26:00,116 INFO L273 TraceCheckUtils]: 14: Hoare triple {800#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:26:00,117 INFO L273 TraceCheckUtils]: 15: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:26:00,117 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {800#false} {800#false} #70#return; {800#false} is VALID [2018-11-23 12:26:00,117 INFO L273 TraceCheckUtils]: 17: Hoare triple {800#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:26:00,118 INFO L256 TraceCheckUtils]: 18: Hoare triple {800#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {800#false} is VALID [2018-11-23 12:26:00,118 INFO L273 TraceCheckUtils]: 19: Hoare triple {800#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {800#false} is VALID [2018-11-23 12:26:00,118 INFO L273 TraceCheckUtils]: 20: Hoare triple {800#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {800#false} is VALID [2018-11-23 12:26:00,119 INFO L273 TraceCheckUtils]: 21: Hoare triple {800#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {800#false} is VALID [2018-11-23 12:26:00,119 INFO L273 TraceCheckUtils]: 22: Hoare triple {800#false} assume !(~i~0 < 10000); {800#false} is VALID [2018-11-23 12:26:00,120 INFO L273 TraceCheckUtils]: 23: Hoare triple {800#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:26:00,120 INFO L273 TraceCheckUtils]: 24: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:26:00,120 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {800#false} {800#false} #72#return; {800#false} is VALID [2018-11-23 12:26:00,120 INFO L273 TraceCheckUtils]: 26: Hoare triple {800#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {800#false} is VALID [2018-11-23 12:26:00,120 INFO L273 TraceCheckUtils]: 27: Hoare triple {800#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {800#false} is VALID [2018-11-23 12:26:00,121 INFO L273 TraceCheckUtils]: 28: Hoare triple {800#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {800#false} is VALID [2018-11-23 12:26:00,121 INFO L273 TraceCheckUtils]: 29: Hoare triple {800#false} assume !(~i~2 < 9999); {800#false} is VALID [2018-11-23 12:26:00,121 INFO L273 TraceCheckUtils]: 30: Hoare triple {800#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:26:00,121 INFO L256 TraceCheckUtils]: 31: Hoare triple {800#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {800#false} is VALID [2018-11-23 12:26:00,121 INFO L273 TraceCheckUtils]: 32: Hoare triple {800#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {800#false} is VALID [2018-11-23 12:26:00,122 INFO L273 TraceCheckUtils]: 33: Hoare triple {800#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {800#false} is VALID [2018-11-23 12:26:00,122 INFO L273 TraceCheckUtils]: 34: Hoare triple {800#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {800#false} is VALID [2018-11-23 12:26:00,122 INFO L273 TraceCheckUtils]: 35: Hoare triple {800#false} assume !(~i~0 < 10000); {800#false} is VALID [2018-11-23 12:26:00,122 INFO L273 TraceCheckUtils]: 36: Hoare triple {800#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:26:00,122 INFO L273 TraceCheckUtils]: 37: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:26:00,123 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {800#false} {800#false} #74#return; {800#false} is VALID [2018-11-23 12:26:00,123 INFO L273 TraceCheckUtils]: 39: Hoare triple {800#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {800#false} is VALID [2018-11-23 12:26:00,123 INFO L273 TraceCheckUtils]: 40: Hoare triple {800#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {800#false} is VALID [2018-11-23 12:26:00,124 INFO L273 TraceCheckUtils]: 41: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 12:26:00,126 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:26:00,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:00,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:26:00,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 12:26:00,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:00,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:26:00,233 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:00,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:26:00,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:26:00,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:26:00,235 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2018-11-23 12:26:00,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:00,410 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 12:26:00,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:26:00,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 12:26:00,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:00,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:26:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:26:00,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:26:00,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:26:00,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2018-11-23 12:26:00,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:00,523 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:26:00,523 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:26:00,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:26:00,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:26:00,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 12:26:00,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:00,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-23 12:26:00,598 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-23 12:26:00,598 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-23 12:26:00,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:00,602 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:26:00,602 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:26:00,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:00,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:00,603 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-23 12:26:00,603 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-23 12:26:00,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:00,605 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:26:00,605 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:26:00,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:00,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:00,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:00,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:00,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:26:00,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-23 12:26:00,608 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2018-11-23 12:26:00,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:00,609 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 12:26:00,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:26:00,609 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:26:00,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 12:26:00,610 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:00,611 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 12:26:00,611 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:00,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:00,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1311885621, now seen corresponding path program 2 times [2018-11-23 12:26:00,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:00,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:00,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:00,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:00,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:00,740 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 12:26:00,740 INFO L273 TraceCheckUtils]: 1: Hoare triple {1114#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1114#true} is VALID [2018-11-23 12:26:00,741 INFO L273 TraceCheckUtils]: 2: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:26:00,741 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1114#true} {1114#true} #66#return; {1114#true} is VALID [2018-11-23 12:26:00,741 INFO L256 TraceCheckUtils]: 4: Hoare triple {1114#true} call #t~ret13 := main(); {1114#true} is VALID [2018-11-23 12:26:00,743 INFO L273 TraceCheckUtils]: 5: Hoare triple {1114#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; {1116#(= main_~i~1 0)} is VALID [2018-11-23 12:26:00,745 INFO L273 TraceCheckUtils]: 6: Hoare triple {1116#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {1116#(= main_~i~1 0)} is VALID [2018-11-23 12:26:00,745 INFO L273 TraceCheckUtils]: 7: Hoare triple {1116#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1117#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:00,747 INFO L273 TraceCheckUtils]: 8: Hoare triple {1117#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {1117#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:00,747 INFO L273 TraceCheckUtils]: 9: Hoare triple {1117#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1118#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:00,749 INFO L273 TraceCheckUtils]: 10: Hoare triple {1118#(<= main_~i~1 2)} assume !(~i~1 < 10000); {1115#false} is VALID [2018-11-23 12:26:00,749 INFO L256 TraceCheckUtils]: 11: Hoare triple {1115#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {1114#true} is VALID [2018-11-23 12:26:00,749 INFO L273 TraceCheckUtils]: 12: Hoare triple {1114#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1114#true} is VALID [2018-11-23 12:26:00,750 INFO L273 TraceCheckUtils]: 13: Hoare triple {1114#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1114#true} is VALID [2018-11-23 12:26:00,750 INFO L273 TraceCheckUtils]: 14: Hoare triple {1114#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1114#true} is VALID [2018-11-23 12:26:00,750 INFO L273 TraceCheckUtils]: 15: Hoare triple {1114#true} assume !(~i~0 < 10000); {1114#true} is VALID [2018-11-23 12:26:00,751 INFO L273 TraceCheckUtils]: 16: Hoare triple {1114#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:26:00,751 INFO L273 TraceCheckUtils]: 17: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:26:00,751 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1114#true} {1115#false} #70#return; {1115#false} is VALID [2018-11-23 12:26:00,751 INFO L273 TraceCheckUtils]: 19: Hoare triple {1115#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:26:00,752 INFO L256 TraceCheckUtils]: 20: Hoare triple {1115#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {1114#true} is VALID [2018-11-23 12:26:00,752 INFO L273 TraceCheckUtils]: 21: Hoare triple {1114#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1114#true} is VALID [2018-11-23 12:26:00,752 INFO L273 TraceCheckUtils]: 22: Hoare triple {1114#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1114#true} is VALID [2018-11-23 12:26:00,752 INFO L273 TraceCheckUtils]: 23: Hoare triple {1114#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1114#true} is VALID [2018-11-23 12:26:00,753 INFO L273 TraceCheckUtils]: 24: Hoare triple {1114#true} assume !(~i~0 < 10000); {1114#true} is VALID [2018-11-23 12:26:00,753 INFO L273 TraceCheckUtils]: 25: Hoare triple {1114#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:26:00,753 INFO L273 TraceCheckUtils]: 26: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:26:00,753 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1114#true} {1115#false} #72#return; {1115#false} is VALID [2018-11-23 12:26:00,753 INFO L273 TraceCheckUtils]: 28: Hoare triple {1115#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1115#false} is VALID [2018-11-23 12:26:00,754 INFO L273 TraceCheckUtils]: 29: Hoare triple {1115#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {1115#false} is VALID [2018-11-23 12:26:00,754 INFO L273 TraceCheckUtils]: 30: Hoare triple {1115#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {1115#false} is VALID [2018-11-23 12:26:00,754 INFO L273 TraceCheckUtils]: 31: Hoare triple {1115#false} assume !(~i~2 < 9999); {1115#false} is VALID [2018-11-23 12:26:00,754 INFO L273 TraceCheckUtils]: 32: Hoare triple {1115#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:26:00,754 INFO L256 TraceCheckUtils]: 33: Hoare triple {1115#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {1114#true} is VALID [2018-11-23 12:26:00,755 INFO L273 TraceCheckUtils]: 34: Hoare triple {1114#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1114#true} is VALID [2018-11-23 12:26:00,755 INFO L273 TraceCheckUtils]: 35: Hoare triple {1114#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1114#true} is VALID [2018-11-23 12:26:00,755 INFO L273 TraceCheckUtils]: 36: Hoare triple {1114#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1114#true} is VALID [2018-11-23 12:26:00,755 INFO L273 TraceCheckUtils]: 37: Hoare triple {1114#true} assume !(~i~0 < 10000); {1114#true} is VALID [2018-11-23 12:26:00,755 INFO L273 TraceCheckUtils]: 38: Hoare triple {1114#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:26:00,756 INFO L273 TraceCheckUtils]: 39: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:26:00,756 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1114#true} {1115#false} #74#return; {1115#false} is VALID [2018-11-23 12:26:00,756 INFO L273 TraceCheckUtils]: 41: Hoare triple {1115#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1115#false} is VALID [2018-11-23 12:26:00,756 INFO L273 TraceCheckUtils]: 42: Hoare triple {1115#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1115#false} is VALID [2018-11-23 12:26:00,756 INFO L273 TraceCheckUtils]: 43: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 12:26:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:26:00,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:00,759 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:00,768 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:26:00,801 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:26:00,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:00,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:00,989 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 12:26:00,989 INFO L273 TraceCheckUtils]: 1: Hoare triple {1114#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1114#true} is VALID [2018-11-23 12:26:00,989 INFO L273 TraceCheckUtils]: 2: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:26:00,990 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1114#true} {1114#true} #66#return; {1114#true} is VALID [2018-11-23 12:26:00,990 INFO L256 TraceCheckUtils]: 4: Hoare triple {1114#true} call #t~ret13 := main(); {1114#true} is VALID [2018-11-23 12:26:00,990 INFO L273 TraceCheckUtils]: 5: Hoare triple {1114#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; {1137#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:00,996 INFO L273 TraceCheckUtils]: 6: Hoare triple {1137#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {1137#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:00,996 INFO L273 TraceCheckUtils]: 7: Hoare triple {1137#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1117#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:00,998 INFO L273 TraceCheckUtils]: 8: Hoare triple {1117#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {1117#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:00,998 INFO L273 TraceCheckUtils]: 9: Hoare triple {1117#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1118#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:01,000 INFO L273 TraceCheckUtils]: 10: Hoare triple {1118#(<= main_~i~1 2)} assume !(~i~1 < 10000); {1115#false} is VALID [2018-11-23 12:26:01,000 INFO L256 TraceCheckUtils]: 11: Hoare triple {1115#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {1115#false} is VALID [2018-11-23 12:26:01,000 INFO L273 TraceCheckUtils]: 12: Hoare triple {1115#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1115#false} is VALID [2018-11-23 12:26:01,000 INFO L273 TraceCheckUtils]: 13: Hoare triple {1115#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1115#false} is VALID [2018-11-23 12:26:01,001 INFO L273 TraceCheckUtils]: 14: Hoare triple {1115#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1115#false} is VALID [2018-11-23 12:26:01,001 INFO L273 TraceCheckUtils]: 15: Hoare triple {1115#false} assume !(~i~0 < 10000); {1115#false} is VALID [2018-11-23 12:26:01,001 INFO L273 TraceCheckUtils]: 16: Hoare triple {1115#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:26:01,001 INFO L273 TraceCheckUtils]: 17: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:26:01,002 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1115#false} {1115#false} #70#return; {1115#false} is VALID [2018-11-23 12:26:01,002 INFO L273 TraceCheckUtils]: 19: Hoare triple {1115#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:26:01,003 INFO L256 TraceCheckUtils]: 20: Hoare triple {1115#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {1115#false} is VALID [2018-11-23 12:26:01,003 INFO L273 TraceCheckUtils]: 21: Hoare triple {1115#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1115#false} is VALID [2018-11-23 12:26:01,003 INFO L273 TraceCheckUtils]: 22: Hoare triple {1115#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1115#false} is VALID [2018-11-23 12:26:01,003 INFO L273 TraceCheckUtils]: 23: Hoare triple {1115#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1115#false} is VALID [2018-11-23 12:26:01,003 INFO L273 TraceCheckUtils]: 24: Hoare triple {1115#false} assume !(~i~0 < 10000); {1115#false} is VALID [2018-11-23 12:26:01,004 INFO L273 TraceCheckUtils]: 25: Hoare triple {1115#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:26:01,004 INFO L273 TraceCheckUtils]: 26: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:26:01,004 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1115#false} {1115#false} #72#return; {1115#false} is VALID [2018-11-23 12:26:01,004 INFO L273 TraceCheckUtils]: 28: Hoare triple {1115#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1115#false} is VALID [2018-11-23 12:26:01,004 INFO L273 TraceCheckUtils]: 29: Hoare triple {1115#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {1115#false} is VALID [2018-11-23 12:26:01,005 INFO L273 TraceCheckUtils]: 30: Hoare triple {1115#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {1115#false} is VALID [2018-11-23 12:26:01,005 INFO L273 TraceCheckUtils]: 31: Hoare triple {1115#false} assume !(~i~2 < 9999); {1115#false} is VALID [2018-11-23 12:26:01,005 INFO L273 TraceCheckUtils]: 32: Hoare triple {1115#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:26:01,005 INFO L256 TraceCheckUtils]: 33: Hoare triple {1115#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {1115#false} is VALID [2018-11-23 12:26:01,005 INFO L273 TraceCheckUtils]: 34: Hoare triple {1115#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1115#false} is VALID [2018-11-23 12:26:01,006 INFO L273 TraceCheckUtils]: 35: Hoare triple {1115#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1115#false} is VALID [2018-11-23 12:26:01,006 INFO L273 TraceCheckUtils]: 36: Hoare triple {1115#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1115#false} is VALID [2018-11-23 12:26:01,006 INFO L273 TraceCheckUtils]: 37: Hoare triple {1115#false} assume !(~i~0 < 10000); {1115#false} is VALID [2018-11-23 12:26:01,006 INFO L273 TraceCheckUtils]: 38: Hoare triple {1115#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:26:01,006 INFO L273 TraceCheckUtils]: 39: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:26:01,007 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1115#false} {1115#false} #74#return; {1115#false} is VALID [2018-11-23 12:26:01,007 INFO L273 TraceCheckUtils]: 41: Hoare triple {1115#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1115#false} is VALID [2018-11-23 12:26:01,007 INFO L273 TraceCheckUtils]: 42: Hoare triple {1115#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1115#false} is VALID [2018-11-23 12:26:01,007 INFO L273 TraceCheckUtils]: 43: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 12:26:01,010 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:26:01,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:01,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:26:01,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-23 12:26:01,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:01,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:26:01,097 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:01,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:26:01,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:26:01,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:26:01,098 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2018-11-23 12:26:01,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:01,261 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-23 12:26:01,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:26:01,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-23 12:26:01,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:01,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:26:01,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:26:01,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:26:01,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:26:01,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2018-11-23 12:26:01,388 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:01,390 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:26:01,391 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:26:01,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 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-23 12:26:01,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:26:01,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 12:26:01,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:01,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 12:26:01,474 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 12:26:01,475 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 12:26:01,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:01,477 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:26:01,477 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:26:01,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:01,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:01,478 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 12:26:01,478 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 12:26:01,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:01,480 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:26:01,480 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:26:01,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:01,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:01,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:01,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:01,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:26:01,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 12:26:01,483 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 44 [2018-11-23 12:26:01,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:01,483 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 12:26:01,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:26:01,483 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 12:26:01,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:26:01,484 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:01,485 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:01,485 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:01,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:01,485 INFO L82 PathProgramCache]: Analyzing trace with hash 525258797, now seen corresponding path program 3 times [2018-11-23 12:26:01,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:01,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:01,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:01,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:01,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:01,605 INFO L256 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2018-11-23 12:26:01,606 INFO L273 TraceCheckUtils]: 1: Hoare triple {1446#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1446#true} is VALID [2018-11-23 12:26:01,607 INFO L273 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:26:01,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2018-11-23 12:26:01,607 INFO L256 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret13 := main(); {1446#true} is VALID [2018-11-23 12:26:01,616 INFO L273 TraceCheckUtils]: 5: Hoare triple {1446#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; {1448#(= main_~i~1 0)} is VALID [2018-11-23 12:26:01,617 INFO L273 TraceCheckUtils]: 6: Hoare triple {1448#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {1448#(= main_~i~1 0)} is VALID [2018-11-23 12:26:01,621 INFO L273 TraceCheckUtils]: 7: Hoare triple {1448#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1449#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:01,621 INFO L273 TraceCheckUtils]: 8: Hoare triple {1449#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {1449#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:01,624 INFO L273 TraceCheckUtils]: 9: Hoare triple {1449#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1450#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:01,624 INFO L273 TraceCheckUtils]: 10: Hoare triple {1450#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {1450#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:01,625 INFO L273 TraceCheckUtils]: 11: Hoare triple {1450#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1451#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:01,625 INFO L273 TraceCheckUtils]: 12: Hoare triple {1451#(<= main_~i~1 3)} assume !(~i~1 < 10000); {1447#false} is VALID [2018-11-23 12:26:01,626 INFO L256 TraceCheckUtils]: 13: Hoare triple {1447#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:26:01,626 INFO L273 TraceCheckUtils]: 14: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1446#true} is VALID [2018-11-23 12:26:01,626 INFO L273 TraceCheckUtils]: 15: Hoare triple {1446#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1446#true} is VALID [2018-11-23 12:26:01,626 INFO L273 TraceCheckUtils]: 16: Hoare triple {1446#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1446#true} is VALID [2018-11-23 12:26:01,627 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#true} assume !(~i~0 < 10000); {1446#true} is VALID [2018-11-23 12:26:01,627 INFO L273 TraceCheckUtils]: 18: Hoare triple {1446#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:26:01,627 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:26:01,627 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1446#true} {1447#false} #70#return; {1447#false} is VALID [2018-11-23 12:26:01,628 INFO L273 TraceCheckUtils]: 21: Hoare triple {1447#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1447#false} is VALID [2018-11-23 12:26:01,628 INFO L256 TraceCheckUtils]: 22: Hoare triple {1447#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:26:01,628 INFO L273 TraceCheckUtils]: 23: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1446#true} is VALID [2018-11-23 12:26:01,628 INFO L273 TraceCheckUtils]: 24: Hoare triple {1446#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1446#true} is VALID [2018-11-23 12:26:01,629 INFO L273 TraceCheckUtils]: 25: Hoare triple {1446#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1446#true} is VALID [2018-11-23 12:26:01,629 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#true} assume !(~i~0 < 10000); {1446#true} is VALID [2018-11-23 12:26:01,629 INFO L273 TraceCheckUtils]: 27: Hoare triple {1446#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:26:01,629 INFO L273 TraceCheckUtils]: 28: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:26:01,630 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1446#true} {1447#false} #72#return; {1447#false} is VALID [2018-11-23 12:26:01,630 INFO L273 TraceCheckUtils]: 30: Hoare triple {1447#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1447#false} is VALID [2018-11-23 12:26:01,630 INFO L273 TraceCheckUtils]: 31: Hoare triple {1447#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {1447#false} is VALID [2018-11-23 12:26:01,630 INFO L273 TraceCheckUtils]: 32: Hoare triple {1447#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {1447#false} is VALID [2018-11-23 12:26:01,631 INFO L273 TraceCheckUtils]: 33: Hoare triple {1447#false} assume !(~i~2 < 9999); {1447#false} is VALID [2018-11-23 12:26:01,631 INFO L273 TraceCheckUtils]: 34: Hoare triple {1447#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {1447#false} is VALID [2018-11-23 12:26:01,631 INFO L256 TraceCheckUtils]: 35: Hoare triple {1447#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:26:01,631 INFO L273 TraceCheckUtils]: 36: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1446#true} is VALID [2018-11-23 12:26:01,632 INFO L273 TraceCheckUtils]: 37: Hoare triple {1446#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1446#true} is VALID [2018-11-23 12:26:01,632 INFO L273 TraceCheckUtils]: 38: Hoare triple {1446#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1446#true} is VALID [2018-11-23 12:26:01,632 INFO L273 TraceCheckUtils]: 39: Hoare triple {1446#true} assume !(~i~0 < 10000); {1446#true} is VALID [2018-11-23 12:26:01,632 INFO L273 TraceCheckUtils]: 40: Hoare triple {1446#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:26:01,633 INFO L273 TraceCheckUtils]: 41: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:26:01,633 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1446#true} {1447#false} #74#return; {1447#false} is VALID [2018-11-23 12:26:01,633 INFO L273 TraceCheckUtils]: 43: Hoare triple {1447#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1447#false} is VALID [2018-11-23 12:26:01,633 INFO L273 TraceCheckUtils]: 44: Hoare triple {1447#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1447#false} is VALID [2018-11-23 12:26:01,634 INFO L273 TraceCheckUtils]: 45: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2018-11-23 12:26:01,636 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:26:01,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:01,637 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:01,648 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:26:01,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:26:01,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:01,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:01,907 INFO L256 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2018-11-23 12:26:01,907 INFO L273 TraceCheckUtils]: 1: Hoare triple {1446#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1446#true} is VALID [2018-11-23 12:26:01,907 INFO L273 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:26:01,908 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2018-11-23 12:26:01,908 INFO L256 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret13 := main(); {1446#true} is VALID [2018-11-23 12:26:01,908 INFO L273 TraceCheckUtils]: 5: Hoare triple {1446#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; {1446#true} is VALID [2018-11-23 12:26:01,908 INFO L273 TraceCheckUtils]: 6: Hoare triple {1446#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1446#true} is VALID [2018-11-23 12:26:01,908 INFO L273 TraceCheckUtils]: 7: Hoare triple {1446#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1446#true} is VALID [2018-11-23 12:26:01,909 INFO L273 TraceCheckUtils]: 8: Hoare triple {1446#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1446#true} is VALID [2018-11-23 12:26:01,909 INFO L273 TraceCheckUtils]: 9: Hoare triple {1446#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1446#true} is VALID [2018-11-23 12:26:01,909 INFO L273 TraceCheckUtils]: 10: Hoare triple {1446#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1446#true} is VALID [2018-11-23 12:26:01,910 INFO L273 TraceCheckUtils]: 11: Hoare triple {1446#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1446#true} is VALID [2018-11-23 12:26:01,910 INFO L273 TraceCheckUtils]: 12: Hoare triple {1446#true} assume !(~i~1 < 10000); {1446#true} is VALID [2018-11-23 12:26:01,910 INFO L256 TraceCheckUtils]: 13: Hoare triple {1446#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:26:01,910 INFO L273 TraceCheckUtils]: 14: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1446#true} is VALID [2018-11-23 12:26:01,911 INFO L273 TraceCheckUtils]: 15: Hoare triple {1446#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1446#true} is VALID [2018-11-23 12:26:01,911 INFO L273 TraceCheckUtils]: 16: Hoare triple {1446#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1446#true} is VALID [2018-11-23 12:26:01,911 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#true} assume !(~i~0 < 10000); {1446#true} is VALID [2018-11-23 12:26:01,911 INFO L273 TraceCheckUtils]: 18: Hoare triple {1446#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:26:01,911 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:26:01,911 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1446#true} {1446#true} #70#return; {1446#true} is VALID [2018-11-23 12:26:01,912 INFO L273 TraceCheckUtils]: 21: Hoare triple {1446#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1446#true} is VALID [2018-11-23 12:26:01,912 INFO L256 TraceCheckUtils]: 22: Hoare triple {1446#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:26:01,912 INFO L273 TraceCheckUtils]: 23: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1446#true} is VALID [2018-11-23 12:26:01,912 INFO L273 TraceCheckUtils]: 24: Hoare triple {1446#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1446#true} is VALID [2018-11-23 12:26:01,912 INFO L273 TraceCheckUtils]: 25: Hoare triple {1446#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1446#true} is VALID [2018-11-23 12:26:01,912 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#true} assume !(~i~0 < 10000); {1446#true} is VALID [2018-11-23 12:26:01,913 INFO L273 TraceCheckUtils]: 27: Hoare triple {1446#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:26:01,913 INFO L273 TraceCheckUtils]: 28: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:26:01,913 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1446#true} {1446#true} #72#return; {1446#true} is VALID [2018-11-23 12:26:01,913 INFO L273 TraceCheckUtils]: 30: Hoare triple {1446#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1446#true} is VALID [2018-11-23 12:26:01,913 INFO L273 TraceCheckUtils]: 31: Hoare triple {1446#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {1446#true} is VALID [2018-11-23 12:26:01,914 INFO L273 TraceCheckUtils]: 32: Hoare triple {1446#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {1446#true} is VALID [2018-11-23 12:26:01,914 INFO L273 TraceCheckUtils]: 33: Hoare triple {1446#true} assume !(~i~2 < 9999); {1446#true} is VALID [2018-11-23 12:26:01,914 INFO L273 TraceCheckUtils]: 34: Hoare triple {1446#true} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {1446#true} is VALID [2018-11-23 12:26:01,914 INFO L256 TraceCheckUtils]: 35: Hoare triple {1446#true} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:26:01,915 INFO L273 TraceCheckUtils]: 36: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1563#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:01,915 INFO L273 TraceCheckUtils]: 37: Hoare triple {1563#(<= bor_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1563#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:01,916 INFO L273 TraceCheckUtils]: 38: Hoare triple {1563#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1570#(<= bor_~i~0 2)} is VALID [2018-11-23 12:26:01,916 INFO L273 TraceCheckUtils]: 39: Hoare triple {1570#(<= bor_~i~0 2)} assume !(~i~0 < 10000); {1447#false} is VALID [2018-11-23 12:26:01,917 INFO L273 TraceCheckUtils]: 40: Hoare triple {1447#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1447#false} is VALID [2018-11-23 12:26:01,917 INFO L273 TraceCheckUtils]: 41: Hoare triple {1447#false} assume true; {1447#false} is VALID [2018-11-23 12:26:01,917 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1447#false} {1446#true} #74#return; {1447#false} is VALID [2018-11-23 12:26:01,918 INFO L273 TraceCheckUtils]: 43: Hoare triple {1447#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1447#false} is VALID [2018-11-23 12:26:01,918 INFO L273 TraceCheckUtils]: 44: Hoare triple {1447#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1447#false} is VALID [2018-11-23 12:26:01,918 INFO L273 TraceCheckUtils]: 45: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2018-11-23 12:26:01,921 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 12:26:01,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:01,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-23 12:26:01,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 12:26:01,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:01,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:26:02,081 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:02,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:26:02,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:26:02,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:26:02,082 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2018-11-23 12:26:02,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:02,486 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2018-11-23 12:26:02,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:26:02,486 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 12:26:02,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:02,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:26:02,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2018-11-23 12:26:02,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:26:02,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2018-11-23 12:26:02,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 68 transitions. [2018-11-23 12:26:02,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:02,675 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:26:02,675 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:26:02,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:26:02,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:26:02,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 12:26:02,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:02,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-23 12:26:02,698 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-23 12:26:02,698 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-23 12:26:02,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:02,701 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:26:02,701 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:26:02,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:02,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:02,702 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-23 12:26:02,702 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-23 12:26:02,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:02,704 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:26:02,704 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:26:02,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:02,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:02,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:02,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:02,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:26:02,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 12:26:02,707 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 46 [2018-11-23 12:26:02,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:02,708 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 12:26:02,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:26:02,708 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 12:26:02,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 12:26:02,709 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:02,709 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 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, 1, 1] [2018-11-23 12:26:02,710 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:02,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:02,710 INFO L82 PathProgramCache]: Analyzing trace with hash -174499699, now seen corresponding path program 4 times [2018-11-23 12:26:02,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:02,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:02,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:02,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:02,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:02,892 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 12:26:02,892 INFO L273 TraceCheckUtils]: 1: Hoare triple {1809#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1809#true} is VALID [2018-11-23 12:26:02,893 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:26:02,893 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 12:26:02,894 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret13 := main(); {1809#true} is VALID [2018-11-23 12:26:02,912 INFO L273 TraceCheckUtils]: 5: Hoare triple {1809#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; {1811#(= main_~i~1 0)} is VALID [2018-11-23 12:26:02,926 INFO L273 TraceCheckUtils]: 6: Hoare triple {1811#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {1811#(= main_~i~1 0)} is VALID [2018-11-23 12:26:02,940 INFO L273 TraceCheckUtils]: 7: Hoare triple {1811#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1812#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:02,949 INFO L273 TraceCheckUtils]: 8: Hoare triple {1812#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {1812#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:02,963 INFO L273 TraceCheckUtils]: 9: Hoare triple {1812#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1813#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:02,964 INFO L273 TraceCheckUtils]: 10: Hoare triple {1813#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {1813#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:02,965 INFO L273 TraceCheckUtils]: 11: Hoare triple {1813#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1814#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:02,969 INFO L273 TraceCheckUtils]: 12: Hoare triple {1814#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {1814#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:02,969 INFO L273 TraceCheckUtils]: 13: Hoare triple {1814#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1815#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:02,970 INFO L273 TraceCheckUtils]: 14: Hoare triple {1815#(<= main_~i~1 4)} assume !(~i~1 < 10000); {1810#false} is VALID [2018-11-23 12:26:02,970 INFO L256 TraceCheckUtils]: 15: Hoare triple {1810#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:26:02,970 INFO L273 TraceCheckUtils]: 16: Hoare triple {1809#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1809#true} is VALID [2018-11-23 12:26:02,971 INFO L273 TraceCheckUtils]: 17: Hoare triple {1809#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:26:02,971 INFO L273 TraceCheckUtils]: 18: Hoare triple {1809#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1809#true} is VALID [2018-11-23 12:26:02,971 INFO L273 TraceCheckUtils]: 19: Hoare triple {1809#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:26:02,971 INFO L273 TraceCheckUtils]: 20: Hoare triple {1809#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1809#true} is VALID [2018-11-23 12:26:02,971 INFO L273 TraceCheckUtils]: 21: Hoare triple {1809#true} assume !(~i~0 < 10000); {1809#true} is VALID [2018-11-23 12:26:02,971 INFO L273 TraceCheckUtils]: 22: Hoare triple {1809#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:26:02,972 INFO L273 TraceCheckUtils]: 23: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:26:02,972 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1809#true} {1810#false} #70#return; {1810#false} is VALID [2018-11-23 12:26:02,972 INFO L273 TraceCheckUtils]: 25: Hoare triple {1810#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:26:02,972 INFO L256 TraceCheckUtils]: 26: Hoare triple {1810#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:26:02,972 INFO L273 TraceCheckUtils]: 27: Hoare triple {1809#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1809#true} is VALID [2018-11-23 12:26:02,972 INFO L273 TraceCheckUtils]: 28: Hoare triple {1809#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:26:02,973 INFO L273 TraceCheckUtils]: 29: Hoare triple {1809#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1809#true} is VALID [2018-11-23 12:26:02,973 INFO L273 TraceCheckUtils]: 30: Hoare triple {1809#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:26:02,973 INFO L273 TraceCheckUtils]: 31: Hoare triple {1809#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1809#true} is VALID [2018-11-23 12:26:02,973 INFO L273 TraceCheckUtils]: 32: Hoare triple {1809#true} assume !(~i~0 < 10000); {1809#true} is VALID [2018-11-23 12:26:02,973 INFO L273 TraceCheckUtils]: 33: Hoare triple {1809#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:26:02,973 INFO L273 TraceCheckUtils]: 34: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:26:02,974 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1809#true} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 12:26:02,974 INFO L273 TraceCheckUtils]: 36: Hoare triple {1810#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1810#false} is VALID [2018-11-23 12:26:02,974 INFO L273 TraceCheckUtils]: 37: Hoare triple {1810#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {1810#false} is VALID [2018-11-23 12:26:02,974 INFO L273 TraceCheckUtils]: 38: Hoare triple {1810#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {1810#false} is VALID [2018-11-23 12:26:02,974 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} assume !(~i~2 < 9999); {1810#false} is VALID [2018-11-23 12:26:02,974 INFO L273 TraceCheckUtils]: 40: Hoare triple {1810#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:26:02,975 INFO L256 TraceCheckUtils]: 41: Hoare triple {1810#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:26:02,975 INFO L273 TraceCheckUtils]: 42: Hoare triple {1809#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1809#true} is VALID [2018-11-23 12:26:02,975 INFO L273 TraceCheckUtils]: 43: Hoare triple {1809#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:26:02,975 INFO L273 TraceCheckUtils]: 44: Hoare triple {1809#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1809#true} is VALID [2018-11-23 12:26:02,975 INFO L273 TraceCheckUtils]: 45: Hoare triple {1809#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:26:02,975 INFO L273 TraceCheckUtils]: 46: Hoare triple {1809#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1809#true} is VALID [2018-11-23 12:26:02,976 INFO L273 TraceCheckUtils]: 47: Hoare triple {1809#true} assume !(~i~0 < 10000); {1809#true} is VALID [2018-11-23 12:26:02,976 INFO L273 TraceCheckUtils]: 48: Hoare triple {1809#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:26:02,976 INFO L273 TraceCheckUtils]: 49: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:26:02,976 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1809#true} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 12:26:02,976 INFO L273 TraceCheckUtils]: 51: Hoare triple {1810#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1810#false} is VALID [2018-11-23 12:26:02,977 INFO L273 TraceCheckUtils]: 52: Hoare triple {1810#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1810#false} is VALID [2018-11-23 12:26:02,977 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 12:26:02,980 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 12:26:02,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:02,980 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:02,989 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:26:03,058 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:26:03,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:03,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:03,675 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 12:26:03,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {1809#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1809#true} is VALID [2018-11-23 12:26:03,676 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:26:03,676 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 12:26:03,676 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret13 := main(); {1809#true} is VALID [2018-11-23 12:26:03,677 INFO L273 TraceCheckUtils]: 5: Hoare triple {1809#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; {1834#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:03,678 INFO L273 TraceCheckUtils]: 6: Hoare triple {1834#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {1834#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:03,679 INFO L273 TraceCheckUtils]: 7: Hoare triple {1834#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1812#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:03,679 INFO L273 TraceCheckUtils]: 8: Hoare triple {1812#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {1812#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:03,680 INFO L273 TraceCheckUtils]: 9: Hoare triple {1812#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1813#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:03,681 INFO L273 TraceCheckUtils]: 10: Hoare triple {1813#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {1813#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:03,682 INFO L273 TraceCheckUtils]: 11: Hoare triple {1813#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1814#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:03,683 INFO L273 TraceCheckUtils]: 12: Hoare triple {1814#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {1814#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:03,688 INFO L273 TraceCheckUtils]: 13: Hoare triple {1814#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1815#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:03,689 INFO L273 TraceCheckUtils]: 14: Hoare triple {1815#(<= main_~i~1 4)} assume !(~i~1 < 10000); {1810#false} is VALID [2018-11-23 12:26:03,689 INFO L256 TraceCheckUtils]: 15: Hoare triple {1810#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {1810#false} is VALID [2018-11-23 12:26:03,689 INFO L273 TraceCheckUtils]: 16: Hoare triple {1810#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1810#false} is VALID [2018-11-23 12:26:03,690 INFO L273 TraceCheckUtils]: 17: Hoare triple {1810#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:26:03,690 INFO L273 TraceCheckUtils]: 18: Hoare triple {1810#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1810#false} is VALID [2018-11-23 12:26:03,690 INFO L273 TraceCheckUtils]: 19: Hoare triple {1810#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:26:03,690 INFO L273 TraceCheckUtils]: 20: Hoare triple {1810#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1810#false} is VALID [2018-11-23 12:26:03,690 INFO L273 TraceCheckUtils]: 21: Hoare triple {1810#false} assume !(~i~0 < 10000); {1810#false} is VALID [2018-11-23 12:26:03,691 INFO L273 TraceCheckUtils]: 22: Hoare triple {1810#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:26:03,691 INFO L273 TraceCheckUtils]: 23: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:26:03,691 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1810#false} {1810#false} #70#return; {1810#false} is VALID [2018-11-23 12:26:03,691 INFO L273 TraceCheckUtils]: 25: Hoare triple {1810#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:26:03,692 INFO L256 TraceCheckUtils]: 26: Hoare triple {1810#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {1810#false} is VALID [2018-11-23 12:26:03,692 INFO L273 TraceCheckUtils]: 27: Hoare triple {1810#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1810#false} is VALID [2018-11-23 12:26:03,692 INFO L273 TraceCheckUtils]: 28: Hoare triple {1810#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:26:03,692 INFO L273 TraceCheckUtils]: 29: Hoare triple {1810#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1810#false} is VALID [2018-11-23 12:26:03,693 INFO L273 TraceCheckUtils]: 30: Hoare triple {1810#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:26:03,693 INFO L273 TraceCheckUtils]: 31: Hoare triple {1810#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1810#false} is VALID [2018-11-23 12:26:03,693 INFO L273 TraceCheckUtils]: 32: Hoare triple {1810#false} assume !(~i~0 < 10000); {1810#false} is VALID [2018-11-23 12:26:03,693 INFO L273 TraceCheckUtils]: 33: Hoare triple {1810#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:26:03,694 INFO L273 TraceCheckUtils]: 34: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:26:03,694 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1810#false} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 12:26:03,694 INFO L273 TraceCheckUtils]: 36: Hoare triple {1810#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1810#false} is VALID [2018-11-23 12:26:03,694 INFO L273 TraceCheckUtils]: 37: Hoare triple {1810#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {1810#false} is VALID [2018-11-23 12:26:03,695 INFO L273 TraceCheckUtils]: 38: Hoare triple {1810#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {1810#false} is VALID [2018-11-23 12:26:03,695 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} assume !(~i~2 < 9999); {1810#false} is VALID [2018-11-23 12:26:03,695 INFO L273 TraceCheckUtils]: 40: Hoare triple {1810#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:26:03,695 INFO L256 TraceCheckUtils]: 41: Hoare triple {1810#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {1810#false} is VALID [2018-11-23 12:26:03,695 INFO L273 TraceCheckUtils]: 42: Hoare triple {1810#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1810#false} is VALID [2018-11-23 12:26:03,696 INFO L273 TraceCheckUtils]: 43: Hoare triple {1810#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:26:03,696 INFO L273 TraceCheckUtils]: 44: Hoare triple {1810#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1810#false} is VALID [2018-11-23 12:26:03,696 INFO L273 TraceCheckUtils]: 45: Hoare triple {1810#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:26:03,696 INFO L273 TraceCheckUtils]: 46: Hoare triple {1810#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1810#false} is VALID [2018-11-23 12:26:03,696 INFO L273 TraceCheckUtils]: 47: Hoare triple {1810#false} assume !(~i~0 < 10000); {1810#false} is VALID [2018-11-23 12:26:03,697 INFO L273 TraceCheckUtils]: 48: Hoare triple {1810#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:26:03,697 INFO L273 TraceCheckUtils]: 49: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:26:03,697 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1810#false} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 12:26:03,697 INFO L273 TraceCheckUtils]: 51: Hoare triple {1810#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1810#false} is VALID [2018-11-23 12:26:03,697 INFO L273 TraceCheckUtils]: 52: Hoare triple {1810#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1810#false} is VALID [2018-11-23 12:26:03,697 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 12:26:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 12:26:03,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:03,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:26:03,721 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-23 12:26:03,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:03,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:26:03,793 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-23 12:26:03,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:26:03,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:26:03,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:26:03,794 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2018-11-23 12:26:04,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:04,125 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-23 12:26:04,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:26:04,125 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-23 12:26:04,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:04,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:26:04,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-23 12:26:04,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:26:04,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-23 12:26:04,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2018-11-23 12:26:04,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:04,252 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:26:04,253 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:26:04,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 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-23 12:26:04,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:26:04,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 12:26:04,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:04,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-23 12:26:04,276 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-23 12:26:04,276 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-23 12:26:04,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:04,280 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:26:04,280 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:26:04,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:04,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:04,281 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-23 12:26:04,281 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-23 12:26:04,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:04,283 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:26:04,283 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:26:04,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:04,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:04,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:04,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:04,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:26:04,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-23 12:26:04,285 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2018-11-23 12:26:04,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:04,286 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-23 12:26:04,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:26:04,286 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:26:04,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 12:26:04,286 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:04,287 INFO L402 BasicCegarLoop]: trace histogram [6, 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, 1, 1] [2018-11-23 12:26:04,287 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:04,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:04,287 INFO L82 PathProgramCache]: Analyzing trace with hash 830152559, now seen corresponding path program 5 times [2018-11-23 12:26:04,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:04,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:04,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:04,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:04,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:04,506 INFO L256 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2018-11-23 12:26:04,506 INFO L273 TraceCheckUtils]: 1: Hoare triple {2206#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2206#true} is VALID [2018-11-23 12:26:04,506 INFO L273 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:26:04,506 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #66#return; {2206#true} is VALID [2018-11-23 12:26:04,507 INFO L256 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret13 := main(); {2206#true} is VALID [2018-11-23 12:26:04,511 INFO L273 TraceCheckUtils]: 5: Hoare triple {2206#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; {2208#(= main_~i~1 0)} is VALID [2018-11-23 12:26:04,511 INFO L273 TraceCheckUtils]: 6: Hoare triple {2208#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {2208#(= main_~i~1 0)} is VALID [2018-11-23 12:26:04,512 INFO L273 TraceCheckUtils]: 7: Hoare triple {2208#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2209#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:04,512 INFO L273 TraceCheckUtils]: 8: Hoare triple {2209#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {2209#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:04,513 INFO L273 TraceCheckUtils]: 9: Hoare triple {2209#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2210#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:04,513 INFO L273 TraceCheckUtils]: 10: Hoare triple {2210#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {2210#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:04,514 INFO L273 TraceCheckUtils]: 11: Hoare triple {2210#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2211#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:04,514 INFO L273 TraceCheckUtils]: 12: Hoare triple {2211#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {2211#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:04,515 INFO L273 TraceCheckUtils]: 13: Hoare triple {2211#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2212#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:04,515 INFO L273 TraceCheckUtils]: 14: Hoare triple {2212#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {2212#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:04,516 INFO L273 TraceCheckUtils]: 15: Hoare triple {2212#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2213#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:04,517 INFO L273 TraceCheckUtils]: 16: Hoare triple {2213#(<= main_~i~1 5)} assume !(~i~1 < 10000); {2207#false} is VALID [2018-11-23 12:26:04,517 INFO L256 TraceCheckUtils]: 17: Hoare triple {2207#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {2206#true} is VALID [2018-11-23 12:26:04,517 INFO L273 TraceCheckUtils]: 18: Hoare triple {2206#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2206#true} is VALID [2018-11-23 12:26:04,517 INFO L273 TraceCheckUtils]: 19: Hoare triple {2206#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:26:04,518 INFO L273 TraceCheckUtils]: 20: Hoare triple {2206#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2206#true} is VALID [2018-11-23 12:26:04,518 INFO L273 TraceCheckUtils]: 21: Hoare triple {2206#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:26:04,518 INFO L273 TraceCheckUtils]: 22: Hoare triple {2206#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2206#true} is VALID [2018-11-23 12:26:04,518 INFO L273 TraceCheckUtils]: 23: Hoare triple {2206#true} assume !(~i~0 < 10000); {2206#true} is VALID [2018-11-23 12:26:04,518 INFO L273 TraceCheckUtils]: 24: Hoare triple {2206#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2206#true} is VALID [2018-11-23 12:26:04,519 INFO L273 TraceCheckUtils]: 25: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:26:04,519 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2206#true} {2207#false} #70#return; {2207#false} is VALID [2018-11-23 12:26:04,519 INFO L273 TraceCheckUtils]: 27: Hoare triple {2207#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:26:04,519 INFO L256 TraceCheckUtils]: 28: Hoare triple {2207#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {2206#true} is VALID [2018-11-23 12:26:04,519 INFO L273 TraceCheckUtils]: 29: Hoare triple {2206#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2206#true} is VALID [2018-11-23 12:26:04,520 INFO L273 TraceCheckUtils]: 30: Hoare triple {2206#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:26:04,520 INFO L273 TraceCheckUtils]: 31: Hoare triple {2206#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2206#true} is VALID [2018-11-23 12:26:04,520 INFO L273 TraceCheckUtils]: 32: Hoare triple {2206#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:26:04,520 INFO L273 TraceCheckUtils]: 33: Hoare triple {2206#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2206#true} is VALID [2018-11-23 12:26:04,520 INFO L273 TraceCheckUtils]: 34: Hoare triple {2206#true} assume !(~i~0 < 10000); {2206#true} is VALID [2018-11-23 12:26:04,520 INFO L273 TraceCheckUtils]: 35: Hoare triple {2206#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2206#true} is VALID [2018-11-23 12:26:04,520 INFO L273 TraceCheckUtils]: 36: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:26:04,521 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2206#true} {2207#false} #72#return; {2207#false} is VALID [2018-11-23 12:26:04,521 INFO L273 TraceCheckUtils]: 38: Hoare triple {2207#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2207#false} is VALID [2018-11-23 12:26:04,521 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {2207#false} is VALID [2018-11-23 12:26:04,521 INFO L273 TraceCheckUtils]: 40: Hoare triple {2207#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {2207#false} is VALID [2018-11-23 12:26:04,521 INFO L273 TraceCheckUtils]: 41: Hoare triple {2207#false} assume !(~i~2 < 9999); {2207#false} is VALID [2018-11-23 12:26:04,521 INFO L273 TraceCheckUtils]: 42: Hoare triple {2207#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:26:04,521 INFO L256 TraceCheckUtils]: 43: Hoare triple {2207#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {2206#true} is VALID [2018-11-23 12:26:04,521 INFO L273 TraceCheckUtils]: 44: Hoare triple {2206#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2206#true} is VALID [2018-11-23 12:26:04,522 INFO L273 TraceCheckUtils]: 45: Hoare triple {2206#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:26:04,522 INFO L273 TraceCheckUtils]: 46: Hoare triple {2206#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2206#true} is VALID [2018-11-23 12:26:04,522 INFO L273 TraceCheckUtils]: 47: Hoare triple {2206#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:26:04,522 INFO L273 TraceCheckUtils]: 48: Hoare triple {2206#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2206#true} is VALID [2018-11-23 12:26:04,522 INFO L273 TraceCheckUtils]: 49: Hoare triple {2206#true} assume !(~i~0 < 10000); {2206#true} is VALID [2018-11-23 12:26:04,522 INFO L273 TraceCheckUtils]: 50: Hoare triple {2206#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2206#true} is VALID [2018-11-23 12:26:04,522 INFO L273 TraceCheckUtils]: 51: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:26:04,523 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2206#true} {2207#false} #74#return; {2207#false} is VALID [2018-11-23 12:26:04,523 INFO L273 TraceCheckUtils]: 53: Hoare triple {2207#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2207#false} is VALID [2018-11-23 12:26:04,523 INFO L273 TraceCheckUtils]: 54: Hoare triple {2207#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2207#false} is VALID [2018-11-23 12:26:04,523 INFO L273 TraceCheckUtils]: 55: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2018-11-23 12:26:04,524 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 12:26:04,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:04,525 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:04,533 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:26:04,595 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:26:04,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:04,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:04,775 INFO L256 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2018-11-23 12:26:04,776 INFO L273 TraceCheckUtils]: 1: Hoare triple {2206#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2206#true} is VALID [2018-11-23 12:26:04,776 INFO L273 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:26:04,776 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #66#return; {2206#true} is VALID [2018-11-23 12:26:04,776 INFO L256 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret13 := main(); {2206#true} is VALID [2018-11-23 12:26:04,777 INFO L273 TraceCheckUtils]: 5: Hoare triple {2206#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; {2206#true} is VALID [2018-11-23 12:26:04,777 INFO L273 TraceCheckUtils]: 6: Hoare triple {2206#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2206#true} is VALID [2018-11-23 12:26:04,777 INFO L273 TraceCheckUtils]: 7: Hoare triple {2206#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2206#true} is VALID [2018-11-23 12:26:04,777 INFO L273 TraceCheckUtils]: 8: Hoare triple {2206#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2206#true} is VALID [2018-11-23 12:26:04,777 INFO L273 TraceCheckUtils]: 9: Hoare triple {2206#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2206#true} is VALID [2018-11-23 12:26:04,778 INFO L273 TraceCheckUtils]: 10: Hoare triple {2206#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2206#true} is VALID [2018-11-23 12:26:04,778 INFO L273 TraceCheckUtils]: 11: Hoare triple {2206#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2206#true} is VALID [2018-11-23 12:26:04,778 INFO L273 TraceCheckUtils]: 12: Hoare triple {2206#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2206#true} is VALID [2018-11-23 12:26:04,778 INFO L273 TraceCheckUtils]: 13: Hoare triple {2206#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2206#true} is VALID [2018-11-23 12:26:04,779 INFO L273 TraceCheckUtils]: 14: Hoare triple {2206#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2206#true} is VALID [2018-11-23 12:26:04,779 INFO L273 TraceCheckUtils]: 15: Hoare triple {2206#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2206#true} is VALID [2018-11-23 12:26:04,779 INFO L273 TraceCheckUtils]: 16: Hoare triple {2206#true} assume !(~i~1 < 10000); {2206#true} is VALID [2018-11-23 12:26:04,779 INFO L256 TraceCheckUtils]: 17: Hoare triple {2206#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {2206#true} is VALID [2018-11-23 12:26:04,780 INFO L273 TraceCheckUtils]: 18: Hoare triple {2206#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2271#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:04,781 INFO L273 TraceCheckUtils]: 19: Hoare triple {2271#(<= bor_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2271#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:04,781 INFO L273 TraceCheckUtils]: 20: Hoare triple {2271#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2278#(<= bor_~i~0 2)} is VALID [2018-11-23 12:26:04,782 INFO L273 TraceCheckUtils]: 21: Hoare triple {2278#(<= bor_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2278#(<= bor_~i~0 2)} is VALID [2018-11-23 12:26:04,783 INFO L273 TraceCheckUtils]: 22: Hoare triple {2278#(<= bor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2285#(<= bor_~i~0 3)} is VALID [2018-11-23 12:26:04,783 INFO L273 TraceCheckUtils]: 23: Hoare triple {2285#(<= bor_~i~0 3)} assume !(~i~0 < 10000); {2207#false} is VALID [2018-11-23 12:26:04,784 INFO L273 TraceCheckUtils]: 24: Hoare triple {2207#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2207#false} is VALID [2018-11-23 12:26:04,784 INFO L273 TraceCheckUtils]: 25: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:26:04,784 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2207#false} {2206#true} #70#return; {2207#false} is VALID [2018-11-23 12:26:04,784 INFO L273 TraceCheckUtils]: 27: Hoare triple {2207#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:26:04,785 INFO L256 TraceCheckUtils]: 28: Hoare triple {2207#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {2207#false} is VALID [2018-11-23 12:26:04,785 INFO L273 TraceCheckUtils]: 29: Hoare triple {2207#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2207#false} is VALID [2018-11-23 12:26:04,785 INFO L273 TraceCheckUtils]: 30: Hoare triple {2207#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2207#false} is VALID [2018-11-23 12:26:04,785 INFO L273 TraceCheckUtils]: 31: Hoare triple {2207#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2207#false} is VALID [2018-11-23 12:26:04,785 INFO L273 TraceCheckUtils]: 32: Hoare triple {2207#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2207#false} is VALID [2018-11-23 12:26:04,786 INFO L273 TraceCheckUtils]: 33: Hoare triple {2207#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2207#false} is VALID [2018-11-23 12:26:04,786 INFO L273 TraceCheckUtils]: 34: Hoare triple {2207#false} assume !(~i~0 < 10000); {2207#false} is VALID [2018-11-23 12:26:04,786 INFO L273 TraceCheckUtils]: 35: Hoare triple {2207#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2207#false} is VALID [2018-11-23 12:26:04,786 INFO L273 TraceCheckUtils]: 36: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:26:04,786 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2207#false} {2207#false} #72#return; {2207#false} is VALID [2018-11-23 12:26:04,787 INFO L273 TraceCheckUtils]: 38: Hoare triple {2207#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2207#false} is VALID [2018-11-23 12:26:04,787 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {2207#false} is VALID [2018-11-23 12:26:04,787 INFO L273 TraceCheckUtils]: 40: Hoare triple {2207#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {2207#false} is VALID [2018-11-23 12:26:04,787 INFO L273 TraceCheckUtils]: 41: Hoare triple {2207#false} assume !(~i~2 < 9999); {2207#false} is VALID [2018-11-23 12:26:04,788 INFO L273 TraceCheckUtils]: 42: Hoare triple {2207#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:26:04,788 INFO L256 TraceCheckUtils]: 43: Hoare triple {2207#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {2207#false} is VALID [2018-11-23 12:26:04,788 INFO L273 TraceCheckUtils]: 44: Hoare triple {2207#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2207#false} is VALID [2018-11-23 12:26:04,788 INFO L273 TraceCheckUtils]: 45: Hoare triple {2207#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2207#false} is VALID [2018-11-23 12:26:04,789 INFO L273 TraceCheckUtils]: 46: Hoare triple {2207#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2207#false} is VALID [2018-11-23 12:26:04,789 INFO L273 TraceCheckUtils]: 47: Hoare triple {2207#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2207#false} is VALID [2018-11-23 12:26:04,789 INFO L273 TraceCheckUtils]: 48: Hoare triple {2207#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2207#false} is VALID [2018-11-23 12:26:04,789 INFO L273 TraceCheckUtils]: 49: Hoare triple {2207#false} assume !(~i~0 < 10000); {2207#false} is VALID [2018-11-23 12:26:04,789 INFO L273 TraceCheckUtils]: 50: Hoare triple {2207#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2207#false} is VALID [2018-11-23 12:26:04,790 INFO L273 TraceCheckUtils]: 51: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:26:04,790 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2207#false} {2207#false} #74#return; {2207#false} is VALID [2018-11-23 12:26:04,790 INFO L273 TraceCheckUtils]: 53: Hoare triple {2207#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2207#false} is VALID [2018-11-23 12:26:04,790 INFO L273 TraceCheckUtils]: 54: Hoare triple {2207#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2207#false} is VALID [2018-11-23 12:26:04,790 INFO L273 TraceCheckUtils]: 55: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2018-11-23 12:26:04,792 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 12:26:04,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:04,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-23 12:26:04,820 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 12:26:04,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:04,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:26:05,025 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-23 12:26:05,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:26:05,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:26:05,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:26:05,026 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2018-11-23 12:26:05,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:05,596 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-11-23 12:26:05,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:26:05,596 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 12:26:05,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:05,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:26:05,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 12:26:05,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:26:05,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 12:26:05,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 74 transitions. [2018-11-23 12:26:05,715 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:05,718 INFO L225 Difference]: With dead ends: 67 [2018-11-23 12:26:05,718 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:26:05,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:26:05,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:26:05,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-23 12:26:05,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:05,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 43 states. [2018-11-23 12:26:05,749 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 43 states. [2018-11-23 12:26:05,750 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 43 states. [2018-11-23 12:26:05,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:05,753 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 12:26:05,753 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:26:05,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:05,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:05,754 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 45 states. [2018-11-23 12:26:05,754 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 45 states. [2018-11-23 12:26:05,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:05,755 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 12:26:05,756 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:26:05,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:05,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:05,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:05,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:05,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:26:05,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-23 12:26:05,758 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 56 [2018-11-23 12:26:05,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:05,758 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-23 12:26:05,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:26:05,758 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-23 12:26:05,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 12:26:05,759 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:05,759 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 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, 1, 1] [2018-11-23 12:26:05,760 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:05,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:05,760 INFO L82 PathProgramCache]: Analyzing trace with hash 968039375, now seen corresponding path program 6 times [2018-11-23 12:26:05,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:05,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:05,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:05,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:05,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:06,050 INFO L256 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2635#true} is VALID [2018-11-23 12:26:06,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {2635#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2635#true} is VALID [2018-11-23 12:26:06,051 INFO L273 TraceCheckUtils]: 2: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:26:06,051 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2635#true} {2635#true} #66#return; {2635#true} is VALID [2018-11-23 12:26:06,051 INFO L256 TraceCheckUtils]: 4: Hoare triple {2635#true} call #t~ret13 := main(); {2635#true} is VALID [2018-11-23 12:26:06,057 INFO L273 TraceCheckUtils]: 5: Hoare triple {2635#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; {2637#(= main_~i~1 0)} is VALID [2018-11-23 12:26:06,057 INFO L273 TraceCheckUtils]: 6: Hoare triple {2637#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {2637#(= main_~i~1 0)} is VALID [2018-11-23 12:26:06,059 INFO L273 TraceCheckUtils]: 7: Hoare triple {2637#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2638#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:06,062 INFO L273 TraceCheckUtils]: 8: Hoare triple {2638#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {2638#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:06,062 INFO L273 TraceCheckUtils]: 9: Hoare triple {2638#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2639#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:06,064 INFO L273 TraceCheckUtils]: 10: Hoare triple {2639#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {2639#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:06,064 INFO L273 TraceCheckUtils]: 11: Hoare triple {2639#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2640#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:06,065 INFO L273 TraceCheckUtils]: 12: Hoare triple {2640#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {2640#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:06,067 INFO L273 TraceCheckUtils]: 13: Hoare triple {2640#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2641#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:06,068 INFO L273 TraceCheckUtils]: 14: Hoare triple {2641#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {2641#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:06,069 INFO L273 TraceCheckUtils]: 15: Hoare triple {2641#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2642#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:06,070 INFO L273 TraceCheckUtils]: 16: Hoare triple {2642#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {2642#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:06,071 INFO L273 TraceCheckUtils]: 17: Hoare triple {2642#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2643#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:06,073 INFO L273 TraceCheckUtils]: 18: Hoare triple {2643#(<= main_~i~1 6)} assume !(~i~1 < 10000); {2636#false} is VALID [2018-11-23 12:26:06,073 INFO L256 TraceCheckUtils]: 19: Hoare triple {2636#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:26:06,073 INFO L273 TraceCheckUtils]: 20: Hoare triple {2635#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2635#true} is VALID [2018-11-23 12:26:06,073 INFO L273 TraceCheckUtils]: 21: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,074 INFO L273 TraceCheckUtils]: 22: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,074 INFO L273 TraceCheckUtils]: 23: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,074 INFO L273 TraceCheckUtils]: 24: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,074 INFO L273 TraceCheckUtils]: 25: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,075 INFO L273 TraceCheckUtils]: 26: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,075 INFO L273 TraceCheckUtils]: 27: Hoare triple {2635#true} assume !(~i~0 < 10000); {2635#true} is VALID [2018-11-23 12:26:06,075 INFO L273 TraceCheckUtils]: 28: Hoare triple {2635#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:26:06,075 INFO L273 TraceCheckUtils]: 29: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:26:06,075 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2635#true} {2636#false} #70#return; {2636#false} is VALID [2018-11-23 12:26:06,076 INFO L273 TraceCheckUtils]: 31: Hoare triple {2636#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2636#false} is VALID [2018-11-23 12:26:06,076 INFO L256 TraceCheckUtils]: 32: Hoare triple {2636#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:26:06,076 INFO L273 TraceCheckUtils]: 33: Hoare triple {2635#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2635#true} is VALID [2018-11-23 12:26:06,076 INFO L273 TraceCheckUtils]: 34: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,076 INFO L273 TraceCheckUtils]: 35: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,077 INFO L273 TraceCheckUtils]: 36: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,077 INFO L273 TraceCheckUtils]: 37: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,077 INFO L273 TraceCheckUtils]: 38: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,077 INFO L273 TraceCheckUtils]: 39: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,077 INFO L273 TraceCheckUtils]: 40: Hoare triple {2635#true} assume !(~i~0 < 10000); {2635#true} is VALID [2018-11-23 12:26:06,077 INFO L273 TraceCheckUtils]: 41: Hoare triple {2635#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:26:06,077 INFO L273 TraceCheckUtils]: 42: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:26:06,077 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2635#true} {2636#false} #72#return; {2636#false} is VALID [2018-11-23 12:26:06,078 INFO L273 TraceCheckUtils]: 44: Hoare triple {2636#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2636#false} is VALID [2018-11-23 12:26:06,078 INFO L273 TraceCheckUtils]: 45: Hoare triple {2636#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {2636#false} is VALID [2018-11-23 12:26:06,078 INFO L273 TraceCheckUtils]: 46: Hoare triple {2636#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {2636#false} is VALID [2018-11-23 12:26:06,078 INFO L273 TraceCheckUtils]: 47: Hoare triple {2636#false} assume !(~i~2 < 9999); {2636#false} is VALID [2018-11-23 12:26:06,078 INFO L273 TraceCheckUtils]: 48: Hoare triple {2636#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {2636#false} is VALID [2018-11-23 12:26:06,078 INFO L256 TraceCheckUtils]: 49: Hoare triple {2636#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:26:06,078 INFO L273 TraceCheckUtils]: 50: Hoare triple {2635#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2635#true} is VALID [2018-11-23 12:26:06,078 INFO L273 TraceCheckUtils]: 51: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,079 INFO L273 TraceCheckUtils]: 52: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,079 INFO L273 TraceCheckUtils]: 53: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,079 INFO L273 TraceCheckUtils]: 54: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,079 INFO L273 TraceCheckUtils]: 55: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,079 INFO L273 TraceCheckUtils]: 56: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,079 INFO L273 TraceCheckUtils]: 57: Hoare triple {2635#true} assume !(~i~0 < 10000); {2635#true} is VALID [2018-11-23 12:26:06,079 INFO L273 TraceCheckUtils]: 58: Hoare triple {2635#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:26:06,079 INFO L273 TraceCheckUtils]: 59: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:26:06,080 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2635#true} {2636#false} #74#return; {2636#false} is VALID [2018-11-23 12:26:06,080 INFO L273 TraceCheckUtils]: 61: Hoare triple {2636#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2636#false} is VALID [2018-11-23 12:26:06,080 INFO L273 TraceCheckUtils]: 62: Hoare triple {2636#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2636#false} is VALID [2018-11-23 12:26:06,080 INFO L273 TraceCheckUtils]: 63: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2018-11-23 12:26:06,082 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-23 12:26:06,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:06,082 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:06,095 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:26:06,137 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 12:26:06,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:06,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:06,497 INFO L256 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2635#true} is VALID [2018-11-23 12:26:06,497 INFO L273 TraceCheckUtils]: 1: Hoare triple {2635#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2635#true} is VALID [2018-11-23 12:26:06,498 INFO L273 TraceCheckUtils]: 2: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:26:06,498 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2635#true} {2635#true} #66#return; {2635#true} is VALID [2018-11-23 12:26:06,498 INFO L256 TraceCheckUtils]: 4: Hoare triple {2635#true} call #t~ret13 := main(); {2635#true} is VALID [2018-11-23 12:26:06,498 INFO L273 TraceCheckUtils]: 5: Hoare triple {2635#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; {2635#true} is VALID [2018-11-23 12:26:06,499 INFO L273 TraceCheckUtils]: 6: Hoare triple {2635#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2635#true} is VALID [2018-11-23 12:26:06,499 INFO L273 TraceCheckUtils]: 7: Hoare triple {2635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2635#true} is VALID [2018-11-23 12:26:06,499 INFO L273 TraceCheckUtils]: 8: Hoare triple {2635#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2635#true} is VALID [2018-11-23 12:26:06,499 INFO L273 TraceCheckUtils]: 9: Hoare triple {2635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2635#true} is VALID [2018-11-23 12:26:06,499 INFO L273 TraceCheckUtils]: 10: Hoare triple {2635#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2635#true} is VALID [2018-11-23 12:26:06,500 INFO L273 TraceCheckUtils]: 11: Hoare triple {2635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2635#true} is VALID [2018-11-23 12:26:06,500 INFO L273 TraceCheckUtils]: 12: Hoare triple {2635#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2635#true} is VALID [2018-11-23 12:26:06,500 INFO L273 TraceCheckUtils]: 13: Hoare triple {2635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2635#true} is VALID [2018-11-23 12:26:06,500 INFO L273 TraceCheckUtils]: 14: Hoare triple {2635#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2635#true} is VALID [2018-11-23 12:26:06,501 INFO L273 TraceCheckUtils]: 15: Hoare triple {2635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2635#true} is VALID [2018-11-23 12:26:06,501 INFO L273 TraceCheckUtils]: 16: Hoare triple {2635#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2635#true} is VALID [2018-11-23 12:26:06,501 INFO L273 TraceCheckUtils]: 17: Hoare triple {2635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2635#true} is VALID [2018-11-23 12:26:06,501 INFO L273 TraceCheckUtils]: 18: Hoare triple {2635#true} assume !(~i~1 < 10000); {2635#true} is VALID [2018-11-23 12:26:06,501 INFO L256 TraceCheckUtils]: 19: Hoare triple {2635#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:26:06,502 INFO L273 TraceCheckUtils]: 20: Hoare triple {2635#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2635#true} is VALID [2018-11-23 12:26:06,502 INFO L273 TraceCheckUtils]: 21: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,502 INFO L273 TraceCheckUtils]: 22: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,502 INFO L273 TraceCheckUtils]: 23: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,502 INFO L273 TraceCheckUtils]: 24: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,502 INFO L273 TraceCheckUtils]: 25: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,503 INFO L273 TraceCheckUtils]: 26: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,503 INFO L273 TraceCheckUtils]: 27: Hoare triple {2635#true} assume !(~i~0 < 10000); {2635#true} is VALID [2018-11-23 12:26:06,503 INFO L273 TraceCheckUtils]: 28: Hoare triple {2635#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:26:06,503 INFO L273 TraceCheckUtils]: 29: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:26:06,503 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2635#true} {2635#true} #70#return; {2635#true} is VALID [2018-11-23 12:26:06,503 INFO L273 TraceCheckUtils]: 31: Hoare triple {2635#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2635#true} is VALID [2018-11-23 12:26:06,503 INFO L256 TraceCheckUtils]: 32: Hoare triple {2635#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:26:06,503 INFO L273 TraceCheckUtils]: 33: Hoare triple {2635#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2635#true} is VALID [2018-11-23 12:26:06,504 INFO L273 TraceCheckUtils]: 34: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,504 INFO L273 TraceCheckUtils]: 35: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,504 INFO L273 TraceCheckUtils]: 36: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,504 INFO L273 TraceCheckUtils]: 37: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,504 INFO L273 TraceCheckUtils]: 38: Hoare triple {2635#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,504 INFO L273 TraceCheckUtils]: 39: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,504 INFO L273 TraceCheckUtils]: 40: Hoare triple {2635#true} assume !(~i~0 < 10000); {2635#true} is VALID [2018-11-23 12:26:06,504 INFO L273 TraceCheckUtils]: 41: Hoare triple {2635#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:26:06,505 INFO L273 TraceCheckUtils]: 42: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:26:06,505 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2635#true} {2635#true} #72#return; {2635#true} is VALID [2018-11-23 12:26:06,505 INFO L273 TraceCheckUtils]: 44: Hoare triple {2635#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2779#(<= main_~i~2 0)} is VALID [2018-11-23 12:26:06,506 INFO L273 TraceCheckUtils]: 45: Hoare triple {2779#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {2779#(<= main_~i~2 0)} is VALID [2018-11-23 12:26:06,506 INFO L273 TraceCheckUtils]: 46: Hoare triple {2779#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {2786#(<= main_~i~2 1)} is VALID [2018-11-23 12:26:06,507 INFO L273 TraceCheckUtils]: 47: Hoare triple {2786#(<= main_~i~2 1)} assume !(~i~2 < 9999); {2636#false} is VALID [2018-11-23 12:26:06,507 INFO L273 TraceCheckUtils]: 48: Hoare triple {2636#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {2636#false} is VALID [2018-11-23 12:26:06,507 INFO L256 TraceCheckUtils]: 49: Hoare triple {2636#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {2636#false} is VALID [2018-11-23 12:26:06,507 INFO L273 TraceCheckUtils]: 50: Hoare triple {2636#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2636#false} is VALID [2018-11-23 12:26:06,507 INFO L273 TraceCheckUtils]: 51: Hoare triple {2636#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2636#false} is VALID [2018-11-23 12:26:06,507 INFO L273 TraceCheckUtils]: 52: Hoare triple {2636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2636#false} is VALID [2018-11-23 12:26:06,508 INFO L273 TraceCheckUtils]: 53: Hoare triple {2636#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2636#false} is VALID [2018-11-23 12:26:06,508 INFO L273 TraceCheckUtils]: 54: Hoare triple {2636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2636#false} is VALID [2018-11-23 12:26:06,508 INFO L273 TraceCheckUtils]: 55: Hoare triple {2636#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2636#false} is VALID [2018-11-23 12:26:06,508 INFO L273 TraceCheckUtils]: 56: Hoare triple {2636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2636#false} is VALID [2018-11-23 12:26:06,508 INFO L273 TraceCheckUtils]: 57: Hoare triple {2636#false} assume !(~i~0 < 10000); {2636#false} is VALID [2018-11-23 12:26:06,509 INFO L273 TraceCheckUtils]: 58: Hoare triple {2636#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2636#false} is VALID [2018-11-23 12:26:06,509 INFO L273 TraceCheckUtils]: 59: Hoare triple {2636#false} assume true; {2636#false} is VALID [2018-11-23 12:26:06,509 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2636#false} {2636#false} #74#return; {2636#false} is VALID [2018-11-23 12:26:06,509 INFO L273 TraceCheckUtils]: 61: Hoare triple {2636#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2636#false} is VALID [2018-11-23 12:26:06,509 INFO L273 TraceCheckUtils]: 62: Hoare triple {2636#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2636#false} is VALID [2018-11-23 12:26:06,509 INFO L273 TraceCheckUtils]: 63: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2018-11-23 12:26:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-23 12:26:06,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:06,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-11-23 12:26:06,539 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-11-23 12:26:06,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:06,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:26:06,693 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-23 12:26:06,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:26:06,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:26:06,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:26:06,694 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2018-11-23 12:26:07,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:07,029 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-23 12:26:07,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:26:07,030 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-11-23 12:26:07,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:07,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:26:07,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:26:07,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:26:07,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:26:07,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 71 transitions. [2018-11-23 12:26:07,153 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:07,156 INFO L225 Difference]: With dead ends: 73 [2018-11-23 12:26:07,157 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:26:07,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 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-23 12:26:07,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:26:07,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-23 12:26:07,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:07,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-23 12:26:07,208 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-23 12:26:07,208 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-23 12:26:07,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:07,211 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-23 12:26:07,213 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:26:07,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:07,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:07,213 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-23 12:26:07,214 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-23 12:26:07,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:07,215 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-23 12:26:07,215 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:26:07,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:07,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:07,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:07,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:07,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:26:07,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-23 12:26:07,217 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 64 [2018-11-23 12:26:07,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:07,218 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-23 12:26:07,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:26:07,218 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-23 12:26:07,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 12:26:07,219 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:07,219 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 7, 7, 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-23 12:26:07,219 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:07,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:07,220 INFO L82 PathProgramCache]: Analyzing trace with hash -117250513, now seen corresponding path program 7 times [2018-11-23 12:26:07,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:07,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:07,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:07,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:07,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:08,030 INFO L256 TraceCheckUtils]: 0: Hoare triple {3111#true} call ULTIMATE.init(); {3111#true} is VALID [2018-11-23 12:26:08,031 INFO L273 TraceCheckUtils]: 1: Hoare triple {3111#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3111#true} is VALID [2018-11-23 12:26:08,031 INFO L273 TraceCheckUtils]: 2: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:26:08,032 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3111#true} {3111#true} #66#return; {3111#true} is VALID [2018-11-23 12:26:08,032 INFO L256 TraceCheckUtils]: 4: Hoare triple {3111#true} call #t~ret13 := main(); {3111#true} is VALID [2018-11-23 12:26:08,032 INFO L273 TraceCheckUtils]: 5: Hoare triple {3111#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; {3113#(= main_~i~1 0)} is VALID [2018-11-23 12:26:08,033 INFO L273 TraceCheckUtils]: 6: Hoare triple {3113#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3113#(= main_~i~1 0)} is VALID [2018-11-23 12:26:08,034 INFO L273 TraceCheckUtils]: 7: Hoare triple {3113#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3114#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:08,034 INFO L273 TraceCheckUtils]: 8: Hoare triple {3114#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3114#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:08,035 INFO L273 TraceCheckUtils]: 9: Hoare triple {3114#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3115#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:08,035 INFO L273 TraceCheckUtils]: 10: Hoare triple {3115#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3115#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:08,036 INFO L273 TraceCheckUtils]: 11: Hoare triple {3115#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3116#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:08,037 INFO L273 TraceCheckUtils]: 12: Hoare triple {3116#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3116#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:08,037 INFO L273 TraceCheckUtils]: 13: Hoare triple {3116#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3117#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:08,038 INFO L273 TraceCheckUtils]: 14: Hoare triple {3117#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3117#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:08,039 INFO L273 TraceCheckUtils]: 15: Hoare triple {3117#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3118#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:08,040 INFO L273 TraceCheckUtils]: 16: Hoare triple {3118#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3118#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:08,041 INFO L273 TraceCheckUtils]: 17: Hoare triple {3118#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3119#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:08,041 INFO L273 TraceCheckUtils]: 18: Hoare triple {3119#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3119#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:08,042 INFO L273 TraceCheckUtils]: 19: Hoare triple {3119#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3120#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:08,043 INFO L273 TraceCheckUtils]: 20: Hoare triple {3120#(<= main_~i~1 7)} assume !(~i~1 < 10000); {3112#false} is VALID [2018-11-23 12:26:08,043 INFO L256 TraceCheckUtils]: 21: Hoare triple {3112#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {3111#true} is VALID [2018-11-23 12:26:08,043 INFO L273 TraceCheckUtils]: 22: Hoare triple {3111#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3111#true} is VALID [2018-11-23 12:26:08,043 INFO L273 TraceCheckUtils]: 23: Hoare triple {3111#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:26:08,044 INFO L273 TraceCheckUtils]: 24: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:26:08,044 INFO L273 TraceCheckUtils]: 25: Hoare triple {3111#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:26:08,044 INFO L273 TraceCheckUtils]: 26: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:26:08,044 INFO L273 TraceCheckUtils]: 27: Hoare triple {3111#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:26:08,044 INFO L273 TraceCheckUtils]: 28: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:26:08,045 INFO L273 TraceCheckUtils]: 29: Hoare triple {3111#true} assume !(~i~0 < 10000); {3111#true} is VALID [2018-11-23 12:26:08,045 INFO L273 TraceCheckUtils]: 30: Hoare triple {3111#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3111#true} is VALID [2018-11-23 12:26:08,045 INFO L273 TraceCheckUtils]: 31: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:26:08,045 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3111#true} {3112#false} #70#return; {3112#false} is VALID [2018-11-23 12:26:08,046 INFO L273 TraceCheckUtils]: 33: Hoare triple {3112#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:26:08,046 INFO L256 TraceCheckUtils]: 34: Hoare triple {3112#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {3111#true} is VALID [2018-11-23 12:26:08,046 INFO L273 TraceCheckUtils]: 35: Hoare triple {3111#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3111#true} is VALID [2018-11-23 12:26:08,046 INFO L273 TraceCheckUtils]: 36: Hoare triple {3111#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:26:08,047 INFO L273 TraceCheckUtils]: 37: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:26:08,047 INFO L273 TraceCheckUtils]: 38: Hoare triple {3111#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:26:08,047 INFO L273 TraceCheckUtils]: 39: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:26:08,047 INFO L273 TraceCheckUtils]: 40: Hoare triple {3111#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:26:08,047 INFO L273 TraceCheckUtils]: 41: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:26:08,047 INFO L273 TraceCheckUtils]: 42: Hoare triple {3111#true} assume !(~i~0 < 10000); {3111#true} is VALID [2018-11-23 12:26:08,047 INFO L273 TraceCheckUtils]: 43: Hoare triple {3111#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3111#true} is VALID [2018-11-23 12:26:08,048 INFO L273 TraceCheckUtils]: 44: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:26:08,048 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3111#true} {3112#false} #72#return; {3112#false} is VALID [2018-11-23 12:26:08,048 INFO L273 TraceCheckUtils]: 46: Hoare triple {3112#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3112#false} is VALID [2018-11-23 12:26:08,048 INFO L273 TraceCheckUtils]: 47: Hoare triple {3112#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3112#false} is VALID [2018-11-23 12:26:08,048 INFO L273 TraceCheckUtils]: 48: Hoare triple {3112#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3112#false} is VALID [2018-11-23 12:26:08,048 INFO L273 TraceCheckUtils]: 49: Hoare triple {3112#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3112#false} is VALID [2018-11-23 12:26:08,049 INFO L273 TraceCheckUtils]: 50: Hoare triple {3112#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3112#false} is VALID [2018-11-23 12:26:08,049 INFO L273 TraceCheckUtils]: 51: Hoare triple {3112#false} assume !(~i~2 < 9999); {3112#false} is VALID [2018-11-23 12:26:08,049 INFO L273 TraceCheckUtils]: 52: Hoare triple {3112#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:26:08,049 INFO L256 TraceCheckUtils]: 53: Hoare triple {3112#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {3111#true} is VALID [2018-11-23 12:26:08,049 INFO L273 TraceCheckUtils]: 54: Hoare triple {3111#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3111#true} is VALID [2018-11-23 12:26:08,049 INFO L273 TraceCheckUtils]: 55: Hoare triple {3111#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:26:08,050 INFO L273 TraceCheckUtils]: 56: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:26:08,050 INFO L273 TraceCheckUtils]: 57: Hoare triple {3111#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:26:08,050 INFO L273 TraceCheckUtils]: 58: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:26:08,050 INFO L273 TraceCheckUtils]: 59: Hoare triple {3111#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:26:08,050 INFO L273 TraceCheckUtils]: 60: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:26:08,050 INFO L273 TraceCheckUtils]: 61: Hoare triple {3111#true} assume !(~i~0 < 10000); {3111#true} is VALID [2018-11-23 12:26:08,051 INFO L273 TraceCheckUtils]: 62: Hoare triple {3111#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3111#true} is VALID [2018-11-23 12:26:08,051 INFO L273 TraceCheckUtils]: 63: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:26:08,051 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {3111#true} {3112#false} #74#return; {3112#false} is VALID [2018-11-23 12:26:08,051 INFO L273 TraceCheckUtils]: 65: Hoare triple {3112#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3112#false} is VALID [2018-11-23 12:26:08,051 INFO L273 TraceCheckUtils]: 66: Hoare triple {3112#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3112#false} is VALID [2018-11-23 12:26:08,051 INFO L273 TraceCheckUtils]: 67: Hoare triple {3112#false} assume !false; {3112#false} is VALID [2018-11-23 12:26:08,054 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-23 12:26:08,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:08,055 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:08,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:08,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:08,318 INFO L256 TraceCheckUtils]: 0: Hoare triple {3111#true} call ULTIMATE.init(); {3111#true} is VALID [2018-11-23 12:26:08,318 INFO L273 TraceCheckUtils]: 1: Hoare triple {3111#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3111#true} is VALID [2018-11-23 12:26:08,319 INFO L273 TraceCheckUtils]: 2: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:26:08,319 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3111#true} {3111#true} #66#return; {3111#true} is VALID [2018-11-23 12:26:08,319 INFO L256 TraceCheckUtils]: 4: Hoare triple {3111#true} call #t~ret13 := main(); {3111#true} is VALID [2018-11-23 12:26:08,320 INFO L273 TraceCheckUtils]: 5: Hoare triple {3111#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; {3139#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:08,321 INFO L273 TraceCheckUtils]: 6: Hoare triple {3139#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3139#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:08,321 INFO L273 TraceCheckUtils]: 7: Hoare triple {3139#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3114#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:08,322 INFO L273 TraceCheckUtils]: 8: Hoare triple {3114#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3114#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:08,322 INFO L273 TraceCheckUtils]: 9: Hoare triple {3114#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3115#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:08,323 INFO L273 TraceCheckUtils]: 10: Hoare triple {3115#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3115#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:08,323 INFO L273 TraceCheckUtils]: 11: Hoare triple {3115#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3116#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:08,324 INFO L273 TraceCheckUtils]: 12: Hoare triple {3116#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3116#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:08,325 INFO L273 TraceCheckUtils]: 13: Hoare triple {3116#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3117#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:08,326 INFO L273 TraceCheckUtils]: 14: Hoare triple {3117#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3117#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:08,327 INFO L273 TraceCheckUtils]: 15: Hoare triple {3117#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3118#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:08,327 INFO L273 TraceCheckUtils]: 16: Hoare triple {3118#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3118#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:08,328 INFO L273 TraceCheckUtils]: 17: Hoare triple {3118#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3119#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:08,329 INFO L273 TraceCheckUtils]: 18: Hoare triple {3119#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3119#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:08,330 INFO L273 TraceCheckUtils]: 19: Hoare triple {3119#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3120#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:08,331 INFO L273 TraceCheckUtils]: 20: Hoare triple {3120#(<= main_~i~1 7)} assume !(~i~1 < 10000); {3112#false} is VALID [2018-11-23 12:26:08,331 INFO L256 TraceCheckUtils]: 21: Hoare triple {3112#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {3112#false} is VALID [2018-11-23 12:26:08,331 INFO L273 TraceCheckUtils]: 22: Hoare triple {3112#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3112#false} is VALID [2018-11-23 12:26:08,331 INFO L273 TraceCheckUtils]: 23: Hoare triple {3112#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:26:08,331 INFO L273 TraceCheckUtils]: 24: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:26:08,332 INFO L273 TraceCheckUtils]: 25: Hoare triple {3112#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:26:08,332 INFO L273 TraceCheckUtils]: 26: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:26:08,332 INFO L273 TraceCheckUtils]: 27: Hoare triple {3112#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:26:08,332 INFO L273 TraceCheckUtils]: 28: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:26:08,332 INFO L273 TraceCheckUtils]: 29: Hoare triple {3112#false} assume !(~i~0 < 10000); {3112#false} is VALID [2018-11-23 12:26:08,333 INFO L273 TraceCheckUtils]: 30: Hoare triple {3112#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3112#false} is VALID [2018-11-23 12:26:08,333 INFO L273 TraceCheckUtils]: 31: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:26:08,333 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3112#false} {3112#false} #70#return; {3112#false} is VALID [2018-11-23 12:26:08,333 INFO L273 TraceCheckUtils]: 33: Hoare triple {3112#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:26:08,334 INFO L256 TraceCheckUtils]: 34: Hoare triple {3112#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {3112#false} is VALID [2018-11-23 12:26:08,334 INFO L273 TraceCheckUtils]: 35: Hoare triple {3112#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3112#false} is VALID [2018-11-23 12:26:08,334 INFO L273 TraceCheckUtils]: 36: Hoare triple {3112#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:26:08,334 INFO L273 TraceCheckUtils]: 37: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:26:08,334 INFO L273 TraceCheckUtils]: 38: Hoare triple {3112#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:26:08,335 INFO L273 TraceCheckUtils]: 39: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:26:08,335 INFO L273 TraceCheckUtils]: 40: Hoare triple {3112#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:26:08,335 INFO L273 TraceCheckUtils]: 41: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:26:08,335 INFO L273 TraceCheckUtils]: 42: Hoare triple {3112#false} assume !(~i~0 < 10000); {3112#false} is VALID [2018-11-23 12:26:08,335 INFO L273 TraceCheckUtils]: 43: Hoare triple {3112#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3112#false} is VALID [2018-11-23 12:26:08,335 INFO L273 TraceCheckUtils]: 44: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:26:08,335 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3112#false} {3112#false} #72#return; {3112#false} is VALID [2018-11-23 12:26:08,335 INFO L273 TraceCheckUtils]: 46: Hoare triple {3112#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3112#false} is VALID [2018-11-23 12:26:08,335 INFO L273 TraceCheckUtils]: 47: Hoare triple {3112#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3112#false} is VALID [2018-11-23 12:26:08,336 INFO L273 TraceCheckUtils]: 48: Hoare triple {3112#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3112#false} is VALID [2018-11-23 12:26:08,336 INFO L273 TraceCheckUtils]: 49: Hoare triple {3112#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3112#false} is VALID [2018-11-23 12:26:08,336 INFO L273 TraceCheckUtils]: 50: Hoare triple {3112#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3112#false} is VALID [2018-11-23 12:26:08,336 INFO L273 TraceCheckUtils]: 51: Hoare triple {3112#false} assume !(~i~2 < 9999); {3112#false} is VALID [2018-11-23 12:26:08,336 INFO L273 TraceCheckUtils]: 52: Hoare triple {3112#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:26:08,336 INFO L256 TraceCheckUtils]: 53: Hoare triple {3112#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {3112#false} is VALID [2018-11-23 12:26:08,336 INFO L273 TraceCheckUtils]: 54: Hoare triple {3112#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3112#false} is VALID [2018-11-23 12:26:08,336 INFO L273 TraceCheckUtils]: 55: Hoare triple {3112#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:26:08,337 INFO L273 TraceCheckUtils]: 56: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:26:08,337 INFO L273 TraceCheckUtils]: 57: Hoare triple {3112#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:26:08,337 INFO L273 TraceCheckUtils]: 58: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:26:08,337 INFO L273 TraceCheckUtils]: 59: Hoare triple {3112#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:26:08,337 INFO L273 TraceCheckUtils]: 60: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:26:08,337 INFO L273 TraceCheckUtils]: 61: Hoare triple {3112#false} assume !(~i~0 < 10000); {3112#false} is VALID [2018-11-23 12:26:08,337 INFO L273 TraceCheckUtils]: 62: Hoare triple {3112#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3112#false} is VALID [2018-11-23 12:26:08,337 INFO L273 TraceCheckUtils]: 63: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:26:08,337 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {3112#false} {3112#false} #74#return; {3112#false} is VALID [2018-11-23 12:26:08,338 INFO L273 TraceCheckUtils]: 65: Hoare triple {3112#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3112#false} is VALID [2018-11-23 12:26:08,338 INFO L273 TraceCheckUtils]: 66: Hoare triple {3112#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3112#false} is VALID [2018-11-23 12:26:08,338 INFO L273 TraceCheckUtils]: 67: Hoare triple {3112#false} assume !false; {3112#false} is VALID [2018-11-23 12:26:08,340 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-23 12:26:08,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:08,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:26:08,360 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 12:26:08,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:08,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:26:08,479 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:08,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:26:08,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:26:08,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:26:08,480 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2018-11-23 12:26:08,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:08,731 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-11-23 12:26:08,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:26:08,732 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 12:26:08,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:08,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:26:08,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:26:08,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:26:08,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:26:08,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 68 transitions. [2018-11-23 12:26:08,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:08,824 INFO L225 Difference]: With dead ends: 76 [2018-11-23 12:26:08,824 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 12:26:08,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:26:08,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 12:26:08,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-23 12:26:08,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:08,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 49 states. [2018-11-23 12:26:08,855 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 49 states. [2018-11-23 12:26:08,855 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 49 states. [2018-11-23 12:26:08,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:08,856 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 12:26:08,856 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 12:26:08,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:08,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:08,857 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 50 states. [2018-11-23 12:26:08,857 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 50 states. [2018-11-23 12:26:08,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:08,858 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 12:26:08,858 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 12:26:08,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:08,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:08,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:08,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:08,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:26:08,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-23 12:26:08,861 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 68 [2018-11-23 12:26:08,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:08,861 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-23 12:26:08,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:26:08,861 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:26:08,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 12:26:08,862 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:08,862 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 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-23 12:26:08,862 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:08,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:08,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1594227089, now seen corresponding path program 8 times [2018-11-23 12:26:08,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:08,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:08,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:08,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:08,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:09,126 INFO L256 TraceCheckUtils]: 0: Hoare triple {3609#true} call ULTIMATE.init(); {3609#true} is VALID [2018-11-23 12:26:09,127 INFO L273 TraceCheckUtils]: 1: Hoare triple {3609#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3609#true} is VALID [2018-11-23 12:26:09,127 INFO L273 TraceCheckUtils]: 2: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:26:09,127 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3609#true} {3609#true} #66#return; {3609#true} is VALID [2018-11-23 12:26:09,127 INFO L256 TraceCheckUtils]: 4: Hoare triple {3609#true} call #t~ret13 := main(); {3609#true} is VALID [2018-11-23 12:26:09,128 INFO L273 TraceCheckUtils]: 5: Hoare triple {3609#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; {3611#(= main_~i~1 0)} is VALID [2018-11-23 12:26:09,129 INFO L273 TraceCheckUtils]: 6: Hoare triple {3611#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3611#(= main_~i~1 0)} is VALID [2018-11-23 12:26:09,129 INFO L273 TraceCheckUtils]: 7: Hoare triple {3611#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3612#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:09,130 INFO L273 TraceCheckUtils]: 8: Hoare triple {3612#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3612#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:09,130 INFO L273 TraceCheckUtils]: 9: Hoare triple {3612#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3613#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:09,131 INFO L273 TraceCheckUtils]: 10: Hoare triple {3613#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3613#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:09,131 INFO L273 TraceCheckUtils]: 11: Hoare triple {3613#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3614#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:09,132 INFO L273 TraceCheckUtils]: 12: Hoare triple {3614#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3614#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:09,132 INFO L273 TraceCheckUtils]: 13: Hoare triple {3614#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3615#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:09,133 INFO L273 TraceCheckUtils]: 14: Hoare triple {3615#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3615#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:09,134 INFO L273 TraceCheckUtils]: 15: Hoare triple {3615#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3616#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:09,134 INFO L273 TraceCheckUtils]: 16: Hoare triple {3616#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3616#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:09,135 INFO L273 TraceCheckUtils]: 17: Hoare triple {3616#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3617#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:09,136 INFO L273 TraceCheckUtils]: 18: Hoare triple {3617#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3617#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:09,137 INFO L273 TraceCheckUtils]: 19: Hoare triple {3617#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3618#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:09,137 INFO L273 TraceCheckUtils]: 20: Hoare triple {3618#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3618#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:09,138 INFO L273 TraceCheckUtils]: 21: Hoare triple {3618#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3619#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:09,139 INFO L273 TraceCheckUtils]: 22: Hoare triple {3619#(<= main_~i~1 8)} assume !(~i~1 < 10000); {3610#false} is VALID [2018-11-23 12:26:09,139 INFO L256 TraceCheckUtils]: 23: Hoare triple {3610#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {3609#true} is VALID [2018-11-23 12:26:09,139 INFO L273 TraceCheckUtils]: 24: Hoare triple {3609#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3609#true} is VALID [2018-11-23 12:26:09,140 INFO L273 TraceCheckUtils]: 25: Hoare triple {3609#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:26:09,140 INFO L273 TraceCheckUtils]: 26: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:26:09,140 INFO L273 TraceCheckUtils]: 27: Hoare triple {3609#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:26:09,140 INFO L273 TraceCheckUtils]: 28: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:26:09,140 INFO L273 TraceCheckUtils]: 29: Hoare triple {3609#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:26:09,141 INFO L273 TraceCheckUtils]: 30: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:26:09,141 INFO L273 TraceCheckUtils]: 31: Hoare triple {3609#true} assume !(~i~0 < 10000); {3609#true} is VALID [2018-11-23 12:26:09,141 INFO L273 TraceCheckUtils]: 32: Hoare triple {3609#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3609#true} is VALID [2018-11-23 12:26:09,141 INFO L273 TraceCheckUtils]: 33: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:26:09,141 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3609#true} {3610#false} #70#return; {3610#false} is VALID [2018-11-23 12:26:09,142 INFO L273 TraceCheckUtils]: 35: Hoare triple {3610#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:26:09,142 INFO L256 TraceCheckUtils]: 36: Hoare triple {3610#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {3609#true} is VALID [2018-11-23 12:26:09,142 INFO L273 TraceCheckUtils]: 37: Hoare triple {3609#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3609#true} is VALID [2018-11-23 12:26:09,142 INFO L273 TraceCheckUtils]: 38: Hoare triple {3609#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:26:09,142 INFO L273 TraceCheckUtils]: 39: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:26:09,143 INFO L273 TraceCheckUtils]: 40: Hoare triple {3609#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:26:09,143 INFO L273 TraceCheckUtils]: 41: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:26:09,143 INFO L273 TraceCheckUtils]: 42: Hoare triple {3609#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:26:09,143 INFO L273 TraceCheckUtils]: 43: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:26:09,143 INFO L273 TraceCheckUtils]: 44: Hoare triple {3609#true} assume !(~i~0 < 10000); {3609#true} is VALID [2018-11-23 12:26:09,143 INFO L273 TraceCheckUtils]: 45: Hoare triple {3609#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3609#true} is VALID [2018-11-23 12:26:09,144 INFO L273 TraceCheckUtils]: 46: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:26:09,144 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {3609#true} {3610#false} #72#return; {3610#false} is VALID [2018-11-23 12:26:09,144 INFO L273 TraceCheckUtils]: 48: Hoare triple {3610#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3610#false} is VALID [2018-11-23 12:26:09,144 INFO L273 TraceCheckUtils]: 49: Hoare triple {3610#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3610#false} is VALID [2018-11-23 12:26:09,145 INFO L273 TraceCheckUtils]: 50: Hoare triple {3610#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3610#false} is VALID [2018-11-23 12:26:09,145 INFO L273 TraceCheckUtils]: 51: Hoare triple {3610#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3610#false} is VALID [2018-11-23 12:26:09,145 INFO L273 TraceCheckUtils]: 52: Hoare triple {3610#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3610#false} is VALID [2018-11-23 12:26:09,145 INFO L273 TraceCheckUtils]: 53: Hoare triple {3610#false} assume !(~i~2 < 9999); {3610#false} is VALID [2018-11-23 12:26:09,145 INFO L273 TraceCheckUtils]: 54: Hoare triple {3610#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:26:09,145 INFO L256 TraceCheckUtils]: 55: Hoare triple {3610#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {3609#true} is VALID [2018-11-23 12:26:09,146 INFO L273 TraceCheckUtils]: 56: Hoare triple {3609#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3609#true} is VALID [2018-11-23 12:26:09,146 INFO L273 TraceCheckUtils]: 57: Hoare triple {3609#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:26:09,146 INFO L273 TraceCheckUtils]: 58: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:26:09,146 INFO L273 TraceCheckUtils]: 59: Hoare triple {3609#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:26:09,146 INFO L273 TraceCheckUtils]: 60: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:26:09,146 INFO L273 TraceCheckUtils]: 61: Hoare triple {3609#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:26:09,146 INFO L273 TraceCheckUtils]: 62: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:26:09,146 INFO L273 TraceCheckUtils]: 63: Hoare triple {3609#true} assume !(~i~0 < 10000); {3609#true} is VALID [2018-11-23 12:26:09,147 INFO L273 TraceCheckUtils]: 64: Hoare triple {3609#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3609#true} is VALID [2018-11-23 12:26:09,147 INFO L273 TraceCheckUtils]: 65: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:26:09,147 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3609#true} {3610#false} #74#return; {3610#false} is VALID [2018-11-23 12:26:09,147 INFO L273 TraceCheckUtils]: 67: Hoare triple {3610#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3610#false} is VALID [2018-11-23 12:26:09,147 INFO L273 TraceCheckUtils]: 68: Hoare triple {3610#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3610#false} is VALID [2018-11-23 12:26:09,147 INFO L273 TraceCheckUtils]: 69: Hoare triple {3610#false} assume !false; {3610#false} is VALID [2018-11-23 12:26:09,150 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-23 12:26:09,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:09,150 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:09,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:26:09,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:26:09,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:09,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:09,404 INFO L256 TraceCheckUtils]: 0: Hoare triple {3609#true} call ULTIMATE.init(); {3609#true} is VALID [2018-11-23 12:26:09,404 INFO L273 TraceCheckUtils]: 1: Hoare triple {3609#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3609#true} is VALID [2018-11-23 12:26:09,404 INFO L273 TraceCheckUtils]: 2: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:26:09,405 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3609#true} {3609#true} #66#return; {3609#true} is VALID [2018-11-23 12:26:09,405 INFO L256 TraceCheckUtils]: 4: Hoare triple {3609#true} call #t~ret13 := main(); {3609#true} is VALID [2018-11-23 12:26:09,406 INFO L273 TraceCheckUtils]: 5: Hoare triple {3609#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; {3638#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:09,406 INFO L273 TraceCheckUtils]: 6: Hoare triple {3638#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3638#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:09,407 INFO L273 TraceCheckUtils]: 7: Hoare triple {3638#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3612#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:09,407 INFO L273 TraceCheckUtils]: 8: Hoare triple {3612#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3612#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:09,408 INFO L273 TraceCheckUtils]: 9: Hoare triple {3612#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3613#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:09,408 INFO L273 TraceCheckUtils]: 10: Hoare triple {3613#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3613#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:09,409 INFO L273 TraceCheckUtils]: 11: Hoare triple {3613#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3614#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:09,410 INFO L273 TraceCheckUtils]: 12: Hoare triple {3614#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3614#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:09,411 INFO L273 TraceCheckUtils]: 13: Hoare triple {3614#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3615#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:09,412 INFO L273 TraceCheckUtils]: 14: Hoare triple {3615#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3615#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:09,413 INFO L273 TraceCheckUtils]: 15: Hoare triple {3615#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3616#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:09,413 INFO L273 TraceCheckUtils]: 16: Hoare triple {3616#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3616#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:09,414 INFO L273 TraceCheckUtils]: 17: Hoare triple {3616#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3617#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:09,415 INFO L273 TraceCheckUtils]: 18: Hoare triple {3617#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3617#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:09,416 INFO L273 TraceCheckUtils]: 19: Hoare triple {3617#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3618#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:09,417 INFO L273 TraceCheckUtils]: 20: Hoare triple {3618#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {3618#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:09,417 INFO L273 TraceCheckUtils]: 21: Hoare triple {3618#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3619#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:09,418 INFO L273 TraceCheckUtils]: 22: Hoare triple {3619#(<= main_~i~1 8)} assume !(~i~1 < 10000); {3610#false} is VALID [2018-11-23 12:26:09,419 INFO L256 TraceCheckUtils]: 23: Hoare triple {3610#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {3610#false} is VALID [2018-11-23 12:26:09,419 INFO L273 TraceCheckUtils]: 24: Hoare triple {3610#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3610#false} is VALID [2018-11-23 12:26:09,419 INFO L273 TraceCheckUtils]: 25: Hoare triple {3610#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:26:09,419 INFO L273 TraceCheckUtils]: 26: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:26:09,419 INFO L273 TraceCheckUtils]: 27: Hoare triple {3610#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:26:09,420 INFO L273 TraceCheckUtils]: 28: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:26:09,420 INFO L273 TraceCheckUtils]: 29: Hoare triple {3610#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:26:09,420 INFO L273 TraceCheckUtils]: 30: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:26:09,420 INFO L273 TraceCheckUtils]: 31: Hoare triple {3610#false} assume !(~i~0 < 10000); {3610#false} is VALID [2018-11-23 12:26:09,420 INFO L273 TraceCheckUtils]: 32: Hoare triple {3610#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3610#false} is VALID [2018-11-23 12:26:09,421 INFO L273 TraceCheckUtils]: 33: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:26:09,421 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3610#false} {3610#false} #70#return; {3610#false} is VALID [2018-11-23 12:26:09,421 INFO L273 TraceCheckUtils]: 35: Hoare triple {3610#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:26:09,421 INFO L256 TraceCheckUtils]: 36: Hoare triple {3610#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {3610#false} is VALID [2018-11-23 12:26:09,422 INFO L273 TraceCheckUtils]: 37: Hoare triple {3610#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3610#false} is VALID [2018-11-23 12:26:09,422 INFO L273 TraceCheckUtils]: 38: Hoare triple {3610#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:26:09,422 INFO L273 TraceCheckUtils]: 39: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:26:09,422 INFO L273 TraceCheckUtils]: 40: Hoare triple {3610#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:26:09,422 INFO L273 TraceCheckUtils]: 41: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:26:09,422 INFO L273 TraceCheckUtils]: 42: Hoare triple {3610#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:26:09,422 INFO L273 TraceCheckUtils]: 43: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:26:09,422 INFO L273 TraceCheckUtils]: 44: Hoare triple {3610#false} assume !(~i~0 < 10000); {3610#false} is VALID [2018-11-23 12:26:09,423 INFO L273 TraceCheckUtils]: 45: Hoare triple {3610#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3610#false} is VALID [2018-11-23 12:26:09,423 INFO L273 TraceCheckUtils]: 46: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:26:09,423 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {3610#false} {3610#false} #72#return; {3610#false} is VALID [2018-11-23 12:26:09,423 INFO L273 TraceCheckUtils]: 48: Hoare triple {3610#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3610#false} is VALID [2018-11-23 12:26:09,423 INFO L273 TraceCheckUtils]: 49: Hoare triple {3610#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3610#false} is VALID [2018-11-23 12:26:09,423 INFO L273 TraceCheckUtils]: 50: Hoare triple {3610#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3610#false} is VALID [2018-11-23 12:26:09,423 INFO L273 TraceCheckUtils]: 51: Hoare triple {3610#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3610#false} is VALID [2018-11-23 12:26:09,423 INFO L273 TraceCheckUtils]: 52: Hoare triple {3610#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3610#false} is VALID [2018-11-23 12:26:09,424 INFO L273 TraceCheckUtils]: 53: Hoare triple {3610#false} assume !(~i~2 < 9999); {3610#false} is VALID [2018-11-23 12:26:09,424 INFO L273 TraceCheckUtils]: 54: Hoare triple {3610#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:26:09,424 INFO L256 TraceCheckUtils]: 55: Hoare triple {3610#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {3610#false} is VALID [2018-11-23 12:26:09,424 INFO L273 TraceCheckUtils]: 56: Hoare triple {3610#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3610#false} is VALID [2018-11-23 12:26:09,424 INFO L273 TraceCheckUtils]: 57: Hoare triple {3610#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:26:09,424 INFO L273 TraceCheckUtils]: 58: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:26:09,424 INFO L273 TraceCheckUtils]: 59: Hoare triple {3610#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:26:09,424 INFO L273 TraceCheckUtils]: 60: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:26:09,424 INFO L273 TraceCheckUtils]: 61: Hoare triple {3610#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:26:09,425 INFO L273 TraceCheckUtils]: 62: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:26:09,425 INFO L273 TraceCheckUtils]: 63: Hoare triple {3610#false} assume !(~i~0 < 10000); {3610#false} is VALID [2018-11-23 12:26:09,425 INFO L273 TraceCheckUtils]: 64: Hoare triple {3610#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3610#false} is VALID [2018-11-23 12:26:09,425 INFO L273 TraceCheckUtils]: 65: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:26:09,425 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3610#false} {3610#false} #74#return; {3610#false} is VALID [2018-11-23 12:26:09,425 INFO L273 TraceCheckUtils]: 67: Hoare triple {3610#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3610#false} is VALID [2018-11-23 12:26:09,425 INFO L273 TraceCheckUtils]: 68: Hoare triple {3610#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3610#false} is VALID [2018-11-23 12:26:09,425 INFO L273 TraceCheckUtils]: 69: Hoare triple {3610#false} assume !false; {3610#false} is VALID [2018-11-23 12:26:09,428 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-23 12:26:09,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:09,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:26:09,448 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 12:26:09,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:09,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:26:09,530 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:09,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:26:09,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:26:09,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:26:09,531 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 12 states. [2018-11-23 12:26:09,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:09,753 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-23 12:26:09,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:26:09,753 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 12:26:09,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:26:09,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:26:09,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:26:09,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:26:09,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 70 transitions. [2018-11-23 12:26:09,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:09,870 INFO L225 Difference]: With dead ends: 78 [2018-11-23 12:26:09,870 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:26:09,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:26:09,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:26:09,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-23 12:26:09,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:09,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2018-11-23 12:26:09,904 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2018-11-23 12:26:09,904 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2018-11-23 12:26:09,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:09,906 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:26:09,906 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:26:09,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:09,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:09,907 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2018-11-23 12:26:09,907 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2018-11-23 12:26:09,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:09,909 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:26:09,910 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:26:09,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:09,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:09,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:09,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:09,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:26:09,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-23 12:26:09,912 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 70 [2018-11-23 12:26:09,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:09,912 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-23 12:26:09,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:26:09,912 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 12:26:09,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 12:26:09,913 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:09,913 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 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-23 12:26:09,914 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:09,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:09,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1351728243, now seen corresponding path program 9 times [2018-11-23 12:26:09,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:09,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:09,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:09,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:09,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:10,225 INFO L256 TraceCheckUtils]: 0: Hoare triple {4124#true} call ULTIMATE.init(); {4124#true} is VALID [2018-11-23 12:26:10,225 INFO L273 TraceCheckUtils]: 1: Hoare triple {4124#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4124#true} is VALID [2018-11-23 12:26:10,225 INFO L273 TraceCheckUtils]: 2: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:26:10,226 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4124#true} {4124#true} #66#return; {4124#true} is VALID [2018-11-23 12:26:10,226 INFO L256 TraceCheckUtils]: 4: Hoare triple {4124#true} call #t~ret13 := main(); {4124#true} is VALID [2018-11-23 12:26:10,226 INFO L273 TraceCheckUtils]: 5: Hoare triple {4124#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; {4126#(= main_~i~1 0)} is VALID [2018-11-23 12:26:10,227 INFO L273 TraceCheckUtils]: 6: Hoare triple {4126#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {4126#(= main_~i~1 0)} is VALID [2018-11-23 12:26:10,228 INFO L273 TraceCheckUtils]: 7: Hoare triple {4126#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4127#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:10,228 INFO L273 TraceCheckUtils]: 8: Hoare triple {4127#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {4127#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:10,229 INFO L273 TraceCheckUtils]: 9: Hoare triple {4127#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4128#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:10,230 INFO L273 TraceCheckUtils]: 10: Hoare triple {4128#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {4128#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:10,231 INFO L273 TraceCheckUtils]: 11: Hoare triple {4128#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4129#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:10,232 INFO L273 TraceCheckUtils]: 12: Hoare triple {4129#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {4129#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:10,232 INFO L273 TraceCheckUtils]: 13: Hoare triple {4129#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4130#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:10,233 INFO L273 TraceCheckUtils]: 14: Hoare triple {4130#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {4130#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:10,234 INFO L273 TraceCheckUtils]: 15: Hoare triple {4130#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4131#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:10,235 INFO L273 TraceCheckUtils]: 16: Hoare triple {4131#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {4131#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:10,236 INFO L273 TraceCheckUtils]: 17: Hoare triple {4131#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4132#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:10,236 INFO L273 TraceCheckUtils]: 18: Hoare triple {4132#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {4132#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:10,237 INFO L273 TraceCheckUtils]: 19: Hoare triple {4132#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4133#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:10,238 INFO L273 TraceCheckUtils]: 20: Hoare triple {4133#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {4133#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:10,239 INFO L273 TraceCheckUtils]: 21: Hoare triple {4133#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4134#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:10,239 INFO L273 TraceCheckUtils]: 22: Hoare triple {4134#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {4134#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:10,240 INFO L273 TraceCheckUtils]: 23: Hoare triple {4134#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4135#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:10,241 INFO L273 TraceCheckUtils]: 24: Hoare triple {4135#(<= main_~i~1 9)} assume !(~i~1 < 10000); {4125#false} is VALID [2018-11-23 12:26:10,241 INFO L256 TraceCheckUtils]: 25: Hoare triple {4125#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:26:10,242 INFO L273 TraceCheckUtils]: 26: Hoare triple {4124#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4124#true} is VALID [2018-11-23 12:26:10,242 INFO L273 TraceCheckUtils]: 27: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:10,242 INFO L273 TraceCheckUtils]: 28: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:10,242 INFO L273 TraceCheckUtils]: 29: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:10,242 INFO L273 TraceCheckUtils]: 30: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:10,243 INFO L273 TraceCheckUtils]: 31: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:10,243 INFO L273 TraceCheckUtils]: 32: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:10,243 INFO L273 TraceCheckUtils]: 33: Hoare triple {4124#true} assume !(~i~0 < 10000); {4124#true} is VALID [2018-11-23 12:26:10,243 INFO L273 TraceCheckUtils]: 34: Hoare triple {4124#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:26:10,243 INFO L273 TraceCheckUtils]: 35: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:26:10,244 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {4124#true} {4125#false} #70#return; {4125#false} is VALID [2018-11-23 12:26:10,244 INFO L273 TraceCheckUtils]: 37: Hoare triple {4125#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4125#false} is VALID [2018-11-23 12:26:10,244 INFO L256 TraceCheckUtils]: 38: Hoare triple {4125#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:26:10,244 INFO L273 TraceCheckUtils]: 39: Hoare triple {4124#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4124#true} is VALID [2018-11-23 12:26:10,244 INFO L273 TraceCheckUtils]: 40: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:10,244 INFO L273 TraceCheckUtils]: 41: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:10,245 INFO L273 TraceCheckUtils]: 42: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:10,245 INFO L273 TraceCheckUtils]: 43: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:10,245 INFO L273 TraceCheckUtils]: 44: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:10,245 INFO L273 TraceCheckUtils]: 45: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:10,245 INFO L273 TraceCheckUtils]: 46: Hoare triple {4124#true} assume !(~i~0 < 10000); {4124#true} is VALID [2018-11-23 12:26:10,245 INFO L273 TraceCheckUtils]: 47: Hoare triple {4124#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:26:10,245 INFO L273 TraceCheckUtils]: 48: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:26:10,245 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4124#true} {4125#false} #72#return; {4125#false} is VALID [2018-11-23 12:26:10,246 INFO L273 TraceCheckUtils]: 50: Hoare triple {4125#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {4125#false} is VALID [2018-11-23 12:26:10,246 INFO L273 TraceCheckUtils]: 51: Hoare triple {4125#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4125#false} is VALID [2018-11-23 12:26:10,246 INFO L273 TraceCheckUtils]: 52: Hoare triple {4125#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4125#false} is VALID [2018-11-23 12:26:10,246 INFO L273 TraceCheckUtils]: 53: Hoare triple {4125#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4125#false} is VALID [2018-11-23 12:26:10,246 INFO L273 TraceCheckUtils]: 54: Hoare triple {4125#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4125#false} is VALID [2018-11-23 12:26:10,246 INFO L273 TraceCheckUtils]: 55: Hoare triple {4125#false} assume !(~i~2 < 9999); {4125#false} is VALID [2018-11-23 12:26:10,246 INFO L273 TraceCheckUtils]: 56: Hoare triple {4125#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {4125#false} is VALID [2018-11-23 12:26:10,246 INFO L256 TraceCheckUtils]: 57: Hoare triple {4125#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:26:10,246 INFO L273 TraceCheckUtils]: 58: Hoare triple {4124#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4124#true} is VALID [2018-11-23 12:26:10,247 INFO L273 TraceCheckUtils]: 59: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:10,247 INFO L273 TraceCheckUtils]: 60: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:10,247 INFO L273 TraceCheckUtils]: 61: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:10,247 INFO L273 TraceCheckUtils]: 62: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:10,247 INFO L273 TraceCheckUtils]: 63: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:10,247 INFO L273 TraceCheckUtils]: 64: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:10,247 INFO L273 TraceCheckUtils]: 65: Hoare triple {4124#true} assume !(~i~0 < 10000); {4124#true} is VALID [2018-11-23 12:26:10,247 INFO L273 TraceCheckUtils]: 66: Hoare triple {4124#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:26:10,248 INFO L273 TraceCheckUtils]: 67: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:26:10,248 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {4124#true} {4125#false} #74#return; {4125#false} is VALID [2018-11-23 12:26:10,248 INFO L273 TraceCheckUtils]: 69: Hoare triple {4125#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {4125#false} is VALID [2018-11-23 12:26:10,248 INFO L273 TraceCheckUtils]: 70: Hoare triple {4125#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {4125#false} is VALID [2018-11-23 12:26:10,248 INFO L273 TraceCheckUtils]: 71: Hoare triple {4125#false} assume !false; {4125#false} is VALID [2018-11-23 12:26:10,250 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-23 12:26:10,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:10,251 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:10,260 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:26:10,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:26:10,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:10,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:10,493 INFO L256 TraceCheckUtils]: 0: Hoare triple {4124#true} call ULTIMATE.init(); {4124#true} is VALID [2018-11-23 12:26:10,493 INFO L273 TraceCheckUtils]: 1: Hoare triple {4124#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4124#true} is VALID [2018-11-23 12:26:10,494 INFO L273 TraceCheckUtils]: 2: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:26:10,494 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4124#true} {4124#true} #66#return; {4124#true} is VALID [2018-11-23 12:26:10,494 INFO L256 TraceCheckUtils]: 4: Hoare triple {4124#true} call #t~ret13 := main(); {4124#true} is VALID [2018-11-23 12:26:10,494 INFO L273 TraceCheckUtils]: 5: Hoare triple {4124#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; {4124#true} is VALID [2018-11-23 12:26:10,495 INFO L273 TraceCheckUtils]: 6: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:26:10,495 INFO L273 TraceCheckUtils]: 7: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:26:10,495 INFO L273 TraceCheckUtils]: 8: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:26:10,495 INFO L273 TraceCheckUtils]: 9: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:26:10,496 INFO L273 TraceCheckUtils]: 10: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:26:10,496 INFO L273 TraceCheckUtils]: 11: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:26:10,496 INFO L273 TraceCheckUtils]: 12: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:26:10,496 INFO L273 TraceCheckUtils]: 13: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:26:10,497 INFO L273 TraceCheckUtils]: 14: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:26:10,497 INFO L273 TraceCheckUtils]: 15: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:26:10,497 INFO L273 TraceCheckUtils]: 16: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:26:10,497 INFO L273 TraceCheckUtils]: 17: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:26:10,498 INFO L273 TraceCheckUtils]: 18: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:26:10,498 INFO L273 TraceCheckUtils]: 19: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:26:10,498 INFO L273 TraceCheckUtils]: 20: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:26:10,498 INFO L273 TraceCheckUtils]: 21: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:26:10,498 INFO L273 TraceCheckUtils]: 22: Hoare triple {4124#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:26:10,498 INFO L273 TraceCheckUtils]: 23: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:26:10,499 INFO L273 TraceCheckUtils]: 24: Hoare triple {4124#true} assume !(~i~1 < 10000); {4124#true} is VALID [2018-11-23 12:26:10,499 INFO L256 TraceCheckUtils]: 25: Hoare triple {4124#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:26:10,499 INFO L273 TraceCheckUtils]: 26: Hoare triple {4124#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4124#true} is VALID [2018-11-23 12:26:10,499 INFO L273 TraceCheckUtils]: 27: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:10,499 INFO L273 TraceCheckUtils]: 28: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:10,499 INFO L273 TraceCheckUtils]: 29: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:10,499 INFO L273 TraceCheckUtils]: 30: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:10,500 INFO L273 TraceCheckUtils]: 31: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:10,500 INFO L273 TraceCheckUtils]: 32: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:10,500 INFO L273 TraceCheckUtils]: 33: Hoare triple {4124#true} assume !(~i~0 < 10000); {4124#true} is VALID [2018-11-23 12:26:10,500 INFO L273 TraceCheckUtils]: 34: Hoare triple {4124#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:26:10,500 INFO L273 TraceCheckUtils]: 35: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:26:10,500 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {4124#true} {4124#true} #70#return; {4124#true} is VALID [2018-11-23 12:26:10,501 INFO L273 TraceCheckUtils]: 37: Hoare triple {4124#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4124#true} is VALID [2018-11-23 12:26:10,501 INFO L256 TraceCheckUtils]: 38: Hoare triple {4124#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:26:10,501 INFO L273 TraceCheckUtils]: 39: Hoare triple {4124#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4124#true} is VALID [2018-11-23 12:26:10,501 INFO L273 TraceCheckUtils]: 40: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:10,501 INFO L273 TraceCheckUtils]: 41: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:10,501 INFO L273 TraceCheckUtils]: 42: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:10,501 INFO L273 TraceCheckUtils]: 43: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:10,502 INFO L273 TraceCheckUtils]: 44: Hoare triple {4124#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:10,502 INFO L273 TraceCheckUtils]: 45: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:10,502 INFO L273 TraceCheckUtils]: 46: Hoare triple {4124#true} assume !(~i~0 < 10000); {4124#true} is VALID [2018-11-23 12:26:10,502 INFO L273 TraceCheckUtils]: 47: Hoare triple {4124#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:26:10,502 INFO L273 TraceCheckUtils]: 48: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:26:10,502 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4124#true} {4124#true} #72#return; {4124#true} is VALID [2018-11-23 12:26:10,503 INFO L273 TraceCheckUtils]: 50: Hoare triple {4124#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {4289#(<= main_~i~2 0)} is VALID [2018-11-23 12:26:10,504 INFO L273 TraceCheckUtils]: 51: Hoare triple {4289#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4289#(<= main_~i~2 0)} is VALID [2018-11-23 12:26:10,504 INFO L273 TraceCheckUtils]: 52: Hoare triple {4289#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4296#(<= main_~i~2 1)} is VALID [2018-11-23 12:26:10,505 INFO L273 TraceCheckUtils]: 53: Hoare triple {4296#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4296#(<= main_~i~2 1)} is VALID [2018-11-23 12:26:10,505 INFO L273 TraceCheckUtils]: 54: Hoare triple {4296#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4303#(<= main_~i~2 2)} is VALID [2018-11-23 12:26:10,506 INFO L273 TraceCheckUtils]: 55: Hoare triple {4303#(<= main_~i~2 2)} assume !(~i~2 < 9999); {4125#false} is VALID [2018-11-23 12:26:10,506 INFO L273 TraceCheckUtils]: 56: Hoare triple {4125#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {4125#false} is VALID [2018-11-23 12:26:10,506 INFO L256 TraceCheckUtils]: 57: Hoare triple {4125#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {4125#false} is VALID [2018-11-23 12:26:10,507 INFO L273 TraceCheckUtils]: 58: Hoare triple {4125#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4125#false} is VALID [2018-11-23 12:26:10,507 INFO L273 TraceCheckUtils]: 59: Hoare triple {4125#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4125#false} is VALID [2018-11-23 12:26:10,507 INFO L273 TraceCheckUtils]: 60: Hoare triple {4125#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4125#false} is VALID [2018-11-23 12:26:10,508 INFO L273 TraceCheckUtils]: 61: Hoare triple {4125#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4125#false} is VALID [2018-11-23 12:26:10,508 INFO L273 TraceCheckUtils]: 62: Hoare triple {4125#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4125#false} is VALID [2018-11-23 12:26:10,508 INFO L273 TraceCheckUtils]: 63: Hoare triple {4125#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4125#false} is VALID [2018-11-23 12:26:10,508 INFO L273 TraceCheckUtils]: 64: Hoare triple {4125#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4125#false} is VALID [2018-11-23 12:26:10,509 INFO L273 TraceCheckUtils]: 65: Hoare triple {4125#false} assume !(~i~0 < 10000); {4125#false} is VALID [2018-11-23 12:26:10,509 INFO L273 TraceCheckUtils]: 66: Hoare triple {4125#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4125#false} is VALID [2018-11-23 12:26:10,509 INFO L273 TraceCheckUtils]: 67: Hoare triple {4125#false} assume true; {4125#false} is VALID [2018-11-23 12:26:10,509 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {4125#false} {4125#false} #74#return; {4125#false} is VALID [2018-11-23 12:26:10,509 INFO L273 TraceCheckUtils]: 69: Hoare triple {4125#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {4125#false} is VALID [2018-11-23 12:26:10,509 INFO L273 TraceCheckUtils]: 70: Hoare triple {4125#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {4125#false} is VALID [2018-11-23 12:26:10,510 INFO L273 TraceCheckUtils]: 71: Hoare triple {4125#false} assume !false; {4125#false} is VALID [2018-11-23 12:26:10,514 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 58 proven. 4 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-11-23 12:26:10,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:10,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2018-11-23 12:26:10,534 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 12:26:10,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:10,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:26:10,652 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-23 12:26:10,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:26:10,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:26:10,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:26:10,653 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 15 states. [2018-11-23 12:26:11,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:11,317 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-11-23 12:26:11,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:26:11,318 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 12:26:11,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:11,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:26:11,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2018-11-23 12:26:11,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:26:11,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2018-11-23 12:26:11,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 79 transitions. [2018-11-23 12:26:11,453 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-23 12:26:11,455 INFO L225 Difference]: With dead ends: 83 [2018-11-23 12:26:11,455 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:26:11,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:26:11,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:26:11,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-11-23 12:26:11,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:11,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 55 states. [2018-11-23 12:26:11,491 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 55 states. [2018-11-23 12:26:11,491 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 55 states. [2018-11-23 12:26:11,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:11,494 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-23 12:26:11,494 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 12:26:11,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:11,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:11,495 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 57 states. [2018-11-23 12:26:11,495 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 57 states. [2018-11-23 12:26:11,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:11,497 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-23 12:26:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 12:26:11,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:11,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:11,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:11,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:11,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:26:11,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-11-23 12:26:11,500 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 72 [2018-11-23 12:26:11,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:11,500 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-23 12:26:11,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:26:11,500 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-23 12:26:11,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 12:26:11,501 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:11,502 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 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-23 12:26:11,502 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:11,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:11,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1743973331, now seen corresponding path program 10 times [2018-11-23 12:26:11,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:11,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:11,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:11,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:11,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:12,219 INFO L256 TraceCheckUtils]: 0: Hoare triple {4671#true} call ULTIMATE.init(); {4671#true} is VALID [2018-11-23 12:26:12,220 INFO L273 TraceCheckUtils]: 1: Hoare triple {4671#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4671#true} is VALID [2018-11-23 12:26:12,220 INFO L273 TraceCheckUtils]: 2: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:26:12,220 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4671#true} {4671#true} #66#return; {4671#true} is VALID [2018-11-23 12:26:12,221 INFO L256 TraceCheckUtils]: 4: Hoare triple {4671#true} call #t~ret13 := main(); {4671#true} is VALID [2018-11-23 12:26:12,221 INFO L273 TraceCheckUtils]: 5: Hoare triple {4671#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; {4673#(= main_~i~1 0)} is VALID [2018-11-23 12:26:12,222 INFO L273 TraceCheckUtils]: 6: Hoare triple {4673#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {4673#(= main_~i~1 0)} is VALID [2018-11-23 12:26:12,222 INFO L273 TraceCheckUtils]: 7: Hoare triple {4673#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4674#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:12,223 INFO L273 TraceCheckUtils]: 8: Hoare triple {4674#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {4674#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:12,223 INFO L273 TraceCheckUtils]: 9: Hoare triple {4674#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4675#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:12,224 INFO L273 TraceCheckUtils]: 10: Hoare triple {4675#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {4675#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:12,225 INFO L273 TraceCheckUtils]: 11: Hoare triple {4675#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4676#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:12,225 INFO L273 TraceCheckUtils]: 12: Hoare triple {4676#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {4676#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:12,226 INFO L273 TraceCheckUtils]: 13: Hoare triple {4676#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4677#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:12,227 INFO L273 TraceCheckUtils]: 14: Hoare triple {4677#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {4677#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:12,228 INFO L273 TraceCheckUtils]: 15: Hoare triple {4677#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4678#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:12,229 INFO L273 TraceCheckUtils]: 16: Hoare triple {4678#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {4678#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:12,230 INFO L273 TraceCheckUtils]: 17: Hoare triple {4678#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4679#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:12,230 INFO L273 TraceCheckUtils]: 18: Hoare triple {4679#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {4679#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:12,231 INFO L273 TraceCheckUtils]: 19: Hoare triple {4679#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4680#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:12,232 INFO L273 TraceCheckUtils]: 20: Hoare triple {4680#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {4680#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:12,233 INFO L273 TraceCheckUtils]: 21: Hoare triple {4680#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4681#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:12,233 INFO L273 TraceCheckUtils]: 22: Hoare triple {4681#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {4681#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:12,234 INFO L273 TraceCheckUtils]: 23: Hoare triple {4681#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4682#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:12,235 INFO L273 TraceCheckUtils]: 24: Hoare triple {4682#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {4682#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:12,236 INFO L273 TraceCheckUtils]: 25: Hoare triple {4682#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4683#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:12,237 INFO L273 TraceCheckUtils]: 26: Hoare triple {4683#(<= main_~i~1 10)} assume !(~i~1 < 10000); {4672#false} is VALID [2018-11-23 12:26:12,237 INFO L256 TraceCheckUtils]: 27: Hoare triple {4672#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:26:12,237 INFO L273 TraceCheckUtils]: 28: Hoare triple {4671#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4671#true} is VALID [2018-11-23 12:26:12,237 INFO L273 TraceCheckUtils]: 29: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:12,238 INFO L273 TraceCheckUtils]: 30: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:12,238 INFO L273 TraceCheckUtils]: 31: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:12,238 INFO L273 TraceCheckUtils]: 32: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:12,238 INFO L273 TraceCheckUtils]: 33: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:12,238 INFO L273 TraceCheckUtils]: 34: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:12,239 INFO L273 TraceCheckUtils]: 35: Hoare triple {4671#true} assume !(~i~0 < 10000); {4671#true} is VALID [2018-11-23 12:26:12,239 INFO L273 TraceCheckUtils]: 36: Hoare triple {4671#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:26:12,239 INFO L273 TraceCheckUtils]: 37: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:26:12,239 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4671#true} {4672#false} #70#return; {4672#false} is VALID [2018-11-23 12:26:12,240 INFO L273 TraceCheckUtils]: 39: Hoare triple {4672#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4672#false} is VALID [2018-11-23 12:26:12,240 INFO L256 TraceCheckUtils]: 40: Hoare triple {4672#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:26:12,240 INFO L273 TraceCheckUtils]: 41: Hoare triple {4671#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4671#true} is VALID [2018-11-23 12:26:12,240 INFO L273 TraceCheckUtils]: 42: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:12,240 INFO L273 TraceCheckUtils]: 43: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:12,240 INFO L273 TraceCheckUtils]: 44: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:12,240 INFO L273 TraceCheckUtils]: 45: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:12,241 INFO L273 TraceCheckUtils]: 46: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:12,241 INFO L273 TraceCheckUtils]: 47: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:12,241 INFO L273 TraceCheckUtils]: 48: Hoare triple {4671#true} assume !(~i~0 < 10000); {4671#true} is VALID [2018-11-23 12:26:12,241 INFO L273 TraceCheckUtils]: 49: Hoare triple {4671#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:26:12,241 INFO L273 TraceCheckUtils]: 50: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:26:12,241 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4671#true} {4672#false} #72#return; {4672#false} is VALID [2018-11-23 12:26:12,241 INFO L273 TraceCheckUtils]: 52: Hoare triple {4672#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {4672#false} is VALID [2018-11-23 12:26:12,241 INFO L273 TraceCheckUtils]: 53: Hoare triple {4672#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4672#false} is VALID [2018-11-23 12:26:12,241 INFO L273 TraceCheckUtils]: 54: Hoare triple {4672#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4672#false} is VALID [2018-11-23 12:26:12,242 INFO L273 TraceCheckUtils]: 55: Hoare triple {4672#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4672#false} is VALID [2018-11-23 12:26:12,242 INFO L273 TraceCheckUtils]: 56: Hoare triple {4672#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4672#false} is VALID [2018-11-23 12:26:12,242 INFO L273 TraceCheckUtils]: 57: Hoare triple {4672#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4672#false} is VALID [2018-11-23 12:26:12,242 INFO L273 TraceCheckUtils]: 58: Hoare triple {4672#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4672#false} is VALID [2018-11-23 12:26:12,242 INFO L273 TraceCheckUtils]: 59: Hoare triple {4672#false} assume !(~i~2 < 9999); {4672#false} is VALID [2018-11-23 12:26:12,242 INFO L273 TraceCheckUtils]: 60: Hoare triple {4672#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {4672#false} is VALID [2018-11-23 12:26:12,242 INFO L256 TraceCheckUtils]: 61: Hoare triple {4672#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:26:12,242 INFO L273 TraceCheckUtils]: 62: Hoare triple {4671#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4671#true} is VALID [2018-11-23 12:26:12,243 INFO L273 TraceCheckUtils]: 63: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:12,243 INFO L273 TraceCheckUtils]: 64: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:12,243 INFO L273 TraceCheckUtils]: 65: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:12,243 INFO L273 TraceCheckUtils]: 66: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:12,243 INFO L273 TraceCheckUtils]: 67: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:12,243 INFO L273 TraceCheckUtils]: 68: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:12,243 INFO L273 TraceCheckUtils]: 69: Hoare triple {4671#true} assume !(~i~0 < 10000); {4671#true} is VALID [2018-11-23 12:26:12,243 INFO L273 TraceCheckUtils]: 70: Hoare triple {4671#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:26:12,243 INFO L273 TraceCheckUtils]: 71: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:26:12,244 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {4671#true} {4672#false} #74#return; {4672#false} is VALID [2018-11-23 12:26:12,244 INFO L273 TraceCheckUtils]: 73: Hoare triple {4672#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {4672#false} is VALID [2018-11-23 12:26:12,244 INFO L273 TraceCheckUtils]: 74: Hoare triple {4672#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {4672#false} is VALID [2018-11-23 12:26:12,244 INFO L273 TraceCheckUtils]: 75: Hoare triple {4672#false} assume !false; {4672#false} is VALID [2018-11-23 12:26:12,247 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-11-23 12:26:12,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:12,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:12,261 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:26:12,315 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:26:12,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:12,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:12,572 INFO L256 TraceCheckUtils]: 0: Hoare triple {4671#true} call ULTIMATE.init(); {4671#true} is VALID [2018-11-23 12:26:12,572 INFO L273 TraceCheckUtils]: 1: Hoare triple {4671#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4671#true} is VALID [2018-11-23 12:26:12,572 INFO L273 TraceCheckUtils]: 2: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:26:12,572 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4671#true} {4671#true} #66#return; {4671#true} is VALID [2018-11-23 12:26:12,573 INFO L256 TraceCheckUtils]: 4: Hoare triple {4671#true} call #t~ret13 := main(); {4671#true} is VALID [2018-11-23 12:26:12,573 INFO L273 TraceCheckUtils]: 5: Hoare triple {4671#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; {4671#true} is VALID [2018-11-23 12:26:12,573 INFO L273 TraceCheckUtils]: 6: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:26:12,573 INFO L273 TraceCheckUtils]: 7: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:26:12,574 INFO L273 TraceCheckUtils]: 8: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:26:12,574 INFO L273 TraceCheckUtils]: 9: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:26:12,574 INFO L273 TraceCheckUtils]: 10: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:26:12,574 INFO L273 TraceCheckUtils]: 11: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:26:12,574 INFO L273 TraceCheckUtils]: 12: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:26:12,575 INFO L273 TraceCheckUtils]: 13: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:26:12,575 INFO L273 TraceCheckUtils]: 14: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:26:12,575 INFO L273 TraceCheckUtils]: 15: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:26:12,575 INFO L273 TraceCheckUtils]: 16: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:26:12,575 INFO L273 TraceCheckUtils]: 17: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:26:12,576 INFO L273 TraceCheckUtils]: 18: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:26:12,576 INFO L273 TraceCheckUtils]: 19: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:26:12,576 INFO L273 TraceCheckUtils]: 20: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:26:12,576 INFO L273 TraceCheckUtils]: 21: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:26:12,576 INFO L273 TraceCheckUtils]: 22: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:26:12,577 INFO L273 TraceCheckUtils]: 23: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:26:12,577 INFO L273 TraceCheckUtils]: 24: Hoare triple {4671#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:26:12,577 INFO L273 TraceCheckUtils]: 25: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:26:12,577 INFO L273 TraceCheckUtils]: 26: Hoare triple {4671#true} assume !(~i~1 < 10000); {4671#true} is VALID [2018-11-23 12:26:12,577 INFO L256 TraceCheckUtils]: 27: Hoare triple {4671#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:26:12,577 INFO L273 TraceCheckUtils]: 28: Hoare triple {4671#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4671#true} is VALID [2018-11-23 12:26:12,577 INFO L273 TraceCheckUtils]: 29: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:12,577 INFO L273 TraceCheckUtils]: 30: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:12,578 INFO L273 TraceCheckUtils]: 31: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:12,578 INFO L273 TraceCheckUtils]: 32: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:12,578 INFO L273 TraceCheckUtils]: 33: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:12,578 INFO L273 TraceCheckUtils]: 34: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:12,578 INFO L273 TraceCheckUtils]: 35: Hoare triple {4671#true} assume !(~i~0 < 10000); {4671#true} is VALID [2018-11-23 12:26:12,578 INFO L273 TraceCheckUtils]: 36: Hoare triple {4671#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:26:12,578 INFO L273 TraceCheckUtils]: 37: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:26:12,578 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4671#true} {4671#true} #70#return; {4671#true} is VALID [2018-11-23 12:26:12,579 INFO L273 TraceCheckUtils]: 39: Hoare triple {4671#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4671#true} is VALID [2018-11-23 12:26:12,579 INFO L256 TraceCheckUtils]: 40: Hoare triple {4671#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:26:12,579 INFO L273 TraceCheckUtils]: 41: Hoare triple {4671#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4671#true} is VALID [2018-11-23 12:26:12,579 INFO L273 TraceCheckUtils]: 42: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:12,579 INFO L273 TraceCheckUtils]: 43: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:12,579 INFO L273 TraceCheckUtils]: 44: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:12,579 INFO L273 TraceCheckUtils]: 45: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:12,579 INFO L273 TraceCheckUtils]: 46: Hoare triple {4671#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:12,579 INFO L273 TraceCheckUtils]: 47: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:12,580 INFO L273 TraceCheckUtils]: 48: Hoare triple {4671#true} assume !(~i~0 < 10000); {4671#true} is VALID [2018-11-23 12:26:12,580 INFO L273 TraceCheckUtils]: 49: Hoare triple {4671#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:26:12,580 INFO L273 TraceCheckUtils]: 50: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:26:12,580 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4671#true} {4671#true} #72#return; {4671#true} is VALID [2018-11-23 12:26:12,580 INFO L273 TraceCheckUtils]: 52: Hoare triple {4671#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {4671#true} is VALID [2018-11-23 12:26:12,580 INFO L273 TraceCheckUtils]: 53: Hoare triple {4671#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4671#true} is VALID [2018-11-23 12:26:12,580 INFO L273 TraceCheckUtils]: 54: Hoare triple {4671#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4671#true} is VALID [2018-11-23 12:26:12,580 INFO L273 TraceCheckUtils]: 55: Hoare triple {4671#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4671#true} is VALID [2018-11-23 12:26:12,581 INFO L273 TraceCheckUtils]: 56: Hoare triple {4671#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4671#true} is VALID [2018-11-23 12:26:12,581 INFO L273 TraceCheckUtils]: 57: Hoare triple {4671#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4671#true} is VALID [2018-11-23 12:26:12,581 INFO L273 TraceCheckUtils]: 58: Hoare triple {4671#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4671#true} is VALID [2018-11-23 12:26:12,581 INFO L273 TraceCheckUtils]: 59: Hoare triple {4671#true} assume !(~i~2 < 9999); {4671#true} is VALID [2018-11-23 12:26:12,581 INFO L273 TraceCheckUtils]: 60: Hoare triple {4671#true} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {4671#true} is VALID [2018-11-23 12:26:12,581 INFO L256 TraceCheckUtils]: 61: Hoare triple {4671#true} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:26:12,582 INFO L273 TraceCheckUtils]: 62: Hoare triple {4671#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4873#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:12,582 INFO L273 TraceCheckUtils]: 63: Hoare triple {4873#(<= bor_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4873#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:12,599 INFO L273 TraceCheckUtils]: 64: Hoare triple {4873#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4880#(<= bor_~i~0 2)} is VALID [2018-11-23 12:26:12,601 INFO L273 TraceCheckUtils]: 65: Hoare triple {4880#(<= bor_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4880#(<= bor_~i~0 2)} is VALID [2018-11-23 12:26:12,602 INFO L273 TraceCheckUtils]: 66: Hoare triple {4880#(<= bor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4887#(<= bor_~i~0 3)} is VALID [2018-11-23 12:26:12,602 INFO L273 TraceCheckUtils]: 67: Hoare triple {4887#(<= bor_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4887#(<= bor_~i~0 3)} is VALID [2018-11-23 12:26:12,603 INFO L273 TraceCheckUtils]: 68: Hoare triple {4887#(<= bor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4894#(<= bor_~i~0 4)} is VALID [2018-11-23 12:26:12,603 INFO L273 TraceCheckUtils]: 69: Hoare triple {4894#(<= bor_~i~0 4)} assume !(~i~0 < 10000); {4672#false} is VALID [2018-11-23 12:26:12,603 INFO L273 TraceCheckUtils]: 70: Hoare triple {4672#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4672#false} is VALID [2018-11-23 12:26:12,604 INFO L273 TraceCheckUtils]: 71: Hoare triple {4672#false} assume true; {4672#false} is VALID [2018-11-23 12:26:12,604 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {4672#false} {4671#true} #74#return; {4672#false} is VALID [2018-11-23 12:26:12,604 INFO L273 TraceCheckUtils]: 73: Hoare triple {4672#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {4672#false} is VALID [2018-11-23 12:26:12,604 INFO L273 TraceCheckUtils]: 74: Hoare triple {4672#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {4672#false} is VALID [2018-11-23 12:26:12,604 INFO L273 TraceCheckUtils]: 75: Hoare triple {4672#false} assume !false; {4672#false} is VALID [2018-11-23 12:26:12,608 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 56 proven. 9 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-11-23 12:26:12,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:12,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2018-11-23 12:26:12,627 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2018-11-23 12:26:12,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:12,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:26:12,725 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:12,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:26:12,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:26:12,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:26:12,727 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 17 states. [2018-11-23 12:26:13,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:13,353 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2018-11-23 12:26:13,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:26:13,354 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2018-11-23 12:26:13,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:13,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:26:13,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 12:26:13,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:26:13,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 12:26:13,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 86 transitions. [2018-11-23 12:26:13,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:13,495 INFO L225 Difference]: With dead ends: 89 [2018-11-23 12:26:13,495 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:26:13,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:26:13,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:26:13,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-11-23 12:26:13,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:13,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 59 states. [2018-11-23 12:26:13,535 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 59 states. [2018-11-23 12:26:13,535 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 59 states. [2018-11-23 12:26:13,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:13,536 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-23 12:26:13,537 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-23 12:26:13,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:13,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:13,537 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 61 states. [2018-11-23 12:26:13,537 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 61 states. [2018-11-23 12:26:13,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:13,539 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-23 12:26:13,539 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-23 12:26:13,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:13,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:13,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:13,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:13,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:26:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-23 12:26:13,541 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 76 [2018-11-23 12:26:13,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:13,542 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-23 12:26:13,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:26:13,542 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-11-23 12:26:13,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-23 12:26:13,543 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:13,543 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 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-23 12:26:13,543 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:13,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:13,544 INFO L82 PathProgramCache]: Analyzing trace with hash -506591693, now seen corresponding path program 11 times [2018-11-23 12:26:13,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:13,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:13,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:13,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:13,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:14,362 INFO L256 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2018-11-23 12:26:14,363 INFO L273 TraceCheckUtils]: 1: Hoare triple {5255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5255#true} is VALID [2018-11-23 12:26:14,363 INFO L273 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:26:14,363 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #66#return; {5255#true} is VALID [2018-11-23 12:26:14,363 INFO L256 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret13 := main(); {5255#true} is VALID [2018-11-23 12:26:14,364 INFO L273 TraceCheckUtils]: 5: Hoare triple {5255#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; {5257#(= main_~i~1 0)} is VALID [2018-11-23 12:26:14,364 INFO L273 TraceCheckUtils]: 6: Hoare triple {5257#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {5257#(= main_~i~1 0)} is VALID [2018-11-23 12:26:14,365 INFO L273 TraceCheckUtils]: 7: Hoare triple {5257#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5258#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:14,365 INFO L273 TraceCheckUtils]: 8: Hoare triple {5258#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {5258#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:14,366 INFO L273 TraceCheckUtils]: 9: Hoare triple {5258#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5259#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:14,366 INFO L273 TraceCheckUtils]: 10: Hoare triple {5259#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {5259#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:14,367 INFO L273 TraceCheckUtils]: 11: Hoare triple {5259#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5260#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:14,368 INFO L273 TraceCheckUtils]: 12: Hoare triple {5260#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {5260#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:14,369 INFO L273 TraceCheckUtils]: 13: Hoare triple {5260#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5261#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:14,369 INFO L273 TraceCheckUtils]: 14: Hoare triple {5261#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {5261#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:14,370 INFO L273 TraceCheckUtils]: 15: Hoare triple {5261#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5262#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:14,371 INFO L273 TraceCheckUtils]: 16: Hoare triple {5262#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {5262#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:14,372 INFO L273 TraceCheckUtils]: 17: Hoare triple {5262#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5263#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:14,373 INFO L273 TraceCheckUtils]: 18: Hoare triple {5263#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {5263#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:14,373 INFO L273 TraceCheckUtils]: 19: Hoare triple {5263#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5264#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:14,374 INFO L273 TraceCheckUtils]: 20: Hoare triple {5264#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {5264#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:14,375 INFO L273 TraceCheckUtils]: 21: Hoare triple {5264#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5265#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:14,376 INFO L273 TraceCheckUtils]: 22: Hoare triple {5265#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {5265#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:14,377 INFO L273 TraceCheckUtils]: 23: Hoare triple {5265#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5266#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:14,394 INFO L273 TraceCheckUtils]: 24: Hoare triple {5266#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {5266#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:14,400 INFO L273 TraceCheckUtils]: 25: Hoare triple {5266#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5267#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:14,401 INFO L273 TraceCheckUtils]: 26: Hoare triple {5267#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {5267#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:14,401 INFO L273 TraceCheckUtils]: 27: Hoare triple {5267#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5268#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:14,402 INFO L273 TraceCheckUtils]: 28: Hoare triple {5268#(<= main_~i~1 11)} assume !(~i~1 < 10000); {5256#false} is VALID [2018-11-23 12:26:14,402 INFO L256 TraceCheckUtils]: 29: Hoare triple {5256#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {5255#true} is VALID [2018-11-23 12:26:14,402 INFO L273 TraceCheckUtils]: 30: Hoare triple {5255#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5255#true} is VALID [2018-11-23 12:26:14,402 INFO L273 TraceCheckUtils]: 31: Hoare triple {5255#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:26:14,402 INFO L273 TraceCheckUtils]: 32: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:26:14,402 INFO L273 TraceCheckUtils]: 33: Hoare triple {5255#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:26:14,402 INFO L273 TraceCheckUtils]: 34: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:26:14,403 INFO L273 TraceCheckUtils]: 35: Hoare triple {5255#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:26:14,403 INFO L273 TraceCheckUtils]: 36: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:26:14,403 INFO L273 TraceCheckUtils]: 37: Hoare triple {5255#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:26:14,403 INFO L273 TraceCheckUtils]: 38: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:26:14,403 INFO L273 TraceCheckUtils]: 39: Hoare triple {5255#true} assume !(~i~0 < 10000); {5255#true} is VALID [2018-11-23 12:26:14,403 INFO L273 TraceCheckUtils]: 40: Hoare triple {5255#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5255#true} is VALID [2018-11-23 12:26:14,403 INFO L273 TraceCheckUtils]: 41: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:26:14,403 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5255#true} {5256#false} #70#return; {5256#false} is VALID [2018-11-23 12:26:14,403 INFO L273 TraceCheckUtils]: 43: Hoare triple {5256#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:26:14,404 INFO L256 TraceCheckUtils]: 44: Hoare triple {5256#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {5255#true} is VALID [2018-11-23 12:26:14,404 INFO L273 TraceCheckUtils]: 45: Hoare triple {5255#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5255#true} is VALID [2018-11-23 12:26:14,404 INFO L273 TraceCheckUtils]: 46: Hoare triple {5255#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:26:14,404 INFO L273 TraceCheckUtils]: 47: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:26:14,404 INFO L273 TraceCheckUtils]: 48: Hoare triple {5255#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:26:14,404 INFO L273 TraceCheckUtils]: 49: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:26:14,404 INFO L273 TraceCheckUtils]: 50: Hoare triple {5255#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:26:14,404 INFO L273 TraceCheckUtils]: 51: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:26:14,405 INFO L273 TraceCheckUtils]: 52: Hoare triple {5255#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:26:14,405 INFO L273 TraceCheckUtils]: 53: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:26:14,405 INFO L273 TraceCheckUtils]: 54: Hoare triple {5255#true} assume !(~i~0 < 10000); {5255#true} is VALID [2018-11-23 12:26:14,405 INFO L273 TraceCheckUtils]: 55: Hoare triple {5255#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5255#true} is VALID [2018-11-23 12:26:14,405 INFO L273 TraceCheckUtils]: 56: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:26:14,405 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5255#true} {5256#false} #72#return; {5256#false} is VALID [2018-11-23 12:26:14,405 INFO L273 TraceCheckUtils]: 58: Hoare triple {5256#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {5256#false} is VALID [2018-11-23 12:26:14,405 INFO L273 TraceCheckUtils]: 59: Hoare triple {5256#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5256#false} is VALID [2018-11-23 12:26:14,405 INFO L273 TraceCheckUtils]: 60: Hoare triple {5256#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5256#false} is VALID [2018-11-23 12:26:14,406 INFO L273 TraceCheckUtils]: 61: Hoare triple {5256#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5256#false} is VALID [2018-11-23 12:26:14,406 INFO L273 TraceCheckUtils]: 62: Hoare triple {5256#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5256#false} is VALID [2018-11-23 12:26:14,406 INFO L273 TraceCheckUtils]: 63: Hoare triple {5256#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5256#false} is VALID [2018-11-23 12:26:14,406 INFO L273 TraceCheckUtils]: 64: Hoare triple {5256#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5256#false} is VALID [2018-11-23 12:26:14,406 INFO L273 TraceCheckUtils]: 65: Hoare triple {5256#false} assume !(~i~2 < 9999); {5256#false} is VALID [2018-11-23 12:26:14,406 INFO L273 TraceCheckUtils]: 66: Hoare triple {5256#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:26:14,406 INFO L256 TraceCheckUtils]: 67: Hoare triple {5256#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {5255#true} is VALID [2018-11-23 12:26:14,406 INFO L273 TraceCheckUtils]: 68: Hoare triple {5255#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5255#true} is VALID [2018-11-23 12:26:14,407 INFO L273 TraceCheckUtils]: 69: Hoare triple {5255#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:26:14,407 INFO L273 TraceCheckUtils]: 70: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:26:14,407 INFO L273 TraceCheckUtils]: 71: Hoare triple {5255#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:26:14,407 INFO L273 TraceCheckUtils]: 72: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:26:14,407 INFO L273 TraceCheckUtils]: 73: Hoare triple {5255#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:26:14,407 INFO L273 TraceCheckUtils]: 74: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:26:14,407 INFO L273 TraceCheckUtils]: 75: Hoare triple {5255#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:26:14,407 INFO L273 TraceCheckUtils]: 76: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:26:14,407 INFO L273 TraceCheckUtils]: 77: Hoare triple {5255#true} assume !(~i~0 < 10000); {5255#true} is VALID [2018-11-23 12:26:14,408 INFO L273 TraceCheckUtils]: 78: Hoare triple {5255#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5255#true} is VALID [2018-11-23 12:26:14,408 INFO L273 TraceCheckUtils]: 79: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:26:14,408 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {5255#true} {5256#false} #74#return; {5256#false} is VALID [2018-11-23 12:26:14,408 INFO L273 TraceCheckUtils]: 81: Hoare triple {5256#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5256#false} is VALID [2018-11-23 12:26:14,408 INFO L273 TraceCheckUtils]: 82: Hoare triple {5256#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5256#false} is VALID [2018-11-23 12:26:14,408 INFO L273 TraceCheckUtils]: 83: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2018-11-23 12:26:14,411 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-11-23 12:26:14,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:14,412 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:14,420 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:26:14,645 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-23 12:26:14,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:14,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:14,883 INFO L256 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2018-11-23 12:26:14,884 INFO L273 TraceCheckUtils]: 1: Hoare triple {5255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5255#true} is VALID [2018-11-23 12:26:14,884 INFO L273 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:26:14,884 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #66#return; {5255#true} is VALID [2018-11-23 12:26:14,884 INFO L256 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret13 := main(); {5255#true} is VALID [2018-11-23 12:26:14,884 INFO L273 TraceCheckUtils]: 5: Hoare triple {5255#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; {5255#true} is VALID [2018-11-23 12:26:14,885 INFO L273 TraceCheckUtils]: 6: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:26:14,885 INFO L273 TraceCheckUtils]: 7: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:26:14,885 INFO L273 TraceCheckUtils]: 8: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:26:14,885 INFO L273 TraceCheckUtils]: 9: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:26:14,886 INFO L273 TraceCheckUtils]: 10: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:26:14,886 INFO L273 TraceCheckUtils]: 11: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:26:14,886 INFO L273 TraceCheckUtils]: 12: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:26:14,886 INFO L273 TraceCheckUtils]: 13: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:26:14,886 INFO L273 TraceCheckUtils]: 14: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:26:14,886 INFO L273 TraceCheckUtils]: 15: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:26:14,886 INFO L273 TraceCheckUtils]: 16: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:26:14,886 INFO L273 TraceCheckUtils]: 17: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:26:14,887 INFO L273 TraceCheckUtils]: 18: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:26:14,887 INFO L273 TraceCheckUtils]: 19: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:26:14,887 INFO L273 TraceCheckUtils]: 20: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:26:14,887 INFO L273 TraceCheckUtils]: 21: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:26:14,887 INFO L273 TraceCheckUtils]: 22: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:26:14,887 INFO L273 TraceCheckUtils]: 23: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:26:14,887 INFO L273 TraceCheckUtils]: 24: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:26:14,887 INFO L273 TraceCheckUtils]: 25: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:26:14,888 INFO L273 TraceCheckUtils]: 26: Hoare triple {5255#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:26:14,888 INFO L273 TraceCheckUtils]: 27: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:26:14,888 INFO L273 TraceCheckUtils]: 28: Hoare triple {5255#true} assume !(~i~1 < 10000); {5255#true} is VALID [2018-11-23 12:26:14,888 INFO L256 TraceCheckUtils]: 29: Hoare triple {5255#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {5255#true} is VALID [2018-11-23 12:26:14,889 INFO L273 TraceCheckUtils]: 30: Hoare triple {5255#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5362#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:14,889 INFO L273 TraceCheckUtils]: 31: Hoare triple {5362#(<= bor_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5362#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:14,890 INFO L273 TraceCheckUtils]: 32: Hoare triple {5362#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5369#(<= bor_~i~0 2)} is VALID [2018-11-23 12:26:14,890 INFO L273 TraceCheckUtils]: 33: Hoare triple {5369#(<= bor_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5369#(<= bor_~i~0 2)} is VALID [2018-11-23 12:26:14,890 INFO L273 TraceCheckUtils]: 34: Hoare triple {5369#(<= bor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5376#(<= bor_~i~0 3)} is VALID [2018-11-23 12:26:14,891 INFO L273 TraceCheckUtils]: 35: Hoare triple {5376#(<= bor_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5376#(<= bor_~i~0 3)} is VALID [2018-11-23 12:26:14,892 INFO L273 TraceCheckUtils]: 36: Hoare triple {5376#(<= bor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5383#(<= bor_~i~0 4)} is VALID [2018-11-23 12:26:14,892 INFO L273 TraceCheckUtils]: 37: Hoare triple {5383#(<= bor_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5383#(<= bor_~i~0 4)} is VALID [2018-11-23 12:26:14,893 INFO L273 TraceCheckUtils]: 38: Hoare triple {5383#(<= bor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5390#(<= bor_~i~0 5)} is VALID [2018-11-23 12:26:14,894 INFO L273 TraceCheckUtils]: 39: Hoare triple {5390#(<= bor_~i~0 5)} assume !(~i~0 < 10000); {5256#false} is VALID [2018-11-23 12:26:14,894 INFO L273 TraceCheckUtils]: 40: Hoare triple {5256#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5256#false} is VALID [2018-11-23 12:26:14,895 INFO L273 TraceCheckUtils]: 41: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:26:14,895 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5256#false} {5255#true} #70#return; {5256#false} is VALID [2018-11-23 12:26:14,895 INFO L273 TraceCheckUtils]: 43: Hoare triple {5256#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:26:14,895 INFO L256 TraceCheckUtils]: 44: Hoare triple {5256#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {5256#false} is VALID [2018-11-23 12:26:14,895 INFO L273 TraceCheckUtils]: 45: Hoare triple {5256#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5256#false} is VALID [2018-11-23 12:26:14,896 INFO L273 TraceCheckUtils]: 46: Hoare triple {5256#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:26:14,896 INFO L273 TraceCheckUtils]: 47: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:26:14,896 INFO L273 TraceCheckUtils]: 48: Hoare triple {5256#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:26:14,896 INFO L273 TraceCheckUtils]: 49: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:26:14,896 INFO L273 TraceCheckUtils]: 50: Hoare triple {5256#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:26:14,897 INFO L273 TraceCheckUtils]: 51: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:26:14,897 INFO L273 TraceCheckUtils]: 52: Hoare triple {5256#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:26:14,897 INFO L273 TraceCheckUtils]: 53: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:26:14,897 INFO L273 TraceCheckUtils]: 54: Hoare triple {5256#false} assume !(~i~0 < 10000); {5256#false} is VALID [2018-11-23 12:26:14,897 INFO L273 TraceCheckUtils]: 55: Hoare triple {5256#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5256#false} is VALID [2018-11-23 12:26:14,898 INFO L273 TraceCheckUtils]: 56: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:26:14,898 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5256#false} {5256#false} #72#return; {5256#false} is VALID [2018-11-23 12:26:14,898 INFO L273 TraceCheckUtils]: 58: Hoare triple {5256#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {5256#false} is VALID [2018-11-23 12:26:14,898 INFO L273 TraceCheckUtils]: 59: Hoare triple {5256#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5256#false} is VALID [2018-11-23 12:26:14,898 INFO L273 TraceCheckUtils]: 60: Hoare triple {5256#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5256#false} is VALID [2018-11-23 12:26:14,899 INFO L273 TraceCheckUtils]: 61: Hoare triple {5256#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5256#false} is VALID [2018-11-23 12:26:14,899 INFO L273 TraceCheckUtils]: 62: Hoare triple {5256#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5256#false} is VALID [2018-11-23 12:26:14,899 INFO L273 TraceCheckUtils]: 63: Hoare triple {5256#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5256#false} is VALID [2018-11-23 12:26:14,899 INFO L273 TraceCheckUtils]: 64: Hoare triple {5256#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5256#false} is VALID [2018-11-23 12:26:14,899 INFO L273 TraceCheckUtils]: 65: Hoare triple {5256#false} assume !(~i~2 < 9999); {5256#false} is VALID [2018-11-23 12:26:14,900 INFO L273 TraceCheckUtils]: 66: Hoare triple {5256#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:26:14,900 INFO L256 TraceCheckUtils]: 67: Hoare triple {5256#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {5256#false} is VALID [2018-11-23 12:26:14,900 INFO L273 TraceCheckUtils]: 68: Hoare triple {5256#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5256#false} is VALID [2018-11-23 12:26:14,900 INFO L273 TraceCheckUtils]: 69: Hoare triple {5256#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:26:14,900 INFO L273 TraceCheckUtils]: 70: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:26:14,900 INFO L273 TraceCheckUtils]: 71: Hoare triple {5256#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:26:14,900 INFO L273 TraceCheckUtils]: 72: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:26:14,901 INFO L273 TraceCheckUtils]: 73: Hoare triple {5256#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:26:14,901 INFO L273 TraceCheckUtils]: 74: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:26:14,901 INFO L273 TraceCheckUtils]: 75: Hoare triple {5256#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:26:14,901 INFO L273 TraceCheckUtils]: 76: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:26:14,901 INFO L273 TraceCheckUtils]: 77: Hoare triple {5256#false} assume !(~i~0 < 10000); {5256#false} is VALID [2018-11-23 12:26:14,901 INFO L273 TraceCheckUtils]: 78: Hoare triple {5256#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5256#false} is VALID [2018-11-23 12:26:14,901 INFO L273 TraceCheckUtils]: 79: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:26:14,901 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {5256#false} {5256#false} #74#return; {5256#false} is VALID [2018-11-23 12:26:14,901 INFO L273 TraceCheckUtils]: 81: Hoare triple {5256#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5256#false} is VALID [2018-11-23 12:26:14,902 INFO L273 TraceCheckUtils]: 82: Hoare triple {5256#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5256#false} is VALID [2018-11-23 12:26:14,902 INFO L273 TraceCheckUtils]: 83: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2018-11-23 12:26:14,905 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 84 proven. 16 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-11-23 12:26:14,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:14,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2018-11-23 12:26:14,926 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-11-23 12:26:14,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:14,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:26:15,027 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-23 12:26:15,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:26:15,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:26:15,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:26:15,028 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 19 states. [2018-11-23 12:26:15,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:15,664 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2018-11-23 12:26:15,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:26:15,664 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-11-23 12:26:15,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:15,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:26:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2018-11-23 12:26:15,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:26:15,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2018-11-23 12:26:15,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 90 transitions. [2018-11-23 12:26:16,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:16,483 INFO L225 Difference]: With dead ends: 95 [2018-11-23 12:26:16,483 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 12:26:16,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:26:16,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 12:26:16,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-11-23 12:26:16,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:16,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 63 states. [2018-11-23 12:26:16,525 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 63 states. [2018-11-23 12:26:16,525 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 63 states. [2018-11-23 12:26:16,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:16,528 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-23 12:26:16,528 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 12:26:16,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:16,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:16,529 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 65 states. [2018-11-23 12:26:16,529 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 65 states. [2018-11-23 12:26:16,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:16,531 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-23 12:26:16,531 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 12:26:16,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:16,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:16,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:16,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:16,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 12:26:16,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-11-23 12:26:16,534 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 84 [2018-11-23 12:26:16,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:16,534 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-11-23 12:26:16,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:26:16,535 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-23 12:26:16,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-23 12:26:16,536 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:16,536 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 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-23 12:26:16,536 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:16,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:16,536 INFO L82 PathProgramCache]: Analyzing trace with hash -416573805, now seen corresponding path program 12 times [2018-11-23 12:26:16,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:16,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:16,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:16,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:16,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:17,917 INFO L256 TraceCheckUtils]: 0: Hoare triple {5888#true} call ULTIMATE.init(); {5888#true} is VALID [2018-11-23 12:26:17,917 INFO L273 TraceCheckUtils]: 1: Hoare triple {5888#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5888#true} is VALID [2018-11-23 12:26:17,917 INFO L273 TraceCheckUtils]: 2: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:26:17,918 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5888#true} {5888#true} #66#return; {5888#true} is VALID [2018-11-23 12:26:17,918 INFO L256 TraceCheckUtils]: 4: Hoare triple {5888#true} call #t~ret13 := main(); {5888#true} is VALID [2018-11-23 12:26:17,918 INFO L273 TraceCheckUtils]: 5: Hoare triple {5888#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; {5890#(= main_~i~1 0)} is VALID [2018-11-23 12:26:17,919 INFO L273 TraceCheckUtils]: 6: Hoare triple {5890#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {5890#(= main_~i~1 0)} is VALID [2018-11-23 12:26:17,920 INFO L273 TraceCheckUtils]: 7: Hoare triple {5890#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5891#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:17,921 INFO L273 TraceCheckUtils]: 8: Hoare triple {5891#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {5891#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:17,922 INFO L273 TraceCheckUtils]: 9: Hoare triple {5891#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5892#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:17,922 INFO L273 TraceCheckUtils]: 10: Hoare triple {5892#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {5892#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:17,923 INFO L273 TraceCheckUtils]: 11: Hoare triple {5892#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5893#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:17,924 INFO L273 TraceCheckUtils]: 12: Hoare triple {5893#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {5893#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:17,925 INFO L273 TraceCheckUtils]: 13: Hoare triple {5893#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5894#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:17,926 INFO L273 TraceCheckUtils]: 14: Hoare triple {5894#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {5894#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:17,927 INFO L273 TraceCheckUtils]: 15: Hoare triple {5894#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5895#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:17,927 INFO L273 TraceCheckUtils]: 16: Hoare triple {5895#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {5895#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:17,928 INFO L273 TraceCheckUtils]: 17: Hoare triple {5895#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5896#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:17,929 INFO L273 TraceCheckUtils]: 18: Hoare triple {5896#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {5896#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:17,930 INFO L273 TraceCheckUtils]: 19: Hoare triple {5896#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5897#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:17,931 INFO L273 TraceCheckUtils]: 20: Hoare triple {5897#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {5897#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:17,931 INFO L273 TraceCheckUtils]: 21: Hoare triple {5897#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5898#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:17,932 INFO L273 TraceCheckUtils]: 22: Hoare triple {5898#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {5898#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:17,933 INFO L273 TraceCheckUtils]: 23: Hoare triple {5898#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5899#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:17,934 INFO L273 TraceCheckUtils]: 24: Hoare triple {5899#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {5899#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:17,935 INFO L273 TraceCheckUtils]: 25: Hoare triple {5899#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5900#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:17,935 INFO L273 TraceCheckUtils]: 26: Hoare triple {5900#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {5900#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:17,936 INFO L273 TraceCheckUtils]: 27: Hoare triple {5900#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5901#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:17,937 INFO L273 TraceCheckUtils]: 28: Hoare triple {5901#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {5901#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:17,938 INFO L273 TraceCheckUtils]: 29: Hoare triple {5901#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5902#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:17,939 INFO L273 TraceCheckUtils]: 30: Hoare triple {5902#(<= main_~i~1 12)} assume !(~i~1 < 10000); {5889#false} is VALID [2018-11-23 12:26:17,939 INFO L256 TraceCheckUtils]: 31: Hoare triple {5889#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:26:17,939 INFO L273 TraceCheckUtils]: 32: Hoare triple {5888#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5888#true} is VALID [2018-11-23 12:26:17,939 INFO L273 TraceCheckUtils]: 33: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:17,939 INFO L273 TraceCheckUtils]: 34: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:17,940 INFO L273 TraceCheckUtils]: 35: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:17,940 INFO L273 TraceCheckUtils]: 36: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:17,940 INFO L273 TraceCheckUtils]: 37: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:17,940 INFO L273 TraceCheckUtils]: 38: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:17,941 INFO L273 TraceCheckUtils]: 39: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:17,941 INFO L273 TraceCheckUtils]: 40: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:17,941 INFO L273 TraceCheckUtils]: 41: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:17,941 INFO L273 TraceCheckUtils]: 42: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:17,941 INFO L273 TraceCheckUtils]: 43: Hoare triple {5888#true} assume !(~i~0 < 10000); {5888#true} is VALID [2018-11-23 12:26:17,942 INFO L273 TraceCheckUtils]: 44: Hoare triple {5888#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:26:17,942 INFO L273 TraceCheckUtils]: 45: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:26:17,942 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5888#true} {5889#false} #70#return; {5889#false} is VALID [2018-11-23 12:26:17,942 INFO L273 TraceCheckUtils]: 47: Hoare triple {5889#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5889#false} is VALID [2018-11-23 12:26:17,942 INFO L256 TraceCheckUtils]: 48: Hoare triple {5889#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:26:17,943 INFO L273 TraceCheckUtils]: 49: Hoare triple {5888#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5888#true} is VALID [2018-11-23 12:26:17,943 INFO L273 TraceCheckUtils]: 50: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:17,943 INFO L273 TraceCheckUtils]: 51: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:17,943 INFO L273 TraceCheckUtils]: 52: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:17,943 INFO L273 TraceCheckUtils]: 53: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:17,944 INFO L273 TraceCheckUtils]: 54: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:17,944 INFO L273 TraceCheckUtils]: 55: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:17,944 INFO L273 TraceCheckUtils]: 56: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:17,944 INFO L273 TraceCheckUtils]: 57: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:17,944 INFO L273 TraceCheckUtils]: 58: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:17,944 INFO L273 TraceCheckUtils]: 59: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:17,944 INFO L273 TraceCheckUtils]: 60: Hoare triple {5888#true} assume !(~i~0 < 10000); {5888#true} is VALID [2018-11-23 12:26:17,944 INFO L273 TraceCheckUtils]: 61: Hoare triple {5888#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:26:17,945 INFO L273 TraceCheckUtils]: 62: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:26:17,945 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5888#true} {5889#false} #72#return; {5889#false} is VALID [2018-11-23 12:26:17,945 INFO L273 TraceCheckUtils]: 64: Hoare triple {5889#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {5889#false} is VALID [2018-11-23 12:26:17,945 INFO L273 TraceCheckUtils]: 65: Hoare triple {5889#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5889#false} is VALID [2018-11-23 12:26:17,945 INFO L273 TraceCheckUtils]: 66: Hoare triple {5889#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5889#false} is VALID [2018-11-23 12:26:17,945 INFO L273 TraceCheckUtils]: 67: Hoare triple {5889#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5889#false} is VALID [2018-11-23 12:26:17,945 INFO L273 TraceCheckUtils]: 68: Hoare triple {5889#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5889#false} is VALID [2018-11-23 12:26:17,945 INFO L273 TraceCheckUtils]: 69: Hoare triple {5889#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5889#false} is VALID [2018-11-23 12:26:17,945 INFO L273 TraceCheckUtils]: 70: Hoare triple {5889#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5889#false} is VALID [2018-11-23 12:26:17,946 INFO L273 TraceCheckUtils]: 71: Hoare triple {5889#false} assume !(~i~2 < 9999); {5889#false} is VALID [2018-11-23 12:26:17,946 INFO L273 TraceCheckUtils]: 72: Hoare triple {5889#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {5889#false} is VALID [2018-11-23 12:26:17,946 INFO L256 TraceCheckUtils]: 73: Hoare triple {5889#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:26:17,946 INFO L273 TraceCheckUtils]: 74: Hoare triple {5888#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5888#true} is VALID [2018-11-23 12:26:17,946 INFO L273 TraceCheckUtils]: 75: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:17,946 INFO L273 TraceCheckUtils]: 76: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:17,946 INFO L273 TraceCheckUtils]: 77: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:17,946 INFO L273 TraceCheckUtils]: 78: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:17,947 INFO L273 TraceCheckUtils]: 79: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:17,947 INFO L273 TraceCheckUtils]: 80: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:17,947 INFO L273 TraceCheckUtils]: 81: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:17,947 INFO L273 TraceCheckUtils]: 82: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:17,947 INFO L273 TraceCheckUtils]: 83: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:17,947 INFO L273 TraceCheckUtils]: 84: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:17,947 INFO L273 TraceCheckUtils]: 85: Hoare triple {5888#true} assume !(~i~0 < 10000); {5888#true} is VALID [2018-11-23 12:26:17,947 INFO L273 TraceCheckUtils]: 86: Hoare triple {5888#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:26:17,947 INFO L273 TraceCheckUtils]: 87: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:26:17,948 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {5888#true} {5889#false} #74#return; {5889#false} is VALID [2018-11-23 12:26:17,948 INFO L273 TraceCheckUtils]: 89: Hoare triple {5889#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5889#false} is VALID [2018-11-23 12:26:17,948 INFO L273 TraceCheckUtils]: 90: Hoare triple {5889#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5889#false} is VALID [2018-11-23 12:26:17,948 INFO L273 TraceCheckUtils]: 91: Hoare triple {5889#false} assume !false; {5889#false} is VALID [2018-11-23 12:26:17,952 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-11-23 12:26:17,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:17,952 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:17,962 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:26:18,106 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-23 12:26:18,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:18,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:18,384 INFO L256 TraceCheckUtils]: 0: Hoare triple {5888#true} call ULTIMATE.init(); {5888#true} is VALID [2018-11-23 12:26:18,384 INFO L273 TraceCheckUtils]: 1: Hoare triple {5888#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5888#true} is VALID [2018-11-23 12:26:18,384 INFO L273 TraceCheckUtils]: 2: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:26:18,385 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5888#true} {5888#true} #66#return; {5888#true} is VALID [2018-11-23 12:26:18,385 INFO L256 TraceCheckUtils]: 4: Hoare triple {5888#true} call #t~ret13 := main(); {5888#true} is VALID [2018-11-23 12:26:18,385 INFO L273 TraceCheckUtils]: 5: Hoare triple {5888#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; {5888#true} is VALID [2018-11-23 12:26:18,385 INFO L273 TraceCheckUtils]: 6: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:26:18,385 INFO L273 TraceCheckUtils]: 7: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:26:18,385 INFO L273 TraceCheckUtils]: 8: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:26:18,385 INFO L273 TraceCheckUtils]: 9: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:26:18,385 INFO L273 TraceCheckUtils]: 10: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:26:18,386 INFO L273 TraceCheckUtils]: 11: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:26:18,386 INFO L273 TraceCheckUtils]: 12: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:26:18,386 INFO L273 TraceCheckUtils]: 13: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:26:18,386 INFO L273 TraceCheckUtils]: 14: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:26:18,386 INFO L273 TraceCheckUtils]: 15: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:26:18,386 INFO L273 TraceCheckUtils]: 16: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:26:18,386 INFO L273 TraceCheckUtils]: 17: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:26:18,386 INFO L273 TraceCheckUtils]: 18: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:26:18,387 INFO L273 TraceCheckUtils]: 19: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:26:18,387 INFO L273 TraceCheckUtils]: 20: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:26:18,387 INFO L273 TraceCheckUtils]: 21: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:26:18,387 INFO L273 TraceCheckUtils]: 22: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:26:18,387 INFO L273 TraceCheckUtils]: 23: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:26:18,387 INFO L273 TraceCheckUtils]: 24: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:26:18,387 INFO L273 TraceCheckUtils]: 25: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:26:18,387 INFO L273 TraceCheckUtils]: 26: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:26:18,387 INFO L273 TraceCheckUtils]: 27: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:26:18,388 INFO L273 TraceCheckUtils]: 28: Hoare triple {5888#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:26:18,388 INFO L273 TraceCheckUtils]: 29: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:26:18,388 INFO L273 TraceCheckUtils]: 30: Hoare triple {5888#true} assume !(~i~1 < 10000); {5888#true} is VALID [2018-11-23 12:26:18,388 INFO L256 TraceCheckUtils]: 31: Hoare triple {5888#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:26:18,388 INFO L273 TraceCheckUtils]: 32: Hoare triple {5888#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5888#true} is VALID [2018-11-23 12:26:18,388 INFO L273 TraceCheckUtils]: 33: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:18,388 INFO L273 TraceCheckUtils]: 34: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:18,388 INFO L273 TraceCheckUtils]: 35: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:18,388 INFO L273 TraceCheckUtils]: 36: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:18,389 INFO L273 TraceCheckUtils]: 37: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:18,389 INFO L273 TraceCheckUtils]: 38: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:18,389 INFO L273 TraceCheckUtils]: 39: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:18,389 INFO L273 TraceCheckUtils]: 40: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:18,389 INFO L273 TraceCheckUtils]: 41: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:18,389 INFO L273 TraceCheckUtils]: 42: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:18,389 INFO L273 TraceCheckUtils]: 43: Hoare triple {5888#true} assume !(~i~0 < 10000); {5888#true} is VALID [2018-11-23 12:26:18,389 INFO L273 TraceCheckUtils]: 44: Hoare triple {5888#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:26:18,390 INFO L273 TraceCheckUtils]: 45: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:26:18,390 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5888#true} {5888#true} #70#return; {5888#true} is VALID [2018-11-23 12:26:18,390 INFO L273 TraceCheckUtils]: 47: Hoare triple {5888#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5888#true} is VALID [2018-11-23 12:26:18,390 INFO L256 TraceCheckUtils]: 48: Hoare triple {5888#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:26:18,390 INFO L273 TraceCheckUtils]: 49: Hoare triple {5888#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5888#true} is VALID [2018-11-23 12:26:18,390 INFO L273 TraceCheckUtils]: 50: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:18,390 INFO L273 TraceCheckUtils]: 51: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:18,390 INFO L273 TraceCheckUtils]: 52: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:18,390 INFO L273 TraceCheckUtils]: 53: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:18,391 INFO L273 TraceCheckUtils]: 54: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:18,391 INFO L273 TraceCheckUtils]: 55: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:18,391 INFO L273 TraceCheckUtils]: 56: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:18,391 INFO L273 TraceCheckUtils]: 57: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:18,391 INFO L273 TraceCheckUtils]: 58: Hoare triple {5888#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:18,391 INFO L273 TraceCheckUtils]: 59: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:18,391 INFO L273 TraceCheckUtils]: 60: Hoare triple {5888#true} assume !(~i~0 < 10000); {5888#true} is VALID [2018-11-23 12:26:18,391 INFO L273 TraceCheckUtils]: 61: Hoare triple {5888#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:26:18,392 INFO L273 TraceCheckUtils]: 62: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:26:18,392 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5888#true} {5888#true} #72#return; {5888#true} is VALID [2018-11-23 12:26:18,392 INFO L273 TraceCheckUtils]: 64: Hoare triple {5888#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {6098#(<= main_~i~2 0)} is VALID [2018-11-23 12:26:18,393 INFO L273 TraceCheckUtils]: 65: Hoare triple {6098#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6098#(<= main_~i~2 0)} is VALID [2018-11-23 12:26:18,393 INFO L273 TraceCheckUtils]: 66: Hoare triple {6098#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6105#(<= main_~i~2 1)} is VALID [2018-11-23 12:26:18,394 INFO L273 TraceCheckUtils]: 67: Hoare triple {6105#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6105#(<= main_~i~2 1)} is VALID [2018-11-23 12:26:18,394 INFO L273 TraceCheckUtils]: 68: Hoare triple {6105#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6112#(<= main_~i~2 2)} is VALID [2018-11-23 12:26:18,395 INFO L273 TraceCheckUtils]: 69: Hoare triple {6112#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6112#(<= main_~i~2 2)} is VALID [2018-11-23 12:26:18,395 INFO L273 TraceCheckUtils]: 70: Hoare triple {6112#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6119#(<= main_~i~2 3)} is VALID [2018-11-23 12:26:18,396 INFO L273 TraceCheckUtils]: 71: Hoare triple {6119#(<= main_~i~2 3)} assume !(~i~2 < 9999); {5889#false} is VALID [2018-11-23 12:26:18,396 INFO L273 TraceCheckUtils]: 72: Hoare triple {5889#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {5889#false} is VALID [2018-11-23 12:26:18,396 INFO L256 TraceCheckUtils]: 73: Hoare triple {5889#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {5889#false} is VALID [2018-11-23 12:26:18,396 INFO L273 TraceCheckUtils]: 74: Hoare triple {5889#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5889#false} is VALID [2018-11-23 12:26:18,396 INFO L273 TraceCheckUtils]: 75: Hoare triple {5889#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5889#false} is VALID [2018-11-23 12:26:18,396 INFO L273 TraceCheckUtils]: 76: Hoare triple {5889#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5889#false} is VALID [2018-11-23 12:26:18,397 INFO L273 TraceCheckUtils]: 77: Hoare triple {5889#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5889#false} is VALID [2018-11-23 12:26:18,397 INFO L273 TraceCheckUtils]: 78: Hoare triple {5889#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5889#false} is VALID [2018-11-23 12:26:18,397 INFO L273 TraceCheckUtils]: 79: Hoare triple {5889#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5889#false} is VALID [2018-11-23 12:26:18,397 INFO L273 TraceCheckUtils]: 80: Hoare triple {5889#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5889#false} is VALID [2018-11-23 12:26:18,398 INFO L273 TraceCheckUtils]: 81: Hoare triple {5889#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5889#false} is VALID [2018-11-23 12:26:18,398 INFO L273 TraceCheckUtils]: 82: Hoare triple {5889#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5889#false} is VALID [2018-11-23 12:26:18,398 INFO L273 TraceCheckUtils]: 83: Hoare triple {5889#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5889#false} is VALID [2018-11-23 12:26:18,399 INFO L273 TraceCheckUtils]: 84: Hoare triple {5889#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5889#false} is VALID [2018-11-23 12:26:18,399 INFO L273 TraceCheckUtils]: 85: Hoare triple {5889#false} assume !(~i~0 < 10000); {5889#false} is VALID [2018-11-23 12:26:18,399 INFO L273 TraceCheckUtils]: 86: Hoare triple {5889#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5889#false} is VALID [2018-11-23 12:26:18,399 INFO L273 TraceCheckUtils]: 87: Hoare triple {5889#false} assume true; {5889#false} is VALID [2018-11-23 12:26:18,400 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {5889#false} {5889#false} #74#return; {5889#false} is VALID [2018-11-23 12:26:18,400 INFO L273 TraceCheckUtils]: 89: Hoare triple {5889#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5889#false} is VALID [2018-11-23 12:26:18,400 INFO L273 TraceCheckUtils]: 90: Hoare triple {5889#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5889#false} is VALID [2018-11-23 12:26:18,400 INFO L273 TraceCheckUtils]: 91: Hoare triple {5889#false} assume !false; {5889#false} is VALID [2018-11-23 12:26:18,404 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 130 proven. 9 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2018-11-23 12:26:18,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:18,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2018-11-23 12:26:18,426 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 12:26:18,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:18,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:26:18,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:18,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:26:18,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:26:18,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:26:18,533 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 19 states. [2018-11-23 12:26:19,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:19,291 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-11-23 12:26:19,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:26:19,291 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 12:26:19,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:19,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:26:19,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2018-11-23 12:26:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:26:19,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2018-11-23 12:26:19,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 87 transitions. [2018-11-23 12:26:19,774 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-23 12:26:19,776 INFO L225 Difference]: With dead ends: 101 [2018-11-23 12:26:19,777 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 12:26:19,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:26:19,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 12:26:19,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-23 12:26:19,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:19,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 67 states. [2018-11-23 12:26:19,815 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 67 states. [2018-11-23 12:26:19,815 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 67 states. [2018-11-23 12:26:19,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:19,818 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 12:26:19,818 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:26:19,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:19,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:19,818 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 69 states. [2018-11-23 12:26:19,819 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 69 states. [2018-11-23 12:26:19,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:19,820 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 12:26:19,821 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:26:19,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:19,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:19,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:19,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:19,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 12:26:19,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-23 12:26:19,823 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 92 [2018-11-23 12:26:19,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:19,823 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-23 12:26:19,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:26:19,823 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 12:26:19,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 12:26:19,824 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:19,824 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 13, 13, 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-23 12:26:19,825 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:19,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:19,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1508563187, now seen corresponding path program 13 times [2018-11-23 12:26:19,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:19,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:19,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:19,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:19,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:20,621 INFO L256 TraceCheckUtils]: 0: Hoare triple {6568#true} call ULTIMATE.init(); {6568#true} is VALID [2018-11-23 12:26:20,621 INFO L273 TraceCheckUtils]: 1: Hoare triple {6568#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6568#true} is VALID [2018-11-23 12:26:20,622 INFO L273 TraceCheckUtils]: 2: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:26:20,622 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6568#true} {6568#true} #66#return; {6568#true} is VALID [2018-11-23 12:26:20,622 INFO L256 TraceCheckUtils]: 4: Hoare triple {6568#true} call #t~ret13 := main(); {6568#true} is VALID [2018-11-23 12:26:20,623 INFO L273 TraceCheckUtils]: 5: Hoare triple {6568#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; {6570#(= main_~i~1 0)} is VALID [2018-11-23 12:26:20,623 INFO L273 TraceCheckUtils]: 6: Hoare triple {6570#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {6570#(= main_~i~1 0)} is VALID [2018-11-23 12:26:20,624 INFO L273 TraceCheckUtils]: 7: Hoare triple {6570#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6571#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:20,625 INFO L273 TraceCheckUtils]: 8: Hoare triple {6571#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {6571#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:20,625 INFO L273 TraceCheckUtils]: 9: Hoare triple {6571#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6572#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:20,625 INFO L273 TraceCheckUtils]: 10: Hoare triple {6572#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {6572#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:20,626 INFO L273 TraceCheckUtils]: 11: Hoare triple {6572#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6573#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:20,627 INFO L273 TraceCheckUtils]: 12: Hoare triple {6573#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {6573#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:20,628 INFO L273 TraceCheckUtils]: 13: Hoare triple {6573#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6574#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:20,629 INFO L273 TraceCheckUtils]: 14: Hoare triple {6574#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {6574#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:20,629 INFO L273 TraceCheckUtils]: 15: Hoare triple {6574#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6575#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:20,630 INFO L273 TraceCheckUtils]: 16: Hoare triple {6575#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {6575#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:20,631 INFO L273 TraceCheckUtils]: 17: Hoare triple {6575#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6576#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:20,632 INFO L273 TraceCheckUtils]: 18: Hoare triple {6576#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {6576#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:20,633 INFO L273 TraceCheckUtils]: 19: Hoare triple {6576#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6577#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:20,633 INFO L273 TraceCheckUtils]: 20: Hoare triple {6577#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {6577#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:20,634 INFO L273 TraceCheckUtils]: 21: Hoare triple {6577#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6578#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:20,635 INFO L273 TraceCheckUtils]: 22: Hoare triple {6578#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {6578#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:20,636 INFO L273 TraceCheckUtils]: 23: Hoare triple {6578#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6579#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:20,636 INFO L273 TraceCheckUtils]: 24: Hoare triple {6579#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {6579#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:20,637 INFO L273 TraceCheckUtils]: 25: Hoare triple {6579#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6580#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:20,638 INFO L273 TraceCheckUtils]: 26: Hoare triple {6580#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {6580#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:20,639 INFO L273 TraceCheckUtils]: 27: Hoare triple {6580#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6581#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:20,640 INFO L273 TraceCheckUtils]: 28: Hoare triple {6581#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {6581#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:20,640 INFO L273 TraceCheckUtils]: 29: Hoare triple {6581#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6582#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:20,641 INFO L273 TraceCheckUtils]: 30: Hoare triple {6582#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {6582#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:20,642 INFO L273 TraceCheckUtils]: 31: Hoare triple {6582#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6583#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:20,643 INFO L273 TraceCheckUtils]: 32: Hoare triple {6583#(<= main_~i~1 13)} assume !(~i~1 < 10000); {6569#false} is VALID [2018-11-23 12:26:20,643 INFO L256 TraceCheckUtils]: 33: Hoare triple {6569#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {6568#true} is VALID [2018-11-23 12:26:20,643 INFO L273 TraceCheckUtils]: 34: Hoare triple {6568#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6568#true} is VALID [2018-11-23 12:26:20,644 INFO L273 TraceCheckUtils]: 35: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:20,644 INFO L273 TraceCheckUtils]: 36: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:20,644 INFO L273 TraceCheckUtils]: 37: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:20,644 INFO L273 TraceCheckUtils]: 38: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:20,644 INFO L273 TraceCheckUtils]: 39: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:20,645 INFO L273 TraceCheckUtils]: 40: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:20,645 INFO L273 TraceCheckUtils]: 41: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:20,645 INFO L273 TraceCheckUtils]: 42: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:20,645 INFO L273 TraceCheckUtils]: 43: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:20,645 INFO L273 TraceCheckUtils]: 44: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:20,646 INFO L273 TraceCheckUtils]: 45: Hoare triple {6568#true} assume !(~i~0 < 10000); {6568#true} is VALID [2018-11-23 12:26:20,646 INFO L273 TraceCheckUtils]: 46: Hoare triple {6568#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6568#true} is VALID [2018-11-23 12:26:20,646 INFO L273 TraceCheckUtils]: 47: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:26:20,646 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {6568#true} {6569#false} #70#return; {6569#false} is VALID [2018-11-23 12:26:20,646 INFO L273 TraceCheckUtils]: 49: Hoare triple {6569#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:26:20,647 INFO L256 TraceCheckUtils]: 50: Hoare triple {6569#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {6568#true} is VALID [2018-11-23 12:26:20,647 INFO L273 TraceCheckUtils]: 51: Hoare triple {6568#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6568#true} is VALID [2018-11-23 12:26:20,647 INFO L273 TraceCheckUtils]: 52: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:20,647 INFO L273 TraceCheckUtils]: 53: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:20,647 INFO L273 TraceCheckUtils]: 54: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:20,648 INFO L273 TraceCheckUtils]: 55: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:20,648 INFO L273 TraceCheckUtils]: 56: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:20,648 INFO L273 TraceCheckUtils]: 57: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:20,648 INFO L273 TraceCheckUtils]: 58: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:20,648 INFO L273 TraceCheckUtils]: 59: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:20,648 INFO L273 TraceCheckUtils]: 60: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:20,648 INFO L273 TraceCheckUtils]: 61: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:20,649 INFO L273 TraceCheckUtils]: 62: Hoare triple {6568#true} assume !(~i~0 < 10000); {6568#true} is VALID [2018-11-23 12:26:20,649 INFO L273 TraceCheckUtils]: 63: Hoare triple {6568#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6568#true} is VALID [2018-11-23 12:26:20,649 INFO L273 TraceCheckUtils]: 64: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:26:20,649 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {6568#true} {6569#false} #72#return; {6569#false} is VALID [2018-11-23 12:26:20,649 INFO L273 TraceCheckUtils]: 66: Hoare triple {6569#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {6569#false} is VALID [2018-11-23 12:26:20,649 INFO L273 TraceCheckUtils]: 67: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:26:20,649 INFO L273 TraceCheckUtils]: 68: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:26:20,649 INFO L273 TraceCheckUtils]: 69: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:26:20,649 INFO L273 TraceCheckUtils]: 70: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:26:20,650 INFO L273 TraceCheckUtils]: 71: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:26:20,650 INFO L273 TraceCheckUtils]: 72: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:26:20,650 INFO L273 TraceCheckUtils]: 73: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:26:20,650 INFO L273 TraceCheckUtils]: 74: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:26:20,650 INFO L273 TraceCheckUtils]: 75: Hoare triple {6569#false} assume !(~i~2 < 9999); {6569#false} is VALID [2018-11-23 12:26:20,650 INFO L273 TraceCheckUtils]: 76: Hoare triple {6569#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:26:20,650 INFO L256 TraceCheckUtils]: 77: Hoare triple {6569#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {6568#true} is VALID [2018-11-23 12:26:20,650 INFO L273 TraceCheckUtils]: 78: Hoare triple {6568#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6568#true} is VALID [2018-11-23 12:26:20,651 INFO L273 TraceCheckUtils]: 79: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:20,651 INFO L273 TraceCheckUtils]: 80: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:20,651 INFO L273 TraceCheckUtils]: 81: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:20,651 INFO L273 TraceCheckUtils]: 82: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:20,651 INFO L273 TraceCheckUtils]: 83: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:20,651 INFO L273 TraceCheckUtils]: 84: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:20,651 INFO L273 TraceCheckUtils]: 85: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:20,651 INFO L273 TraceCheckUtils]: 86: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:20,652 INFO L273 TraceCheckUtils]: 87: Hoare triple {6568#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:20,652 INFO L273 TraceCheckUtils]: 88: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:20,652 INFO L273 TraceCheckUtils]: 89: Hoare triple {6568#true} assume !(~i~0 < 10000); {6568#true} is VALID [2018-11-23 12:26:20,652 INFO L273 TraceCheckUtils]: 90: Hoare triple {6568#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6568#true} is VALID [2018-11-23 12:26:20,652 INFO L273 TraceCheckUtils]: 91: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:26:20,652 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {6568#true} {6569#false} #74#return; {6569#false} is VALID [2018-11-23 12:26:20,652 INFO L273 TraceCheckUtils]: 93: Hoare triple {6569#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {6569#false} is VALID [2018-11-23 12:26:20,652 INFO L273 TraceCheckUtils]: 94: Hoare triple {6569#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {6569#false} is VALID [2018-11-23 12:26:20,652 INFO L273 TraceCheckUtils]: 95: Hoare triple {6569#false} assume !false; {6569#false} is VALID [2018-11-23 12:26:20,657 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-11-23 12:26:20,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:20,657 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:20,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:20,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:21,123 INFO L256 TraceCheckUtils]: 0: Hoare triple {6568#true} call ULTIMATE.init(); {6568#true} is VALID [2018-11-23 12:26:21,124 INFO L273 TraceCheckUtils]: 1: Hoare triple {6568#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6568#true} is VALID [2018-11-23 12:26:21,124 INFO L273 TraceCheckUtils]: 2: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:26:21,124 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6568#true} {6568#true} #66#return; {6568#true} is VALID [2018-11-23 12:26:21,125 INFO L256 TraceCheckUtils]: 4: Hoare triple {6568#true} call #t~ret13 := main(); {6568#true} is VALID [2018-11-23 12:26:21,126 INFO L273 TraceCheckUtils]: 5: Hoare triple {6568#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; {6602#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:21,126 INFO L273 TraceCheckUtils]: 6: Hoare triple {6602#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {6602#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:21,127 INFO L273 TraceCheckUtils]: 7: Hoare triple {6602#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6571#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:21,128 INFO L273 TraceCheckUtils]: 8: Hoare triple {6571#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {6571#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:21,129 INFO L273 TraceCheckUtils]: 9: Hoare triple {6571#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6572#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:21,130 INFO L273 TraceCheckUtils]: 10: Hoare triple {6572#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {6572#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:21,131 INFO L273 TraceCheckUtils]: 11: Hoare triple {6572#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6573#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:21,132 INFO L273 TraceCheckUtils]: 12: Hoare triple {6573#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {6573#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:21,133 INFO L273 TraceCheckUtils]: 13: Hoare triple {6573#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6574#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:21,134 INFO L273 TraceCheckUtils]: 14: Hoare triple {6574#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {6574#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:21,135 INFO L273 TraceCheckUtils]: 15: Hoare triple {6574#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6575#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:21,136 INFO L273 TraceCheckUtils]: 16: Hoare triple {6575#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {6575#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:21,137 INFO L273 TraceCheckUtils]: 17: Hoare triple {6575#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6576#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:21,137 INFO L273 TraceCheckUtils]: 18: Hoare triple {6576#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {6576#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:21,138 INFO L273 TraceCheckUtils]: 19: Hoare triple {6576#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6577#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:21,139 INFO L273 TraceCheckUtils]: 20: Hoare triple {6577#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {6577#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:21,140 INFO L273 TraceCheckUtils]: 21: Hoare triple {6577#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6578#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:21,141 INFO L273 TraceCheckUtils]: 22: Hoare triple {6578#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {6578#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:21,142 INFO L273 TraceCheckUtils]: 23: Hoare triple {6578#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6579#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:21,143 INFO L273 TraceCheckUtils]: 24: Hoare triple {6579#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {6579#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:21,144 INFO L273 TraceCheckUtils]: 25: Hoare triple {6579#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6580#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:21,144 INFO L273 TraceCheckUtils]: 26: Hoare triple {6580#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {6580#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:21,145 INFO L273 TraceCheckUtils]: 27: Hoare triple {6580#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6581#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:21,146 INFO L273 TraceCheckUtils]: 28: Hoare triple {6581#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {6581#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:21,147 INFO L273 TraceCheckUtils]: 29: Hoare triple {6581#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6582#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:21,148 INFO L273 TraceCheckUtils]: 30: Hoare triple {6582#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {6582#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:21,149 INFO L273 TraceCheckUtils]: 31: Hoare triple {6582#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6583#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:21,150 INFO L273 TraceCheckUtils]: 32: Hoare triple {6583#(<= main_~i~1 13)} assume !(~i~1 < 10000); {6569#false} is VALID [2018-11-23 12:26:21,150 INFO L256 TraceCheckUtils]: 33: Hoare triple {6569#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {6569#false} is VALID [2018-11-23 12:26:21,151 INFO L273 TraceCheckUtils]: 34: Hoare triple {6569#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6569#false} is VALID [2018-11-23 12:26:21,151 INFO L273 TraceCheckUtils]: 35: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:21,151 INFO L273 TraceCheckUtils]: 36: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:21,151 INFO L273 TraceCheckUtils]: 37: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:21,152 INFO L273 TraceCheckUtils]: 38: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:21,152 INFO L273 TraceCheckUtils]: 39: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:21,152 INFO L273 TraceCheckUtils]: 40: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:21,152 INFO L273 TraceCheckUtils]: 41: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:21,153 INFO L273 TraceCheckUtils]: 42: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:21,153 INFO L273 TraceCheckUtils]: 43: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:21,153 INFO L273 TraceCheckUtils]: 44: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:21,153 INFO L273 TraceCheckUtils]: 45: Hoare triple {6569#false} assume !(~i~0 < 10000); {6569#false} is VALID [2018-11-23 12:26:21,154 INFO L273 TraceCheckUtils]: 46: Hoare triple {6569#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6569#false} is VALID [2018-11-23 12:26:21,154 INFO L273 TraceCheckUtils]: 47: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:26:21,154 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {6569#false} {6569#false} #70#return; {6569#false} is VALID [2018-11-23 12:26:21,154 INFO L273 TraceCheckUtils]: 49: Hoare triple {6569#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:26:21,155 INFO L256 TraceCheckUtils]: 50: Hoare triple {6569#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {6569#false} is VALID [2018-11-23 12:26:21,155 INFO L273 TraceCheckUtils]: 51: Hoare triple {6569#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6569#false} is VALID [2018-11-23 12:26:21,155 INFO L273 TraceCheckUtils]: 52: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:21,155 INFO L273 TraceCheckUtils]: 53: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:21,156 INFO L273 TraceCheckUtils]: 54: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:21,156 INFO L273 TraceCheckUtils]: 55: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:21,156 INFO L273 TraceCheckUtils]: 56: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:21,156 INFO L273 TraceCheckUtils]: 57: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:21,156 INFO L273 TraceCheckUtils]: 58: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:21,157 INFO L273 TraceCheckUtils]: 59: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:21,157 INFO L273 TraceCheckUtils]: 60: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:21,157 INFO L273 TraceCheckUtils]: 61: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:21,157 INFO L273 TraceCheckUtils]: 62: Hoare triple {6569#false} assume !(~i~0 < 10000); {6569#false} is VALID [2018-11-23 12:26:21,157 INFO L273 TraceCheckUtils]: 63: Hoare triple {6569#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6569#false} is VALID [2018-11-23 12:26:21,157 INFO L273 TraceCheckUtils]: 64: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:26:21,158 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {6569#false} {6569#false} #72#return; {6569#false} is VALID [2018-11-23 12:26:21,158 INFO L273 TraceCheckUtils]: 66: Hoare triple {6569#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {6569#false} is VALID [2018-11-23 12:26:21,158 INFO L273 TraceCheckUtils]: 67: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:26:21,158 INFO L273 TraceCheckUtils]: 68: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:26:21,158 INFO L273 TraceCheckUtils]: 69: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:26:21,158 INFO L273 TraceCheckUtils]: 70: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:26:21,159 INFO L273 TraceCheckUtils]: 71: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:26:21,159 INFO L273 TraceCheckUtils]: 72: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:26:21,159 INFO L273 TraceCheckUtils]: 73: Hoare triple {6569#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:26:21,159 INFO L273 TraceCheckUtils]: 74: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:26:21,159 INFO L273 TraceCheckUtils]: 75: Hoare triple {6569#false} assume !(~i~2 < 9999); {6569#false} is VALID [2018-11-23 12:26:21,159 INFO L273 TraceCheckUtils]: 76: Hoare triple {6569#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:26:21,160 INFO L256 TraceCheckUtils]: 77: Hoare triple {6569#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {6569#false} is VALID [2018-11-23 12:26:21,160 INFO L273 TraceCheckUtils]: 78: Hoare triple {6569#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6569#false} is VALID [2018-11-23 12:26:21,160 INFO L273 TraceCheckUtils]: 79: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:21,160 INFO L273 TraceCheckUtils]: 80: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:21,160 INFO L273 TraceCheckUtils]: 81: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:21,160 INFO L273 TraceCheckUtils]: 82: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:21,161 INFO L273 TraceCheckUtils]: 83: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:21,161 INFO L273 TraceCheckUtils]: 84: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:21,161 INFO L273 TraceCheckUtils]: 85: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:21,161 INFO L273 TraceCheckUtils]: 86: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:21,161 INFO L273 TraceCheckUtils]: 87: Hoare triple {6569#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:21,161 INFO L273 TraceCheckUtils]: 88: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:21,162 INFO L273 TraceCheckUtils]: 89: Hoare triple {6569#false} assume !(~i~0 < 10000); {6569#false} is VALID [2018-11-23 12:26:21,162 INFO L273 TraceCheckUtils]: 90: Hoare triple {6569#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6569#false} is VALID [2018-11-23 12:26:21,162 INFO L273 TraceCheckUtils]: 91: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:26:21,162 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {6569#false} {6569#false} #74#return; {6569#false} is VALID [2018-11-23 12:26:21,162 INFO L273 TraceCheckUtils]: 93: Hoare triple {6569#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {6569#false} is VALID [2018-11-23 12:26:21,162 INFO L273 TraceCheckUtils]: 94: Hoare triple {6569#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {6569#false} is VALID [2018-11-23 12:26:21,163 INFO L273 TraceCheckUtils]: 95: Hoare triple {6569#false} assume !false; {6569#false} is VALID [2018-11-23 12:26:21,171 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-11-23 12:26:21,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:21,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:26:21,193 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-23 12:26:21,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:21,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:26:21,349 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-23 12:26:21,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:26:21,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:26:21,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:26:21,350 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 17 states. [2018-11-23 12:26:22,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:22,250 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-11-23 12:26:22,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:26:22,250 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-23 12:26:22,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:22,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:26:22,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2018-11-23 12:26:22,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:26:22,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2018-11-23 12:26:22,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 80 transitions. [2018-11-23 12:26:22,775 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:22,777 INFO L225 Difference]: With dead ends: 104 [2018-11-23 12:26:22,777 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 12:26:22,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:26:22,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 12:26:22,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-23 12:26:22,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:22,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 69 states. [2018-11-23 12:26:22,845 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 69 states. [2018-11-23 12:26:22,845 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 69 states. [2018-11-23 12:26:22,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:22,849 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 12:26:22,849 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 12:26:22,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:22,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:22,849 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 70 states. [2018-11-23 12:26:22,850 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 70 states. [2018-11-23 12:26:22,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:22,851 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 12:26:22,852 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 12:26:22,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:22,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:22,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:22,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:22,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 12:26:22,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-23 12:26:22,854 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 96 [2018-11-23 12:26:22,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:22,855 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-23 12:26:22,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:26:22,855 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:26:22,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-23 12:26:22,856 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:22,856 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 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-23 12:26:22,856 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:22,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:22,857 INFO L82 PathProgramCache]: Analyzing trace with hash 737731925, now seen corresponding path program 14 times [2018-11-23 12:26:22,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:22,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:22,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:22,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:22,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:23,228 INFO L256 TraceCheckUtils]: 0: Hoare triple {7268#true} call ULTIMATE.init(); {7268#true} is VALID [2018-11-23 12:26:23,229 INFO L273 TraceCheckUtils]: 1: Hoare triple {7268#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7268#true} is VALID [2018-11-23 12:26:23,229 INFO L273 TraceCheckUtils]: 2: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:26:23,229 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7268#true} {7268#true} #66#return; {7268#true} is VALID [2018-11-23 12:26:23,229 INFO L256 TraceCheckUtils]: 4: Hoare triple {7268#true} call #t~ret13 := main(); {7268#true} is VALID [2018-11-23 12:26:23,230 INFO L273 TraceCheckUtils]: 5: Hoare triple {7268#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; {7270#(= main_~i~1 0)} is VALID [2018-11-23 12:26:23,230 INFO L273 TraceCheckUtils]: 6: Hoare triple {7270#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7270#(= main_~i~1 0)} is VALID [2018-11-23 12:26:23,231 INFO L273 TraceCheckUtils]: 7: Hoare triple {7270#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7271#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:23,231 INFO L273 TraceCheckUtils]: 8: Hoare triple {7271#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7271#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:23,232 INFO L273 TraceCheckUtils]: 9: Hoare triple {7271#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7272#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:23,233 INFO L273 TraceCheckUtils]: 10: Hoare triple {7272#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7272#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:23,234 INFO L273 TraceCheckUtils]: 11: Hoare triple {7272#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7273#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:23,234 INFO L273 TraceCheckUtils]: 12: Hoare triple {7273#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7273#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:23,235 INFO L273 TraceCheckUtils]: 13: Hoare triple {7273#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7274#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:23,236 INFO L273 TraceCheckUtils]: 14: Hoare triple {7274#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7274#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:23,237 INFO L273 TraceCheckUtils]: 15: Hoare triple {7274#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7275#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:23,237 INFO L273 TraceCheckUtils]: 16: Hoare triple {7275#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7275#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:23,238 INFO L273 TraceCheckUtils]: 17: Hoare triple {7275#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7276#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:23,239 INFO L273 TraceCheckUtils]: 18: Hoare triple {7276#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7276#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:23,240 INFO L273 TraceCheckUtils]: 19: Hoare triple {7276#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7277#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:23,241 INFO L273 TraceCheckUtils]: 20: Hoare triple {7277#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7277#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:23,242 INFO L273 TraceCheckUtils]: 21: Hoare triple {7277#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7278#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:23,242 INFO L273 TraceCheckUtils]: 22: Hoare triple {7278#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7278#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:23,243 INFO L273 TraceCheckUtils]: 23: Hoare triple {7278#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7279#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:23,244 INFO L273 TraceCheckUtils]: 24: Hoare triple {7279#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7279#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:23,245 INFO L273 TraceCheckUtils]: 25: Hoare triple {7279#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7280#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:23,245 INFO L273 TraceCheckUtils]: 26: Hoare triple {7280#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7280#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:23,246 INFO L273 TraceCheckUtils]: 27: Hoare triple {7280#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7281#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:23,247 INFO L273 TraceCheckUtils]: 28: Hoare triple {7281#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7281#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:23,248 INFO L273 TraceCheckUtils]: 29: Hoare triple {7281#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7282#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:23,249 INFO L273 TraceCheckUtils]: 30: Hoare triple {7282#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7282#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:23,249 INFO L273 TraceCheckUtils]: 31: Hoare triple {7282#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7283#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:23,250 INFO L273 TraceCheckUtils]: 32: Hoare triple {7283#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7283#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:23,251 INFO L273 TraceCheckUtils]: 33: Hoare triple {7283#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7284#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:23,252 INFO L273 TraceCheckUtils]: 34: Hoare triple {7284#(<= main_~i~1 14)} assume !(~i~1 < 10000); {7269#false} is VALID [2018-11-23 12:26:23,252 INFO L256 TraceCheckUtils]: 35: Hoare triple {7269#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {7268#true} is VALID [2018-11-23 12:26:23,252 INFO L273 TraceCheckUtils]: 36: Hoare triple {7268#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7268#true} is VALID [2018-11-23 12:26:23,252 INFO L273 TraceCheckUtils]: 37: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:23,253 INFO L273 TraceCheckUtils]: 38: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:23,253 INFO L273 TraceCheckUtils]: 39: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:23,253 INFO L273 TraceCheckUtils]: 40: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:23,253 INFO L273 TraceCheckUtils]: 41: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:23,254 INFO L273 TraceCheckUtils]: 42: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:23,254 INFO L273 TraceCheckUtils]: 43: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:23,254 INFO L273 TraceCheckUtils]: 44: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:23,254 INFO L273 TraceCheckUtils]: 45: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:23,254 INFO L273 TraceCheckUtils]: 46: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:23,255 INFO L273 TraceCheckUtils]: 47: Hoare triple {7268#true} assume !(~i~0 < 10000); {7268#true} is VALID [2018-11-23 12:26:23,255 INFO L273 TraceCheckUtils]: 48: Hoare triple {7268#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7268#true} is VALID [2018-11-23 12:26:23,255 INFO L273 TraceCheckUtils]: 49: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:26:23,255 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {7268#true} {7269#false} #70#return; {7269#false} is VALID [2018-11-23 12:26:23,255 INFO L273 TraceCheckUtils]: 51: Hoare triple {7269#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:26:23,256 INFO L256 TraceCheckUtils]: 52: Hoare triple {7269#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {7268#true} is VALID [2018-11-23 12:26:23,256 INFO L273 TraceCheckUtils]: 53: Hoare triple {7268#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7268#true} is VALID [2018-11-23 12:26:23,256 INFO L273 TraceCheckUtils]: 54: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:23,256 INFO L273 TraceCheckUtils]: 55: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:23,256 INFO L273 TraceCheckUtils]: 56: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:23,256 INFO L273 TraceCheckUtils]: 57: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:23,256 INFO L273 TraceCheckUtils]: 58: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:23,256 INFO L273 TraceCheckUtils]: 59: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:23,257 INFO L273 TraceCheckUtils]: 60: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:23,257 INFO L273 TraceCheckUtils]: 61: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:23,257 INFO L273 TraceCheckUtils]: 62: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:23,257 INFO L273 TraceCheckUtils]: 63: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:23,257 INFO L273 TraceCheckUtils]: 64: Hoare triple {7268#true} assume !(~i~0 < 10000); {7268#true} is VALID [2018-11-23 12:26:23,257 INFO L273 TraceCheckUtils]: 65: Hoare triple {7268#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7268#true} is VALID [2018-11-23 12:26:23,257 INFO L273 TraceCheckUtils]: 66: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:26:23,258 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {7268#true} {7269#false} #72#return; {7269#false} is VALID [2018-11-23 12:26:23,258 INFO L273 TraceCheckUtils]: 68: Hoare triple {7269#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {7269#false} is VALID [2018-11-23 12:26:23,258 INFO L273 TraceCheckUtils]: 69: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:26:23,258 INFO L273 TraceCheckUtils]: 70: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:26:23,258 INFO L273 TraceCheckUtils]: 71: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:26:23,258 INFO L273 TraceCheckUtils]: 72: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:26:23,259 INFO L273 TraceCheckUtils]: 73: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:26:23,259 INFO L273 TraceCheckUtils]: 74: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:26:23,259 INFO L273 TraceCheckUtils]: 75: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:26:23,259 INFO L273 TraceCheckUtils]: 76: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:26:23,259 INFO L273 TraceCheckUtils]: 77: Hoare triple {7269#false} assume !(~i~2 < 9999); {7269#false} is VALID [2018-11-23 12:26:23,259 INFO L273 TraceCheckUtils]: 78: Hoare triple {7269#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:26:23,260 INFO L256 TraceCheckUtils]: 79: Hoare triple {7269#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {7268#true} is VALID [2018-11-23 12:26:23,260 INFO L273 TraceCheckUtils]: 80: Hoare triple {7268#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7268#true} is VALID [2018-11-23 12:26:23,260 INFO L273 TraceCheckUtils]: 81: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:23,260 INFO L273 TraceCheckUtils]: 82: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:23,260 INFO L273 TraceCheckUtils]: 83: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:23,260 INFO L273 TraceCheckUtils]: 84: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:23,261 INFO L273 TraceCheckUtils]: 85: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:23,261 INFO L273 TraceCheckUtils]: 86: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:23,261 INFO L273 TraceCheckUtils]: 87: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:23,261 INFO L273 TraceCheckUtils]: 88: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:23,261 INFO L273 TraceCheckUtils]: 89: Hoare triple {7268#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:23,261 INFO L273 TraceCheckUtils]: 90: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:23,262 INFO L273 TraceCheckUtils]: 91: Hoare triple {7268#true} assume !(~i~0 < 10000); {7268#true} is VALID [2018-11-23 12:26:23,262 INFO L273 TraceCheckUtils]: 92: Hoare triple {7268#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7268#true} is VALID [2018-11-23 12:26:23,262 INFO L273 TraceCheckUtils]: 93: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:26:23,262 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {7268#true} {7269#false} #74#return; {7269#false} is VALID [2018-11-23 12:26:23,262 INFO L273 TraceCheckUtils]: 95: Hoare triple {7269#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {7269#false} is VALID [2018-11-23 12:26:23,262 INFO L273 TraceCheckUtils]: 96: Hoare triple {7269#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {7269#false} is VALID [2018-11-23 12:26:23,263 INFO L273 TraceCheckUtils]: 97: Hoare triple {7269#false} assume !false; {7269#false} is VALID [2018-11-23 12:26:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-11-23 12:26:23,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:23,268 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:23,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:26:23,341 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:26:23,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:23,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:23,660 INFO L256 TraceCheckUtils]: 0: Hoare triple {7268#true} call ULTIMATE.init(); {7268#true} is VALID [2018-11-23 12:26:23,660 INFO L273 TraceCheckUtils]: 1: Hoare triple {7268#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7268#true} is VALID [2018-11-23 12:26:23,660 INFO L273 TraceCheckUtils]: 2: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:26:23,661 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7268#true} {7268#true} #66#return; {7268#true} is VALID [2018-11-23 12:26:23,661 INFO L256 TraceCheckUtils]: 4: Hoare triple {7268#true} call #t~ret13 := main(); {7268#true} is VALID [2018-11-23 12:26:23,662 INFO L273 TraceCheckUtils]: 5: Hoare triple {7268#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; {7303#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:23,663 INFO L273 TraceCheckUtils]: 6: Hoare triple {7303#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7303#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:23,664 INFO L273 TraceCheckUtils]: 7: Hoare triple {7303#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7271#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:23,664 INFO L273 TraceCheckUtils]: 8: Hoare triple {7271#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7271#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:23,665 INFO L273 TraceCheckUtils]: 9: Hoare triple {7271#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7272#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:23,666 INFO L273 TraceCheckUtils]: 10: Hoare triple {7272#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7272#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:23,667 INFO L273 TraceCheckUtils]: 11: Hoare triple {7272#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7273#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:23,667 INFO L273 TraceCheckUtils]: 12: Hoare triple {7273#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7273#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:23,668 INFO L273 TraceCheckUtils]: 13: Hoare triple {7273#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7274#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:23,669 INFO L273 TraceCheckUtils]: 14: Hoare triple {7274#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7274#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:23,670 INFO L273 TraceCheckUtils]: 15: Hoare triple {7274#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7275#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:23,670 INFO L273 TraceCheckUtils]: 16: Hoare triple {7275#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7275#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:23,671 INFO L273 TraceCheckUtils]: 17: Hoare triple {7275#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7276#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:23,672 INFO L273 TraceCheckUtils]: 18: Hoare triple {7276#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7276#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:23,673 INFO L273 TraceCheckUtils]: 19: Hoare triple {7276#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7277#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:23,674 INFO L273 TraceCheckUtils]: 20: Hoare triple {7277#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7277#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:23,675 INFO L273 TraceCheckUtils]: 21: Hoare triple {7277#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7278#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:23,675 INFO L273 TraceCheckUtils]: 22: Hoare triple {7278#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7278#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:23,676 INFO L273 TraceCheckUtils]: 23: Hoare triple {7278#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7279#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:23,677 INFO L273 TraceCheckUtils]: 24: Hoare triple {7279#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7279#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:23,678 INFO L273 TraceCheckUtils]: 25: Hoare triple {7279#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7280#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:23,678 INFO L273 TraceCheckUtils]: 26: Hoare triple {7280#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7280#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:23,679 INFO L273 TraceCheckUtils]: 27: Hoare triple {7280#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7281#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:23,680 INFO L273 TraceCheckUtils]: 28: Hoare triple {7281#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7281#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:23,681 INFO L273 TraceCheckUtils]: 29: Hoare triple {7281#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7282#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:23,682 INFO L273 TraceCheckUtils]: 30: Hoare triple {7282#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7282#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:23,682 INFO L273 TraceCheckUtils]: 31: Hoare triple {7282#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7283#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:23,683 INFO L273 TraceCheckUtils]: 32: Hoare triple {7283#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7283#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:23,684 INFO L273 TraceCheckUtils]: 33: Hoare triple {7283#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7284#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:23,685 INFO L273 TraceCheckUtils]: 34: Hoare triple {7284#(<= main_~i~1 14)} assume !(~i~1 < 10000); {7269#false} is VALID [2018-11-23 12:26:23,685 INFO L256 TraceCheckUtils]: 35: Hoare triple {7269#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {7269#false} is VALID [2018-11-23 12:26:23,685 INFO L273 TraceCheckUtils]: 36: Hoare triple {7269#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7269#false} is VALID [2018-11-23 12:26:23,686 INFO L273 TraceCheckUtils]: 37: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:23,686 INFO L273 TraceCheckUtils]: 38: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:23,686 INFO L273 TraceCheckUtils]: 39: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:23,686 INFO L273 TraceCheckUtils]: 40: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:23,686 INFO L273 TraceCheckUtils]: 41: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:23,687 INFO L273 TraceCheckUtils]: 42: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:23,687 INFO L273 TraceCheckUtils]: 43: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:23,687 INFO L273 TraceCheckUtils]: 44: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:23,687 INFO L273 TraceCheckUtils]: 45: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:23,687 INFO L273 TraceCheckUtils]: 46: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:23,688 INFO L273 TraceCheckUtils]: 47: Hoare triple {7269#false} assume !(~i~0 < 10000); {7269#false} is VALID [2018-11-23 12:26:23,688 INFO L273 TraceCheckUtils]: 48: Hoare triple {7269#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7269#false} is VALID [2018-11-23 12:26:23,688 INFO L273 TraceCheckUtils]: 49: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:26:23,688 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {7269#false} {7269#false} #70#return; {7269#false} is VALID [2018-11-23 12:26:23,688 INFO L273 TraceCheckUtils]: 51: Hoare triple {7269#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:26:23,689 INFO L256 TraceCheckUtils]: 52: Hoare triple {7269#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {7269#false} is VALID [2018-11-23 12:26:23,689 INFO L273 TraceCheckUtils]: 53: Hoare triple {7269#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7269#false} is VALID [2018-11-23 12:26:23,689 INFO L273 TraceCheckUtils]: 54: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:23,689 INFO L273 TraceCheckUtils]: 55: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:23,689 INFO L273 TraceCheckUtils]: 56: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:23,690 INFO L273 TraceCheckUtils]: 57: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:23,690 INFO L273 TraceCheckUtils]: 58: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:23,690 INFO L273 TraceCheckUtils]: 59: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:23,690 INFO L273 TraceCheckUtils]: 60: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:23,690 INFO L273 TraceCheckUtils]: 61: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:23,690 INFO L273 TraceCheckUtils]: 62: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:23,690 INFO L273 TraceCheckUtils]: 63: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:23,690 INFO L273 TraceCheckUtils]: 64: Hoare triple {7269#false} assume !(~i~0 < 10000); {7269#false} is VALID [2018-11-23 12:26:23,690 INFO L273 TraceCheckUtils]: 65: Hoare triple {7269#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7269#false} is VALID [2018-11-23 12:26:23,691 INFO L273 TraceCheckUtils]: 66: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:26:23,691 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {7269#false} {7269#false} #72#return; {7269#false} is VALID [2018-11-23 12:26:23,691 INFO L273 TraceCheckUtils]: 68: Hoare triple {7269#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {7269#false} is VALID [2018-11-23 12:26:23,691 INFO L273 TraceCheckUtils]: 69: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:26:23,691 INFO L273 TraceCheckUtils]: 70: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:26:23,691 INFO L273 TraceCheckUtils]: 71: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:26:23,691 INFO L273 TraceCheckUtils]: 72: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:26:23,691 INFO L273 TraceCheckUtils]: 73: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:26:23,692 INFO L273 TraceCheckUtils]: 74: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:26:23,692 INFO L273 TraceCheckUtils]: 75: Hoare triple {7269#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:26:23,692 INFO L273 TraceCheckUtils]: 76: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:26:23,692 INFO L273 TraceCheckUtils]: 77: Hoare triple {7269#false} assume !(~i~2 < 9999); {7269#false} is VALID [2018-11-23 12:26:23,692 INFO L273 TraceCheckUtils]: 78: Hoare triple {7269#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:26:23,692 INFO L256 TraceCheckUtils]: 79: Hoare triple {7269#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {7269#false} is VALID [2018-11-23 12:26:23,692 INFO L273 TraceCheckUtils]: 80: Hoare triple {7269#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7269#false} is VALID [2018-11-23 12:26:23,692 INFO L273 TraceCheckUtils]: 81: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:23,692 INFO L273 TraceCheckUtils]: 82: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:23,693 INFO L273 TraceCheckUtils]: 83: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:23,693 INFO L273 TraceCheckUtils]: 84: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:23,693 INFO L273 TraceCheckUtils]: 85: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:23,693 INFO L273 TraceCheckUtils]: 86: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:23,693 INFO L273 TraceCheckUtils]: 87: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:23,693 INFO L273 TraceCheckUtils]: 88: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:23,693 INFO L273 TraceCheckUtils]: 89: Hoare triple {7269#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:23,693 INFO L273 TraceCheckUtils]: 90: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:23,694 INFO L273 TraceCheckUtils]: 91: Hoare triple {7269#false} assume !(~i~0 < 10000); {7269#false} is VALID [2018-11-23 12:26:23,694 INFO L273 TraceCheckUtils]: 92: Hoare triple {7269#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7269#false} is VALID [2018-11-23 12:26:23,694 INFO L273 TraceCheckUtils]: 93: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:26:23,694 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {7269#false} {7269#false} #74#return; {7269#false} is VALID [2018-11-23 12:26:23,694 INFO L273 TraceCheckUtils]: 95: Hoare triple {7269#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {7269#false} is VALID [2018-11-23 12:26:23,694 INFO L273 TraceCheckUtils]: 96: Hoare triple {7269#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {7269#false} is VALID [2018-11-23 12:26:23,694 INFO L273 TraceCheckUtils]: 97: Hoare triple {7269#false} assume !false; {7269#false} is VALID [2018-11-23 12:26:23,699 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-11-23 12:26:23,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:23,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:26:23,718 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2018-11-23 12:26:23,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:23,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:26:23,813 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:23,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:26:23,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:26:23,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:26:23,814 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 18 states. [2018-11-23 12:26:24,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:24,386 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-11-23 12:26:24,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:26:24,386 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2018-11-23 12:26:24,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:24,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:26:24,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2018-11-23 12:26:24,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:26:24,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2018-11-23 12:26:24,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 82 transitions. [2018-11-23 12:26:24,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:24,520 INFO L225 Difference]: With dead ends: 106 [2018-11-23 12:26:24,521 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 12:26:24,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:26:24,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 12:26:24,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-23 12:26:24,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:24,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 71 states. [2018-11-23 12:26:24,558 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 71 states. [2018-11-23 12:26:24,558 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 71 states. [2018-11-23 12:26:24,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:24,560 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 12:26:24,560 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 12:26:24,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:24,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:24,561 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 72 states. [2018-11-23 12:26:24,561 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 72 states. [2018-11-23 12:26:24,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:24,563 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 12:26:24,563 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 12:26:24,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:24,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:24,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:24,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:24,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 12:26:24,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-11-23 12:26:24,565 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 98 [2018-11-23 12:26:24,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:24,565 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-11-23 12:26:24,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:26:24,566 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-23 12:26:24,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 12:26:24,567 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:24,567 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 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-23 12:26:24,567 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:24,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:24,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1296735945, now seen corresponding path program 15 times [2018-11-23 12:26:24,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:24,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:24,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:24,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:24,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:26,182 INFO L256 TraceCheckUtils]: 0: Hoare triple {7985#true} call ULTIMATE.init(); {7985#true} is VALID [2018-11-23 12:26:26,182 INFO L273 TraceCheckUtils]: 1: Hoare triple {7985#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7985#true} is VALID [2018-11-23 12:26:26,182 INFO L273 TraceCheckUtils]: 2: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:26:26,183 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7985#true} {7985#true} #66#return; {7985#true} is VALID [2018-11-23 12:26:26,183 INFO L256 TraceCheckUtils]: 4: Hoare triple {7985#true} call #t~ret13 := main(); {7985#true} is VALID [2018-11-23 12:26:26,184 INFO L273 TraceCheckUtils]: 5: Hoare triple {7985#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; {7987#(= main_~i~1 0)} is VALID [2018-11-23 12:26:26,184 INFO L273 TraceCheckUtils]: 6: Hoare triple {7987#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7987#(= main_~i~1 0)} is VALID [2018-11-23 12:26:26,185 INFO L273 TraceCheckUtils]: 7: Hoare triple {7987#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7988#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:26,185 INFO L273 TraceCheckUtils]: 8: Hoare triple {7988#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7988#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:26,186 INFO L273 TraceCheckUtils]: 9: Hoare triple {7988#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7989#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:26,186 INFO L273 TraceCheckUtils]: 10: Hoare triple {7989#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7989#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:26,187 INFO L273 TraceCheckUtils]: 11: Hoare triple {7989#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7990#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:26,187 INFO L273 TraceCheckUtils]: 12: Hoare triple {7990#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7990#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:26,188 INFO L273 TraceCheckUtils]: 13: Hoare triple {7990#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7991#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:26,189 INFO L273 TraceCheckUtils]: 14: Hoare triple {7991#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7991#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:26,190 INFO L273 TraceCheckUtils]: 15: Hoare triple {7991#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7992#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:26,190 INFO L273 TraceCheckUtils]: 16: Hoare triple {7992#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7992#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:26,191 INFO L273 TraceCheckUtils]: 17: Hoare triple {7992#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7993#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:26,192 INFO L273 TraceCheckUtils]: 18: Hoare triple {7993#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7993#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:26,193 INFO L273 TraceCheckUtils]: 19: Hoare triple {7993#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7994#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:26,193 INFO L273 TraceCheckUtils]: 20: Hoare triple {7994#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7994#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:26,194 INFO L273 TraceCheckUtils]: 21: Hoare triple {7994#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7995#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:26,195 INFO L273 TraceCheckUtils]: 22: Hoare triple {7995#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7995#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:26,196 INFO L273 TraceCheckUtils]: 23: Hoare triple {7995#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7996#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:26,197 INFO L273 TraceCheckUtils]: 24: Hoare triple {7996#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7996#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:26,198 INFO L273 TraceCheckUtils]: 25: Hoare triple {7996#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7997#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:26,198 INFO L273 TraceCheckUtils]: 26: Hoare triple {7997#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7997#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:26,199 INFO L273 TraceCheckUtils]: 27: Hoare triple {7997#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7998#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:26,200 INFO L273 TraceCheckUtils]: 28: Hoare triple {7998#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7998#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:26,201 INFO L273 TraceCheckUtils]: 29: Hoare triple {7998#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7999#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:26,201 INFO L273 TraceCheckUtils]: 30: Hoare triple {7999#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {7999#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:26,202 INFO L273 TraceCheckUtils]: 31: Hoare triple {7999#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8000#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:26,203 INFO L273 TraceCheckUtils]: 32: Hoare triple {8000#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8000#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:26,204 INFO L273 TraceCheckUtils]: 33: Hoare triple {8000#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8001#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:26,205 INFO L273 TraceCheckUtils]: 34: Hoare triple {8001#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8001#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:26,206 INFO L273 TraceCheckUtils]: 35: Hoare triple {8001#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8002#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:26,206 INFO L273 TraceCheckUtils]: 36: Hoare triple {8002#(<= main_~i~1 15)} assume !(~i~1 < 10000); {7986#false} is VALID [2018-11-23 12:26:26,207 INFO L256 TraceCheckUtils]: 37: Hoare triple {7986#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:26:26,207 INFO L273 TraceCheckUtils]: 38: Hoare triple {7985#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7985#true} is VALID [2018-11-23 12:26:26,207 INFO L273 TraceCheckUtils]: 39: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:26,207 INFO L273 TraceCheckUtils]: 40: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:26,207 INFO L273 TraceCheckUtils]: 41: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:26,208 INFO L273 TraceCheckUtils]: 42: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:26,208 INFO L273 TraceCheckUtils]: 43: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:26,208 INFO L273 TraceCheckUtils]: 44: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:26,208 INFO L273 TraceCheckUtils]: 45: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:26,208 INFO L273 TraceCheckUtils]: 46: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:26,209 INFO L273 TraceCheckUtils]: 47: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:26,209 INFO L273 TraceCheckUtils]: 48: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:26,209 INFO L273 TraceCheckUtils]: 49: Hoare triple {7985#true} assume !(~i~0 < 10000); {7985#true} is VALID [2018-11-23 12:26:26,209 INFO L273 TraceCheckUtils]: 50: Hoare triple {7985#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:26:26,209 INFO L273 TraceCheckUtils]: 51: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:26:26,209 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {7985#true} {7986#false} #70#return; {7986#false} is VALID [2018-11-23 12:26:26,210 INFO L273 TraceCheckUtils]: 53: Hoare triple {7986#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {7986#false} is VALID [2018-11-23 12:26:26,210 INFO L256 TraceCheckUtils]: 54: Hoare triple {7986#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:26:26,210 INFO L273 TraceCheckUtils]: 55: Hoare triple {7985#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7985#true} is VALID [2018-11-23 12:26:26,210 INFO L273 TraceCheckUtils]: 56: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:26,210 INFO L273 TraceCheckUtils]: 57: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:26,210 INFO L273 TraceCheckUtils]: 58: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:26,210 INFO L273 TraceCheckUtils]: 59: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:26,210 INFO L273 TraceCheckUtils]: 60: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:26,211 INFO L273 TraceCheckUtils]: 61: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:26,211 INFO L273 TraceCheckUtils]: 62: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:26,211 INFO L273 TraceCheckUtils]: 63: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:26,211 INFO L273 TraceCheckUtils]: 64: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:26,211 INFO L273 TraceCheckUtils]: 65: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:26,211 INFO L273 TraceCheckUtils]: 66: Hoare triple {7985#true} assume !(~i~0 < 10000); {7985#true} is VALID [2018-11-23 12:26:26,211 INFO L273 TraceCheckUtils]: 67: Hoare triple {7985#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:26:26,211 INFO L273 TraceCheckUtils]: 68: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:26:26,212 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {7985#true} {7986#false} #72#return; {7986#false} is VALID [2018-11-23 12:26:26,212 INFO L273 TraceCheckUtils]: 70: Hoare triple {7986#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {7986#false} is VALID [2018-11-23 12:26:26,212 INFO L273 TraceCheckUtils]: 71: Hoare triple {7986#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7986#false} is VALID [2018-11-23 12:26:26,212 INFO L273 TraceCheckUtils]: 72: Hoare triple {7986#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7986#false} is VALID [2018-11-23 12:26:26,212 INFO L273 TraceCheckUtils]: 73: Hoare triple {7986#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7986#false} is VALID [2018-11-23 12:26:26,212 INFO L273 TraceCheckUtils]: 74: Hoare triple {7986#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7986#false} is VALID [2018-11-23 12:26:26,212 INFO L273 TraceCheckUtils]: 75: Hoare triple {7986#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7986#false} is VALID [2018-11-23 12:26:26,212 INFO L273 TraceCheckUtils]: 76: Hoare triple {7986#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7986#false} is VALID [2018-11-23 12:26:26,212 INFO L273 TraceCheckUtils]: 77: Hoare triple {7986#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7986#false} is VALID [2018-11-23 12:26:26,213 INFO L273 TraceCheckUtils]: 78: Hoare triple {7986#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7986#false} is VALID [2018-11-23 12:26:26,213 INFO L273 TraceCheckUtils]: 79: Hoare triple {7986#false} assume !(~i~2 < 9999); {7986#false} is VALID [2018-11-23 12:26:26,213 INFO L273 TraceCheckUtils]: 80: Hoare triple {7986#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {7986#false} is VALID [2018-11-23 12:26:26,213 INFO L256 TraceCheckUtils]: 81: Hoare triple {7986#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:26:26,213 INFO L273 TraceCheckUtils]: 82: Hoare triple {7985#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7985#true} is VALID [2018-11-23 12:26:26,213 INFO L273 TraceCheckUtils]: 83: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:26,213 INFO L273 TraceCheckUtils]: 84: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:26,213 INFO L273 TraceCheckUtils]: 85: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:26,214 INFO L273 TraceCheckUtils]: 86: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:26,214 INFO L273 TraceCheckUtils]: 87: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:26,214 INFO L273 TraceCheckUtils]: 88: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:26,214 INFO L273 TraceCheckUtils]: 89: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:26,214 INFO L273 TraceCheckUtils]: 90: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:26,214 INFO L273 TraceCheckUtils]: 91: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:26,214 INFO L273 TraceCheckUtils]: 92: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:26,214 INFO L273 TraceCheckUtils]: 93: Hoare triple {7985#true} assume !(~i~0 < 10000); {7985#true} is VALID [2018-11-23 12:26:26,214 INFO L273 TraceCheckUtils]: 94: Hoare triple {7985#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:26:26,215 INFO L273 TraceCheckUtils]: 95: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:26:26,215 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {7985#true} {7986#false} #74#return; {7986#false} is VALID [2018-11-23 12:26:26,215 INFO L273 TraceCheckUtils]: 97: Hoare triple {7986#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {7986#false} is VALID [2018-11-23 12:26:26,215 INFO L273 TraceCheckUtils]: 98: Hoare triple {7986#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {7986#false} is VALID [2018-11-23 12:26:26,215 INFO L273 TraceCheckUtils]: 99: Hoare triple {7986#false} assume !false; {7986#false} is VALID [2018-11-23 12:26:26,220 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-11-23 12:26:26,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:26,220 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:26,229 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:26:26,313 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:26:26,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:26,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:26,747 INFO L256 TraceCheckUtils]: 0: Hoare triple {7985#true} call ULTIMATE.init(); {7985#true} is VALID [2018-11-23 12:26:26,747 INFO L273 TraceCheckUtils]: 1: Hoare triple {7985#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7985#true} is VALID [2018-11-23 12:26:26,747 INFO L273 TraceCheckUtils]: 2: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:26:26,748 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7985#true} {7985#true} #66#return; {7985#true} is VALID [2018-11-23 12:26:26,748 INFO L256 TraceCheckUtils]: 4: Hoare triple {7985#true} call #t~ret13 := main(); {7985#true} is VALID [2018-11-23 12:26:26,748 INFO L273 TraceCheckUtils]: 5: Hoare triple {7985#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; {7985#true} is VALID [2018-11-23 12:26:26,748 INFO L273 TraceCheckUtils]: 6: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:26,748 INFO L273 TraceCheckUtils]: 7: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:26,749 INFO L273 TraceCheckUtils]: 8: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:26,749 INFO L273 TraceCheckUtils]: 9: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:26,749 INFO L273 TraceCheckUtils]: 10: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:26,749 INFO L273 TraceCheckUtils]: 11: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:26,749 INFO L273 TraceCheckUtils]: 12: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:26,749 INFO L273 TraceCheckUtils]: 13: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:26,749 INFO L273 TraceCheckUtils]: 14: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:26,749 INFO L273 TraceCheckUtils]: 15: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:26,749 INFO L273 TraceCheckUtils]: 16: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:26,750 INFO L273 TraceCheckUtils]: 17: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:26,750 INFO L273 TraceCheckUtils]: 18: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:26,750 INFO L273 TraceCheckUtils]: 19: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:26,750 INFO L273 TraceCheckUtils]: 20: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:26,750 INFO L273 TraceCheckUtils]: 21: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:26,750 INFO L273 TraceCheckUtils]: 22: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:26,750 INFO L273 TraceCheckUtils]: 23: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:26,750 INFO L273 TraceCheckUtils]: 24: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:26,750 INFO L273 TraceCheckUtils]: 25: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:26,751 INFO L273 TraceCheckUtils]: 26: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:26,751 INFO L273 TraceCheckUtils]: 27: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:26,751 INFO L273 TraceCheckUtils]: 28: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:26,751 INFO L273 TraceCheckUtils]: 29: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:26,751 INFO L273 TraceCheckUtils]: 30: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:26,751 INFO L273 TraceCheckUtils]: 31: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:26,751 INFO L273 TraceCheckUtils]: 32: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:26,751 INFO L273 TraceCheckUtils]: 33: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:26,752 INFO L273 TraceCheckUtils]: 34: Hoare triple {7985#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:26,752 INFO L273 TraceCheckUtils]: 35: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:26,752 INFO L273 TraceCheckUtils]: 36: Hoare triple {7985#true} assume !(~i~1 < 10000); {7985#true} is VALID [2018-11-23 12:26:26,752 INFO L256 TraceCheckUtils]: 37: Hoare triple {7985#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:26:26,752 INFO L273 TraceCheckUtils]: 38: Hoare triple {7985#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7985#true} is VALID [2018-11-23 12:26:26,752 INFO L273 TraceCheckUtils]: 39: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:26,752 INFO L273 TraceCheckUtils]: 40: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:26,752 INFO L273 TraceCheckUtils]: 41: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:26,753 INFO L273 TraceCheckUtils]: 42: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:26,753 INFO L273 TraceCheckUtils]: 43: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:26,753 INFO L273 TraceCheckUtils]: 44: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:26,753 INFO L273 TraceCheckUtils]: 45: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:26,753 INFO L273 TraceCheckUtils]: 46: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:26,753 INFO L273 TraceCheckUtils]: 47: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:26,753 INFO L273 TraceCheckUtils]: 48: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:26,753 INFO L273 TraceCheckUtils]: 49: Hoare triple {7985#true} assume !(~i~0 < 10000); {7985#true} is VALID [2018-11-23 12:26:26,753 INFO L273 TraceCheckUtils]: 50: Hoare triple {7985#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:26:26,754 INFO L273 TraceCheckUtils]: 51: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:26:26,754 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {7985#true} {7985#true} #70#return; {7985#true} is VALID [2018-11-23 12:26:26,754 INFO L273 TraceCheckUtils]: 53: Hoare triple {7985#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {7985#true} is VALID [2018-11-23 12:26:26,754 INFO L256 TraceCheckUtils]: 54: Hoare triple {7985#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:26:26,754 INFO L273 TraceCheckUtils]: 55: Hoare triple {7985#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7985#true} is VALID [2018-11-23 12:26:26,754 INFO L273 TraceCheckUtils]: 56: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:26,754 INFO L273 TraceCheckUtils]: 57: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:26,754 INFO L273 TraceCheckUtils]: 58: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:26,755 INFO L273 TraceCheckUtils]: 59: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:26,755 INFO L273 TraceCheckUtils]: 60: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:26,755 INFO L273 TraceCheckUtils]: 61: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:26,755 INFO L273 TraceCheckUtils]: 62: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:26,755 INFO L273 TraceCheckUtils]: 63: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:26,755 INFO L273 TraceCheckUtils]: 64: Hoare triple {7985#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:26,755 INFO L273 TraceCheckUtils]: 65: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:26,755 INFO L273 TraceCheckUtils]: 66: Hoare triple {7985#true} assume !(~i~0 < 10000); {7985#true} is VALID [2018-11-23 12:26:26,755 INFO L273 TraceCheckUtils]: 67: Hoare triple {7985#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:26:26,756 INFO L273 TraceCheckUtils]: 68: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:26:26,756 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {7985#true} {7985#true} #72#return; {7985#true} is VALID [2018-11-23 12:26:26,756 INFO L273 TraceCheckUtils]: 70: Hoare triple {7985#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {7985#true} is VALID [2018-11-23 12:26:26,756 INFO L273 TraceCheckUtils]: 71: Hoare triple {7985#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7985#true} is VALID [2018-11-23 12:26:26,756 INFO L273 TraceCheckUtils]: 72: Hoare triple {7985#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7985#true} is VALID [2018-11-23 12:26:26,756 INFO L273 TraceCheckUtils]: 73: Hoare triple {7985#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7985#true} is VALID [2018-11-23 12:26:26,756 INFO L273 TraceCheckUtils]: 74: Hoare triple {7985#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7985#true} is VALID [2018-11-23 12:26:26,756 INFO L273 TraceCheckUtils]: 75: Hoare triple {7985#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7985#true} is VALID [2018-11-23 12:26:26,757 INFO L273 TraceCheckUtils]: 76: Hoare triple {7985#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7985#true} is VALID [2018-11-23 12:26:26,757 INFO L273 TraceCheckUtils]: 77: Hoare triple {7985#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7985#true} is VALID [2018-11-23 12:26:26,757 INFO L273 TraceCheckUtils]: 78: Hoare triple {7985#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7985#true} is VALID [2018-11-23 12:26:26,757 INFO L273 TraceCheckUtils]: 79: Hoare triple {7985#true} assume !(~i~2 < 9999); {7985#true} is VALID [2018-11-23 12:26:26,757 INFO L273 TraceCheckUtils]: 80: Hoare triple {7985#true} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {7985#true} is VALID [2018-11-23 12:26:26,757 INFO L256 TraceCheckUtils]: 81: Hoare triple {7985#true} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:26:26,758 INFO L273 TraceCheckUtils]: 82: Hoare triple {7985#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8252#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:26,758 INFO L273 TraceCheckUtils]: 83: Hoare triple {8252#(<= bor_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8252#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:26,759 INFO L273 TraceCheckUtils]: 84: Hoare triple {8252#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8259#(<= bor_~i~0 2)} is VALID [2018-11-23 12:26:26,759 INFO L273 TraceCheckUtils]: 85: Hoare triple {8259#(<= bor_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8259#(<= bor_~i~0 2)} is VALID [2018-11-23 12:26:26,760 INFO L273 TraceCheckUtils]: 86: Hoare triple {8259#(<= bor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8266#(<= bor_~i~0 3)} is VALID [2018-11-23 12:26:26,761 INFO L273 TraceCheckUtils]: 87: Hoare triple {8266#(<= bor_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8266#(<= bor_~i~0 3)} is VALID [2018-11-23 12:26:26,762 INFO L273 TraceCheckUtils]: 88: Hoare triple {8266#(<= bor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8273#(<= bor_~i~0 4)} is VALID [2018-11-23 12:26:26,762 INFO L273 TraceCheckUtils]: 89: Hoare triple {8273#(<= bor_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8273#(<= bor_~i~0 4)} is VALID [2018-11-23 12:26:26,763 INFO L273 TraceCheckUtils]: 90: Hoare triple {8273#(<= bor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8280#(<= bor_~i~0 5)} is VALID [2018-11-23 12:26:26,764 INFO L273 TraceCheckUtils]: 91: Hoare triple {8280#(<= bor_~i~0 5)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8280#(<= bor_~i~0 5)} is VALID [2018-11-23 12:26:26,765 INFO L273 TraceCheckUtils]: 92: Hoare triple {8280#(<= bor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8287#(<= bor_~i~0 6)} is VALID [2018-11-23 12:26:26,766 INFO L273 TraceCheckUtils]: 93: Hoare triple {8287#(<= bor_~i~0 6)} assume !(~i~0 < 10000); {7986#false} is VALID [2018-11-23 12:26:26,766 INFO L273 TraceCheckUtils]: 94: Hoare triple {7986#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7986#false} is VALID [2018-11-23 12:26:26,766 INFO L273 TraceCheckUtils]: 95: Hoare triple {7986#false} assume true; {7986#false} is VALID [2018-11-23 12:26:26,766 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {7986#false} {7985#true} #74#return; {7986#false} is VALID [2018-11-23 12:26:26,766 INFO L273 TraceCheckUtils]: 97: Hoare triple {7986#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {7986#false} is VALID [2018-11-23 12:26:26,767 INFO L273 TraceCheckUtils]: 98: Hoare triple {7986#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {7986#false} is VALID [2018-11-23 12:26:26,767 INFO L273 TraceCheckUtils]: 99: Hoare triple {7986#false} assume !false; {7986#false} is VALID [2018-11-23 12:26:26,772 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 128 proven. 25 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2018-11-23 12:26:26,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:26,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2018-11-23 12:26:26,792 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2018-11-23 12:26:26,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:26,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:26:26,937 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-23 12:26:26,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:26:26,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:26:26,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:26:26,939 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 24 states. [2018-11-23 12:26:27,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:27,407 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-11-23 12:26:27,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:26:27,408 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2018-11-23 12:26:27,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:27,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:26:27,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 100 transitions. [2018-11-23 12:26:27,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:26:27,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 100 transitions. [2018-11-23 12:26:27,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 100 transitions. [2018-11-23 12:26:27,608 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:27,610 INFO L225 Difference]: With dead ends: 111 [2018-11-23 12:26:27,611 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 12:26:27,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:26:27,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 12:26:27,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-11-23 12:26:27,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:27,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 75 states. [2018-11-23 12:26:27,651 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 75 states. [2018-11-23 12:26:27,651 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 75 states. [2018-11-23 12:26:27,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:27,653 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-23 12:26:27,653 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:26:27,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:27,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:27,654 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 77 states. [2018-11-23 12:26:27,654 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 77 states. [2018-11-23 12:26:27,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:27,655 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-23 12:26:27,655 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:26:27,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:27,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:27,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:27,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:27,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 12:26:27,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-11-23 12:26:27,658 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 100 [2018-11-23 12:26:27,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:27,658 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-11-23 12:26:27,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:26:27,658 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-11-23 12:26:27,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-23 12:26:27,659 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:27,659 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 16, 16, 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-23 12:26:27,660 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:27,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:27,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1648969321, now seen corresponding path program 16 times [2018-11-23 12:26:27,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:27,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:27,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:27,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:27,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:28,123 INFO L256 TraceCheckUtils]: 0: Hoare triple {8737#true} call ULTIMATE.init(); {8737#true} is VALID [2018-11-23 12:26:28,124 INFO L273 TraceCheckUtils]: 1: Hoare triple {8737#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8737#true} is VALID [2018-11-23 12:26:28,124 INFO L273 TraceCheckUtils]: 2: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:26:28,124 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8737#true} {8737#true} #66#return; {8737#true} is VALID [2018-11-23 12:26:28,124 INFO L256 TraceCheckUtils]: 4: Hoare triple {8737#true} call #t~ret13 := main(); {8737#true} is VALID [2018-11-23 12:26:28,125 INFO L273 TraceCheckUtils]: 5: Hoare triple {8737#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; {8739#(= main_~i~1 0)} is VALID [2018-11-23 12:26:28,125 INFO L273 TraceCheckUtils]: 6: Hoare triple {8739#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8739#(= main_~i~1 0)} is VALID [2018-11-23 12:26:28,126 INFO L273 TraceCheckUtils]: 7: Hoare triple {8739#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8740#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:28,126 INFO L273 TraceCheckUtils]: 8: Hoare triple {8740#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8740#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:28,127 INFO L273 TraceCheckUtils]: 9: Hoare triple {8740#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8741#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:28,128 INFO L273 TraceCheckUtils]: 10: Hoare triple {8741#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8741#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:28,128 INFO L273 TraceCheckUtils]: 11: Hoare triple {8741#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8742#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:28,129 INFO L273 TraceCheckUtils]: 12: Hoare triple {8742#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8742#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:28,130 INFO L273 TraceCheckUtils]: 13: Hoare triple {8742#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8743#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:28,131 INFO L273 TraceCheckUtils]: 14: Hoare triple {8743#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8743#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:28,132 INFO L273 TraceCheckUtils]: 15: Hoare triple {8743#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8744#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:28,132 INFO L273 TraceCheckUtils]: 16: Hoare triple {8744#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8744#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:28,133 INFO L273 TraceCheckUtils]: 17: Hoare triple {8744#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8745#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:28,134 INFO L273 TraceCheckUtils]: 18: Hoare triple {8745#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8745#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:28,135 INFO L273 TraceCheckUtils]: 19: Hoare triple {8745#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8746#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:28,136 INFO L273 TraceCheckUtils]: 20: Hoare triple {8746#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8746#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:28,136 INFO L273 TraceCheckUtils]: 21: Hoare triple {8746#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8747#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:28,137 INFO L273 TraceCheckUtils]: 22: Hoare triple {8747#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8747#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:28,138 INFO L273 TraceCheckUtils]: 23: Hoare triple {8747#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8748#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:28,139 INFO L273 TraceCheckUtils]: 24: Hoare triple {8748#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8748#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:28,140 INFO L273 TraceCheckUtils]: 25: Hoare triple {8748#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8749#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:28,140 INFO L273 TraceCheckUtils]: 26: Hoare triple {8749#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8749#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:28,141 INFO L273 TraceCheckUtils]: 27: Hoare triple {8749#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8750#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:28,142 INFO L273 TraceCheckUtils]: 28: Hoare triple {8750#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8750#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:28,143 INFO L273 TraceCheckUtils]: 29: Hoare triple {8750#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8751#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:28,143 INFO L273 TraceCheckUtils]: 30: Hoare triple {8751#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8751#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:28,144 INFO L273 TraceCheckUtils]: 31: Hoare triple {8751#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8752#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:28,145 INFO L273 TraceCheckUtils]: 32: Hoare triple {8752#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8752#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:28,146 INFO L273 TraceCheckUtils]: 33: Hoare triple {8752#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8753#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:28,147 INFO L273 TraceCheckUtils]: 34: Hoare triple {8753#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8753#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:28,148 INFO L273 TraceCheckUtils]: 35: Hoare triple {8753#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8754#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:28,148 INFO L273 TraceCheckUtils]: 36: Hoare triple {8754#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8754#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:28,149 INFO L273 TraceCheckUtils]: 37: Hoare triple {8754#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8755#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:28,150 INFO L273 TraceCheckUtils]: 38: Hoare triple {8755#(<= main_~i~1 16)} assume !(~i~1 < 10000); {8738#false} is VALID [2018-11-23 12:26:28,150 INFO L256 TraceCheckUtils]: 39: Hoare triple {8738#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {8737#true} is VALID [2018-11-23 12:26:28,150 INFO L273 TraceCheckUtils]: 40: Hoare triple {8737#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8737#true} is VALID [2018-11-23 12:26:28,151 INFO L273 TraceCheckUtils]: 41: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:28,151 INFO L273 TraceCheckUtils]: 42: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:28,151 INFO L273 TraceCheckUtils]: 43: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:28,151 INFO L273 TraceCheckUtils]: 44: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:28,151 INFO L273 TraceCheckUtils]: 45: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:28,152 INFO L273 TraceCheckUtils]: 46: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:28,152 INFO L273 TraceCheckUtils]: 47: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:28,152 INFO L273 TraceCheckUtils]: 48: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:28,152 INFO L273 TraceCheckUtils]: 49: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:28,152 INFO L273 TraceCheckUtils]: 50: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:28,153 INFO L273 TraceCheckUtils]: 51: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:28,153 INFO L273 TraceCheckUtils]: 52: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:28,153 INFO L273 TraceCheckUtils]: 53: Hoare triple {8737#true} assume !(~i~0 < 10000); {8737#true} is VALID [2018-11-23 12:26:28,153 INFO L273 TraceCheckUtils]: 54: Hoare triple {8737#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8737#true} is VALID [2018-11-23 12:26:28,153 INFO L273 TraceCheckUtils]: 55: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:26:28,153 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {8737#true} {8738#false} #70#return; {8738#false} is VALID [2018-11-23 12:26:28,153 INFO L273 TraceCheckUtils]: 57: Hoare triple {8738#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:26:28,154 INFO L256 TraceCheckUtils]: 58: Hoare triple {8738#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {8737#true} is VALID [2018-11-23 12:26:28,154 INFO L273 TraceCheckUtils]: 59: Hoare triple {8737#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8737#true} is VALID [2018-11-23 12:26:28,154 INFO L273 TraceCheckUtils]: 60: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:28,154 INFO L273 TraceCheckUtils]: 61: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:28,154 INFO L273 TraceCheckUtils]: 62: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:28,154 INFO L273 TraceCheckUtils]: 63: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:28,154 INFO L273 TraceCheckUtils]: 64: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:28,154 INFO L273 TraceCheckUtils]: 65: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:28,154 INFO L273 TraceCheckUtils]: 66: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:28,155 INFO L273 TraceCheckUtils]: 67: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:28,155 INFO L273 TraceCheckUtils]: 68: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:28,155 INFO L273 TraceCheckUtils]: 69: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:28,155 INFO L273 TraceCheckUtils]: 70: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:28,155 INFO L273 TraceCheckUtils]: 71: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:28,155 INFO L273 TraceCheckUtils]: 72: Hoare triple {8737#true} assume !(~i~0 < 10000); {8737#true} is VALID [2018-11-23 12:26:28,155 INFO L273 TraceCheckUtils]: 73: Hoare triple {8737#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8737#true} is VALID [2018-11-23 12:26:28,155 INFO L273 TraceCheckUtils]: 74: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:26:28,156 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {8737#true} {8738#false} #72#return; {8738#false} is VALID [2018-11-23 12:26:28,156 INFO L273 TraceCheckUtils]: 76: Hoare triple {8738#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {8738#false} is VALID [2018-11-23 12:26:28,156 INFO L273 TraceCheckUtils]: 77: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:26:28,156 INFO L273 TraceCheckUtils]: 78: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:26:28,156 INFO L273 TraceCheckUtils]: 79: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:26:28,156 INFO L273 TraceCheckUtils]: 80: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:26:28,156 INFO L273 TraceCheckUtils]: 81: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:26:28,156 INFO L273 TraceCheckUtils]: 82: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:26:28,156 INFO L273 TraceCheckUtils]: 83: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:26:28,157 INFO L273 TraceCheckUtils]: 84: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:26:28,157 INFO L273 TraceCheckUtils]: 85: Hoare triple {8738#false} assume !(~i~2 < 9999); {8738#false} is VALID [2018-11-23 12:26:28,157 INFO L273 TraceCheckUtils]: 86: Hoare triple {8738#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:26:28,157 INFO L256 TraceCheckUtils]: 87: Hoare triple {8738#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {8737#true} is VALID [2018-11-23 12:26:28,157 INFO L273 TraceCheckUtils]: 88: Hoare triple {8737#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8737#true} is VALID [2018-11-23 12:26:28,157 INFO L273 TraceCheckUtils]: 89: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:28,157 INFO L273 TraceCheckUtils]: 90: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:28,157 INFO L273 TraceCheckUtils]: 91: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:28,157 INFO L273 TraceCheckUtils]: 92: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:28,158 INFO L273 TraceCheckUtils]: 93: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:28,158 INFO L273 TraceCheckUtils]: 94: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:28,158 INFO L273 TraceCheckUtils]: 95: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:28,158 INFO L273 TraceCheckUtils]: 96: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:28,158 INFO L273 TraceCheckUtils]: 97: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:28,158 INFO L273 TraceCheckUtils]: 98: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:28,158 INFO L273 TraceCheckUtils]: 99: Hoare triple {8737#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:28,158 INFO L273 TraceCheckUtils]: 100: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:28,159 INFO L273 TraceCheckUtils]: 101: Hoare triple {8737#true} assume !(~i~0 < 10000); {8737#true} is VALID [2018-11-23 12:26:28,159 INFO L273 TraceCheckUtils]: 102: Hoare triple {8737#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8737#true} is VALID [2018-11-23 12:26:28,159 INFO L273 TraceCheckUtils]: 103: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:26:28,159 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {8737#true} {8738#false} #74#return; {8738#false} is VALID [2018-11-23 12:26:28,159 INFO L273 TraceCheckUtils]: 105: Hoare triple {8738#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {8738#false} is VALID [2018-11-23 12:26:28,159 INFO L273 TraceCheckUtils]: 106: Hoare triple {8738#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {8738#false} is VALID [2018-11-23 12:26:28,159 INFO L273 TraceCheckUtils]: 107: Hoare triple {8738#false} assume !false; {8738#false} is VALID [2018-11-23 12:26:28,165 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2018-11-23 12:26:28,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:28,165 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:28,175 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:26:28,238 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:26:28,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:28,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:28,535 INFO L256 TraceCheckUtils]: 0: Hoare triple {8737#true} call ULTIMATE.init(); {8737#true} is VALID [2018-11-23 12:26:28,536 INFO L273 TraceCheckUtils]: 1: Hoare triple {8737#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8737#true} is VALID [2018-11-23 12:26:28,536 INFO L273 TraceCheckUtils]: 2: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:26:28,536 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8737#true} {8737#true} #66#return; {8737#true} is VALID [2018-11-23 12:26:28,536 INFO L256 TraceCheckUtils]: 4: Hoare triple {8737#true} call #t~ret13 := main(); {8737#true} is VALID [2018-11-23 12:26:28,537 INFO L273 TraceCheckUtils]: 5: Hoare triple {8737#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; {8774#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:28,538 INFO L273 TraceCheckUtils]: 6: Hoare triple {8774#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8774#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:28,538 INFO L273 TraceCheckUtils]: 7: Hoare triple {8774#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8740#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:28,539 INFO L273 TraceCheckUtils]: 8: Hoare triple {8740#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8740#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:28,540 INFO L273 TraceCheckUtils]: 9: Hoare triple {8740#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8741#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:28,540 INFO L273 TraceCheckUtils]: 10: Hoare triple {8741#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8741#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:28,541 INFO L273 TraceCheckUtils]: 11: Hoare triple {8741#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8742#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:28,542 INFO L273 TraceCheckUtils]: 12: Hoare triple {8742#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8742#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:28,543 INFO L273 TraceCheckUtils]: 13: Hoare triple {8742#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8743#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:28,544 INFO L273 TraceCheckUtils]: 14: Hoare triple {8743#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8743#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:28,544 INFO L273 TraceCheckUtils]: 15: Hoare triple {8743#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8744#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:28,545 INFO L273 TraceCheckUtils]: 16: Hoare triple {8744#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8744#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:28,546 INFO L273 TraceCheckUtils]: 17: Hoare triple {8744#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8745#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:28,547 INFO L273 TraceCheckUtils]: 18: Hoare triple {8745#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8745#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:28,548 INFO L273 TraceCheckUtils]: 19: Hoare triple {8745#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8746#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:28,548 INFO L273 TraceCheckUtils]: 20: Hoare triple {8746#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8746#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:28,549 INFO L273 TraceCheckUtils]: 21: Hoare triple {8746#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8747#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:28,550 INFO L273 TraceCheckUtils]: 22: Hoare triple {8747#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8747#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:28,551 INFO L273 TraceCheckUtils]: 23: Hoare triple {8747#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8748#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:28,551 INFO L273 TraceCheckUtils]: 24: Hoare triple {8748#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8748#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:28,552 INFO L273 TraceCheckUtils]: 25: Hoare triple {8748#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8749#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:28,553 INFO L273 TraceCheckUtils]: 26: Hoare triple {8749#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8749#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:28,554 INFO L273 TraceCheckUtils]: 27: Hoare triple {8749#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8750#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:28,555 INFO L273 TraceCheckUtils]: 28: Hoare triple {8750#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8750#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:28,556 INFO L273 TraceCheckUtils]: 29: Hoare triple {8750#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8751#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:28,556 INFO L273 TraceCheckUtils]: 30: Hoare triple {8751#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8751#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:28,557 INFO L273 TraceCheckUtils]: 31: Hoare triple {8751#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8752#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:28,558 INFO L273 TraceCheckUtils]: 32: Hoare triple {8752#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8752#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:28,559 INFO L273 TraceCheckUtils]: 33: Hoare triple {8752#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8753#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:28,559 INFO L273 TraceCheckUtils]: 34: Hoare triple {8753#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8753#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:28,560 INFO L273 TraceCheckUtils]: 35: Hoare triple {8753#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8754#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:28,561 INFO L273 TraceCheckUtils]: 36: Hoare triple {8754#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {8754#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:28,562 INFO L273 TraceCheckUtils]: 37: Hoare triple {8754#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8755#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:28,563 INFO L273 TraceCheckUtils]: 38: Hoare triple {8755#(<= main_~i~1 16)} assume !(~i~1 < 10000); {8738#false} is VALID [2018-11-23 12:26:28,563 INFO L256 TraceCheckUtils]: 39: Hoare triple {8738#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {8738#false} is VALID [2018-11-23 12:26:28,563 INFO L273 TraceCheckUtils]: 40: Hoare triple {8738#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8738#false} is VALID [2018-11-23 12:26:28,563 INFO L273 TraceCheckUtils]: 41: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:28,564 INFO L273 TraceCheckUtils]: 42: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:28,564 INFO L273 TraceCheckUtils]: 43: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:28,564 INFO L273 TraceCheckUtils]: 44: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:28,564 INFO L273 TraceCheckUtils]: 45: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:28,564 INFO L273 TraceCheckUtils]: 46: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:28,565 INFO L273 TraceCheckUtils]: 47: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:28,565 INFO L273 TraceCheckUtils]: 48: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:28,565 INFO L273 TraceCheckUtils]: 49: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:28,565 INFO L273 TraceCheckUtils]: 50: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:28,565 INFO L273 TraceCheckUtils]: 51: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:28,566 INFO L273 TraceCheckUtils]: 52: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:28,566 INFO L273 TraceCheckUtils]: 53: Hoare triple {8738#false} assume !(~i~0 < 10000); {8738#false} is VALID [2018-11-23 12:26:28,566 INFO L273 TraceCheckUtils]: 54: Hoare triple {8738#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8738#false} is VALID [2018-11-23 12:26:28,566 INFO L273 TraceCheckUtils]: 55: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:26:28,566 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {8738#false} {8738#false} #70#return; {8738#false} is VALID [2018-11-23 12:26:28,567 INFO L273 TraceCheckUtils]: 57: Hoare triple {8738#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:26:28,567 INFO L256 TraceCheckUtils]: 58: Hoare triple {8738#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {8738#false} is VALID [2018-11-23 12:26:28,567 INFO L273 TraceCheckUtils]: 59: Hoare triple {8738#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8738#false} is VALID [2018-11-23 12:26:28,567 INFO L273 TraceCheckUtils]: 60: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:28,567 INFO L273 TraceCheckUtils]: 61: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:28,568 INFO L273 TraceCheckUtils]: 62: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:28,568 INFO L273 TraceCheckUtils]: 63: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:28,568 INFO L273 TraceCheckUtils]: 64: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:28,568 INFO L273 TraceCheckUtils]: 65: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:28,568 INFO L273 TraceCheckUtils]: 66: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:28,568 INFO L273 TraceCheckUtils]: 67: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:28,568 INFO L273 TraceCheckUtils]: 68: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:28,568 INFO L273 TraceCheckUtils]: 69: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:28,569 INFO L273 TraceCheckUtils]: 70: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:28,569 INFO L273 TraceCheckUtils]: 71: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:28,569 INFO L273 TraceCheckUtils]: 72: Hoare triple {8738#false} assume !(~i~0 < 10000); {8738#false} is VALID [2018-11-23 12:26:28,569 INFO L273 TraceCheckUtils]: 73: Hoare triple {8738#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8738#false} is VALID [2018-11-23 12:26:28,569 INFO L273 TraceCheckUtils]: 74: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:26:28,569 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {8738#false} {8738#false} #72#return; {8738#false} is VALID [2018-11-23 12:26:28,569 INFO L273 TraceCheckUtils]: 76: Hoare triple {8738#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {8738#false} is VALID [2018-11-23 12:26:28,569 INFO L273 TraceCheckUtils]: 77: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:26:28,569 INFO L273 TraceCheckUtils]: 78: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:26:28,570 INFO L273 TraceCheckUtils]: 79: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:26:28,570 INFO L273 TraceCheckUtils]: 80: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:26:28,570 INFO L273 TraceCheckUtils]: 81: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:26:28,570 INFO L273 TraceCheckUtils]: 82: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:26:28,570 INFO L273 TraceCheckUtils]: 83: Hoare triple {8738#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:26:28,570 INFO L273 TraceCheckUtils]: 84: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:26:28,570 INFO L273 TraceCheckUtils]: 85: Hoare triple {8738#false} assume !(~i~2 < 9999); {8738#false} is VALID [2018-11-23 12:26:28,570 INFO L273 TraceCheckUtils]: 86: Hoare triple {8738#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:26:28,571 INFO L256 TraceCheckUtils]: 87: Hoare triple {8738#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {8738#false} is VALID [2018-11-23 12:26:28,571 INFO L273 TraceCheckUtils]: 88: Hoare triple {8738#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8738#false} is VALID [2018-11-23 12:26:28,571 INFO L273 TraceCheckUtils]: 89: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:28,571 INFO L273 TraceCheckUtils]: 90: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:28,571 INFO L273 TraceCheckUtils]: 91: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:28,571 INFO L273 TraceCheckUtils]: 92: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:28,571 INFO L273 TraceCheckUtils]: 93: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:28,571 INFO L273 TraceCheckUtils]: 94: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:28,571 INFO L273 TraceCheckUtils]: 95: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:28,572 INFO L273 TraceCheckUtils]: 96: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:28,572 INFO L273 TraceCheckUtils]: 97: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:28,572 INFO L273 TraceCheckUtils]: 98: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:28,572 INFO L273 TraceCheckUtils]: 99: Hoare triple {8738#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:28,572 INFO L273 TraceCheckUtils]: 100: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:28,572 INFO L273 TraceCheckUtils]: 101: Hoare triple {8738#false} assume !(~i~0 < 10000); {8738#false} is VALID [2018-11-23 12:26:28,572 INFO L273 TraceCheckUtils]: 102: Hoare triple {8738#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8738#false} is VALID [2018-11-23 12:26:28,572 INFO L273 TraceCheckUtils]: 103: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:26:28,572 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {8738#false} {8738#false} #74#return; {8738#false} is VALID [2018-11-23 12:26:28,573 INFO L273 TraceCheckUtils]: 105: Hoare triple {8738#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {8738#false} is VALID [2018-11-23 12:26:28,573 INFO L273 TraceCheckUtils]: 106: Hoare triple {8738#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {8738#false} is VALID [2018-11-23 12:26:28,573 INFO L273 TraceCheckUtils]: 107: Hoare triple {8738#false} assume !false; {8738#false} is VALID [2018-11-23 12:26:28,578 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2018-11-23 12:26:28,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:28,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:26:28,598 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-11-23 12:26:28,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:28,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:26:28,705 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:28,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:26:28,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:26:28,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:26:28,707 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 20 states. [2018-11-23 12:26:29,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:29,374 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-11-23 12:26:29,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:26:29,375 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-11-23 12:26:29,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:29,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:26:29,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2018-11-23 12:26:29,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:26:29,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2018-11-23 12:26:29,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 86 transitions. [2018-11-23 12:26:29,591 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:29,593 INFO L225 Difference]: With dead ends: 114 [2018-11-23 12:26:29,594 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:26:29,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:26:29,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:26:29,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-23 12:26:29,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:29,638 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-23 12:26:29,638 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-23 12:26:29,638 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-23 12:26:29,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:29,640 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 12:26:29,640 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-23 12:26:29,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:29,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:29,641 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-23 12:26:29,641 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-23 12:26:29,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:29,643 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 12:26:29,643 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-23 12:26:29,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:29,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:29,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:29,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:29,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 12:26:29,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-23 12:26:29,646 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 108 [2018-11-23 12:26:29,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:29,646 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-23 12:26:29,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:26:29,646 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:26:29,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-23 12:26:29,647 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:29,647 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 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-23 12:26:29,647 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:29,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:29,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1027293945, now seen corresponding path program 17 times [2018-11-23 12:26:29,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:29,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:29,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:29,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:29,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:30,127 INFO L256 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2018-11-23 12:26:30,127 INFO L273 TraceCheckUtils]: 1: Hoare triple {9519#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9519#true} is VALID [2018-11-23 12:26:30,128 INFO L273 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:26:30,128 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #66#return; {9519#true} is VALID [2018-11-23 12:26:30,128 INFO L256 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret13 := main(); {9519#true} is VALID [2018-11-23 12:26:30,129 INFO L273 TraceCheckUtils]: 5: Hoare triple {9519#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; {9521#(= main_~i~1 0)} is VALID [2018-11-23 12:26:30,129 INFO L273 TraceCheckUtils]: 6: Hoare triple {9521#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {9521#(= main_~i~1 0)} is VALID [2018-11-23 12:26:30,130 INFO L273 TraceCheckUtils]: 7: Hoare triple {9521#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9522#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:30,131 INFO L273 TraceCheckUtils]: 8: Hoare triple {9522#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {9522#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:30,132 INFO L273 TraceCheckUtils]: 9: Hoare triple {9522#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9523#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:30,133 INFO L273 TraceCheckUtils]: 10: Hoare triple {9523#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {9523#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:30,134 INFO L273 TraceCheckUtils]: 11: Hoare triple {9523#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9524#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:30,134 INFO L273 TraceCheckUtils]: 12: Hoare triple {9524#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {9524#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:30,135 INFO L273 TraceCheckUtils]: 13: Hoare triple {9524#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9525#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:30,136 INFO L273 TraceCheckUtils]: 14: Hoare triple {9525#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {9525#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:30,137 INFO L273 TraceCheckUtils]: 15: Hoare triple {9525#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9526#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:30,137 INFO L273 TraceCheckUtils]: 16: Hoare triple {9526#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {9526#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:30,138 INFO L273 TraceCheckUtils]: 17: Hoare triple {9526#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9527#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:30,139 INFO L273 TraceCheckUtils]: 18: Hoare triple {9527#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {9527#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:30,140 INFO L273 TraceCheckUtils]: 19: Hoare triple {9527#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9528#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:30,141 INFO L273 TraceCheckUtils]: 20: Hoare triple {9528#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {9528#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:30,142 INFO L273 TraceCheckUtils]: 21: Hoare triple {9528#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9529#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:30,142 INFO L273 TraceCheckUtils]: 22: Hoare triple {9529#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {9529#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:30,143 INFO L273 TraceCheckUtils]: 23: Hoare triple {9529#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9530#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:30,144 INFO L273 TraceCheckUtils]: 24: Hoare triple {9530#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {9530#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:30,145 INFO L273 TraceCheckUtils]: 25: Hoare triple {9530#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9531#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:30,148 INFO L273 TraceCheckUtils]: 26: Hoare triple {9531#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {9531#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:30,149 INFO L273 TraceCheckUtils]: 27: Hoare triple {9531#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9532#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:30,149 INFO L273 TraceCheckUtils]: 28: Hoare triple {9532#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {9532#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:30,150 INFO L273 TraceCheckUtils]: 29: Hoare triple {9532#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9533#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:30,150 INFO L273 TraceCheckUtils]: 30: Hoare triple {9533#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {9533#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:30,151 INFO L273 TraceCheckUtils]: 31: Hoare triple {9533#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9534#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:30,152 INFO L273 TraceCheckUtils]: 32: Hoare triple {9534#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {9534#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:30,152 INFO L273 TraceCheckUtils]: 33: Hoare triple {9534#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9535#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:30,153 INFO L273 TraceCheckUtils]: 34: Hoare triple {9535#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {9535#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:30,154 INFO L273 TraceCheckUtils]: 35: Hoare triple {9535#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9536#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:30,155 INFO L273 TraceCheckUtils]: 36: Hoare triple {9536#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {9536#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:30,156 INFO L273 TraceCheckUtils]: 37: Hoare triple {9536#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9537#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:30,156 INFO L273 TraceCheckUtils]: 38: Hoare triple {9537#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {9537#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:30,157 INFO L273 TraceCheckUtils]: 39: Hoare triple {9537#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9538#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:30,158 INFO L273 TraceCheckUtils]: 40: Hoare triple {9538#(<= main_~i~1 17)} assume !(~i~1 < 10000); {9520#false} is VALID [2018-11-23 12:26:30,158 INFO L256 TraceCheckUtils]: 41: Hoare triple {9520#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:26:30,159 INFO L273 TraceCheckUtils]: 42: Hoare triple {9519#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9519#true} is VALID [2018-11-23 12:26:30,159 INFO L273 TraceCheckUtils]: 43: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:30,159 INFO L273 TraceCheckUtils]: 44: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:30,159 INFO L273 TraceCheckUtils]: 45: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:30,159 INFO L273 TraceCheckUtils]: 46: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:30,160 INFO L273 TraceCheckUtils]: 47: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:30,160 INFO L273 TraceCheckUtils]: 48: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:30,160 INFO L273 TraceCheckUtils]: 49: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:30,160 INFO L273 TraceCheckUtils]: 50: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:30,160 INFO L273 TraceCheckUtils]: 51: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:30,161 INFO L273 TraceCheckUtils]: 52: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:30,161 INFO L273 TraceCheckUtils]: 53: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:30,161 INFO L273 TraceCheckUtils]: 54: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:30,161 INFO L273 TraceCheckUtils]: 55: Hoare triple {9519#true} assume !(~i~0 < 10000); {9519#true} is VALID [2018-11-23 12:26:30,161 INFO L273 TraceCheckUtils]: 56: Hoare triple {9519#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9519#true} is VALID [2018-11-23 12:26:30,161 INFO L273 TraceCheckUtils]: 57: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:26:30,161 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {9519#true} {9520#false} #70#return; {9520#false} is VALID [2018-11-23 12:26:30,161 INFO L273 TraceCheckUtils]: 59: Hoare triple {9520#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:26:30,162 INFO L256 TraceCheckUtils]: 60: Hoare triple {9520#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:26:30,162 INFO L273 TraceCheckUtils]: 61: Hoare triple {9519#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9519#true} is VALID [2018-11-23 12:26:30,162 INFO L273 TraceCheckUtils]: 62: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:30,162 INFO L273 TraceCheckUtils]: 63: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:30,162 INFO L273 TraceCheckUtils]: 64: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:30,162 INFO L273 TraceCheckUtils]: 65: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:30,162 INFO L273 TraceCheckUtils]: 66: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:30,162 INFO L273 TraceCheckUtils]: 67: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:30,162 INFO L273 TraceCheckUtils]: 68: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:30,163 INFO L273 TraceCheckUtils]: 69: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:30,163 INFO L273 TraceCheckUtils]: 70: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:30,163 INFO L273 TraceCheckUtils]: 71: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:30,163 INFO L273 TraceCheckUtils]: 72: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:30,163 INFO L273 TraceCheckUtils]: 73: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:30,163 INFO L273 TraceCheckUtils]: 74: Hoare triple {9519#true} assume !(~i~0 < 10000); {9519#true} is VALID [2018-11-23 12:26:30,163 INFO L273 TraceCheckUtils]: 75: Hoare triple {9519#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9519#true} is VALID [2018-11-23 12:26:30,163 INFO L273 TraceCheckUtils]: 76: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:26:30,164 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {9519#true} {9520#false} #72#return; {9520#false} is VALID [2018-11-23 12:26:30,164 INFO L273 TraceCheckUtils]: 78: Hoare triple {9520#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {9520#false} is VALID [2018-11-23 12:26:30,164 INFO L273 TraceCheckUtils]: 79: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9520#false} is VALID [2018-11-23 12:26:30,164 INFO L273 TraceCheckUtils]: 80: Hoare triple {9520#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9520#false} is VALID [2018-11-23 12:26:30,164 INFO L273 TraceCheckUtils]: 81: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9520#false} is VALID [2018-11-23 12:26:30,164 INFO L273 TraceCheckUtils]: 82: Hoare triple {9520#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9520#false} is VALID [2018-11-23 12:26:30,164 INFO L273 TraceCheckUtils]: 83: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9520#false} is VALID [2018-11-23 12:26:30,164 INFO L273 TraceCheckUtils]: 84: Hoare triple {9520#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9520#false} is VALID [2018-11-23 12:26:30,164 INFO L273 TraceCheckUtils]: 85: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9520#false} is VALID [2018-11-23 12:26:30,165 INFO L273 TraceCheckUtils]: 86: Hoare triple {9520#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9520#false} is VALID [2018-11-23 12:26:30,165 INFO L273 TraceCheckUtils]: 87: Hoare triple {9520#false} assume !(~i~2 < 9999); {9520#false} is VALID [2018-11-23 12:26:30,165 INFO L273 TraceCheckUtils]: 88: Hoare triple {9520#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:26:30,165 INFO L256 TraceCheckUtils]: 89: Hoare triple {9520#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:26:30,165 INFO L273 TraceCheckUtils]: 90: Hoare triple {9519#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9519#true} is VALID [2018-11-23 12:26:30,165 INFO L273 TraceCheckUtils]: 91: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:30,165 INFO L273 TraceCheckUtils]: 92: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:30,165 INFO L273 TraceCheckUtils]: 93: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:30,165 INFO L273 TraceCheckUtils]: 94: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:30,166 INFO L273 TraceCheckUtils]: 95: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:30,166 INFO L273 TraceCheckUtils]: 96: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:30,166 INFO L273 TraceCheckUtils]: 97: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:30,166 INFO L273 TraceCheckUtils]: 98: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:30,166 INFO L273 TraceCheckUtils]: 99: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:30,166 INFO L273 TraceCheckUtils]: 100: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:30,166 INFO L273 TraceCheckUtils]: 101: Hoare triple {9519#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:30,166 INFO L273 TraceCheckUtils]: 102: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:30,167 INFO L273 TraceCheckUtils]: 103: Hoare triple {9519#true} assume !(~i~0 < 10000); {9519#true} is VALID [2018-11-23 12:26:30,167 INFO L273 TraceCheckUtils]: 104: Hoare triple {9519#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9519#true} is VALID [2018-11-23 12:26:30,167 INFO L273 TraceCheckUtils]: 105: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:26:30,167 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {9519#true} {9520#false} #74#return; {9520#false} is VALID [2018-11-23 12:26:30,167 INFO L273 TraceCheckUtils]: 107: Hoare triple {9520#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {9520#false} is VALID [2018-11-23 12:26:30,167 INFO L273 TraceCheckUtils]: 108: Hoare triple {9520#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {9520#false} is VALID [2018-11-23 12:26:30,167 INFO L273 TraceCheckUtils]: 109: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2018-11-23 12:26:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2018-11-23 12:26:30,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:30,173 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:30,184 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:26:30,873 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-11-23 12:26:30,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:30,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:31,268 INFO L256 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2018-11-23 12:26:31,269 INFO L273 TraceCheckUtils]: 1: Hoare triple {9519#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9519#true} is VALID [2018-11-23 12:26:31,269 INFO L273 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:26:31,269 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #66#return; {9519#true} is VALID [2018-11-23 12:26:31,270 INFO L256 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret13 := main(); {9519#true} is VALID [2018-11-23 12:26:31,270 INFO L273 TraceCheckUtils]: 5: Hoare triple {9519#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; {9519#true} is VALID [2018-11-23 12:26:31,270 INFO L273 TraceCheckUtils]: 6: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:31,271 INFO L273 TraceCheckUtils]: 7: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:31,271 INFO L273 TraceCheckUtils]: 8: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:31,271 INFO L273 TraceCheckUtils]: 9: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:31,271 INFO L273 TraceCheckUtils]: 10: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:31,271 INFO L273 TraceCheckUtils]: 11: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:31,272 INFO L273 TraceCheckUtils]: 12: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:31,272 INFO L273 TraceCheckUtils]: 13: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:31,272 INFO L273 TraceCheckUtils]: 14: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:31,272 INFO L273 TraceCheckUtils]: 15: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:31,272 INFO L273 TraceCheckUtils]: 16: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:31,272 INFO L273 TraceCheckUtils]: 17: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:31,273 INFO L273 TraceCheckUtils]: 18: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:31,273 INFO L273 TraceCheckUtils]: 19: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:31,273 INFO L273 TraceCheckUtils]: 20: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:31,273 INFO L273 TraceCheckUtils]: 21: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:31,273 INFO L273 TraceCheckUtils]: 22: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:31,273 INFO L273 TraceCheckUtils]: 23: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:31,274 INFO L273 TraceCheckUtils]: 24: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:31,274 INFO L273 TraceCheckUtils]: 25: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:31,274 INFO L273 TraceCheckUtils]: 26: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:31,274 INFO L273 TraceCheckUtils]: 27: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:31,274 INFO L273 TraceCheckUtils]: 28: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:31,275 INFO L273 TraceCheckUtils]: 29: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:31,275 INFO L273 TraceCheckUtils]: 30: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:31,275 INFO L273 TraceCheckUtils]: 31: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:31,275 INFO L273 TraceCheckUtils]: 32: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:31,275 INFO L273 TraceCheckUtils]: 33: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:31,275 INFO L273 TraceCheckUtils]: 34: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:31,275 INFO L273 TraceCheckUtils]: 35: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:31,276 INFO L273 TraceCheckUtils]: 36: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:31,276 INFO L273 TraceCheckUtils]: 37: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:31,276 INFO L273 TraceCheckUtils]: 38: Hoare triple {9519#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:31,276 INFO L273 TraceCheckUtils]: 39: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:31,276 INFO L273 TraceCheckUtils]: 40: Hoare triple {9519#true} assume !(~i~1 < 10000); {9519#true} is VALID [2018-11-23 12:26:31,276 INFO L256 TraceCheckUtils]: 41: Hoare triple {9519#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:26:31,296 INFO L273 TraceCheckUtils]: 42: Hoare triple {9519#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9668#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:31,302 INFO L273 TraceCheckUtils]: 43: Hoare triple {9668#(<= bor_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9668#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:31,303 INFO L273 TraceCheckUtils]: 44: Hoare triple {9668#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9675#(<= bor_~i~0 2)} is VALID [2018-11-23 12:26:31,304 INFO L273 TraceCheckUtils]: 45: Hoare triple {9675#(<= bor_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9675#(<= bor_~i~0 2)} is VALID [2018-11-23 12:26:31,304 INFO L273 TraceCheckUtils]: 46: Hoare triple {9675#(<= bor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9682#(<= bor_~i~0 3)} is VALID [2018-11-23 12:26:31,306 INFO L273 TraceCheckUtils]: 47: Hoare triple {9682#(<= bor_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9682#(<= bor_~i~0 3)} is VALID [2018-11-23 12:26:31,306 INFO L273 TraceCheckUtils]: 48: Hoare triple {9682#(<= bor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9689#(<= bor_~i~0 4)} is VALID [2018-11-23 12:26:31,308 INFO L273 TraceCheckUtils]: 49: Hoare triple {9689#(<= bor_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9689#(<= bor_~i~0 4)} is VALID [2018-11-23 12:26:31,309 INFO L273 TraceCheckUtils]: 50: Hoare triple {9689#(<= bor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9696#(<= bor_~i~0 5)} is VALID [2018-11-23 12:26:31,309 INFO L273 TraceCheckUtils]: 51: Hoare triple {9696#(<= bor_~i~0 5)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9696#(<= bor_~i~0 5)} is VALID [2018-11-23 12:26:31,310 INFO L273 TraceCheckUtils]: 52: Hoare triple {9696#(<= bor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9703#(<= bor_~i~0 6)} is VALID [2018-11-23 12:26:31,310 INFO L273 TraceCheckUtils]: 53: Hoare triple {9703#(<= bor_~i~0 6)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9703#(<= bor_~i~0 6)} is VALID [2018-11-23 12:26:31,311 INFO L273 TraceCheckUtils]: 54: Hoare triple {9703#(<= bor_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9710#(<= bor_~i~0 7)} is VALID [2018-11-23 12:26:31,311 INFO L273 TraceCheckUtils]: 55: Hoare triple {9710#(<= bor_~i~0 7)} assume !(~i~0 < 10000); {9520#false} is VALID [2018-11-23 12:26:31,311 INFO L273 TraceCheckUtils]: 56: Hoare triple {9520#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9520#false} is VALID [2018-11-23 12:26:31,311 INFO L273 TraceCheckUtils]: 57: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:26:31,311 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {9520#false} {9519#true} #70#return; {9520#false} is VALID [2018-11-23 12:26:31,312 INFO L273 TraceCheckUtils]: 59: Hoare triple {9520#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:26:31,312 INFO L256 TraceCheckUtils]: 60: Hoare triple {9520#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {9520#false} is VALID [2018-11-23 12:26:31,312 INFO L273 TraceCheckUtils]: 61: Hoare triple {9520#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9520#false} is VALID [2018-11-23 12:26:31,312 INFO L273 TraceCheckUtils]: 62: Hoare triple {9520#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:26:31,312 INFO L273 TraceCheckUtils]: 63: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:26:31,312 INFO L273 TraceCheckUtils]: 64: Hoare triple {9520#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:26:31,313 INFO L273 TraceCheckUtils]: 65: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:26:31,313 INFO L273 TraceCheckUtils]: 66: Hoare triple {9520#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:26:31,313 INFO L273 TraceCheckUtils]: 67: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:26:31,313 INFO L273 TraceCheckUtils]: 68: Hoare triple {9520#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:26:31,313 INFO L273 TraceCheckUtils]: 69: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:26:31,314 INFO L273 TraceCheckUtils]: 70: Hoare triple {9520#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:26:31,314 INFO L273 TraceCheckUtils]: 71: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:26:31,314 INFO L273 TraceCheckUtils]: 72: Hoare triple {9520#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:26:31,314 INFO L273 TraceCheckUtils]: 73: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:26:31,314 INFO L273 TraceCheckUtils]: 74: Hoare triple {9520#false} assume !(~i~0 < 10000); {9520#false} is VALID [2018-11-23 12:26:31,314 INFO L273 TraceCheckUtils]: 75: Hoare triple {9520#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9520#false} is VALID [2018-11-23 12:26:31,314 INFO L273 TraceCheckUtils]: 76: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:26:31,315 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {9520#false} {9520#false} #72#return; {9520#false} is VALID [2018-11-23 12:26:31,315 INFO L273 TraceCheckUtils]: 78: Hoare triple {9520#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {9520#false} is VALID [2018-11-23 12:26:31,315 INFO L273 TraceCheckUtils]: 79: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9520#false} is VALID [2018-11-23 12:26:31,315 INFO L273 TraceCheckUtils]: 80: Hoare triple {9520#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9520#false} is VALID [2018-11-23 12:26:31,315 INFO L273 TraceCheckUtils]: 81: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9520#false} is VALID [2018-11-23 12:26:31,315 INFO L273 TraceCheckUtils]: 82: Hoare triple {9520#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9520#false} is VALID [2018-11-23 12:26:31,315 INFO L273 TraceCheckUtils]: 83: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9520#false} is VALID [2018-11-23 12:26:31,315 INFO L273 TraceCheckUtils]: 84: Hoare triple {9520#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9520#false} is VALID [2018-11-23 12:26:31,315 INFO L273 TraceCheckUtils]: 85: Hoare triple {9520#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9520#false} is VALID [2018-11-23 12:26:31,316 INFO L273 TraceCheckUtils]: 86: Hoare triple {9520#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9520#false} is VALID [2018-11-23 12:26:31,316 INFO L273 TraceCheckUtils]: 87: Hoare triple {9520#false} assume !(~i~2 < 9999); {9520#false} is VALID [2018-11-23 12:26:31,316 INFO L273 TraceCheckUtils]: 88: Hoare triple {9520#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:26:31,316 INFO L256 TraceCheckUtils]: 89: Hoare triple {9520#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {9520#false} is VALID [2018-11-23 12:26:31,316 INFO L273 TraceCheckUtils]: 90: Hoare triple {9520#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9520#false} is VALID [2018-11-23 12:26:31,316 INFO L273 TraceCheckUtils]: 91: Hoare triple {9520#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:26:31,316 INFO L273 TraceCheckUtils]: 92: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:26:31,316 INFO L273 TraceCheckUtils]: 93: Hoare triple {9520#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:26:31,316 INFO L273 TraceCheckUtils]: 94: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:26:31,317 INFO L273 TraceCheckUtils]: 95: Hoare triple {9520#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:26:31,317 INFO L273 TraceCheckUtils]: 96: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:26:31,317 INFO L273 TraceCheckUtils]: 97: Hoare triple {9520#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:26:31,317 INFO L273 TraceCheckUtils]: 98: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:26:31,317 INFO L273 TraceCheckUtils]: 99: Hoare triple {9520#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:26:31,317 INFO L273 TraceCheckUtils]: 100: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:26:31,317 INFO L273 TraceCheckUtils]: 101: Hoare triple {9520#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:26:31,317 INFO L273 TraceCheckUtils]: 102: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:26:31,317 INFO L273 TraceCheckUtils]: 103: Hoare triple {9520#false} assume !(~i~0 < 10000); {9520#false} is VALID [2018-11-23 12:26:31,318 INFO L273 TraceCheckUtils]: 104: Hoare triple {9520#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9520#false} is VALID [2018-11-23 12:26:31,318 INFO L273 TraceCheckUtils]: 105: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:26:31,318 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {9520#false} {9520#false} #74#return; {9520#false} is VALID [2018-11-23 12:26:31,318 INFO L273 TraceCheckUtils]: 107: Hoare triple {9520#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {9520#false} is VALID [2018-11-23 12:26:31,318 INFO L273 TraceCheckUtils]: 108: Hoare triple {9520#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {9520#false} is VALID [2018-11-23 12:26:31,318 INFO L273 TraceCheckUtils]: 109: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2018-11-23 12:26:31,323 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 172 proven. 36 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2018-11-23 12:26:31,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:31,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2018-11-23 12:26:31,344 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-11-23 12:26:31,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:31,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:26:31,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:31,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:26:31,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:26:31,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:26:31,659 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 27 states. [2018-11-23 12:26:32,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:32,646 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2018-11-23 12:26:32,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 12:26:32,646 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-11-23 12:26:32,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:32,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:26:32,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 106 transitions. [2018-11-23 12:26:32,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:26:32,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 106 transitions. [2018-11-23 12:26:32,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 106 transitions. [2018-11-23 12:26:32,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:32,817 INFO L225 Difference]: With dead ends: 119 [2018-11-23 12:26:32,817 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 12:26:32,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:26:32,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 12:26:32,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-11-23 12:26:32,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:32,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 81 states. [2018-11-23 12:26:32,869 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 81 states. [2018-11-23 12:26:32,870 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 81 states. [2018-11-23 12:26:32,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:32,872 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 12:26:32,872 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 12:26:32,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:32,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:32,873 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 83 states. [2018-11-23 12:26:32,873 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 83 states. [2018-11-23 12:26:32,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:32,875 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 12:26:32,875 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 12:26:32,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:32,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:32,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:32,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:32,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 12:26:32,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-11-23 12:26:32,878 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 110 [2018-11-23 12:26:32,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:32,878 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-11-23 12:26:32,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:26:32,879 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-23 12:26:32,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-23 12:26:32,880 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:32,880 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 18, 18, 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-23 12:26:32,880 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:32,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:32,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1680928935, now seen corresponding path program 18 times [2018-11-23 12:26:32,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:32,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:32,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:32,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:32,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:33,442 INFO L256 TraceCheckUtils]: 0: Hoare triple {10337#true} call ULTIMATE.init(); {10337#true} is VALID [2018-11-23 12:26:33,442 INFO L273 TraceCheckUtils]: 1: Hoare triple {10337#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10337#true} is VALID [2018-11-23 12:26:33,443 INFO L273 TraceCheckUtils]: 2: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:26:33,443 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10337#true} {10337#true} #66#return; {10337#true} is VALID [2018-11-23 12:26:33,443 INFO L256 TraceCheckUtils]: 4: Hoare triple {10337#true} call #t~ret13 := main(); {10337#true} is VALID [2018-11-23 12:26:33,444 INFO L273 TraceCheckUtils]: 5: Hoare triple {10337#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; {10339#(= main_~i~1 0)} is VALID [2018-11-23 12:26:33,444 INFO L273 TraceCheckUtils]: 6: Hoare triple {10339#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {10339#(= main_~i~1 0)} is VALID [2018-11-23 12:26:33,445 INFO L273 TraceCheckUtils]: 7: Hoare triple {10339#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10340#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:33,445 INFO L273 TraceCheckUtils]: 8: Hoare triple {10340#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {10340#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:33,446 INFO L273 TraceCheckUtils]: 9: Hoare triple {10340#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10341#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:33,446 INFO L273 TraceCheckUtils]: 10: Hoare triple {10341#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {10341#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:33,447 INFO L273 TraceCheckUtils]: 11: Hoare triple {10341#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10342#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:33,448 INFO L273 TraceCheckUtils]: 12: Hoare triple {10342#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {10342#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:33,449 INFO L273 TraceCheckUtils]: 13: Hoare triple {10342#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10343#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:33,449 INFO L273 TraceCheckUtils]: 14: Hoare triple {10343#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {10343#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:33,450 INFO L273 TraceCheckUtils]: 15: Hoare triple {10343#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10344#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:33,451 INFO L273 TraceCheckUtils]: 16: Hoare triple {10344#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {10344#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:33,452 INFO L273 TraceCheckUtils]: 17: Hoare triple {10344#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10345#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:33,453 INFO L273 TraceCheckUtils]: 18: Hoare triple {10345#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {10345#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:33,453 INFO L273 TraceCheckUtils]: 19: Hoare triple {10345#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10346#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:33,456 INFO L273 TraceCheckUtils]: 20: Hoare triple {10346#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {10346#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:33,457 INFO L273 TraceCheckUtils]: 21: Hoare triple {10346#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10347#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:33,459 INFO L273 TraceCheckUtils]: 22: Hoare triple {10347#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {10347#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:33,460 INFO L273 TraceCheckUtils]: 23: Hoare triple {10347#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10348#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:33,461 INFO L273 TraceCheckUtils]: 24: Hoare triple {10348#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {10348#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:33,462 INFO L273 TraceCheckUtils]: 25: Hoare triple {10348#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10349#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:33,463 INFO L273 TraceCheckUtils]: 26: Hoare triple {10349#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {10349#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:33,464 INFO L273 TraceCheckUtils]: 27: Hoare triple {10349#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10350#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:33,464 INFO L273 TraceCheckUtils]: 28: Hoare triple {10350#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {10350#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:33,465 INFO L273 TraceCheckUtils]: 29: Hoare triple {10350#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10351#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:33,466 INFO L273 TraceCheckUtils]: 30: Hoare triple {10351#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {10351#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:33,470 INFO L273 TraceCheckUtils]: 31: Hoare triple {10351#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10352#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:33,470 INFO L273 TraceCheckUtils]: 32: Hoare triple {10352#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {10352#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:33,471 INFO L273 TraceCheckUtils]: 33: Hoare triple {10352#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10353#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:33,472 INFO L273 TraceCheckUtils]: 34: Hoare triple {10353#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {10353#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:33,472 INFO L273 TraceCheckUtils]: 35: Hoare triple {10353#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10354#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:33,473 INFO L273 TraceCheckUtils]: 36: Hoare triple {10354#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {10354#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:33,473 INFO L273 TraceCheckUtils]: 37: Hoare triple {10354#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10355#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:33,474 INFO L273 TraceCheckUtils]: 38: Hoare triple {10355#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {10355#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:33,475 INFO L273 TraceCheckUtils]: 39: Hoare triple {10355#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10356#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:33,475 INFO L273 TraceCheckUtils]: 40: Hoare triple {10356#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {10356#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:33,476 INFO L273 TraceCheckUtils]: 41: Hoare triple {10356#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10357#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:33,477 INFO L273 TraceCheckUtils]: 42: Hoare triple {10357#(<= main_~i~1 18)} assume !(~i~1 < 10000); {10338#false} is VALID [2018-11-23 12:26:33,477 INFO L256 TraceCheckUtils]: 43: Hoare triple {10338#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:26:33,478 INFO L273 TraceCheckUtils]: 44: Hoare triple {10337#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10337#true} is VALID [2018-11-23 12:26:33,478 INFO L273 TraceCheckUtils]: 45: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,478 INFO L273 TraceCheckUtils]: 46: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,478 INFO L273 TraceCheckUtils]: 47: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,478 INFO L273 TraceCheckUtils]: 48: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,479 INFO L273 TraceCheckUtils]: 49: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,479 INFO L273 TraceCheckUtils]: 50: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,479 INFO L273 TraceCheckUtils]: 51: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,479 INFO L273 TraceCheckUtils]: 52: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,479 INFO L273 TraceCheckUtils]: 53: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,479 INFO L273 TraceCheckUtils]: 54: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,479 INFO L273 TraceCheckUtils]: 55: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,480 INFO L273 TraceCheckUtils]: 56: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,480 INFO L273 TraceCheckUtils]: 57: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,480 INFO L273 TraceCheckUtils]: 58: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,480 INFO L273 TraceCheckUtils]: 59: Hoare triple {10337#true} assume !(~i~0 < 10000); {10337#true} is VALID [2018-11-23 12:26:33,480 INFO L273 TraceCheckUtils]: 60: Hoare triple {10337#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:26:33,480 INFO L273 TraceCheckUtils]: 61: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:26:33,480 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {10337#true} {10338#false} #70#return; {10338#false} is VALID [2018-11-23 12:26:33,480 INFO L273 TraceCheckUtils]: 63: Hoare triple {10338#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {10338#false} is VALID [2018-11-23 12:26:33,480 INFO L256 TraceCheckUtils]: 64: Hoare triple {10338#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:26:33,481 INFO L273 TraceCheckUtils]: 65: Hoare triple {10337#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10337#true} is VALID [2018-11-23 12:26:33,481 INFO L273 TraceCheckUtils]: 66: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,481 INFO L273 TraceCheckUtils]: 67: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,481 INFO L273 TraceCheckUtils]: 68: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,481 INFO L273 TraceCheckUtils]: 69: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,481 INFO L273 TraceCheckUtils]: 70: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,481 INFO L273 TraceCheckUtils]: 71: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,481 INFO L273 TraceCheckUtils]: 72: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,482 INFO L273 TraceCheckUtils]: 73: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,482 INFO L273 TraceCheckUtils]: 74: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,482 INFO L273 TraceCheckUtils]: 75: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,482 INFO L273 TraceCheckUtils]: 76: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,482 INFO L273 TraceCheckUtils]: 77: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,482 INFO L273 TraceCheckUtils]: 78: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,482 INFO L273 TraceCheckUtils]: 79: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,482 INFO L273 TraceCheckUtils]: 80: Hoare triple {10337#true} assume !(~i~0 < 10000); {10337#true} is VALID [2018-11-23 12:26:33,483 INFO L273 TraceCheckUtils]: 81: Hoare triple {10337#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:26:33,483 INFO L273 TraceCheckUtils]: 82: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:26:33,483 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {10337#true} {10338#false} #72#return; {10338#false} is VALID [2018-11-23 12:26:33,483 INFO L273 TraceCheckUtils]: 84: Hoare triple {10338#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {10338#false} is VALID [2018-11-23 12:26:33,483 INFO L273 TraceCheckUtils]: 85: Hoare triple {10338#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10338#false} is VALID [2018-11-23 12:26:33,483 INFO L273 TraceCheckUtils]: 86: Hoare triple {10338#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10338#false} is VALID [2018-11-23 12:26:33,483 INFO L273 TraceCheckUtils]: 87: Hoare triple {10338#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10338#false} is VALID [2018-11-23 12:26:33,483 INFO L273 TraceCheckUtils]: 88: Hoare triple {10338#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10338#false} is VALID [2018-11-23 12:26:33,483 INFO L273 TraceCheckUtils]: 89: Hoare triple {10338#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10338#false} is VALID [2018-11-23 12:26:33,484 INFO L273 TraceCheckUtils]: 90: Hoare triple {10338#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10338#false} is VALID [2018-11-23 12:26:33,484 INFO L273 TraceCheckUtils]: 91: Hoare triple {10338#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10338#false} is VALID [2018-11-23 12:26:33,484 INFO L273 TraceCheckUtils]: 92: Hoare triple {10338#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10338#false} is VALID [2018-11-23 12:26:33,484 INFO L273 TraceCheckUtils]: 93: Hoare triple {10338#false} assume !(~i~2 < 9999); {10338#false} is VALID [2018-11-23 12:26:33,484 INFO L273 TraceCheckUtils]: 94: Hoare triple {10338#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {10338#false} is VALID [2018-11-23 12:26:33,484 INFO L256 TraceCheckUtils]: 95: Hoare triple {10338#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:26:33,484 INFO L273 TraceCheckUtils]: 96: Hoare triple {10337#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10337#true} is VALID [2018-11-23 12:26:33,484 INFO L273 TraceCheckUtils]: 97: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,484 INFO L273 TraceCheckUtils]: 98: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,485 INFO L273 TraceCheckUtils]: 99: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,485 INFO L273 TraceCheckUtils]: 100: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,485 INFO L273 TraceCheckUtils]: 101: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,485 INFO L273 TraceCheckUtils]: 102: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,485 INFO L273 TraceCheckUtils]: 103: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,485 INFO L273 TraceCheckUtils]: 104: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,485 INFO L273 TraceCheckUtils]: 105: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,485 INFO L273 TraceCheckUtils]: 106: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,486 INFO L273 TraceCheckUtils]: 107: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,486 INFO L273 TraceCheckUtils]: 108: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,486 INFO L273 TraceCheckUtils]: 109: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,486 INFO L273 TraceCheckUtils]: 110: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,486 INFO L273 TraceCheckUtils]: 111: Hoare triple {10337#true} assume !(~i~0 < 10000); {10337#true} is VALID [2018-11-23 12:26:33,486 INFO L273 TraceCheckUtils]: 112: Hoare triple {10337#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:26:33,486 INFO L273 TraceCheckUtils]: 113: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:26:33,486 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {10337#true} {10338#false} #74#return; {10338#false} is VALID [2018-11-23 12:26:33,486 INFO L273 TraceCheckUtils]: 115: Hoare triple {10338#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {10338#false} is VALID [2018-11-23 12:26:33,487 INFO L273 TraceCheckUtils]: 116: Hoare triple {10338#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {10338#false} is VALID [2018-11-23 12:26:33,487 INFO L273 TraceCheckUtils]: 117: Hoare triple {10338#false} assume !false; {10338#false} is VALID [2018-11-23 12:26:33,493 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2018-11-23 12:26:33,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:33,493 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:33,502 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:26:33,672 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-23 12:26:33,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:33,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:33,972 INFO L256 TraceCheckUtils]: 0: Hoare triple {10337#true} call ULTIMATE.init(); {10337#true} is VALID [2018-11-23 12:26:33,972 INFO L273 TraceCheckUtils]: 1: Hoare triple {10337#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10337#true} is VALID [2018-11-23 12:26:33,972 INFO L273 TraceCheckUtils]: 2: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:26:33,972 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10337#true} {10337#true} #66#return; {10337#true} is VALID [2018-11-23 12:26:33,973 INFO L256 TraceCheckUtils]: 4: Hoare triple {10337#true} call #t~ret13 := main(); {10337#true} is VALID [2018-11-23 12:26:33,973 INFO L273 TraceCheckUtils]: 5: Hoare triple {10337#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; {10337#true} is VALID [2018-11-23 12:26:33,973 INFO L273 TraceCheckUtils]: 6: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:33,973 INFO L273 TraceCheckUtils]: 7: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:33,973 INFO L273 TraceCheckUtils]: 8: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:33,974 INFO L273 TraceCheckUtils]: 9: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:33,974 INFO L273 TraceCheckUtils]: 10: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:33,974 INFO L273 TraceCheckUtils]: 11: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:33,974 INFO L273 TraceCheckUtils]: 12: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:33,974 INFO L273 TraceCheckUtils]: 13: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:33,975 INFO L273 TraceCheckUtils]: 14: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:33,975 INFO L273 TraceCheckUtils]: 15: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:33,975 INFO L273 TraceCheckUtils]: 16: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:33,975 INFO L273 TraceCheckUtils]: 17: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:33,975 INFO L273 TraceCheckUtils]: 18: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:33,975 INFO L273 TraceCheckUtils]: 19: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:33,975 INFO L273 TraceCheckUtils]: 20: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:33,976 INFO L273 TraceCheckUtils]: 21: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:33,976 INFO L273 TraceCheckUtils]: 22: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:33,976 INFO L273 TraceCheckUtils]: 23: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:33,976 INFO L273 TraceCheckUtils]: 24: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:33,976 INFO L273 TraceCheckUtils]: 25: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:33,976 INFO L273 TraceCheckUtils]: 26: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:33,976 INFO L273 TraceCheckUtils]: 27: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:33,976 INFO L273 TraceCheckUtils]: 28: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:33,976 INFO L273 TraceCheckUtils]: 29: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:33,977 INFO L273 TraceCheckUtils]: 30: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:33,977 INFO L273 TraceCheckUtils]: 31: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:33,977 INFO L273 TraceCheckUtils]: 32: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:33,977 INFO L273 TraceCheckUtils]: 33: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:33,977 INFO L273 TraceCheckUtils]: 34: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:33,977 INFO L273 TraceCheckUtils]: 35: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:33,977 INFO L273 TraceCheckUtils]: 36: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:33,977 INFO L273 TraceCheckUtils]: 37: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:33,978 INFO L273 TraceCheckUtils]: 38: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:33,978 INFO L273 TraceCheckUtils]: 39: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:33,978 INFO L273 TraceCheckUtils]: 40: Hoare triple {10337#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:33,978 INFO L273 TraceCheckUtils]: 41: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:33,978 INFO L273 TraceCheckUtils]: 42: Hoare triple {10337#true} assume !(~i~1 < 10000); {10337#true} is VALID [2018-11-23 12:26:33,978 INFO L256 TraceCheckUtils]: 43: Hoare triple {10337#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:26:33,978 INFO L273 TraceCheckUtils]: 44: Hoare triple {10337#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10337#true} is VALID [2018-11-23 12:26:33,978 INFO L273 TraceCheckUtils]: 45: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,978 INFO L273 TraceCheckUtils]: 46: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,979 INFO L273 TraceCheckUtils]: 47: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,979 INFO L273 TraceCheckUtils]: 48: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,979 INFO L273 TraceCheckUtils]: 49: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,979 INFO L273 TraceCheckUtils]: 50: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,979 INFO L273 TraceCheckUtils]: 51: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,979 INFO L273 TraceCheckUtils]: 52: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,979 INFO L273 TraceCheckUtils]: 53: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,979 INFO L273 TraceCheckUtils]: 54: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,979 INFO L273 TraceCheckUtils]: 55: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,980 INFO L273 TraceCheckUtils]: 56: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,980 INFO L273 TraceCheckUtils]: 57: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,980 INFO L273 TraceCheckUtils]: 58: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,980 INFO L273 TraceCheckUtils]: 59: Hoare triple {10337#true} assume !(~i~0 < 10000); {10337#true} is VALID [2018-11-23 12:26:33,980 INFO L273 TraceCheckUtils]: 60: Hoare triple {10337#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:26:33,980 INFO L273 TraceCheckUtils]: 61: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:26:33,980 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {10337#true} {10337#true} #70#return; {10337#true} is VALID [2018-11-23 12:26:33,980 INFO L273 TraceCheckUtils]: 63: Hoare triple {10337#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {10337#true} is VALID [2018-11-23 12:26:33,980 INFO L256 TraceCheckUtils]: 64: Hoare triple {10337#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:26:33,981 INFO L273 TraceCheckUtils]: 65: Hoare triple {10337#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10337#true} is VALID [2018-11-23 12:26:33,981 INFO L273 TraceCheckUtils]: 66: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,981 INFO L273 TraceCheckUtils]: 67: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,981 INFO L273 TraceCheckUtils]: 68: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,981 INFO L273 TraceCheckUtils]: 69: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,981 INFO L273 TraceCheckUtils]: 70: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,981 INFO L273 TraceCheckUtils]: 71: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,981 INFO L273 TraceCheckUtils]: 72: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,981 INFO L273 TraceCheckUtils]: 73: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,982 INFO L273 TraceCheckUtils]: 74: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,982 INFO L273 TraceCheckUtils]: 75: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,982 INFO L273 TraceCheckUtils]: 76: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,982 INFO L273 TraceCheckUtils]: 77: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,982 INFO L273 TraceCheckUtils]: 78: Hoare triple {10337#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:33,982 INFO L273 TraceCheckUtils]: 79: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:33,982 INFO L273 TraceCheckUtils]: 80: Hoare triple {10337#true} assume !(~i~0 < 10000); {10337#true} is VALID [2018-11-23 12:26:33,982 INFO L273 TraceCheckUtils]: 81: Hoare triple {10337#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:26:33,983 INFO L273 TraceCheckUtils]: 82: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:26:33,983 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {10337#true} {10337#true} #72#return; {10337#true} is VALID [2018-11-23 12:26:33,983 INFO L273 TraceCheckUtils]: 84: Hoare triple {10337#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {10613#(<= main_~i~2 0)} is VALID [2018-11-23 12:26:33,984 INFO L273 TraceCheckUtils]: 85: Hoare triple {10613#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10613#(<= main_~i~2 0)} is VALID [2018-11-23 12:26:33,984 INFO L273 TraceCheckUtils]: 86: Hoare triple {10613#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10620#(<= main_~i~2 1)} is VALID [2018-11-23 12:26:33,985 INFO L273 TraceCheckUtils]: 87: Hoare triple {10620#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10620#(<= main_~i~2 1)} is VALID [2018-11-23 12:26:33,985 INFO L273 TraceCheckUtils]: 88: Hoare triple {10620#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10627#(<= main_~i~2 2)} is VALID [2018-11-23 12:26:33,986 INFO L273 TraceCheckUtils]: 89: Hoare triple {10627#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10627#(<= main_~i~2 2)} is VALID [2018-11-23 12:26:33,987 INFO L273 TraceCheckUtils]: 90: Hoare triple {10627#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10634#(<= main_~i~2 3)} is VALID [2018-11-23 12:26:33,988 INFO L273 TraceCheckUtils]: 91: Hoare triple {10634#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10634#(<= main_~i~2 3)} is VALID [2018-11-23 12:26:33,989 INFO L273 TraceCheckUtils]: 92: Hoare triple {10634#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10641#(<= main_~i~2 4)} is VALID [2018-11-23 12:26:33,989 INFO L273 TraceCheckUtils]: 93: Hoare triple {10641#(<= main_~i~2 4)} assume !(~i~2 < 9999); {10338#false} is VALID [2018-11-23 12:26:33,990 INFO L273 TraceCheckUtils]: 94: Hoare triple {10338#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {10338#false} is VALID [2018-11-23 12:26:33,990 INFO L256 TraceCheckUtils]: 95: Hoare triple {10338#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {10338#false} is VALID [2018-11-23 12:26:33,990 INFO L273 TraceCheckUtils]: 96: Hoare triple {10338#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10338#false} is VALID [2018-11-23 12:26:33,990 INFO L273 TraceCheckUtils]: 97: Hoare triple {10338#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10338#false} is VALID [2018-11-23 12:26:33,990 INFO L273 TraceCheckUtils]: 98: Hoare triple {10338#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10338#false} is VALID [2018-11-23 12:26:33,991 INFO L273 TraceCheckUtils]: 99: Hoare triple {10338#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10338#false} is VALID [2018-11-23 12:26:33,991 INFO L273 TraceCheckUtils]: 100: Hoare triple {10338#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10338#false} is VALID [2018-11-23 12:26:33,991 INFO L273 TraceCheckUtils]: 101: Hoare triple {10338#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10338#false} is VALID [2018-11-23 12:26:33,991 INFO L273 TraceCheckUtils]: 102: Hoare triple {10338#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10338#false} is VALID [2018-11-23 12:26:33,991 INFO L273 TraceCheckUtils]: 103: Hoare triple {10338#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10338#false} is VALID [2018-11-23 12:26:33,992 INFO L273 TraceCheckUtils]: 104: Hoare triple {10338#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10338#false} is VALID [2018-11-23 12:26:33,992 INFO L273 TraceCheckUtils]: 105: Hoare triple {10338#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10338#false} is VALID [2018-11-23 12:26:33,992 INFO L273 TraceCheckUtils]: 106: Hoare triple {10338#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10338#false} is VALID [2018-11-23 12:26:33,992 INFO L273 TraceCheckUtils]: 107: Hoare triple {10338#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10338#false} is VALID [2018-11-23 12:26:33,992 INFO L273 TraceCheckUtils]: 108: Hoare triple {10338#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10338#false} is VALID [2018-11-23 12:26:33,993 INFO L273 TraceCheckUtils]: 109: Hoare triple {10338#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10338#false} is VALID [2018-11-23 12:26:33,993 INFO L273 TraceCheckUtils]: 110: Hoare triple {10338#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10338#false} is VALID [2018-11-23 12:26:33,993 INFO L273 TraceCheckUtils]: 111: Hoare triple {10338#false} assume !(~i~0 < 10000); {10338#false} is VALID [2018-11-23 12:26:33,993 INFO L273 TraceCheckUtils]: 112: Hoare triple {10338#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10338#false} is VALID [2018-11-23 12:26:33,993 INFO L273 TraceCheckUtils]: 113: Hoare triple {10338#false} assume true; {10338#false} is VALID [2018-11-23 12:26:33,994 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {10338#false} {10338#false} #74#return; {10338#false} is VALID [2018-11-23 12:26:33,994 INFO L273 TraceCheckUtils]: 115: Hoare triple {10338#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {10338#false} is VALID [2018-11-23 12:26:33,994 INFO L273 TraceCheckUtils]: 116: Hoare triple {10338#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {10338#false} is VALID [2018-11-23 12:26:33,994 INFO L273 TraceCheckUtils]: 117: Hoare triple {10338#false} assume !false; {10338#false} is VALID [2018-11-23 12:26:34,000 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 234 proven. 16 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2018-11-23 12:26:34,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:34,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7] total 26 [2018-11-23 12:26:34,021 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2018-11-23 12:26:34,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:34,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:26:34,152 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:34,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:26:34,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:26:34,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:26:34,154 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 26 states. [2018-11-23 12:26:35,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:35,206 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2018-11-23 12:26:35,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:26:35,206 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2018-11-23 12:26:35,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:35,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:26:35,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 101 transitions. [2018-11-23 12:26:35,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:26:35,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 101 transitions. [2018-11-23 12:26:35,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 101 transitions. [2018-11-23 12:26:35,545 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:35,547 INFO L225 Difference]: With dead ends: 125 [2018-11-23 12:26:35,548 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 12:26:35,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:26:35,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 12:26:35,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-11-23 12:26:35,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:35,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 85 states. [2018-11-23 12:26:35,593 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 85 states. [2018-11-23 12:26:35,593 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 85 states. [2018-11-23 12:26:35,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:35,596 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-11-23 12:26:35,596 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:26:35,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:35,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:35,596 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 87 states. [2018-11-23 12:26:35,597 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 87 states. [2018-11-23 12:26:35,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:35,598 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-11-23 12:26:35,598 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:26:35,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:35,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:35,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:35,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:35,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 12:26:35,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-11-23 12:26:35,601 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 118 [2018-11-23 12:26:35,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:35,601 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-11-23 12:26:35,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:26:35,602 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-23 12:26:35,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-23 12:26:35,602 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:35,603 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 19, 19, 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-23 12:26:35,603 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:35,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:35,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1116806727, now seen corresponding path program 19 times [2018-11-23 12:26:35,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:35,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:35,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:35,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:35,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:36,407 INFO L256 TraceCheckUtils]: 0: Hoare triple {11201#true} call ULTIMATE.init(); {11201#true} is VALID [2018-11-23 12:26:36,408 INFO L273 TraceCheckUtils]: 1: Hoare triple {11201#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11201#true} is VALID [2018-11-23 12:26:36,408 INFO L273 TraceCheckUtils]: 2: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:26:36,408 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11201#true} {11201#true} #66#return; {11201#true} is VALID [2018-11-23 12:26:36,408 INFO L256 TraceCheckUtils]: 4: Hoare triple {11201#true} call #t~ret13 := main(); {11201#true} is VALID [2018-11-23 12:26:36,409 INFO L273 TraceCheckUtils]: 5: Hoare triple {11201#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; {11203#(= main_~i~1 0)} is VALID [2018-11-23 12:26:36,410 INFO L273 TraceCheckUtils]: 6: Hoare triple {11203#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11203#(= main_~i~1 0)} is VALID [2018-11-23 12:26:36,410 INFO L273 TraceCheckUtils]: 7: Hoare triple {11203#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11204#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:36,411 INFO L273 TraceCheckUtils]: 8: Hoare triple {11204#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11204#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:36,412 INFO L273 TraceCheckUtils]: 9: Hoare triple {11204#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11205#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:36,413 INFO L273 TraceCheckUtils]: 10: Hoare triple {11205#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11205#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:36,414 INFO L273 TraceCheckUtils]: 11: Hoare triple {11205#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11206#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:36,414 INFO L273 TraceCheckUtils]: 12: Hoare triple {11206#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11206#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:36,415 INFO L273 TraceCheckUtils]: 13: Hoare triple {11206#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11207#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:36,416 INFO L273 TraceCheckUtils]: 14: Hoare triple {11207#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11207#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:36,417 INFO L273 TraceCheckUtils]: 15: Hoare triple {11207#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11208#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:36,418 INFO L273 TraceCheckUtils]: 16: Hoare triple {11208#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11208#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:36,418 INFO L273 TraceCheckUtils]: 17: Hoare triple {11208#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11209#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:36,419 INFO L273 TraceCheckUtils]: 18: Hoare triple {11209#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11209#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:36,420 INFO L273 TraceCheckUtils]: 19: Hoare triple {11209#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11210#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:36,421 INFO L273 TraceCheckUtils]: 20: Hoare triple {11210#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11210#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:36,422 INFO L273 TraceCheckUtils]: 21: Hoare triple {11210#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11211#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:36,422 INFO L273 TraceCheckUtils]: 22: Hoare triple {11211#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11211#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:36,423 INFO L273 TraceCheckUtils]: 23: Hoare triple {11211#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11212#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:36,424 INFO L273 TraceCheckUtils]: 24: Hoare triple {11212#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11212#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:36,425 INFO L273 TraceCheckUtils]: 25: Hoare triple {11212#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11213#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:36,425 INFO L273 TraceCheckUtils]: 26: Hoare triple {11213#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11213#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:36,426 INFO L273 TraceCheckUtils]: 27: Hoare triple {11213#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11214#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:36,427 INFO L273 TraceCheckUtils]: 28: Hoare triple {11214#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11214#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:36,428 INFO L273 TraceCheckUtils]: 29: Hoare triple {11214#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11215#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:36,429 INFO L273 TraceCheckUtils]: 30: Hoare triple {11215#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11215#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:36,429 INFO L273 TraceCheckUtils]: 31: Hoare triple {11215#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11216#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:36,430 INFO L273 TraceCheckUtils]: 32: Hoare triple {11216#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11216#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:36,431 INFO L273 TraceCheckUtils]: 33: Hoare triple {11216#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11217#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:36,432 INFO L273 TraceCheckUtils]: 34: Hoare triple {11217#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11217#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:36,433 INFO L273 TraceCheckUtils]: 35: Hoare triple {11217#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11218#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:36,433 INFO L273 TraceCheckUtils]: 36: Hoare triple {11218#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11218#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:36,434 INFO L273 TraceCheckUtils]: 37: Hoare triple {11218#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11219#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:36,435 INFO L273 TraceCheckUtils]: 38: Hoare triple {11219#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11219#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:36,436 INFO L273 TraceCheckUtils]: 39: Hoare triple {11219#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11220#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:36,436 INFO L273 TraceCheckUtils]: 40: Hoare triple {11220#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11220#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:36,437 INFO L273 TraceCheckUtils]: 41: Hoare triple {11220#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11221#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:36,438 INFO L273 TraceCheckUtils]: 42: Hoare triple {11221#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11221#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:36,439 INFO L273 TraceCheckUtils]: 43: Hoare triple {11221#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11222#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:36,440 INFO L273 TraceCheckUtils]: 44: Hoare triple {11222#(<= main_~i~1 19)} assume !(~i~1 < 10000); {11202#false} is VALID [2018-11-23 12:26:36,440 INFO L256 TraceCheckUtils]: 45: Hoare triple {11202#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {11201#true} is VALID [2018-11-23 12:26:36,440 INFO L273 TraceCheckUtils]: 46: Hoare triple {11201#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11201#true} is VALID [2018-11-23 12:26:36,440 INFO L273 TraceCheckUtils]: 47: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:36,440 INFO L273 TraceCheckUtils]: 48: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:36,441 INFO L273 TraceCheckUtils]: 49: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:36,441 INFO L273 TraceCheckUtils]: 50: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:36,441 INFO L273 TraceCheckUtils]: 51: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:36,441 INFO L273 TraceCheckUtils]: 52: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:36,441 INFO L273 TraceCheckUtils]: 53: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:36,442 INFO L273 TraceCheckUtils]: 54: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:36,442 INFO L273 TraceCheckUtils]: 55: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:36,442 INFO L273 TraceCheckUtils]: 56: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:36,442 INFO L273 TraceCheckUtils]: 57: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:36,442 INFO L273 TraceCheckUtils]: 58: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:36,443 INFO L273 TraceCheckUtils]: 59: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:36,443 INFO L273 TraceCheckUtils]: 60: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:36,443 INFO L273 TraceCheckUtils]: 61: Hoare triple {11201#true} assume !(~i~0 < 10000); {11201#true} is VALID [2018-11-23 12:26:36,443 INFO L273 TraceCheckUtils]: 62: Hoare triple {11201#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11201#true} is VALID [2018-11-23 12:26:36,443 INFO L273 TraceCheckUtils]: 63: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:26:36,444 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {11201#true} {11202#false} #70#return; {11202#false} is VALID [2018-11-23 12:26:36,444 INFO L273 TraceCheckUtils]: 65: Hoare triple {11202#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {11202#false} is VALID [2018-11-23 12:26:36,444 INFO L256 TraceCheckUtils]: 66: Hoare triple {11202#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {11201#true} is VALID [2018-11-23 12:26:36,444 INFO L273 TraceCheckUtils]: 67: Hoare triple {11201#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11201#true} is VALID [2018-11-23 12:26:36,444 INFO L273 TraceCheckUtils]: 68: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:36,445 INFO L273 TraceCheckUtils]: 69: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:36,445 INFO L273 TraceCheckUtils]: 70: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:36,445 INFO L273 TraceCheckUtils]: 71: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:36,445 INFO L273 TraceCheckUtils]: 72: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:36,445 INFO L273 TraceCheckUtils]: 73: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:36,445 INFO L273 TraceCheckUtils]: 74: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:36,445 INFO L273 TraceCheckUtils]: 75: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:36,445 INFO L273 TraceCheckUtils]: 76: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:36,446 INFO L273 TraceCheckUtils]: 77: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:36,446 INFO L273 TraceCheckUtils]: 78: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:36,446 INFO L273 TraceCheckUtils]: 79: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:36,446 INFO L273 TraceCheckUtils]: 80: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:36,446 INFO L273 TraceCheckUtils]: 81: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:36,446 INFO L273 TraceCheckUtils]: 82: Hoare triple {11201#true} assume !(~i~0 < 10000); {11201#true} is VALID [2018-11-23 12:26:36,446 INFO L273 TraceCheckUtils]: 83: Hoare triple {11201#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11201#true} is VALID [2018-11-23 12:26:36,446 INFO L273 TraceCheckUtils]: 84: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:26:36,446 INFO L268 TraceCheckUtils]: 85: Hoare quadruple {11201#true} {11202#false} #72#return; {11202#false} is VALID [2018-11-23 12:26:36,447 INFO L273 TraceCheckUtils]: 86: Hoare triple {11202#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {11202#false} is VALID [2018-11-23 12:26:36,447 INFO L273 TraceCheckUtils]: 87: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11202#false} is VALID [2018-11-23 12:26:36,447 INFO L273 TraceCheckUtils]: 88: Hoare triple {11202#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11202#false} is VALID [2018-11-23 12:26:36,447 INFO L273 TraceCheckUtils]: 89: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11202#false} is VALID [2018-11-23 12:26:36,447 INFO L273 TraceCheckUtils]: 90: Hoare triple {11202#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11202#false} is VALID [2018-11-23 12:26:36,447 INFO L273 TraceCheckUtils]: 91: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11202#false} is VALID [2018-11-23 12:26:36,447 INFO L273 TraceCheckUtils]: 92: Hoare triple {11202#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11202#false} is VALID [2018-11-23 12:26:36,447 INFO L273 TraceCheckUtils]: 93: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11202#false} is VALID [2018-11-23 12:26:36,447 INFO L273 TraceCheckUtils]: 94: Hoare triple {11202#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11202#false} is VALID [2018-11-23 12:26:36,448 INFO L273 TraceCheckUtils]: 95: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11202#false} is VALID [2018-11-23 12:26:36,448 INFO L273 TraceCheckUtils]: 96: Hoare triple {11202#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11202#false} is VALID [2018-11-23 12:26:36,448 INFO L273 TraceCheckUtils]: 97: Hoare triple {11202#false} assume !(~i~2 < 9999); {11202#false} is VALID [2018-11-23 12:26:36,448 INFO L273 TraceCheckUtils]: 98: Hoare triple {11202#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {11202#false} is VALID [2018-11-23 12:26:36,448 INFO L256 TraceCheckUtils]: 99: Hoare triple {11202#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {11201#true} is VALID [2018-11-23 12:26:36,448 INFO L273 TraceCheckUtils]: 100: Hoare triple {11201#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11201#true} is VALID [2018-11-23 12:26:36,448 INFO L273 TraceCheckUtils]: 101: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:36,448 INFO L273 TraceCheckUtils]: 102: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:36,448 INFO L273 TraceCheckUtils]: 103: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:36,449 INFO L273 TraceCheckUtils]: 104: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:36,449 INFO L273 TraceCheckUtils]: 105: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:36,449 INFO L273 TraceCheckUtils]: 106: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:36,449 INFO L273 TraceCheckUtils]: 107: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:36,449 INFO L273 TraceCheckUtils]: 108: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:36,449 INFO L273 TraceCheckUtils]: 109: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:36,449 INFO L273 TraceCheckUtils]: 110: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:36,449 INFO L273 TraceCheckUtils]: 111: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:36,449 INFO L273 TraceCheckUtils]: 112: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:36,450 INFO L273 TraceCheckUtils]: 113: Hoare triple {11201#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:36,450 INFO L273 TraceCheckUtils]: 114: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:36,450 INFO L273 TraceCheckUtils]: 115: Hoare triple {11201#true} assume !(~i~0 < 10000); {11201#true} is VALID [2018-11-23 12:26:36,450 INFO L273 TraceCheckUtils]: 116: Hoare triple {11201#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11201#true} is VALID [2018-11-23 12:26:36,450 INFO L273 TraceCheckUtils]: 117: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:26:36,450 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {11201#true} {11202#false} #74#return; {11202#false} is VALID [2018-11-23 12:26:36,450 INFO L273 TraceCheckUtils]: 119: Hoare triple {11202#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {11202#false} is VALID [2018-11-23 12:26:36,450 INFO L273 TraceCheckUtils]: 120: Hoare triple {11202#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {11202#false} is VALID [2018-11-23 12:26:36,451 INFO L273 TraceCheckUtils]: 121: Hoare triple {11202#false} assume !false; {11202#false} is VALID [2018-11-23 12:26:36,457 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2018-11-23 12:26:36,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:36,458 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:36,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:36,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:37,040 INFO L256 TraceCheckUtils]: 0: Hoare triple {11201#true} call ULTIMATE.init(); {11201#true} is VALID [2018-11-23 12:26:37,040 INFO L273 TraceCheckUtils]: 1: Hoare triple {11201#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11201#true} is VALID [2018-11-23 12:26:37,040 INFO L273 TraceCheckUtils]: 2: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:26:37,041 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11201#true} {11201#true} #66#return; {11201#true} is VALID [2018-11-23 12:26:37,041 INFO L256 TraceCheckUtils]: 4: Hoare triple {11201#true} call #t~ret13 := main(); {11201#true} is VALID [2018-11-23 12:26:37,042 INFO L273 TraceCheckUtils]: 5: Hoare triple {11201#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; {11241#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:37,043 INFO L273 TraceCheckUtils]: 6: Hoare triple {11241#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11241#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:37,043 INFO L273 TraceCheckUtils]: 7: Hoare triple {11241#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11204#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:37,044 INFO L273 TraceCheckUtils]: 8: Hoare triple {11204#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11204#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:37,045 INFO L273 TraceCheckUtils]: 9: Hoare triple {11204#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11205#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:37,046 INFO L273 TraceCheckUtils]: 10: Hoare triple {11205#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11205#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:37,047 INFO L273 TraceCheckUtils]: 11: Hoare triple {11205#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11206#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:37,047 INFO L273 TraceCheckUtils]: 12: Hoare triple {11206#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11206#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:37,048 INFO L273 TraceCheckUtils]: 13: Hoare triple {11206#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11207#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:37,049 INFO L273 TraceCheckUtils]: 14: Hoare triple {11207#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11207#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:37,050 INFO L273 TraceCheckUtils]: 15: Hoare triple {11207#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11208#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:37,051 INFO L273 TraceCheckUtils]: 16: Hoare triple {11208#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11208#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:37,051 INFO L273 TraceCheckUtils]: 17: Hoare triple {11208#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11209#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:37,052 INFO L273 TraceCheckUtils]: 18: Hoare triple {11209#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11209#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:37,053 INFO L273 TraceCheckUtils]: 19: Hoare triple {11209#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11210#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:37,054 INFO L273 TraceCheckUtils]: 20: Hoare triple {11210#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11210#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:37,055 INFO L273 TraceCheckUtils]: 21: Hoare triple {11210#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11211#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:37,055 INFO L273 TraceCheckUtils]: 22: Hoare triple {11211#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11211#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:37,056 INFO L273 TraceCheckUtils]: 23: Hoare triple {11211#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11212#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:37,057 INFO L273 TraceCheckUtils]: 24: Hoare triple {11212#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11212#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:37,058 INFO L273 TraceCheckUtils]: 25: Hoare triple {11212#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11213#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:37,058 INFO L273 TraceCheckUtils]: 26: Hoare triple {11213#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11213#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:37,059 INFO L273 TraceCheckUtils]: 27: Hoare triple {11213#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11214#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:37,060 INFO L273 TraceCheckUtils]: 28: Hoare triple {11214#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11214#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:37,061 INFO L273 TraceCheckUtils]: 29: Hoare triple {11214#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11215#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:37,062 INFO L273 TraceCheckUtils]: 30: Hoare triple {11215#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11215#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:37,062 INFO L273 TraceCheckUtils]: 31: Hoare triple {11215#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11216#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:37,063 INFO L273 TraceCheckUtils]: 32: Hoare triple {11216#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11216#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:37,064 INFO L273 TraceCheckUtils]: 33: Hoare triple {11216#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11217#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:37,065 INFO L273 TraceCheckUtils]: 34: Hoare triple {11217#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11217#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:37,066 INFO L273 TraceCheckUtils]: 35: Hoare triple {11217#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11218#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:37,066 INFO L273 TraceCheckUtils]: 36: Hoare triple {11218#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11218#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:37,067 INFO L273 TraceCheckUtils]: 37: Hoare triple {11218#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11219#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:37,068 INFO L273 TraceCheckUtils]: 38: Hoare triple {11219#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11219#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:37,069 INFO L273 TraceCheckUtils]: 39: Hoare triple {11219#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11220#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:37,069 INFO L273 TraceCheckUtils]: 40: Hoare triple {11220#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11220#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:37,070 INFO L273 TraceCheckUtils]: 41: Hoare triple {11220#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11221#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:37,071 INFO L273 TraceCheckUtils]: 42: Hoare triple {11221#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {11221#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:37,072 INFO L273 TraceCheckUtils]: 43: Hoare triple {11221#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11222#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:37,073 INFO L273 TraceCheckUtils]: 44: Hoare triple {11222#(<= main_~i~1 19)} assume !(~i~1 < 10000); {11202#false} is VALID [2018-11-23 12:26:37,073 INFO L256 TraceCheckUtils]: 45: Hoare triple {11202#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {11202#false} is VALID [2018-11-23 12:26:37,073 INFO L273 TraceCheckUtils]: 46: Hoare triple {11202#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11202#false} is VALID [2018-11-23 12:26:37,073 INFO L273 TraceCheckUtils]: 47: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:37,074 INFO L273 TraceCheckUtils]: 48: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:37,074 INFO L273 TraceCheckUtils]: 49: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:37,074 INFO L273 TraceCheckUtils]: 50: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:37,074 INFO L273 TraceCheckUtils]: 51: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:37,074 INFO L273 TraceCheckUtils]: 52: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:37,075 INFO L273 TraceCheckUtils]: 53: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:37,075 INFO L273 TraceCheckUtils]: 54: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:37,075 INFO L273 TraceCheckUtils]: 55: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:37,075 INFO L273 TraceCheckUtils]: 56: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:37,075 INFO L273 TraceCheckUtils]: 57: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:37,076 INFO L273 TraceCheckUtils]: 58: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:37,076 INFO L273 TraceCheckUtils]: 59: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:37,076 INFO L273 TraceCheckUtils]: 60: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:37,076 INFO L273 TraceCheckUtils]: 61: Hoare triple {11202#false} assume !(~i~0 < 10000); {11202#false} is VALID [2018-11-23 12:26:37,076 INFO L273 TraceCheckUtils]: 62: Hoare triple {11202#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11202#false} is VALID [2018-11-23 12:26:37,076 INFO L273 TraceCheckUtils]: 63: Hoare triple {11202#false} assume true; {11202#false} is VALID [2018-11-23 12:26:37,076 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {11202#false} {11202#false} #70#return; {11202#false} is VALID [2018-11-23 12:26:37,076 INFO L273 TraceCheckUtils]: 65: Hoare triple {11202#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {11202#false} is VALID [2018-11-23 12:26:37,077 INFO L256 TraceCheckUtils]: 66: Hoare triple {11202#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {11202#false} is VALID [2018-11-23 12:26:37,077 INFO L273 TraceCheckUtils]: 67: Hoare triple {11202#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11202#false} is VALID [2018-11-23 12:26:37,077 INFO L273 TraceCheckUtils]: 68: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:37,077 INFO L273 TraceCheckUtils]: 69: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:37,077 INFO L273 TraceCheckUtils]: 70: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:37,077 INFO L273 TraceCheckUtils]: 71: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:37,077 INFO L273 TraceCheckUtils]: 72: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:37,077 INFO L273 TraceCheckUtils]: 73: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:37,077 INFO L273 TraceCheckUtils]: 74: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:37,078 INFO L273 TraceCheckUtils]: 75: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:37,078 INFO L273 TraceCheckUtils]: 76: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:37,078 INFO L273 TraceCheckUtils]: 77: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:37,078 INFO L273 TraceCheckUtils]: 78: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:37,078 INFO L273 TraceCheckUtils]: 79: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:37,078 INFO L273 TraceCheckUtils]: 80: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:37,078 INFO L273 TraceCheckUtils]: 81: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:37,078 INFO L273 TraceCheckUtils]: 82: Hoare triple {11202#false} assume !(~i~0 < 10000); {11202#false} is VALID [2018-11-23 12:26:37,078 INFO L273 TraceCheckUtils]: 83: Hoare triple {11202#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11202#false} is VALID [2018-11-23 12:26:37,079 INFO L273 TraceCheckUtils]: 84: Hoare triple {11202#false} assume true; {11202#false} is VALID [2018-11-23 12:26:37,079 INFO L268 TraceCheckUtils]: 85: Hoare quadruple {11202#false} {11202#false} #72#return; {11202#false} is VALID [2018-11-23 12:26:37,079 INFO L273 TraceCheckUtils]: 86: Hoare triple {11202#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {11202#false} is VALID [2018-11-23 12:26:37,079 INFO L273 TraceCheckUtils]: 87: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11202#false} is VALID [2018-11-23 12:26:37,079 INFO L273 TraceCheckUtils]: 88: Hoare triple {11202#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11202#false} is VALID [2018-11-23 12:26:37,079 INFO L273 TraceCheckUtils]: 89: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11202#false} is VALID [2018-11-23 12:26:37,079 INFO L273 TraceCheckUtils]: 90: Hoare triple {11202#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11202#false} is VALID [2018-11-23 12:26:37,079 INFO L273 TraceCheckUtils]: 91: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11202#false} is VALID [2018-11-23 12:26:37,079 INFO L273 TraceCheckUtils]: 92: Hoare triple {11202#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11202#false} is VALID [2018-11-23 12:26:37,080 INFO L273 TraceCheckUtils]: 93: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11202#false} is VALID [2018-11-23 12:26:37,080 INFO L273 TraceCheckUtils]: 94: Hoare triple {11202#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11202#false} is VALID [2018-11-23 12:26:37,080 INFO L273 TraceCheckUtils]: 95: Hoare triple {11202#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11202#false} is VALID [2018-11-23 12:26:37,080 INFO L273 TraceCheckUtils]: 96: Hoare triple {11202#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11202#false} is VALID [2018-11-23 12:26:37,080 INFO L273 TraceCheckUtils]: 97: Hoare triple {11202#false} assume !(~i~2 < 9999); {11202#false} is VALID [2018-11-23 12:26:37,080 INFO L273 TraceCheckUtils]: 98: Hoare triple {11202#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {11202#false} is VALID [2018-11-23 12:26:37,080 INFO L256 TraceCheckUtils]: 99: Hoare triple {11202#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {11202#false} is VALID [2018-11-23 12:26:37,080 INFO L273 TraceCheckUtils]: 100: Hoare triple {11202#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11202#false} is VALID [2018-11-23 12:26:37,081 INFO L273 TraceCheckUtils]: 101: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:37,081 INFO L273 TraceCheckUtils]: 102: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:37,081 INFO L273 TraceCheckUtils]: 103: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:37,081 INFO L273 TraceCheckUtils]: 104: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:37,081 INFO L273 TraceCheckUtils]: 105: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:37,081 INFO L273 TraceCheckUtils]: 106: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:37,081 INFO L273 TraceCheckUtils]: 107: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:37,081 INFO L273 TraceCheckUtils]: 108: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:37,081 INFO L273 TraceCheckUtils]: 109: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:37,082 INFO L273 TraceCheckUtils]: 110: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:37,082 INFO L273 TraceCheckUtils]: 111: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:37,082 INFO L273 TraceCheckUtils]: 112: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:37,082 INFO L273 TraceCheckUtils]: 113: Hoare triple {11202#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:37,082 INFO L273 TraceCheckUtils]: 114: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:37,082 INFO L273 TraceCheckUtils]: 115: Hoare triple {11202#false} assume !(~i~0 < 10000); {11202#false} is VALID [2018-11-23 12:26:37,082 INFO L273 TraceCheckUtils]: 116: Hoare triple {11202#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11202#false} is VALID [2018-11-23 12:26:37,082 INFO L273 TraceCheckUtils]: 117: Hoare triple {11202#false} assume true; {11202#false} is VALID [2018-11-23 12:26:37,082 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {11202#false} {11202#false} #74#return; {11202#false} is VALID [2018-11-23 12:26:37,083 INFO L273 TraceCheckUtils]: 119: Hoare triple {11202#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {11202#false} is VALID [2018-11-23 12:26:37,083 INFO L273 TraceCheckUtils]: 120: Hoare triple {11202#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {11202#false} is VALID [2018-11-23 12:26:37,083 INFO L273 TraceCheckUtils]: 121: Hoare triple {11202#false} assume !false; {11202#false} is VALID [2018-11-23 12:26:37,090 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2018-11-23 12:26:37,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:37,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 12:26:37,110 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2018-11-23 12:26:37,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:37,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:26:37,218 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-23 12:26:37,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:26:37,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:26:37,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:26:37,220 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 23 states. [2018-11-23 12:26:38,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:38,058 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-11-23 12:26:38,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:26:38,058 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2018-11-23 12:26:38,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:38,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:26:38,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2018-11-23 12:26:38,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:26:38,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2018-11-23 12:26:38,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 92 transitions. [2018-11-23 12:26:38,185 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:38,187 INFO L225 Difference]: With dead ends: 128 [2018-11-23 12:26:38,188 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 12:26:38,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:26:38,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 12:26:38,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-11-23 12:26:38,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:38,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 87 states. [2018-11-23 12:26:38,234 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 87 states. [2018-11-23 12:26:38,234 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 87 states. [2018-11-23 12:26:38,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:38,236 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 12:26:38,236 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 12:26:38,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:38,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:38,237 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 88 states. [2018-11-23 12:26:38,237 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 88 states. [2018-11-23 12:26:38,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:38,238 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 12:26:38,239 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 12:26:38,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:38,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:38,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:38,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:38,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 12:26:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-11-23 12:26:38,241 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 122 [2018-11-23 12:26:38,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:38,241 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-11-23 12:26:38,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:26:38,244 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:26:38,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 12:26:38,245 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:38,245 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 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-23 12:26:38,246 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:38,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:38,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1211213925, now seen corresponding path program 20 times [2018-11-23 12:26:38,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:38,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:38,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:38,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:38,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:39,113 INFO L256 TraceCheckUtils]: 0: Hoare triple {12084#true} call ULTIMATE.init(); {12084#true} is VALID [2018-11-23 12:26:39,114 INFO L273 TraceCheckUtils]: 1: Hoare triple {12084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12084#true} is VALID [2018-11-23 12:26:39,114 INFO L273 TraceCheckUtils]: 2: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:26:39,114 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12084#true} {12084#true} #66#return; {12084#true} is VALID [2018-11-23 12:26:39,114 INFO L256 TraceCheckUtils]: 4: Hoare triple {12084#true} call #t~ret13 := main(); {12084#true} is VALID [2018-11-23 12:26:39,115 INFO L273 TraceCheckUtils]: 5: Hoare triple {12084#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; {12086#(= main_~i~1 0)} is VALID [2018-11-23 12:26:39,115 INFO L273 TraceCheckUtils]: 6: Hoare triple {12086#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12086#(= main_~i~1 0)} is VALID [2018-11-23 12:26:39,116 INFO L273 TraceCheckUtils]: 7: Hoare triple {12086#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12087#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:39,116 INFO L273 TraceCheckUtils]: 8: Hoare triple {12087#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12087#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:39,117 INFO L273 TraceCheckUtils]: 9: Hoare triple {12087#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12088#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:39,118 INFO L273 TraceCheckUtils]: 10: Hoare triple {12088#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12088#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:39,119 INFO L273 TraceCheckUtils]: 11: Hoare triple {12088#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12089#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:39,120 INFO L273 TraceCheckUtils]: 12: Hoare triple {12089#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12089#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:39,121 INFO L273 TraceCheckUtils]: 13: Hoare triple {12089#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12090#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:39,122 INFO L273 TraceCheckUtils]: 14: Hoare triple {12090#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12090#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:39,123 INFO L273 TraceCheckUtils]: 15: Hoare triple {12090#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12091#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:39,124 INFO L273 TraceCheckUtils]: 16: Hoare triple {12091#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12091#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:39,125 INFO L273 TraceCheckUtils]: 17: Hoare triple {12091#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12092#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:39,125 INFO L273 TraceCheckUtils]: 18: Hoare triple {12092#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12092#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:39,126 INFO L273 TraceCheckUtils]: 19: Hoare triple {12092#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12093#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:39,127 INFO L273 TraceCheckUtils]: 20: Hoare triple {12093#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12093#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:39,128 INFO L273 TraceCheckUtils]: 21: Hoare triple {12093#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12094#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:39,129 INFO L273 TraceCheckUtils]: 22: Hoare triple {12094#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12094#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:39,130 INFO L273 TraceCheckUtils]: 23: Hoare triple {12094#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12095#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:39,131 INFO L273 TraceCheckUtils]: 24: Hoare triple {12095#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12095#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:39,132 INFO L273 TraceCheckUtils]: 25: Hoare triple {12095#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12096#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:39,133 INFO L273 TraceCheckUtils]: 26: Hoare triple {12096#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12096#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:39,133 INFO L273 TraceCheckUtils]: 27: Hoare triple {12096#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12097#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:39,134 INFO L273 TraceCheckUtils]: 28: Hoare triple {12097#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12097#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:39,135 INFO L273 TraceCheckUtils]: 29: Hoare triple {12097#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12098#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:39,136 INFO L273 TraceCheckUtils]: 30: Hoare triple {12098#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12098#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:39,137 INFO L273 TraceCheckUtils]: 31: Hoare triple {12098#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12099#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:39,138 INFO L273 TraceCheckUtils]: 32: Hoare triple {12099#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12099#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:39,139 INFO L273 TraceCheckUtils]: 33: Hoare triple {12099#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12100#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:39,140 INFO L273 TraceCheckUtils]: 34: Hoare triple {12100#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12100#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:39,141 INFO L273 TraceCheckUtils]: 35: Hoare triple {12100#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12101#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:39,141 INFO L273 TraceCheckUtils]: 36: Hoare triple {12101#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12101#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:39,142 INFO L273 TraceCheckUtils]: 37: Hoare triple {12101#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12102#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:39,143 INFO L273 TraceCheckUtils]: 38: Hoare triple {12102#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12102#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:39,144 INFO L273 TraceCheckUtils]: 39: Hoare triple {12102#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12103#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:39,145 INFO L273 TraceCheckUtils]: 40: Hoare triple {12103#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12103#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:39,146 INFO L273 TraceCheckUtils]: 41: Hoare triple {12103#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12104#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:39,147 INFO L273 TraceCheckUtils]: 42: Hoare triple {12104#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12104#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:39,148 INFO L273 TraceCheckUtils]: 43: Hoare triple {12104#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12105#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:39,148 INFO L273 TraceCheckUtils]: 44: Hoare triple {12105#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12105#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:39,149 INFO L273 TraceCheckUtils]: 45: Hoare triple {12105#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12106#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:39,150 INFO L273 TraceCheckUtils]: 46: Hoare triple {12106#(<= main_~i~1 20)} assume !(~i~1 < 10000); {12085#false} is VALID [2018-11-23 12:26:39,151 INFO L256 TraceCheckUtils]: 47: Hoare triple {12085#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {12084#true} is VALID [2018-11-23 12:26:39,151 INFO L273 TraceCheckUtils]: 48: Hoare triple {12084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12084#true} is VALID [2018-11-23 12:26:39,151 INFO L273 TraceCheckUtils]: 49: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:39,151 INFO L273 TraceCheckUtils]: 50: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:39,152 INFO L273 TraceCheckUtils]: 51: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:39,152 INFO L273 TraceCheckUtils]: 52: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:39,152 INFO L273 TraceCheckUtils]: 53: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:39,152 INFO L273 TraceCheckUtils]: 54: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:39,153 INFO L273 TraceCheckUtils]: 55: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:39,153 INFO L273 TraceCheckUtils]: 56: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:39,153 INFO L273 TraceCheckUtils]: 57: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:39,153 INFO L273 TraceCheckUtils]: 58: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:39,154 INFO L273 TraceCheckUtils]: 59: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:39,154 INFO L273 TraceCheckUtils]: 60: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:39,154 INFO L273 TraceCheckUtils]: 61: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:39,154 INFO L273 TraceCheckUtils]: 62: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:39,155 INFO L273 TraceCheckUtils]: 63: Hoare triple {12084#true} assume !(~i~0 < 10000); {12084#true} is VALID [2018-11-23 12:26:39,155 INFO L273 TraceCheckUtils]: 64: Hoare triple {12084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12084#true} is VALID [2018-11-23 12:26:39,155 INFO L273 TraceCheckUtils]: 65: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:26:39,155 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {12084#true} {12085#false} #70#return; {12085#false} is VALID [2018-11-23 12:26:39,156 INFO L273 TraceCheckUtils]: 67: Hoare triple {12085#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {12085#false} is VALID [2018-11-23 12:26:39,156 INFO L256 TraceCheckUtils]: 68: Hoare triple {12085#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {12084#true} is VALID [2018-11-23 12:26:39,156 INFO L273 TraceCheckUtils]: 69: Hoare triple {12084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12084#true} is VALID [2018-11-23 12:26:39,156 INFO L273 TraceCheckUtils]: 70: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:39,156 INFO L273 TraceCheckUtils]: 71: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:39,156 INFO L273 TraceCheckUtils]: 72: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:39,157 INFO L273 TraceCheckUtils]: 73: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:39,157 INFO L273 TraceCheckUtils]: 74: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:39,157 INFO L273 TraceCheckUtils]: 75: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:39,157 INFO L273 TraceCheckUtils]: 76: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:39,157 INFO L273 TraceCheckUtils]: 77: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:39,157 INFO L273 TraceCheckUtils]: 78: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:39,158 INFO L273 TraceCheckUtils]: 79: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:39,158 INFO L273 TraceCheckUtils]: 80: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:39,158 INFO L273 TraceCheckUtils]: 81: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:39,158 INFO L273 TraceCheckUtils]: 82: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:39,158 INFO L273 TraceCheckUtils]: 83: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:39,159 INFO L273 TraceCheckUtils]: 84: Hoare triple {12084#true} assume !(~i~0 < 10000); {12084#true} is VALID [2018-11-23 12:26:39,159 INFO L273 TraceCheckUtils]: 85: Hoare triple {12084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12084#true} is VALID [2018-11-23 12:26:39,159 INFO L273 TraceCheckUtils]: 86: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:26:39,159 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {12084#true} {12085#false} #72#return; {12085#false} is VALID [2018-11-23 12:26:39,160 INFO L273 TraceCheckUtils]: 88: Hoare triple {12085#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {12085#false} is VALID [2018-11-23 12:26:39,160 INFO L273 TraceCheckUtils]: 89: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12085#false} is VALID [2018-11-23 12:26:39,160 INFO L273 TraceCheckUtils]: 90: Hoare triple {12085#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12085#false} is VALID [2018-11-23 12:26:39,160 INFO L273 TraceCheckUtils]: 91: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12085#false} is VALID [2018-11-23 12:26:39,160 INFO L273 TraceCheckUtils]: 92: Hoare triple {12085#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12085#false} is VALID [2018-11-23 12:26:39,161 INFO L273 TraceCheckUtils]: 93: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12085#false} is VALID [2018-11-23 12:26:39,161 INFO L273 TraceCheckUtils]: 94: Hoare triple {12085#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12085#false} is VALID [2018-11-23 12:26:39,161 INFO L273 TraceCheckUtils]: 95: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12085#false} is VALID [2018-11-23 12:26:39,161 INFO L273 TraceCheckUtils]: 96: Hoare triple {12085#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12085#false} is VALID [2018-11-23 12:26:39,161 INFO L273 TraceCheckUtils]: 97: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12085#false} is VALID [2018-11-23 12:26:39,162 INFO L273 TraceCheckUtils]: 98: Hoare triple {12085#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12085#false} is VALID [2018-11-23 12:26:39,162 INFO L273 TraceCheckUtils]: 99: Hoare triple {12085#false} assume !(~i~2 < 9999); {12085#false} is VALID [2018-11-23 12:26:39,162 INFO L273 TraceCheckUtils]: 100: Hoare triple {12085#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {12085#false} is VALID [2018-11-23 12:26:39,162 INFO L256 TraceCheckUtils]: 101: Hoare triple {12085#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {12084#true} is VALID [2018-11-23 12:26:39,162 INFO L273 TraceCheckUtils]: 102: Hoare triple {12084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12084#true} is VALID [2018-11-23 12:26:39,163 INFO L273 TraceCheckUtils]: 103: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:39,163 INFO L273 TraceCheckUtils]: 104: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:39,163 INFO L273 TraceCheckUtils]: 105: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:39,163 INFO L273 TraceCheckUtils]: 106: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:39,163 INFO L273 TraceCheckUtils]: 107: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:39,163 INFO L273 TraceCheckUtils]: 108: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:39,164 INFO L273 TraceCheckUtils]: 109: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:39,164 INFO L273 TraceCheckUtils]: 110: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:39,164 INFO L273 TraceCheckUtils]: 111: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:39,164 INFO L273 TraceCheckUtils]: 112: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:39,164 INFO L273 TraceCheckUtils]: 113: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:39,165 INFO L273 TraceCheckUtils]: 114: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:39,165 INFO L273 TraceCheckUtils]: 115: Hoare triple {12084#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:39,165 INFO L273 TraceCheckUtils]: 116: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:39,165 INFO L273 TraceCheckUtils]: 117: Hoare triple {12084#true} assume !(~i~0 < 10000); {12084#true} is VALID [2018-11-23 12:26:39,165 INFO L273 TraceCheckUtils]: 118: Hoare triple {12084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12084#true} is VALID [2018-11-23 12:26:39,165 INFO L273 TraceCheckUtils]: 119: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:26:39,166 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {12084#true} {12085#false} #74#return; {12085#false} is VALID [2018-11-23 12:26:39,166 INFO L273 TraceCheckUtils]: 121: Hoare triple {12085#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {12085#false} is VALID [2018-11-23 12:26:39,166 INFO L273 TraceCheckUtils]: 122: Hoare triple {12085#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {12085#false} is VALID [2018-11-23 12:26:39,166 INFO L273 TraceCheckUtils]: 123: Hoare triple {12085#false} assume !false; {12085#false} is VALID [2018-11-23 12:26:39,181 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2018-11-23 12:26:39,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:39,182 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:39,198 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:26:39,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:26:39,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:39,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:39,647 INFO L256 TraceCheckUtils]: 0: Hoare triple {12084#true} call ULTIMATE.init(); {12084#true} is VALID [2018-11-23 12:26:39,647 INFO L273 TraceCheckUtils]: 1: Hoare triple {12084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12084#true} is VALID [2018-11-23 12:26:39,648 INFO L273 TraceCheckUtils]: 2: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:26:39,648 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12084#true} {12084#true} #66#return; {12084#true} is VALID [2018-11-23 12:26:39,648 INFO L256 TraceCheckUtils]: 4: Hoare triple {12084#true} call #t~ret13 := main(); {12084#true} is VALID [2018-11-23 12:26:39,649 INFO L273 TraceCheckUtils]: 5: Hoare triple {12084#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; {12125#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:39,650 INFO L273 TraceCheckUtils]: 6: Hoare triple {12125#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12125#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:39,651 INFO L273 TraceCheckUtils]: 7: Hoare triple {12125#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12087#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:39,652 INFO L273 TraceCheckUtils]: 8: Hoare triple {12087#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12087#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:39,653 INFO L273 TraceCheckUtils]: 9: Hoare triple {12087#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12088#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:39,654 INFO L273 TraceCheckUtils]: 10: Hoare triple {12088#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12088#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:39,655 INFO L273 TraceCheckUtils]: 11: Hoare triple {12088#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12089#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:39,656 INFO L273 TraceCheckUtils]: 12: Hoare triple {12089#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12089#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:39,657 INFO L273 TraceCheckUtils]: 13: Hoare triple {12089#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12090#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:39,657 INFO L273 TraceCheckUtils]: 14: Hoare triple {12090#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12090#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:39,658 INFO L273 TraceCheckUtils]: 15: Hoare triple {12090#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12091#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:39,659 INFO L273 TraceCheckUtils]: 16: Hoare triple {12091#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12091#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:39,660 INFO L273 TraceCheckUtils]: 17: Hoare triple {12091#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12092#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:39,661 INFO L273 TraceCheckUtils]: 18: Hoare triple {12092#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12092#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:39,662 INFO L273 TraceCheckUtils]: 19: Hoare triple {12092#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12093#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:39,663 INFO L273 TraceCheckUtils]: 20: Hoare triple {12093#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12093#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:39,664 INFO L273 TraceCheckUtils]: 21: Hoare triple {12093#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12094#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:39,665 INFO L273 TraceCheckUtils]: 22: Hoare triple {12094#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12094#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:39,666 INFO L273 TraceCheckUtils]: 23: Hoare triple {12094#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12095#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:39,666 INFO L273 TraceCheckUtils]: 24: Hoare triple {12095#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12095#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:39,667 INFO L273 TraceCheckUtils]: 25: Hoare triple {12095#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12096#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:39,668 INFO L273 TraceCheckUtils]: 26: Hoare triple {12096#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12096#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:39,669 INFO L273 TraceCheckUtils]: 27: Hoare triple {12096#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12097#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:39,670 INFO L273 TraceCheckUtils]: 28: Hoare triple {12097#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12097#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:39,671 INFO L273 TraceCheckUtils]: 29: Hoare triple {12097#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12098#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:39,672 INFO L273 TraceCheckUtils]: 30: Hoare triple {12098#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12098#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:39,673 INFO L273 TraceCheckUtils]: 31: Hoare triple {12098#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12099#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:39,674 INFO L273 TraceCheckUtils]: 32: Hoare triple {12099#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12099#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:39,674 INFO L273 TraceCheckUtils]: 33: Hoare triple {12099#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12100#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:39,675 INFO L273 TraceCheckUtils]: 34: Hoare triple {12100#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12100#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:39,676 INFO L273 TraceCheckUtils]: 35: Hoare triple {12100#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12101#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:39,677 INFO L273 TraceCheckUtils]: 36: Hoare triple {12101#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12101#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:39,678 INFO L273 TraceCheckUtils]: 37: Hoare triple {12101#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12102#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:39,679 INFO L273 TraceCheckUtils]: 38: Hoare triple {12102#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12102#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:39,680 INFO L273 TraceCheckUtils]: 39: Hoare triple {12102#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12103#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:39,681 INFO L273 TraceCheckUtils]: 40: Hoare triple {12103#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12103#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:39,682 INFO L273 TraceCheckUtils]: 41: Hoare triple {12103#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12104#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:39,682 INFO L273 TraceCheckUtils]: 42: Hoare triple {12104#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12104#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:39,683 INFO L273 TraceCheckUtils]: 43: Hoare triple {12104#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12105#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:39,684 INFO L273 TraceCheckUtils]: 44: Hoare triple {12105#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12105#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:39,685 INFO L273 TraceCheckUtils]: 45: Hoare triple {12105#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12106#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:39,686 INFO L273 TraceCheckUtils]: 46: Hoare triple {12106#(<= main_~i~1 20)} assume !(~i~1 < 10000); {12085#false} is VALID [2018-11-23 12:26:39,686 INFO L256 TraceCheckUtils]: 47: Hoare triple {12085#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {12085#false} is VALID [2018-11-23 12:26:39,687 INFO L273 TraceCheckUtils]: 48: Hoare triple {12085#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12085#false} is VALID [2018-11-23 12:26:39,687 INFO L273 TraceCheckUtils]: 49: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:39,687 INFO L273 TraceCheckUtils]: 50: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:39,687 INFO L273 TraceCheckUtils]: 51: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:39,688 INFO L273 TraceCheckUtils]: 52: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:39,688 INFO L273 TraceCheckUtils]: 53: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:39,688 INFO L273 TraceCheckUtils]: 54: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:39,688 INFO L273 TraceCheckUtils]: 55: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:39,689 INFO L273 TraceCheckUtils]: 56: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:39,689 INFO L273 TraceCheckUtils]: 57: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:39,689 INFO L273 TraceCheckUtils]: 58: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:39,689 INFO L273 TraceCheckUtils]: 59: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:39,690 INFO L273 TraceCheckUtils]: 60: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:39,690 INFO L273 TraceCheckUtils]: 61: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:39,690 INFO L273 TraceCheckUtils]: 62: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:39,690 INFO L273 TraceCheckUtils]: 63: Hoare triple {12085#false} assume !(~i~0 < 10000); {12085#false} is VALID [2018-11-23 12:26:39,691 INFO L273 TraceCheckUtils]: 64: Hoare triple {12085#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12085#false} is VALID [2018-11-23 12:26:39,691 INFO L273 TraceCheckUtils]: 65: Hoare triple {12085#false} assume true; {12085#false} is VALID [2018-11-23 12:26:39,691 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {12085#false} {12085#false} #70#return; {12085#false} is VALID [2018-11-23 12:26:39,691 INFO L273 TraceCheckUtils]: 67: Hoare triple {12085#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {12085#false} is VALID [2018-11-23 12:26:39,691 INFO L256 TraceCheckUtils]: 68: Hoare triple {12085#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {12085#false} is VALID [2018-11-23 12:26:39,691 INFO L273 TraceCheckUtils]: 69: Hoare triple {12085#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12085#false} is VALID [2018-11-23 12:26:39,692 INFO L273 TraceCheckUtils]: 70: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:39,692 INFO L273 TraceCheckUtils]: 71: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:39,692 INFO L273 TraceCheckUtils]: 72: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:39,692 INFO L273 TraceCheckUtils]: 73: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:39,692 INFO L273 TraceCheckUtils]: 74: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:39,692 INFO L273 TraceCheckUtils]: 75: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:39,692 INFO L273 TraceCheckUtils]: 76: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:39,693 INFO L273 TraceCheckUtils]: 77: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:39,693 INFO L273 TraceCheckUtils]: 78: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:39,693 INFO L273 TraceCheckUtils]: 79: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:39,693 INFO L273 TraceCheckUtils]: 80: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:39,693 INFO L273 TraceCheckUtils]: 81: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:39,693 INFO L273 TraceCheckUtils]: 82: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:39,693 INFO L273 TraceCheckUtils]: 83: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:39,694 INFO L273 TraceCheckUtils]: 84: Hoare triple {12085#false} assume !(~i~0 < 10000); {12085#false} is VALID [2018-11-23 12:26:39,694 INFO L273 TraceCheckUtils]: 85: Hoare triple {12085#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12085#false} is VALID [2018-11-23 12:26:39,694 INFO L273 TraceCheckUtils]: 86: Hoare triple {12085#false} assume true; {12085#false} is VALID [2018-11-23 12:26:39,694 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {12085#false} {12085#false} #72#return; {12085#false} is VALID [2018-11-23 12:26:39,694 INFO L273 TraceCheckUtils]: 88: Hoare triple {12085#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {12085#false} is VALID [2018-11-23 12:26:39,694 INFO L273 TraceCheckUtils]: 89: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12085#false} is VALID [2018-11-23 12:26:39,694 INFO L273 TraceCheckUtils]: 90: Hoare triple {12085#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12085#false} is VALID [2018-11-23 12:26:39,695 INFO L273 TraceCheckUtils]: 91: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12085#false} is VALID [2018-11-23 12:26:39,695 INFO L273 TraceCheckUtils]: 92: Hoare triple {12085#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12085#false} is VALID [2018-11-23 12:26:39,695 INFO L273 TraceCheckUtils]: 93: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12085#false} is VALID [2018-11-23 12:26:39,695 INFO L273 TraceCheckUtils]: 94: Hoare triple {12085#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12085#false} is VALID [2018-11-23 12:26:39,695 INFO L273 TraceCheckUtils]: 95: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12085#false} is VALID [2018-11-23 12:26:39,695 INFO L273 TraceCheckUtils]: 96: Hoare triple {12085#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12085#false} is VALID [2018-11-23 12:26:39,695 INFO L273 TraceCheckUtils]: 97: Hoare triple {12085#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12085#false} is VALID [2018-11-23 12:26:39,696 INFO L273 TraceCheckUtils]: 98: Hoare triple {12085#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12085#false} is VALID [2018-11-23 12:26:39,696 INFO L273 TraceCheckUtils]: 99: Hoare triple {12085#false} assume !(~i~2 < 9999); {12085#false} is VALID [2018-11-23 12:26:39,696 INFO L273 TraceCheckUtils]: 100: Hoare triple {12085#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {12085#false} is VALID [2018-11-23 12:26:39,696 INFO L256 TraceCheckUtils]: 101: Hoare triple {12085#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {12085#false} is VALID [2018-11-23 12:26:39,696 INFO L273 TraceCheckUtils]: 102: Hoare triple {12085#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12085#false} is VALID [2018-11-23 12:26:39,696 INFO L273 TraceCheckUtils]: 103: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:39,697 INFO L273 TraceCheckUtils]: 104: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:39,697 INFO L273 TraceCheckUtils]: 105: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:39,697 INFO L273 TraceCheckUtils]: 106: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:39,697 INFO L273 TraceCheckUtils]: 107: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:39,697 INFO L273 TraceCheckUtils]: 108: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:39,697 INFO L273 TraceCheckUtils]: 109: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:39,697 INFO L273 TraceCheckUtils]: 110: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:39,698 INFO L273 TraceCheckUtils]: 111: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:39,698 INFO L273 TraceCheckUtils]: 112: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:39,698 INFO L273 TraceCheckUtils]: 113: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:39,698 INFO L273 TraceCheckUtils]: 114: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:39,698 INFO L273 TraceCheckUtils]: 115: Hoare triple {12085#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:39,698 INFO L273 TraceCheckUtils]: 116: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:39,698 INFO L273 TraceCheckUtils]: 117: Hoare triple {12085#false} assume !(~i~0 < 10000); {12085#false} is VALID [2018-11-23 12:26:39,699 INFO L273 TraceCheckUtils]: 118: Hoare triple {12085#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12085#false} is VALID [2018-11-23 12:26:39,699 INFO L273 TraceCheckUtils]: 119: Hoare triple {12085#false} assume true; {12085#false} is VALID [2018-11-23 12:26:39,699 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {12085#false} {12085#false} #74#return; {12085#false} is VALID [2018-11-23 12:26:39,699 INFO L273 TraceCheckUtils]: 121: Hoare triple {12085#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {12085#false} is VALID [2018-11-23 12:26:39,699 INFO L273 TraceCheckUtils]: 122: Hoare triple {12085#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {12085#false} is VALID [2018-11-23 12:26:39,699 INFO L273 TraceCheckUtils]: 123: Hoare triple {12085#false} assume !false; {12085#false} is VALID [2018-11-23 12:26:39,729 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2018-11-23 12:26:39,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:39,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 12:26:39,750 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2018-11-23 12:26:39,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:39,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:26:39,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:39,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:26:39,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:26:39,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:26:39,869 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 24 states. [2018-11-23 12:26:40,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:40,420 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-11-23 12:26:40,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:26:40,420 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2018-11-23 12:26:40,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:40,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:26:40,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2018-11-23 12:26:40,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:26:40,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2018-11-23 12:26:40,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 94 transitions. [2018-11-23 12:26:40,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:40,644 INFO L225 Difference]: With dead ends: 130 [2018-11-23 12:26:40,645 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 12:26:40,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:26:40,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 12:26:40,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-23 12:26:40,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:40,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 89 states. [2018-11-23 12:26:40,691 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 89 states. [2018-11-23 12:26:40,691 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 89 states. [2018-11-23 12:26:40,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:40,693 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-23 12:26:40,693 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 12:26:40,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:40,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:40,694 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 90 states. [2018-11-23 12:26:40,694 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 90 states. [2018-11-23 12:26:40,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:40,696 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-23 12:26:40,696 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 12:26:40,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:40,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:40,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:40,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:40,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 12:26:40,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-11-23 12:26:40,699 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2018-11-23 12:26:40,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:40,699 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-11-23 12:26:40,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:26:40,699 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-23 12:26:40,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-23 12:26:40,700 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:40,701 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 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-23 12:26:40,701 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:40,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:40,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1742217987, now seen corresponding path program 21 times [2018-11-23 12:26:40,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:40,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:40,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:40,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:40,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:41,405 INFO L256 TraceCheckUtils]: 0: Hoare triple {12984#true} call ULTIMATE.init(); {12984#true} is VALID [2018-11-23 12:26:41,406 INFO L273 TraceCheckUtils]: 1: Hoare triple {12984#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12984#true} is VALID [2018-11-23 12:26:41,406 INFO L273 TraceCheckUtils]: 2: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:26:41,406 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12984#true} {12984#true} #66#return; {12984#true} is VALID [2018-11-23 12:26:41,406 INFO L256 TraceCheckUtils]: 4: Hoare triple {12984#true} call #t~ret13 := main(); {12984#true} is VALID [2018-11-23 12:26:41,407 INFO L273 TraceCheckUtils]: 5: Hoare triple {12984#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; {12986#(= main_~i~1 0)} is VALID [2018-11-23 12:26:41,408 INFO L273 TraceCheckUtils]: 6: Hoare triple {12986#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12986#(= main_~i~1 0)} is VALID [2018-11-23 12:26:41,408 INFO L273 TraceCheckUtils]: 7: Hoare triple {12986#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12987#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:41,409 INFO L273 TraceCheckUtils]: 8: Hoare triple {12987#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12987#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:41,409 INFO L273 TraceCheckUtils]: 9: Hoare triple {12987#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12988#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:41,410 INFO L273 TraceCheckUtils]: 10: Hoare triple {12988#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12988#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:41,411 INFO L273 TraceCheckUtils]: 11: Hoare triple {12988#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12989#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:41,411 INFO L273 TraceCheckUtils]: 12: Hoare triple {12989#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12989#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:41,412 INFO L273 TraceCheckUtils]: 13: Hoare triple {12989#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12990#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:41,413 INFO L273 TraceCheckUtils]: 14: Hoare triple {12990#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12990#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:41,414 INFO L273 TraceCheckUtils]: 15: Hoare triple {12990#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12991#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:41,414 INFO L273 TraceCheckUtils]: 16: Hoare triple {12991#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12991#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:41,415 INFO L273 TraceCheckUtils]: 17: Hoare triple {12991#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12992#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:41,416 INFO L273 TraceCheckUtils]: 18: Hoare triple {12992#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12992#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:41,417 INFO L273 TraceCheckUtils]: 19: Hoare triple {12992#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12993#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:41,418 INFO L273 TraceCheckUtils]: 20: Hoare triple {12993#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12993#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:41,418 INFO L273 TraceCheckUtils]: 21: Hoare triple {12993#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12994#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:41,419 INFO L273 TraceCheckUtils]: 22: Hoare triple {12994#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12994#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:41,420 INFO L273 TraceCheckUtils]: 23: Hoare triple {12994#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12995#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:41,421 INFO L273 TraceCheckUtils]: 24: Hoare triple {12995#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12995#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:41,422 INFO L273 TraceCheckUtils]: 25: Hoare triple {12995#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12996#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:41,422 INFO L273 TraceCheckUtils]: 26: Hoare triple {12996#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12996#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:41,423 INFO L273 TraceCheckUtils]: 27: Hoare triple {12996#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12997#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:41,424 INFO L273 TraceCheckUtils]: 28: Hoare triple {12997#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12997#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:41,425 INFO L273 TraceCheckUtils]: 29: Hoare triple {12997#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12998#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:41,425 INFO L273 TraceCheckUtils]: 30: Hoare triple {12998#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12998#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:41,426 INFO L273 TraceCheckUtils]: 31: Hoare triple {12998#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12999#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:41,427 INFO L273 TraceCheckUtils]: 32: Hoare triple {12999#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {12999#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:41,428 INFO L273 TraceCheckUtils]: 33: Hoare triple {12999#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13000#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:41,428 INFO L273 TraceCheckUtils]: 34: Hoare triple {13000#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13000#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:41,429 INFO L273 TraceCheckUtils]: 35: Hoare triple {13000#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13001#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:41,430 INFO L273 TraceCheckUtils]: 36: Hoare triple {13001#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13001#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:41,431 INFO L273 TraceCheckUtils]: 37: Hoare triple {13001#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13002#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:41,432 INFO L273 TraceCheckUtils]: 38: Hoare triple {13002#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13002#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:41,433 INFO L273 TraceCheckUtils]: 39: Hoare triple {13002#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13003#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:41,433 INFO L273 TraceCheckUtils]: 40: Hoare triple {13003#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13003#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:41,434 INFO L273 TraceCheckUtils]: 41: Hoare triple {13003#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13004#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:41,435 INFO L273 TraceCheckUtils]: 42: Hoare triple {13004#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13004#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:41,455 INFO L273 TraceCheckUtils]: 43: Hoare triple {13004#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13005#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:41,474 INFO L273 TraceCheckUtils]: 44: Hoare triple {13005#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13005#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:41,487 INFO L273 TraceCheckUtils]: 45: Hoare triple {13005#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13006#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:41,496 INFO L273 TraceCheckUtils]: 46: Hoare triple {13006#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13006#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:41,511 INFO L273 TraceCheckUtils]: 47: Hoare triple {13006#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13007#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:41,525 INFO L273 TraceCheckUtils]: 48: Hoare triple {13007#(<= main_~i~1 21)} assume !(~i~1 < 10000); {12985#false} is VALID [2018-11-23 12:26:41,525 INFO L256 TraceCheckUtils]: 49: Hoare triple {12985#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {12984#true} is VALID [2018-11-23 12:26:41,525 INFO L273 TraceCheckUtils]: 50: Hoare triple {12984#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12984#true} is VALID [2018-11-23 12:26:41,526 INFO L273 TraceCheckUtils]: 51: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:41,526 INFO L273 TraceCheckUtils]: 52: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:41,526 INFO L273 TraceCheckUtils]: 53: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:41,526 INFO L273 TraceCheckUtils]: 54: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:41,526 INFO L273 TraceCheckUtils]: 55: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:41,526 INFO L273 TraceCheckUtils]: 56: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:41,527 INFO L273 TraceCheckUtils]: 57: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:41,527 INFO L273 TraceCheckUtils]: 58: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:41,527 INFO L273 TraceCheckUtils]: 59: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:41,527 INFO L273 TraceCheckUtils]: 60: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:41,527 INFO L273 TraceCheckUtils]: 61: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:41,527 INFO L273 TraceCheckUtils]: 62: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:41,528 INFO L273 TraceCheckUtils]: 63: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:41,528 INFO L273 TraceCheckUtils]: 64: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:41,528 INFO L273 TraceCheckUtils]: 65: Hoare triple {12984#true} assume !(~i~0 < 10000); {12984#true} is VALID [2018-11-23 12:26:41,528 INFO L273 TraceCheckUtils]: 66: Hoare triple {12984#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:26:41,528 INFO L273 TraceCheckUtils]: 67: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:26:41,529 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {12984#true} {12985#false} #70#return; {12985#false} is VALID [2018-11-23 12:26:41,529 INFO L273 TraceCheckUtils]: 69: Hoare triple {12985#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {12985#false} is VALID [2018-11-23 12:26:41,529 INFO L256 TraceCheckUtils]: 70: Hoare triple {12985#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {12984#true} is VALID [2018-11-23 12:26:41,529 INFO L273 TraceCheckUtils]: 71: Hoare triple {12984#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12984#true} is VALID [2018-11-23 12:26:41,529 INFO L273 TraceCheckUtils]: 72: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:41,529 INFO L273 TraceCheckUtils]: 73: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:41,530 INFO L273 TraceCheckUtils]: 74: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:41,530 INFO L273 TraceCheckUtils]: 75: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:41,530 INFO L273 TraceCheckUtils]: 76: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:41,530 INFO L273 TraceCheckUtils]: 77: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:41,530 INFO L273 TraceCheckUtils]: 78: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:41,530 INFO L273 TraceCheckUtils]: 79: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:41,531 INFO L273 TraceCheckUtils]: 80: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:41,531 INFO L273 TraceCheckUtils]: 81: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:41,531 INFO L273 TraceCheckUtils]: 82: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:41,531 INFO L273 TraceCheckUtils]: 83: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:41,531 INFO L273 TraceCheckUtils]: 84: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:41,531 INFO L273 TraceCheckUtils]: 85: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:41,532 INFO L273 TraceCheckUtils]: 86: Hoare triple {12984#true} assume !(~i~0 < 10000); {12984#true} is VALID [2018-11-23 12:26:41,532 INFO L273 TraceCheckUtils]: 87: Hoare triple {12984#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:26:41,532 INFO L273 TraceCheckUtils]: 88: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:26:41,532 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {12984#true} {12985#false} #72#return; {12985#false} is VALID [2018-11-23 12:26:41,532 INFO L273 TraceCheckUtils]: 90: Hoare triple {12985#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {12985#false} is VALID [2018-11-23 12:26:41,532 INFO L273 TraceCheckUtils]: 91: Hoare triple {12985#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12985#false} is VALID [2018-11-23 12:26:41,533 INFO L273 TraceCheckUtils]: 92: Hoare triple {12985#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12985#false} is VALID [2018-11-23 12:26:41,533 INFO L273 TraceCheckUtils]: 93: Hoare triple {12985#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12985#false} is VALID [2018-11-23 12:26:41,533 INFO L273 TraceCheckUtils]: 94: Hoare triple {12985#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12985#false} is VALID [2018-11-23 12:26:41,533 INFO L273 TraceCheckUtils]: 95: Hoare triple {12985#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12985#false} is VALID [2018-11-23 12:26:41,533 INFO L273 TraceCheckUtils]: 96: Hoare triple {12985#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12985#false} is VALID [2018-11-23 12:26:41,533 INFO L273 TraceCheckUtils]: 97: Hoare triple {12985#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12985#false} is VALID [2018-11-23 12:26:41,533 INFO L273 TraceCheckUtils]: 98: Hoare triple {12985#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12985#false} is VALID [2018-11-23 12:26:41,534 INFO L273 TraceCheckUtils]: 99: Hoare triple {12985#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12985#false} is VALID [2018-11-23 12:26:41,534 INFO L273 TraceCheckUtils]: 100: Hoare triple {12985#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12985#false} is VALID [2018-11-23 12:26:41,534 INFO L273 TraceCheckUtils]: 101: Hoare triple {12985#false} assume !(~i~2 < 9999); {12985#false} is VALID [2018-11-23 12:26:41,534 INFO L273 TraceCheckUtils]: 102: Hoare triple {12985#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {12985#false} is VALID [2018-11-23 12:26:41,534 INFO L256 TraceCheckUtils]: 103: Hoare triple {12985#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {12984#true} is VALID [2018-11-23 12:26:41,535 INFO L273 TraceCheckUtils]: 104: Hoare triple {12984#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12984#true} is VALID [2018-11-23 12:26:41,535 INFO L273 TraceCheckUtils]: 105: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:41,535 INFO L273 TraceCheckUtils]: 106: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:41,535 INFO L273 TraceCheckUtils]: 107: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:41,535 INFO L273 TraceCheckUtils]: 108: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:41,535 INFO L273 TraceCheckUtils]: 109: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:41,536 INFO L273 TraceCheckUtils]: 110: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:41,536 INFO L273 TraceCheckUtils]: 111: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:41,536 INFO L273 TraceCheckUtils]: 112: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:41,536 INFO L273 TraceCheckUtils]: 113: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:41,536 INFO L273 TraceCheckUtils]: 114: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:41,536 INFO L273 TraceCheckUtils]: 115: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:41,537 INFO L273 TraceCheckUtils]: 116: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:41,537 INFO L273 TraceCheckUtils]: 117: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:41,537 INFO L273 TraceCheckUtils]: 118: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:41,537 INFO L273 TraceCheckUtils]: 119: Hoare triple {12984#true} assume !(~i~0 < 10000); {12984#true} is VALID [2018-11-23 12:26:41,537 INFO L273 TraceCheckUtils]: 120: Hoare triple {12984#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:26:41,537 INFO L273 TraceCheckUtils]: 121: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:26:41,538 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {12984#true} {12985#false} #74#return; {12985#false} is VALID [2018-11-23 12:26:41,538 INFO L273 TraceCheckUtils]: 123: Hoare triple {12985#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {12985#false} is VALID [2018-11-23 12:26:41,538 INFO L273 TraceCheckUtils]: 124: Hoare triple {12985#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {12985#false} is VALID [2018-11-23 12:26:41,538 INFO L273 TraceCheckUtils]: 125: Hoare triple {12985#false} assume !false; {12985#false} is VALID [2018-11-23 12:26:41,549 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2018-11-23 12:26:41,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:41,550 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:41,566 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:26:41,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 12:26:41,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:41,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:42,086 INFO L256 TraceCheckUtils]: 0: Hoare triple {12984#true} call ULTIMATE.init(); {12984#true} is VALID [2018-11-23 12:26:42,086 INFO L273 TraceCheckUtils]: 1: Hoare triple {12984#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12984#true} is VALID [2018-11-23 12:26:42,086 INFO L273 TraceCheckUtils]: 2: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:26:42,087 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12984#true} {12984#true} #66#return; {12984#true} is VALID [2018-11-23 12:26:42,087 INFO L256 TraceCheckUtils]: 4: Hoare triple {12984#true} call #t~ret13 := main(); {12984#true} is VALID [2018-11-23 12:26:42,087 INFO L273 TraceCheckUtils]: 5: Hoare triple {12984#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; {12984#true} is VALID [2018-11-23 12:26:42,087 INFO L273 TraceCheckUtils]: 6: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:42,088 INFO L273 TraceCheckUtils]: 7: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:42,088 INFO L273 TraceCheckUtils]: 8: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:42,088 INFO L273 TraceCheckUtils]: 9: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:42,088 INFO L273 TraceCheckUtils]: 10: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:42,088 INFO L273 TraceCheckUtils]: 11: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:42,088 INFO L273 TraceCheckUtils]: 12: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:42,088 INFO L273 TraceCheckUtils]: 13: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:42,089 INFO L273 TraceCheckUtils]: 14: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:42,089 INFO L273 TraceCheckUtils]: 15: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:42,089 INFO L273 TraceCheckUtils]: 16: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:42,089 INFO L273 TraceCheckUtils]: 17: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:42,089 INFO L273 TraceCheckUtils]: 18: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:42,089 INFO L273 TraceCheckUtils]: 19: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:42,089 INFO L273 TraceCheckUtils]: 20: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:42,089 INFO L273 TraceCheckUtils]: 21: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:42,089 INFO L273 TraceCheckUtils]: 22: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:42,090 INFO L273 TraceCheckUtils]: 23: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:42,090 INFO L273 TraceCheckUtils]: 24: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:42,090 INFO L273 TraceCheckUtils]: 25: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:42,090 INFO L273 TraceCheckUtils]: 26: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:42,090 INFO L273 TraceCheckUtils]: 27: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:42,090 INFO L273 TraceCheckUtils]: 28: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:42,090 INFO L273 TraceCheckUtils]: 29: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:42,091 INFO L273 TraceCheckUtils]: 30: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:42,091 INFO L273 TraceCheckUtils]: 31: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:42,091 INFO L273 TraceCheckUtils]: 32: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:42,091 INFO L273 TraceCheckUtils]: 33: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:42,091 INFO L273 TraceCheckUtils]: 34: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:42,091 INFO L273 TraceCheckUtils]: 35: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:42,092 INFO L273 TraceCheckUtils]: 36: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:42,092 INFO L273 TraceCheckUtils]: 37: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:42,092 INFO L273 TraceCheckUtils]: 38: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:42,092 INFO L273 TraceCheckUtils]: 39: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:42,092 INFO L273 TraceCheckUtils]: 40: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:42,092 INFO L273 TraceCheckUtils]: 41: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:42,092 INFO L273 TraceCheckUtils]: 42: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:42,093 INFO L273 TraceCheckUtils]: 43: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:42,093 INFO L273 TraceCheckUtils]: 44: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:42,093 INFO L273 TraceCheckUtils]: 45: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:42,093 INFO L273 TraceCheckUtils]: 46: Hoare triple {12984#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:42,093 INFO L273 TraceCheckUtils]: 47: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:42,093 INFO L273 TraceCheckUtils]: 48: Hoare triple {12984#true} assume !(~i~1 < 10000); {12984#true} is VALID [2018-11-23 12:26:42,093 INFO L256 TraceCheckUtils]: 49: Hoare triple {12984#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {12984#true} is VALID [2018-11-23 12:26:42,094 INFO L273 TraceCheckUtils]: 50: Hoare triple {12984#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12984#true} is VALID [2018-11-23 12:26:42,094 INFO L273 TraceCheckUtils]: 51: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:42,094 INFO L273 TraceCheckUtils]: 52: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:42,094 INFO L273 TraceCheckUtils]: 53: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:42,094 INFO L273 TraceCheckUtils]: 54: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:42,094 INFO L273 TraceCheckUtils]: 55: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:42,094 INFO L273 TraceCheckUtils]: 56: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:42,094 INFO L273 TraceCheckUtils]: 57: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:42,094 INFO L273 TraceCheckUtils]: 58: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:42,095 INFO L273 TraceCheckUtils]: 59: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:42,095 INFO L273 TraceCheckUtils]: 60: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:42,095 INFO L273 TraceCheckUtils]: 61: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:42,095 INFO L273 TraceCheckUtils]: 62: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:42,095 INFO L273 TraceCheckUtils]: 63: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:42,095 INFO L273 TraceCheckUtils]: 64: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:42,095 INFO L273 TraceCheckUtils]: 65: Hoare triple {12984#true} assume !(~i~0 < 10000); {12984#true} is VALID [2018-11-23 12:26:42,095 INFO L273 TraceCheckUtils]: 66: Hoare triple {12984#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:26:42,095 INFO L273 TraceCheckUtils]: 67: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:26:42,096 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {12984#true} {12984#true} #70#return; {12984#true} is VALID [2018-11-23 12:26:42,096 INFO L273 TraceCheckUtils]: 69: Hoare triple {12984#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {12984#true} is VALID [2018-11-23 12:26:42,096 INFO L256 TraceCheckUtils]: 70: Hoare triple {12984#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {12984#true} is VALID [2018-11-23 12:26:42,096 INFO L273 TraceCheckUtils]: 71: Hoare triple {12984#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12984#true} is VALID [2018-11-23 12:26:42,096 INFO L273 TraceCheckUtils]: 72: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:42,096 INFO L273 TraceCheckUtils]: 73: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:42,096 INFO L273 TraceCheckUtils]: 74: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:42,096 INFO L273 TraceCheckUtils]: 75: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:42,096 INFO L273 TraceCheckUtils]: 76: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:42,097 INFO L273 TraceCheckUtils]: 77: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:42,097 INFO L273 TraceCheckUtils]: 78: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:42,097 INFO L273 TraceCheckUtils]: 79: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:42,097 INFO L273 TraceCheckUtils]: 80: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:42,097 INFO L273 TraceCheckUtils]: 81: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:42,097 INFO L273 TraceCheckUtils]: 82: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:42,097 INFO L273 TraceCheckUtils]: 83: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:42,097 INFO L273 TraceCheckUtils]: 84: Hoare triple {12984#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:42,098 INFO L273 TraceCheckUtils]: 85: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:42,098 INFO L273 TraceCheckUtils]: 86: Hoare triple {12984#true} assume !(~i~0 < 10000); {12984#true} is VALID [2018-11-23 12:26:42,098 INFO L273 TraceCheckUtils]: 87: Hoare triple {12984#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:26:42,098 INFO L273 TraceCheckUtils]: 88: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:26:42,098 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {12984#true} {12984#true} #72#return; {12984#true} is VALID [2018-11-23 12:26:42,103 INFO L273 TraceCheckUtils]: 90: Hoare triple {12984#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {13281#(<= main_~i~2 0)} is VALID [2018-11-23 12:26:42,105 INFO L273 TraceCheckUtils]: 91: Hoare triple {13281#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13281#(<= main_~i~2 0)} is VALID [2018-11-23 12:26:42,105 INFO L273 TraceCheckUtils]: 92: Hoare triple {13281#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13288#(<= main_~i~2 1)} is VALID [2018-11-23 12:26:42,106 INFO L273 TraceCheckUtils]: 93: Hoare triple {13288#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13288#(<= main_~i~2 1)} is VALID [2018-11-23 12:26:42,106 INFO L273 TraceCheckUtils]: 94: Hoare triple {13288#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13295#(<= main_~i~2 2)} is VALID [2018-11-23 12:26:42,107 INFO L273 TraceCheckUtils]: 95: Hoare triple {13295#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13295#(<= main_~i~2 2)} is VALID [2018-11-23 12:26:42,107 INFO L273 TraceCheckUtils]: 96: Hoare triple {13295#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13302#(<= main_~i~2 3)} is VALID [2018-11-23 12:26:42,108 INFO L273 TraceCheckUtils]: 97: Hoare triple {13302#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13302#(<= main_~i~2 3)} is VALID [2018-11-23 12:26:42,108 INFO L273 TraceCheckUtils]: 98: Hoare triple {13302#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13309#(<= main_~i~2 4)} is VALID [2018-11-23 12:26:42,109 INFO L273 TraceCheckUtils]: 99: Hoare triple {13309#(<= main_~i~2 4)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13309#(<= main_~i~2 4)} is VALID [2018-11-23 12:26:42,110 INFO L273 TraceCheckUtils]: 100: Hoare triple {13309#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13316#(<= main_~i~2 5)} is VALID [2018-11-23 12:26:42,110 INFO L273 TraceCheckUtils]: 101: Hoare triple {13316#(<= main_~i~2 5)} assume !(~i~2 < 9999); {12985#false} is VALID [2018-11-23 12:26:42,111 INFO L273 TraceCheckUtils]: 102: Hoare triple {12985#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {12985#false} is VALID [2018-11-23 12:26:42,111 INFO L256 TraceCheckUtils]: 103: Hoare triple {12985#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {12985#false} is VALID [2018-11-23 12:26:42,111 INFO L273 TraceCheckUtils]: 104: Hoare triple {12985#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12985#false} is VALID [2018-11-23 12:26:42,111 INFO L273 TraceCheckUtils]: 105: Hoare triple {12985#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12985#false} is VALID [2018-11-23 12:26:42,111 INFO L273 TraceCheckUtils]: 106: Hoare triple {12985#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12985#false} is VALID [2018-11-23 12:26:42,112 INFO L273 TraceCheckUtils]: 107: Hoare triple {12985#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12985#false} is VALID [2018-11-23 12:26:42,112 INFO L273 TraceCheckUtils]: 108: Hoare triple {12985#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12985#false} is VALID [2018-11-23 12:26:42,112 INFO L273 TraceCheckUtils]: 109: Hoare triple {12985#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12985#false} is VALID [2018-11-23 12:26:42,112 INFO L273 TraceCheckUtils]: 110: Hoare triple {12985#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12985#false} is VALID [2018-11-23 12:26:42,112 INFO L273 TraceCheckUtils]: 111: Hoare triple {12985#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12985#false} is VALID [2018-11-23 12:26:42,112 INFO L273 TraceCheckUtils]: 112: Hoare triple {12985#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12985#false} is VALID [2018-11-23 12:26:42,113 INFO L273 TraceCheckUtils]: 113: Hoare triple {12985#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12985#false} is VALID [2018-11-23 12:26:42,113 INFO L273 TraceCheckUtils]: 114: Hoare triple {12985#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12985#false} is VALID [2018-11-23 12:26:42,113 INFO L273 TraceCheckUtils]: 115: Hoare triple {12985#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12985#false} is VALID [2018-11-23 12:26:42,113 INFO L273 TraceCheckUtils]: 116: Hoare triple {12985#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12985#false} is VALID [2018-11-23 12:26:42,113 INFO L273 TraceCheckUtils]: 117: Hoare triple {12985#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12985#false} is VALID [2018-11-23 12:26:42,114 INFO L273 TraceCheckUtils]: 118: Hoare triple {12985#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12985#false} is VALID [2018-11-23 12:26:42,114 INFO L273 TraceCheckUtils]: 119: Hoare triple {12985#false} assume !(~i~0 < 10000); {12985#false} is VALID [2018-11-23 12:26:42,114 INFO L273 TraceCheckUtils]: 120: Hoare triple {12985#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12985#false} is VALID [2018-11-23 12:26:42,114 INFO L273 TraceCheckUtils]: 121: Hoare triple {12985#false} assume true; {12985#false} is VALID [2018-11-23 12:26:42,114 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {12985#false} {12985#false} #74#return; {12985#false} is VALID [2018-11-23 12:26:42,115 INFO L273 TraceCheckUtils]: 123: Hoare triple {12985#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {12985#false} is VALID [2018-11-23 12:26:42,115 INFO L273 TraceCheckUtils]: 124: Hoare triple {12985#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {12985#false} is VALID [2018-11-23 12:26:42,115 INFO L273 TraceCheckUtils]: 125: Hoare triple {12985#false} assume !false; {12985#false} is VALID [2018-11-23 12:26:42,121 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 234 proven. 25 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2018-11-23 12:26:42,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:42,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 30 [2018-11-23 12:26:42,142 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2018-11-23 12:26:42,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:42,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:26:42,290 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-23 12:26:42,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:26:42,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:26:42,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:26:42,292 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 30 states. [2018-11-23 12:26:43,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:43,092 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-11-23 12:26:43,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 12:26:43,092 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2018-11-23 12:26:43,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:43,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:26:43,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2018-11-23 12:26:43,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:26:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2018-11-23 12:26:43,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 109 transitions. [2018-11-23 12:26:43,262 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:43,264 INFO L225 Difference]: With dead ends: 135 [2018-11-23 12:26:43,265 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 12:26:43,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:26:43,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 12:26:43,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2018-11-23 12:26:43,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:43,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 93 states. [2018-11-23 12:26:43,320 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 93 states. [2018-11-23 12:26:43,320 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 93 states. [2018-11-23 12:26:43,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:43,323 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-11-23 12:26:43,323 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:26:43,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:43,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:43,324 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 95 states. [2018-11-23 12:26:43,324 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 95 states. [2018-11-23 12:26:43,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:43,326 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-11-23 12:26:43,326 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:26:43,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:43,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:43,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:43,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:43,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 12:26:43,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2018-11-23 12:26:43,329 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 126 [2018-11-23 12:26:43,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:43,329 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2018-11-23 12:26:43,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:26:43,329 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-23 12:26:43,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 12:26:43,330 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:43,330 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 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-23 12:26:43,330 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:43,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:43,331 INFO L82 PathProgramCache]: Analyzing trace with hash -2078845859, now seen corresponding path program 22 times [2018-11-23 12:26:43,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:43,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:43,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:43,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:43,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:44,215 INFO L256 TraceCheckUtils]: 0: Hoare triple {13919#true} call ULTIMATE.init(); {13919#true} is VALID [2018-11-23 12:26:44,215 INFO L273 TraceCheckUtils]: 1: Hoare triple {13919#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13919#true} is VALID [2018-11-23 12:26:44,215 INFO L273 TraceCheckUtils]: 2: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:26:44,216 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13919#true} {13919#true} #66#return; {13919#true} is VALID [2018-11-23 12:26:44,216 INFO L256 TraceCheckUtils]: 4: Hoare triple {13919#true} call #t~ret13 := main(); {13919#true} is VALID [2018-11-23 12:26:44,216 INFO L273 TraceCheckUtils]: 5: Hoare triple {13919#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; {13921#(= main_~i~1 0)} is VALID [2018-11-23 12:26:44,217 INFO L273 TraceCheckUtils]: 6: Hoare triple {13921#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13921#(= main_~i~1 0)} is VALID [2018-11-23 12:26:44,218 INFO L273 TraceCheckUtils]: 7: Hoare triple {13921#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13922#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:44,219 INFO L273 TraceCheckUtils]: 8: Hoare triple {13922#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13922#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:44,220 INFO L273 TraceCheckUtils]: 9: Hoare triple {13922#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13923#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:44,220 INFO L273 TraceCheckUtils]: 10: Hoare triple {13923#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13923#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:44,221 INFO L273 TraceCheckUtils]: 11: Hoare triple {13923#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13924#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:44,222 INFO L273 TraceCheckUtils]: 12: Hoare triple {13924#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13924#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:44,223 INFO L273 TraceCheckUtils]: 13: Hoare triple {13924#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13925#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:44,227 INFO L273 TraceCheckUtils]: 14: Hoare triple {13925#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13925#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:44,228 INFO L273 TraceCheckUtils]: 15: Hoare triple {13925#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13926#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:44,228 INFO L273 TraceCheckUtils]: 16: Hoare triple {13926#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13926#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:44,229 INFO L273 TraceCheckUtils]: 17: Hoare triple {13926#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13927#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:44,229 INFO L273 TraceCheckUtils]: 18: Hoare triple {13927#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13927#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:44,230 INFO L273 TraceCheckUtils]: 19: Hoare triple {13927#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13928#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:44,230 INFO L273 TraceCheckUtils]: 20: Hoare triple {13928#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13928#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:44,231 INFO L273 TraceCheckUtils]: 21: Hoare triple {13928#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13929#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:44,232 INFO L273 TraceCheckUtils]: 22: Hoare triple {13929#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13929#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:44,233 INFO L273 TraceCheckUtils]: 23: Hoare triple {13929#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13930#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:44,233 INFO L273 TraceCheckUtils]: 24: Hoare triple {13930#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13930#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:44,234 INFO L273 TraceCheckUtils]: 25: Hoare triple {13930#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13931#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:44,235 INFO L273 TraceCheckUtils]: 26: Hoare triple {13931#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13931#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:44,236 INFO L273 TraceCheckUtils]: 27: Hoare triple {13931#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13932#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:44,236 INFO L273 TraceCheckUtils]: 28: Hoare triple {13932#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13932#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:44,237 INFO L273 TraceCheckUtils]: 29: Hoare triple {13932#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13933#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:44,238 INFO L273 TraceCheckUtils]: 30: Hoare triple {13933#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13933#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:44,239 INFO L273 TraceCheckUtils]: 31: Hoare triple {13933#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13934#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:44,240 INFO L273 TraceCheckUtils]: 32: Hoare triple {13934#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13934#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:44,240 INFO L273 TraceCheckUtils]: 33: Hoare triple {13934#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13935#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:44,241 INFO L273 TraceCheckUtils]: 34: Hoare triple {13935#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13935#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:44,242 INFO L273 TraceCheckUtils]: 35: Hoare triple {13935#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13936#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:44,243 INFO L273 TraceCheckUtils]: 36: Hoare triple {13936#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13936#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:44,244 INFO L273 TraceCheckUtils]: 37: Hoare triple {13936#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13937#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:44,244 INFO L273 TraceCheckUtils]: 38: Hoare triple {13937#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13937#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:44,245 INFO L273 TraceCheckUtils]: 39: Hoare triple {13937#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13938#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:44,246 INFO L273 TraceCheckUtils]: 40: Hoare triple {13938#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13938#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:44,247 INFO L273 TraceCheckUtils]: 41: Hoare triple {13938#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13939#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:44,247 INFO L273 TraceCheckUtils]: 42: Hoare triple {13939#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13939#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:44,248 INFO L273 TraceCheckUtils]: 43: Hoare triple {13939#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13940#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:44,249 INFO L273 TraceCheckUtils]: 44: Hoare triple {13940#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13940#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:44,250 INFO L273 TraceCheckUtils]: 45: Hoare triple {13940#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13941#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:44,250 INFO L273 TraceCheckUtils]: 46: Hoare triple {13941#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13941#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:44,251 INFO L273 TraceCheckUtils]: 47: Hoare triple {13941#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13942#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:44,252 INFO L273 TraceCheckUtils]: 48: Hoare triple {13942#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13942#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:44,253 INFO L273 TraceCheckUtils]: 49: Hoare triple {13942#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13943#(<= main_~i~1 22)} is VALID [2018-11-23 12:26:44,254 INFO L273 TraceCheckUtils]: 50: Hoare triple {13943#(<= main_~i~1 22)} assume !(~i~1 < 10000); {13920#false} is VALID [2018-11-23 12:26:44,254 INFO L256 TraceCheckUtils]: 51: Hoare triple {13920#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {13919#true} is VALID [2018-11-23 12:26:44,254 INFO L273 TraceCheckUtils]: 52: Hoare triple {13919#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13919#true} is VALID [2018-11-23 12:26:44,254 INFO L273 TraceCheckUtils]: 53: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:44,254 INFO L273 TraceCheckUtils]: 54: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:44,255 INFO L273 TraceCheckUtils]: 55: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:44,255 INFO L273 TraceCheckUtils]: 56: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:44,255 INFO L273 TraceCheckUtils]: 57: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:44,255 INFO L273 TraceCheckUtils]: 58: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:44,255 INFO L273 TraceCheckUtils]: 59: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:44,256 INFO L273 TraceCheckUtils]: 60: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:44,256 INFO L273 TraceCheckUtils]: 61: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:44,256 INFO L273 TraceCheckUtils]: 62: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:44,256 INFO L273 TraceCheckUtils]: 63: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:44,256 INFO L273 TraceCheckUtils]: 64: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:44,257 INFO L273 TraceCheckUtils]: 65: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:44,257 INFO L273 TraceCheckUtils]: 66: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:44,257 INFO L273 TraceCheckUtils]: 67: Hoare triple {13919#true} assume !(~i~0 < 10000); {13919#true} is VALID [2018-11-23 12:26:44,257 INFO L273 TraceCheckUtils]: 68: Hoare triple {13919#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13919#true} is VALID [2018-11-23 12:26:44,257 INFO L273 TraceCheckUtils]: 69: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:26:44,257 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {13919#true} {13920#false} #70#return; {13920#false} is VALID [2018-11-23 12:26:44,258 INFO L273 TraceCheckUtils]: 71: Hoare triple {13920#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {13920#false} is VALID [2018-11-23 12:26:44,258 INFO L256 TraceCheckUtils]: 72: Hoare triple {13920#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {13919#true} is VALID [2018-11-23 12:26:44,258 INFO L273 TraceCheckUtils]: 73: Hoare triple {13919#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13919#true} is VALID [2018-11-23 12:26:44,258 INFO L273 TraceCheckUtils]: 74: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:44,258 INFO L273 TraceCheckUtils]: 75: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:44,259 INFO L273 TraceCheckUtils]: 76: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:44,259 INFO L273 TraceCheckUtils]: 77: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:44,259 INFO L273 TraceCheckUtils]: 78: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:44,259 INFO L273 TraceCheckUtils]: 79: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:44,259 INFO L273 TraceCheckUtils]: 80: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:44,259 INFO L273 TraceCheckUtils]: 81: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:44,259 INFO L273 TraceCheckUtils]: 82: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:44,259 INFO L273 TraceCheckUtils]: 83: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:44,259 INFO L273 TraceCheckUtils]: 84: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:44,259 INFO L273 TraceCheckUtils]: 85: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:44,260 INFO L273 TraceCheckUtils]: 86: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:44,260 INFO L273 TraceCheckUtils]: 87: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:44,260 INFO L273 TraceCheckUtils]: 88: Hoare triple {13919#true} assume !(~i~0 < 10000); {13919#true} is VALID [2018-11-23 12:26:44,260 INFO L273 TraceCheckUtils]: 89: Hoare triple {13919#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13919#true} is VALID [2018-11-23 12:26:44,260 INFO L273 TraceCheckUtils]: 90: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:26:44,260 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {13919#true} {13920#false} #72#return; {13920#false} is VALID [2018-11-23 12:26:44,260 INFO L273 TraceCheckUtils]: 92: Hoare triple {13920#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {13920#false} is VALID [2018-11-23 12:26:44,260 INFO L273 TraceCheckUtils]: 93: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13920#false} is VALID [2018-11-23 12:26:44,260 INFO L273 TraceCheckUtils]: 94: Hoare triple {13920#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13920#false} is VALID [2018-11-23 12:26:44,261 INFO L273 TraceCheckUtils]: 95: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13920#false} is VALID [2018-11-23 12:26:44,261 INFO L273 TraceCheckUtils]: 96: Hoare triple {13920#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13920#false} is VALID [2018-11-23 12:26:44,261 INFO L273 TraceCheckUtils]: 97: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13920#false} is VALID [2018-11-23 12:26:44,261 INFO L273 TraceCheckUtils]: 98: Hoare triple {13920#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13920#false} is VALID [2018-11-23 12:26:44,261 INFO L273 TraceCheckUtils]: 99: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13920#false} is VALID [2018-11-23 12:26:44,261 INFO L273 TraceCheckUtils]: 100: Hoare triple {13920#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13920#false} is VALID [2018-11-23 12:26:44,261 INFO L273 TraceCheckUtils]: 101: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13920#false} is VALID [2018-11-23 12:26:44,261 INFO L273 TraceCheckUtils]: 102: Hoare triple {13920#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13920#false} is VALID [2018-11-23 12:26:44,261 INFO L273 TraceCheckUtils]: 103: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13920#false} is VALID [2018-11-23 12:26:44,262 INFO L273 TraceCheckUtils]: 104: Hoare triple {13920#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13920#false} is VALID [2018-11-23 12:26:44,262 INFO L273 TraceCheckUtils]: 105: Hoare triple {13920#false} assume !(~i~2 < 9999); {13920#false} is VALID [2018-11-23 12:26:44,262 INFO L273 TraceCheckUtils]: 106: Hoare triple {13920#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {13920#false} is VALID [2018-11-23 12:26:44,262 INFO L256 TraceCheckUtils]: 107: Hoare triple {13920#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {13919#true} is VALID [2018-11-23 12:26:44,262 INFO L273 TraceCheckUtils]: 108: Hoare triple {13919#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13919#true} is VALID [2018-11-23 12:26:44,262 INFO L273 TraceCheckUtils]: 109: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:44,262 INFO L273 TraceCheckUtils]: 110: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:44,262 INFO L273 TraceCheckUtils]: 111: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:44,262 INFO L273 TraceCheckUtils]: 112: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:44,263 INFO L273 TraceCheckUtils]: 113: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:44,263 INFO L273 TraceCheckUtils]: 114: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:44,263 INFO L273 TraceCheckUtils]: 115: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:44,263 INFO L273 TraceCheckUtils]: 116: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:44,263 INFO L273 TraceCheckUtils]: 117: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:44,263 INFO L273 TraceCheckUtils]: 118: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:44,263 INFO L273 TraceCheckUtils]: 119: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:44,263 INFO L273 TraceCheckUtils]: 120: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:44,263 INFO L273 TraceCheckUtils]: 121: Hoare triple {13919#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:44,264 INFO L273 TraceCheckUtils]: 122: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:44,264 INFO L273 TraceCheckUtils]: 123: Hoare triple {13919#true} assume !(~i~0 < 10000); {13919#true} is VALID [2018-11-23 12:26:44,264 INFO L273 TraceCheckUtils]: 124: Hoare triple {13919#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13919#true} is VALID [2018-11-23 12:26:44,264 INFO L273 TraceCheckUtils]: 125: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:26:44,264 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {13919#true} {13920#false} #74#return; {13920#false} is VALID [2018-11-23 12:26:44,264 INFO L273 TraceCheckUtils]: 127: Hoare triple {13920#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {13920#false} is VALID [2018-11-23 12:26:44,264 INFO L273 TraceCheckUtils]: 128: Hoare triple {13920#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {13920#false} is VALID [2018-11-23 12:26:44,264 INFO L273 TraceCheckUtils]: 129: Hoare triple {13920#false} assume !false; {13920#false} is VALID [2018-11-23 12:26:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-11-23 12:26:44,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:44,273 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:44,282 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:26:44,366 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:26:44,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:44,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:44,748 INFO L256 TraceCheckUtils]: 0: Hoare triple {13919#true} call ULTIMATE.init(); {13919#true} is VALID [2018-11-23 12:26:44,749 INFO L273 TraceCheckUtils]: 1: Hoare triple {13919#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13919#true} is VALID [2018-11-23 12:26:44,749 INFO L273 TraceCheckUtils]: 2: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:26:44,749 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13919#true} {13919#true} #66#return; {13919#true} is VALID [2018-11-23 12:26:44,749 INFO L256 TraceCheckUtils]: 4: Hoare triple {13919#true} call #t~ret13 := main(); {13919#true} is VALID [2018-11-23 12:26:44,750 INFO L273 TraceCheckUtils]: 5: Hoare triple {13919#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; {13962#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:44,751 INFO L273 TraceCheckUtils]: 6: Hoare triple {13962#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13962#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:44,752 INFO L273 TraceCheckUtils]: 7: Hoare triple {13962#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13922#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:44,752 INFO L273 TraceCheckUtils]: 8: Hoare triple {13922#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13922#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:44,753 INFO L273 TraceCheckUtils]: 9: Hoare triple {13922#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13923#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:44,753 INFO L273 TraceCheckUtils]: 10: Hoare triple {13923#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13923#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:44,754 INFO L273 TraceCheckUtils]: 11: Hoare triple {13923#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13924#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:44,754 INFO L273 TraceCheckUtils]: 12: Hoare triple {13924#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13924#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:44,755 INFO L273 TraceCheckUtils]: 13: Hoare triple {13924#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13925#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:44,755 INFO L273 TraceCheckUtils]: 14: Hoare triple {13925#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13925#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:44,756 INFO L273 TraceCheckUtils]: 15: Hoare triple {13925#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13926#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:44,757 INFO L273 TraceCheckUtils]: 16: Hoare triple {13926#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13926#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:44,758 INFO L273 TraceCheckUtils]: 17: Hoare triple {13926#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13927#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:44,758 INFO L273 TraceCheckUtils]: 18: Hoare triple {13927#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13927#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:44,759 INFO L273 TraceCheckUtils]: 19: Hoare triple {13927#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13928#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:44,760 INFO L273 TraceCheckUtils]: 20: Hoare triple {13928#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13928#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:44,761 INFO L273 TraceCheckUtils]: 21: Hoare triple {13928#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13929#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:44,761 INFO L273 TraceCheckUtils]: 22: Hoare triple {13929#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13929#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:44,762 INFO L273 TraceCheckUtils]: 23: Hoare triple {13929#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13930#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:44,763 INFO L273 TraceCheckUtils]: 24: Hoare triple {13930#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13930#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:44,764 INFO L273 TraceCheckUtils]: 25: Hoare triple {13930#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13931#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:44,764 INFO L273 TraceCheckUtils]: 26: Hoare triple {13931#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13931#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:44,765 INFO L273 TraceCheckUtils]: 27: Hoare triple {13931#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13932#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:44,766 INFO L273 TraceCheckUtils]: 28: Hoare triple {13932#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13932#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:44,767 INFO L273 TraceCheckUtils]: 29: Hoare triple {13932#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13933#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:44,768 INFO L273 TraceCheckUtils]: 30: Hoare triple {13933#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13933#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:44,768 INFO L273 TraceCheckUtils]: 31: Hoare triple {13933#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13934#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:44,769 INFO L273 TraceCheckUtils]: 32: Hoare triple {13934#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13934#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:44,770 INFO L273 TraceCheckUtils]: 33: Hoare triple {13934#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13935#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:44,771 INFO L273 TraceCheckUtils]: 34: Hoare triple {13935#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13935#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:44,772 INFO L273 TraceCheckUtils]: 35: Hoare triple {13935#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13936#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:44,772 INFO L273 TraceCheckUtils]: 36: Hoare triple {13936#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13936#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:44,773 INFO L273 TraceCheckUtils]: 37: Hoare triple {13936#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13937#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:44,774 INFO L273 TraceCheckUtils]: 38: Hoare triple {13937#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13937#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:44,775 INFO L273 TraceCheckUtils]: 39: Hoare triple {13937#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13938#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:44,775 INFO L273 TraceCheckUtils]: 40: Hoare triple {13938#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13938#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:44,776 INFO L273 TraceCheckUtils]: 41: Hoare triple {13938#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13939#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:44,777 INFO L273 TraceCheckUtils]: 42: Hoare triple {13939#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13939#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:44,778 INFO L273 TraceCheckUtils]: 43: Hoare triple {13939#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13940#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:44,778 INFO L273 TraceCheckUtils]: 44: Hoare triple {13940#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13940#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:44,779 INFO L273 TraceCheckUtils]: 45: Hoare triple {13940#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13941#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:44,780 INFO L273 TraceCheckUtils]: 46: Hoare triple {13941#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13941#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:44,781 INFO L273 TraceCheckUtils]: 47: Hoare triple {13941#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13942#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:44,781 INFO L273 TraceCheckUtils]: 48: Hoare triple {13942#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {13942#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:44,782 INFO L273 TraceCheckUtils]: 49: Hoare triple {13942#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13943#(<= main_~i~1 22)} is VALID [2018-11-23 12:26:44,783 INFO L273 TraceCheckUtils]: 50: Hoare triple {13943#(<= main_~i~1 22)} assume !(~i~1 < 10000); {13920#false} is VALID [2018-11-23 12:26:44,783 INFO L256 TraceCheckUtils]: 51: Hoare triple {13920#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {13920#false} is VALID [2018-11-23 12:26:44,783 INFO L273 TraceCheckUtils]: 52: Hoare triple {13920#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13920#false} is VALID [2018-11-23 12:26:44,784 INFO L273 TraceCheckUtils]: 53: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:44,784 INFO L273 TraceCheckUtils]: 54: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:44,784 INFO L273 TraceCheckUtils]: 55: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:44,784 INFO L273 TraceCheckUtils]: 56: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:44,784 INFO L273 TraceCheckUtils]: 57: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:44,785 INFO L273 TraceCheckUtils]: 58: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:44,785 INFO L273 TraceCheckUtils]: 59: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:44,785 INFO L273 TraceCheckUtils]: 60: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:44,785 INFO L273 TraceCheckUtils]: 61: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:44,785 INFO L273 TraceCheckUtils]: 62: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:44,785 INFO L273 TraceCheckUtils]: 63: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:44,786 INFO L273 TraceCheckUtils]: 64: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:44,786 INFO L273 TraceCheckUtils]: 65: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:44,786 INFO L273 TraceCheckUtils]: 66: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:44,786 INFO L273 TraceCheckUtils]: 67: Hoare triple {13920#false} assume !(~i~0 < 10000); {13920#false} is VALID [2018-11-23 12:26:44,786 INFO L273 TraceCheckUtils]: 68: Hoare triple {13920#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13920#false} is VALID [2018-11-23 12:26:44,786 INFO L273 TraceCheckUtils]: 69: Hoare triple {13920#false} assume true; {13920#false} is VALID [2018-11-23 12:26:44,786 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {13920#false} {13920#false} #70#return; {13920#false} is VALID [2018-11-23 12:26:44,786 INFO L273 TraceCheckUtils]: 71: Hoare triple {13920#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {13920#false} is VALID [2018-11-23 12:26:44,786 INFO L256 TraceCheckUtils]: 72: Hoare triple {13920#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {13920#false} is VALID [2018-11-23 12:26:44,787 INFO L273 TraceCheckUtils]: 73: Hoare triple {13920#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13920#false} is VALID [2018-11-23 12:26:44,787 INFO L273 TraceCheckUtils]: 74: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:44,787 INFO L273 TraceCheckUtils]: 75: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:44,787 INFO L273 TraceCheckUtils]: 76: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:44,787 INFO L273 TraceCheckUtils]: 77: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:44,787 INFO L273 TraceCheckUtils]: 78: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:44,787 INFO L273 TraceCheckUtils]: 79: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:44,787 INFO L273 TraceCheckUtils]: 80: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:44,787 INFO L273 TraceCheckUtils]: 81: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:44,788 INFO L273 TraceCheckUtils]: 82: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:44,788 INFO L273 TraceCheckUtils]: 83: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:44,788 INFO L273 TraceCheckUtils]: 84: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:44,788 INFO L273 TraceCheckUtils]: 85: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:44,788 INFO L273 TraceCheckUtils]: 86: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:44,788 INFO L273 TraceCheckUtils]: 87: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:44,788 INFO L273 TraceCheckUtils]: 88: Hoare triple {13920#false} assume !(~i~0 < 10000); {13920#false} is VALID [2018-11-23 12:26:44,788 INFO L273 TraceCheckUtils]: 89: Hoare triple {13920#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13920#false} is VALID [2018-11-23 12:26:44,788 INFO L273 TraceCheckUtils]: 90: Hoare triple {13920#false} assume true; {13920#false} is VALID [2018-11-23 12:26:44,789 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {13920#false} {13920#false} #72#return; {13920#false} is VALID [2018-11-23 12:26:44,789 INFO L273 TraceCheckUtils]: 92: Hoare triple {13920#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {13920#false} is VALID [2018-11-23 12:26:44,789 INFO L273 TraceCheckUtils]: 93: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13920#false} is VALID [2018-11-23 12:26:44,789 INFO L273 TraceCheckUtils]: 94: Hoare triple {13920#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13920#false} is VALID [2018-11-23 12:26:44,789 INFO L273 TraceCheckUtils]: 95: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13920#false} is VALID [2018-11-23 12:26:44,789 INFO L273 TraceCheckUtils]: 96: Hoare triple {13920#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13920#false} is VALID [2018-11-23 12:26:44,789 INFO L273 TraceCheckUtils]: 97: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13920#false} is VALID [2018-11-23 12:26:44,789 INFO L273 TraceCheckUtils]: 98: Hoare triple {13920#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13920#false} is VALID [2018-11-23 12:26:44,789 INFO L273 TraceCheckUtils]: 99: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13920#false} is VALID [2018-11-23 12:26:44,790 INFO L273 TraceCheckUtils]: 100: Hoare triple {13920#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13920#false} is VALID [2018-11-23 12:26:44,790 INFO L273 TraceCheckUtils]: 101: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13920#false} is VALID [2018-11-23 12:26:44,790 INFO L273 TraceCheckUtils]: 102: Hoare triple {13920#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13920#false} is VALID [2018-11-23 12:26:44,790 INFO L273 TraceCheckUtils]: 103: Hoare triple {13920#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13920#false} is VALID [2018-11-23 12:26:44,790 INFO L273 TraceCheckUtils]: 104: Hoare triple {13920#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13920#false} is VALID [2018-11-23 12:26:44,790 INFO L273 TraceCheckUtils]: 105: Hoare triple {13920#false} assume !(~i~2 < 9999); {13920#false} is VALID [2018-11-23 12:26:44,790 INFO L273 TraceCheckUtils]: 106: Hoare triple {13920#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {13920#false} is VALID [2018-11-23 12:26:44,790 INFO L256 TraceCheckUtils]: 107: Hoare triple {13920#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {13920#false} is VALID [2018-11-23 12:26:44,790 INFO L273 TraceCheckUtils]: 108: Hoare triple {13920#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13920#false} is VALID [2018-11-23 12:26:44,790 INFO L273 TraceCheckUtils]: 109: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:44,791 INFO L273 TraceCheckUtils]: 110: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:44,791 INFO L273 TraceCheckUtils]: 111: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:44,791 INFO L273 TraceCheckUtils]: 112: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:44,791 INFO L273 TraceCheckUtils]: 113: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:44,791 INFO L273 TraceCheckUtils]: 114: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:44,791 INFO L273 TraceCheckUtils]: 115: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:44,791 INFO L273 TraceCheckUtils]: 116: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:44,791 INFO L273 TraceCheckUtils]: 117: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:44,791 INFO L273 TraceCheckUtils]: 118: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:44,792 INFO L273 TraceCheckUtils]: 119: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:44,792 INFO L273 TraceCheckUtils]: 120: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:44,792 INFO L273 TraceCheckUtils]: 121: Hoare triple {13920#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:44,792 INFO L273 TraceCheckUtils]: 122: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:44,792 INFO L273 TraceCheckUtils]: 123: Hoare triple {13920#false} assume !(~i~0 < 10000); {13920#false} is VALID [2018-11-23 12:26:44,792 INFO L273 TraceCheckUtils]: 124: Hoare triple {13920#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13920#false} is VALID [2018-11-23 12:26:44,792 INFO L273 TraceCheckUtils]: 125: Hoare triple {13920#false} assume true; {13920#false} is VALID [2018-11-23 12:26:44,792 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {13920#false} {13920#false} #74#return; {13920#false} is VALID [2018-11-23 12:26:44,792 INFO L273 TraceCheckUtils]: 127: Hoare triple {13920#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {13920#false} is VALID [2018-11-23 12:26:44,793 INFO L273 TraceCheckUtils]: 128: Hoare triple {13920#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {13920#false} is VALID [2018-11-23 12:26:44,793 INFO L273 TraceCheckUtils]: 129: Hoare triple {13920#false} assume !false; {13920#false} is VALID [2018-11-23 12:26:44,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-11-23 12:26:44,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:44,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 12:26:44,825 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2018-11-23 12:26:44,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:44,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:26:44,946 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-23 12:26:44,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:26:44,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:26:44,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:26:44,947 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 26 states. [2018-11-23 12:26:46,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:46,003 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-11-23 12:26:46,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:26:46,003 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2018-11-23 12:26:46,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:46,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:26:46,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 98 transitions. [2018-11-23 12:26:46,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:26:46,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 98 transitions. [2018-11-23 12:26:46,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 98 transitions. [2018-11-23 12:26:46,139 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:46,141 INFO L225 Difference]: With dead ends: 138 [2018-11-23 12:26:46,141 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 12:26:46,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:26:46,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 12:26:46,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-23 12:26:46,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:46,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 95 states. [2018-11-23 12:26:46,206 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 95 states. [2018-11-23 12:26:46,206 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 95 states. [2018-11-23 12:26:46,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:46,209 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-23 12:26:46,209 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-23 12:26:46,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:46,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:46,210 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 96 states. [2018-11-23 12:26:46,210 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 96 states. [2018-11-23 12:26:46,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:46,212 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-23 12:26:46,212 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-23 12:26:46,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:46,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:46,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:46,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 12:26:46,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-11-23 12:26:46,214 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 130 [2018-11-23 12:26:46,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:46,215 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-11-23 12:26:46,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:26:46,215 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:26:46,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-23 12:26:46,216 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:46,216 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 21, 21, 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-23 12:26:46,216 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:46,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:46,217 INFO L82 PathProgramCache]: Analyzing trace with hash -627324865, now seen corresponding path program 23 times [2018-11-23 12:26:46,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:46,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:46,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:46,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:46,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:48,419 INFO L256 TraceCheckUtils]: 0: Hoare triple {14872#true} call ULTIMATE.init(); {14872#true} is VALID [2018-11-23 12:26:48,419 INFO L273 TraceCheckUtils]: 1: Hoare triple {14872#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14872#true} is VALID [2018-11-23 12:26:48,419 INFO L273 TraceCheckUtils]: 2: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:26:48,420 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14872#true} {14872#true} #66#return; {14872#true} is VALID [2018-11-23 12:26:48,420 INFO L256 TraceCheckUtils]: 4: Hoare triple {14872#true} call #t~ret13 := main(); {14872#true} is VALID [2018-11-23 12:26:48,421 INFO L273 TraceCheckUtils]: 5: Hoare triple {14872#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; {14874#(= main_~i~1 0)} is VALID [2018-11-23 12:26:48,421 INFO L273 TraceCheckUtils]: 6: Hoare triple {14874#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {14874#(= main_~i~1 0)} is VALID [2018-11-23 12:26:48,422 INFO L273 TraceCheckUtils]: 7: Hoare triple {14874#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14875#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:48,423 INFO L273 TraceCheckUtils]: 8: Hoare triple {14875#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {14875#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:48,423 INFO L273 TraceCheckUtils]: 9: Hoare triple {14875#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14876#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:48,423 INFO L273 TraceCheckUtils]: 10: Hoare triple {14876#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {14876#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:48,424 INFO L273 TraceCheckUtils]: 11: Hoare triple {14876#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14877#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:48,425 INFO L273 TraceCheckUtils]: 12: Hoare triple {14877#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {14877#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:48,425 INFO L273 TraceCheckUtils]: 13: Hoare triple {14877#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14878#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:48,426 INFO L273 TraceCheckUtils]: 14: Hoare triple {14878#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {14878#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:48,427 INFO L273 TraceCheckUtils]: 15: Hoare triple {14878#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14879#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:48,428 INFO L273 TraceCheckUtils]: 16: Hoare triple {14879#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {14879#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:48,429 INFO L273 TraceCheckUtils]: 17: Hoare triple {14879#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14880#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:48,429 INFO L273 TraceCheckUtils]: 18: Hoare triple {14880#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {14880#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:48,430 INFO L273 TraceCheckUtils]: 19: Hoare triple {14880#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14881#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:48,431 INFO L273 TraceCheckUtils]: 20: Hoare triple {14881#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {14881#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:48,432 INFO L273 TraceCheckUtils]: 21: Hoare triple {14881#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14882#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:48,432 INFO L273 TraceCheckUtils]: 22: Hoare triple {14882#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {14882#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:48,433 INFO L273 TraceCheckUtils]: 23: Hoare triple {14882#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14883#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:48,434 INFO L273 TraceCheckUtils]: 24: Hoare triple {14883#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {14883#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:48,435 INFO L273 TraceCheckUtils]: 25: Hoare triple {14883#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14884#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:48,435 INFO L273 TraceCheckUtils]: 26: Hoare triple {14884#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {14884#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:48,436 INFO L273 TraceCheckUtils]: 27: Hoare triple {14884#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14885#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:48,437 INFO L273 TraceCheckUtils]: 28: Hoare triple {14885#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {14885#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:48,438 INFO L273 TraceCheckUtils]: 29: Hoare triple {14885#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14886#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:48,439 INFO L273 TraceCheckUtils]: 30: Hoare triple {14886#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {14886#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:48,439 INFO L273 TraceCheckUtils]: 31: Hoare triple {14886#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14887#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:48,440 INFO L273 TraceCheckUtils]: 32: Hoare triple {14887#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {14887#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:48,441 INFO L273 TraceCheckUtils]: 33: Hoare triple {14887#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14888#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:48,442 INFO L273 TraceCheckUtils]: 34: Hoare triple {14888#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {14888#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:48,443 INFO L273 TraceCheckUtils]: 35: Hoare triple {14888#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14889#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:48,443 INFO L273 TraceCheckUtils]: 36: Hoare triple {14889#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {14889#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:48,444 INFO L273 TraceCheckUtils]: 37: Hoare triple {14889#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14890#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:48,445 INFO L273 TraceCheckUtils]: 38: Hoare triple {14890#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {14890#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:48,446 INFO L273 TraceCheckUtils]: 39: Hoare triple {14890#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14891#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:48,446 INFO L273 TraceCheckUtils]: 40: Hoare triple {14891#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {14891#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:48,447 INFO L273 TraceCheckUtils]: 41: Hoare triple {14891#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14892#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:48,448 INFO L273 TraceCheckUtils]: 42: Hoare triple {14892#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {14892#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:48,449 INFO L273 TraceCheckUtils]: 43: Hoare triple {14892#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14893#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:48,449 INFO L273 TraceCheckUtils]: 44: Hoare triple {14893#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {14893#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:48,450 INFO L273 TraceCheckUtils]: 45: Hoare triple {14893#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14894#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:48,451 INFO L273 TraceCheckUtils]: 46: Hoare triple {14894#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {14894#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:48,452 INFO L273 TraceCheckUtils]: 47: Hoare triple {14894#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14895#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:48,453 INFO L273 TraceCheckUtils]: 48: Hoare triple {14895#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {14895#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:48,454 INFO L273 TraceCheckUtils]: 49: Hoare triple {14895#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14896#(<= main_~i~1 22)} is VALID [2018-11-23 12:26:48,454 INFO L273 TraceCheckUtils]: 50: Hoare triple {14896#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {14896#(<= main_~i~1 22)} is VALID [2018-11-23 12:26:48,455 INFO L273 TraceCheckUtils]: 51: Hoare triple {14896#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14897#(<= main_~i~1 23)} is VALID [2018-11-23 12:26:48,456 INFO L273 TraceCheckUtils]: 52: Hoare triple {14897#(<= main_~i~1 23)} assume !(~i~1 < 10000); {14873#false} is VALID [2018-11-23 12:26:48,456 INFO L256 TraceCheckUtils]: 53: Hoare triple {14873#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {14872#true} is VALID [2018-11-23 12:26:48,456 INFO L273 TraceCheckUtils]: 54: Hoare triple {14872#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14872#true} is VALID [2018-11-23 12:26:48,457 INFO L273 TraceCheckUtils]: 55: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:48,457 INFO L273 TraceCheckUtils]: 56: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:48,457 INFO L273 TraceCheckUtils]: 57: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:48,457 INFO L273 TraceCheckUtils]: 58: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:48,457 INFO L273 TraceCheckUtils]: 59: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:48,457 INFO L273 TraceCheckUtils]: 60: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:48,458 INFO L273 TraceCheckUtils]: 61: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:48,458 INFO L273 TraceCheckUtils]: 62: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:48,458 INFO L273 TraceCheckUtils]: 63: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:48,458 INFO L273 TraceCheckUtils]: 64: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:48,458 INFO L273 TraceCheckUtils]: 65: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:48,458 INFO L273 TraceCheckUtils]: 66: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:48,459 INFO L273 TraceCheckUtils]: 67: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:48,459 INFO L273 TraceCheckUtils]: 68: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:48,459 INFO L273 TraceCheckUtils]: 69: Hoare triple {14872#true} assume !(~i~0 < 10000); {14872#true} is VALID [2018-11-23 12:26:48,459 INFO L273 TraceCheckUtils]: 70: Hoare triple {14872#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14872#true} is VALID [2018-11-23 12:26:48,459 INFO L273 TraceCheckUtils]: 71: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:26:48,459 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {14872#true} {14873#false} #70#return; {14873#false} is VALID [2018-11-23 12:26:48,459 INFO L273 TraceCheckUtils]: 73: Hoare triple {14873#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {14873#false} is VALID [2018-11-23 12:26:48,459 INFO L256 TraceCheckUtils]: 74: Hoare triple {14873#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {14872#true} is VALID [2018-11-23 12:26:48,460 INFO L273 TraceCheckUtils]: 75: Hoare triple {14872#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14872#true} is VALID [2018-11-23 12:26:48,460 INFO L273 TraceCheckUtils]: 76: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:48,460 INFO L273 TraceCheckUtils]: 77: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:48,460 INFO L273 TraceCheckUtils]: 78: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:48,460 INFO L273 TraceCheckUtils]: 79: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:48,460 INFO L273 TraceCheckUtils]: 80: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:48,460 INFO L273 TraceCheckUtils]: 81: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:48,460 INFO L273 TraceCheckUtils]: 82: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:48,460 INFO L273 TraceCheckUtils]: 83: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:48,460 INFO L273 TraceCheckUtils]: 84: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:48,461 INFO L273 TraceCheckUtils]: 85: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:48,461 INFO L273 TraceCheckUtils]: 86: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:48,461 INFO L273 TraceCheckUtils]: 87: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:48,461 INFO L273 TraceCheckUtils]: 88: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:48,461 INFO L273 TraceCheckUtils]: 89: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:48,461 INFO L273 TraceCheckUtils]: 90: Hoare triple {14872#true} assume !(~i~0 < 10000); {14872#true} is VALID [2018-11-23 12:26:48,461 INFO L273 TraceCheckUtils]: 91: Hoare triple {14872#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14872#true} is VALID [2018-11-23 12:26:48,461 INFO L273 TraceCheckUtils]: 92: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:26:48,461 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {14872#true} {14873#false} #72#return; {14873#false} is VALID [2018-11-23 12:26:48,462 INFO L273 TraceCheckUtils]: 94: Hoare triple {14873#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {14873#false} is VALID [2018-11-23 12:26:48,462 INFO L273 TraceCheckUtils]: 95: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14873#false} is VALID [2018-11-23 12:26:48,462 INFO L273 TraceCheckUtils]: 96: Hoare triple {14873#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14873#false} is VALID [2018-11-23 12:26:48,462 INFO L273 TraceCheckUtils]: 97: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14873#false} is VALID [2018-11-23 12:26:48,462 INFO L273 TraceCheckUtils]: 98: Hoare triple {14873#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14873#false} is VALID [2018-11-23 12:26:48,462 INFO L273 TraceCheckUtils]: 99: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14873#false} is VALID [2018-11-23 12:26:48,462 INFO L273 TraceCheckUtils]: 100: Hoare triple {14873#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14873#false} is VALID [2018-11-23 12:26:48,462 INFO L273 TraceCheckUtils]: 101: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14873#false} is VALID [2018-11-23 12:26:48,462 INFO L273 TraceCheckUtils]: 102: Hoare triple {14873#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14873#false} is VALID [2018-11-23 12:26:48,463 INFO L273 TraceCheckUtils]: 103: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14873#false} is VALID [2018-11-23 12:26:48,463 INFO L273 TraceCheckUtils]: 104: Hoare triple {14873#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14873#false} is VALID [2018-11-23 12:26:48,463 INFO L273 TraceCheckUtils]: 105: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14873#false} is VALID [2018-11-23 12:26:48,463 INFO L273 TraceCheckUtils]: 106: Hoare triple {14873#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14873#false} is VALID [2018-11-23 12:26:48,463 INFO L273 TraceCheckUtils]: 107: Hoare triple {14873#false} assume !(~i~2 < 9999); {14873#false} is VALID [2018-11-23 12:26:48,463 INFO L273 TraceCheckUtils]: 108: Hoare triple {14873#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {14873#false} is VALID [2018-11-23 12:26:48,463 INFO L256 TraceCheckUtils]: 109: Hoare triple {14873#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {14872#true} is VALID [2018-11-23 12:26:48,463 INFO L273 TraceCheckUtils]: 110: Hoare triple {14872#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14872#true} is VALID [2018-11-23 12:26:48,463 INFO L273 TraceCheckUtils]: 111: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:48,464 INFO L273 TraceCheckUtils]: 112: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:48,464 INFO L273 TraceCheckUtils]: 113: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:48,464 INFO L273 TraceCheckUtils]: 114: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:48,464 INFO L273 TraceCheckUtils]: 115: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:48,464 INFO L273 TraceCheckUtils]: 116: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:48,464 INFO L273 TraceCheckUtils]: 117: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:48,464 INFO L273 TraceCheckUtils]: 118: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:48,464 INFO L273 TraceCheckUtils]: 119: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:48,464 INFO L273 TraceCheckUtils]: 120: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:48,465 INFO L273 TraceCheckUtils]: 121: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:48,465 INFO L273 TraceCheckUtils]: 122: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:48,465 INFO L273 TraceCheckUtils]: 123: Hoare triple {14872#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:48,465 INFO L273 TraceCheckUtils]: 124: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:48,465 INFO L273 TraceCheckUtils]: 125: Hoare triple {14872#true} assume !(~i~0 < 10000); {14872#true} is VALID [2018-11-23 12:26:48,465 INFO L273 TraceCheckUtils]: 126: Hoare triple {14872#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14872#true} is VALID [2018-11-23 12:26:48,465 INFO L273 TraceCheckUtils]: 127: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:26:48,465 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {14872#true} {14873#false} #74#return; {14873#false} is VALID [2018-11-23 12:26:48,465 INFO L273 TraceCheckUtils]: 129: Hoare triple {14873#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {14873#false} is VALID [2018-11-23 12:26:48,466 INFO L273 TraceCheckUtils]: 130: Hoare triple {14873#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {14873#false} is VALID [2018-11-23 12:26:48,466 INFO L273 TraceCheckUtils]: 131: Hoare triple {14873#false} assume !false; {14873#false} is VALID [2018-11-23 12:26:48,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-11-23 12:26:48,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:48,477 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:48,488 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:26:51,050 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2018-11-23 12:26:51,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:51,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:51,799 INFO L256 TraceCheckUtils]: 0: Hoare triple {14872#true} call ULTIMATE.init(); {14872#true} is VALID [2018-11-23 12:26:51,799 INFO L273 TraceCheckUtils]: 1: Hoare triple {14872#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14872#true} is VALID [2018-11-23 12:26:51,799 INFO L273 TraceCheckUtils]: 2: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:26:51,800 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14872#true} {14872#true} #66#return; {14872#true} is VALID [2018-11-23 12:26:51,800 INFO L256 TraceCheckUtils]: 4: Hoare triple {14872#true} call #t~ret13 := main(); {14872#true} is VALID [2018-11-23 12:26:51,800 INFO L273 TraceCheckUtils]: 5: Hoare triple {14872#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; {14872#true} is VALID [2018-11-23 12:26:51,800 INFO L273 TraceCheckUtils]: 6: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:51,800 INFO L273 TraceCheckUtils]: 7: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:51,801 INFO L273 TraceCheckUtils]: 8: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:51,801 INFO L273 TraceCheckUtils]: 9: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:51,801 INFO L273 TraceCheckUtils]: 10: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:51,801 INFO L273 TraceCheckUtils]: 11: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:51,801 INFO L273 TraceCheckUtils]: 12: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:51,801 INFO L273 TraceCheckUtils]: 13: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:51,802 INFO L273 TraceCheckUtils]: 14: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:51,802 INFO L273 TraceCheckUtils]: 15: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:51,802 INFO L273 TraceCheckUtils]: 16: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:51,802 INFO L273 TraceCheckUtils]: 17: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:51,802 INFO L273 TraceCheckUtils]: 18: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:51,802 INFO L273 TraceCheckUtils]: 19: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:51,802 INFO L273 TraceCheckUtils]: 20: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:51,802 INFO L273 TraceCheckUtils]: 21: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:51,803 INFO L273 TraceCheckUtils]: 22: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:51,803 INFO L273 TraceCheckUtils]: 23: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:51,803 INFO L273 TraceCheckUtils]: 24: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:51,803 INFO L273 TraceCheckUtils]: 25: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:51,803 INFO L273 TraceCheckUtils]: 26: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:51,803 INFO L273 TraceCheckUtils]: 27: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:51,803 INFO L273 TraceCheckUtils]: 28: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:51,803 INFO L273 TraceCheckUtils]: 29: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:51,803 INFO L273 TraceCheckUtils]: 30: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:51,804 INFO L273 TraceCheckUtils]: 31: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:51,804 INFO L273 TraceCheckUtils]: 32: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:51,804 INFO L273 TraceCheckUtils]: 33: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:51,804 INFO L273 TraceCheckUtils]: 34: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:51,804 INFO L273 TraceCheckUtils]: 35: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:51,804 INFO L273 TraceCheckUtils]: 36: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:51,804 INFO L273 TraceCheckUtils]: 37: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:51,804 INFO L273 TraceCheckUtils]: 38: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:51,804 INFO L273 TraceCheckUtils]: 39: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:51,805 INFO L273 TraceCheckUtils]: 40: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:51,805 INFO L273 TraceCheckUtils]: 41: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:51,805 INFO L273 TraceCheckUtils]: 42: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:51,805 INFO L273 TraceCheckUtils]: 43: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:51,805 INFO L273 TraceCheckUtils]: 44: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:51,805 INFO L273 TraceCheckUtils]: 45: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:51,805 INFO L273 TraceCheckUtils]: 46: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:51,805 INFO L273 TraceCheckUtils]: 47: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:51,805 INFO L273 TraceCheckUtils]: 48: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:51,806 INFO L273 TraceCheckUtils]: 49: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:51,806 INFO L273 TraceCheckUtils]: 50: Hoare triple {14872#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:51,806 INFO L273 TraceCheckUtils]: 51: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:51,806 INFO L273 TraceCheckUtils]: 52: Hoare triple {14872#true} assume !(~i~1 < 10000); {14872#true} is VALID [2018-11-23 12:26:51,806 INFO L256 TraceCheckUtils]: 53: Hoare triple {14872#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {14872#true} is VALID [2018-11-23 12:26:51,807 INFO L273 TraceCheckUtils]: 54: Hoare triple {14872#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15063#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:51,807 INFO L273 TraceCheckUtils]: 55: Hoare triple {15063#(<= bor_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15063#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:51,808 INFO L273 TraceCheckUtils]: 56: Hoare triple {15063#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15070#(<= bor_~i~0 2)} is VALID [2018-11-23 12:26:51,808 INFO L273 TraceCheckUtils]: 57: Hoare triple {15070#(<= bor_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15070#(<= bor_~i~0 2)} is VALID [2018-11-23 12:26:51,809 INFO L273 TraceCheckUtils]: 58: Hoare triple {15070#(<= bor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15077#(<= bor_~i~0 3)} is VALID [2018-11-23 12:26:51,809 INFO L273 TraceCheckUtils]: 59: Hoare triple {15077#(<= bor_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15077#(<= bor_~i~0 3)} is VALID [2018-11-23 12:26:51,809 INFO L273 TraceCheckUtils]: 60: Hoare triple {15077#(<= bor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15084#(<= bor_~i~0 4)} is VALID [2018-11-23 12:26:51,810 INFO L273 TraceCheckUtils]: 61: Hoare triple {15084#(<= bor_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15084#(<= bor_~i~0 4)} is VALID [2018-11-23 12:26:51,811 INFO L273 TraceCheckUtils]: 62: Hoare triple {15084#(<= bor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15091#(<= bor_~i~0 5)} is VALID [2018-11-23 12:26:51,811 INFO L273 TraceCheckUtils]: 63: Hoare triple {15091#(<= bor_~i~0 5)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15091#(<= bor_~i~0 5)} is VALID [2018-11-23 12:26:51,812 INFO L273 TraceCheckUtils]: 64: Hoare triple {15091#(<= bor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15098#(<= bor_~i~0 6)} is VALID [2018-11-23 12:26:51,813 INFO L273 TraceCheckUtils]: 65: Hoare triple {15098#(<= bor_~i~0 6)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15098#(<= bor_~i~0 6)} is VALID [2018-11-23 12:26:51,814 INFO L273 TraceCheckUtils]: 66: Hoare triple {15098#(<= bor_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15105#(<= bor_~i~0 7)} is VALID [2018-11-23 12:26:51,815 INFO L273 TraceCheckUtils]: 67: Hoare triple {15105#(<= bor_~i~0 7)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15105#(<= bor_~i~0 7)} is VALID [2018-11-23 12:26:51,815 INFO L273 TraceCheckUtils]: 68: Hoare triple {15105#(<= bor_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15112#(<= bor_~i~0 8)} is VALID [2018-11-23 12:26:51,816 INFO L273 TraceCheckUtils]: 69: Hoare triple {15112#(<= bor_~i~0 8)} assume !(~i~0 < 10000); {14873#false} is VALID [2018-11-23 12:26:51,816 INFO L273 TraceCheckUtils]: 70: Hoare triple {14873#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14873#false} is VALID [2018-11-23 12:26:51,817 INFO L273 TraceCheckUtils]: 71: Hoare triple {14873#false} assume true; {14873#false} is VALID [2018-11-23 12:26:51,817 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {14873#false} {14872#true} #70#return; {14873#false} is VALID [2018-11-23 12:26:51,817 INFO L273 TraceCheckUtils]: 73: Hoare triple {14873#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {14873#false} is VALID [2018-11-23 12:26:51,817 INFO L256 TraceCheckUtils]: 74: Hoare triple {14873#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {14873#false} is VALID [2018-11-23 12:26:51,817 INFO L273 TraceCheckUtils]: 75: Hoare triple {14873#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14873#false} is VALID [2018-11-23 12:26:51,818 INFO L273 TraceCheckUtils]: 76: Hoare triple {14873#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:26:51,818 INFO L273 TraceCheckUtils]: 77: Hoare triple {14873#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14873#false} is VALID [2018-11-23 12:26:51,818 INFO L273 TraceCheckUtils]: 78: Hoare triple {14873#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:26:51,818 INFO L273 TraceCheckUtils]: 79: Hoare triple {14873#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14873#false} is VALID [2018-11-23 12:26:51,818 INFO L273 TraceCheckUtils]: 80: Hoare triple {14873#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:26:51,819 INFO L273 TraceCheckUtils]: 81: Hoare triple {14873#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14873#false} is VALID [2018-11-23 12:26:51,819 INFO L273 TraceCheckUtils]: 82: Hoare triple {14873#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:26:51,819 INFO L273 TraceCheckUtils]: 83: Hoare triple {14873#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14873#false} is VALID [2018-11-23 12:26:51,819 INFO L273 TraceCheckUtils]: 84: Hoare triple {14873#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:26:51,819 INFO L273 TraceCheckUtils]: 85: Hoare triple {14873#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14873#false} is VALID [2018-11-23 12:26:51,819 INFO L273 TraceCheckUtils]: 86: Hoare triple {14873#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:26:51,820 INFO L273 TraceCheckUtils]: 87: Hoare triple {14873#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14873#false} is VALID [2018-11-23 12:26:51,820 INFO L273 TraceCheckUtils]: 88: Hoare triple {14873#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:26:51,820 INFO L273 TraceCheckUtils]: 89: Hoare triple {14873#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14873#false} is VALID [2018-11-23 12:26:51,820 INFO L273 TraceCheckUtils]: 90: Hoare triple {14873#false} assume !(~i~0 < 10000); {14873#false} is VALID [2018-11-23 12:26:51,820 INFO L273 TraceCheckUtils]: 91: Hoare triple {14873#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14873#false} is VALID [2018-11-23 12:26:51,821 INFO L273 TraceCheckUtils]: 92: Hoare triple {14873#false} assume true; {14873#false} is VALID [2018-11-23 12:26:51,821 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {14873#false} {14873#false} #72#return; {14873#false} is VALID [2018-11-23 12:26:51,821 INFO L273 TraceCheckUtils]: 94: Hoare triple {14873#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {14873#false} is VALID [2018-11-23 12:26:51,821 INFO L273 TraceCheckUtils]: 95: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14873#false} is VALID [2018-11-23 12:26:51,821 INFO L273 TraceCheckUtils]: 96: Hoare triple {14873#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14873#false} is VALID [2018-11-23 12:26:51,821 INFO L273 TraceCheckUtils]: 97: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14873#false} is VALID [2018-11-23 12:26:51,821 INFO L273 TraceCheckUtils]: 98: Hoare triple {14873#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14873#false} is VALID [2018-11-23 12:26:51,821 INFO L273 TraceCheckUtils]: 99: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14873#false} is VALID [2018-11-23 12:26:51,822 INFO L273 TraceCheckUtils]: 100: Hoare triple {14873#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14873#false} is VALID [2018-11-23 12:26:51,822 INFO L273 TraceCheckUtils]: 101: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14873#false} is VALID [2018-11-23 12:26:51,822 INFO L273 TraceCheckUtils]: 102: Hoare triple {14873#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14873#false} is VALID [2018-11-23 12:26:51,822 INFO L273 TraceCheckUtils]: 103: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14873#false} is VALID [2018-11-23 12:26:51,822 INFO L273 TraceCheckUtils]: 104: Hoare triple {14873#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14873#false} is VALID [2018-11-23 12:26:51,822 INFO L273 TraceCheckUtils]: 105: Hoare triple {14873#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14873#false} is VALID [2018-11-23 12:26:51,822 INFO L273 TraceCheckUtils]: 106: Hoare triple {14873#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14873#false} is VALID [2018-11-23 12:26:51,822 INFO L273 TraceCheckUtils]: 107: Hoare triple {14873#false} assume !(~i~2 < 9999); {14873#false} is VALID [2018-11-23 12:26:51,822 INFO L273 TraceCheckUtils]: 108: Hoare triple {14873#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {14873#false} is VALID [2018-11-23 12:26:51,822 INFO L256 TraceCheckUtils]: 109: Hoare triple {14873#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {14873#false} is VALID [2018-11-23 12:26:51,823 INFO L273 TraceCheckUtils]: 110: Hoare triple {14873#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14873#false} is VALID [2018-11-23 12:26:51,823 INFO L273 TraceCheckUtils]: 111: Hoare triple {14873#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:26:51,823 INFO L273 TraceCheckUtils]: 112: Hoare triple {14873#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14873#false} is VALID [2018-11-23 12:26:51,823 INFO L273 TraceCheckUtils]: 113: Hoare triple {14873#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:26:51,823 INFO L273 TraceCheckUtils]: 114: Hoare triple {14873#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14873#false} is VALID [2018-11-23 12:26:51,823 INFO L273 TraceCheckUtils]: 115: Hoare triple {14873#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:26:51,823 INFO L273 TraceCheckUtils]: 116: Hoare triple {14873#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14873#false} is VALID [2018-11-23 12:26:51,823 INFO L273 TraceCheckUtils]: 117: Hoare triple {14873#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:26:51,823 INFO L273 TraceCheckUtils]: 118: Hoare triple {14873#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14873#false} is VALID [2018-11-23 12:26:51,824 INFO L273 TraceCheckUtils]: 119: Hoare triple {14873#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:26:51,824 INFO L273 TraceCheckUtils]: 120: Hoare triple {14873#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14873#false} is VALID [2018-11-23 12:26:51,824 INFO L273 TraceCheckUtils]: 121: Hoare triple {14873#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:26:51,824 INFO L273 TraceCheckUtils]: 122: Hoare triple {14873#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14873#false} is VALID [2018-11-23 12:26:51,824 INFO L273 TraceCheckUtils]: 123: Hoare triple {14873#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:26:51,824 INFO L273 TraceCheckUtils]: 124: Hoare triple {14873#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14873#false} is VALID [2018-11-23 12:26:51,824 INFO L273 TraceCheckUtils]: 125: Hoare triple {14873#false} assume !(~i~0 < 10000); {14873#false} is VALID [2018-11-23 12:26:51,824 INFO L273 TraceCheckUtils]: 126: Hoare triple {14873#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14873#false} is VALID [2018-11-23 12:26:51,824 INFO L273 TraceCheckUtils]: 127: Hoare triple {14873#false} assume true; {14873#false} is VALID [2018-11-23 12:26:51,825 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {14873#false} {14873#false} #74#return; {14873#false} is VALID [2018-11-23 12:26:51,825 INFO L273 TraceCheckUtils]: 129: Hoare triple {14873#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {14873#false} is VALID [2018-11-23 12:26:51,825 INFO L273 TraceCheckUtils]: 130: Hoare triple {14873#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {14873#false} is VALID [2018-11-23 12:26:51,825 INFO L273 TraceCheckUtils]: 131: Hoare triple {14873#false} assume !false; {14873#false} is VALID [2018-11-23 12:26:51,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 228 proven. 49 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2018-11-23 12:26:51,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:51,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10] total 34 [2018-11-23 12:26:51,854 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 132 [2018-11-23 12:26:51,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:51,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:26:52,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:52,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:26:52,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:26:52,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:26:52,087 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 34 states. [2018-11-23 12:26:53,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:53,228 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2018-11-23 12:26:53,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:26:53,229 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 132 [2018-11-23 12:26:53,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:53,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:26:53,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 120 transitions. [2018-11-23 12:26:53,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:26:53,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 120 transitions. [2018-11-23 12:26:53,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 120 transitions. [2018-11-23 12:26:53,492 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-23 12:26:53,495 INFO L225 Difference]: With dead ends: 143 [2018-11-23 12:26:53,495 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 12:26:53,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:26:53,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 12:26:53,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-11-23 12:26:53,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:53,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 99 states. [2018-11-23 12:26:53,564 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 99 states. [2018-11-23 12:26:53,564 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 99 states. [2018-11-23 12:26:53,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:53,567 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-23 12:26:53,567 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-23 12:26:53,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:53,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:53,569 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 101 states. [2018-11-23 12:26:53,569 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 101 states. [2018-11-23 12:26:53,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:53,571 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-23 12:26:53,571 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-23 12:26:53,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:53,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:53,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:53,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:53,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 12:26:53,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2018-11-23 12:26:53,574 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 132 [2018-11-23 12:26:53,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:53,574 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2018-11-23 12:26:53,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 12:26:53,575 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-11-23 12:26:53,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-23 12:26:53,576 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:53,576 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 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-23 12:26:53,576 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:53,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:53,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1976094561, now seen corresponding path program 24 times [2018-11-23 12:26:53,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:53,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:53,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:53,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:53,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:54,510 INFO L256 TraceCheckUtils]: 0: Hoare triple {15862#true} call ULTIMATE.init(); {15862#true} is VALID [2018-11-23 12:26:54,511 INFO L273 TraceCheckUtils]: 1: Hoare triple {15862#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15862#true} is VALID [2018-11-23 12:26:54,511 INFO L273 TraceCheckUtils]: 2: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:26:54,511 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15862#true} {15862#true} #66#return; {15862#true} is VALID [2018-11-23 12:26:54,512 INFO L256 TraceCheckUtils]: 4: Hoare triple {15862#true} call #t~ret13 := main(); {15862#true} is VALID [2018-11-23 12:26:54,513 INFO L273 TraceCheckUtils]: 5: Hoare triple {15862#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; {15864#(= main_~i~1 0)} is VALID [2018-11-23 12:26:54,513 INFO L273 TraceCheckUtils]: 6: Hoare triple {15864#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {15864#(= main_~i~1 0)} is VALID [2018-11-23 12:26:54,514 INFO L273 TraceCheckUtils]: 7: Hoare triple {15864#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15865#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:54,514 INFO L273 TraceCheckUtils]: 8: Hoare triple {15865#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {15865#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:54,515 INFO L273 TraceCheckUtils]: 9: Hoare triple {15865#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15866#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:54,515 INFO L273 TraceCheckUtils]: 10: Hoare triple {15866#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {15866#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:54,516 INFO L273 TraceCheckUtils]: 11: Hoare triple {15866#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15867#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:54,516 INFO L273 TraceCheckUtils]: 12: Hoare triple {15867#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {15867#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:54,517 INFO L273 TraceCheckUtils]: 13: Hoare triple {15867#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15868#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:54,517 INFO L273 TraceCheckUtils]: 14: Hoare triple {15868#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {15868#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:54,518 INFO L273 TraceCheckUtils]: 15: Hoare triple {15868#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15869#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:54,519 INFO L273 TraceCheckUtils]: 16: Hoare triple {15869#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {15869#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:54,520 INFO L273 TraceCheckUtils]: 17: Hoare triple {15869#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15870#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:54,520 INFO L273 TraceCheckUtils]: 18: Hoare triple {15870#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {15870#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:54,521 INFO L273 TraceCheckUtils]: 19: Hoare triple {15870#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15871#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:54,522 INFO L273 TraceCheckUtils]: 20: Hoare triple {15871#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {15871#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:54,523 INFO L273 TraceCheckUtils]: 21: Hoare triple {15871#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15872#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:54,542 INFO L273 TraceCheckUtils]: 22: Hoare triple {15872#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {15872#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:54,557 INFO L273 TraceCheckUtils]: 23: Hoare triple {15872#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15873#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:54,573 INFO L273 TraceCheckUtils]: 24: Hoare triple {15873#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {15873#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:54,574 INFO L273 TraceCheckUtils]: 25: Hoare triple {15873#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15874#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:54,574 INFO L273 TraceCheckUtils]: 26: Hoare triple {15874#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {15874#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:54,575 INFO L273 TraceCheckUtils]: 27: Hoare triple {15874#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15875#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:54,575 INFO L273 TraceCheckUtils]: 28: Hoare triple {15875#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {15875#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:54,576 INFO L273 TraceCheckUtils]: 29: Hoare triple {15875#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15876#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:54,576 INFO L273 TraceCheckUtils]: 30: Hoare triple {15876#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {15876#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:54,577 INFO L273 TraceCheckUtils]: 31: Hoare triple {15876#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15877#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:54,577 INFO L273 TraceCheckUtils]: 32: Hoare triple {15877#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {15877#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:54,578 INFO L273 TraceCheckUtils]: 33: Hoare triple {15877#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15878#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:54,578 INFO L273 TraceCheckUtils]: 34: Hoare triple {15878#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {15878#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:54,579 INFO L273 TraceCheckUtils]: 35: Hoare triple {15878#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15879#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:54,579 INFO L273 TraceCheckUtils]: 36: Hoare triple {15879#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {15879#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:54,580 INFO L273 TraceCheckUtils]: 37: Hoare triple {15879#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15880#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:54,581 INFO L273 TraceCheckUtils]: 38: Hoare triple {15880#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {15880#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:54,582 INFO L273 TraceCheckUtils]: 39: Hoare triple {15880#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15881#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:54,583 INFO L273 TraceCheckUtils]: 40: Hoare triple {15881#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {15881#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:54,583 INFO L273 TraceCheckUtils]: 41: Hoare triple {15881#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15882#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:54,584 INFO L273 TraceCheckUtils]: 42: Hoare triple {15882#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {15882#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:54,585 INFO L273 TraceCheckUtils]: 43: Hoare triple {15882#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15883#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:54,586 INFO L273 TraceCheckUtils]: 44: Hoare triple {15883#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {15883#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:54,586 INFO L273 TraceCheckUtils]: 45: Hoare triple {15883#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15884#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:54,587 INFO L273 TraceCheckUtils]: 46: Hoare triple {15884#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {15884#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:54,588 INFO L273 TraceCheckUtils]: 47: Hoare triple {15884#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15885#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:54,589 INFO L273 TraceCheckUtils]: 48: Hoare triple {15885#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {15885#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:54,590 INFO L273 TraceCheckUtils]: 49: Hoare triple {15885#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15886#(<= main_~i~1 22)} is VALID [2018-11-23 12:26:54,590 INFO L273 TraceCheckUtils]: 50: Hoare triple {15886#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {15886#(<= main_~i~1 22)} is VALID [2018-11-23 12:26:54,591 INFO L273 TraceCheckUtils]: 51: Hoare triple {15886#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15887#(<= main_~i~1 23)} is VALID [2018-11-23 12:26:54,592 INFO L273 TraceCheckUtils]: 52: Hoare triple {15887#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {15887#(<= main_~i~1 23)} is VALID [2018-11-23 12:26:54,593 INFO L273 TraceCheckUtils]: 53: Hoare triple {15887#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15888#(<= main_~i~1 24)} is VALID [2018-11-23 12:26:54,593 INFO L273 TraceCheckUtils]: 54: Hoare triple {15888#(<= main_~i~1 24)} assume !(~i~1 < 10000); {15863#false} is VALID [2018-11-23 12:26:54,594 INFO L256 TraceCheckUtils]: 55: Hoare triple {15863#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {15862#true} is VALID [2018-11-23 12:26:54,594 INFO L273 TraceCheckUtils]: 56: Hoare triple {15862#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15862#true} is VALID [2018-11-23 12:26:54,594 INFO L273 TraceCheckUtils]: 57: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:54,594 INFO L273 TraceCheckUtils]: 58: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:54,594 INFO L273 TraceCheckUtils]: 59: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:54,595 INFO L273 TraceCheckUtils]: 60: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:54,595 INFO L273 TraceCheckUtils]: 61: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:54,595 INFO L273 TraceCheckUtils]: 62: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:54,595 INFO L273 TraceCheckUtils]: 63: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:54,595 INFO L273 TraceCheckUtils]: 64: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:54,596 INFO L273 TraceCheckUtils]: 65: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:54,596 INFO L273 TraceCheckUtils]: 66: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:54,596 INFO L273 TraceCheckUtils]: 67: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:54,596 INFO L273 TraceCheckUtils]: 68: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:54,596 INFO L273 TraceCheckUtils]: 69: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:54,596 INFO L273 TraceCheckUtils]: 70: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:54,597 INFO L273 TraceCheckUtils]: 71: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:54,597 INFO L273 TraceCheckUtils]: 72: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:54,597 INFO L273 TraceCheckUtils]: 73: Hoare triple {15862#true} assume !(~i~0 < 10000); {15862#true} is VALID [2018-11-23 12:26:54,597 INFO L273 TraceCheckUtils]: 74: Hoare triple {15862#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15862#true} is VALID [2018-11-23 12:26:54,597 INFO L273 TraceCheckUtils]: 75: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:26:54,598 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {15862#true} {15863#false} #70#return; {15863#false} is VALID [2018-11-23 12:26:54,598 INFO L273 TraceCheckUtils]: 77: Hoare triple {15863#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {15863#false} is VALID [2018-11-23 12:26:54,598 INFO L256 TraceCheckUtils]: 78: Hoare triple {15863#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {15862#true} is VALID [2018-11-23 12:26:54,598 INFO L273 TraceCheckUtils]: 79: Hoare triple {15862#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15862#true} is VALID [2018-11-23 12:26:54,598 INFO L273 TraceCheckUtils]: 80: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:54,598 INFO L273 TraceCheckUtils]: 81: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:54,599 INFO L273 TraceCheckUtils]: 82: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:54,599 INFO L273 TraceCheckUtils]: 83: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:54,599 INFO L273 TraceCheckUtils]: 84: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:54,599 INFO L273 TraceCheckUtils]: 85: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:54,599 INFO L273 TraceCheckUtils]: 86: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:54,599 INFO L273 TraceCheckUtils]: 87: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:54,599 INFO L273 TraceCheckUtils]: 88: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:54,600 INFO L273 TraceCheckUtils]: 89: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:54,600 INFO L273 TraceCheckUtils]: 90: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:54,600 INFO L273 TraceCheckUtils]: 91: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:54,600 INFO L273 TraceCheckUtils]: 92: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:54,600 INFO L273 TraceCheckUtils]: 93: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:54,600 INFO L273 TraceCheckUtils]: 94: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:54,600 INFO L273 TraceCheckUtils]: 95: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:54,600 INFO L273 TraceCheckUtils]: 96: Hoare triple {15862#true} assume !(~i~0 < 10000); {15862#true} is VALID [2018-11-23 12:26:54,600 INFO L273 TraceCheckUtils]: 97: Hoare triple {15862#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15862#true} is VALID [2018-11-23 12:26:54,600 INFO L273 TraceCheckUtils]: 98: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:26:54,601 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {15862#true} {15863#false} #72#return; {15863#false} is VALID [2018-11-23 12:26:54,601 INFO L273 TraceCheckUtils]: 100: Hoare triple {15863#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {15863#false} is VALID [2018-11-23 12:26:54,601 INFO L273 TraceCheckUtils]: 101: Hoare triple {15863#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15863#false} is VALID [2018-11-23 12:26:54,601 INFO L273 TraceCheckUtils]: 102: Hoare triple {15863#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15863#false} is VALID [2018-11-23 12:26:54,601 INFO L273 TraceCheckUtils]: 103: Hoare triple {15863#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15863#false} is VALID [2018-11-23 12:26:54,601 INFO L273 TraceCheckUtils]: 104: Hoare triple {15863#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15863#false} is VALID [2018-11-23 12:26:54,601 INFO L273 TraceCheckUtils]: 105: Hoare triple {15863#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15863#false} is VALID [2018-11-23 12:26:54,601 INFO L273 TraceCheckUtils]: 106: Hoare triple {15863#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15863#false} is VALID [2018-11-23 12:26:54,601 INFO L273 TraceCheckUtils]: 107: Hoare triple {15863#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15863#false} is VALID [2018-11-23 12:26:54,602 INFO L273 TraceCheckUtils]: 108: Hoare triple {15863#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15863#false} is VALID [2018-11-23 12:26:54,602 INFO L273 TraceCheckUtils]: 109: Hoare triple {15863#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15863#false} is VALID [2018-11-23 12:26:54,602 INFO L273 TraceCheckUtils]: 110: Hoare triple {15863#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15863#false} is VALID [2018-11-23 12:26:54,602 INFO L273 TraceCheckUtils]: 111: Hoare triple {15863#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15863#false} is VALID [2018-11-23 12:26:54,602 INFO L273 TraceCheckUtils]: 112: Hoare triple {15863#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15863#false} is VALID [2018-11-23 12:26:54,602 INFO L273 TraceCheckUtils]: 113: Hoare triple {15863#false} assume !(~i~2 < 9999); {15863#false} is VALID [2018-11-23 12:26:54,602 INFO L273 TraceCheckUtils]: 114: Hoare triple {15863#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {15863#false} is VALID [2018-11-23 12:26:54,602 INFO L256 TraceCheckUtils]: 115: Hoare triple {15863#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {15862#true} is VALID [2018-11-23 12:26:54,602 INFO L273 TraceCheckUtils]: 116: Hoare triple {15862#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15862#true} is VALID [2018-11-23 12:26:54,602 INFO L273 TraceCheckUtils]: 117: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:54,603 INFO L273 TraceCheckUtils]: 118: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:54,603 INFO L273 TraceCheckUtils]: 119: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:54,603 INFO L273 TraceCheckUtils]: 120: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:54,603 INFO L273 TraceCheckUtils]: 121: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:54,603 INFO L273 TraceCheckUtils]: 122: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:54,603 INFO L273 TraceCheckUtils]: 123: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:54,603 INFO L273 TraceCheckUtils]: 124: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:54,603 INFO L273 TraceCheckUtils]: 125: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:54,603 INFO L273 TraceCheckUtils]: 126: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:54,604 INFO L273 TraceCheckUtils]: 127: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:54,604 INFO L273 TraceCheckUtils]: 128: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:54,604 INFO L273 TraceCheckUtils]: 129: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:54,604 INFO L273 TraceCheckUtils]: 130: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:54,604 INFO L273 TraceCheckUtils]: 131: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:54,604 INFO L273 TraceCheckUtils]: 132: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:54,604 INFO L273 TraceCheckUtils]: 133: Hoare triple {15862#true} assume !(~i~0 < 10000); {15862#true} is VALID [2018-11-23 12:26:54,604 INFO L273 TraceCheckUtils]: 134: Hoare triple {15862#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15862#true} is VALID [2018-11-23 12:26:54,604 INFO L273 TraceCheckUtils]: 135: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:26:54,605 INFO L268 TraceCheckUtils]: 136: Hoare quadruple {15862#true} {15863#false} #74#return; {15863#false} is VALID [2018-11-23 12:26:54,605 INFO L273 TraceCheckUtils]: 137: Hoare triple {15863#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {15863#false} is VALID [2018-11-23 12:26:54,605 INFO L273 TraceCheckUtils]: 138: Hoare triple {15863#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {15863#false} is VALID [2018-11-23 12:26:54,605 INFO L273 TraceCheckUtils]: 139: Hoare triple {15863#false} assume !false; {15863#false} is VALID [2018-11-23 12:26:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2018-11-23 12:26:54,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:54,615 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:54,624 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:26:55,328 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-11-23 12:26:55,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:55,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:56,827 INFO L256 TraceCheckUtils]: 0: Hoare triple {15862#true} call ULTIMATE.init(); {15862#true} is VALID [2018-11-23 12:26:56,828 INFO L273 TraceCheckUtils]: 1: Hoare triple {15862#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15862#true} is VALID [2018-11-23 12:26:56,828 INFO L273 TraceCheckUtils]: 2: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:26:56,828 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15862#true} {15862#true} #66#return; {15862#true} is VALID [2018-11-23 12:26:56,828 INFO L256 TraceCheckUtils]: 4: Hoare triple {15862#true} call #t~ret13 := main(); {15862#true} is VALID [2018-11-23 12:26:56,829 INFO L273 TraceCheckUtils]: 5: Hoare triple {15862#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; {15862#true} is VALID [2018-11-23 12:26:56,829 INFO L273 TraceCheckUtils]: 6: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:56,829 INFO L273 TraceCheckUtils]: 7: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:56,829 INFO L273 TraceCheckUtils]: 8: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:56,830 INFO L273 TraceCheckUtils]: 9: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:56,830 INFO L273 TraceCheckUtils]: 10: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:56,830 INFO L273 TraceCheckUtils]: 11: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:56,830 INFO L273 TraceCheckUtils]: 12: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:56,831 INFO L273 TraceCheckUtils]: 13: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:56,831 INFO L273 TraceCheckUtils]: 14: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:56,831 INFO L273 TraceCheckUtils]: 15: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:56,831 INFO L273 TraceCheckUtils]: 16: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:56,831 INFO L273 TraceCheckUtils]: 17: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:56,831 INFO L273 TraceCheckUtils]: 18: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:56,831 INFO L273 TraceCheckUtils]: 19: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:56,832 INFO L273 TraceCheckUtils]: 20: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:56,832 INFO L273 TraceCheckUtils]: 21: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:56,832 INFO L273 TraceCheckUtils]: 22: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:56,832 INFO L273 TraceCheckUtils]: 23: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:56,832 INFO L273 TraceCheckUtils]: 24: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:56,832 INFO L273 TraceCheckUtils]: 25: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:56,832 INFO L273 TraceCheckUtils]: 26: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:56,832 INFO L273 TraceCheckUtils]: 27: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:56,832 INFO L273 TraceCheckUtils]: 28: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:56,832 INFO L273 TraceCheckUtils]: 29: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:56,833 INFO L273 TraceCheckUtils]: 30: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:56,833 INFO L273 TraceCheckUtils]: 31: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:56,833 INFO L273 TraceCheckUtils]: 32: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:56,833 INFO L273 TraceCheckUtils]: 33: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:56,833 INFO L273 TraceCheckUtils]: 34: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:56,833 INFO L273 TraceCheckUtils]: 35: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:56,833 INFO L273 TraceCheckUtils]: 36: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:56,833 INFO L273 TraceCheckUtils]: 37: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:56,833 INFO L273 TraceCheckUtils]: 38: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:56,833 INFO L273 TraceCheckUtils]: 39: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:56,834 INFO L273 TraceCheckUtils]: 40: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:56,834 INFO L273 TraceCheckUtils]: 41: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:56,834 INFO L273 TraceCheckUtils]: 42: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:56,834 INFO L273 TraceCheckUtils]: 43: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:56,834 INFO L273 TraceCheckUtils]: 44: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:56,834 INFO L273 TraceCheckUtils]: 45: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:56,834 INFO L273 TraceCheckUtils]: 46: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:56,834 INFO L273 TraceCheckUtils]: 47: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:56,834 INFO L273 TraceCheckUtils]: 48: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:56,835 INFO L273 TraceCheckUtils]: 49: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:56,835 INFO L273 TraceCheckUtils]: 50: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:56,835 INFO L273 TraceCheckUtils]: 51: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:56,835 INFO L273 TraceCheckUtils]: 52: Hoare triple {15862#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:56,835 INFO L273 TraceCheckUtils]: 53: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:56,835 INFO L273 TraceCheckUtils]: 54: Hoare triple {15862#true} assume !(~i~1 < 10000); {15862#true} is VALID [2018-11-23 12:26:56,835 INFO L256 TraceCheckUtils]: 55: Hoare triple {15862#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {15862#true} is VALID [2018-11-23 12:26:56,835 INFO L273 TraceCheckUtils]: 56: Hoare triple {15862#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15862#true} is VALID [2018-11-23 12:26:56,835 INFO L273 TraceCheckUtils]: 57: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:56,836 INFO L273 TraceCheckUtils]: 58: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:56,836 INFO L273 TraceCheckUtils]: 59: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:56,836 INFO L273 TraceCheckUtils]: 60: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:56,836 INFO L273 TraceCheckUtils]: 61: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:56,836 INFO L273 TraceCheckUtils]: 62: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:56,836 INFO L273 TraceCheckUtils]: 63: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:56,836 INFO L273 TraceCheckUtils]: 64: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:56,836 INFO L273 TraceCheckUtils]: 65: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:56,836 INFO L273 TraceCheckUtils]: 66: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:56,836 INFO L273 TraceCheckUtils]: 67: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:56,837 INFO L273 TraceCheckUtils]: 68: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:56,837 INFO L273 TraceCheckUtils]: 69: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:56,837 INFO L273 TraceCheckUtils]: 70: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:56,837 INFO L273 TraceCheckUtils]: 71: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:56,837 INFO L273 TraceCheckUtils]: 72: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:56,837 INFO L273 TraceCheckUtils]: 73: Hoare triple {15862#true} assume !(~i~0 < 10000); {15862#true} is VALID [2018-11-23 12:26:56,837 INFO L273 TraceCheckUtils]: 74: Hoare triple {15862#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15862#true} is VALID [2018-11-23 12:26:56,837 INFO L273 TraceCheckUtils]: 75: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:26:56,837 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {15862#true} {15862#true} #70#return; {15862#true} is VALID [2018-11-23 12:26:56,837 INFO L273 TraceCheckUtils]: 77: Hoare triple {15862#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {15862#true} is VALID [2018-11-23 12:26:56,838 INFO L256 TraceCheckUtils]: 78: Hoare triple {15862#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {15862#true} is VALID [2018-11-23 12:26:56,838 INFO L273 TraceCheckUtils]: 79: Hoare triple {15862#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15862#true} is VALID [2018-11-23 12:26:56,838 INFO L273 TraceCheckUtils]: 80: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:56,838 INFO L273 TraceCheckUtils]: 81: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:56,838 INFO L273 TraceCheckUtils]: 82: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:56,838 INFO L273 TraceCheckUtils]: 83: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:56,838 INFO L273 TraceCheckUtils]: 84: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:56,838 INFO L273 TraceCheckUtils]: 85: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:56,838 INFO L273 TraceCheckUtils]: 86: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:56,839 INFO L273 TraceCheckUtils]: 87: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:56,839 INFO L273 TraceCheckUtils]: 88: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:56,839 INFO L273 TraceCheckUtils]: 89: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:56,839 INFO L273 TraceCheckUtils]: 90: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:56,839 INFO L273 TraceCheckUtils]: 91: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:56,839 INFO L273 TraceCheckUtils]: 92: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:56,839 INFO L273 TraceCheckUtils]: 93: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:56,839 INFO L273 TraceCheckUtils]: 94: Hoare triple {15862#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:56,839 INFO L273 TraceCheckUtils]: 95: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:56,839 INFO L273 TraceCheckUtils]: 96: Hoare triple {15862#true} assume !(~i~0 < 10000); {15862#true} is VALID [2018-11-23 12:26:56,840 INFO L273 TraceCheckUtils]: 97: Hoare triple {15862#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15862#true} is VALID [2018-11-23 12:26:56,840 INFO L273 TraceCheckUtils]: 98: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:26:56,840 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {15862#true} {15862#true} #72#return; {15862#true} is VALID [2018-11-23 12:26:56,840 INFO L273 TraceCheckUtils]: 100: Hoare triple {15862#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {16192#(<= main_~i~2 0)} is VALID [2018-11-23 12:26:56,841 INFO L273 TraceCheckUtils]: 101: Hoare triple {16192#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16192#(<= main_~i~2 0)} is VALID [2018-11-23 12:26:56,841 INFO L273 TraceCheckUtils]: 102: Hoare triple {16192#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16199#(<= main_~i~2 1)} is VALID [2018-11-23 12:26:56,842 INFO L273 TraceCheckUtils]: 103: Hoare triple {16199#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16199#(<= main_~i~2 1)} is VALID [2018-11-23 12:26:56,842 INFO L273 TraceCheckUtils]: 104: Hoare triple {16199#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16206#(<= main_~i~2 2)} is VALID [2018-11-23 12:26:56,843 INFO L273 TraceCheckUtils]: 105: Hoare triple {16206#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16206#(<= main_~i~2 2)} is VALID [2018-11-23 12:26:56,843 INFO L273 TraceCheckUtils]: 106: Hoare triple {16206#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16213#(<= main_~i~2 3)} is VALID [2018-11-23 12:26:56,844 INFO L273 TraceCheckUtils]: 107: Hoare triple {16213#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16213#(<= main_~i~2 3)} is VALID [2018-11-23 12:26:56,844 INFO L273 TraceCheckUtils]: 108: Hoare triple {16213#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16220#(<= main_~i~2 4)} is VALID [2018-11-23 12:26:56,845 INFO L273 TraceCheckUtils]: 109: Hoare triple {16220#(<= main_~i~2 4)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16220#(<= main_~i~2 4)} is VALID [2018-11-23 12:26:56,846 INFO L273 TraceCheckUtils]: 110: Hoare triple {16220#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16227#(<= main_~i~2 5)} is VALID [2018-11-23 12:26:56,846 INFO L273 TraceCheckUtils]: 111: Hoare triple {16227#(<= main_~i~2 5)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16227#(<= main_~i~2 5)} is VALID [2018-11-23 12:26:56,847 INFO L273 TraceCheckUtils]: 112: Hoare triple {16227#(<= main_~i~2 5)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16234#(<= main_~i~2 6)} is VALID [2018-11-23 12:26:56,848 INFO L273 TraceCheckUtils]: 113: Hoare triple {16234#(<= main_~i~2 6)} assume !(~i~2 < 9999); {15863#false} is VALID [2018-11-23 12:26:56,848 INFO L273 TraceCheckUtils]: 114: Hoare triple {15863#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {15863#false} is VALID [2018-11-23 12:26:56,848 INFO L256 TraceCheckUtils]: 115: Hoare triple {15863#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {15863#false} is VALID [2018-11-23 12:26:56,849 INFO L273 TraceCheckUtils]: 116: Hoare triple {15863#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15863#false} is VALID [2018-11-23 12:26:56,849 INFO L273 TraceCheckUtils]: 117: Hoare triple {15863#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15863#false} is VALID [2018-11-23 12:26:56,849 INFO L273 TraceCheckUtils]: 118: Hoare triple {15863#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15863#false} is VALID [2018-11-23 12:26:56,849 INFO L273 TraceCheckUtils]: 119: Hoare triple {15863#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15863#false} is VALID [2018-11-23 12:26:56,849 INFO L273 TraceCheckUtils]: 120: Hoare triple {15863#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15863#false} is VALID [2018-11-23 12:26:56,850 INFO L273 TraceCheckUtils]: 121: Hoare triple {15863#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15863#false} is VALID [2018-11-23 12:26:56,850 INFO L273 TraceCheckUtils]: 122: Hoare triple {15863#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15863#false} is VALID [2018-11-23 12:26:56,850 INFO L273 TraceCheckUtils]: 123: Hoare triple {15863#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15863#false} is VALID [2018-11-23 12:26:56,850 INFO L273 TraceCheckUtils]: 124: Hoare triple {15863#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15863#false} is VALID [2018-11-23 12:26:56,850 INFO L273 TraceCheckUtils]: 125: Hoare triple {15863#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15863#false} is VALID [2018-11-23 12:26:56,850 INFO L273 TraceCheckUtils]: 126: Hoare triple {15863#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15863#false} is VALID [2018-11-23 12:26:56,851 INFO L273 TraceCheckUtils]: 127: Hoare triple {15863#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15863#false} is VALID [2018-11-23 12:26:56,851 INFO L273 TraceCheckUtils]: 128: Hoare triple {15863#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15863#false} is VALID [2018-11-23 12:26:56,851 INFO L273 TraceCheckUtils]: 129: Hoare triple {15863#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15863#false} is VALID [2018-11-23 12:26:56,851 INFO L273 TraceCheckUtils]: 130: Hoare triple {15863#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15863#false} is VALID [2018-11-23 12:26:56,851 INFO L273 TraceCheckUtils]: 131: Hoare triple {15863#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15863#false} is VALID [2018-11-23 12:26:56,851 INFO L273 TraceCheckUtils]: 132: Hoare triple {15863#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15863#false} is VALID [2018-11-23 12:26:56,851 INFO L273 TraceCheckUtils]: 133: Hoare triple {15863#false} assume !(~i~0 < 10000); {15863#false} is VALID [2018-11-23 12:26:56,852 INFO L273 TraceCheckUtils]: 134: Hoare triple {15863#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15863#false} is VALID [2018-11-23 12:26:56,852 INFO L273 TraceCheckUtils]: 135: Hoare triple {15863#false} assume true; {15863#false} is VALID [2018-11-23 12:26:56,852 INFO L268 TraceCheckUtils]: 136: Hoare quadruple {15863#false} {15863#false} #74#return; {15863#false} is VALID [2018-11-23 12:26:56,852 INFO L273 TraceCheckUtils]: 137: Hoare triple {15863#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {15863#false} is VALID [2018-11-23 12:26:56,852 INFO L273 TraceCheckUtils]: 138: Hoare triple {15863#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {15863#false} is VALID [2018-11-23 12:26:56,852 INFO L273 TraceCheckUtils]: 139: Hoare triple {15863#false} assume !false; {15863#false} is VALID [2018-11-23 12:26:56,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 298 proven. 36 refuted. 0 times theorem prover too weak. 917 trivial. 0 not checked. [2018-11-23 12:26:56,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:56,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 9] total 34 [2018-11-23 12:26:56,881 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 140 [2018-11-23 12:26:56,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:56,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:26:57,556 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:57,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:26:57,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:26:57,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:26:57,557 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 34 states. [2018-11-23 12:26:58,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:58,775 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2018-11-23 12:26:58,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:26:58,775 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 140 [2018-11-23 12:26:58,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:58,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:26:58,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 117 transitions. [2018-11-23 12:26:58,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:26:58,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 117 transitions. [2018-11-23 12:26:58,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 117 transitions. [2018-11-23 12:26:58,939 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-23 12:26:58,941 INFO L225 Difference]: With dead ends: 149 [2018-11-23 12:26:58,941 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 12:26:58,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:26:58,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 12:26:59,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-11-23 12:26:59,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:59,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 103 states. [2018-11-23 12:26:59,011 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 103 states. [2018-11-23 12:26:59,011 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 103 states. [2018-11-23 12:26:59,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:59,014 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-11-23 12:26:59,014 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:26:59,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:59,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:59,014 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 105 states. [2018-11-23 12:26:59,014 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 105 states. [2018-11-23 12:26:59,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:59,016 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-11-23 12:26:59,016 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:26:59,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:59,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:59,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:59,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:59,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-23 12:26:59,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2018-11-23 12:26:59,018 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 140 [2018-11-23 12:26:59,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:59,018 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2018-11-23 12:26:59,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 12:26:59,019 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-23 12:26:59,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-23 12:26:59,020 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:59,020 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 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-23 12:26:59,020 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:59,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:59,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1521279999, now seen corresponding path program 25 times [2018-11-23 12:26:59,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:59,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:59,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:59,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:59,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:59,950 INFO L256 TraceCheckUtils]: 0: Hoare triple {16899#true} call ULTIMATE.init(); {16899#true} is VALID [2018-11-23 12:26:59,951 INFO L273 TraceCheckUtils]: 1: Hoare triple {16899#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16899#true} is VALID [2018-11-23 12:26:59,951 INFO L273 TraceCheckUtils]: 2: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:26:59,951 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16899#true} {16899#true} #66#return; {16899#true} is VALID [2018-11-23 12:26:59,951 INFO L256 TraceCheckUtils]: 4: Hoare triple {16899#true} call #t~ret13 := main(); {16899#true} is VALID [2018-11-23 12:26:59,952 INFO L273 TraceCheckUtils]: 5: Hoare triple {16899#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; {16901#(= main_~i~1 0)} is VALID [2018-11-23 12:26:59,953 INFO L273 TraceCheckUtils]: 6: Hoare triple {16901#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16901#(= main_~i~1 0)} is VALID [2018-11-23 12:26:59,953 INFO L273 TraceCheckUtils]: 7: Hoare triple {16901#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16902#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:59,954 INFO L273 TraceCheckUtils]: 8: Hoare triple {16902#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16902#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:59,955 INFO L273 TraceCheckUtils]: 9: Hoare triple {16902#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16903#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:59,956 INFO L273 TraceCheckUtils]: 10: Hoare triple {16903#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16903#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:59,956 INFO L273 TraceCheckUtils]: 11: Hoare triple {16903#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16904#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:59,957 INFO L273 TraceCheckUtils]: 12: Hoare triple {16904#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16904#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:59,958 INFO L273 TraceCheckUtils]: 13: Hoare triple {16904#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16905#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:59,958 INFO L273 TraceCheckUtils]: 14: Hoare triple {16905#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16905#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:59,959 INFO L273 TraceCheckUtils]: 15: Hoare triple {16905#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16906#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:59,960 INFO L273 TraceCheckUtils]: 16: Hoare triple {16906#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16906#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:59,961 INFO L273 TraceCheckUtils]: 17: Hoare triple {16906#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16907#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:59,961 INFO L273 TraceCheckUtils]: 18: Hoare triple {16907#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16907#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:59,962 INFO L273 TraceCheckUtils]: 19: Hoare triple {16907#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16908#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:59,963 INFO L273 TraceCheckUtils]: 20: Hoare triple {16908#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16908#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:59,963 INFO L273 TraceCheckUtils]: 21: Hoare triple {16908#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16909#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:59,964 INFO L273 TraceCheckUtils]: 22: Hoare triple {16909#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16909#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:59,965 INFO L273 TraceCheckUtils]: 23: Hoare triple {16909#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16910#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:59,965 INFO L273 TraceCheckUtils]: 24: Hoare triple {16910#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16910#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:59,966 INFO L273 TraceCheckUtils]: 25: Hoare triple {16910#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16911#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:59,967 INFO L273 TraceCheckUtils]: 26: Hoare triple {16911#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16911#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:59,968 INFO L273 TraceCheckUtils]: 27: Hoare triple {16911#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16912#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:59,968 INFO L273 TraceCheckUtils]: 28: Hoare triple {16912#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16912#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:59,969 INFO L273 TraceCheckUtils]: 29: Hoare triple {16912#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16913#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:59,970 INFO L273 TraceCheckUtils]: 30: Hoare triple {16913#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16913#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:59,970 INFO L273 TraceCheckUtils]: 31: Hoare triple {16913#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16914#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:59,971 INFO L273 TraceCheckUtils]: 32: Hoare triple {16914#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16914#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:59,972 INFO L273 TraceCheckUtils]: 33: Hoare triple {16914#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16915#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:59,973 INFO L273 TraceCheckUtils]: 34: Hoare triple {16915#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16915#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:59,973 INFO L273 TraceCheckUtils]: 35: Hoare triple {16915#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16916#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:59,974 INFO L273 TraceCheckUtils]: 36: Hoare triple {16916#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16916#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:59,975 INFO L273 TraceCheckUtils]: 37: Hoare triple {16916#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16917#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:59,975 INFO L273 TraceCheckUtils]: 38: Hoare triple {16917#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16917#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:59,976 INFO L273 TraceCheckUtils]: 39: Hoare triple {16917#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16918#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:59,977 INFO L273 TraceCheckUtils]: 40: Hoare triple {16918#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16918#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:59,978 INFO L273 TraceCheckUtils]: 41: Hoare triple {16918#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16919#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:59,978 INFO L273 TraceCheckUtils]: 42: Hoare triple {16919#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16919#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:59,979 INFO L273 TraceCheckUtils]: 43: Hoare triple {16919#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16920#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:59,980 INFO L273 TraceCheckUtils]: 44: Hoare triple {16920#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16920#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:59,980 INFO L273 TraceCheckUtils]: 45: Hoare triple {16920#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16921#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:59,981 INFO L273 TraceCheckUtils]: 46: Hoare triple {16921#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16921#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:59,982 INFO L273 TraceCheckUtils]: 47: Hoare triple {16921#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16922#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:59,983 INFO L273 TraceCheckUtils]: 48: Hoare triple {16922#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16922#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:59,983 INFO L273 TraceCheckUtils]: 49: Hoare triple {16922#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16923#(<= main_~i~1 22)} is VALID [2018-11-23 12:26:59,984 INFO L273 TraceCheckUtils]: 50: Hoare triple {16923#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16923#(<= main_~i~1 22)} is VALID [2018-11-23 12:26:59,985 INFO L273 TraceCheckUtils]: 51: Hoare triple {16923#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16924#(<= main_~i~1 23)} is VALID [2018-11-23 12:26:59,985 INFO L273 TraceCheckUtils]: 52: Hoare triple {16924#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16924#(<= main_~i~1 23)} is VALID [2018-11-23 12:26:59,986 INFO L273 TraceCheckUtils]: 53: Hoare triple {16924#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16925#(<= main_~i~1 24)} is VALID [2018-11-23 12:26:59,987 INFO L273 TraceCheckUtils]: 54: Hoare triple {16925#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16925#(<= main_~i~1 24)} is VALID [2018-11-23 12:26:59,988 INFO L273 TraceCheckUtils]: 55: Hoare triple {16925#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16926#(<= main_~i~1 25)} is VALID [2018-11-23 12:26:59,988 INFO L273 TraceCheckUtils]: 56: Hoare triple {16926#(<= main_~i~1 25)} assume !(~i~1 < 10000); {16900#false} is VALID [2018-11-23 12:26:59,989 INFO L256 TraceCheckUtils]: 57: Hoare triple {16900#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {16899#true} is VALID [2018-11-23 12:26:59,989 INFO L273 TraceCheckUtils]: 58: Hoare triple {16899#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16899#true} is VALID [2018-11-23 12:26:59,989 INFO L273 TraceCheckUtils]: 59: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:59,989 INFO L273 TraceCheckUtils]: 60: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:59,989 INFO L273 TraceCheckUtils]: 61: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:59,989 INFO L273 TraceCheckUtils]: 62: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:59,990 INFO L273 TraceCheckUtils]: 63: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:59,990 INFO L273 TraceCheckUtils]: 64: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:59,990 INFO L273 TraceCheckUtils]: 65: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:59,990 INFO L273 TraceCheckUtils]: 66: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:59,990 INFO L273 TraceCheckUtils]: 67: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:59,990 INFO L273 TraceCheckUtils]: 68: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:59,991 INFO L273 TraceCheckUtils]: 69: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:59,991 INFO L273 TraceCheckUtils]: 70: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:59,991 INFO L273 TraceCheckUtils]: 71: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:59,991 INFO L273 TraceCheckUtils]: 72: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:59,991 INFO L273 TraceCheckUtils]: 73: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:59,991 INFO L273 TraceCheckUtils]: 74: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:59,991 INFO L273 TraceCheckUtils]: 75: Hoare triple {16899#true} assume !(~i~0 < 10000); {16899#true} is VALID [2018-11-23 12:26:59,992 INFO L273 TraceCheckUtils]: 76: Hoare triple {16899#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16899#true} is VALID [2018-11-23 12:26:59,992 INFO L273 TraceCheckUtils]: 77: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:26:59,992 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {16899#true} {16900#false} #70#return; {16900#false} is VALID [2018-11-23 12:26:59,992 INFO L273 TraceCheckUtils]: 79: Hoare triple {16900#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {16900#false} is VALID [2018-11-23 12:26:59,992 INFO L256 TraceCheckUtils]: 80: Hoare triple {16900#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {16899#true} is VALID [2018-11-23 12:26:59,992 INFO L273 TraceCheckUtils]: 81: Hoare triple {16899#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16899#true} is VALID [2018-11-23 12:26:59,992 INFO L273 TraceCheckUtils]: 82: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:59,992 INFO L273 TraceCheckUtils]: 83: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:59,992 INFO L273 TraceCheckUtils]: 84: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:59,993 INFO L273 TraceCheckUtils]: 85: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:59,993 INFO L273 TraceCheckUtils]: 86: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:59,993 INFO L273 TraceCheckUtils]: 87: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:59,993 INFO L273 TraceCheckUtils]: 88: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:59,993 INFO L273 TraceCheckUtils]: 89: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:59,993 INFO L273 TraceCheckUtils]: 90: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:59,993 INFO L273 TraceCheckUtils]: 91: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:59,993 INFO L273 TraceCheckUtils]: 92: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:59,993 INFO L273 TraceCheckUtils]: 93: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:59,993 INFO L273 TraceCheckUtils]: 94: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:59,994 INFO L273 TraceCheckUtils]: 95: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:59,994 INFO L273 TraceCheckUtils]: 96: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:59,994 INFO L273 TraceCheckUtils]: 97: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:59,994 INFO L273 TraceCheckUtils]: 98: Hoare triple {16899#true} assume !(~i~0 < 10000); {16899#true} is VALID [2018-11-23 12:26:59,994 INFO L273 TraceCheckUtils]: 99: Hoare triple {16899#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16899#true} is VALID [2018-11-23 12:26:59,994 INFO L273 TraceCheckUtils]: 100: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:26:59,994 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {16899#true} {16900#false} #72#return; {16900#false} is VALID [2018-11-23 12:26:59,994 INFO L273 TraceCheckUtils]: 102: Hoare triple {16900#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {16900#false} is VALID [2018-11-23 12:26:59,994 INFO L273 TraceCheckUtils]: 103: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16900#false} is VALID [2018-11-23 12:26:59,995 INFO L273 TraceCheckUtils]: 104: Hoare triple {16900#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16900#false} is VALID [2018-11-23 12:26:59,995 INFO L273 TraceCheckUtils]: 105: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16900#false} is VALID [2018-11-23 12:26:59,995 INFO L273 TraceCheckUtils]: 106: Hoare triple {16900#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16900#false} is VALID [2018-11-23 12:26:59,995 INFO L273 TraceCheckUtils]: 107: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16900#false} is VALID [2018-11-23 12:26:59,995 INFO L273 TraceCheckUtils]: 108: Hoare triple {16900#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16900#false} is VALID [2018-11-23 12:26:59,995 INFO L273 TraceCheckUtils]: 109: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16900#false} is VALID [2018-11-23 12:26:59,995 INFO L273 TraceCheckUtils]: 110: Hoare triple {16900#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16900#false} is VALID [2018-11-23 12:26:59,995 INFO L273 TraceCheckUtils]: 111: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16900#false} is VALID [2018-11-23 12:26:59,995 INFO L273 TraceCheckUtils]: 112: Hoare triple {16900#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16900#false} is VALID [2018-11-23 12:26:59,995 INFO L273 TraceCheckUtils]: 113: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16900#false} is VALID [2018-11-23 12:26:59,996 INFO L273 TraceCheckUtils]: 114: Hoare triple {16900#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16900#false} is VALID [2018-11-23 12:26:59,996 INFO L273 TraceCheckUtils]: 115: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16900#false} is VALID [2018-11-23 12:26:59,996 INFO L273 TraceCheckUtils]: 116: Hoare triple {16900#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16900#false} is VALID [2018-11-23 12:26:59,996 INFO L273 TraceCheckUtils]: 117: Hoare triple {16900#false} assume !(~i~2 < 9999); {16900#false} is VALID [2018-11-23 12:26:59,996 INFO L273 TraceCheckUtils]: 118: Hoare triple {16900#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {16900#false} is VALID [2018-11-23 12:26:59,996 INFO L256 TraceCheckUtils]: 119: Hoare triple {16900#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {16899#true} is VALID [2018-11-23 12:26:59,996 INFO L273 TraceCheckUtils]: 120: Hoare triple {16899#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16899#true} is VALID [2018-11-23 12:26:59,996 INFO L273 TraceCheckUtils]: 121: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:59,996 INFO L273 TraceCheckUtils]: 122: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:59,997 INFO L273 TraceCheckUtils]: 123: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:59,997 INFO L273 TraceCheckUtils]: 124: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:59,997 INFO L273 TraceCheckUtils]: 125: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:59,997 INFO L273 TraceCheckUtils]: 126: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:59,997 INFO L273 TraceCheckUtils]: 127: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:59,997 INFO L273 TraceCheckUtils]: 128: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:59,997 INFO L273 TraceCheckUtils]: 129: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:59,997 INFO L273 TraceCheckUtils]: 130: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:59,997 INFO L273 TraceCheckUtils]: 131: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:59,997 INFO L273 TraceCheckUtils]: 132: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:59,998 INFO L273 TraceCheckUtils]: 133: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:59,998 INFO L273 TraceCheckUtils]: 134: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:59,998 INFO L273 TraceCheckUtils]: 135: Hoare triple {16899#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:59,998 INFO L273 TraceCheckUtils]: 136: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:59,998 INFO L273 TraceCheckUtils]: 137: Hoare triple {16899#true} assume !(~i~0 < 10000); {16899#true} is VALID [2018-11-23 12:26:59,998 INFO L273 TraceCheckUtils]: 138: Hoare triple {16899#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16899#true} is VALID [2018-11-23 12:26:59,998 INFO L273 TraceCheckUtils]: 139: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:26:59,998 INFO L268 TraceCheckUtils]: 140: Hoare quadruple {16899#true} {16900#false} #74#return; {16900#false} is VALID [2018-11-23 12:26:59,998 INFO L273 TraceCheckUtils]: 141: Hoare triple {16900#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {16900#false} is VALID [2018-11-23 12:26:59,999 INFO L273 TraceCheckUtils]: 142: Hoare triple {16900#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {16900#false} is VALID [2018-11-23 12:26:59,999 INFO L273 TraceCheckUtils]: 143: Hoare triple {16900#false} assume !false; {16900#false} is VALID [2018-11-23 12:27:00,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-11-23 12:27:00,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:00,009 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:00,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:00,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:00,444 INFO L256 TraceCheckUtils]: 0: Hoare triple {16899#true} call ULTIMATE.init(); {16899#true} is VALID [2018-11-23 12:27:00,444 INFO L273 TraceCheckUtils]: 1: Hoare triple {16899#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16899#true} is VALID [2018-11-23 12:27:00,445 INFO L273 TraceCheckUtils]: 2: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:27:00,445 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16899#true} {16899#true} #66#return; {16899#true} is VALID [2018-11-23 12:27:00,445 INFO L256 TraceCheckUtils]: 4: Hoare triple {16899#true} call #t~ret13 := main(); {16899#true} is VALID [2018-11-23 12:27:00,446 INFO L273 TraceCheckUtils]: 5: Hoare triple {16899#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; {16945#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:00,446 INFO L273 TraceCheckUtils]: 6: Hoare triple {16945#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16945#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:00,447 INFO L273 TraceCheckUtils]: 7: Hoare triple {16945#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16902#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:00,448 INFO L273 TraceCheckUtils]: 8: Hoare triple {16902#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16902#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:00,449 INFO L273 TraceCheckUtils]: 9: Hoare triple {16902#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16903#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:00,449 INFO L273 TraceCheckUtils]: 10: Hoare triple {16903#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16903#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:00,450 INFO L273 TraceCheckUtils]: 11: Hoare triple {16903#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16904#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:00,451 INFO L273 TraceCheckUtils]: 12: Hoare triple {16904#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16904#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:00,452 INFO L273 TraceCheckUtils]: 13: Hoare triple {16904#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16905#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:00,452 INFO L273 TraceCheckUtils]: 14: Hoare triple {16905#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16905#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:00,453 INFO L273 TraceCheckUtils]: 15: Hoare triple {16905#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16906#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:00,454 INFO L273 TraceCheckUtils]: 16: Hoare triple {16906#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16906#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:00,454 INFO L273 TraceCheckUtils]: 17: Hoare triple {16906#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16907#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:00,455 INFO L273 TraceCheckUtils]: 18: Hoare triple {16907#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16907#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:00,456 INFO L273 TraceCheckUtils]: 19: Hoare triple {16907#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16908#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:00,457 INFO L273 TraceCheckUtils]: 20: Hoare triple {16908#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16908#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:00,457 INFO L273 TraceCheckUtils]: 21: Hoare triple {16908#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16909#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:00,458 INFO L273 TraceCheckUtils]: 22: Hoare triple {16909#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16909#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:00,459 INFO L273 TraceCheckUtils]: 23: Hoare triple {16909#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16910#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:00,459 INFO L273 TraceCheckUtils]: 24: Hoare triple {16910#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16910#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:00,460 INFO L273 TraceCheckUtils]: 25: Hoare triple {16910#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16911#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:00,461 INFO L273 TraceCheckUtils]: 26: Hoare triple {16911#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16911#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:00,462 INFO L273 TraceCheckUtils]: 27: Hoare triple {16911#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16912#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:00,462 INFO L273 TraceCheckUtils]: 28: Hoare triple {16912#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16912#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:00,463 INFO L273 TraceCheckUtils]: 29: Hoare triple {16912#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16913#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:00,464 INFO L273 TraceCheckUtils]: 30: Hoare triple {16913#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16913#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:00,465 INFO L273 TraceCheckUtils]: 31: Hoare triple {16913#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16914#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:00,465 INFO L273 TraceCheckUtils]: 32: Hoare triple {16914#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16914#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:00,466 INFO L273 TraceCheckUtils]: 33: Hoare triple {16914#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16915#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:00,467 INFO L273 TraceCheckUtils]: 34: Hoare triple {16915#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16915#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:00,467 INFO L273 TraceCheckUtils]: 35: Hoare triple {16915#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16916#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:00,468 INFO L273 TraceCheckUtils]: 36: Hoare triple {16916#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16916#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:00,469 INFO L273 TraceCheckUtils]: 37: Hoare triple {16916#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16917#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:00,469 INFO L273 TraceCheckUtils]: 38: Hoare triple {16917#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16917#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:00,470 INFO L273 TraceCheckUtils]: 39: Hoare triple {16917#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16918#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:00,471 INFO L273 TraceCheckUtils]: 40: Hoare triple {16918#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16918#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:00,472 INFO L273 TraceCheckUtils]: 41: Hoare triple {16918#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16919#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:00,472 INFO L273 TraceCheckUtils]: 42: Hoare triple {16919#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16919#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:00,473 INFO L273 TraceCheckUtils]: 43: Hoare triple {16919#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16920#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:00,474 INFO L273 TraceCheckUtils]: 44: Hoare triple {16920#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16920#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:00,474 INFO L273 TraceCheckUtils]: 45: Hoare triple {16920#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16921#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:00,475 INFO L273 TraceCheckUtils]: 46: Hoare triple {16921#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16921#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:00,476 INFO L273 TraceCheckUtils]: 47: Hoare triple {16921#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16922#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:00,477 INFO L273 TraceCheckUtils]: 48: Hoare triple {16922#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16922#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:00,477 INFO L273 TraceCheckUtils]: 49: Hoare triple {16922#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16923#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:00,478 INFO L273 TraceCheckUtils]: 50: Hoare triple {16923#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16923#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:00,479 INFO L273 TraceCheckUtils]: 51: Hoare triple {16923#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16924#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:00,479 INFO L273 TraceCheckUtils]: 52: Hoare triple {16924#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16924#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:00,480 INFO L273 TraceCheckUtils]: 53: Hoare triple {16924#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16925#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:00,481 INFO L273 TraceCheckUtils]: 54: Hoare triple {16925#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {16925#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:00,482 INFO L273 TraceCheckUtils]: 55: Hoare triple {16925#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16926#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:00,482 INFO L273 TraceCheckUtils]: 56: Hoare triple {16926#(<= main_~i~1 25)} assume !(~i~1 < 10000); {16900#false} is VALID [2018-11-23 12:27:00,483 INFO L256 TraceCheckUtils]: 57: Hoare triple {16900#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {16900#false} is VALID [2018-11-23 12:27:00,483 INFO L273 TraceCheckUtils]: 58: Hoare triple {16900#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16900#false} is VALID [2018-11-23 12:27:00,483 INFO L273 TraceCheckUtils]: 59: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:27:00,483 INFO L273 TraceCheckUtils]: 60: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:27:00,483 INFO L273 TraceCheckUtils]: 61: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:27:00,483 INFO L273 TraceCheckUtils]: 62: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:27:00,484 INFO L273 TraceCheckUtils]: 63: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:27:00,484 INFO L273 TraceCheckUtils]: 64: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:27:00,484 INFO L273 TraceCheckUtils]: 65: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:27:00,484 INFO L273 TraceCheckUtils]: 66: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:27:00,484 INFO L273 TraceCheckUtils]: 67: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:27:00,484 INFO L273 TraceCheckUtils]: 68: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:27:00,485 INFO L273 TraceCheckUtils]: 69: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:27:00,485 INFO L273 TraceCheckUtils]: 70: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:27:00,485 INFO L273 TraceCheckUtils]: 71: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:27:00,485 INFO L273 TraceCheckUtils]: 72: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:27:00,485 INFO L273 TraceCheckUtils]: 73: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:27:00,485 INFO L273 TraceCheckUtils]: 74: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:27:00,486 INFO L273 TraceCheckUtils]: 75: Hoare triple {16900#false} assume !(~i~0 < 10000); {16900#false} is VALID [2018-11-23 12:27:00,486 INFO L273 TraceCheckUtils]: 76: Hoare triple {16900#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16900#false} is VALID [2018-11-23 12:27:00,486 INFO L273 TraceCheckUtils]: 77: Hoare triple {16900#false} assume true; {16900#false} is VALID [2018-11-23 12:27:00,486 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {16900#false} {16900#false} #70#return; {16900#false} is VALID [2018-11-23 12:27:00,486 INFO L273 TraceCheckUtils]: 79: Hoare triple {16900#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {16900#false} is VALID [2018-11-23 12:27:00,486 INFO L256 TraceCheckUtils]: 80: Hoare triple {16900#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {16900#false} is VALID [2018-11-23 12:27:00,487 INFO L273 TraceCheckUtils]: 81: Hoare triple {16900#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16900#false} is VALID [2018-11-23 12:27:00,487 INFO L273 TraceCheckUtils]: 82: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:27:00,487 INFO L273 TraceCheckUtils]: 83: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:27:00,487 INFO L273 TraceCheckUtils]: 84: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:27:00,487 INFO L273 TraceCheckUtils]: 85: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:27:00,487 INFO L273 TraceCheckUtils]: 86: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:27:00,487 INFO L273 TraceCheckUtils]: 87: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:27:00,487 INFO L273 TraceCheckUtils]: 88: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:27:00,487 INFO L273 TraceCheckUtils]: 89: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:27:00,487 INFO L273 TraceCheckUtils]: 90: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:27:00,488 INFO L273 TraceCheckUtils]: 91: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:27:00,488 INFO L273 TraceCheckUtils]: 92: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:27:00,488 INFO L273 TraceCheckUtils]: 93: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:27:00,488 INFO L273 TraceCheckUtils]: 94: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:27:00,488 INFO L273 TraceCheckUtils]: 95: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:27:00,488 INFO L273 TraceCheckUtils]: 96: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:27:00,488 INFO L273 TraceCheckUtils]: 97: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:27:00,488 INFO L273 TraceCheckUtils]: 98: Hoare triple {16900#false} assume !(~i~0 < 10000); {16900#false} is VALID [2018-11-23 12:27:00,488 INFO L273 TraceCheckUtils]: 99: Hoare triple {16900#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16900#false} is VALID [2018-11-23 12:27:00,488 INFO L273 TraceCheckUtils]: 100: Hoare triple {16900#false} assume true; {16900#false} is VALID [2018-11-23 12:27:00,489 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {16900#false} {16900#false} #72#return; {16900#false} is VALID [2018-11-23 12:27:00,489 INFO L273 TraceCheckUtils]: 102: Hoare triple {16900#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {16900#false} is VALID [2018-11-23 12:27:00,489 INFO L273 TraceCheckUtils]: 103: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16900#false} is VALID [2018-11-23 12:27:00,489 INFO L273 TraceCheckUtils]: 104: Hoare triple {16900#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16900#false} is VALID [2018-11-23 12:27:00,489 INFO L273 TraceCheckUtils]: 105: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16900#false} is VALID [2018-11-23 12:27:00,489 INFO L273 TraceCheckUtils]: 106: Hoare triple {16900#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16900#false} is VALID [2018-11-23 12:27:00,489 INFO L273 TraceCheckUtils]: 107: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16900#false} is VALID [2018-11-23 12:27:00,489 INFO L273 TraceCheckUtils]: 108: Hoare triple {16900#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16900#false} is VALID [2018-11-23 12:27:00,489 INFO L273 TraceCheckUtils]: 109: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16900#false} is VALID [2018-11-23 12:27:00,490 INFO L273 TraceCheckUtils]: 110: Hoare triple {16900#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16900#false} is VALID [2018-11-23 12:27:00,490 INFO L273 TraceCheckUtils]: 111: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16900#false} is VALID [2018-11-23 12:27:00,490 INFO L273 TraceCheckUtils]: 112: Hoare triple {16900#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16900#false} is VALID [2018-11-23 12:27:00,490 INFO L273 TraceCheckUtils]: 113: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16900#false} is VALID [2018-11-23 12:27:00,490 INFO L273 TraceCheckUtils]: 114: Hoare triple {16900#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16900#false} is VALID [2018-11-23 12:27:00,490 INFO L273 TraceCheckUtils]: 115: Hoare triple {16900#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16900#false} is VALID [2018-11-23 12:27:00,490 INFO L273 TraceCheckUtils]: 116: Hoare triple {16900#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16900#false} is VALID [2018-11-23 12:27:00,490 INFO L273 TraceCheckUtils]: 117: Hoare triple {16900#false} assume !(~i~2 < 9999); {16900#false} is VALID [2018-11-23 12:27:00,490 INFO L273 TraceCheckUtils]: 118: Hoare triple {16900#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {16900#false} is VALID [2018-11-23 12:27:00,491 INFO L256 TraceCheckUtils]: 119: Hoare triple {16900#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {16900#false} is VALID [2018-11-23 12:27:00,491 INFO L273 TraceCheckUtils]: 120: Hoare triple {16900#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16900#false} is VALID [2018-11-23 12:27:00,491 INFO L273 TraceCheckUtils]: 121: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:27:00,491 INFO L273 TraceCheckUtils]: 122: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:27:00,491 INFO L273 TraceCheckUtils]: 123: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:27:00,491 INFO L273 TraceCheckUtils]: 124: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:27:00,491 INFO L273 TraceCheckUtils]: 125: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:27:00,491 INFO L273 TraceCheckUtils]: 126: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:27:00,491 INFO L273 TraceCheckUtils]: 127: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:27:00,491 INFO L273 TraceCheckUtils]: 128: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:27:00,492 INFO L273 TraceCheckUtils]: 129: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:27:00,492 INFO L273 TraceCheckUtils]: 130: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:27:00,492 INFO L273 TraceCheckUtils]: 131: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:27:00,492 INFO L273 TraceCheckUtils]: 132: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:27:00,492 INFO L273 TraceCheckUtils]: 133: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:27:00,492 INFO L273 TraceCheckUtils]: 134: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:27:00,492 INFO L273 TraceCheckUtils]: 135: Hoare triple {16900#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:27:00,492 INFO L273 TraceCheckUtils]: 136: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:27:00,492 INFO L273 TraceCheckUtils]: 137: Hoare triple {16900#false} assume !(~i~0 < 10000); {16900#false} is VALID [2018-11-23 12:27:00,493 INFO L273 TraceCheckUtils]: 138: Hoare triple {16900#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16900#false} is VALID [2018-11-23 12:27:00,493 INFO L273 TraceCheckUtils]: 139: Hoare triple {16900#false} assume true; {16900#false} is VALID [2018-11-23 12:27:00,493 INFO L268 TraceCheckUtils]: 140: Hoare quadruple {16900#false} {16900#false} #74#return; {16900#false} is VALID [2018-11-23 12:27:00,493 INFO L273 TraceCheckUtils]: 141: Hoare triple {16900#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {16900#false} is VALID [2018-11-23 12:27:00,493 INFO L273 TraceCheckUtils]: 142: Hoare triple {16900#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {16900#false} is VALID [2018-11-23 12:27:00,493 INFO L273 TraceCheckUtils]: 143: Hoare triple {16900#false} assume !false; {16900#false} is VALID [2018-11-23 12:27:00,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-11-23 12:27:00,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:00,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 12:27:00,523 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 144 [2018-11-23 12:27:00,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:00,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 12:27:00,647 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:00,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 12:27:00,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 12:27:00,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:27:00,648 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 29 states. [2018-11-23 12:27:01,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:01,623 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2018-11-23 12:27:01,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:27:01,624 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 144 [2018-11-23 12:27:01,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:01,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:27:01,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 104 transitions. [2018-11-23 12:27:01,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:27:01,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 104 transitions. [2018-11-23 12:27:01,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 104 transitions. [2018-11-23 12:27:01,779 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:01,782 INFO L225 Difference]: With dead ends: 152 [2018-11-23 12:27:01,782 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 12:27:01,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:27:01,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 12:27:01,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-11-23 12:27:01,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:01,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 105 states. [2018-11-23 12:27:01,850 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 105 states. [2018-11-23 12:27:01,850 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 105 states. [2018-11-23 12:27:01,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:01,853 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-11-23 12:27:01,853 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2018-11-23 12:27:01,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:01,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:01,855 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 106 states. [2018-11-23 12:27:01,855 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 106 states. [2018-11-23 12:27:01,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:01,857 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-11-23 12:27:01,857 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2018-11-23 12:27:01,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:01,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:01,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:01,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:01,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 12:27:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-11-23 12:27:01,861 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 144 [2018-11-23 12:27:01,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:01,861 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-11-23 12:27:01,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 12:27:01,861 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:27:01,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-23 12:27:01,862 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:01,863 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 24, 24, 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-23 12:27:01,863 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:01,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:01,863 INFO L82 PathProgramCache]: Analyzing trace with hash -559946655, now seen corresponding path program 26 times [2018-11-23 12:27:01,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:01,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:01,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:01,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:01,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:03,065 INFO L256 TraceCheckUtils]: 0: Hoare triple {17953#true} call ULTIMATE.init(); {17953#true} is VALID [2018-11-23 12:27:03,066 INFO L273 TraceCheckUtils]: 1: Hoare triple {17953#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17953#true} is VALID [2018-11-23 12:27:03,066 INFO L273 TraceCheckUtils]: 2: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:27:03,066 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17953#true} {17953#true} #66#return; {17953#true} is VALID [2018-11-23 12:27:03,066 INFO L256 TraceCheckUtils]: 4: Hoare triple {17953#true} call #t~ret13 := main(); {17953#true} is VALID [2018-11-23 12:27:03,067 INFO L273 TraceCheckUtils]: 5: Hoare triple {17953#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; {17955#(= main_~i~1 0)} is VALID [2018-11-23 12:27:03,067 INFO L273 TraceCheckUtils]: 6: Hoare triple {17955#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17955#(= main_~i~1 0)} is VALID [2018-11-23 12:27:03,068 INFO L273 TraceCheckUtils]: 7: Hoare triple {17955#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17956#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:03,069 INFO L273 TraceCheckUtils]: 8: Hoare triple {17956#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17956#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:03,070 INFO L273 TraceCheckUtils]: 9: Hoare triple {17956#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17957#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:03,071 INFO L273 TraceCheckUtils]: 10: Hoare triple {17957#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17957#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:03,071 INFO L273 TraceCheckUtils]: 11: Hoare triple {17957#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17958#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:03,072 INFO L273 TraceCheckUtils]: 12: Hoare triple {17958#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17958#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:03,073 INFO L273 TraceCheckUtils]: 13: Hoare triple {17958#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17959#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:03,074 INFO L273 TraceCheckUtils]: 14: Hoare triple {17959#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17959#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:03,075 INFO L273 TraceCheckUtils]: 15: Hoare triple {17959#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17960#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:03,075 INFO L273 TraceCheckUtils]: 16: Hoare triple {17960#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17960#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:03,076 INFO L273 TraceCheckUtils]: 17: Hoare triple {17960#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17961#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:03,077 INFO L273 TraceCheckUtils]: 18: Hoare triple {17961#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17961#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:03,078 INFO L273 TraceCheckUtils]: 19: Hoare triple {17961#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17962#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:03,078 INFO L273 TraceCheckUtils]: 20: Hoare triple {17962#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17962#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:03,079 INFO L273 TraceCheckUtils]: 21: Hoare triple {17962#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17963#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:03,080 INFO L273 TraceCheckUtils]: 22: Hoare triple {17963#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17963#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:03,081 INFO L273 TraceCheckUtils]: 23: Hoare triple {17963#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17964#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:03,081 INFO L273 TraceCheckUtils]: 24: Hoare triple {17964#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17964#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:03,082 INFO L273 TraceCheckUtils]: 25: Hoare triple {17964#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17965#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:03,083 INFO L273 TraceCheckUtils]: 26: Hoare triple {17965#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17965#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:03,084 INFO L273 TraceCheckUtils]: 27: Hoare triple {17965#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17966#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:03,084 INFO L273 TraceCheckUtils]: 28: Hoare triple {17966#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17966#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:03,085 INFO L273 TraceCheckUtils]: 29: Hoare triple {17966#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17967#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:03,086 INFO L273 TraceCheckUtils]: 30: Hoare triple {17967#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17967#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:03,087 INFO L273 TraceCheckUtils]: 31: Hoare triple {17967#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17968#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:03,087 INFO L273 TraceCheckUtils]: 32: Hoare triple {17968#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17968#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:03,088 INFO L273 TraceCheckUtils]: 33: Hoare triple {17968#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17969#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:03,089 INFO L273 TraceCheckUtils]: 34: Hoare triple {17969#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17969#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:03,090 INFO L273 TraceCheckUtils]: 35: Hoare triple {17969#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17970#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:03,090 INFO L273 TraceCheckUtils]: 36: Hoare triple {17970#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17970#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:03,091 INFO L273 TraceCheckUtils]: 37: Hoare triple {17970#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17971#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:03,092 INFO L273 TraceCheckUtils]: 38: Hoare triple {17971#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17971#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:03,093 INFO L273 TraceCheckUtils]: 39: Hoare triple {17971#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17972#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:03,093 INFO L273 TraceCheckUtils]: 40: Hoare triple {17972#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17972#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:03,094 INFO L273 TraceCheckUtils]: 41: Hoare triple {17972#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17973#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:03,095 INFO L273 TraceCheckUtils]: 42: Hoare triple {17973#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17973#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:03,096 INFO L273 TraceCheckUtils]: 43: Hoare triple {17973#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17974#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:03,096 INFO L273 TraceCheckUtils]: 44: Hoare triple {17974#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17974#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:03,097 INFO L273 TraceCheckUtils]: 45: Hoare triple {17974#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17975#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:03,098 INFO L273 TraceCheckUtils]: 46: Hoare triple {17975#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17975#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:03,099 INFO L273 TraceCheckUtils]: 47: Hoare triple {17975#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17976#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:03,099 INFO L273 TraceCheckUtils]: 48: Hoare triple {17976#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17976#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:03,100 INFO L273 TraceCheckUtils]: 49: Hoare triple {17976#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17977#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:03,101 INFO L273 TraceCheckUtils]: 50: Hoare triple {17977#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17977#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:03,102 INFO L273 TraceCheckUtils]: 51: Hoare triple {17977#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17978#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:03,103 INFO L273 TraceCheckUtils]: 52: Hoare triple {17978#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17978#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:03,103 INFO L273 TraceCheckUtils]: 53: Hoare triple {17978#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17979#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:03,104 INFO L273 TraceCheckUtils]: 54: Hoare triple {17979#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17979#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:03,105 INFO L273 TraceCheckUtils]: 55: Hoare triple {17979#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17980#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:03,106 INFO L273 TraceCheckUtils]: 56: Hoare triple {17980#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17980#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:03,106 INFO L273 TraceCheckUtils]: 57: Hoare triple {17980#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17981#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:03,107 INFO L273 TraceCheckUtils]: 58: Hoare triple {17981#(<= main_~i~1 26)} assume !(~i~1 < 10000); {17954#false} is VALID [2018-11-23 12:27:03,107 INFO L256 TraceCheckUtils]: 59: Hoare triple {17954#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {17953#true} is VALID [2018-11-23 12:27:03,108 INFO L273 TraceCheckUtils]: 60: Hoare triple {17953#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17953#true} is VALID [2018-11-23 12:27:03,108 INFO L273 TraceCheckUtils]: 61: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:27:03,108 INFO L273 TraceCheckUtils]: 62: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:27:03,108 INFO L273 TraceCheckUtils]: 63: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:27:03,108 INFO L273 TraceCheckUtils]: 64: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:27:03,109 INFO L273 TraceCheckUtils]: 65: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:27:03,109 INFO L273 TraceCheckUtils]: 66: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:27:03,109 INFO L273 TraceCheckUtils]: 67: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:27:03,109 INFO L273 TraceCheckUtils]: 68: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:27:03,109 INFO L273 TraceCheckUtils]: 69: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:27:03,110 INFO L273 TraceCheckUtils]: 70: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:27:03,110 INFO L273 TraceCheckUtils]: 71: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:27:03,110 INFO L273 TraceCheckUtils]: 72: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:27:03,110 INFO L273 TraceCheckUtils]: 73: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:27:03,110 INFO L273 TraceCheckUtils]: 74: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:27:03,110 INFO L273 TraceCheckUtils]: 75: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:27:03,111 INFO L273 TraceCheckUtils]: 76: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:27:03,111 INFO L273 TraceCheckUtils]: 77: Hoare triple {17953#true} assume !(~i~0 < 10000); {17953#true} is VALID [2018-11-23 12:27:03,111 INFO L273 TraceCheckUtils]: 78: Hoare triple {17953#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17953#true} is VALID [2018-11-23 12:27:03,111 INFO L273 TraceCheckUtils]: 79: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:27:03,111 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {17953#true} {17954#false} #70#return; {17954#false} is VALID [2018-11-23 12:27:03,111 INFO L273 TraceCheckUtils]: 81: Hoare triple {17954#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {17954#false} is VALID [2018-11-23 12:27:03,111 INFO L256 TraceCheckUtils]: 82: Hoare triple {17954#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {17953#true} is VALID [2018-11-23 12:27:03,112 INFO L273 TraceCheckUtils]: 83: Hoare triple {17953#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17953#true} is VALID [2018-11-23 12:27:03,112 INFO L273 TraceCheckUtils]: 84: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:27:03,112 INFO L273 TraceCheckUtils]: 85: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:27:03,112 INFO L273 TraceCheckUtils]: 86: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:27:03,112 INFO L273 TraceCheckUtils]: 87: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:27:03,112 INFO L273 TraceCheckUtils]: 88: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:27:03,112 INFO L273 TraceCheckUtils]: 89: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:27:03,112 INFO L273 TraceCheckUtils]: 90: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:27:03,112 INFO L273 TraceCheckUtils]: 91: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:27:03,113 INFO L273 TraceCheckUtils]: 92: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:27:03,113 INFO L273 TraceCheckUtils]: 93: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:27:03,113 INFO L273 TraceCheckUtils]: 94: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:27:03,113 INFO L273 TraceCheckUtils]: 95: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:27:03,113 INFO L273 TraceCheckUtils]: 96: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:27:03,113 INFO L273 TraceCheckUtils]: 97: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:27:03,113 INFO L273 TraceCheckUtils]: 98: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:27:03,113 INFO L273 TraceCheckUtils]: 99: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:27:03,113 INFO L273 TraceCheckUtils]: 100: Hoare triple {17953#true} assume !(~i~0 < 10000); {17953#true} is VALID [2018-11-23 12:27:03,113 INFO L273 TraceCheckUtils]: 101: Hoare triple {17953#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17953#true} is VALID [2018-11-23 12:27:03,114 INFO L273 TraceCheckUtils]: 102: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:27:03,114 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {17953#true} {17954#false} #72#return; {17954#false} is VALID [2018-11-23 12:27:03,114 INFO L273 TraceCheckUtils]: 104: Hoare triple {17954#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {17954#false} is VALID [2018-11-23 12:27:03,114 INFO L273 TraceCheckUtils]: 105: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17954#false} is VALID [2018-11-23 12:27:03,114 INFO L273 TraceCheckUtils]: 106: Hoare triple {17954#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17954#false} is VALID [2018-11-23 12:27:03,114 INFO L273 TraceCheckUtils]: 107: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17954#false} is VALID [2018-11-23 12:27:03,114 INFO L273 TraceCheckUtils]: 108: Hoare triple {17954#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17954#false} is VALID [2018-11-23 12:27:03,114 INFO L273 TraceCheckUtils]: 109: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17954#false} is VALID [2018-11-23 12:27:03,114 INFO L273 TraceCheckUtils]: 110: Hoare triple {17954#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17954#false} is VALID [2018-11-23 12:27:03,114 INFO L273 TraceCheckUtils]: 111: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17954#false} is VALID [2018-11-23 12:27:03,115 INFO L273 TraceCheckUtils]: 112: Hoare triple {17954#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17954#false} is VALID [2018-11-23 12:27:03,115 INFO L273 TraceCheckUtils]: 113: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17954#false} is VALID [2018-11-23 12:27:03,115 INFO L273 TraceCheckUtils]: 114: Hoare triple {17954#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17954#false} is VALID [2018-11-23 12:27:03,115 INFO L273 TraceCheckUtils]: 115: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17954#false} is VALID [2018-11-23 12:27:03,115 INFO L273 TraceCheckUtils]: 116: Hoare triple {17954#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17954#false} is VALID [2018-11-23 12:27:03,115 INFO L273 TraceCheckUtils]: 117: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17954#false} is VALID [2018-11-23 12:27:03,115 INFO L273 TraceCheckUtils]: 118: Hoare triple {17954#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17954#false} is VALID [2018-11-23 12:27:03,115 INFO L273 TraceCheckUtils]: 119: Hoare triple {17954#false} assume !(~i~2 < 9999); {17954#false} is VALID [2018-11-23 12:27:03,115 INFO L273 TraceCheckUtils]: 120: Hoare triple {17954#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {17954#false} is VALID [2018-11-23 12:27:03,116 INFO L256 TraceCheckUtils]: 121: Hoare triple {17954#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {17953#true} is VALID [2018-11-23 12:27:03,116 INFO L273 TraceCheckUtils]: 122: Hoare triple {17953#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17953#true} is VALID [2018-11-23 12:27:03,116 INFO L273 TraceCheckUtils]: 123: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:27:03,116 INFO L273 TraceCheckUtils]: 124: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:27:03,116 INFO L273 TraceCheckUtils]: 125: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:27:03,116 INFO L273 TraceCheckUtils]: 126: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:27:03,116 INFO L273 TraceCheckUtils]: 127: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:27:03,116 INFO L273 TraceCheckUtils]: 128: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:27:03,116 INFO L273 TraceCheckUtils]: 129: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:27:03,116 INFO L273 TraceCheckUtils]: 130: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:27:03,117 INFO L273 TraceCheckUtils]: 131: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:27:03,117 INFO L273 TraceCheckUtils]: 132: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:27:03,117 INFO L273 TraceCheckUtils]: 133: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:27:03,117 INFO L273 TraceCheckUtils]: 134: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:27:03,117 INFO L273 TraceCheckUtils]: 135: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:27:03,117 INFO L273 TraceCheckUtils]: 136: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:27:03,117 INFO L273 TraceCheckUtils]: 137: Hoare triple {17953#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:27:03,117 INFO L273 TraceCheckUtils]: 138: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:27:03,117 INFO L273 TraceCheckUtils]: 139: Hoare triple {17953#true} assume !(~i~0 < 10000); {17953#true} is VALID [2018-11-23 12:27:03,117 INFO L273 TraceCheckUtils]: 140: Hoare triple {17953#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17953#true} is VALID [2018-11-23 12:27:03,118 INFO L273 TraceCheckUtils]: 141: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:27:03,118 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {17953#true} {17954#false} #74#return; {17954#false} is VALID [2018-11-23 12:27:03,118 INFO L273 TraceCheckUtils]: 143: Hoare triple {17954#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {17954#false} is VALID [2018-11-23 12:27:03,118 INFO L273 TraceCheckUtils]: 144: Hoare triple {17954#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {17954#false} is VALID [2018-11-23 12:27:03,118 INFO L273 TraceCheckUtils]: 145: Hoare triple {17954#false} assume !false; {17954#false} is VALID [2018-11-23 12:27:03,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-11-23 12:27:03,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:03,128 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:03,143 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:27:03,229 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:27:03,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:03,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:03,615 INFO L256 TraceCheckUtils]: 0: Hoare triple {17953#true} call ULTIMATE.init(); {17953#true} is VALID [2018-11-23 12:27:03,615 INFO L273 TraceCheckUtils]: 1: Hoare triple {17953#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17953#true} is VALID [2018-11-23 12:27:03,616 INFO L273 TraceCheckUtils]: 2: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:27:03,616 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17953#true} {17953#true} #66#return; {17953#true} is VALID [2018-11-23 12:27:03,616 INFO L256 TraceCheckUtils]: 4: Hoare triple {17953#true} call #t~ret13 := main(); {17953#true} is VALID [2018-11-23 12:27:03,617 INFO L273 TraceCheckUtils]: 5: Hoare triple {17953#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; {18000#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:03,618 INFO L273 TraceCheckUtils]: 6: Hoare triple {18000#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {18000#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:03,618 INFO L273 TraceCheckUtils]: 7: Hoare triple {18000#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17956#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:03,619 INFO L273 TraceCheckUtils]: 8: Hoare triple {17956#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17956#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:03,619 INFO L273 TraceCheckUtils]: 9: Hoare triple {17956#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17957#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:03,620 INFO L273 TraceCheckUtils]: 10: Hoare triple {17957#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17957#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:03,620 INFO L273 TraceCheckUtils]: 11: Hoare triple {17957#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17958#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:03,621 INFO L273 TraceCheckUtils]: 12: Hoare triple {17958#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17958#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:03,622 INFO L273 TraceCheckUtils]: 13: Hoare triple {17958#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17959#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:03,622 INFO L273 TraceCheckUtils]: 14: Hoare triple {17959#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17959#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:03,623 INFO L273 TraceCheckUtils]: 15: Hoare triple {17959#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17960#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:03,624 INFO L273 TraceCheckUtils]: 16: Hoare triple {17960#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17960#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:03,625 INFO L273 TraceCheckUtils]: 17: Hoare triple {17960#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17961#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:03,625 INFO L273 TraceCheckUtils]: 18: Hoare triple {17961#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17961#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:03,626 INFO L273 TraceCheckUtils]: 19: Hoare triple {17961#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17962#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:03,627 INFO L273 TraceCheckUtils]: 20: Hoare triple {17962#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17962#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:03,628 INFO L273 TraceCheckUtils]: 21: Hoare triple {17962#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17963#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:03,628 INFO L273 TraceCheckUtils]: 22: Hoare triple {17963#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17963#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:03,629 INFO L273 TraceCheckUtils]: 23: Hoare triple {17963#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17964#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:03,630 INFO L273 TraceCheckUtils]: 24: Hoare triple {17964#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17964#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:03,631 INFO L273 TraceCheckUtils]: 25: Hoare triple {17964#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17965#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:03,632 INFO L273 TraceCheckUtils]: 26: Hoare triple {17965#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17965#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:03,632 INFO L273 TraceCheckUtils]: 27: Hoare triple {17965#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17966#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:03,633 INFO L273 TraceCheckUtils]: 28: Hoare triple {17966#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17966#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:03,634 INFO L273 TraceCheckUtils]: 29: Hoare triple {17966#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17967#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:03,635 INFO L273 TraceCheckUtils]: 30: Hoare triple {17967#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17967#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:03,635 INFO L273 TraceCheckUtils]: 31: Hoare triple {17967#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17968#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:03,636 INFO L273 TraceCheckUtils]: 32: Hoare triple {17968#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17968#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:03,637 INFO L273 TraceCheckUtils]: 33: Hoare triple {17968#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17969#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:03,638 INFO L273 TraceCheckUtils]: 34: Hoare triple {17969#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17969#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:03,639 INFO L273 TraceCheckUtils]: 35: Hoare triple {17969#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17970#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:03,639 INFO L273 TraceCheckUtils]: 36: Hoare triple {17970#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17970#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:03,640 INFO L273 TraceCheckUtils]: 37: Hoare triple {17970#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17971#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:03,641 INFO L273 TraceCheckUtils]: 38: Hoare triple {17971#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17971#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:03,642 INFO L273 TraceCheckUtils]: 39: Hoare triple {17971#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17972#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:03,642 INFO L273 TraceCheckUtils]: 40: Hoare triple {17972#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17972#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:03,643 INFO L273 TraceCheckUtils]: 41: Hoare triple {17972#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17973#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:03,644 INFO L273 TraceCheckUtils]: 42: Hoare triple {17973#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17973#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:03,645 INFO L273 TraceCheckUtils]: 43: Hoare triple {17973#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17974#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:03,645 INFO L273 TraceCheckUtils]: 44: Hoare triple {17974#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17974#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:03,646 INFO L273 TraceCheckUtils]: 45: Hoare triple {17974#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17975#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:03,647 INFO L273 TraceCheckUtils]: 46: Hoare triple {17975#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17975#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:03,648 INFO L273 TraceCheckUtils]: 47: Hoare triple {17975#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17976#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:03,648 INFO L273 TraceCheckUtils]: 48: Hoare triple {17976#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17976#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:03,649 INFO L273 TraceCheckUtils]: 49: Hoare triple {17976#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17977#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:03,650 INFO L273 TraceCheckUtils]: 50: Hoare triple {17977#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17977#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:03,651 INFO L273 TraceCheckUtils]: 51: Hoare triple {17977#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17978#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:03,651 INFO L273 TraceCheckUtils]: 52: Hoare triple {17978#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17978#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:03,652 INFO L273 TraceCheckUtils]: 53: Hoare triple {17978#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17979#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:03,653 INFO L273 TraceCheckUtils]: 54: Hoare triple {17979#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17979#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:03,654 INFO L273 TraceCheckUtils]: 55: Hoare triple {17979#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17980#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:03,655 INFO L273 TraceCheckUtils]: 56: Hoare triple {17980#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {17980#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:03,655 INFO L273 TraceCheckUtils]: 57: Hoare triple {17980#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17981#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:03,656 INFO L273 TraceCheckUtils]: 58: Hoare triple {17981#(<= main_~i~1 26)} assume !(~i~1 < 10000); {17954#false} is VALID [2018-11-23 12:27:03,656 INFO L256 TraceCheckUtils]: 59: Hoare triple {17954#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {17954#false} is VALID [2018-11-23 12:27:03,657 INFO L273 TraceCheckUtils]: 60: Hoare triple {17954#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17954#false} is VALID [2018-11-23 12:27:03,657 INFO L273 TraceCheckUtils]: 61: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:27:03,657 INFO L273 TraceCheckUtils]: 62: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:27:03,657 INFO L273 TraceCheckUtils]: 63: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:27:03,657 INFO L273 TraceCheckUtils]: 64: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:27:03,658 INFO L273 TraceCheckUtils]: 65: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:27:03,658 INFO L273 TraceCheckUtils]: 66: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:27:03,658 INFO L273 TraceCheckUtils]: 67: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:27:03,658 INFO L273 TraceCheckUtils]: 68: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:27:03,658 INFO L273 TraceCheckUtils]: 69: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:27:03,658 INFO L273 TraceCheckUtils]: 70: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:27:03,659 INFO L273 TraceCheckUtils]: 71: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:27:03,659 INFO L273 TraceCheckUtils]: 72: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:27:03,659 INFO L273 TraceCheckUtils]: 73: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:27:03,659 INFO L273 TraceCheckUtils]: 74: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:27:03,659 INFO L273 TraceCheckUtils]: 75: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:27:03,660 INFO L273 TraceCheckUtils]: 76: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:27:03,660 INFO L273 TraceCheckUtils]: 77: Hoare triple {17954#false} assume !(~i~0 < 10000); {17954#false} is VALID [2018-11-23 12:27:03,660 INFO L273 TraceCheckUtils]: 78: Hoare triple {17954#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17954#false} is VALID [2018-11-23 12:27:03,660 INFO L273 TraceCheckUtils]: 79: Hoare triple {17954#false} assume true; {17954#false} is VALID [2018-11-23 12:27:03,660 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {17954#false} {17954#false} #70#return; {17954#false} is VALID [2018-11-23 12:27:03,660 INFO L273 TraceCheckUtils]: 81: Hoare triple {17954#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {17954#false} is VALID [2018-11-23 12:27:03,660 INFO L256 TraceCheckUtils]: 82: Hoare triple {17954#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {17954#false} is VALID [2018-11-23 12:27:03,661 INFO L273 TraceCheckUtils]: 83: Hoare triple {17954#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17954#false} is VALID [2018-11-23 12:27:03,661 INFO L273 TraceCheckUtils]: 84: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:27:03,661 INFO L273 TraceCheckUtils]: 85: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:27:03,661 INFO L273 TraceCheckUtils]: 86: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:27:03,661 INFO L273 TraceCheckUtils]: 87: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:27:03,661 INFO L273 TraceCheckUtils]: 88: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:27:03,661 INFO L273 TraceCheckUtils]: 89: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:27:03,661 INFO L273 TraceCheckUtils]: 90: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:27:03,661 INFO L273 TraceCheckUtils]: 91: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:27:03,661 INFO L273 TraceCheckUtils]: 92: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:27:03,662 INFO L273 TraceCheckUtils]: 93: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:27:03,662 INFO L273 TraceCheckUtils]: 94: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:27:03,662 INFO L273 TraceCheckUtils]: 95: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:27:03,662 INFO L273 TraceCheckUtils]: 96: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:27:03,662 INFO L273 TraceCheckUtils]: 97: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:27:03,662 INFO L273 TraceCheckUtils]: 98: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:27:03,662 INFO L273 TraceCheckUtils]: 99: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:27:03,662 INFO L273 TraceCheckUtils]: 100: Hoare triple {17954#false} assume !(~i~0 < 10000); {17954#false} is VALID [2018-11-23 12:27:03,662 INFO L273 TraceCheckUtils]: 101: Hoare triple {17954#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17954#false} is VALID [2018-11-23 12:27:03,662 INFO L273 TraceCheckUtils]: 102: Hoare triple {17954#false} assume true; {17954#false} is VALID [2018-11-23 12:27:03,663 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {17954#false} {17954#false} #72#return; {17954#false} is VALID [2018-11-23 12:27:03,663 INFO L273 TraceCheckUtils]: 104: Hoare triple {17954#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {17954#false} is VALID [2018-11-23 12:27:03,663 INFO L273 TraceCheckUtils]: 105: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17954#false} is VALID [2018-11-23 12:27:03,663 INFO L273 TraceCheckUtils]: 106: Hoare triple {17954#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17954#false} is VALID [2018-11-23 12:27:03,663 INFO L273 TraceCheckUtils]: 107: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17954#false} is VALID [2018-11-23 12:27:03,663 INFO L273 TraceCheckUtils]: 108: Hoare triple {17954#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17954#false} is VALID [2018-11-23 12:27:03,663 INFO L273 TraceCheckUtils]: 109: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17954#false} is VALID [2018-11-23 12:27:03,663 INFO L273 TraceCheckUtils]: 110: Hoare triple {17954#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17954#false} is VALID [2018-11-23 12:27:03,663 INFO L273 TraceCheckUtils]: 111: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17954#false} is VALID [2018-11-23 12:27:03,664 INFO L273 TraceCheckUtils]: 112: Hoare triple {17954#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17954#false} is VALID [2018-11-23 12:27:03,664 INFO L273 TraceCheckUtils]: 113: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17954#false} is VALID [2018-11-23 12:27:03,664 INFO L273 TraceCheckUtils]: 114: Hoare triple {17954#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17954#false} is VALID [2018-11-23 12:27:03,664 INFO L273 TraceCheckUtils]: 115: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17954#false} is VALID [2018-11-23 12:27:03,664 INFO L273 TraceCheckUtils]: 116: Hoare triple {17954#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17954#false} is VALID [2018-11-23 12:27:03,664 INFO L273 TraceCheckUtils]: 117: Hoare triple {17954#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17954#false} is VALID [2018-11-23 12:27:03,664 INFO L273 TraceCheckUtils]: 118: Hoare triple {17954#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17954#false} is VALID [2018-11-23 12:27:03,664 INFO L273 TraceCheckUtils]: 119: Hoare triple {17954#false} assume !(~i~2 < 9999); {17954#false} is VALID [2018-11-23 12:27:03,664 INFO L273 TraceCheckUtils]: 120: Hoare triple {17954#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {17954#false} is VALID [2018-11-23 12:27:03,665 INFO L256 TraceCheckUtils]: 121: Hoare triple {17954#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {17954#false} is VALID [2018-11-23 12:27:03,665 INFO L273 TraceCheckUtils]: 122: Hoare triple {17954#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17954#false} is VALID [2018-11-23 12:27:03,665 INFO L273 TraceCheckUtils]: 123: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:27:03,665 INFO L273 TraceCheckUtils]: 124: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:27:03,665 INFO L273 TraceCheckUtils]: 125: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:27:03,665 INFO L273 TraceCheckUtils]: 126: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:27:03,665 INFO L273 TraceCheckUtils]: 127: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:27:03,665 INFO L273 TraceCheckUtils]: 128: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:27:03,665 INFO L273 TraceCheckUtils]: 129: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:27:03,665 INFO L273 TraceCheckUtils]: 130: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:27:03,666 INFO L273 TraceCheckUtils]: 131: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:27:03,666 INFO L273 TraceCheckUtils]: 132: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:27:03,666 INFO L273 TraceCheckUtils]: 133: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:27:03,666 INFO L273 TraceCheckUtils]: 134: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:27:03,666 INFO L273 TraceCheckUtils]: 135: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:27:03,666 INFO L273 TraceCheckUtils]: 136: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:27:03,666 INFO L273 TraceCheckUtils]: 137: Hoare triple {17954#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:27:03,666 INFO L273 TraceCheckUtils]: 138: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:27:03,666 INFO L273 TraceCheckUtils]: 139: Hoare triple {17954#false} assume !(~i~0 < 10000); {17954#false} is VALID [2018-11-23 12:27:03,667 INFO L273 TraceCheckUtils]: 140: Hoare triple {17954#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17954#false} is VALID [2018-11-23 12:27:03,667 INFO L273 TraceCheckUtils]: 141: Hoare triple {17954#false} assume true; {17954#false} is VALID [2018-11-23 12:27:03,667 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {17954#false} {17954#false} #74#return; {17954#false} is VALID [2018-11-23 12:27:03,667 INFO L273 TraceCheckUtils]: 143: Hoare triple {17954#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {17954#false} is VALID [2018-11-23 12:27:03,667 INFO L273 TraceCheckUtils]: 144: Hoare triple {17954#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {17954#false} is VALID [2018-11-23 12:27:03,667 INFO L273 TraceCheckUtils]: 145: Hoare triple {17954#false} assume !false; {17954#false} is VALID [2018-11-23 12:27:03,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-11-23 12:27:03,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:03,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 12:27:03,697 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2018-11-23 12:27:03,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:03,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:27:03,827 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:03,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:27:03,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:27:03,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:27:03,829 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 30 states. [2018-11-23 12:27:04,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:04,874 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2018-11-23 12:27:04,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:27:04,875 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2018-11-23 12:27:04,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:04,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:27:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 106 transitions. [2018-11-23 12:27:04,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:27:04,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 106 transitions. [2018-11-23 12:27:04,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 106 transitions. [2018-11-23 12:27:05,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:05,060 INFO L225 Difference]: With dead ends: 154 [2018-11-23 12:27:05,061 INFO L226 Difference]: Without dead ends: 108 [2018-11-23 12:27:05,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:27:05,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-23 12:27:05,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-11-23 12:27:05,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:05,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 107 states. [2018-11-23 12:27:05,128 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 107 states. [2018-11-23 12:27:05,128 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 107 states. [2018-11-23 12:27:05,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:05,130 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-23 12:27:05,130 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 12:27:05,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:05,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:05,131 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 108 states. [2018-11-23 12:27:05,131 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 108 states. [2018-11-23 12:27:05,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:05,133 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-23 12:27:05,133 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 12:27:05,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:05,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:05,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:05,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:05,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 12:27:05,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-11-23 12:27:05,135 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 146 [2018-11-23 12:27:05,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:05,135 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-11-23 12:27:05,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:27:05,136 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-11-23 12:27:05,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-23 12:27:05,137 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:05,137 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 24, 24, 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-23 12:27:05,137 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:05,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:05,137 INFO L82 PathProgramCache]: Analyzing trace with hash 835998787, now seen corresponding path program 27 times [2018-11-23 12:27:05,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:05,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:05,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:05,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:05,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:06,025 INFO L256 TraceCheckUtils]: 0: Hoare triple {19024#true} call ULTIMATE.init(); {19024#true} is VALID [2018-11-23 12:27:06,025 INFO L273 TraceCheckUtils]: 1: Hoare triple {19024#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19024#true} is VALID [2018-11-23 12:27:06,025 INFO L273 TraceCheckUtils]: 2: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:27:06,026 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19024#true} {19024#true} #66#return; {19024#true} is VALID [2018-11-23 12:27:06,026 INFO L256 TraceCheckUtils]: 4: Hoare triple {19024#true} call #t~ret13 := main(); {19024#true} is VALID [2018-11-23 12:27:06,026 INFO L273 TraceCheckUtils]: 5: Hoare triple {19024#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; {19026#(= main_~i~1 0)} is VALID [2018-11-23 12:27:06,027 INFO L273 TraceCheckUtils]: 6: Hoare triple {19026#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {19026#(= main_~i~1 0)} is VALID [2018-11-23 12:27:06,028 INFO L273 TraceCheckUtils]: 7: Hoare triple {19026#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19027#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:06,029 INFO L273 TraceCheckUtils]: 8: Hoare triple {19027#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {19027#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:06,030 INFO L273 TraceCheckUtils]: 9: Hoare triple {19027#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19028#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:06,030 INFO L273 TraceCheckUtils]: 10: Hoare triple {19028#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {19028#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:06,031 INFO L273 TraceCheckUtils]: 11: Hoare triple {19028#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19029#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:06,032 INFO L273 TraceCheckUtils]: 12: Hoare triple {19029#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {19029#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:06,033 INFO L273 TraceCheckUtils]: 13: Hoare triple {19029#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19030#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:06,033 INFO L273 TraceCheckUtils]: 14: Hoare triple {19030#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {19030#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:06,034 INFO L273 TraceCheckUtils]: 15: Hoare triple {19030#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19031#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:06,035 INFO L273 TraceCheckUtils]: 16: Hoare triple {19031#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {19031#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:06,036 INFO L273 TraceCheckUtils]: 17: Hoare triple {19031#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19032#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:06,036 INFO L273 TraceCheckUtils]: 18: Hoare triple {19032#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {19032#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:06,037 INFO L273 TraceCheckUtils]: 19: Hoare triple {19032#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19033#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:06,038 INFO L273 TraceCheckUtils]: 20: Hoare triple {19033#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {19033#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:06,039 INFO L273 TraceCheckUtils]: 21: Hoare triple {19033#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19034#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:06,039 INFO L273 TraceCheckUtils]: 22: Hoare triple {19034#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {19034#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:06,040 INFO L273 TraceCheckUtils]: 23: Hoare triple {19034#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19035#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:06,041 INFO L273 TraceCheckUtils]: 24: Hoare triple {19035#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {19035#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:06,042 INFO L273 TraceCheckUtils]: 25: Hoare triple {19035#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19036#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:06,043 INFO L273 TraceCheckUtils]: 26: Hoare triple {19036#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {19036#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:06,043 INFO L273 TraceCheckUtils]: 27: Hoare triple {19036#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19037#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:06,044 INFO L273 TraceCheckUtils]: 28: Hoare triple {19037#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {19037#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:06,045 INFO L273 TraceCheckUtils]: 29: Hoare triple {19037#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19038#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:06,046 INFO L273 TraceCheckUtils]: 30: Hoare triple {19038#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {19038#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:06,046 INFO L273 TraceCheckUtils]: 31: Hoare triple {19038#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19039#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:06,047 INFO L273 TraceCheckUtils]: 32: Hoare triple {19039#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {19039#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:06,048 INFO L273 TraceCheckUtils]: 33: Hoare triple {19039#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19040#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:06,049 INFO L273 TraceCheckUtils]: 34: Hoare triple {19040#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {19040#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:06,050 INFO L273 TraceCheckUtils]: 35: Hoare triple {19040#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19041#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:06,050 INFO L273 TraceCheckUtils]: 36: Hoare triple {19041#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {19041#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:06,051 INFO L273 TraceCheckUtils]: 37: Hoare triple {19041#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19042#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:06,052 INFO L273 TraceCheckUtils]: 38: Hoare triple {19042#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {19042#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:06,053 INFO L273 TraceCheckUtils]: 39: Hoare triple {19042#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19043#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:06,053 INFO L273 TraceCheckUtils]: 40: Hoare triple {19043#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {19043#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:06,054 INFO L273 TraceCheckUtils]: 41: Hoare triple {19043#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19044#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:06,055 INFO L273 TraceCheckUtils]: 42: Hoare triple {19044#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {19044#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:06,056 INFO L273 TraceCheckUtils]: 43: Hoare triple {19044#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19045#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:06,056 INFO L273 TraceCheckUtils]: 44: Hoare triple {19045#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {19045#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:06,057 INFO L273 TraceCheckUtils]: 45: Hoare triple {19045#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19046#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:06,058 INFO L273 TraceCheckUtils]: 46: Hoare triple {19046#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {19046#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:06,059 INFO L273 TraceCheckUtils]: 47: Hoare triple {19046#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19047#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:06,059 INFO L273 TraceCheckUtils]: 48: Hoare triple {19047#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {19047#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:06,060 INFO L273 TraceCheckUtils]: 49: Hoare triple {19047#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19048#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:06,061 INFO L273 TraceCheckUtils]: 50: Hoare triple {19048#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {19048#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:06,062 INFO L273 TraceCheckUtils]: 51: Hoare triple {19048#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19049#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:06,063 INFO L273 TraceCheckUtils]: 52: Hoare triple {19049#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {19049#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:06,063 INFO L273 TraceCheckUtils]: 53: Hoare triple {19049#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19050#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:06,064 INFO L273 TraceCheckUtils]: 54: Hoare triple {19050#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {19050#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:06,065 INFO L273 TraceCheckUtils]: 55: Hoare triple {19050#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19051#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:06,066 INFO L273 TraceCheckUtils]: 56: Hoare triple {19051#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {19051#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:06,067 INFO L273 TraceCheckUtils]: 57: Hoare triple {19051#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19052#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:06,067 INFO L273 TraceCheckUtils]: 58: Hoare triple {19052#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {19052#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:06,068 INFO L273 TraceCheckUtils]: 59: Hoare triple {19052#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19053#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:06,069 INFO L273 TraceCheckUtils]: 60: Hoare triple {19053#(<= main_~i~1 27)} assume !(~i~1 < 10000); {19025#false} is VALID [2018-11-23 12:27:06,069 INFO L256 TraceCheckUtils]: 61: Hoare triple {19025#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {19024#true} is VALID [2018-11-23 12:27:06,069 INFO L273 TraceCheckUtils]: 62: Hoare triple {19024#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19024#true} is VALID [2018-11-23 12:27:06,070 INFO L273 TraceCheckUtils]: 63: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,070 INFO L273 TraceCheckUtils]: 64: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,070 INFO L273 TraceCheckUtils]: 65: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,070 INFO L273 TraceCheckUtils]: 66: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,070 INFO L273 TraceCheckUtils]: 67: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,070 INFO L273 TraceCheckUtils]: 68: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,071 INFO L273 TraceCheckUtils]: 69: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,071 INFO L273 TraceCheckUtils]: 70: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,071 INFO L273 TraceCheckUtils]: 71: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,071 INFO L273 TraceCheckUtils]: 72: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,071 INFO L273 TraceCheckUtils]: 73: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,072 INFO L273 TraceCheckUtils]: 74: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,072 INFO L273 TraceCheckUtils]: 75: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,072 INFO L273 TraceCheckUtils]: 76: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,072 INFO L273 TraceCheckUtils]: 77: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,072 INFO L273 TraceCheckUtils]: 78: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,072 INFO L273 TraceCheckUtils]: 79: Hoare triple {19024#true} assume !(~i~0 < 10000); {19024#true} is VALID [2018-11-23 12:27:06,072 INFO L273 TraceCheckUtils]: 80: Hoare triple {19024#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19024#true} is VALID [2018-11-23 12:27:06,072 INFO L273 TraceCheckUtils]: 81: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:27:06,072 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {19024#true} {19025#false} #70#return; {19025#false} is VALID [2018-11-23 12:27:06,073 INFO L273 TraceCheckUtils]: 83: Hoare triple {19025#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {19025#false} is VALID [2018-11-23 12:27:06,073 INFO L256 TraceCheckUtils]: 84: Hoare triple {19025#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {19024#true} is VALID [2018-11-23 12:27:06,073 INFO L273 TraceCheckUtils]: 85: Hoare triple {19024#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19024#true} is VALID [2018-11-23 12:27:06,073 INFO L273 TraceCheckUtils]: 86: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,073 INFO L273 TraceCheckUtils]: 87: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,073 INFO L273 TraceCheckUtils]: 88: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,073 INFO L273 TraceCheckUtils]: 89: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,073 INFO L273 TraceCheckUtils]: 90: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,073 INFO L273 TraceCheckUtils]: 91: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,073 INFO L273 TraceCheckUtils]: 92: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,074 INFO L273 TraceCheckUtils]: 93: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,074 INFO L273 TraceCheckUtils]: 94: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,074 INFO L273 TraceCheckUtils]: 95: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,074 INFO L273 TraceCheckUtils]: 96: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,074 INFO L273 TraceCheckUtils]: 97: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,074 INFO L273 TraceCheckUtils]: 98: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,074 INFO L273 TraceCheckUtils]: 99: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,074 INFO L273 TraceCheckUtils]: 100: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,074 INFO L273 TraceCheckUtils]: 101: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,075 INFO L273 TraceCheckUtils]: 102: Hoare triple {19024#true} assume !(~i~0 < 10000); {19024#true} is VALID [2018-11-23 12:27:06,075 INFO L273 TraceCheckUtils]: 103: Hoare triple {19024#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19024#true} is VALID [2018-11-23 12:27:06,075 INFO L273 TraceCheckUtils]: 104: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:27:06,075 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {19024#true} {19025#false} #72#return; {19025#false} is VALID [2018-11-23 12:27:06,075 INFO L273 TraceCheckUtils]: 106: Hoare triple {19025#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {19025#false} is VALID [2018-11-23 12:27:06,075 INFO L273 TraceCheckUtils]: 107: Hoare triple {19025#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19025#false} is VALID [2018-11-23 12:27:06,075 INFO L273 TraceCheckUtils]: 108: Hoare triple {19025#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19025#false} is VALID [2018-11-23 12:27:06,075 INFO L273 TraceCheckUtils]: 109: Hoare triple {19025#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19025#false} is VALID [2018-11-23 12:27:06,075 INFO L273 TraceCheckUtils]: 110: Hoare triple {19025#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19025#false} is VALID [2018-11-23 12:27:06,075 INFO L273 TraceCheckUtils]: 111: Hoare triple {19025#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19025#false} is VALID [2018-11-23 12:27:06,076 INFO L273 TraceCheckUtils]: 112: Hoare triple {19025#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19025#false} is VALID [2018-11-23 12:27:06,076 INFO L273 TraceCheckUtils]: 113: Hoare triple {19025#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19025#false} is VALID [2018-11-23 12:27:06,076 INFO L273 TraceCheckUtils]: 114: Hoare triple {19025#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19025#false} is VALID [2018-11-23 12:27:06,076 INFO L273 TraceCheckUtils]: 115: Hoare triple {19025#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19025#false} is VALID [2018-11-23 12:27:06,076 INFO L273 TraceCheckUtils]: 116: Hoare triple {19025#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19025#false} is VALID [2018-11-23 12:27:06,076 INFO L273 TraceCheckUtils]: 117: Hoare triple {19025#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19025#false} is VALID [2018-11-23 12:27:06,076 INFO L273 TraceCheckUtils]: 118: Hoare triple {19025#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19025#false} is VALID [2018-11-23 12:27:06,076 INFO L273 TraceCheckUtils]: 119: Hoare triple {19025#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19025#false} is VALID [2018-11-23 12:27:06,076 INFO L273 TraceCheckUtils]: 120: Hoare triple {19025#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19025#false} is VALID [2018-11-23 12:27:06,077 INFO L273 TraceCheckUtils]: 121: Hoare triple {19025#false} assume !(~i~2 < 9999); {19025#false} is VALID [2018-11-23 12:27:06,077 INFO L273 TraceCheckUtils]: 122: Hoare triple {19025#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {19025#false} is VALID [2018-11-23 12:27:06,077 INFO L256 TraceCheckUtils]: 123: Hoare triple {19025#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {19024#true} is VALID [2018-11-23 12:27:06,077 INFO L273 TraceCheckUtils]: 124: Hoare triple {19024#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19024#true} is VALID [2018-11-23 12:27:06,077 INFO L273 TraceCheckUtils]: 125: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,077 INFO L273 TraceCheckUtils]: 126: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,077 INFO L273 TraceCheckUtils]: 127: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,077 INFO L273 TraceCheckUtils]: 128: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,077 INFO L273 TraceCheckUtils]: 129: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,077 INFO L273 TraceCheckUtils]: 130: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,078 INFO L273 TraceCheckUtils]: 131: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,078 INFO L273 TraceCheckUtils]: 132: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,078 INFO L273 TraceCheckUtils]: 133: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,078 INFO L273 TraceCheckUtils]: 134: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,078 INFO L273 TraceCheckUtils]: 135: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,078 INFO L273 TraceCheckUtils]: 136: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,078 INFO L273 TraceCheckUtils]: 137: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,078 INFO L273 TraceCheckUtils]: 138: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,078 INFO L273 TraceCheckUtils]: 139: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,079 INFO L273 TraceCheckUtils]: 140: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,079 INFO L273 TraceCheckUtils]: 141: Hoare triple {19024#true} assume !(~i~0 < 10000); {19024#true} is VALID [2018-11-23 12:27:06,079 INFO L273 TraceCheckUtils]: 142: Hoare triple {19024#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19024#true} is VALID [2018-11-23 12:27:06,079 INFO L273 TraceCheckUtils]: 143: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:27:06,079 INFO L268 TraceCheckUtils]: 144: Hoare quadruple {19024#true} {19025#false} #74#return; {19025#false} is VALID [2018-11-23 12:27:06,079 INFO L273 TraceCheckUtils]: 145: Hoare triple {19025#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {19025#false} is VALID [2018-11-23 12:27:06,079 INFO L273 TraceCheckUtils]: 146: Hoare triple {19025#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {19025#false} is VALID [2018-11-23 12:27:06,079 INFO L273 TraceCheckUtils]: 147: Hoare triple {19025#false} assume !false; {19025#false} is VALID [2018-11-23 12:27:06,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-11-23 12:27:06,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:06,090 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:06,100 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:27:06,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:27:06,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:06,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:06,844 INFO L256 TraceCheckUtils]: 0: Hoare triple {19024#true} call ULTIMATE.init(); {19024#true} is VALID [2018-11-23 12:27:06,844 INFO L273 TraceCheckUtils]: 1: Hoare triple {19024#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19024#true} is VALID [2018-11-23 12:27:06,844 INFO L273 TraceCheckUtils]: 2: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:27:06,845 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19024#true} {19024#true} #66#return; {19024#true} is VALID [2018-11-23 12:27:06,845 INFO L256 TraceCheckUtils]: 4: Hoare triple {19024#true} call #t~ret13 := main(); {19024#true} is VALID [2018-11-23 12:27:06,845 INFO L273 TraceCheckUtils]: 5: Hoare triple {19024#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; {19024#true} is VALID [2018-11-23 12:27:06,845 INFO L273 TraceCheckUtils]: 6: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:27:06,845 INFO L273 TraceCheckUtils]: 7: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:27:06,846 INFO L273 TraceCheckUtils]: 8: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:27:06,846 INFO L273 TraceCheckUtils]: 9: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:27:06,846 INFO L273 TraceCheckUtils]: 10: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:27:06,846 INFO L273 TraceCheckUtils]: 11: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:27:06,846 INFO L273 TraceCheckUtils]: 12: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:27:06,846 INFO L273 TraceCheckUtils]: 13: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:27:06,847 INFO L273 TraceCheckUtils]: 14: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:27:06,847 INFO L273 TraceCheckUtils]: 15: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:27:06,847 INFO L273 TraceCheckUtils]: 16: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:27:06,847 INFO L273 TraceCheckUtils]: 17: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:27:06,847 INFO L273 TraceCheckUtils]: 18: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:27:06,847 INFO L273 TraceCheckUtils]: 19: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:27:06,847 INFO L273 TraceCheckUtils]: 20: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:27:06,848 INFO L273 TraceCheckUtils]: 21: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:27:06,848 INFO L273 TraceCheckUtils]: 22: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:27:06,848 INFO L273 TraceCheckUtils]: 23: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:27:06,848 INFO L273 TraceCheckUtils]: 24: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:27:06,848 INFO L273 TraceCheckUtils]: 25: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:27:06,848 INFO L273 TraceCheckUtils]: 26: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:27:06,848 INFO L273 TraceCheckUtils]: 27: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:27:06,848 INFO L273 TraceCheckUtils]: 28: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:27:06,848 INFO L273 TraceCheckUtils]: 29: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:27:06,849 INFO L273 TraceCheckUtils]: 30: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:27:06,849 INFO L273 TraceCheckUtils]: 31: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:27:06,849 INFO L273 TraceCheckUtils]: 32: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:27:06,849 INFO L273 TraceCheckUtils]: 33: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:27:06,849 INFO L273 TraceCheckUtils]: 34: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:27:06,849 INFO L273 TraceCheckUtils]: 35: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:27:06,849 INFO L273 TraceCheckUtils]: 36: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:27:06,849 INFO L273 TraceCheckUtils]: 37: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:27:06,849 INFO L273 TraceCheckUtils]: 38: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:27:06,849 INFO L273 TraceCheckUtils]: 39: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:27:06,850 INFO L273 TraceCheckUtils]: 40: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:27:06,850 INFO L273 TraceCheckUtils]: 41: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:27:06,850 INFO L273 TraceCheckUtils]: 42: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:27:06,850 INFO L273 TraceCheckUtils]: 43: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:27:06,850 INFO L273 TraceCheckUtils]: 44: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:27:06,850 INFO L273 TraceCheckUtils]: 45: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:27:06,850 INFO L273 TraceCheckUtils]: 46: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:27:06,850 INFO L273 TraceCheckUtils]: 47: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:27:06,850 INFO L273 TraceCheckUtils]: 48: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:27:06,851 INFO L273 TraceCheckUtils]: 49: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:27:06,851 INFO L273 TraceCheckUtils]: 50: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:27:06,851 INFO L273 TraceCheckUtils]: 51: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:27:06,851 INFO L273 TraceCheckUtils]: 52: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:27:06,851 INFO L273 TraceCheckUtils]: 53: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:27:06,851 INFO L273 TraceCheckUtils]: 54: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:27:06,851 INFO L273 TraceCheckUtils]: 55: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:27:06,851 INFO L273 TraceCheckUtils]: 56: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:27:06,851 INFO L273 TraceCheckUtils]: 57: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:27:06,851 INFO L273 TraceCheckUtils]: 58: Hoare triple {19024#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:27:06,852 INFO L273 TraceCheckUtils]: 59: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:27:06,852 INFO L273 TraceCheckUtils]: 60: Hoare triple {19024#true} assume !(~i~1 < 10000); {19024#true} is VALID [2018-11-23 12:27:06,852 INFO L256 TraceCheckUtils]: 61: Hoare triple {19024#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {19024#true} is VALID [2018-11-23 12:27:06,852 INFO L273 TraceCheckUtils]: 62: Hoare triple {19024#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19024#true} is VALID [2018-11-23 12:27:06,852 INFO L273 TraceCheckUtils]: 63: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,852 INFO L273 TraceCheckUtils]: 64: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,852 INFO L273 TraceCheckUtils]: 65: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,852 INFO L273 TraceCheckUtils]: 66: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,852 INFO L273 TraceCheckUtils]: 67: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,852 INFO L273 TraceCheckUtils]: 68: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,853 INFO L273 TraceCheckUtils]: 69: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,853 INFO L273 TraceCheckUtils]: 70: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,853 INFO L273 TraceCheckUtils]: 71: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,853 INFO L273 TraceCheckUtils]: 72: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,853 INFO L273 TraceCheckUtils]: 73: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,853 INFO L273 TraceCheckUtils]: 74: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,853 INFO L273 TraceCheckUtils]: 75: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,853 INFO L273 TraceCheckUtils]: 76: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,853 INFO L273 TraceCheckUtils]: 77: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,854 INFO L273 TraceCheckUtils]: 78: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,854 INFO L273 TraceCheckUtils]: 79: Hoare triple {19024#true} assume !(~i~0 < 10000); {19024#true} is VALID [2018-11-23 12:27:06,854 INFO L273 TraceCheckUtils]: 80: Hoare triple {19024#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19024#true} is VALID [2018-11-23 12:27:06,854 INFO L273 TraceCheckUtils]: 81: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:27:06,854 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {19024#true} {19024#true} #70#return; {19024#true} is VALID [2018-11-23 12:27:06,854 INFO L273 TraceCheckUtils]: 83: Hoare triple {19024#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {19024#true} is VALID [2018-11-23 12:27:06,854 INFO L256 TraceCheckUtils]: 84: Hoare triple {19024#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {19024#true} is VALID [2018-11-23 12:27:06,854 INFO L273 TraceCheckUtils]: 85: Hoare triple {19024#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19024#true} is VALID [2018-11-23 12:27:06,854 INFO L273 TraceCheckUtils]: 86: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,854 INFO L273 TraceCheckUtils]: 87: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,855 INFO L273 TraceCheckUtils]: 88: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,855 INFO L273 TraceCheckUtils]: 89: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,855 INFO L273 TraceCheckUtils]: 90: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,855 INFO L273 TraceCheckUtils]: 91: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,855 INFO L273 TraceCheckUtils]: 92: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,855 INFO L273 TraceCheckUtils]: 93: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,855 INFO L273 TraceCheckUtils]: 94: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,855 INFO L273 TraceCheckUtils]: 95: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,855 INFO L273 TraceCheckUtils]: 96: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,856 INFO L273 TraceCheckUtils]: 97: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,856 INFO L273 TraceCheckUtils]: 98: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,856 INFO L273 TraceCheckUtils]: 99: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,856 INFO L273 TraceCheckUtils]: 100: Hoare triple {19024#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:27:06,856 INFO L273 TraceCheckUtils]: 101: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:27:06,856 INFO L273 TraceCheckUtils]: 102: Hoare triple {19024#true} assume !(~i~0 < 10000); {19024#true} is VALID [2018-11-23 12:27:06,856 INFO L273 TraceCheckUtils]: 103: Hoare triple {19024#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19024#true} is VALID [2018-11-23 12:27:06,856 INFO L273 TraceCheckUtils]: 104: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:27:06,856 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {19024#true} {19024#true} #72#return; {19024#true} is VALID [2018-11-23 12:27:06,857 INFO L273 TraceCheckUtils]: 106: Hoare triple {19024#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {19375#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:06,857 INFO L273 TraceCheckUtils]: 107: Hoare triple {19375#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19375#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:06,858 INFO L273 TraceCheckUtils]: 108: Hoare triple {19375#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19382#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:06,858 INFO L273 TraceCheckUtils]: 109: Hoare triple {19382#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19382#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:06,859 INFO L273 TraceCheckUtils]: 110: Hoare triple {19382#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19389#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:06,859 INFO L273 TraceCheckUtils]: 111: Hoare triple {19389#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19389#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:06,860 INFO L273 TraceCheckUtils]: 112: Hoare triple {19389#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19396#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:06,860 INFO L273 TraceCheckUtils]: 113: Hoare triple {19396#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19396#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:06,861 INFO L273 TraceCheckUtils]: 114: Hoare triple {19396#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19403#(<= main_~i~2 4)} is VALID [2018-11-23 12:27:06,862 INFO L273 TraceCheckUtils]: 115: Hoare triple {19403#(<= main_~i~2 4)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19403#(<= main_~i~2 4)} is VALID [2018-11-23 12:27:06,863 INFO L273 TraceCheckUtils]: 116: Hoare triple {19403#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19410#(<= main_~i~2 5)} is VALID [2018-11-23 12:27:06,863 INFO L273 TraceCheckUtils]: 117: Hoare triple {19410#(<= main_~i~2 5)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19410#(<= main_~i~2 5)} is VALID [2018-11-23 12:27:06,864 INFO L273 TraceCheckUtils]: 118: Hoare triple {19410#(<= main_~i~2 5)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19417#(<= main_~i~2 6)} is VALID [2018-11-23 12:27:06,865 INFO L273 TraceCheckUtils]: 119: Hoare triple {19417#(<= main_~i~2 6)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19417#(<= main_~i~2 6)} is VALID [2018-11-23 12:27:06,866 INFO L273 TraceCheckUtils]: 120: Hoare triple {19417#(<= main_~i~2 6)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19424#(<= main_~i~2 7)} is VALID [2018-11-23 12:27:06,866 INFO L273 TraceCheckUtils]: 121: Hoare triple {19424#(<= main_~i~2 7)} assume !(~i~2 < 9999); {19025#false} is VALID [2018-11-23 12:27:06,867 INFO L273 TraceCheckUtils]: 122: Hoare triple {19025#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {19025#false} is VALID [2018-11-23 12:27:06,867 INFO L256 TraceCheckUtils]: 123: Hoare triple {19025#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {19025#false} is VALID [2018-11-23 12:27:06,867 INFO L273 TraceCheckUtils]: 124: Hoare triple {19025#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19025#false} is VALID [2018-11-23 12:27:06,867 INFO L273 TraceCheckUtils]: 125: Hoare triple {19025#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19025#false} is VALID [2018-11-23 12:27:06,867 INFO L273 TraceCheckUtils]: 126: Hoare triple {19025#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19025#false} is VALID [2018-11-23 12:27:06,868 INFO L273 TraceCheckUtils]: 127: Hoare triple {19025#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19025#false} is VALID [2018-11-23 12:27:06,868 INFO L273 TraceCheckUtils]: 128: Hoare triple {19025#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19025#false} is VALID [2018-11-23 12:27:06,868 INFO L273 TraceCheckUtils]: 129: Hoare triple {19025#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19025#false} is VALID [2018-11-23 12:27:06,868 INFO L273 TraceCheckUtils]: 130: Hoare triple {19025#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19025#false} is VALID [2018-11-23 12:27:06,868 INFO L273 TraceCheckUtils]: 131: Hoare triple {19025#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19025#false} is VALID [2018-11-23 12:27:06,869 INFO L273 TraceCheckUtils]: 132: Hoare triple {19025#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19025#false} is VALID [2018-11-23 12:27:06,869 INFO L273 TraceCheckUtils]: 133: Hoare triple {19025#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19025#false} is VALID [2018-11-23 12:27:06,869 INFO L273 TraceCheckUtils]: 134: Hoare triple {19025#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19025#false} is VALID [2018-11-23 12:27:06,869 INFO L273 TraceCheckUtils]: 135: Hoare triple {19025#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19025#false} is VALID [2018-11-23 12:27:06,870 INFO L273 TraceCheckUtils]: 136: Hoare triple {19025#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19025#false} is VALID [2018-11-23 12:27:06,870 INFO L273 TraceCheckUtils]: 137: Hoare triple {19025#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19025#false} is VALID [2018-11-23 12:27:06,870 INFO L273 TraceCheckUtils]: 138: Hoare triple {19025#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19025#false} is VALID [2018-11-23 12:27:06,870 INFO L273 TraceCheckUtils]: 139: Hoare triple {19025#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19025#false} is VALID [2018-11-23 12:27:06,870 INFO L273 TraceCheckUtils]: 140: Hoare triple {19025#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19025#false} is VALID [2018-11-23 12:27:06,870 INFO L273 TraceCheckUtils]: 141: Hoare triple {19025#false} assume !(~i~0 < 10000); {19025#false} is VALID [2018-11-23 12:27:06,871 INFO L273 TraceCheckUtils]: 142: Hoare triple {19025#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19025#false} is VALID [2018-11-23 12:27:06,871 INFO L273 TraceCheckUtils]: 143: Hoare triple {19025#false} assume true; {19025#false} is VALID [2018-11-23 12:27:06,871 INFO L268 TraceCheckUtils]: 144: Hoare quadruple {19025#false} {19025#false} #74#return; {19025#false} is VALID [2018-11-23 12:27:06,871 INFO L273 TraceCheckUtils]: 145: Hoare triple {19025#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {19025#false} is VALID [2018-11-23 12:27:06,871 INFO L273 TraceCheckUtils]: 146: Hoare triple {19025#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {19025#false} is VALID [2018-11-23 12:27:06,871 INFO L273 TraceCheckUtils]: 147: Hoare triple {19025#false} assume !false; {19025#false} is VALID [2018-11-23 12:27:06,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 298 proven. 49 refuted. 0 times theorem prover too weak. 1070 trivial. 0 not checked. [2018-11-23 12:27:06,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:06,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10] total 38 [2018-11-23 12:27:06,914 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2018-11-23 12:27:06,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:06,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 12:27:07,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:07,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 12:27:07,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 12:27:07,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:27:07,114 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 38 states. [2018-11-23 12:27:08,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:08,593 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2018-11-23 12:27:08,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 12:27:08,593 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2018-11-23 12:27:08,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:08,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:27:08,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 125 transitions. [2018-11-23 12:27:08,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:27:08,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 125 transitions. [2018-11-23 12:27:08,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 125 transitions. [2018-11-23 12:27:08,757 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:08,759 INFO L225 Difference]: With dead ends: 159 [2018-11-23 12:27:08,759 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 12:27:08,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:27:08,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 12:27:08,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2018-11-23 12:27:08,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:08,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 111 states. [2018-11-23 12:27:08,924 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 111 states. [2018-11-23 12:27:08,924 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 111 states. [2018-11-23 12:27:08,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:08,926 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-11-23 12:27:08,926 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-23 12:27:08,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:08,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:08,927 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 113 states. [2018-11-23 12:27:08,927 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 113 states. [2018-11-23 12:27:08,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:08,928 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-11-23 12:27:08,928 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-23 12:27:08,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:08,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:08,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:08,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:08,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 12:27:08,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2018-11-23 12:27:08,930 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 148 [2018-11-23 12:27:08,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:08,931 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2018-11-23 12:27:08,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 12:27:08,931 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2018-11-23 12:27:08,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-23 12:27:08,931 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:08,931 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 24, 24, 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-23 12:27:08,932 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:08,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:08,932 INFO L82 PathProgramCache]: Analyzing trace with hash 894020771, now seen corresponding path program 28 times [2018-11-23 12:27:08,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:08,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:08,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:08,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:08,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:10,609 INFO L256 TraceCheckUtils]: 0: Hoare triple {20132#true} call ULTIMATE.init(); {20132#true} is VALID [2018-11-23 12:27:10,609 INFO L273 TraceCheckUtils]: 1: Hoare triple {20132#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20132#true} is VALID [2018-11-23 12:27:10,610 INFO L273 TraceCheckUtils]: 2: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:27:10,610 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20132#true} {20132#true} #66#return; {20132#true} is VALID [2018-11-23 12:27:10,610 INFO L256 TraceCheckUtils]: 4: Hoare triple {20132#true} call #t~ret13 := main(); {20132#true} is VALID [2018-11-23 12:27:10,611 INFO L273 TraceCheckUtils]: 5: Hoare triple {20132#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; {20134#(= main_~i~1 0)} is VALID [2018-11-23 12:27:10,611 INFO L273 TraceCheckUtils]: 6: Hoare triple {20134#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {20134#(= main_~i~1 0)} is VALID [2018-11-23 12:27:10,612 INFO L273 TraceCheckUtils]: 7: Hoare triple {20134#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20135#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:10,613 INFO L273 TraceCheckUtils]: 8: Hoare triple {20135#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {20135#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:10,614 INFO L273 TraceCheckUtils]: 9: Hoare triple {20135#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20136#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:10,614 INFO L273 TraceCheckUtils]: 10: Hoare triple {20136#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {20136#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:10,615 INFO L273 TraceCheckUtils]: 11: Hoare triple {20136#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20137#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:10,616 INFO L273 TraceCheckUtils]: 12: Hoare triple {20137#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {20137#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:10,617 INFO L273 TraceCheckUtils]: 13: Hoare triple {20137#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20138#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:10,617 INFO L273 TraceCheckUtils]: 14: Hoare triple {20138#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {20138#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:10,618 INFO L273 TraceCheckUtils]: 15: Hoare triple {20138#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20139#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:10,619 INFO L273 TraceCheckUtils]: 16: Hoare triple {20139#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {20139#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:10,620 INFO L273 TraceCheckUtils]: 17: Hoare triple {20139#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20140#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:10,620 INFO L273 TraceCheckUtils]: 18: Hoare triple {20140#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {20140#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:10,621 INFO L273 TraceCheckUtils]: 19: Hoare triple {20140#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20141#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:10,622 INFO L273 TraceCheckUtils]: 20: Hoare triple {20141#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {20141#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:10,623 INFO L273 TraceCheckUtils]: 21: Hoare triple {20141#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20142#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:10,624 INFO L273 TraceCheckUtils]: 22: Hoare triple {20142#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {20142#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:10,624 INFO L273 TraceCheckUtils]: 23: Hoare triple {20142#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20143#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:10,625 INFO L273 TraceCheckUtils]: 24: Hoare triple {20143#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {20143#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:10,626 INFO L273 TraceCheckUtils]: 25: Hoare triple {20143#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20144#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:10,627 INFO L273 TraceCheckUtils]: 26: Hoare triple {20144#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {20144#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:10,627 INFO L273 TraceCheckUtils]: 27: Hoare triple {20144#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20145#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:10,628 INFO L273 TraceCheckUtils]: 28: Hoare triple {20145#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {20145#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:10,629 INFO L273 TraceCheckUtils]: 29: Hoare triple {20145#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20146#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:10,630 INFO L273 TraceCheckUtils]: 30: Hoare triple {20146#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {20146#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:10,630 INFO L273 TraceCheckUtils]: 31: Hoare triple {20146#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20147#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:10,631 INFO L273 TraceCheckUtils]: 32: Hoare triple {20147#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {20147#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:10,632 INFO L273 TraceCheckUtils]: 33: Hoare triple {20147#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20148#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:10,633 INFO L273 TraceCheckUtils]: 34: Hoare triple {20148#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {20148#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:10,633 INFO L273 TraceCheckUtils]: 35: Hoare triple {20148#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20149#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:10,634 INFO L273 TraceCheckUtils]: 36: Hoare triple {20149#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {20149#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:10,635 INFO L273 TraceCheckUtils]: 37: Hoare triple {20149#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20150#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:10,636 INFO L273 TraceCheckUtils]: 38: Hoare triple {20150#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {20150#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:10,637 INFO L273 TraceCheckUtils]: 39: Hoare triple {20150#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20151#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:10,637 INFO L273 TraceCheckUtils]: 40: Hoare triple {20151#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {20151#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:10,638 INFO L273 TraceCheckUtils]: 41: Hoare triple {20151#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20152#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:10,639 INFO L273 TraceCheckUtils]: 42: Hoare triple {20152#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {20152#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:10,640 INFO L273 TraceCheckUtils]: 43: Hoare triple {20152#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20153#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:10,640 INFO L273 TraceCheckUtils]: 44: Hoare triple {20153#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {20153#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:10,641 INFO L273 TraceCheckUtils]: 45: Hoare triple {20153#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20154#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:10,642 INFO L273 TraceCheckUtils]: 46: Hoare triple {20154#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {20154#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:10,643 INFO L273 TraceCheckUtils]: 47: Hoare triple {20154#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20155#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:10,643 INFO L273 TraceCheckUtils]: 48: Hoare triple {20155#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {20155#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:10,644 INFO L273 TraceCheckUtils]: 49: Hoare triple {20155#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20156#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:10,645 INFO L273 TraceCheckUtils]: 50: Hoare triple {20156#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {20156#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:10,646 INFO L273 TraceCheckUtils]: 51: Hoare triple {20156#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20157#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:10,646 INFO L273 TraceCheckUtils]: 52: Hoare triple {20157#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {20157#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:10,647 INFO L273 TraceCheckUtils]: 53: Hoare triple {20157#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20158#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:10,648 INFO L273 TraceCheckUtils]: 54: Hoare triple {20158#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {20158#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:10,649 INFO L273 TraceCheckUtils]: 55: Hoare triple {20158#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20159#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:10,649 INFO L273 TraceCheckUtils]: 56: Hoare triple {20159#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {20159#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:10,650 INFO L273 TraceCheckUtils]: 57: Hoare triple {20159#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20160#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:10,651 INFO L273 TraceCheckUtils]: 58: Hoare triple {20160#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {20160#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:10,652 INFO L273 TraceCheckUtils]: 59: Hoare triple {20160#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20161#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:10,652 INFO L273 TraceCheckUtils]: 60: Hoare triple {20161#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {20161#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:10,653 INFO L273 TraceCheckUtils]: 61: Hoare triple {20161#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20162#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:10,654 INFO L273 TraceCheckUtils]: 62: Hoare triple {20162#(<= main_~i~1 28)} assume !(~i~1 < 10000); {20133#false} is VALID [2018-11-23 12:27:10,654 INFO L256 TraceCheckUtils]: 63: Hoare triple {20133#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:27:10,654 INFO L273 TraceCheckUtils]: 64: Hoare triple {20132#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20132#true} is VALID [2018-11-23 12:27:10,655 INFO L273 TraceCheckUtils]: 65: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:10,655 INFO L273 TraceCheckUtils]: 66: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:10,655 INFO L273 TraceCheckUtils]: 67: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:10,655 INFO L273 TraceCheckUtils]: 68: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:10,655 INFO L273 TraceCheckUtils]: 69: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:10,655 INFO L273 TraceCheckUtils]: 70: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:10,656 INFO L273 TraceCheckUtils]: 71: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:10,656 INFO L273 TraceCheckUtils]: 72: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:10,656 INFO L273 TraceCheckUtils]: 73: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:10,656 INFO L273 TraceCheckUtils]: 74: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:10,656 INFO L273 TraceCheckUtils]: 75: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:10,656 INFO L273 TraceCheckUtils]: 76: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:10,657 INFO L273 TraceCheckUtils]: 77: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:10,657 INFO L273 TraceCheckUtils]: 78: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:10,657 INFO L273 TraceCheckUtils]: 79: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:10,657 INFO L273 TraceCheckUtils]: 80: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:10,657 INFO L273 TraceCheckUtils]: 81: Hoare triple {20132#true} assume !(~i~0 < 10000); {20132#true} is VALID [2018-11-23 12:27:10,657 INFO L273 TraceCheckUtils]: 82: Hoare triple {20132#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20132#true} is VALID [2018-11-23 12:27:10,657 INFO L273 TraceCheckUtils]: 83: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:27:10,657 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {20132#true} {20133#false} #70#return; {20133#false} is VALID [2018-11-23 12:27:10,657 INFO L273 TraceCheckUtils]: 85: Hoare triple {20133#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {20133#false} is VALID [2018-11-23 12:27:10,657 INFO L256 TraceCheckUtils]: 86: Hoare triple {20133#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:27:10,658 INFO L273 TraceCheckUtils]: 87: Hoare triple {20132#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20132#true} is VALID [2018-11-23 12:27:10,658 INFO L273 TraceCheckUtils]: 88: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:10,658 INFO L273 TraceCheckUtils]: 89: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:10,658 INFO L273 TraceCheckUtils]: 90: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:10,658 INFO L273 TraceCheckUtils]: 91: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:10,658 INFO L273 TraceCheckUtils]: 92: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:10,658 INFO L273 TraceCheckUtils]: 93: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:10,658 INFO L273 TraceCheckUtils]: 94: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:10,658 INFO L273 TraceCheckUtils]: 95: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:10,659 INFO L273 TraceCheckUtils]: 96: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:10,659 INFO L273 TraceCheckUtils]: 97: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:10,659 INFO L273 TraceCheckUtils]: 98: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:10,659 INFO L273 TraceCheckUtils]: 99: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:10,659 INFO L273 TraceCheckUtils]: 100: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:10,659 INFO L273 TraceCheckUtils]: 101: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:10,659 INFO L273 TraceCheckUtils]: 102: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:10,659 INFO L273 TraceCheckUtils]: 103: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:10,659 INFO L273 TraceCheckUtils]: 104: Hoare triple {20132#true} assume !(~i~0 < 10000); {20132#true} is VALID [2018-11-23 12:27:10,659 INFO L273 TraceCheckUtils]: 105: Hoare triple {20132#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20132#true} is VALID [2018-11-23 12:27:10,660 INFO L273 TraceCheckUtils]: 106: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:27:10,660 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {20132#true} {20133#false} #72#return; {20133#false} is VALID [2018-11-23 12:27:10,660 INFO L273 TraceCheckUtils]: 108: Hoare triple {20133#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {20133#false} is VALID [2018-11-23 12:27:10,660 INFO L273 TraceCheckUtils]: 109: Hoare triple {20133#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20133#false} is VALID [2018-11-23 12:27:10,660 INFO L273 TraceCheckUtils]: 110: Hoare triple {20133#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20133#false} is VALID [2018-11-23 12:27:10,660 INFO L273 TraceCheckUtils]: 111: Hoare triple {20133#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20133#false} is VALID [2018-11-23 12:27:10,660 INFO L273 TraceCheckUtils]: 112: Hoare triple {20133#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20133#false} is VALID [2018-11-23 12:27:10,660 INFO L273 TraceCheckUtils]: 113: Hoare triple {20133#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20133#false} is VALID [2018-11-23 12:27:10,660 INFO L273 TraceCheckUtils]: 114: Hoare triple {20133#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20133#false} is VALID [2018-11-23 12:27:10,661 INFO L273 TraceCheckUtils]: 115: Hoare triple {20133#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20133#false} is VALID [2018-11-23 12:27:10,661 INFO L273 TraceCheckUtils]: 116: Hoare triple {20133#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20133#false} is VALID [2018-11-23 12:27:10,661 INFO L273 TraceCheckUtils]: 117: Hoare triple {20133#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20133#false} is VALID [2018-11-23 12:27:10,661 INFO L273 TraceCheckUtils]: 118: Hoare triple {20133#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20133#false} is VALID [2018-11-23 12:27:10,661 INFO L273 TraceCheckUtils]: 119: Hoare triple {20133#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20133#false} is VALID [2018-11-23 12:27:10,661 INFO L273 TraceCheckUtils]: 120: Hoare triple {20133#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20133#false} is VALID [2018-11-23 12:27:10,661 INFO L273 TraceCheckUtils]: 121: Hoare triple {20133#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20133#false} is VALID [2018-11-23 12:27:10,661 INFO L273 TraceCheckUtils]: 122: Hoare triple {20133#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20133#false} is VALID [2018-11-23 12:27:10,661 INFO L273 TraceCheckUtils]: 123: Hoare triple {20133#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20133#false} is VALID [2018-11-23 12:27:10,661 INFO L273 TraceCheckUtils]: 124: Hoare triple {20133#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20133#false} is VALID [2018-11-23 12:27:10,662 INFO L273 TraceCheckUtils]: 125: Hoare triple {20133#false} assume !(~i~2 < 9999); {20133#false} is VALID [2018-11-23 12:27:10,662 INFO L273 TraceCheckUtils]: 126: Hoare triple {20133#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {20133#false} is VALID [2018-11-23 12:27:10,662 INFO L256 TraceCheckUtils]: 127: Hoare triple {20133#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:27:10,662 INFO L273 TraceCheckUtils]: 128: Hoare triple {20132#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20132#true} is VALID [2018-11-23 12:27:10,662 INFO L273 TraceCheckUtils]: 129: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:10,662 INFO L273 TraceCheckUtils]: 130: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:10,662 INFO L273 TraceCheckUtils]: 131: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:10,662 INFO L273 TraceCheckUtils]: 132: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:10,662 INFO L273 TraceCheckUtils]: 133: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:10,663 INFO L273 TraceCheckUtils]: 134: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:10,663 INFO L273 TraceCheckUtils]: 135: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:10,663 INFO L273 TraceCheckUtils]: 136: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:10,663 INFO L273 TraceCheckUtils]: 137: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:10,663 INFO L273 TraceCheckUtils]: 138: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:10,663 INFO L273 TraceCheckUtils]: 139: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:10,663 INFO L273 TraceCheckUtils]: 140: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:10,663 INFO L273 TraceCheckUtils]: 141: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:10,663 INFO L273 TraceCheckUtils]: 142: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:10,663 INFO L273 TraceCheckUtils]: 143: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:10,664 INFO L273 TraceCheckUtils]: 144: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:10,664 INFO L273 TraceCheckUtils]: 145: Hoare triple {20132#true} assume !(~i~0 < 10000); {20132#true} is VALID [2018-11-23 12:27:10,664 INFO L273 TraceCheckUtils]: 146: Hoare triple {20132#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20132#true} is VALID [2018-11-23 12:27:10,664 INFO L273 TraceCheckUtils]: 147: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:27:10,664 INFO L268 TraceCheckUtils]: 148: Hoare quadruple {20132#true} {20133#false} #74#return; {20133#false} is VALID [2018-11-23 12:27:10,664 INFO L273 TraceCheckUtils]: 149: Hoare triple {20133#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {20133#false} is VALID [2018-11-23 12:27:10,664 INFO L273 TraceCheckUtils]: 150: Hoare triple {20133#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {20133#false} is VALID [2018-11-23 12:27:10,664 INFO L273 TraceCheckUtils]: 151: Hoare triple {20133#false} assume !false; {20133#false} is VALID [2018-11-23 12:27:10,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-11-23 12:27:10,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:10,675 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:10,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:27:10,781 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:27:10,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:10,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:11,356 INFO L256 TraceCheckUtils]: 0: Hoare triple {20132#true} call ULTIMATE.init(); {20132#true} is VALID [2018-11-23 12:27:11,356 INFO L273 TraceCheckUtils]: 1: Hoare triple {20132#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20132#true} is VALID [2018-11-23 12:27:11,356 INFO L273 TraceCheckUtils]: 2: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:27:11,356 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20132#true} {20132#true} #66#return; {20132#true} is VALID [2018-11-23 12:27:11,357 INFO L256 TraceCheckUtils]: 4: Hoare triple {20132#true} call #t~ret13 := main(); {20132#true} is VALID [2018-11-23 12:27:11,357 INFO L273 TraceCheckUtils]: 5: Hoare triple {20132#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; {20132#true} is VALID [2018-11-23 12:27:11,357 INFO L273 TraceCheckUtils]: 6: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:27:11,357 INFO L273 TraceCheckUtils]: 7: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:27:11,357 INFO L273 TraceCheckUtils]: 8: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:27:11,358 INFO L273 TraceCheckUtils]: 9: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:27:11,358 INFO L273 TraceCheckUtils]: 10: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:27:11,358 INFO L273 TraceCheckUtils]: 11: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:27:11,358 INFO L273 TraceCheckUtils]: 12: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:27:11,358 INFO L273 TraceCheckUtils]: 13: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:27:11,359 INFO L273 TraceCheckUtils]: 14: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:27:11,359 INFO L273 TraceCheckUtils]: 15: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:27:11,359 INFO L273 TraceCheckUtils]: 16: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:27:11,359 INFO L273 TraceCheckUtils]: 17: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:27:11,359 INFO L273 TraceCheckUtils]: 18: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:27:11,359 INFO L273 TraceCheckUtils]: 19: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:27:11,359 INFO L273 TraceCheckUtils]: 20: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:27:11,359 INFO L273 TraceCheckUtils]: 21: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:27:11,359 INFO L273 TraceCheckUtils]: 22: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:27:11,360 INFO L273 TraceCheckUtils]: 23: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:27:11,360 INFO L273 TraceCheckUtils]: 24: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:27:11,360 INFO L273 TraceCheckUtils]: 25: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:27:11,360 INFO L273 TraceCheckUtils]: 26: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:27:11,360 INFO L273 TraceCheckUtils]: 27: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:27:11,360 INFO L273 TraceCheckUtils]: 28: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:27:11,360 INFO L273 TraceCheckUtils]: 29: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:27:11,360 INFO L273 TraceCheckUtils]: 30: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:27:11,360 INFO L273 TraceCheckUtils]: 31: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:27:11,360 INFO L273 TraceCheckUtils]: 32: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:27:11,361 INFO L273 TraceCheckUtils]: 33: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:27:11,361 INFO L273 TraceCheckUtils]: 34: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:27:11,361 INFO L273 TraceCheckUtils]: 35: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:27:11,361 INFO L273 TraceCheckUtils]: 36: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:27:11,361 INFO L273 TraceCheckUtils]: 37: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:27:11,361 INFO L273 TraceCheckUtils]: 38: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:27:11,361 INFO L273 TraceCheckUtils]: 39: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:27:11,361 INFO L273 TraceCheckUtils]: 40: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:27:11,361 INFO L273 TraceCheckUtils]: 41: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:27:11,362 INFO L273 TraceCheckUtils]: 42: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:27:11,362 INFO L273 TraceCheckUtils]: 43: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:27:11,362 INFO L273 TraceCheckUtils]: 44: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:27:11,362 INFO L273 TraceCheckUtils]: 45: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:27:11,362 INFO L273 TraceCheckUtils]: 46: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:27:11,362 INFO L273 TraceCheckUtils]: 47: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:27:11,362 INFO L273 TraceCheckUtils]: 48: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:27:11,362 INFO L273 TraceCheckUtils]: 49: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:27:11,362 INFO L273 TraceCheckUtils]: 50: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:27:11,362 INFO L273 TraceCheckUtils]: 51: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:27:11,363 INFO L273 TraceCheckUtils]: 52: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:27:11,363 INFO L273 TraceCheckUtils]: 53: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:27:11,363 INFO L273 TraceCheckUtils]: 54: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:27:11,363 INFO L273 TraceCheckUtils]: 55: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:27:11,363 INFO L273 TraceCheckUtils]: 56: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:27:11,363 INFO L273 TraceCheckUtils]: 57: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:27:11,363 INFO L273 TraceCheckUtils]: 58: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:27:11,363 INFO L273 TraceCheckUtils]: 59: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:27:11,363 INFO L273 TraceCheckUtils]: 60: Hoare triple {20132#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:27:11,363 INFO L273 TraceCheckUtils]: 61: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:27:11,364 INFO L273 TraceCheckUtils]: 62: Hoare triple {20132#true} assume !(~i~1 < 10000); {20132#true} is VALID [2018-11-23 12:27:11,364 INFO L256 TraceCheckUtils]: 63: Hoare triple {20132#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:27:11,364 INFO L273 TraceCheckUtils]: 64: Hoare triple {20132#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20132#true} is VALID [2018-11-23 12:27:11,364 INFO L273 TraceCheckUtils]: 65: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:11,364 INFO L273 TraceCheckUtils]: 66: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:11,364 INFO L273 TraceCheckUtils]: 67: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:11,364 INFO L273 TraceCheckUtils]: 68: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:11,364 INFO L273 TraceCheckUtils]: 69: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:11,364 INFO L273 TraceCheckUtils]: 70: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:11,365 INFO L273 TraceCheckUtils]: 71: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:11,365 INFO L273 TraceCheckUtils]: 72: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:11,365 INFO L273 TraceCheckUtils]: 73: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:11,365 INFO L273 TraceCheckUtils]: 74: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:11,365 INFO L273 TraceCheckUtils]: 75: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:11,365 INFO L273 TraceCheckUtils]: 76: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:11,365 INFO L273 TraceCheckUtils]: 77: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:11,365 INFO L273 TraceCheckUtils]: 78: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:11,365 INFO L273 TraceCheckUtils]: 79: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:11,365 INFO L273 TraceCheckUtils]: 80: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:11,366 INFO L273 TraceCheckUtils]: 81: Hoare triple {20132#true} assume !(~i~0 < 10000); {20132#true} is VALID [2018-11-23 12:27:11,366 INFO L273 TraceCheckUtils]: 82: Hoare triple {20132#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20132#true} is VALID [2018-11-23 12:27:11,366 INFO L273 TraceCheckUtils]: 83: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:27:11,366 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {20132#true} {20132#true} #70#return; {20132#true} is VALID [2018-11-23 12:27:11,366 INFO L273 TraceCheckUtils]: 85: Hoare triple {20132#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {20132#true} is VALID [2018-11-23 12:27:11,366 INFO L256 TraceCheckUtils]: 86: Hoare triple {20132#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:27:11,366 INFO L273 TraceCheckUtils]: 87: Hoare triple {20132#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20132#true} is VALID [2018-11-23 12:27:11,366 INFO L273 TraceCheckUtils]: 88: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:11,367 INFO L273 TraceCheckUtils]: 89: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:11,367 INFO L273 TraceCheckUtils]: 90: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:11,367 INFO L273 TraceCheckUtils]: 91: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:11,367 INFO L273 TraceCheckUtils]: 92: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:11,367 INFO L273 TraceCheckUtils]: 93: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:11,368 INFO L273 TraceCheckUtils]: 94: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:11,368 INFO L273 TraceCheckUtils]: 95: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:11,368 INFO L273 TraceCheckUtils]: 96: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:11,368 INFO L273 TraceCheckUtils]: 97: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:11,368 INFO L273 TraceCheckUtils]: 98: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:11,368 INFO L273 TraceCheckUtils]: 99: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:11,368 INFO L273 TraceCheckUtils]: 100: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:11,368 INFO L273 TraceCheckUtils]: 101: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:11,368 INFO L273 TraceCheckUtils]: 102: Hoare triple {20132#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:27:11,369 INFO L273 TraceCheckUtils]: 103: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:27:11,369 INFO L273 TraceCheckUtils]: 104: Hoare triple {20132#true} assume !(~i~0 < 10000); {20132#true} is VALID [2018-11-23 12:27:11,369 INFO L273 TraceCheckUtils]: 105: Hoare triple {20132#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20132#true} is VALID [2018-11-23 12:27:11,369 INFO L273 TraceCheckUtils]: 106: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:27:11,369 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {20132#true} {20132#true} #72#return; {20132#true} is VALID [2018-11-23 12:27:11,369 INFO L273 TraceCheckUtils]: 108: Hoare triple {20132#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {20132#true} is VALID [2018-11-23 12:27:11,369 INFO L273 TraceCheckUtils]: 109: Hoare triple {20132#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20132#true} is VALID [2018-11-23 12:27:11,369 INFO L273 TraceCheckUtils]: 110: Hoare triple {20132#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20132#true} is VALID [2018-11-23 12:27:11,369 INFO L273 TraceCheckUtils]: 111: Hoare triple {20132#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20132#true} is VALID [2018-11-23 12:27:11,369 INFO L273 TraceCheckUtils]: 112: Hoare triple {20132#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20132#true} is VALID [2018-11-23 12:27:11,370 INFO L273 TraceCheckUtils]: 113: Hoare triple {20132#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20132#true} is VALID [2018-11-23 12:27:11,370 INFO L273 TraceCheckUtils]: 114: Hoare triple {20132#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20132#true} is VALID [2018-11-23 12:27:11,370 INFO L273 TraceCheckUtils]: 115: Hoare triple {20132#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20132#true} is VALID [2018-11-23 12:27:11,370 INFO L273 TraceCheckUtils]: 116: Hoare triple {20132#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20132#true} is VALID [2018-11-23 12:27:11,370 INFO L273 TraceCheckUtils]: 117: Hoare triple {20132#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20132#true} is VALID [2018-11-23 12:27:11,370 INFO L273 TraceCheckUtils]: 118: Hoare triple {20132#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20132#true} is VALID [2018-11-23 12:27:11,370 INFO L273 TraceCheckUtils]: 119: Hoare triple {20132#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20132#true} is VALID [2018-11-23 12:27:11,370 INFO L273 TraceCheckUtils]: 120: Hoare triple {20132#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20132#true} is VALID [2018-11-23 12:27:11,370 INFO L273 TraceCheckUtils]: 121: Hoare triple {20132#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20132#true} is VALID [2018-11-23 12:27:11,371 INFO L273 TraceCheckUtils]: 122: Hoare triple {20132#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20132#true} is VALID [2018-11-23 12:27:11,371 INFO L273 TraceCheckUtils]: 123: Hoare triple {20132#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20132#true} is VALID [2018-11-23 12:27:11,371 INFO L273 TraceCheckUtils]: 124: Hoare triple {20132#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20132#true} is VALID [2018-11-23 12:27:11,371 INFO L273 TraceCheckUtils]: 125: Hoare triple {20132#true} assume !(~i~2 < 9999); {20132#true} is VALID [2018-11-23 12:27:11,371 INFO L273 TraceCheckUtils]: 126: Hoare triple {20132#true} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {20132#true} is VALID [2018-11-23 12:27:11,371 INFO L256 TraceCheckUtils]: 127: Hoare triple {20132#true} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:27:11,372 INFO L273 TraceCheckUtils]: 128: Hoare triple {20132#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20550#(<= bor_~i~0 1)} is VALID [2018-11-23 12:27:11,372 INFO L273 TraceCheckUtils]: 129: Hoare triple {20550#(<= bor_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20550#(<= bor_~i~0 1)} is VALID [2018-11-23 12:27:11,372 INFO L273 TraceCheckUtils]: 130: Hoare triple {20550#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20557#(<= bor_~i~0 2)} is VALID [2018-11-23 12:27:11,373 INFO L273 TraceCheckUtils]: 131: Hoare triple {20557#(<= bor_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20557#(<= bor_~i~0 2)} is VALID [2018-11-23 12:27:11,373 INFO L273 TraceCheckUtils]: 132: Hoare triple {20557#(<= bor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20564#(<= bor_~i~0 3)} is VALID [2018-11-23 12:27:11,374 INFO L273 TraceCheckUtils]: 133: Hoare triple {20564#(<= bor_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20564#(<= bor_~i~0 3)} is VALID [2018-11-23 12:27:11,374 INFO L273 TraceCheckUtils]: 134: Hoare triple {20564#(<= bor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20571#(<= bor_~i~0 4)} is VALID [2018-11-23 12:27:11,375 INFO L273 TraceCheckUtils]: 135: Hoare triple {20571#(<= bor_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20571#(<= bor_~i~0 4)} is VALID [2018-11-23 12:27:11,375 INFO L273 TraceCheckUtils]: 136: Hoare triple {20571#(<= bor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20578#(<= bor_~i~0 5)} is VALID [2018-11-23 12:27:11,376 INFO L273 TraceCheckUtils]: 137: Hoare triple {20578#(<= bor_~i~0 5)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20578#(<= bor_~i~0 5)} is VALID [2018-11-23 12:27:11,377 INFO L273 TraceCheckUtils]: 138: Hoare triple {20578#(<= bor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20585#(<= bor_~i~0 6)} is VALID [2018-11-23 12:27:11,378 INFO L273 TraceCheckUtils]: 139: Hoare triple {20585#(<= bor_~i~0 6)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20585#(<= bor_~i~0 6)} is VALID [2018-11-23 12:27:11,378 INFO L273 TraceCheckUtils]: 140: Hoare triple {20585#(<= bor_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20592#(<= bor_~i~0 7)} is VALID [2018-11-23 12:27:11,379 INFO L273 TraceCheckUtils]: 141: Hoare triple {20592#(<= bor_~i~0 7)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20592#(<= bor_~i~0 7)} is VALID [2018-11-23 12:27:11,380 INFO L273 TraceCheckUtils]: 142: Hoare triple {20592#(<= bor_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20599#(<= bor_~i~0 8)} is VALID [2018-11-23 12:27:11,380 INFO L273 TraceCheckUtils]: 143: Hoare triple {20599#(<= bor_~i~0 8)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20599#(<= bor_~i~0 8)} is VALID [2018-11-23 12:27:11,381 INFO L273 TraceCheckUtils]: 144: Hoare triple {20599#(<= bor_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20606#(<= bor_~i~0 9)} is VALID [2018-11-23 12:27:11,382 INFO L273 TraceCheckUtils]: 145: Hoare triple {20606#(<= bor_~i~0 9)} assume !(~i~0 < 10000); {20133#false} is VALID [2018-11-23 12:27:11,382 INFO L273 TraceCheckUtils]: 146: Hoare triple {20133#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20133#false} is VALID [2018-11-23 12:27:11,382 INFO L273 TraceCheckUtils]: 147: Hoare triple {20133#false} assume true; {20133#false} is VALID [2018-11-23 12:27:11,383 INFO L268 TraceCheckUtils]: 148: Hoare quadruple {20133#false} {20132#true} #74#return; {20133#false} is VALID [2018-11-23 12:27:11,383 INFO L273 TraceCheckUtils]: 149: Hoare triple {20133#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {20133#false} is VALID [2018-11-23 12:27:11,383 INFO L273 TraceCheckUtils]: 150: Hoare triple {20133#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {20133#false} is VALID [2018-11-23 12:27:11,383 INFO L273 TraceCheckUtils]: 151: Hoare triple {20133#false} assume !false; {20133#false} is VALID [2018-11-23 12:27:11,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 296 proven. 64 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2018-11-23 12:27:11,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:11,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 11] total 40 [2018-11-23 12:27:11,416 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2018-11-23 12:27:11,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:11,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 12:27:11,575 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-23 12:27:11,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 12:27:11,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 12:27:11,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:27:11,577 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 40 states. [2018-11-23 12:27:12,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:12,242 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2018-11-23 12:27:12,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:27:12,242 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2018-11-23 12:27:12,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:12,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:27:12,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 132 transitions. [2018-11-23 12:27:12,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:27:12,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 132 transitions. [2018-11-23 12:27:12,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 132 transitions. [2018-11-23 12:27:12,433 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-23 12:27:12,436 INFO L225 Difference]: With dead ends: 165 [2018-11-23 12:27:12,436 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 12:27:12,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:27:12,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 12:27:12,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-11-23 12:27:12,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:12,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 115 states. [2018-11-23 12:27:12,620 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 115 states. [2018-11-23 12:27:12,620 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 115 states. [2018-11-23 12:27:12,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:12,622 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-11-23 12:27:12,622 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-23 12:27:12,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:12,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:12,622 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 117 states. [2018-11-23 12:27:12,623 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 117 states. [2018-11-23 12:27:12,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:12,624 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-11-23 12:27:12,624 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-23 12:27:12,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:12,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:12,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:12,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:12,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-23 12:27:12,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2018-11-23 12:27:12,626 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 152 [2018-11-23 12:27:12,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:12,626 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2018-11-23 12:27:12,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 12:27:12,627 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-23 12:27:12,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-23 12:27:12,627 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:12,627 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 27, 27, 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-23 12:27:12,628 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:12,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:12,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1573539069, now seen corresponding path program 29 times [2018-11-23 12:27:12,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:12,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:12,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:12,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:12,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:13,535 INFO L256 TraceCheckUtils]: 0: Hoare triple {21277#true} call ULTIMATE.init(); {21277#true} is VALID [2018-11-23 12:27:13,535 INFO L273 TraceCheckUtils]: 1: Hoare triple {21277#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21277#true} is VALID [2018-11-23 12:27:13,536 INFO L273 TraceCheckUtils]: 2: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:27:13,536 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21277#true} {21277#true} #66#return; {21277#true} is VALID [2018-11-23 12:27:13,536 INFO L256 TraceCheckUtils]: 4: Hoare triple {21277#true} call #t~ret13 := main(); {21277#true} is VALID [2018-11-23 12:27:13,536 INFO L273 TraceCheckUtils]: 5: Hoare triple {21277#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; {21279#(= main_~i~1 0)} is VALID [2018-11-23 12:27:13,537 INFO L273 TraceCheckUtils]: 6: Hoare triple {21279#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21279#(= main_~i~1 0)} is VALID [2018-11-23 12:27:13,538 INFO L273 TraceCheckUtils]: 7: Hoare triple {21279#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21280#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:13,538 INFO L273 TraceCheckUtils]: 8: Hoare triple {21280#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21280#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:13,539 INFO L273 TraceCheckUtils]: 9: Hoare triple {21280#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21281#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:13,539 INFO L273 TraceCheckUtils]: 10: Hoare triple {21281#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21281#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:13,540 INFO L273 TraceCheckUtils]: 11: Hoare triple {21281#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21282#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:13,540 INFO L273 TraceCheckUtils]: 12: Hoare triple {21282#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21282#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:13,541 INFO L273 TraceCheckUtils]: 13: Hoare triple {21282#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21283#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:13,542 INFO L273 TraceCheckUtils]: 14: Hoare triple {21283#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21283#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:13,542 INFO L273 TraceCheckUtils]: 15: Hoare triple {21283#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21284#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:13,543 INFO L273 TraceCheckUtils]: 16: Hoare triple {21284#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21284#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:13,544 INFO L273 TraceCheckUtils]: 17: Hoare triple {21284#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21285#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:13,544 INFO L273 TraceCheckUtils]: 18: Hoare triple {21285#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21285#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:13,545 INFO L273 TraceCheckUtils]: 19: Hoare triple {21285#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21286#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:13,546 INFO L273 TraceCheckUtils]: 20: Hoare triple {21286#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21286#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:13,547 INFO L273 TraceCheckUtils]: 21: Hoare triple {21286#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21287#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:13,547 INFO L273 TraceCheckUtils]: 22: Hoare triple {21287#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21287#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:13,548 INFO L273 TraceCheckUtils]: 23: Hoare triple {21287#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21288#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:13,549 INFO L273 TraceCheckUtils]: 24: Hoare triple {21288#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21288#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:13,550 INFO L273 TraceCheckUtils]: 25: Hoare triple {21288#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21289#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:13,550 INFO L273 TraceCheckUtils]: 26: Hoare triple {21289#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21289#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:13,551 INFO L273 TraceCheckUtils]: 27: Hoare triple {21289#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21290#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:13,552 INFO L273 TraceCheckUtils]: 28: Hoare triple {21290#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21290#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:13,552 INFO L273 TraceCheckUtils]: 29: Hoare triple {21290#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21291#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:13,553 INFO L273 TraceCheckUtils]: 30: Hoare triple {21291#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21291#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:13,554 INFO L273 TraceCheckUtils]: 31: Hoare triple {21291#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21292#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:13,554 INFO L273 TraceCheckUtils]: 32: Hoare triple {21292#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21292#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:13,555 INFO L273 TraceCheckUtils]: 33: Hoare triple {21292#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21293#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:13,556 INFO L273 TraceCheckUtils]: 34: Hoare triple {21293#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21293#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:13,557 INFO L273 TraceCheckUtils]: 35: Hoare triple {21293#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21294#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:13,557 INFO L273 TraceCheckUtils]: 36: Hoare triple {21294#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21294#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:13,558 INFO L273 TraceCheckUtils]: 37: Hoare triple {21294#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21295#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:13,559 INFO L273 TraceCheckUtils]: 38: Hoare triple {21295#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21295#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:13,559 INFO L273 TraceCheckUtils]: 39: Hoare triple {21295#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21296#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:13,560 INFO L273 TraceCheckUtils]: 40: Hoare triple {21296#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21296#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:13,561 INFO L273 TraceCheckUtils]: 41: Hoare triple {21296#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21297#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:13,562 INFO L273 TraceCheckUtils]: 42: Hoare triple {21297#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21297#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:13,562 INFO L273 TraceCheckUtils]: 43: Hoare triple {21297#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21298#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:13,563 INFO L273 TraceCheckUtils]: 44: Hoare triple {21298#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21298#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:13,564 INFO L273 TraceCheckUtils]: 45: Hoare triple {21298#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21299#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:13,564 INFO L273 TraceCheckUtils]: 46: Hoare triple {21299#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21299#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:13,565 INFO L273 TraceCheckUtils]: 47: Hoare triple {21299#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21300#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:13,566 INFO L273 TraceCheckUtils]: 48: Hoare triple {21300#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21300#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:13,567 INFO L273 TraceCheckUtils]: 49: Hoare triple {21300#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21301#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:13,567 INFO L273 TraceCheckUtils]: 50: Hoare triple {21301#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21301#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:13,568 INFO L273 TraceCheckUtils]: 51: Hoare triple {21301#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21302#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:13,569 INFO L273 TraceCheckUtils]: 52: Hoare triple {21302#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21302#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:13,569 INFO L273 TraceCheckUtils]: 53: Hoare triple {21302#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21303#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:13,570 INFO L273 TraceCheckUtils]: 54: Hoare triple {21303#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21303#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:13,571 INFO L273 TraceCheckUtils]: 55: Hoare triple {21303#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21304#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:13,571 INFO L273 TraceCheckUtils]: 56: Hoare triple {21304#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21304#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:13,572 INFO L273 TraceCheckUtils]: 57: Hoare triple {21304#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21305#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:13,573 INFO L273 TraceCheckUtils]: 58: Hoare triple {21305#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21305#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:13,574 INFO L273 TraceCheckUtils]: 59: Hoare triple {21305#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21306#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:13,574 INFO L273 TraceCheckUtils]: 60: Hoare triple {21306#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21306#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:13,575 INFO L273 TraceCheckUtils]: 61: Hoare triple {21306#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21307#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:13,576 INFO L273 TraceCheckUtils]: 62: Hoare triple {21307#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {21307#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:13,576 INFO L273 TraceCheckUtils]: 63: Hoare triple {21307#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21308#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:13,577 INFO L273 TraceCheckUtils]: 64: Hoare triple {21308#(<= main_~i~1 29)} assume !(~i~1 < 10000); {21278#false} is VALID [2018-11-23 12:27:13,577 INFO L256 TraceCheckUtils]: 65: Hoare triple {21278#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {21277#true} is VALID [2018-11-23 12:27:13,578 INFO L273 TraceCheckUtils]: 66: Hoare triple {21277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21277#true} is VALID [2018-11-23 12:27:13,578 INFO L273 TraceCheckUtils]: 67: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:27:13,578 INFO L273 TraceCheckUtils]: 68: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:27:13,578 INFO L273 TraceCheckUtils]: 69: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:27:13,578 INFO L273 TraceCheckUtils]: 70: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:27:13,578 INFO L273 TraceCheckUtils]: 71: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:27:13,579 INFO L273 TraceCheckUtils]: 72: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:27:13,579 INFO L273 TraceCheckUtils]: 73: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:27:13,579 INFO L273 TraceCheckUtils]: 74: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:27:13,579 INFO L273 TraceCheckUtils]: 75: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:27:13,579 INFO L273 TraceCheckUtils]: 76: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:27:13,579 INFO L273 TraceCheckUtils]: 77: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:27:13,580 INFO L273 TraceCheckUtils]: 78: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:27:13,580 INFO L273 TraceCheckUtils]: 79: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:27:13,580 INFO L273 TraceCheckUtils]: 80: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:27:13,580 INFO L273 TraceCheckUtils]: 81: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:27:13,580 INFO L273 TraceCheckUtils]: 82: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:27:13,580 INFO L273 TraceCheckUtils]: 83: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:27:13,581 INFO L273 TraceCheckUtils]: 84: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:27:13,581 INFO L273 TraceCheckUtils]: 85: Hoare triple {21277#true} assume !(~i~0 < 10000); {21277#true} is VALID [2018-11-23 12:27:13,581 INFO L273 TraceCheckUtils]: 86: Hoare triple {21277#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21277#true} is VALID [2018-11-23 12:27:13,581 INFO L273 TraceCheckUtils]: 87: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:27:13,581 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {21277#true} {21278#false} #70#return; {21278#false} is VALID [2018-11-23 12:27:13,581 INFO L273 TraceCheckUtils]: 89: Hoare triple {21278#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {21278#false} is VALID [2018-11-23 12:27:13,582 INFO L256 TraceCheckUtils]: 90: Hoare triple {21278#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {21277#true} is VALID [2018-11-23 12:27:13,582 INFO L273 TraceCheckUtils]: 91: Hoare triple {21277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21277#true} is VALID [2018-11-23 12:27:13,582 INFO L273 TraceCheckUtils]: 92: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:27:13,582 INFO L273 TraceCheckUtils]: 93: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:27:13,582 INFO L273 TraceCheckUtils]: 94: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:27:13,582 INFO L273 TraceCheckUtils]: 95: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:27:13,582 INFO L273 TraceCheckUtils]: 96: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:27:13,582 INFO L273 TraceCheckUtils]: 97: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:27:13,583 INFO L273 TraceCheckUtils]: 98: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:27:13,583 INFO L273 TraceCheckUtils]: 99: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:27:13,583 INFO L273 TraceCheckUtils]: 100: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:27:13,583 INFO L273 TraceCheckUtils]: 101: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:27:13,583 INFO L273 TraceCheckUtils]: 102: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:27:13,583 INFO L273 TraceCheckUtils]: 103: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:27:13,583 INFO L273 TraceCheckUtils]: 104: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:27:13,583 INFO L273 TraceCheckUtils]: 105: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:27:13,583 INFO L273 TraceCheckUtils]: 106: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:27:13,584 INFO L273 TraceCheckUtils]: 107: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:27:13,584 INFO L273 TraceCheckUtils]: 108: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:27:13,584 INFO L273 TraceCheckUtils]: 109: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:27:13,584 INFO L273 TraceCheckUtils]: 110: Hoare triple {21277#true} assume !(~i~0 < 10000); {21277#true} is VALID [2018-11-23 12:27:13,584 INFO L273 TraceCheckUtils]: 111: Hoare triple {21277#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21277#true} is VALID [2018-11-23 12:27:13,584 INFO L273 TraceCheckUtils]: 112: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:27:13,584 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {21277#true} {21278#false} #72#return; {21278#false} is VALID [2018-11-23 12:27:13,584 INFO L273 TraceCheckUtils]: 114: Hoare triple {21278#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {21278#false} is VALID [2018-11-23 12:27:13,584 INFO L273 TraceCheckUtils]: 115: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:27:13,584 INFO L273 TraceCheckUtils]: 116: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:27:13,585 INFO L273 TraceCheckUtils]: 117: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:27:13,585 INFO L273 TraceCheckUtils]: 118: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:27:13,585 INFO L273 TraceCheckUtils]: 119: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:27:13,585 INFO L273 TraceCheckUtils]: 120: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:27:13,585 INFO L273 TraceCheckUtils]: 121: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:27:13,585 INFO L273 TraceCheckUtils]: 122: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:27:13,585 INFO L273 TraceCheckUtils]: 123: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:27:13,585 INFO L273 TraceCheckUtils]: 124: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:27:13,585 INFO L273 TraceCheckUtils]: 125: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:27:13,585 INFO L273 TraceCheckUtils]: 126: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:27:13,586 INFO L273 TraceCheckUtils]: 127: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:27:13,586 INFO L273 TraceCheckUtils]: 128: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:27:13,586 INFO L273 TraceCheckUtils]: 129: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:27:13,586 INFO L273 TraceCheckUtils]: 130: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:27:13,586 INFO L273 TraceCheckUtils]: 131: Hoare triple {21278#false} assume !(~i~2 < 9999); {21278#false} is VALID [2018-11-23 12:27:13,586 INFO L273 TraceCheckUtils]: 132: Hoare triple {21278#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {21278#false} is VALID [2018-11-23 12:27:13,586 INFO L256 TraceCheckUtils]: 133: Hoare triple {21278#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {21277#true} is VALID [2018-11-23 12:27:13,586 INFO L273 TraceCheckUtils]: 134: Hoare triple {21277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21277#true} is VALID [2018-11-23 12:27:13,586 INFO L273 TraceCheckUtils]: 135: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:27:13,587 INFO L273 TraceCheckUtils]: 136: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:27:13,587 INFO L273 TraceCheckUtils]: 137: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:27:13,587 INFO L273 TraceCheckUtils]: 138: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:27:13,587 INFO L273 TraceCheckUtils]: 139: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:27:13,587 INFO L273 TraceCheckUtils]: 140: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:27:13,587 INFO L273 TraceCheckUtils]: 141: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:27:13,587 INFO L273 TraceCheckUtils]: 142: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:27:13,587 INFO L273 TraceCheckUtils]: 143: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:27:13,587 INFO L273 TraceCheckUtils]: 144: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:27:13,587 INFO L273 TraceCheckUtils]: 145: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:27:13,588 INFO L273 TraceCheckUtils]: 146: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:27:13,588 INFO L273 TraceCheckUtils]: 147: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:27:13,588 INFO L273 TraceCheckUtils]: 148: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:27:13,588 INFO L273 TraceCheckUtils]: 149: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:27:13,588 INFO L273 TraceCheckUtils]: 150: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:27:13,588 INFO L273 TraceCheckUtils]: 151: Hoare triple {21277#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:27:13,588 INFO L273 TraceCheckUtils]: 152: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:27:13,588 INFO L273 TraceCheckUtils]: 153: Hoare triple {21277#true} assume !(~i~0 < 10000); {21277#true} is VALID [2018-11-23 12:27:13,588 INFO L273 TraceCheckUtils]: 154: Hoare triple {21277#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21277#true} is VALID [2018-11-23 12:27:13,588 INFO L273 TraceCheckUtils]: 155: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:27:13,589 INFO L268 TraceCheckUtils]: 156: Hoare quadruple {21277#true} {21278#false} #74#return; {21278#false} is VALID [2018-11-23 12:27:13,589 INFO L273 TraceCheckUtils]: 157: Hoare triple {21278#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {21278#false} is VALID [2018-11-23 12:27:13,589 INFO L273 TraceCheckUtils]: 158: Hoare triple {21278#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {21278#false} is VALID [2018-11-23 12:27:13,589 INFO L273 TraceCheckUtils]: 159: Hoare triple {21278#false} assume !false; {21278#false} is VALID [2018-11-23 12:27:13,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2018-11-23 12:27:13,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:13,601 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:13,614 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:27:30,703 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2018-11-23 12:27:30,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:30,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:31,314 INFO L256 TraceCheckUtils]: 0: Hoare triple {21277#true} call ULTIMATE.init(); {21277#true} is VALID [2018-11-23 12:27:31,315 INFO L273 TraceCheckUtils]: 1: Hoare triple {21277#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21277#true} is VALID [2018-11-23 12:27:31,315 INFO L273 TraceCheckUtils]: 2: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:27:31,315 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21277#true} {21277#true} #66#return; {21277#true} is VALID [2018-11-23 12:27:31,315 INFO L256 TraceCheckUtils]: 4: Hoare triple {21277#true} call #t~ret13 := main(); {21277#true} is VALID [2018-11-23 12:27:31,316 INFO L273 TraceCheckUtils]: 5: Hoare triple {21277#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; {21277#true} is VALID [2018-11-23 12:27:31,316 INFO L273 TraceCheckUtils]: 6: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,316 INFO L273 TraceCheckUtils]: 7: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,316 INFO L273 TraceCheckUtils]: 8: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,316 INFO L273 TraceCheckUtils]: 9: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,316 INFO L273 TraceCheckUtils]: 10: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,317 INFO L273 TraceCheckUtils]: 11: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,317 INFO L273 TraceCheckUtils]: 12: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,317 INFO L273 TraceCheckUtils]: 13: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,317 INFO L273 TraceCheckUtils]: 14: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,317 INFO L273 TraceCheckUtils]: 15: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,317 INFO L273 TraceCheckUtils]: 16: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,317 INFO L273 TraceCheckUtils]: 17: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,317 INFO L273 TraceCheckUtils]: 18: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,317 INFO L273 TraceCheckUtils]: 19: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,318 INFO L273 TraceCheckUtils]: 20: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,318 INFO L273 TraceCheckUtils]: 21: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,318 INFO L273 TraceCheckUtils]: 22: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,318 INFO L273 TraceCheckUtils]: 23: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,318 INFO L273 TraceCheckUtils]: 24: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,318 INFO L273 TraceCheckUtils]: 25: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,318 INFO L273 TraceCheckUtils]: 26: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,318 INFO L273 TraceCheckUtils]: 27: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,318 INFO L273 TraceCheckUtils]: 28: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,318 INFO L273 TraceCheckUtils]: 29: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,319 INFO L273 TraceCheckUtils]: 30: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,319 INFO L273 TraceCheckUtils]: 31: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,319 INFO L273 TraceCheckUtils]: 32: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,319 INFO L273 TraceCheckUtils]: 33: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,319 INFO L273 TraceCheckUtils]: 34: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,319 INFO L273 TraceCheckUtils]: 35: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,319 INFO L273 TraceCheckUtils]: 36: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,319 INFO L273 TraceCheckUtils]: 37: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,319 INFO L273 TraceCheckUtils]: 38: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,319 INFO L273 TraceCheckUtils]: 39: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,320 INFO L273 TraceCheckUtils]: 40: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,320 INFO L273 TraceCheckUtils]: 41: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,320 INFO L273 TraceCheckUtils]: 42: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,320 INFO L273 TraceCheckUtils]: 43: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,320 INFO L273 TraceCheckUtils]: 44: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,320 INFO L273 TraceCheckUtils]: 45: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,320 INFO L273 TraceCheckUtils]: 46: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,320 INFO L273 TraceCheckUtils]: 47: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,320 INFO L273 TraceCheckUtils]: 48: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,321 INFO L273 TraceCheckUtils]: 49: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,321 INFO L273 TraceCheckUtils]: 50: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,321 INFO L273 TraceCheckUtils]: 51: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,321 INFO L273 TraceCheckUtils]: 52: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,321 INFO L273 TraceCheckUtils]: 53: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,321 INFO L273 TraceCheckUtils]: 54: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,321 INFO L273 TraceCheckUtils]: 55: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,321 INFO L273 TraceCheckUtils]: 56: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,321 INFO L273 TraceCheckUtils]: 57: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,321 INFO L273 TraceCheckUtils]: 58: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,322 INFO L273 TraceCheckUtils]: 59: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,322 INFO L273 TraceCheckUtils]: 60: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,322 INFO L273 TraceCheckUtils]: 61: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,322 INFO L273 TraceCheckUtils]: 62: Hoare triple {21277#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:31,322 INFO L273 TraceCheckUtils]: 63: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:31,322 INFO L273 TraceCheckUtils]: 64: Hoare triple {21277#true} assume !(~i~1 < 10000); {21277#true} is VALID [2018-11-23 12:27:31,322 INFO L256 TraceCheckUtils]: 65: Hoare triple {21277#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {21277#true} is VALID [2018-11-23 12:27:31,323 INFO L273 TraceCheckUtils]: 66: Hoare triple {21277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21510#(<= bor_~i~0 1)} is VALID [2018-11-23 12:27:31,323 INFO L273 TraceCheckUtils]: 67: Hoare triple {21510#(<= bor_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21510#(<= bor_~i~0 1)} is VALID [2018-11-23 12:27:31,324 INFO L273 TraceCheckUtils]: 68: Hoare triple {21510#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21517#(<= bor_~i~0 2)} is VALID [2018-11-23 12:27:31,324 INFO L273 TraceCheckUtils]: 69: Hoare triple {21517#(<= bor_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21517#(<= bor_~i~0 2)} is VALID [2018-11-23 12:27:31,325 INFO L273 TraceCheckUtils]: 70: Hoare triple {21517#(<= bor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21524#(<= bor_~i~0 3)} is VALID [2018-11-23 12:27:31,326 INFO L273 TraceCheckUtils]: 71: Hoare triple {21524#(<= bor_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21524#(<= bor_~i~0 3)} is VALID [2018-11-23 12:27:31,326 INFO L273 TraceCheckUtils]: 72: Hoare triple {21524#(<= bor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21531#(<= bor_~i~0 4)} is VALID [2018-11-23 12:27:31,327 INFO L273 TraceCheckUtils]: 73: Hoare triple {21531#(<= bor_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21531#(<= bor_~i~0 4)} is VALID [2018-11-23 12:27:31,328 INFO L273 TraceCheckUtils]: 74: Hoare triple {21531#(<= bor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21538#(<= bor_~i~0 5)} is VALID [2018-11-23 12:27:31,329 INFO L273 TraceCheckUtils]: 75: Hoare triple {21538#(<= bor_~i~0 5)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21538#(<= bor_~i~0 5)} is VALID [2018-11-23 12:27:31,329 INFO L273 TraceCheckUtils]: 76: Hoare triple {21538#(<= bor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21545#(<= bor_~i~0 6)} is VALID [2018-11-23 12:27:31,330 INFO L273 TraceCheckUtils]: 77: Hoare triple {21545#(<= bor_~i~0 6)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21545#(<= bor_~i~0 6)} is VALID [2018-11-23 12:27:31,331 INFO L273 TraceCheckUtils]: 78: Hoare triple {21545#(<= bor_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21552#(<= bor_~i~0 7)} is VALID [2018-11-23 12:27:31,332 INFO L273 TraceCheckUtils]: 79: Hoare triple {21552#(<= bor_~i~0 7)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21552#(<= bor_~i~0 7)} is VALID [2018-11-23 12:27:31,333 INFO L273 TraceCheckUtils]: 80: Hoare triple {21552#(<= bor_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21559#(<= bor_~i~0 8)} is VALID [2018-11-23 12:27:31,333 INFO L273 TraceCheckUtils]: 81: Hoare triple {21559#(<= bor_~i~0 8)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21559#(<= bor_~i~0 8)} is VALID [2018-11-23 12:27:31,335 INFO L273 TraceCheckUtils]: 82: Hoare triple {21559#(<= bor_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21566#(<= bor_~i~0 9)} is VALID [2018-11-23 12:27:31,336 INFO L273 TraceCheckUtils]: 83: Hoare triple {21566#(<= bor_~i~0 9)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21566#(<= bor_~i~0 9)} is VALID [2018-11-23 12:27:31,336 INFO L273 TraceCheckUtils]: 84: Hoare triple {21566#(<= bor_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21573#(<= bor_~i~0 10)} is VALID [2018-11-23 12:27:31,337 INFO L273 TraceCheckUtils]: 85: Hoare triple {21573#(<= bor_~i~0 10)} assume !(~i~0 < 10000); {21278#false} is VALID [2018-11-23 12:27:31,337 INFO L273 TraceCheckUtils]: 86: Hoare triple {21278#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21278#false} is VALID [2018-11-23 12:27:31,337 INFO L273 TraceCheckUtils]: 87: Hoare triple {21278#false} assume true; {21278#false} is VALID [2018-11-23 12:27:31,337 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {21278#false} {21277#true} #70#return; {21278#false} is VALID [2018-11-23 12:27:31,337 INFO L273 TraceCheckUtils]: 89: Hoare triple {21278#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {21278#false} is VALID [2018-11-23 12:27:31,337 INFO L256 TraceCheckUtils]: 90: Hoare triple {21278#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {21278#false} is VALID [2018-11-23 12:27:31,338 INFO L273 TraceCheckUtils]: 91: Hoare triple {21278#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21278#false} is VALID [2018-11-23 12:27:31,338 INFO L273 TraceCheckUtils]: 92: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:31,338 INFO L273 TraceCheckUtils]: 93: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:31,338 INFO L273 TraceCheckUtils]: 94: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:31,338 INFO L273 TraceCheckUtils]: 95: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:31,338 INFO L273 TraceCheckUtils]: 96: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:31,338 INFO L273 TraceCheckUtils]: 97: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:31,338 INFO L273 TraceCheckUtils]: 98: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:31,339 INFO L273 TraceCheckUtils]: 99: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:31,339 INFO L273 TraceCheckUtils]: 100: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:31,339 INFO L273 TraceCheckUtils]: 101: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:31,339 INFO L273 TraceCheckUtils]: 102: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:31,339 INFO L273 TraceCheckUtils]: 103: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:31,339 INFO L273 TraceCheckUtils]: 104: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:31,340 INFO L273 TraceCheckUtils]: 105: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:31,340 INFO L273 TraceCheckUtils]: 106: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:31,340 INFO L273 TraceCheckUtils]: 107: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:31,340 INFO L273 TraceCheckUtils]: 108: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:31,340 INFO L273 TraceCheckUtils]: 109: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:31,340 INFO L273 TraceCheckUtils]: 110: Hoare triple {21278#false} assume !(~i~0 < 10000); {21278#false} is VALID [2018-11-23 12:27:31,341 INFO L273 TraceCheckUtils]: 111: Hoare triple {21278#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21278#false} is VALID [2018-11-23 12:27:31,341 INFO L273 TraceCheckUtils]: 112: Hoare triple {21278#false} assume true; {21278#false} is VALID [2018-11-23 12:27:31,341 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {21278#false} {21278#false} #72#return; {21278#false} is VALID [2018-11-23 12:27:31,341 INFO L273 TraceCheckUtils]: 114: Hoare triple {21278#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {21278#false} is VALID [2018-11-23 12:27:31,341 INFO L273 TraceCheckUtils]: 115: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:27:31,341 INFO L273 TraceCheckUtils]: 116: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:27:31,341 INFO L273 TraceCheckUtils]: 117: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:27:31,341 INFO L273 TraceCheckUtils]: 118: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:27:31,341 INFO L273 TraceCheckUtils]: 119: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:27:31,341 INFO L273 TraceCheckUtils]: 120: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:27:31,342 INFO L273 TraceCheckUtils]: 121: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:27:31,342 INFO L273 TraceCheckUtils]: 122: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:27:31,342 INFO L273 TraceCheckUtils]: 123: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:27:31,342 INFO L273 TraceCheckUtils]: 124: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:27:31,342 INFO L273 TraceCheckUtils]: 125: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:27:31,342 INFO L273 TraceCheckUtils]: 126: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:27:31,342 INFO L273 TraceCheckUtils]: 127: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:27:31,342 INFO L273 TraceCheckUtils]: 128: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:27:31,342 INFO L273 TraceCheckUtils]: 129: Hoare triple {21278#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:27:31,343 INFO L273 TraceCheckUtils]: 130: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:27:31,343 INFO L273 TraceCheckUtils]: 131: Hoare triple {21278#false} assume !(~i~2 < 9999); {21278#false} is VALID [2018-11-23 12:27:31,343 INFO L273 TraceCheckUtils]: 132: Hoare triple {21278#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {21278#false} is VALID [2018-11-23 12:27:31,343 INFO L256 TraceCheckUtils]: 133: Hoare triple {21278#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {21278#false} is VALID [2018-11-23 12:27:31,343 INFO L273 TraceCheckUtils]: 134: Hoare triple {21278#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21278#false} is VALID [2018-11-23 12:27:31,343 INFO L273 TraceCheckUtils]: 135: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:31,343 INFO L273 TraceCheckUtils]: 136: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:31,343 INFO L273 TraceCheckUtils]: 137: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:31,343 INFO L273 TraceCheckUtils]: 138: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:31,343 INFO L273 TraceCheckUtils]: 139: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:31,344 INFO L273 TraceCheckUtils]: 140: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:31,344 INFO L273 TraceCheckUtils]: 141: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:31,344 INFO L273 TraceCheckUtils]: 142: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:31,344 INFO L273 TraceCheckUtils]: 143: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:31,344 INFO L273 TraceCheckUtils]: 144: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:31,344 INFO L273 TraceCheckUtils]: 145: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:31,344 INFO L273 TraceCheckUtils]: 146: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:31,344 INFO L273 TraceCheckUtils]: 147: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:31,344 INFO L273 TraceCheckUtils]: 148: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:31,345 INFO L273 TraceCheckUtils]: 149: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:31,345 INFO L273 TraceCheckUtils]: 150: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:31,345 INFO L273 TraceCheckUtils]: 151: Hoare triple {21278#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:31,345 INFO L273 TraceCheckUtils]: 152: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:31,345 INFO L273 TraceCheckUtils]: 153: Hoare triple {21278#false} assume !(~i~0 < 10000); {21278#false} is VALID [2018-11-23 12:27:31,345 INFO L273 TraceCheckUtils]: 154: Hoare triple {21278#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21278#false} is VALID [2018-11-23 12:27:31,345 INFO L273 TraceCheckUtils]: 155: Hoare triple {21278#false} assume true; {21278#false} is VALID [2018-11-23 12:27:31,345 INFO L268 TraceCheckUtils]: 156: Hoare quadruple {21278#false} {21278#false} #74#return; {21278#false} is VALID [2018-11-23 12:27:31,345 INFO L273 TraceCheckUtils]: 157: Hoare triple {21278#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {21278#false} is VALID [2018-11-23 12:27:31,345 INFO L273 TraceCheckUtils]: 158: Hoare triple {21278#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {21278#false} is VALID [2018-11-23 12:27:31,346 INFO L273 TraceCheckUtils]: 159: Hoare triple {21278#false} assume !false; {21278#false} is VALID [2018-11-23 12:27:31,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 364 proven. 81 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2018-11-23 12:27:31,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:31,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 12] total 42 [2018-11-23 12:27:31,382 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2018-11-23 12:27:31,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:31,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:27:31,591 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:31,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:27:31,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:27:31,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:27:31,593 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand 42 states. [2018-11-23 12:27:32,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:32,922 INFO L93 Difference]: Finished difference Result 171 states and 183 transitions. [2018-11-23 12:27:32,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:27:32,922 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2018-11-23 12:27:32,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:32,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:27:32,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 136 transitions. [2018-11-23 12:27:32,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:27:32,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 136 transitions. [2018-11-23 12:27:32,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 136 transitions. [2018-11-23 12:27:33,168 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-23 12:27:33,170 INFO L225 Difference]: With dead ends: 171 [2018-11-23 12:27:33,170 INFO L226 Difference]: Without dead ends: 121 [2018-11-23 12:27:33,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:27:33,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-23 12:27:33,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-11-23 12:27:33,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:33,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 119 states. [2018-11-23 12:27:33,273 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 119 states. [2018-11-23 12:27:33,273 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 119 states. [2018-11-23 12:27:33,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:33,275 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-23 12:27:33,276 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-23 12:27:33,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:33,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:33,276 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 121 states. [2018-11-23 12:27:33,276 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 121 states. [2018-11-23 12:27:33,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:33,278 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-23 12:27:33,278 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-23 12:27:33,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:33,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:33,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:33,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:33,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-23 12:27:33,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2018-11-23 12:27:33,281 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 160 [2018-11-23 12:27:33,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:33,282 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2018-11-23 12:27:33,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:27:33,282 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-11-23 12:27:33,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-23 12:27:33,283 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:33,283 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 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-23 12:27:33,283 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:33,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:33,284 INFO L82 PathProgramCache]: Analyzing trace with hash -451694749, now seen corresponding path program 30 times [2018-11-23 12:27:33,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:33,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:33,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:33,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:33,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:34,383 INFO L256 TraceCheckUtils]: 0: Hoare triple {22471#true} call ULTIMATE.init(); {22471#true} is VALID [2018-11-23 12:27:34,383 INFO L273 TraceCheckUtils]: 1: Hoare triple {22471#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22471#true} is VALID [2018-11-23 12:27:34,384 INFO L273 TraceCheckUtils]: 2: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:27:34,384 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22471#true} {22471#true} #66#return; {22471#true} is VALID [2018-11-23 12:27:34,384 INFO L256 TraceCheckUtils]: 4: Hoare triple {22471#true} call #t~ret13 := main(); {22471#true} is VALID [2018-11-23 12:27:34,385 INFO L273 TraceCheckUtils]: 5: Hoare triple {22471#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; {22473#(= main_~i~1 0)} is VALID [2018-11-23 12:27:34,385 INFO L273 TraceCheckUtils]: 6: Hoare triple {22473#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22473#(= main_~i~1 0)} is VALID [2018-11-23 12:27:34,386 INFO L273 TraceCheckUtils]: 7: Hoare triple {22473#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22474#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:34,386 INFO L273 TraceCheckUtils]: 8: Hoare triple {22474#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22474#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:34,387 INFO L273 TraceCheckUtils]: 9: Hoare triple {22474#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22475#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:34,387 INFO L273 TraceCheckUtils]: 10: Hoare triple {22475#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22475#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:34,388 INFO L273 TraceCheckUtils]: 11: Hoare triple {22475#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22476#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:34,388 INFO L273 TraceCheckUtils]: 12: Hoare triple {22476#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22476#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:34,389 INFO L273 TraceCheckUtils]: 13: Hoare triple {22476#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22477#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:34,390 INFO L273 TraceCheckUtils]: 14: Hoare triple {22477#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22477#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:34,391 INFO L273 TraceCheckUtils]: 15: Hoare triple {22477#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22478#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:34,392 INFO L273 TraceCheckUtils]: 16: Hoare triple {22478#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22478#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:34,392 INFO L273 TraceCheckUtils]: 17: Hoare triple {22478#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22479#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:34,393 INFO L273 TraceCheckUtils]: 18: Hoare triple {22479#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22479#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:34,394 INFO L273 TraceCheckUtils]: 19: Hoare triple {22479#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22480#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:34,395 INFO L273 TraceCheckUtils]: 20: Hoare triple {22480#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22480#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:34,396 INFO L273 TraceCheckUtils]: 21: Hoare triple {22480#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22481#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:34,396 INFO L273 TraceCheckUtils]: 22: Hoare triple {22481#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22481#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:34,397 INFO L273 TraceCheckUtils]: 23: Hoare triple {22481#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22482#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:34,398 INFO L273 TraceCheckUtils]: 24: Hoare triple {22482#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22482#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:34,399 INFO L273 TraceCheckUtils]: 25: Hoare triple {22482#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22483#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:34,399 INFO L273 TraceCheckUtils]: 26: Hoare triple {22483#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22483#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:34,400 INFO L273 TraceCheckUtils]: 27: Hoare triple {22483#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22484#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:34,401 INFO L273 TraceCheckUtils]: 28: Hoare triple {22484#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22484#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:34,402 INFO L273 TraceCheckUtils]: 29: Hoare triple {22484#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22485#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:34,402 INFO L273 TraceCheckUtils]: 30: Hoare triple {22485#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22485#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:34,403 INFO L273 TraceCheckUtils]: 31: Hoare triple {22485#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22486#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:34,404 INFO L273 TraceCheckUtils]: 32: Hoare triple {22486#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22486#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:34,405 INFO L273 TraceCheckUtils]: 33: Hoare triple {22486#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22487#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:34,405 INFO L273 TraceCheckUtils]: 34: Hoare triple {22487#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22487#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:34,406 INFO L273 TraceCheckUtils]: 35: Hoare triple {22487#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22488#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:34,407 INFO L273 TraceCheckUtils]: 36: Hoare triple {22488#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22488#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:34,408 INFO L273 TraceCheckUtils]: 37: Hoare triple {22488#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22489#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:34,408 INFO L273 TraceCheckUtils]: 38: Hoare triple {22489#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22489#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:34,409 INFO L273 TraceCheckUtils]: 39: Hoare triple {22489#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22490#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:34,410 INFO L273 TraceCheckUtils]: 40: Hoare triple {22490#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22490#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:34,411 INFO L273 TraceCheckUtils]: 41: Hoare triple {22490#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22491#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:34,411 INFO L273 TraceCheckUtils]: 42: Hoare triple {22491#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22491#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:34,412 INFO L273 TraceCheckUtils]: 43: Hoare triple {22491#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22492#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:34,413 INFO L273 TraceCheckUtils]: 44: Hoare triple {22492#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22492#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:34,414 INFO L273 TraceCheckUtils]: 45: Hoare triple {22492#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22493#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:34,415 INFO L273 TraceCheckUtils]: 46: Hoare triple {22493#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22493#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:34,415 INFO L273 TraceCheckUtils]: 47: Hoare triple {22493#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22494#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:34,416 INFO L273 TraceCheckUtils]: 48: Hoare triple {22494#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22494#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:34,417 INFO L273 TraceCheckUtils]: 49: Hoare triple {22494#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22495#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:34,418 INFO L273 TraceCheckUtils]: 50: Hoare triple {22495#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22495#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:34,418 INFO L273 TraceCheckUtils]: 51: Hoare triple {22495#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22496#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:34,419 INFO L273 TraceCheckUtils]: 52: Hoare triple {22496#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22496#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:34,420 INFO L273 TraceCheckUtils]: 53: Hoare triple {22496#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22497#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:34,421 INFO L273 TraceCheckUtils]: 54: Hoare triple {22497#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22497#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:34,422 INFO L273 TraceCheckUtils]: 55: Hoare triple {22497#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22498#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:34,422 INFO L273 TraceCheckUtils]: 56: Hoare triple {22498#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22498#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:34,423 INFO L273 TraceCheckUtils]: 57: Hoare triple {22498#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22499#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:34,424 INFO L273 TraceCheckUtils]: 58: Hoare triple {22499#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22499#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:34,425 INFO L273 TraceCheckUtils]: 59: Hoare triple {22499#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22500#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:34,425 INFO L273 TraceCheckUtils]: 60: Hoare triple {22500#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22500#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:34,426 INFO L273 TraceCheckUtils]: 61: Hoare triple {22500#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22501#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:34,427 INFO L273 TraceCheckUtils]: 62: Hoare triple {22501#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {22501#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:34,428 INFO L273 TraceCheckUtils]: 63: Hoare triple {22501#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22502#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:34,428 INFO L273 TraceCheckUtils]: 64: Hoare triple {22502#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22502#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:34,429 INFO L273 TraceCheckUtils]: 65: Hoare triple {22502#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22503#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:34,430 INFO L273 TraceCheckUtils]: 66: Hoare triple {22503#(<= main_~i~1 30)} assume !(~i~1 < 10000); {22472#false} is VALID [2018-11-23 12:27:34,430 INFO L256 TraceCheckUtils]: 67: Hoare triple {22472#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {22471#true} is VALID [2018-11-23 12:27:34,430 INFO L273 TraceCheckUtils]: 68: Hoare triple {22471#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22471#true} is VALID [2018-11-23 12:27:34,431 INFO L273 TraceCheckUtils]: 69: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,431 INFO L273 TraceCheckUtils]: 70: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,431 INFO L273 TraceCheckUtils]: 71: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,431 INFO L273 TraceCheckUtils]: 72: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,431 INFO L273 TraceCheckUtils]: 73: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,432 INFO L273 TraceCheckUtils]: 74: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,432 INFO L273 TraceCheckUtils]: 75: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,432 INFO L273 TraceCheckUtils]: 76: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,432 INFO L273 TraceCheckUtils]: 77: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,432 INFO L273 TraceCheckUtils]: 78: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,432 INFO L273 TraceCheckUtils]: 79: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,433 INFO L273 TraceCheckUtils]: 80: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,433 INFO L273 TraceCheckUtils]: 81: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,433 INFO L273 TraceCheckUtils]: 82: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,433 INFO L273 TraceCheckUtils]: 83: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,433 INFO L273 TraceCheckUtils]: 84: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,433 INFO L273 TraceCheckUtils]: 85: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,434 INFO L273 TraceCheckUtils]: 86: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,434 INFO L273 TraceCheckUtils]: 87: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,434 INFO L273 TraceCheckUtils]: 88: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,434 INFO L273 TraceCheckUtils]: 89: Hoare triple {22471#true} assume !(~i~0 < 10000); {22471#true} is VALID [2018-11-23 12:27:34,434 INFO L273 TraceCheckUtils]: 90: Hoare triple {22471#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22471#true} is VALID [2018-11-23 12:27:34,434 INFO L273 TraceCheckUtils]: 91: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:27:34,434 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {22471#true} {22472#false} #70#return; {22472#false} is VALID [2018-11-23 12:27:34,434 INFO L273 TraceCheckUtils]: 93: Hoare triple {22472#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {22472#false} is VALID [2018-11-23 12:27:34,434 INFO L256 TraceCheckUtils]: 94: Hoare triple {22472#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {22471#true} is VALID [2018-11-23 12:27:34,434 INFO L273 TraceCheckUtils]: 95: Hoare triple {22471#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22471#true} is VALID [2018-11-23 12:27:34,435 INFO L273 TraceCheckUtils]: 96: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,435 INFO L273 TraceCheckUtils]: 97: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,435 INFO L273 TraceCheckUtils]: 98: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,435 INFO L273 TraceCheckUtils]: 99: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,435 INFO L273 TraceCheckUtils]: 100: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,435 INFO L273 TraceCheckUtils]: 101: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,435 INFO L273 TraceCheckUtils]: 102: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,435 INFO L273 TraceCheckUtils]: 103: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,435 INFO L273 TraceCheckUtils]: 104: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,436 INFO L273 TraceCheckUtils]: 105: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,436 INFO L273 TraceCheckUtils]: 106: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,436 INFO L273 TraceCheckUtils]: 107: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,436 INFO L273 TraceCheckUtils]: 108: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,436 INFO L273 TraceCheckUtils]: 109: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,436 INFO L273 TraceCheckUtils]: 110: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,436 INFO L273 TraceCheckUtils]: 111: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,436 INFO L273 TraceCheckUtils]: 112: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,436 INFO L273 TraceCheckUtils]: 113: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,436 INFO L273 TraceCheckUtils]: 114: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,437 INFO L273 TraceCheckUtils]: 115: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,437 INFO L273 TraceCheckUtils]: 116: Hoare triple {22471#true} assume !(~i~0 < 10000); {22471#true} is VALID [2018-11-23 12:27:34,437 INFO L273 TraceCheckUtils]: 117: Hoare triple {22471#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22471#true} is VALID [2018-11-23 12:27:34,437 INFO L273 TraceCheckUtils]: 118: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:27:34,437 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {22471#true} {22472#false} #72#return; {22472#false} is VALID [2018-11-23 12:27:34,437 INFO L273 TraceCheckUtils]: 120: Hoare triple {22472#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {22472#false} is VALID [2018-11-23 12:27:34,437 INFO L273 TraceCheckUtils]: 121: Hoare triple {22472#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22472#false} is VALID [2018-11-23 12:27:34,437 INFO L273 TraceCheckUtils]: 122: Hoare triple {22472#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22472#false} is VALID [2018-11-23 12:27:34,437 INFO L273 TraceCheckUtils]: 123: Hoare triple {22472#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22472#false} is VALID [2018-11-23 12:27:34,437 INFO L273 TraceCheckUtils]: 124: Hoare triple {22472#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22472#false} is VALID [2018-11-23 12:27:34,438 INFO L273 TraceCheckUtils]: 125: Hoare triple {22472#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22472#false} is VALID [2018-11-23 12:27:34,438 INFO L273 TraceCheckUtils]: 126: Hoare triple {22472#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22472#false} is VALID [2018-11-23 12:27:34,438 INFO L273 TraceCheckUtils]: 127: Hoare triple {22472#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22472#false} is VALID [2018-11-23 12:27:34,438 INFO L273 TraceCheckUtils]: 128: Hoare triple {22472#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22472#false} is VALID [2018-11-23 12:27:34,438 INFO L273 TraceCheckUtils]: 129: Hoare triple {22472#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22472#false} is VALID [2018-11-23 12:27:34,438 INFO L273 TraceCheckUtils]: 130: Hoare triple {22472#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22472#false} is VALID [2018-11-23 12:27:34,438 INFO L273 TraceCheckUtils]: 131: Hoare triple {22472#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22472#false} is VALID [2018-11-23 12:27:34,438 INFO L273 TraceCheckUtils]: 132: Hoare triple {22472#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22472#false} is VALID [2018-11-23 12:27:34,438 INFO L273 TraceCheckUtils]: 133: Hoare triple {22472#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22472#false} is VALID [2018-11-23 12:27:34,439 INFO L273 TraceCheckUtils]: 134: Hoare triple {22472#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22472#false} is VALID [2018-11-23 12:27:34,439 INFO L273 TraceCheckUtils]: 135: Hoare triple {22472#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22472#false} is VALID [2018-11-23 12:27:34,439 INFO L273 TraceCheckUtils]: 136: Hoare triple {22472#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22472#false} is VALID [2018-11-23 12:27:34,439 INFO L273 TraceCheckUtils]: 137: Hoare triple {22472#false} assume !(~i~2 < 9999); {22472#false} is VALID [2018-11-23 12:27:34,439 INFO L273 TraceCheckUtils]: 138: Hoare triple {22472#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {22472#false} is VALID [2018-11-23 12:27:34,439 INFO L256 TraceCheckUtils]: 139: Hoare triple {22472#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {22471#true} is VALID [2018-11-23 12:27:34,439 INFO L273 TraceCheckUtils]: 140: Hoare triple {22471#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22471#true} is VALID [2018-11-23 12:27:34,439 INFO L273 TraceCheckUtils]: 141: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,439 INFO L273 TraceCheckUtils]: 142: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,439 INFO L273 TraceCheckUtils]: 143: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,440 INFO L273 TraceCheckUtils]: 144: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,440 INFO L273 TraceCheckUtils]: 145: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,440 INFO L273 TraceCheckUtils]: 146: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,440 INFO L273 TraceCheckUtils]: 147: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,440 INFO L273 TraceCheckUtils]: 148: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,440 INFO L273 TraceCheckUtils]: 149: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,440 INFO L273 TraceCheckUtils]: 150: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,440 INFO L273 TraceCheckUtils]: 151: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,440 INFO L273 TraceCheckUtils]: 152: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,441 INFO L273 TraceCheckUtils]: 153: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,441 INFO L273 TraceCheckUtils]: 154: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,441 INFO L273 TraceCheckUtils]: 155: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,441 INFO L273 TraceCheckUtils]: 156: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,441 INFO L273 TraceCheckUtils]: 157: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,441 INFO L273 TraceCheckUtils]: 158: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,441 INFO L273 TraceCheckUtils]: 159: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:34,441 INFO L273 TraceCheckUtils]: 160: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:34,441 INFO L273 TraceCheckUtils]: 161: Hoare triple {22471#true} assume !(~i~0 < 10000); {22471#true} is VALID [2018-11-23 12:27:34,441 INFO L273 TraceCheckUtils]: 162: Hoare triple {22471#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22471#true} is VALID [2018-11-23 12:27:34,442 INFO L273 TraceCheckUtils]: 163: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:27:34,442 INFO L268 TraceCheckUtils]: 164: Hoare quadruple {22471#true} {22472#false} #74#return; {22472#false} is VALID [2018-11-23 12:27:34,442 INFO L273 TraceCheckUtils]: 165: Hoare triple {22472#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {22472#false} is VALID [2018-11-23 12:27:34,442 INFO L273 TraceCheckUtils]: 166: Hoare triple {22472#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {22472#false} is VALID [2018-11-23 12:27:34,442 INFO L273 TraceCheckUtils]: 167: Hoare triple {22472#false} assume !false; {22472#false} is VALID [2018-11-23 12:27:34,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1939 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1039 trivial. 0 not checked. [2018-11-23 12:27:34,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:34,456 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:34,465 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:27:37,372 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 12:27:37,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:37,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:38,220 INFO L256 TraceCheckUtils]: 0: Hoare triple {22471#true} call ULTIMATE.init(); {22471#true} is VALID [2018-11-23 12:27:38,220 INFO L273 TraceCheckUtils]: 1: Hoare triple {22471#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22471#true} is VALID [2018-11-23 12:27:38,221 INFO L273 TraceCheckUtils]: 2: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:27:38,221 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22471#true} {22471#true} #66#return; {22471#true} is VALID [2018-11-23 12:27:38,221 INFO L256 TraceCheckUtils]: 4: Hoare triple {22471#true} call #t~ret13 := main(); {22471#true} is VALID [2018-11-23 12:27:38,221 INFO L273 TraceCheckUtils]: 5: Hoare triple {22471#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; {22471#true} is VALID [2018-11-23 12:27:38,221 INFO L273 TraceCheckUtils]: 6: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,222 INFO L273 TraceCheckUtils]: 7: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,222 INFO L273 TraceCheckUtils]: 8: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,222 INFO L273 TraceCheckUtils]: 9: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,222 INFO L273 TraceCheckUtils]: 10: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,222 INFO L273 TraceCheckUtils]: 11: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,222 INFO L273 TraceCheckUtils]: 12: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,223 INFO L273 TraceCheckUtils]: 13: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,223 INFO L273 TraceCheckUtils]: 14: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,223 INFO L273 TraceCheckUtils]: 15: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,223 INFO L273 TraceCheckUtils]: 16: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,223 INFO L273 TraceCheckUtils]: 17: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,223 INFO L273 TraceCheckUtils]: 18: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,223 INFO L273 TraceCheckUtils]: 19: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,224 INFO L273 TraceCheckUtils]: 20: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,224 INFO L273 TraceCheckUtils]: 21: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,224 INFO L273 TraceCheckUtils]: 22: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,224 INFO L273 TraceCheckUtils]: 23: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,224 INFO L273 TraceCheckUtils]: 24: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,224 INFO L273 TraceCheckUtils]: 25: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,225 INFO L273 TraceCheckUtils]: 26: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,225 INFO L273 TraceCheckUtils]: 27: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,225 INFO L273 TraceCheckUtils]: 28: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,225 INFO L273 TraceCheckUtils]: 29: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,225 INFO L273 TraceCheckUtils]: 30: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,225 INFO L273 TraceCheckUtils]: 31: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,225 INFO L273 TraceCheckUtils]: 32: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,226 INFO L273 TraceCheckUtils]: 33: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,226 INFO L273 TraceCheckUtils]: 34: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,226 INFO L273 TraceCheckUtils]: 35: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,226 INFO L273 TraceCheckUtils]: 36: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,226 INFO L273 TraceCheckUtils]: 37: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,226 INFO L273 TraceCheckUtils]: 38: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,226 INFO L273 TraceCheckUtils]: 39: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,227 INFO L273 TraceCheckUtils]: 40: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,227 INFO L273 TraceCheckUtils]: 41: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,227 INFO L273 TraceCheckUtils]: 42: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,227 INFO L273 TraceCheckUtils]: 43: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,227 INFO L273 TraceCheckUtils]: 44: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,227 INFO L273 TraceCheckUtils]: 45: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,228 INFO L273 TraceCheckUtils]: 46: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,228 INFO L273 TraceCheckUtils]: 47: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,228 INFO L273 TraceCheckUtils]: 48: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,228 INFO L273 TraceCheckUtils]: 49: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,228 INFO L273 TraceCheckUtils]: 50: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,228 INFO L273 TraceCheckUtils]: 51: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,228 INFO L273 TraceCheckUtils]: 52: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,229 INFO L273 TraceCheckUtils]: 53: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,229 INFO L273 TraceCheckUtils]: 54: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,229 INFO L273 TraceCheckUtils]: 55: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,229 INFO L273 TraceCheckUtils]: 56: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,229 INFO L273 TraceCheckUtils]: 57: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,229 INFO L273 TraceCheckUtils]: 58: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,229 INFO L273 TraceCheckUtils]: 59: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,230 INFO L273 TraceCheckUtils]: 60: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,230 INFO L273 TraceCheckUtils]: 61: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,230 INFO L273 TraceCheckUtils]: 62: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,230 INFO L273 TraceCheckUtils]: 63: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,230 INFO L273 TraceCheckUtils]: 64: Hoare triple {22471#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:38,230 INFO L273 TraceCheckUtils]: 65: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:38,230 INFO L273 TraceCheckUtils]: 66: Hoare triple {22471#true} assume !(~i~1 < 10000); {22471#true} is VALID [2018-11-23 12:27:38,231 INFO L256 TraceCheckUtils]: 67: Hoare triple {22471#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {22471#true} is VALID [2018-11-23 12:27:38,231 INFO L273 TraceCheckUtils]: 68: Hoare triple {22471#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22471#true} is VALID [2018-11-23 12:27:38,231 INFO L273 TraceCheckUtils]: 69: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:38,231 INFO L273 TraceCheckUtils]: 70: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:38,231 INFO L273 TraceCheckUtils]: 71: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:38,231 INFO L273 TraceCheckUtils]: 72: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:38,232 INFO L273 TraceCheckUtils]: 73: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:38,232 INFO L273 TraceCheckUtils]: 74: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:38,232 INFO L273 TraceCheckUtils]: 75: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:38,232 INFO L273 TraceCheckUtils]: 76: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:38,232 INFO L273 TraceCheckUtils]: 77: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:38,232 INFO L273 TraceCheckUtils]: 78: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:38,232 INFO L273 TraceCheckUtils]: 79: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:38,233 INFO L273 TraceCheckUtils]: 80: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:38,233 INFO L273 TraceCheckUtils]: 81: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:38,233 INFO L273 TraceCheckUtils]: 82: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:38,233 INFO L273 TraceCheckUtils]: 83: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:38,233 INFO L273 TraceCheckUtils]: 84: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:38,233 INFO L273 TraceCheckUtils]: 85: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:38,233 INFO L273 TraceCheckUtils]: 86: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:38,234 INFO L273 TraceCheckUtils]: 87: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:38,234 INFO L273 TraceCheckUtils]: 88: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:38,234 INFO L273 TraceCheckUtils]: 89: Hoare triple {22471#true} assume !(~i~0 < 10000); {22471#true} is VALID [2018-11-23 12:27:38,234 INFO L273 TraceCheckUtils]: 90: Hoare triple {22471#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22471#true} is VALID [2018-11-23 12:27:38,234 INFO L273 TraceCheckUtils]: 91: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:27:38,234 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {22471#true} {22471#true} #70#return; {22471#true} is VALID [2018-11-23 12:27:38,235 INFO L273 TraceCheckUtils]: 93: Hoare triple {22471#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {22471#true} is VALID [2018-11-23 12:27:38,235 INFO L256 TraceCheckUtils]: 94: Hoare triple {22471#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {22471#true} is VALID [2018-11-23 12:27:38,235 INFO L273 TraceCheckUtils]: 95: Hoare triple {22471#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22471#true} is VALID [2018-11-23 12:27:38,235 INFO L273 TraceCheckUtils]: 96: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:38,235 INFO L273 TraceCheckUtils]: 97: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:38,235 INFO L273 TraceCheckUtils]: 98: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:38,235 INFO L273 TraceCheckUtils]: 99: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:38,236 INFO L273 TraceCheckUtils]: 100: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:38,236 INFO L273 TraceCheckUtils]: 101: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:38,236 INFO L273 TraceCheckUtils]: 102: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:38,236 INFO L273 TraceCheckUtils]: 103: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:38,236 INFO L273 TraceCheckUtils]: 104: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:38,236 INFO L273 TraceCheckUtils]: 105: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:38,236 INFO L273 TraceCheckUtils]: 106: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:38,237 INFO L273 TraceCheckUtils]: 107: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:38,237 INFO L273 TraceCheckUtils]: 108: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:38,237 INFO L273 TraceCheckUtils]: 109: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:38,237 INFO L273 TraceCheckUtils]: 110: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:38,237 INFO L273 TraceCheckUtils]: 111: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:38,237 INFO L273 TraceCheckUtils]: 112: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:38,237 INFO L273 TraceCheckUtils]: 113: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:38,238 INFO L273 TraceCheckUtils]: 114: Hoare triple {22471#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:38,238 INFO L273 TraceCheckUtils]: 115: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:38,238 INFO L273 TraceCheckUtils]: 116: Hoare triple {22471#true} assume !(~i~0 < 10000); {22471#true} is VALID [2018-11-23 12:27:38,238 INFO L273 TraceCheckUtils]: 117: Hoare triple {22471#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22471#true} is VALID [2018-11-23 12:27:38,238 INFO L273 TraceCheckUtils]: 118: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:27:38,238 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {22471#true} {22471#true} #72#return; {22471#true} is VALID [2018-11-23 12:27:38,250 INFO L273 TraceCheckUtils]: 120: Hoare triple {22471#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {22867#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:38,251 INFO L273 TraceCheckUtils]: 121: Hoare triple {22867#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22867#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:38,254 INFO L273 TraceCheckUtils]: 122: Hoare triple {22867#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22874#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:38,254 INFO L273 TraceCheckUtils]: 123: Hoare triple {22874#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22874#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:38,256 INFO L273 TraceCheckUtils]: 124: Hoare triple {22874#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22881#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:38,256 INFO L273 TraceCheckUtils]: 125: Hoare triple {22881#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22881#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:38,258 INFO L273 TraceCheckUtils]: 126: Hoare triple {22881#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22888#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:38,258 INFO L273 TraceCheckUtils]: 127: Hoare triple {22888#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22888#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:38,260 INFO L273 TraceCheckUtils]: 128: Hoare triple {22888#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22895#(<= main_~i~2 4)} is VALID [2018-11-23 12:27:38,260 INFO L273 TraceCheckUtils]: 129: Hoare triple {22895#(<= main_~i~2 4)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22895#(<= main_~i~2 4)} is VALID [2018-11-23 12:27:38,262 INFO L273 TraceCheckUtils]: 130: Hoare triple {22895#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22902#(<= main_~i~2 5)} is VALID [2018-11-23 12:27:38,262 INFO L273 TraceCheckUtils]: 131: Hoare triple {22902#(<= main_~i~2 5)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22902#(<= main_~i~2 5)} is VALID [2018-11-23 12:27:38,264 INFO L273 TraceCheckUtils]: 132: Hoare triple {22902#(<= main_~i~2 5)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22909#(<= main_~i~2 6)} is VALID [2018-11-23 12:27:38,264 INFO L273 TraceCheckUtils]: 133: Hoare triple {22909#(<= main_~i~2 6)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22909#(<= main_~i~2 6)} is VALID [2018-11-23 12:27:38,266 INFO L273 TraceCheckUtils]: 134: Hoare triple {22909#(<= main_~i~2 6)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22916#(<= main_~i~2 7)} is VALID [2018-11-23 12:27:38,266 INFO L273 TraceCheckUtils]: 135: Hoare triple {22916#(<= main_~i~2 7)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22916#(<= main_~i~2 7)} is VALID [2018-11-23 12:27:38,268 INFO L273 TraceCheckUtils]: 136: Hoare triple {22916#(<= main_~i~2 7)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22923#(<= main_~i~2 8)} is VALID [2018-11-23 12:27:38,268 INFO L273 TraceCheckUtils]: 137: Hoare triple {22923#(<= main_~i~2 8)} assume !(~i~2 < 9999); {22472#false} is VALID [2018-11-23 12:27:38,268 INFO L273 TraceCheckUtils]: 138: Hoare triple {22472#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {22472#false} is VALID [2018-11-23 12:27:38,268 INFO L256 TraceCheckUtils]: 139: Hoare triple {22472#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {22472#false} is VALID [2018-11-23 12:27:38,269 INFO L273 TraceCheckUtils]: 140: Hoare triple {22472#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22472#false} is VALID [2018-11-23 12:27:38,269 INFO L273 TraceCheckUtils]: 141: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:27:38,269 INFO L273 TraceCheckUtils]: 142: Hoare triple {22472#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22472#false} is VALID [2018-11-23 12:27:38,269 INFO L273 TraceCheckUtils]: 143: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:27:38,269 INFO L273 TraceCheckUtils]: 144: Hoare triple {22472#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22472#false} is VALID [2018-11-23 12:27:38,269 INFO L273 TraceCheckUtils]: 145: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:27:38,269 INFO L273 TraceCheckUtils]: 146: Hoare triple {22472#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22472#false} is VALID [2018-11-23 12:27:38,269 INFO L273 TraceCheckUtils]: 147: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:27:38,269 INFO L273 TraceCheckUtils]: 148: Hoare triple {22472#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22472#false} is VALID [2018-11-23 12:27:38,270 INFO L273 TraceCheckUtils]: 149: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:27:38,270 INFO L273 TraceCheckUtils]: 150: Hoare triple {22472#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22472#false} is VALID [2018-11-23 12:27:38,270 INFO L273 TraceCheckUtils]: 151: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:27:38,270 INFO L273 TraceCheckUtils]: 152: Hoare triple {22472#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22472#false} is VALID [2018-11-23 12:27:38,270 INFO L273 TraceCheckUtils]: 153: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:27:38,270 INFO L273 TraceCheckUtils]: 154: Hoare triple {22472#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22472#false} is VALID [2018-11-23 12:27:38,270 INFO L273 TraceCheckUtils]: 155: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:27:38,270 INFO L273 TraceCheckUtils]: 156: Hoare triple {22472#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22472#false} is VALID [2018-11-23 12:27:38,270 INFO L273 TraceCheckUtils]: 157: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:27:38,270 INFO L273 TraceCheckUtils]: 158: Hoare triple {22472#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22472#false} is VALID [2018-11-23 12:27:38,271 INFO L273 TraceCheckUtils]: 159: Hoare triple {22472#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:27:38,271 INFO L273 TraceCheckUtils]: 160: Hoare triple {22472#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22472#false} is VALID [2018-11-23 12:27:38,271 INFO L273 TraceCheckUtils]: 161: Hoare triple {22472#false} assume !(~i~0 < 10000); {22472#false} is VALID [2018-11-23 12:27:38,271 INFO L273 TraceCheckUtils]: 162: Hoare triple {22472#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22472#false} is VALID [2018-11-23 12:27:38,271 INFO L273 TraceCheckUtils]: 163: Hoare triple {22472#false} assume true; {22472#false} is VALID [2018-11-23 12:27:38,271 INFO L268 TraceCheckUtils]: 164: Hoare quadruple {22472#false} {22472#false} #74#return; {22472#false} is VALID [2018-11-23 12:27:38,271 INFO L273 TraceCheckUtils]: 165: Hoare triple {22472#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {22472#false} is VALID [2018-11-23 12:27:38,271 INFO L273 TraceCheckUtils]: 166: Hoare triple {22472#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {22472#false} is VALID [2018-11-23 12:27:38,271 INFO L273 TraceCheckUtils]: 167: Hoare triple {22472#false} assume !false; {22472#false} is VALID [2018-11-23 12:27:38,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1939 backedges. 450 proven. 64 refuted. 0 times theorem prover too weak. 1425 trivial. 0 not checked. [2018-11-23 12:27:38,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:38,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 11] total 42 [2018-11-23 12:27:38,305 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 168 [2018-11-23 12:27:38,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:38,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:27:38,509 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-23 12:27:38,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:27:38,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:27:38,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:27:38,511 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 42 states. [2018-11-23 12:27:39,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:39,954 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2018-11-23 12:27:39,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:27:39,954 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 168 [2018-11-23 12:27:39,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:39,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:27:39,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 133 transitions. [2018-11-23 12:27:39,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:27:39,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 133 transitions. [2018-11-23 12:27:39,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 133 transitions. [2018-11-23 12:27:40,171 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:40,174 INFO L225 Difference]: With dead ends: 177 [2018-11-23 12:27:40,174 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 12:27:40,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:27:40,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 12:27:40,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-11-23 12:27:40,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:40,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 123 states. [2018-11-23 12:27:40,240 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 123 states. [2018-11-23 12:27:40,240 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 123 states. [2018-11-23 12:27:40,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:40,243 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-11-23 12:27:40,243 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:27:40,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:40,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:40,243 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 125 states. [2018-11-23 12:27:40,244 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 125 states. [2018-11-23 12:27:40,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:40,246 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-11-23 12:27:40,246 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:27:40,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:40,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:40,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:40,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:40,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-23 12:27:40,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2018-11-23 12:27:40,249 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 168 [2018-11-23 12:27:40,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:40,249 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2018-11-23 12:27:40,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:27:40,249 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-23 12:27:40,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-23 12:27:40,251 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:40,251 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 9, 9, 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-23 12:27:40,251 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:40,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:40,251 INFO L82 PathProgramCache]: Analyzing trace with hash 853170883, now seen corresponding path program 31 times [2018-11-23 12:27:40,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:40,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:40,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:40,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:40,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:41,387 INFO L256 TraceCheckUtils]: 0: Hoare triple {23712#true} call ULTIMATE.init(); {23712#true} is VALID [2018-11-23 12:27:41,387 INFO L273 TraceCheckUtils]: 1: Hoare triple {23712#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23712#true} is VALID [2018-11-23 12:27:41,387 INFO L273 TraceCheckUtils]: 2: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:27:41,387 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23712#true} {23712#true} #66#return; {23712#true} is VALID [2018-11-23 12:27:41,388 INFO L256 TraceCheckUtils]: 4: Hoare triple {23712#true} call #t~ret13 := main(); {23712#true} is VALID [2018-11-23 12:27:41,388 INFO L273 TraceCheckUtils]: 5: Hoare triple {23712#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; {23714#(= main_~i~1 0)} is VALID [2018-11-23 12:27:41,389 INFO L273 TraceCheckUtils]: 6: Hoare triple {23714#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23714#(= main_~i~1 0)} is VALID [2018-11-23 12:27:41,390 INFO L273 TraceCheckUtils]: 7: Hoare triple {23714#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23715#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:41,390 INFO L273 TraceCheckUtils]: 8: Hoare triple {23715#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23715#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:41,391 INFO L273 TraceCheckUtils]: 9: Hoare triple {23715#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23716#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:41,392 INFO L273 TraceCheckUtils]: 10: Hoare triple {23716#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23716#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:41,393 INFO L273 TraceCheckUtils]: 11: Hoare triple {23716#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23717#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:41,393 INFO L273 TraceCheckUtils]: 12: Hoare triple {23717#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23717#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:41,394 INFO L273 TraceCheckUtils]: 13: Hoare triple {23717#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23718#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:41,395 INFO L273 TraceCheckUtils]: 14: Hoare triple {23718#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23718#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:41,396 INFO L273 TraceCheckUtils]: 15: Hoare triple {23718#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23719#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:41,397 INFO L273 TraceCheckUtils]: 16: Hoare triple {23719#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23719#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:41,397 INFO L273 TraceCheckUtils]: 17: Hoare triple {23719#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23720#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:41,398 INFO L273 TraceCheckUtils]: 18: Hoare triple {23720#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23720#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:41,399 INFO L273 TraceCheckUtils]: 19: Hoare triple {23720#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23721#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:41,400 INFO L273 TraceCheckUtils]: 20: Hoare triple {23721#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23721#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:41,400 INFO L273 TraceCheckUtils]: 21: Hoare triple {23721#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23722#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:41,401 INFO L273 TraceCheckUtils]: 22: Hoare triple {23722#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23722#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:41,402 INFO L273 TraceCheckUtils]: 23: Hoare triple {23722#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23723#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:41,403 INFO L273 TraceCheckUtils]: 24: Hoare triple {23723#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23723#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:41,404 INFO L273 TraceCheckUtils]: 25: Hoare triple {23723#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23724#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:41,404 INFO L273 TraceCheckUtils]: 26: Hoare triple {23724#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23724#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:41,405 INFO L273 TraceCheckUtils]: 27: Hoare triple {23724#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23725#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:41,406 INFO L273 TraceCheckUtils]: 28: Hoare triple {23725#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23725#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:41,407 INFO L273 TraceCheckUtils]: 29: Hoare triple {23725#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23726#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:41,407 INFO L273 TraceCheckUtils]: 30: Hoare triple {23726#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23726#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:41,408 INFO L273 TraceCheckUtils]: 31: Hoare triple {23726#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23727#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:41,409 INFO L273 TraceCheckUtils]: 32: Hoare triple {23727#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23727#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:41,410 INFO L273 TraceCheckUtils]: 33: Hoare triple {23727#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23728#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:41,410 INFO L273 TraceCheckUtils]: 34: Hoare triple {23728#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23728#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:41,411 INFO L273 TraceCheckUtils]: 35: Hoare triple {23728#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23729#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:41,412 INFO L273 TraceCheckUtils]: 36: Hoare triple {23729#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23729#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:41,413 INFO L273 TraceCheckUtils]: 37: Hoare triple {23729#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23730#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:41,413 INFO L273 TraceCheckUtils]: 38: Hoare triple {23730#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23730#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:41,414 INFO L273 TraceCheckUtils]: 39: Hoare triple {23730#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23731#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:41,415 INFO L273 TraceCheckUtils]: 40: Hoare triple {23731#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23731#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:41,416 INFO L273 TraceCheckUtils]: 41: Hoare triple {23731#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23732#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:41,416 INFO L273 TraceCheckUtils]: 42: Hoare triple {23732#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23732#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:41,417 INFO L273 TraceCheckUtils]: 43: Hoare triple {23732#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23733#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:41,418 INFO L273 TraceCheckUtils]: 44: Hoare triple {23733#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23733#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:41,419 INFO L273 TraceCheckUtils]: 45: Hoare triple {23733#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23734#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:41,420 INFO L273 TraceCheckUtils]: 46: Hoare triple {23734#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23734#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:41,422 INFO L273 TraceCheckUtils]: 47: Hoare triple {23734#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23735#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:41,430 INFO L273 TraceCheckUtils]: 48: Hoare triple {23735#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23735#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:41,431 INFO L273 TraceCheckUtils]: 49: Hoare triple {23735#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23736#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:41,431 INFO L273 TraceCheckUtils]: 50: Hoare triple {23736#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23736#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:41,432 INFO L273 TraceCheckUtils]: 51: Hoare triple {23736#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23737#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:41,432 INFO L273 TraceCheckUtils]: 52: Hoare triple {23737#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23737#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:41,432 INFO L273 TraceCheckUtils]: 53: Hoare triple {23737#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23738#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:41,433 INFO L273 TraceCheckUtils]: 54: Hoare triple {23738#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23738#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:41,434 INFO L273 TraceCheckUtils]: 55: Hoare triple {23738#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23739#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:41,434 INFO L273 TraceCheckUtils]: 56: Hoare triple {23739#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23739#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:41,435 INFO L273 TraceCheckUtils]: 57: Hoare triple {23739#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23740#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:41,436 INFO L273 TraceCheckUtils]: 58: Hoare triple {23740#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23740#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:41,437 INFO L273 TraceCheckUtils]: 59: Hoare triple {23740#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23741#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:41,437 INFO L273 TraceCheckUtils]: 60: Hoare triple {23741#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23741#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:41,438 INFO L273 TraceCheckUtils]: 61: Hoare triple {23741#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23742#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:41,439 INFO L273 TraceCheckUtils]: 62: Hoare triple {23742#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23742#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:41,440 INFO L273 TraceCheckUtils]: 63: Hoare triple {23742#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23743#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:41,440 INFO L273 TraceCheckUtils]: 64: Hoare triple {23743#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23743#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:41,441 INFO L273 TraceCheckUtils]: 65: Hoare triple {23743#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23744#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:41,442 INFO L273 TraceCheckUtils]: 66: Hoare triple {23744#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23744#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:41,443 INFO L273 TraceCheckUtils]: 67: Hoare triple {23744#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23745#(<= main_~i~1 31)} is VALID [2018-11-23 12:27:41,444 INFO L273 TraceCheckUtils]: 68: Hoare triple {23745#(<= main_~i~1 31)} assume !(~i~1 < 10000); {23713#false} is VALID [2018-11-23 12:27:41,444 INFO L256 TraceCheckUtils]: 69: Hoare triple {23713#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {23712#true} is VALID [2018-11-23 12:27:41,444 INFO L273 TraceCheckUtils]: 70: Hoare triple {23712#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23712#true} is VALID [2018-11-23 12:27:41,444 INFO L273 TraceCheckUtils]: 71: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,444 INFO L273 TraceCheckUtils]: 72: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,445 INFO L273 TraceCheckUtils]: 73: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,445 INFO L273 TraceCheckUtils]: 74: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,445 INFO L273 TraceCheckUtils]: 75: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,445 INFO L273 TraceCheckUtils]: 76: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,445 INFO L273 TraceCheckUtils]: 77: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,446 INFO L273 TraceCheckUtils]: 78: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,446 INFO L273 TraceCheckUtils]: 79: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,446 INFO L273 TraceCheckUtils]: 80: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,446 INFO L273 TraceCheckUtils]: 81: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,446 INFO L273 TraceCheckUtils]: 82: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,446 INFO L273 TraceCheckUtils]: 83: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,447 INFO L273 TraceCheckUtils]: 84: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,447 INFO L273 TraceCheckUtils]: 85: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,447 INFO L273 TraceCheckUtils]: 86: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,447 INFO L273 TraceCheckUtils]: 87: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,447 INFO L273 TraceCheckUtils]: 88: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,447 INFO L273 TraceCheckUtils]: 89: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,448 INFO L273 TraceCheckUtils]: 90: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,448 INFO L273 TraceCheckUtils]: 91: Hoare triple {23712#true} assume !(~i~0 < 10000); {23712#true} is VALID [2018-11-23 12:27:41,448 INFO L273 TraceCheckUtils]: 92: Hoare triple {23712#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23712#true} is VALID [2018-11-23 12:27:41,448 INFO L273 TraceCheckUtils]: 93: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:27:41,448 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {23712#true} {23713#false} #70#return; {23713#false} is VALID [2018-11-23 12:27:41,449 INFO L273 TraceCheckUtils]: 95: Hoare triple {23713#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {23713#false} is VALID [2018-11-23 12:27:41,449 INFO L256 TraceCheckUtils]: 96: Hoare triple {23713#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {23712#true} is VALID [2018-11-23 12:27:41,449 INFO L273 TraceCheckUtils]: 97: Hoare triple {23712#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23712#true} is VALID [2018-11-23 12:27:41,449 INFO L273 TraceCheckUtils]: 98: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,449 INFO L273 TraceCheckUtils]: 99: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,449 INFO L273 TraceCheckUtils]: 100: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,450 INFO L273 TraceCheckUtils]: 101: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,450 INFO L273 TraceCheckUtils]: 102: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,450 INFO L273 TraceCheckUtils]: 103: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,450 INFO L273 TraceCheckUtils]: 104: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,450 INFO L273 TraceCheckUtils]: 105: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,450 INFO L273 TraceCheckUtils]: 106: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,450 INFO L273 TraceCheckUtils]: 107: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,450 INFO L273 TraceCheckUtils]: 108: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,450 INFO L273 TraceCheckUtils]: 109: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,451 INFO L273 TraceCheckUtils]: 110: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,451 INFO L273 TraceCheckUtils]: 111: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,451 INFO L273 TraceCheckUtils]: 112: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,451 INFO L273 TraceCheckUtils]: 113: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,451 INFO L273 TraceCheckUtils]: 114: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,451 INFO L273 TraceCheckUtils]: 115: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,451 INFO L273 TraceCheckUtils]: 116: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,451 INFO L273 TraceCheckUtils]: 117: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,451 INFO L273 TraceCheckUtils]: 118: Hoare triple {23712#true} assume !(~i~0 < 10000); {23712#true} is VALID [2018-11-23 12:27:41,451 INFO L273 TraceCheckUtils]: 119: Hoare triple {23712#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23712#true} is VALID [2018-11-23 12:27:41,452 INFO L273 TraceCheckUtils]: 120: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:27:41,452 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {23712#true} {23713#false} #72#return; {23713#false} is VALID [2018-11-23 12:27:41,452 INFO L273 TraceCheckUtils]: 122: Hoare triple {23713#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {23713#false} is VALID [2018-11-23 12:27:41,452 INFO L273 TraceCheckUtils]: 123: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:41,452 INFO L273 TraceCheckUtils]: 124: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:41,452 INFO L273 TraceCheckUtils]: 125: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:41,452 INFO L273 TraceCheckUtils]: 126: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:41,452 INFO L273 TraceCheckUtils]: 127: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:41,452 INFO L273 TraceCheckUtils]: 128: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:41,453 INFO L273 TraceCheckUtils]: 129: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:41,453 INFO L273 TraceCheckUtils]: 130: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:41,453 INFO L273 TraceCheckUtils]: 131: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:41,453 INFO L273 TraceCheckUtils]: 132: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:41,453 INFO L273 TraceCheckUtils]: 133: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:41,453 INFO L273 TraceCheckUtils]: 134: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:41,453 INFO L273 TraceCheckUtils]: 135: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:41,453 INFO L273 TraceCheckUtils]: 136: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:41,453 INFO L273 TraceCheckUtils]: 137: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:41,453 INFO L273 TraceCheckUtils]: 138: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:41,454 INFO L273 TraceCheckUtils]: 139: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:41,454 INFO L273 TraceCheckUtils]: 140: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:41,454 INFO L273 TraceCheckUtils]: 141: Hoare triple {23713#false} assume !(~i~2 < 9999); {23713#false} is VALID [2018-11-23 12:27:41,454 INFO L273 TraceCheckUtils]: 142: Hoare triple {23713#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {23713#false} is VALID [2018-11-23 12:27:41,454 INFO L256 TraceCheckUtils]: 143: Hoare triple {23713#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {23712#true} is VALID [2018-11-23 12:27:41,454 INFO L273 TraceCheckUtils]: 144: Hoare triple {23712#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23712#true} is VALID [2018-11-23 12:27:41,454 INFO L273 TraceCheckUtils]: 145: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,454 INFO L273 TraceCheckUtils]: 146: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,454 INFO L273 TraceCheckUtils]: 147: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,454 INFO L273 TraceCheckUtils]: 148: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,455 INFO L273 TraceCheckUtils]: 149: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,455 INFO L273 TraceCheckUtils]: 150: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,455 INFO L273 TraceCheckUtils]: 151: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,455 INFO L273 TraceCheckUtils]: 152: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,455 INFO L273 TraceCheckUtils]: 153: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,455 INFO L273 TraceCheckUtils]: 154: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,455 INFO L273 TraceCheckUtils]: 155: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,455 INFO L273 TraceCheckUtils]: 156: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,455 INFO L273 TraceCheckUtils]: 157: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,456 INFO L273 TraceCheckUtils]: 158: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,456 INFO L273 TraceCheckUtils]: 159: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,456 INFO L273 TraceCheckUtils]: 160: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,456 INFO L273 TraceCheckUtils]: 161: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,456 INFO L273 TraceCheckUtils]: 162: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,456 INFO L273 TraceCheckUtils]: 163: Hoare triple {23712#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:41,456 INFO L273 TraceCheckUtils]: 164: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:41,456 INFO L273 TraceCheckUtils]: 165: Hoare triple {23712#true} assume !(~i~0 < 10000); {23712#true} is VALID [2018-11-23 12:27:41,456 INFO L273 TraceCheckUtils]: 166: Hoare triple {23712#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23712#true} is VALID [2018-11-23 12:27:41,456 INFO L273 TraceCheckUtils]: 167: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:27:41,457 INFO L268 TraceCheckUtils]: 168: Hoare quadruple {23712#true} {23713#false} #74#return; {23713#false} is VALID [2018-11-23 12:27:41,457 INFO L273 TraceCheckUtils]: 169: Hoare triple {23713#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {23713#false} is VALID [2018-11-23 12:27:41,457 INFO L273 TraceCheckUtils]: 170: Hoare triple {23713#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {23713#false} is VALID [2018-11-23 12:27:41,457 INFO L273 TraceCheckUtils]: 171: Hoare triple {23713#false} assume !false; {23713#false} is VALID [2018-11-23 12:27:41,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-11-23 12:27:41,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:41,471 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:41,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:41,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:42,077 INFO L256 TraceCheckUtils]: 0: Hoare triple {23712#true} call ULTIMATE.init(); {23712#true} is VALID [2018-11-23 12:27:42,078 INFO L273 TraceCheckUtils]: 1: Hoare triple {23712#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23712#true} is VALID [2018-11-23 12:27:42,078 INFO L273 TraceCheckUtils]: 2: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:27:42,078 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23712#true} {23712#true} #66#return; {23712#true} is VALID [2018-11-23 12:27:42,078 INFO L256 TraceCheckUtils]: 4: Hoare triple {23712#true} call #t~ret13 := main(); {23712#true} is VALID [2018-11-23 12:27:42,079 INFO L273 TraceCheckUtils]: 5: Hoare triple {23712#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; {23764#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:42,080 INFO L273 TraceCheckUtils]: 6: Hoare triple {23764#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23764#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:42,080 INFO L273 TraceCheckUtils]: 7: Hoare triple {23764#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23715#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:42,081 INFO L273 TraceCheckUtils]: 8: Hoare triple {23715#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23715#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:42,081 INFO L273 TraceCheckUtils]: 9: Hoare triple {23715#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23716#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:42,082 INFO L273 TraceCheckUtils]: 10: Hoare triple {23716#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23716#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:42,083 INFO L273 TraceCheckUtils]: 11: Hoare triple {23716#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23717#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:42,083 INFO L273 TraceCheckUtils]: 12: Hoare triple {23717#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23717#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:42,084 INFO L273 TraceCheckUtils]: 13: Hoare triple {23717#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23718#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:42,085 INFO L273 TraceCheckUtils]: 14: Hoare triple {23718#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23718#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:42,086 INFO L273 TraceCheckUtils]: 15: Hoare triple {23718#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23719#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:42,086 INFO L273 TraceCheckUtils]: 16: Hoare triple {23719#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23719#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:42,087 INFO L273 TraceCheckUtils]: 17: Hoare triple {23719#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23720#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:42,088 INFO L273 TraceCheckUtils]: 18: Hoare triple {23720#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23720#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:42,089 INFO L273 TraceCheckUtils]: 19: Hoare triple {23720#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23721#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:42,089 INFO L273 TraceCheckUtils]: 20: Hoare triple {23721#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23721#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:42,090 INFO L273 TraceCheckUtils]: 21: Hoare triple {23721#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23722#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:42,091 INFO L273 TraceCheckUtils]: 22: Hoare triple {23722#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23722#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:42,092 INFO L273 TraceCheckUtils]: 23: Hoare triple {23722#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23723#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:42,092 INFO L273 TraceCheckUtils]: 24: Hoare triple {23723#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23723#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:42,093 INFO L273 TraceCheckUtils]: 25: Hoare triple {23723#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23724#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:42,094 INFO L273 TraceCheckUtils]: 26: Hoare triple {23724#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23724#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:42,095 INFO L273 TraceCheckUtils]: 27: Hoare triple {23724#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23725#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:42,096 INFO L273 TraceCheckUtils]: 28: Hoare triple {23725#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23725#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:42,096 INFO L273 TraceCheckUtils]: 29: Hoare triple {23725#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23726#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:42,097 INFO L273 TraceCheckUtils]: 30: Hoare triple {23726#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23726#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:42,098 INFO L273 TraceCheckUtils]: 31: Hoare triple {23726#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23727#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:42,099 INFO L273 TraceCheckUtils]: 32: Hoare triple {23727#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23727#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:42,099 INFO L273 TraceCheckUtils]: 33: Hoare triple {23727#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23728#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:42,100 INFO L273 TraceCheckUtils]: 34: Hoare triple {23728#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23728#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:42,101 INFO L273 TraceCheckUtils]: 35: Hoare triple {23728#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23729#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:42,102 INFO L273 TraceCheckUtils]: 36: Hoare triple {23729#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23729#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:42,102 INFO L273 TraceCheckUtils]: 37: Hoare triple {23729#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23730#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:42,103 INFO L273 TraceCheckUtils]: 38: Hoare triple {23730#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23730#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:42,104 INFO L273 TraceCheckUtils]: 39: Hoare triple {23730#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23731#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:42,105 INFO L273 TraceCheckUtils]: 40: Hoare triple {23731#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23731#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:42,106 INFO L273 TraceCheckUtils]: 41: Hoare triple {23731#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23732#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:42,106 INFO L273 TraceCheckUtils]: 42: Hoare triple {23732#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23732#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:42,107 INFO L273 TraceCheckUtils]: 43: Hoare triple {23732#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23733#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:42,108 INFO L273 TraceCheckUtils]: 44: Hoare triple {23733#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23733#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:42,109 INFO L273 TraceCheckUtils]: 45: Hoare triple {23733#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23734#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:42,109 INFO L273 TraceCheckUtils]: 46: Hoare triple {23734#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23734#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:42,110 INFO L273 TraceCheckUtils]: 47: Hoare triple {23734#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23735#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:42,111 INFO L273 TraceCheckUtils]: 48: Hoare triple {23735#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23735#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:42,112 INFO L273 TraceCheckUtils]: 49: Hoare triple {23735#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23736#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:42,112 INFO L273 TraceCheckUtils]: 50: Hoare triple {23736#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23736#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:42,113 INFO L273 TraceCheckUtils]: 51: Hoare triple {23736#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23737#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:42,114 INFO L273 TraceCheckUtils]: 52: Hoare triple {23737#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23737#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:42,115 INFO L273 TraceCheckUtils]: 53: Hoare triple {23737#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23738#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:42,115 INFO L273 TraceCheckUtils]: 54: Hoare triple {23738#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23738#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:42,116 INFO L273 TraceCheckUtils]: 55: Hoare triple {23738#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23739#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:42,117 INFO L273 TraceCheckUtils]: 56: Hoare triple {23739#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23739#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:42,118 INFO L273 TraceCheckUtils]: 57: Hoare triple {23739#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23740#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:42,118 INFO L273 TraceCheckUtils]: 58: Hoare triple {23740#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23740#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:42,119 INFO L273 TraceCheckUtils]: 59: Hoare triple {23740#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23741#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:42,120 INFO L273 TraceCheckUtils]: 60: Hoare triple {23741#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23741#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:42,121 INFO L273 TraceCheckUtils]: 61: Hoare triple {23741#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23742#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:42,121 INFO L273 TraceCheckUtils]: 62: Hoare triple {23742#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {23742#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:42,122 INFO L273 TraceCheckUtils]: 63: Hoare triple {23742#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23743#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:42,123 INFO L273 TraceCheckUtils]: 64: Hoare triple {23743#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23743#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:42,124 INFO L273 TraceCheckUtils]: 65: Hoare triple {23743#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23744#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:42,124 INFO L273 TraceCheckUtils]: 66: Hoare triple {23744#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23744#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:42,125 INFO L273 TraceCheckUtils]: 67: Hoare triple {23744#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23745#(<= main_~i~1 31)} is VALID [2018-11-23 12:27:42,126 INFO L273 TraceCheckUtils]: 68: Hoare triple {23745#(<= main_~i~1 31)} assume !(~i~1 < 10000); {23713#false} is VALID [2018-11-23 12:27:42,126 INFO L256 TraceCheckUtils]: 69: Hoare triple {23713#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {23713#false} is VALID [2018-11-23 12:27:42,126 INFO L273 TraceCheckUtils]: 70: Hoare triple {23713#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23713#false} is VALID [2018-11-23 12:27:42,127 INFO L273 TraceCheckUtils]: 71: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,127 INFO L273 TraceCheckUtils]: 72: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,127 INFO L273 TraceCheckUtils]: 73: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,127 INFO L273 TraceCheckUtils]: 74: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,127 INFO L273 TraceCheckUtils]: 75: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,128 INFO L273 TraceCheckUtils]: 76: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,128 INFO L273 TraceCheckUtils]: 77: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,128 INFO L273 TraceCheckUtils]: 78: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,128 INFO L273 TraceCheckUtils]: 79: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,128 INFO L273 TraceCheckUtils]: 80: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,128 INFO L273 TraceCheckUtils]: 81: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,129 INFO L273 TraceCheckUtils]: 82: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,129 INFO L273 TraceCheckUtils]: 83: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,129 INFO L273 TraceCheckUtils]: 84: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,129 INFO L273 TraceCheckUtils]: 85: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,129 INFO L273 TraceCheckUtils]: 86: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,129 INFO L273 TraceCheckUtils]: 87: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,129 INFO L273 TraceCheckUtils]: 88: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,129 INFO L273 TraceCheckUtils]: 89: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,130 INFO L273 TraceCheckUtils]: 90: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,130 INFO L273 TraceCheckUtils]: 91: Hoare triple {23713#false} assume !(~i~0 < 10000); {23713#false} is VALID [2018-11-23 12:27:42,130 INFO L273 TraceCheckUtils]: 92: Hoare triple {23713#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23713#false} is VALID [2018-11-23 12:27:42,130 INFO L273 TraceCheckUtils]: 93: Hoare triple {23713#false} assume true; {23713#false} is VALID [2018-11-23 12:27:42,130 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {23713#false} {23713#false} #70#return; {23713#false} is VALID [2018-11-23 12:27:42,130 INFO L273 TraceCheckUtils]: 95: Hoare triple {23713#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {23713#false} is VALID [2018-11-23 12:27:42,130 INFO L256 TraceCheckUtils]: 96: Hoare triple {23713#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {23713#false} is VALID [2018-11-23 12:27:42,130 INFO L273 TraceCheckUtils]: 97: Hoare triple {23713#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23713#false} is VALID [2018-11-23 12:27:42,130 INFO L273 TraceCheckUtils]: 98: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,130 INFO L273 TraceCheckUtils]: 99: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,131 INFO L273 TraceCheckUtils]: 100: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,131 INFO L273 TraceCheckUtils]: 101: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,131 INFO L273 TraceCheckUtils]: 102: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,131 INFO L273 TraceCheckUtils]: 103: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,131 INFO L273 TraceCheckUtils]: 104: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,131 INFO L273 TraceCheckUtils]: 105: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,131 INFO L273 TraceCheckUtils]: 106: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,131 INFO L273 TraceCheckUtils]: 107: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,131 INFO L273 TraceCheckUtils]: 108: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,132 INFO L273 TraceCheckUtils]: 109: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,132 INFO L273 TraceCheckUtils]: 110: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,132 INFO L273 TraceCheckUtils]: 111: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,132 INFO L273 TraceCheckUtils]: 112: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,132 INFO L273 TraceCheckUtils]: 113: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,132 INFO L273 TraceCheckUtils]: 114: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,132 INFO L273 TraceCheckUtils]: 115: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,132 INFO L273 TraceCheckUtils]: 116: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,132 INFO L273 TraceCheckUtils]: 117: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,132 INFO L273 TraceCheckUtils]: 118: Hoare triple {23713#false} assume !(~i~0 < 10000); {23713#false} is VALID [2018-11-23 12:27:42,133 INFO L273 TraceCheckUtils]: 119: Hoare triple {23713#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23713#false} is VALID [2018-11-23 12:27:42,133 INFO L273 TraceCheckUtils]: 120: Hoare triple {23713#false} assume true; {23713#false} is VALID [2018-11-23 12:27:42,133 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {23713#false} {23713#false} #72#return; {23713#false} is VALID [2018-11-23 12:27:42,133 INFO L273 TraceCheckUtils]: 122: Hoare triple {23713#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {23713#false} is VALID [2018-11-23 12:27:42,133 INFO L273 TraceCheckUtils]: 123: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:42,133 INFO L273 TraceCheckUtils]: 124: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:42,133 INFO L273 TraceCheckUtils]: 125: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:42,133 INFO L273 TraceCheckUtils]: 126: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:42,133 INFO L273 TraceCheckUtils]: 127: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:42,133 INFO L273 TraceCheckUtils]: 128: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:42,134 INFO L273 TraceCheckUtils]: 129: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:42,134 INFO L273 TraceCheckUtils]: 130: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:42,134 INFO L273 TraceCheckUtils]: 131: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:42,134 INFO L273 TraceCheckUtils]: 132: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:42,134 INFO L273 TraceCheckUtils]: 133: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:42,134 INFO L273 TraceCheckUtils]: 134: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:42,134 INFO L273 TraceCheckUtils]: 135: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:42,135 INFO L273 TraceCheckUtils]: 136: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:42,135 INFO L273 TraceCheckUtils]: 137: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:42,135 INFO L273 TraceCheckUtils]: 138: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:42,135 INFO L273 TraceCheckUtils]: 139: Hoare triple {23713#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:42,135 INFO L273 TraceCheckUtils]: 140: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:42,135 INFO L273 TraceCheckUtils]: 141: Hoare triple {23713#false} assume !(~i~2 < 9999); {23713#false} is VALID [2018-11-23 12:27:42,136 INFO L273 TraceCheckUtils]: 142: Hoare triple {23713#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {23713#false} is VALID [2018-11-23 12:27:42,136 INFO L256 TraceCheckUtils]: 143: Hoare triple {23713#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {23713#false} is VALID [2018-11-23 12:27:42,136 INFO L273 TraceCheckUtils]: 144: Hoare triple {23713#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23713#false} is VALID [2018-11-23 12:27:42,136 INFO L273 TraceCheckUtils]: 145: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,136 INFO L273 TraceCheckUtils]: 146: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,136 INFO L273 TraceCheckUtils]: 147: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,136 INFO L273 TraceCheckUtils]: 148: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,137 INFO L273 TraceCheckUtils]: 149: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,137 INFO L273 TraceCheckUtils]: 150: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,137 INFO L273 TraceCheckUtils]: 151: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,137 INFO L273 TraceCheckUtils]: 152: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,137 INFO L273 TraceCheckUtils]: 153: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,137 INFO L273 TraceCheckUtils]: 154: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,138 INFO L273 TraceCheckUtils]: 155: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,138 INFO L273 TraceCheckUtils]: 156: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,138 INFO L273 TraceCheckUtils]: 157: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,138 INFO L273 TraceCheckUtils]: 158: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,138 INFO L273 TraceCheckUtils]: 159: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,138 INFO L273 TraceCheckUtils]: 160: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,139 INFO L273 TraceCheckUtils]: 161: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,139 INFO L273 TraceCheckUtils]: 162: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,139 INFO L273 TraceCheckUtils]: 163: Hoare triple {23713#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:42,139 INFO L273 TraceCheckUtils]: 164: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:42,139 INFO L273 TraceCheckUtils]: 165: Hoare triple {23713#false} assume !(~i~0 < 10000); {23713#false} is VALID [2018-11-23 12:27:42,139 INFO L273 TraceCheckUtils]: 166: Hoare triple {23713#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23713#false} is VALID [2018-11-23 12:27:42,139 INFO L273 TraceCheckUtils]: 167: Hoare triple {23713#false} assume true; {23713#false} is VALID [2018-11-23 12:27:42,140 INFO L268 TraceCheckUtils]: 168: Hoare quadruple {23713#false} {23713#false} #74#return; {23713#false} is VALID [2018-11-23 12:27:42,140 INFO L273 TraceCheckUtils]: 169: Hoare triple {23713#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {23713#false} is VALID [2018-11-23 12:27:42,140 INFO L273 TraceCheckUtils]: 170: Hoare triple {23713#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {23713#false} is VALID [2018-11-23 12:27:42,140 INFO L273 TraceCheckUtils]: 171: Hoare triple {23713#false} assume !false; {23713#false} is VALID [2018-11-23 12:27:42,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-11-23 12:27:42,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:42,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-23 12:27:42,189 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 172 [2018-11-23 12:27:42,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:42,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:27:42,509 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-23 12:27:42,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:27:42,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:27:42,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:27:42,510 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 35 states. [2018-11-23 12:27:42,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:42,937 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2018-11-23 12:27:42,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:27:42,938 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 172 [2018-11-23 12:27:42,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:42,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:27:42,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 116 transitions. [2018-11-23 12:27:42,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:27:42,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 116 transitions. [2018-11-23 12:27:42,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 116 transitions. [2018-11-23 12:27:43,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:43,153 INFO L225 Difference]: With dead ends: 180 [2018-11-23 12:27:43,153 INFO L226 Difference]: Without dead ends: 126 [2018-11-23 12:27:43,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:27:43,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-23 12:27:43,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-11-23 12:27:43,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:43,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 125 states. [2018-11-23 12:27:43,358 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 125 states. [2018-11-23 12:27:43,358 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 125 states. [2018-11-23 12:27:43,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:43,360 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-23 12:27:43,360 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-23 12:27:43,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:43,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:43,360 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 126 states. [2018-11-23 12:27:43,360 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 126 states. [2018-11-23 12:27:43,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:43,363 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-23 12:27:43,363 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-23 12:27:43,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:43,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:43,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:43,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:43,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-23 12:27:43,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-11-23 12:27:43,366 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 172 [2018-11-23 12:27:43,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:43,366 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-11-23 12:27:43,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:27:43,366 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:27:43,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-23 12:27:43,367 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:43,367 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 30, 30, 9, 9, 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-23 12:27:43,367 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:43,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:43,368 INFO L82 PathProgramCache]: Analyzing trace with hash -320678875, now seen corresponding path program 32 times [2018-11-23 12:27:43,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:43,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:43,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:43,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:43,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:45,166 INFO L256 TraceCheckUtils]: 0: Hoare triple {24968#true} call ULTIMATE.init(); {24968#true} is VALID [2018-11-23 12:27:45,167 INFO L273 TraceCheckUtils]: 1: Hoare triple {24968#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24968#true} is VALID [2018-11-23 12:27:45,167 INFO L273 TraceCheckUtils]: 2: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:27:45,167 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24968#true} {24968#true} #66#return; {24968#true} is VALID [2018-11-23 12:27:45,167 INFO L256 TraceCheckUtils]: 4: Hoare triple {24968#true} call #t~ret13 := main(); {24968#true} is VALID [2018-11-23 12:27:45,168 INFO L273 TraceCheckUtils]: 5: Hoare triple {24968#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; {24970#(= main_~i~1 0)} is VALID [2018-11-23 12:27:45,169 INFO L273 TraceCheckUtils]: 6: Hoare triple {24970#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24970#(= main_~i~1 0)} is VALID [2018-11-23 12:27:45,169 INFO L273 TraceCheckUtils]: 7: Hoare triple {24970#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24971#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:45,169 INFO L273 TraceCheckUtils]: 8: Hoare triple {24971#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24971#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:45,170 INFO L273 TraceCheckUtils]: 9: Hoare triple {24971#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24972#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:45,170 INFO L273 TraceCheckUtils]: 10: Hoare triple {24972#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24972#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:45,171 INFO L273 TraceCheckUtils]: 11: Hoare triple {24972#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24973#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:45,172 INFO L273 TraceCheckUtils]: 12: Hoare triple {24973#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24973#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:45,173 INFO L273 TraceCheckUtils]: 13: Hoare triple {24973#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24974#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:45,173 INFO L273 TraceCheckUtils]: 14: Hoare triple {24974#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24974#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:45,174 INFO L273 TraceCheckUtils]: 15: Hoare triple {24974#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24975#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:45,175 INFO L273 TraceCheckUtils]: 16: Hoare triple {24975#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24975#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:45,175 INFO L273 TraceCheckUtils]: 17: Hoare triple {24975#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24976#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:45,176 INFO L273 TraceCheckUtils]: 18: Hoare triple {24976#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24976#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:45,177 INFO L273 TraceCheckUtils]: 19: Hoare triple {24976#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24977#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:45,177 INFO L273 TraceCheckUtils]: 20: Hoare triple {24977#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24977#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:45,178 INFO L273 TraceCheckUtils]: 21: Hoare triple {24977#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24978#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:45,179 INFO L273 TraceCheckUtils]: 22: Hoare triple {24978#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24978#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:45,180 INFO L273 TraceCheckUtils]: 23: Hoare triple {24978#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24979#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:45,180 INFO L273 TraceCheckUtils]: 24: Hoare triple {24979#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24979#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:45,181 INFO L273 TraceCheckUtils]: 25: Hoare triple {24979#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24980#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:45,182 INFO L273 TraceCheckUtils]: 26: Hoare triple {24980#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24980#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:45,182 INFO L273 TraceCheckUtils]: 27: Hoare triple {24980#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24981#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:45,183 INFO L273 TraceCheckUtils]: 28: Hoare triple {24981#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24981#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:45,184 INFO L273 TraceCheckUtils]: 29: Hoare triple {24981#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24982#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:45,185 INFO L273 TraceCheckUtils]: 30: Hoare triple {24982#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24982#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:45,185 INFO L273 TraceCheckUtils]: 31: Hoare triple {24982#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24983#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:45,186 INFO L273 TraceCheckUtils]: 32: Hoare triple {24983#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24983#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:45,187 INFO L273 TraceCheckUtils]: 33: Hoare triple {24983#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24984#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:45,188 INFO L273 TraceCheckUtils]: 34: Hoare triple {24984#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24984#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:45,188 INFO L273 TraceCheckUtils]: 35: Hoare triple {24984#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24985#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:45,189 INFO L273 TraceCheckUtils]: 36: Hoare triple {24985#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24985#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:45,190 INFO L273 TraceCheckUtils]: 37: Hoare triple {24985#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24986#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:45,191 INFO L273 TraceCheckUtils]: 38: Hoare triple {24986#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24986#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:45,191 INFO L273 TraceCheckUtils]: 39: Hoare triple {24986#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24987#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:45,192 INFO L273 TraceCheckUtils]: 40: Hoare triple {24987#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24987#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:45,193 INFO L273 TraceCheckUtils]: 41: Hoare triple {24987#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24988#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:45,194 INFO L273 TraceCheckUtils]: 42: Hoare triple {24988#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24988#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:45,195 INFO L273 TraceCheckUtils]: 43: Hoare triple {24988#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24989#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:45,195 INFO L273 TraceCheckUtils]: 44: Hoare triple {24989#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24989#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:45,196 INFO L273 TraceCheckUtils]: 45: Hoare triple {24989#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24990#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:45,197 INFO L273 TraceCheckUtils]: 46: Hoare triple {24990#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24990#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:45,198 INFO L273 TraceCheckUtils]: 47: Hoare triple {24990#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24991#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:45,198 INFO L273 TraceCheckUtils]: 48: Hoare triple {24991#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24991#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:45,199 INFO L273 TraceCheckUtils]: 49: Hoare triple {24991#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24992#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:45,200 INFO L273 TraceCheckUtils]: 50: Hoare triple {24992#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24992#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:45,200 INFO L273 TraceCheckUtils]: 51: Hoare triple {24992#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24993#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:45,201 INFO L273 TraceCheckUtils]: 52: Hoare triple {24993#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24993#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:45,202 INFO L273 TraceCheckUtils]: 53: Hoare triple {24993#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24994#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:45,203 INFO L273 TraceCheckUtils]: 54: Hoare triple {24994#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24994#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:45,203 INFO L273 TraceCheckUtils]: 55: Hoare triple {24994#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24995#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:45,204 INFO L273 TraceCheckUtils]: 56: Hoare triple {24995#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24995#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:45,205 INFO L273 TraceCheckUtils]: 57: Hoare triple {24995#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24996#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:45,205 INFO L273 TraceCheckUtils]: 58: Hoare triple {24996#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24996#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:45,206 INFO L273 TraceCheckUtils]: 59: Hoare triple {24996#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24997#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:45,207 INFO L273 TraceCheckUtils]: 60: Hoare triple {24997#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24997#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:45,208 INFO L273 TraceCheckUtils]: 61: Hoare triple {24997#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24998#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:45,208 INFO L273 TraceCheckUtils]: 62: Hoare triple {24998#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24998#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:45,209 INFO L273 TraceCheckUtils]: 63: Hoare triple {24998#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24999#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:45,210 INFO L273 TraceCheckUtils]: 64: Hoare triple {24999#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24999#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:45,210 INFO L273 TraceCheckUtils]: 65: Hoare triple {24999#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25000#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:45,211 INFO L273 TraceCheckUtils]: 66: Hoare triple {25000#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25000#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:45,212 INFO L273 TraceCheckUtils]: 67: Hoare triple {25000#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25001#(<= main_~i~1 31)} is VALID [2018-11-23 12:27:45,212 INFO L273 TraceCheckUtils]: 68: Hoare triple {25001#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25001#(<= main_~i~1 31)} is VALID [2018-11-23 12:27:45,213 INFO L273 TraceCheckUtils]: 69: Hoare triple {25001#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25002#(<= main_~i~1 32)} is VALID [2018-11-23 12:27:45,214 INFO L273 TraceCheckUtils]: 70: Hoare triple {25002#(<= main_~i~1 32)} assume !(~i~1 < 10000); {24969#false} is VALID [2018-11-23 12:27:45,214 INFO L256 TraceCheckUtils]: 71: Hoare triple {24969#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {24968#true} is VALID [2018-11-23 12:27:45,215 INFO L273 TraceCheckUtils]: 72: Hoare triple {24968#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24968#true} is VALID [2018-11-23 12:27:45,215 INFO L273 TraceCheckUtils]: 73: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,215 INFO L273 TraceCheckUtils]: 74: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,215 INFO L273 TraceCheckUtils]: 75: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,215 INFO L273 TraceCheckUtils]: 76: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,215 INFO L273 TraceCheckUtils]: 77: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,216 INFO L273 TraceCheckUtils]: 78: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,216 INFO L273 TraceCheckUtils]: 79: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,216 INFO L273 TraceCheckUtils]: 80: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,216 INFO L273 TraceCheckUtils]: 81: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,216 INFO L273 TraceCheckUtils]: 82: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,216 INFO L273 TraceCheckUtils]: 83: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,217 INFO L273 TraceCheckUtils]: 84: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,217 INFO L273 TraceCheckUtils]: 85: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,217 INFO L273 TraceCheckUtils]: 86: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,217 INFO L273 TraceCheckUtils]: 87: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,217 INFO L273 TraceCheckUtils]: 88: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,217 INFO L273 TraceCheckUtils]: 89: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,217 INFO L273 TraceCheckUtils]: 90: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,217 INFO L273 TraceCheckUtils]: 91: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,217 INFO L273 TraceCheckUtils]: 92: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,218 INFO L273 TraceCheckUtils]: 93: Hoare triple {24968#true} assume !(~i~0 < 10000); {24968#true} is VALID [2018-11-23 12:27:45,218 INFO L273 TraceCheckUtils]: 94: Hoare triple {24968#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24968#true} is VALID [2018-11-23 12:27:45,218 INFO L273 TraceCheckUtils]: 95: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:27:45,218 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {24968#true} {24969#false} #70#return; {24969#false} is VALID [2018-11-23 12:27:45,218 INFO L273 TraceCheckUtils]: 97: Hoare triple {24969#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {24969#false} is VALID [2018-11-23 12:27:45,218 INFO L256 TraceCheckUtils]: 98: Hoare triple {24969#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {24968#true} is VALID [2018-11-23 12:27:45,218 INFO L273 TraceCheckUtils]: 99: Hoare triple {24968#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24968#true} is VALID [2018-11-23 12:27:45,218 INFO L273 TraceCheckUtils]: 100: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,218 INFO L273 TraceCheckUtils]: 101: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,218 INFO L273 TraceCheckUtils]: 102: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,219 INFO L273 TraceCheckUtils]: 103: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,219 INFO L273 TraceCheckUtils]: 104: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,219 INFO L273 TraceCheckUtils]: 105: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,219 INFO L273 TraceCheckUtils]: 106: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,219 INFO L273 TraceCheckUtils]: 107: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,219 INFO L273 TraceCheckUtils]: 108: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,219 INFO L273 TraceCheckUtils]: 109: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,219 INFO L273 TraceCheckUtils]: 110: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,219 INFO L273 TraceCheckUtils]: 111: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,220 INFO L273 TraceCheckUtils]: 112: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,220 INFO L273 TraceCheckUtils]: 113: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,220 INFO L273 TraceCheckUtils]: 114: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,220 INFO L273 TraceCheckUtils]: 115: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,220 INFO L273 TraceCheckUtils]: 116: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,220 INFO L273 TraceCheckUtils]: 117: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,220 INFO L273 TraceCheckUtils]: 118: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,220 INFO L273 TraceCheckUtils]: 119: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,220 INFO L273 TraceCheckUtils]: 120: Hoare triple {24968#true} assume !(~i~0 < 10000); {24968#true} is VALID [2018-11-23 12:27:45,220 INFO L273 TraceCheckUtils]: 121: Hoare triple {24968#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24968#true} is VALID [2018-11-23 12:27:45,221 INFO L273 TraceCheckUtils]: 122: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:27:45,221 INFO L268 TraceCheckUtils]: 123: Hoare quadruple {24968#true} {24969#false} #72#return; {24969#false} is VALID [2018-11-23 12:27:45,221 INFO L273 TraceCheckUtils]: 124: Hoare triple {24969#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {24969#false} is VALID [2018-11-23 12:27:45,221 INFO L273 TraceCheckUtils]: 125: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:45,221 INFO L273 TraceCheckUtils]: 126: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:45,221 INFO L273 TraceCheckUtils]: 127: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:45,221 INFO L273 TraceCheckUtils]: 128: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:45,221 INFO L273 TraceCheckUtils]: 129: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:45,221 INFO L273 TraceCheckUtils]: 130: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:45,221 INFO L273 TraceCheckUtils]: 131: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:45,222 INFO L273 TraceCheckUtils]: 132: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:45,222 INFO L273 TraceCheckUtils]: 133: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:45,222 INFO L273 TraceCheckUtils]: 134: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:45,222 INFO L273 TraceCheckUtils]: 135: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:45,222 INFO L273 TraceCheckUtils]: 136: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:45,222 INFO L273 TraceCheckUtils]: 137: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:45,222 INFO L273 TraceCheckUtils]: 138: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:45,222 INFO L273 TraceCheckUtils]: 139: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:45,222 INFO L273 TraceCheckUtils]: 140: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:45,222 INFO L273 TraceCheckUtils]: 141: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:45,223 INFO L273 TraceCheckUtils]: 142: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:45,223 INFO L273 TraceCheckUtils]: 143: Hoare triple {24969#false} assume !(~i~2 < 9999); {24969#false} is VALID [2018-11-23 12:27:45,223 INFO L273 TraceCheckUtils]: 144: Hoare triple {24969#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {24969#false} is VALID [2018-11-23 12:27:45,223 INFO L256 TraceCheckUtils]: 145: Hoare triple {24969#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {24968#true} is VALID [2018-11-23 12:27:45,223 INFO L273 TraceCheckUtils]: 146: Hoare triple {24968#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24968#true} is VALID [2018-11-23 12:27:45,223 INFO L273 TraceCheckUtils]: 147: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,223 INFO L273 TraceCheckUtils]: 148: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,223 INFO L273 TraceCheckUtils]: 149: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,223 INFO L273 TraceCheckUtils]: 150: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,223 INFO L273 TraceCheckUtils]: 151: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,224 INFO L273 TraceCheckUtils]: 152: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,224 INFO L273 TraceCheckUtils]: 153: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,224 INFO L273 TraceCheckUtils]: 154: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,224 INFO L273 TraceCheckUtils]: 155: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,224 INFO L273 TraceCheckUtils]: 156: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,224 INFO L273 TraceCheckUtils]: 157: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,224 INFO L273 TraceCheckUtils]: 158: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,224 INFO L273 TraceCheckUtils]: 159: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,224 INFO L273 TraceCheckUtils]: 160: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,224 INFO L273 TraceCheckUtils]: 161: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,225 INFO L273 TraceCheckUtils]: 162: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,225 INFO L273 TraceCheckUtils]: 163: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,225 INFO L273 TraceCheckUtils]: 164: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,225 INFO L273 TraceCheckUtils]: 165: Hoare triple {24968#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:45,225 INFO L273 TraceCheckUtils]: 166: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:45,225 INFO L273 TraceCheckUtils]: 167: Hoare triple {24968#true} assume !(~i~0 < 10000); {24968#true} is VALID [2018-11-23 12:27:45,225 INFO L273 TraceCheckUtils]: 168: Hoare triple {24968#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24968#true} is VALID [2018-11-23 12:27:45,225 INFO L273 TraceCheckUtils]: 169: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:27:45,225 INFO L268 TraceCheckUtils]: 170: Hoare quadruple {24968#true} {24969#false} #74#return; {24969#false} is VALID [2018-11-23 12:27:45,226 INFO L273 TraceCheckUtils]: 171: Hoare triple {24969#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {24969#false} is VALID [2018-11-23 12:27:45,226 INFO L273 TraceCheckUtils]: 172: Hoare triple {24969#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {24969#false} is VALID [2018-11-23 12:27:45,226 INFO L273 TraceCheckUtils]: 173: Hoare triple {24969#false} assume !false; {24969#false} is VALID [2018-11-23 12:27:45,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-11-23 12:27:45,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:45,240 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:45,249 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:27:45,343 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:27:45,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:45,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:45,824 INFO L256 TraceCheckUtils]: 0: Hoare triple {24968#true} call ULTIMATE.init(); {24968#true} is VALID [2018-11-23 12:27:45,824 INFO L273 TraceCheckUtils]: 1: Hoare triple {24968#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24968#true} is VALID [2018-11-23 12:27:45,824 INFO L273 TraceCheckUtils]: 2: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:27:45,824 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24968#true} {24968#true} #66#return; {24968#true} is VALID [2018-11-23 12:27:45,825 INFO L256 TraceCheckUtils]: 4: Hoare triple {24968#true} call #t~ret13 := main(); {24968#true} is VALID [2018-11-23 12:27:45,826 INFO L273 TraceCheckUtils]: 5: Hoare triple {24968#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; {25021#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:45,826 INFO L273 TraceCheckUtils]: 6: Hoare triple {25021#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {25021#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:45,827 INFO L273 TraceCheckUtils]: 7: Hoare triple {25021#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24971#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:45,828 INFO L273 TraceCheckUtils]: 8: Hoare triple {24971#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24971#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:45,829 INFO L273 TraceCheckUtils]: 9: Hoare triple {24971#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24972#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:45,829 INFO L273 TraceCheckUtils]: 10: Hoare triple {24972#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24972#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:45,830 INFO L273 TraceCheckUtils]: 11: Hoare triple {24972#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24973#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:45,831 INFO L273 TraceCheckUtils]: 12: Hoare triple {24973#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24973#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:45,832 INFO L273 TraceCheckUtils]: 13: Hoare triple {24973#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24974#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:45,833 INFO L273 TraceCheckUtils]: 14: Hoare triple {24974#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24974#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:45,833 INFO L273 TraceCheckUtils]: 15: Hoare triple {24974#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24975#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:45,834 INFO L273 TraceCheckUtils]: 16: Hoare triple {24975#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24975#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:45,835 INFO L273 TraceCheckUtils]: 17: Hoare triple {24975#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24976#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:45,836 INFO L273 TraceCheckUtils]: 18: Hoare triple {24976#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24976#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:45,837 INFO L273 TraceCheckUtils]: 19: Hoare triple {24976#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24977#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:45,837 INFO L273 TraceCheckUtils]: 20: Hoare triple {24977#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24977#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:45,838 INFO L273 TraceCheckUtils]: 21: Hoare triple {24977#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24978#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:45,839 INFO L273 TraceCheckUtils]: 22: Hoare triple {24978#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24978#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:45,840 INFO L273 TraceCheckUtils]: 23: Hoare triple {24978#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24979#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:45,840 INFO L273 TraceCheckUtils]: 24: Hoare triple {24979#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24979#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:45,841 INFO L273 TraceCheckUtils]: 25: Hoare triple {24979#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24980#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:45,842 INFO L273 TraceCheckUtils]: 26: Hoare triple {24980#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24980#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:45,843 INFO L273 TraceCheckUtils]: 27: Hoare triple {24980#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24981#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:45,844 INFO L273 TraceCheckUtils]: 28: Hoare triple {24981#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24981#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:45,845 INFO L273 TraceCheckUtils]: 29: Hoare triple {24981#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24982#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:45,845 INFO L273 TraceCheckUtils]: 30: Hoare triple {24982#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24982#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:45,846 INFO L273 TraceCheckUtils]: 31: Hoare triple {24982#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24983#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:45,847 INFO L273 TraceCheckUtils]: 32: Hoare triple {24983#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24983#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:45,848 INFO L273 TraceCheckUtils]: 33: Hoare triple {24983#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24984#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:45,848 INFO L273 TraceCheckUtils]: 34: Hoare triple {24984#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24984#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:45,849 INFO L273 TraceCheckUtils]: 35: Hoare triple {24984#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24985#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:45,850 INFO L273 TraceCheckUtils]: 36: Hoare triple {24985#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24985#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:45,851 INFO L273 TraceCheckUtils]: 37: Hoare triple {24985#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24986#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:45,851 INFO L273 TraceCheckUtils]: 38: Hoare triple {24986#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24986#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:45,852 INFO L273 TraceCheckUtils]: 39: Hoare triple {24986#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24987#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:45,853 INFO L273 TraceCheckUtils]: 40: Hoare triple {24987#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24987#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:45,854 INFO L273 TraceCheckUtils]: 41: Hoare triple {24987#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24988#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:45,855 INFO L273 TraceCheckUtils]: 42: Hoare triple {24988#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24988#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:45,855 INFO L273 TraceCheckUtils]: 43: Hoare triple {24988#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24989#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:45,856 INFO L273 TraceCheckUtils]: 44: Hoare triple {24989#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24989#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:45,857 INFO L273 TraceCheckUtils]: 45: Hoare triple {24989#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24990#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:45,858 INFO L273 TraceCheckUtils]: 46: Hoare triple {24990#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24990#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:45,858 INFO L273 TraceCheckUtils]: 47: Hoare triple {24990#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24991#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:45,859 INFO L273 TraceCheckUtils]: 48: Hoare triple {24991#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24991#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:45,860 INFO L273 TraceCheckUtils]: 49: Hoare triple {24991#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24992#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:45,861 INFO L273 TraceCheckUtils]: 50: Hoare triple {24992#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24992#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:45,861 INFO L273 TraceCheckUtils]: 51: Hoare triple {24992#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24993#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:45,862 INFO L273 TraceCheckUtils]: 52: Hoare triple {24993#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24993#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:45,863 INFO L273 TraceCheckUtils]: 53: Hoare triple {24993#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24994#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:45,864 INFO L273 TraceCheckUtils]: 54: Hoare triple {24994#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24994#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:45,865 INFO L273 TraceCheckUtils]: 55: Hoare triple {24994#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24995#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:45,865 INFO L273 TraceCheckUtils]: 56: Hoare triple {24995#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24995#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:45,866 INFO L273 TraceCheckUtils]: 57: Hoare triple {24995#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24996#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:45,867 INFO L273 TraceCheckUtils]: 58: Hoare triple {24996#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24996#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:45,868 INFO L273 TraceCheckUtils]: 59: Hoare triple {24996#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24997#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:45,868 INFO L273 TraceCheckUtils]: 60: Hoare triple {24997#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24997#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:45,869 INFO L273 TraceCheckUtils]: 61: Hoare triple {24997#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24998#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:45,870 INFO L273 TraceCheckUtils]: 62: Hoare triple {24998#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {24998#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:45,871 INFO L273 TraceCheckUtils]: 63: Hoare triple {24998#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24999#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:45,872 INFO L273 TraceCheckUtils]: 64: Hoare triple {24999#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24999#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:45,872 INFO L273 TraceCheckUtils]: 65: Hoare triple {24999#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25000#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:45,873 INFO L273 TraceCheckUtils]: 66: Hoare triple {25000#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25000#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:45,874 INFO L273 TraceCheckUtils]: 67: Hoare triple {25000#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25001#(<= main_~i~1 31)} is VALID [2018-11-23 12:27:45,875 INFO L273 TraceCheckUtils]: 68: Hoare triple {25001#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25001#(<= main_~i~1 31)} is VALID [2018-11-23 12:27:45,876 INFO L273 TraceCheckUtils]: 69: Hoare triple {25001#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25002#(<= main_~i~1 32)} is VALID [2018-11-23 12:27:45,876 INFO L273 TraceCheckUtils]: 70: Hoare triple {25002#(<= main_~i~1 32)} assume !(~i~1 < 10000); {24969#false} is VALID [2018-11-23 12:27:45,877 INFO L256 TraceCheckUtils]: 71: Hoare triple {24969#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {24969#false} is VALID [2018-11-23 12:27:45,877 INFO L273 TraceCheckUtils]: 72: Hoare triple {24969#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24969#false} is VALID [2018-11-23 12:27:45,877 INFO L273 TraceCheckUtils]: 73: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,877 INFO L273 TraceCheckUtils]: 74: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,877 INFO L273 TraceCheckUtils]: 75: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,877 INFO L273 TraceCheckUtils]: 76: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,878 INFO L273 TraceCheckUtils]: 77: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,878 INFO L273 TraceCheckUtils]: 78: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,878 INFO L273 TraceCheckUtils]: 79: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,878 INFO L273 TraceCheckUtils]: 80: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,878 INFO L273 TraceCheckUtils]: 81: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,879 INFO L273 TraceCheckUtils]: 82: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,879 INFO L273 TraceCheckUtils]: 83: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,879 INFO L273 TraceCheckUtils]: 84: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,879 INFO L273 TraceCheckUtils]: 85: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,879 INFO L273 TraceCheckUtils]: 86: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,879 INFO L273 TraceCheckUtils]: 87: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,880 INFO L273 TraceCheckUtils]: 88: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,880 INFO L273 TraceCheckUtils]: 89: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,880 INFO L273 TraceCheckUtils]: 90: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,880 INFO L273 TraceCheckUtils]: 91: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,880 INFO L273 TraceCheckUtils]: 92: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,881 INFO L273 TraceCheckUtils]: 93: Hoare triple {24969#false} assume !(~i~0 < 10000); {24969#false} is VALID [2018-11-23 12:27:45,881 INFO L273 TraceCheckUtils]: 94: Hoare triple {24969#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24969#false} is VALID [2018-11-23 12:27:45,881 INFO L273 TraceCheckUtils]: 95: Hoare triple {24969#false} assume true; {24969#false} is VALID [2018-11-23 12:27:45,881 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {24969#false} {24969#false} #70#return; {24969#false} is VALID [2018-11-23 12:27:45,881 INFO L273 TraceCheckUtils]: 97: Hoare triple {24969#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {24969#false} is VALID [2018-11-23 12:27:45,881 INFO L256 TraceCheckUtils]: 98: Hoare triple {24969#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {24969#false} is VALID [2018-11-23 12:27:45,881 INFO L273 TraceCheckUtils]: 99: Hoare triple {24969#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24969#false} is VALID [2018-11-23 12:27:45,881 INFO L273 TraceCheckUtils]: 100: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,882 INFO L273 TraceCheckUtils]: 101: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,882 INFO L273 TraceCheckUtils]: 102: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,882 INFO L273 TraceCheckUtils]: 103: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,882 INFO L273 TraceCheckUtils]: 104: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,882 INFO L273 TraceCheckUtils]: 105: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,882 INFO L273 TraceCheckUtils]: 106: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,882 INFO L273 TraceCheckUtils]: 107: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,882 INFO L273 TraceCheckUtils]: 108: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,882 INFO L273 TraceCheckUtils]: 109: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,882 INFO L273 TraceCheckUtils]: 110: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,883 INFO L273 TraceCheckUtils]: 111: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,883 INFO L273 TraceCheckUtils]: 112: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,883 INFO L273 TraceCheckUtils]: 113: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,883 INFO L273 TraceCheckUtils]: 114: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,883 INFO L273 TraceCheckUtils]: 115: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,883 INFO L273 TraceCheckUtils]: 116: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,883 INFO L273 TraceCheckUtils]: 117: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,883 INFO L273 TraceCheckUtils]: 118: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,883 INFO L273 TraceCheckUtils]: 119: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,883 INFO L273 TraceCheckUtils]: 120: Hoare triple {24969#false} assume !(~i~0 < 10000); {24969#false} is VALID [2018-11-23 12:27:45,884 INFO L273 TraceCheckUtils]: 121: Hoare triple {24969#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24969#false} is VALID [2018-11-23 12:27:45,884 INFO L273 TraceCheckUtils]: 122: Hoare triple {24969#false} assume true; {24969#false} is VALID [2018-11-23 12:27:45,884 INFO L268 TraceCheckUtils]: 123: Hoare quadruple {24969#false} {24969#false} #72#return; {24969#false} is VALID [2018-11-23 12:27:45,884 INFO L273 TraceCheckUtils]: 124: Hoare triple {24969#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {24969#false} is VALID [2018-11-23 12:27:45,884 INFO L273 TraceCheckUtils]: 125: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:45,884 INFO L273 TraceCheckUtils]: 126: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:45,884 INFO L273 TraceCheckUtils]: 127: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:45,884 INFO L273 TraceCheckUtils]: 128: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:45,884 INFO L273 TraceCheckUtils]: 129: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:45,884 INFO L273 TraceCheckUtils]: 130: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:45,885 INFO L273 TraceCheckUtils]: 131: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:45,885 INFO L273 TraceCheckUtils]: 132: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:45,885 INFO L273 TraceCheckUtils]: 133: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:45,885 INFO L273 TraceCheckUtils]: 134: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:45,885 INFO L273 TraceCheckUtils]: 135: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:45,885 INFO L273 TraceCheckUtils]: 136: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:45,885 INFO L273 TraceCheckUtils]: 137: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:45,885 INFO L273 TraceCheckUtils]: 138: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:45,885 INFO L273 TraceCheckUtils]: 139: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:45,886 INFO L273 TraceCheckUtils]: 140: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:45,886 INFO L273 TraceCheckUtils]: 141: Hoare triple {24969#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:45,886 INFO L273 TraceCheckUtils]: 142: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:45,886 INFO L273 TraceCheckUtils]: 143: Hoare triple {24969#false} assume !(~i~2 < 9999); {24969#false} is VALID [2018-11-23 12:27:45,886 INFO L273 TraceCheckUtils]: 144: Hoare triple {24969#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {24969#false} is VALID [2018-11-23 12:27:45,886 INFO L256 TraceCheckUtils]: 145: Hoare triple {24969#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {24969#false} is VALID [2018-11-23 12:27:45,886 INFO L273 TraceCheckUtils]: 146: Hoare triple {24969#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24969#false} is VALID [2018-11-23 12:27:45,886 INFO L273 TraceCheckUtils]: 147: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,886 INFO L273 TraceCheckUtils]: 148: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,886 INFO L273 TraceCheckUtils]: 149: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,887 INFO L273 TraceCheckUtils]: 150: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,887 INFO L273 TraceCheckUtils]: 151: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,887 INFO L273 TraceCheckUtils]: 152: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,887 INFO L273 TraceCheckUtils]: 153: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,887 INFO L273 TraceCheckUtils]: 154: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,887 INFO L273 TraceCheckUtils]: 155: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,887 INFO L273 TraceCheckUtils]: 156: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,887 INFO L273 TraceCheckUtils]: 157: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,887 INFO L273 TraceCheckUtils]: 158: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,887 INFO L273 TraceCheckUtils]: 159: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,888 INFO L273 TraceCheckUtils]: 160: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,888 INFO L273 TraceCheckUtils]: 161: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,888 INFO L273 TraceCheckUtils]: 162: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,888 INFO L273 TraceCheckUtils]: 163: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,888 INFO L273 TraceCheckUtils]: 164: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,888 INFO L273 TraceCheckUtils]: 165: Hoare triple {24969#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:45,888 INFO L273 TraceCheckUtils]: 166: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:45,888 INFO L273 TraceCheckUtils]: 167: Hoare triple {24969#false} assume !(~i~0 < 10000); {24969#false} is VALID [2018-11-23 12:27:45,888 INFO L273 TraceCheckUtils]: 168: Hoare triple {24969#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24969#false} is VALID [2018-11-23 12:27:45,889 INFO L273 TraceCheckUtils]: 169: Hoare triple {24969#false} assume true; {24969#false} is VALID [2018-11-23 12:27:45,889 INFO L268 TraceCheckUtils]: 170: Hoare quadruple {24969#false} {24969#false} #74#return; {24969#false} is VALID [2018-11-23 12:27:45,889 INFO L273 TraceCheckUtils]: 171: Hoare triple {24969#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {24969#false} is VALID [2018-11-23 12:27:45,889 INFO L273 TraceCheckUtils]: 172: Hoare triple {24969#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {24969#false} is VALID [2018-11-23 12:27:45,889 INFO L273 TraceCheckUtils]: 173: Hoare triple {24969#false} assume !false; {24969#false} is VALID [2018-11-23 12:27:45,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-11-23 12:27:45,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:45,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 12:27:45,924 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2018-11-23 12:27:45,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:45,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 12:27:46,075 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:46,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 12:27:46,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 12:27:46,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:27:46,077 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 36 states. [2018-11-23 12:27:47,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:47,320 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2018-11-23 12:27:47,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:27:47,320 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2018-11-23 12:27:47,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:47,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:27:47,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 118 transitions. [2018-11-23 12:27:47,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:27:47,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 118 transitions. [2018-11-23 12:27:47,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 118 transitions. [2018-11-23 12:27:47,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:47,483 INFO L225 Difference]: With dead ends: 182 [2018-11-23 12:27:47,483 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 12:27:47,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:27:47,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 12:27:47,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2018-11-23 12:27:47,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:47,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 127 states. [2018-11-23 12:27:47,581 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 127 states. [2018-11-23 12:27:47,581 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 127 states. [2018-11-23 12:27:47,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:47,583 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-23 12:27:47,583 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-23 12:27:47,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:47,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:47,584 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 128 states. [2018-11-23 12:27:47,584 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 128 states. [2018-11-23 12:27:47,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:47,586 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-23 12:27:47,586 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-23 12:27:47,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:47,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:47,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:47,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:47,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-23 12:27:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2018-11-23 12:27:47,588 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 174 [2018-11-23 12:27:47,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:47,588 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2018-11-23 12:27:47,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 12:27:47,588 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2018-11-23 12:27:47,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-23 12:27:47,589 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:47,589 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 30, 30, 9, 9, 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-23 12:27:47,589 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:47,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:47,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1186102535, now seen corresponding path program 33 times [2018-11-23 12:27:47,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:47,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:47,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:47,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:47,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:49,542 INFO L256 TraceCheckUtils]: 0: Hoare triple {26241#true} call ULTIMATE.init(); {26241#true} is VALID [2018-11-23 12:27:49,542 INFO L273 TraceCheckUtils]: 1: Hoare triple {26241#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26241#true} is VALID [2018-11-23 12:27:49,543 INFO L273 TraceCheckUtils]: 2: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:27:49,543 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26241#true} {26241#true} #66#return; {26241#true} is VALID [2018-11-23 12:27:49,543 INFO L256 TraceCheckUtils]: 4: Hoare triple {26241#true} call #t~ret13 := main(); {26241#true} is VALID [2018-11-23 12:27:49,544 INFO L273 TraceCheckUtils]: 5: Hoare triple {26241#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; {26243#(= main_~i~1 0)} is VALID [2018-11-23 12:27:49,544 INFO L273 TraceCheckUtils]: 6: Hoare triple {26243#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26243#(= main_~i~1 0)} is VALID [2018-11-23 12:27:49,545 INFO L273 TraceCheckUtils]: 7: Hoare triple {26243#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26244#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:49,546 INFO L273 TraceCheckUtils]: 8: Hoare triple {26244#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26244#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:49,547 INFO L273 TraceCheckUtils]: 9: Hoare triple {26244#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26245#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:49,547 INFO L273 TraceCheckUtils]: 10: Hoare triple {26245#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26245#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:49,548 INFO L273 TraceCheckUtils]: 11: Hoare triple {26245#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26246#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:49,549 INFO L273 TraceCheckUtils]: 12: Hoare triple {26246#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26246#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:49,550 INFO L273 TraceCheckUtils]: 13: Hoare triple {26246#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26247#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:49,550 INFO L273 TraceCheckUtils]: 14: Hoare triple {26247#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26247#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:49,551 INFO L273 TraceCheckUtils]: 15: Hoare triple {26247#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26248#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:49,552 INFO L273 TraceCheckUtils]: 16: Hoare triple {26248#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26248#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:49,553 INFO L273 TraceCheckUtils]: 17: Hoare triple {26248#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26249#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:49,553 INFO L273 TraceCheckUtils]: 18: Hoare triple {26249#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26249#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:49,554 INFO L273 TraceCheckUtils]: 19: Hoare triple {26249#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26250#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:49,555 INFO L273 TraceCheckUtils]: 20: Hoare triple {26250#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26250#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:49,556 INFO L273 TraceCheckUtils]: 21: Hoare triple {26250#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26251#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:49,557 INFO L273 TraceCheckUtils]: 22: Hoare triple {26251#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26251#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:49,557 INFO L273 TraceCheckUtils]: 23: Hoare triple {26251#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26252#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:49,558 INFO L273 TraceCheckUtils]: 24: Hoare triple {26252#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26252#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:49,559 INFO L273 TraceCheckUtils]: 25: Hoare triple {26252#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26253#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:49,560 INFO L273 TraceCheckUtils]: 26: Hoare triple {26253#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26253#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:49,560 INFO L273 TraceCheckUtils]: 27: Hoare triple {26253#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26254#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:49,561 INFO L273 TraceCheckUtils]: 28: Hoare triple {26254#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26254#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:49,562 INFO L273 TraceCheckUtils]: 29: Hoare triple {26254#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26255#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:49,563 INFO L273 TraceCheckUtils]: 30: Hoare triple {26255#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26255#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:49,564 INFO L273 TraceCheckUtils]: 31: Hoare triple {26255#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26256#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:49,564 INFO L273 TraceCheckUtils]: 32: Hoare triple {26256#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26256#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:49,565 INFO L273 TraceCheckUtils]: 33: Hoare triple {26256#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26257#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:49,566 INFO L273 TraceCheckUtils]: 34: Hoare triple {26257#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26257#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:49,567 INFO L273 TraceCheckUtils]: 35: Hoare triple {26257#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26258#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:49,567 INFO L273 TraceCheckUtils]: 36: Hoare triple {26258#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26258#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:49,568 INFO L273 TraceCheckUtils]: 37: Hoare triple {26258#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26259#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:49,569 INFO L273 TraceCheckUtils]: 38: Hoare triple {26259#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26259#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:49,570 INFO L273 TraceCheckUtils]: 39: Hoare triple {26259#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26260#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:49,570 INFO L273 TraceCheckUtils]: 40: Hoare triple {26260#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26260#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:49,571 INFO L273 TraceCheckUtils]: 41: Hoare triple {26260#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26261#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:49,572 INFO L273 TraceCheckUtils]: 42: Hoare triple {26261#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26261#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:49,573 INFO L273 TraceCheckUtils]: 43: Hoare triple {26261#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26262#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:49,573 INFO L273 TraceCheckUtils]: 44: Hoare triple {26262#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26262#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:49,574 INFO L273 TraceCheckUtils]: 45: Hoare triple {26262#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26263#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:49,575 INFO L273 TraceCheckUtils]: 46: Hoare triple {26263#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26263#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:49,576 INFO L273 TraceCheckUtils]: 47: Hoare triple {26263#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26264#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:49,576 INFO L273 TraceCheckUtils]: 48: Hoare triple {26264#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26264#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:49,577 INFO L273 TraceCheckUtils]: 49: Hoare triple {26264#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26265#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:49,578 INFO L273 TraceCheckUtils]: 50: Hoare triple {26265#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26265#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:49,579 INFO L273 TraceCheckUtils]: 51: Hoare triple {26265#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26266#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:49,579 INFO L273 TraceCheckUtils]: 52: Hoare triple {26266#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26266#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:49,580 INFO L273 TraceCheckUtils]: 53: Hoare triple {26266#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26267#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:49,581 INFO L273 TraceCheckUtils]: 54: Hoare triple {26267#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26267#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:49,582 INFO L273 TraceCheckUtils]: 55: Hoare triple {26267#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26268#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:49,583 INFO L273 TraceCheckUtils]: 56: Hoare triple {26268#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26268#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:49,583 INFO L273 TraceCheckUtils]: 57: Hoare triple {26268#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26269#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:49,584 INFO L273 TraceCheckUtils]: 58: Hoare triple {26269#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26269#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:49,585 INFO L273 TraceCheckUtils]: 59: Hoare triple {26269#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26270#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:49,586 INFO L273 TraceCheckUtils]: 60: Hoare triple {26270#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26270#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:49,586 INFO L273 TraceCheckUtils]: 61: Hoare triple {26270#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26271#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:49,587 INFO L273 TraceCheckUtils]: 62: Hoare triple {26271#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {26271#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:49,588 INFO L273 TraceCheckUtils]: 63: Hoare triple {26271#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26272#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:49,589 INFO L273 TraceCheckUtils]: 64: Hoare triple {26272#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26272#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:49,590 INFO L273 TraceCheckUtils]: 65: Hoare triple {26272#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26273#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:49,590 INFO L273 TraceCheckUtils]: 66: Hoare triple {26273#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26273#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:49,591 INFO L273 TraceCheckUtils]: 67: Hoare triple {26273#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26274#(<= main_~i~1 31)} is VALID [2018-11-23 12:27:49,592 INFO L273 TraceCheckUtils]: 68: Hoare triple {26274#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26274#(<= main_~i~1 31)} is VALID [2018-11-23 12:27:49,593 INFO L273 TraceCheckUtils]: 69: Hoare triple {26274#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26275#(<= main_~i~1 32)} is VALID [2018-11-23 12:27:49,593 INFO L273 TraceCheckUtils]: 70: Hoare triple {26275#(<= main_~i~1 32)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26275#(<= main_~i~1 32)} is VALID [2018-11-23 12:27:49,594 INFO L273 TraceCheckUtils]: 71: Hoare triple {26275#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26276#(<= main_~i~1 33)} is VALID [2018-11-23 12:27:49,595 INFO L273 TraceCheckUtils]: 72: Hoare triple {26276#(<= main_~i~1 33)} assume !(~i~1 < 10000); {26242#false} is VALID [2018-11-23 12:27:49,595 INFO L256 TraceCheckUtils]: 73: Hoare triple {26242#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {26241#true} is VALID [2018-11-23 12:27:49,595 INFO L273 TraceCheckUtils]: 74: Hoare triple {26241#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26241#true} is VALID [2018-11-23 12:27:49,595 INFO L273 TraceCheckUtils]: 75: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,596 INFO L273 TraceCheckUtils]: 76: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,596 INFO L273 TraceCheckUtils]: 77: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,596 INFO L273 TraceCheckUtils]: 78: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,596 INFO L273 TraceCheckUtils]: 79: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,596 INFO L273 TraceCheckUtils]: 80: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,597 INFO L273 TraceCheckUtils]: 81: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,597 INFO L273 TraceCheckUtils]: 82: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,597 INFO L273 TraceCheckUtils]: 83: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,597 INFO L273 TraceCheckUtils]: 84: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,597 INFO L273 TraceCheckUtils]: 85: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,597 INFO L273 TraceCheckUtils]: 86: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,598 INFO L273 TraceCheckUtils]: 87: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,598 INFO L273 TraceCheckUtils]: 88: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,598 INFO L273 TraceCheckUtils]: 89: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,598 INFO L273 TraceCheckUtils]: 90: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,598 INFO L273 TraceCheckUtils]: 91: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,599 INFO L273 TraceCheckUtils]: 92: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,599 INFO L273 TraceCheckUtils]: 93: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,599 INFO L273 TraceCheckUtils]: 94: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,599 INFO L273 TraceCheckUtils]: 95: Hoare triple {26241#true} assume !(~i~0 < 10000); {26241#true} is VALID [2018-11-23 12:27:49,599 INFO L273 TraceCheckUtils]: 96: Hoare triple {26241#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26241#true} is VALID [2018-11-23 12:27:49,599 INFO L273 TraceCheckUtils]: 97: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:27:49,600 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {26241#true} {26242#false} #70#return; {26242#false} is VALID [2018-11-23 12:27:49,600 INFO L273 TraceCheckUtils]: 99: Hoare triple {26242#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {26242#false} is VALID [2018-11-23 12:27:49,600 INFO L256 TraceCheckUtils]: 100: Hoare triple {26242#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {26241#true} is VALID [2018-11-23 12:27:49,600 INFO L273 TraceCheckUtils]: 101: Hoare triple {26241#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26241#true} is VALID [2018-11-23 12:27:49,600 INFO L273 TraceCheckUtils]: 102: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,600 INFO L273 TraceCheckUtils]: 103: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,600 INFO L273 TraceCheckUtils]: 104: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,600 INFO L273 TraceCheckUtils]: 105: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,601 INFO L273 TraceCheckUtils]: 106: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,601 INFO L273 TraceCheckUtils]: 107: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,601 INFO L273 TraceCheckUtils]: 108: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,601 INFO L273 TraceCheckUtils]: 109: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,601 INFO L273 TraceCheckUtils]: 110: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,601 INFO L273 TraceCheckUtils]: 111: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,601 INFO L273 TraceCheckUtils]: 112: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,601 INFO L273 TraceCheckUtils]: 113: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,601 INFO L273 TraceCheckUtils]: 114: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,601 INFO L273 TraceCheckUtils]: 115: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,602 INFO L273 TraceCheckUtils]: 116: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,602 INFO L273 TraceCheckUtils]: 117: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,602 INFO L273 TraceCheckUtils]: 118: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,602 INFO L273 TraceCheckUtils]: 119: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,602 INFO L273 TraceCheckUtils]: 120: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,602 INFO L273 TraceCheckUtils]: 121: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,602 INFO L273 TraceCheckUtils]: 122: Hoare triple {26241#true} assume !(~i~0 < 10000); {26241#true} is VALID [2018-11-23 12:27:49,602 INFO L273 TraceCheckUtils]: 123: Hoare triple {26241#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26241#true} is VALID [2018-11-23 12:27:49,602 INFO L273 TraceCheckUtils]: 124: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:27:49,603 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {26241#true} {26242#false} #72#return; {26242#false} is VALID [2018-11-23 12:27:49,603 INFO L273 TraceCheckUtils]: 126: Hoare triple {26242#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {26242#false} is VALID [2018-11-23 12:27:49,603 INFO L273 TraceCheckUtils]: 127: Hoare triple {26242#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26242#false} is VALID [2018-11-23 12:27:49,603 INFO L273 TraceCheckUtils]: 128: Hoare triple {26242#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26242#false} is VALID [2018-11-23 12:27:49,603 INFO L273 TraceCheckUtils]: 129: Hoare triple {26242#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26242#false} is VALID [2018-11-23 12:27:49,603 INFO L273 TraceCheckUtils]: 130: Hoare triple {26242#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26242#false} is VALID [2018-11-23 12:27:49,603 INFO L273 TraceCheckUtils]: 131: Hoare triple {26242#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26242#false} is VALID [2018-11-23 12:27:49,603 INFO L273 TraceCheckUtils]: 132: Hoare triple {26242#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26242#false} is VALID [2018-11-23 12:27:49,603 INFO L273 TraceCheckUtils]: 133: Hoare triple {26242#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26242#false} is VALID [2018-11-23 12:27:49,603 INFO L273 TraceCheckUtils]: 134: Hoare triple {26242#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26242#false} is VALID [2018-11-23 12:27:49,604 INFO L273 TraceCheckUtils]: 135: Hoare triple {26242#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26242#false} is VALID [2018-11-23 12:27:49,604 INFO L273 TraceCheckUtils]: 136: Hoare triple {26242#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26242#false} is VALID [2018-11-23 12:27:49,604 INFO L273 TraceCheckUtils]: 137: Hoare triple {26242#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26242#false} is VALID [2018-11-23 12:27:49,604 INFO L273 TraceCheckUtils]: 138: Hoare triple {26242#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26242#false} is VALID [2018-11-23 12:27:49,604 INFO L273 TraceCheckUtils]: 139: Hoare triple {26242#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26242#false} is VALID [2018-11-23 12:27:49,604 INFO L273 TraceCheckUtils]: 140: Hoare triple {26242#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26242#false} is VALID [2018-11-23 12:27:49,604 INFO L273 TraceCheckUtils]: 141: Hoare triple {26242#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26242#false} is VALID [2018-11-23 12:27:49,604 INFO L273 TraceCheckUtils]: 142: Hoare triple {26242#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26242#false} is VALID [2018-11-23 12:27:49,604 INFO L273 TraceCheckUtils]: 143: Hoare triple {26242#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26242#false} is VALID [2018-11-23 12:27:49,605 INFO L273 TraceCheckUtils]: 144: Hoare triple {26242#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26242#false} is VALID [2018-11-23 12:27:49,605 INFO L273 TraceCheckUtils]: 145: Hoare triple {26242#false} assume !(~i~2 < 9999); {26242#false} is VALID [2018-11-23 12:27:49,605 INFO L273 TraceCheckUtils]: 146: Hoare triple {26242#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {26242#false} is VALID [2018-11-23 12:27:49,605 INFO L256 TraceCheckUtils]: 147: Hoare triple {26242#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {26241#true} is VALID [2018-11-23 12:27:49,605 INFO L273 TraceCheckUtils]: 148: Hoare triple {26241#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26241#true} is VALID [2018-11-23 12:27:49,605 INFO L273 TraceCheckUtils]: 149: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,605 INFO L273 TraceCheckUtils]: 150: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,605 INFO L273 TraceCheckUtils]: 151: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,605 INFO L273 TraceCheckUtils]: 152: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,605 INFO L273 TraceCheckUtils]: 153: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,606 INFO L273 TraceCheckUtils]: 154: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,606 INFO L273 TraceCheckUtils]: 155: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,606 INFO L273 TraceCheckUtils]: 156: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,606 INFO L273 TraceCheckUtils]: 157: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,606 INFO L273 TraceCheckUtils]: 158: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,606 INFO L273 TraceCheckUtils]: 159: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,606 INFO L273 TraceCheckUtils]: 160: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,606 INFO L273 TraceCheckUtils]: 161: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,606 INFO L273 TraceCheckUtils]: 162: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,606 INFO L273 TraceCheckUtils]: 163: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,607 INFO L273 TraceCheckUtils]: 164: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,607 INFO L273 TraceCheckUtils]: 165: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,607 INFO L273 TraceCheckUtils]: 166: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,607 INFO L273 TraceCheckUtils]: 167: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:49,607 INFO L273 TraceCheckUtils]: 168: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:49,607 INFO L273 TraceCheckUtils]: 169: Hoare triple {26241#true} assume !(~i~0 < 10000); {26241#true} is VALID [2018-11-23 12:27:49,607 INFO L273 TraceCheckUtils]: 170: Hoare triple {26241#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26241#true} is VALID [2018-11-23 12:27:49,607 INFO L273 TraceCheckUtils]: 171: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:27:49,607 INFO L268 TraceCheckUtils]: 172: Hoare quadruple {26241#true} {26242#false} #74#return; {26242#false} is VALID [2018-11-23 12:27:49,608 INFO L273 TraceCheckUtils]: 173: Hoare triple {26242#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {26242#false} is VALID [2018-11-23 12:27:49,608 INFO L273 TraceCheckUtils]: 174: Hoare triple {26242#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {26242#false} is VALID [2018-11-23 12:27:49,608 INFO L273 TraceCheckUtils]: 175: Hoare triple {26242#false} assume !false; {26242#false} is VALID [2018-11-23 12:27:49,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-11-23 12:27:49,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:49,623 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:49,632 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:27:49,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 12:27:49,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:49,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:50,683 INFO L256 TraceCheckUtils]: 0: Hoare triple {26241#true} call ULTIMATE.init(); {26241#true} is VALID [2018-11-23 12:27:50,683 INFO L273 TraceCheckUtils]: 1: Hoare triple {26241#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26241#true} is VALID [2018-11-23 12:27:50,683 INFO L273 TraceCheckUtils]: 2: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:27:50,683 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26241#true} {26241#true} #66#return; {26241#true} is VALID [2018-11-23 12:27:50,684 INFO L256 TraceCheckUtils]: 4: Hoare triple {26241#true} call #t~ret13 := main(); {26241#true} is VALID [2018-11-23 12:27:50,684 INFO L273 TraceCheckUtils]: 5: Hoare triple {26241#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; {26241#true} is VALID [2018-11-23 12:27:50,684 INFO L273 TraceCheckUtils]: 6: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,684 INFO L273 TraceCheckUtils]: 7: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,684 INFO L273 TraceCheckUtils]: 8: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,684 INFO L273 TraceCheckUtils]: 9: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,685 INFO L273 TraceCheckUtils]: 10: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,685 INFO L273 TraceCheckUtils]: 11: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,685 INFO L273 TraceCheckUtils]: 12: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,685 INFO L273 TraceCheckUtils]: 13: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,685 INFO L273 TraceCheckUtils]: 14: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,686 INFO L273 TraceCheckUtils]: 15: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,686 INFO L273 TraceCheckUtils]: 16: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,686 INFO L273 TraceCheckUtils]: 17: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,686 INFO L273 TraceCheckUtils]: 18: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,686 INFO L273 TraceCheckUtils]: 19: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,686 INFO L273 TraceCheckUtils]: 20: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,687 INFO L273 TraceCheckUtils]: 21: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,687 INFO L273 TraceCheckUtils]: 22: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,687 INFO L273 TraceCheckUtils]: 23: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,687 INFO L273 TraceCheckUtils]: 24: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,687 INFO L273 TraceCheckUtils]: 25: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,687 INFO L273 TraceCheckUtils]: 26: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,687 INFO L273 TraceCheckUtils]: 27: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,687 INFO L273 TraceCheckUtils]: 28: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,688 INFO L273 TraceCheckUtils]: 29: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,688 INFO L273 TraceCheckUtils]: 30: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,688 INFO L273 TraceCheckUtils]: 31: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,688 INFO L273 TraceCheckUtils]: 32: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,688 INFO L273 TraceCheckUtils]: 33: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,688 INFO L273 TraceCheckUtils]: 34: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,688 INFO L273 TraceCheckUtils]: 35: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,688 INFO L273 TraceCheckUtils]: 36: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,688 INFO L273 TraceCheckUtils]: 37: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,688 INFO L273 TraceCheckUtils]: 38: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,689 INFO L273 TraceCheckUtils]: 39: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,689 INFO L273 TraceCheckUtils]: 40: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,689 INFO L273 TraceCheckUtils]: 41: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,689 INFO L273 TraceCheckUtils]: 42: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,689 INFO L273 TraceCheckUtils]: 43: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,689 INFO L273 TraceCheckUtils]: 44: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,689 INFO L273 TraceCheckUtils]: 45: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,689 INFO L273 TraceCheckUtils]: 46: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,689 INFO L273 TraceCheckUtils]: 47: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,690 INFO L273 TraceCheckUtils]: 48: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,690 INFO L273 TraceCheckUtils]: 49: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,690 INFO L273 TraceCheckUtils]: 50: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,690 INFO L273 TraceCheckUtils]: 51: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,690 INFO L273 TraceCheckUtils]: 52: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,690 INFO L273 TraceCheckUtils]: 53: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,690 INFO L273 TraceCheckUtils]: 54: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,690 INFO L273 TraceCheckUtils]: 55: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,690 INFO L273 TraceCheckUtils]: 56: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,690 INFO L273 TraceCheckUtils]: 57: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,691 INFO L273 TraceCheckUtils]: 58: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,691 INFO L273 TraceCheckUtils]: 59: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,691 INFO L273 TraceCheckUtils]: 60: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,691 INFO L273 TraceCheckUtils]: 61: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,691 INFO L273 TraceCheckUtils]: 62: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,691 INFO L273 TraceCheckUtils]: 63: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,691 INFO L273 TraceCheckUtils]: 64: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,691 INFO L273 TraceCheckUtils]: 65: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,691 INFO L273 TraceCheckUtils]: 66: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,691 INFO L273 TraceCheckUtils]: 67: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,692 INFO L273 TraceCheckUtils]: 68: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,692 INFO L273 TraceCheckUtils]: 69: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,692 INFO L273 TraceCheckUtils]: 70: Hoare triple {26241#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:50,692 INFO L273 TraceCheckUtils]: 71: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:50,692 INFO L273 TraceCheckUtils]: 72: Hoare triple {26241#true} assume !(~i~1 < 10000); {26241#true} is VALID [2018-11-23 12:27:50,692 INFO L256 TraceCheckUtils]: 73: Hoare triple {26241#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {26241#true} is VALID [2018-11-23 12:27:50,692 INFO L273 TraceCheckUtils]: 74: Hoare triple {26241#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26241#true} is VALID [2018-11-23 12:27:50,692 INFO L273 TraceCheckUtils]: 75: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:50,692 INFO L273 TraceCheckUtils]: 76: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:50,693 INFO L273 TraceCheckUtils]: 77: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:50,693 INFO L273 TraceCheckUtils]: 78: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:50,693 INFO L273 TraceCheckUtils]: 79: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:50,693 INFO L273 TraceCheckUtils]: 80: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:50,693 INFO L273 TraceCheckUtils]: 81: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:50,693 INFO L273 TraceCheckUtils]: 82: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:50,693 INFO L273 TraceCheckUtils]: 83: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:50,693 INFO L273 TraceCheckUtils]: 84: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:50,693 INFO L273 TraceCheckUtils]: 85: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:50,693 INFO L273 TraceCheckUtils]: 86: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:50,694 INFO L273 TraceCheckUtils]: 87: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:50,694 INFO L273 TraceCheckUtils]: 88: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:50,694 INFO L273 TraceCheckUtils]: 89: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:50,694 INFO L273 TraceCheckUtils]: 90: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:50,694 INFO L273 TraceCheckUtils]: 91: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:50,694 INFO L273 TraceCheckUtils]: 92: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:50,694 INFO L273 TraceCheckUtils]: 93: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:50,694 INFO L273 TraceCheckUtils]: 94: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:50,694 INFO L273 TraceCheckUtils]: 95: Hoare triple {26241#true} assume !(~i~0 < 10000); {26241#true} is VALID [2018-11-23 12:27:50,694 INFO L273 TraceCheckUtils]: 96: Hoare triple {26241#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26241#true} is VALID [2018-11-23 12:27:50,695 INFO L273 TraceCheckUtils]: 97: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:27:50,695 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {26241#true} {26241#true} #70#return; {26241#true} is VALID [2018-11-23 12:27:50,695 INFO L273 TraceCheckUtils]: 99: Hoare triple {26241#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {26241#true} is VALID [2018-11-23 12:27:50,695 INFO L256 TraceCheckUtils]: 100: Hoare triple {26241#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {26241#true} is VALID [2018-11-23 12:27:50,695 INFO L273 TraceCheckUtils]: 101: Hoare triple {26241#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26241#true} is VALID [2018-11-23 12:27:50,695 INFO L273 TraceCheckUtils]: 102: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:50,695 INFO L273 TraceCheckUtils]: 103: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:50,695 INFO L273 TraceCheckUtils]: 104: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:50,695 INFO L273 TraceCheckUtils]: 105: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:50,695 INFO L273 TraceCheckUtils]: 106: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:50,696 INFO L273 TraceCheckUtils]: 107: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:50,696 INFO L273 TraceCheckUtils]: 108: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:50,696 INFO L273 TraceCheckUtils]: 109: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:50,696 INFO L273 TraceCheckUtils]: 110: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:50,696 INFO L273 TraceCheckUtils]: 111: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:50,696 INFO L273 TraceCheckUtils]: 112: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:50,696 INFO L273 TraceCheckUtils]: 113: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:50,696 INFO L273 TraceCheckUtils]: 114: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:50,696 INFO L273 TraceCheckUtils]: 115: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:50,697 INFO L273 TraceCheckUtils]: 116: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:50,697 INFO L273 TraceCheckUtils]: 117: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:50,697 INFO L273 TraceCheckUtils]: 118: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:50,697 INFO L273 TraceCheckUtils]: 119: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:50,697 INFO L273 TraceCheckUtils]: 120: Hoare triple {26241#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:50,697 INFO L273 TraceCheckUtils]: 121: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:50,697 INFO L273 TraceCheckUtils]: 122: Hoare triple {26241#true} assume !(~i~0 < 10000); {26241#true} is VALID [2018-11-23 12:27:50,697 INFO L273 TraceCheckUtils]: 123: Hoare triple {26241#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26241#true} is VALID [2018-11-23 12:27:50,697 INFO L273 TraceCheckUtils]: 124: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:27:50,697 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {26241#true} {26241#true} #72#return; {26241#true} is VALID [2018-11-23 12:27:50,698 INFO L273 TraceCheckUtils]: 126: Hoare triple {26241#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {26658#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:50,699 INFO L273 TraceCheckUtils]: 127: Hoare triple {26658#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26658#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:50,699 INFO L273 TraceCheckUtils]: 128: Hoare triple {26658#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26665#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:50,700 INFO L273 TraceCheckUtils]: 129: Hoare triple {26665#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26665#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:50,700 INFO L273 TraceCheckUtils]: 130: Hoare triple {26665#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26672#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:50,700 INFO L273 TraceCheckUtils]: 131: Hoare triple {26672#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26672#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:50,701 INFO L273 TraceCheckUtils]: 132: Hoare triple {26672#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26679#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:50,701 INFO L273 TraceCheckUtils]: 133: Hoare triple {26679#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26679#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:50,702 INFO L273 TraceCheckUtils]: 134: Hoare triple {26679#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26686#(<= main_~i~2 4)} is VALID [2018-11-23 12:27:50,702 INFO L273 TraceCheckUtils]: 135: Hoare triple {26686#(<= main_~i~2 4)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26686#(<= main_~i~2 4)} is VALID [2018-11-23 12:27:50,703 INFO L273 TraceCheckUtils]: 136: Hoare triple {26686#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26693#(<= main_~i~2 5)} is VALID [2018-11-23 12:27:50,704 INFO L273 TraceCheckUtils]: 137: Hoare triple {26693#(<= main_~i~2 5)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26693#(<= main_~i~2 5)} is VALID [2018-11-23 12:27:50,705 INFO L273 TraceCheckUtils]: 138: Hoare triple {26693#(<= main_~i~2 5)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26700#(<= main_~i~2 6)} is VALID [2018-11-23 12:27:50,705 INFO L273 TraceCheckUtils]: 139: Hoare triple {26700#(<= main_~i~2 6)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26700#(<= main_~i~2 6)} is VALID [2018-11-23 12:27:50,706 INFO L273 TraceCheckUtils]: 140: Hoare triple {26700#(<= main_~i~2 6)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26707#(<= main_~i~2 7)} is VALID [2018-11-23 12:27:50,707 INFO L273 TraceCheckUtils]: 141: Hoare triple {26707#(<= main_~i~2 7)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26707#(<= main_~i~2 7)} is VALID [2018-11-23 12:27:50,708 INFO L273 TraceCheckUtils]: 142: Hoare triple {26707#(<= main_~i~2 7)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26714#(<= main_~i~2 8)} is VALID [2018-11-23 12:27:50,709 INFO L273 TraceCheckUtils]: 143: Hoare triple {26714#(<= main_~i~2 8)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26714#(<= main_~i~2 8)} is VALID [2018-11-23 12:27:50,709 INFO L273 TraceCheckUtils]: 144: Hoare triple {26714#(<= main_~i~2 8)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26721#(<= main_~i~2 9)} is VALID [2018-11-23 12:27:50,710 INFO L273 TraceCheckUtils]: 145: Hoare triple {26721#(<= main_~i~2 9)} assume !(~i~2 < 9999); {26242#false} is VALID [2018-11-23 12:27:50,710 INFO L273 TraceCheckUtils]: 146: Hoare triple {26242#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {26242#false} is VALID [2018-11-23 12:27:50,711 INFO L256 TraceCheckUtils]: 147: Hoare triple {26242#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {26242#false} is VALID [2018-11-23 12:27:50,711 INFO L273 TraceCheckUtils]: 148: Hoare triple {26242#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26242#false} is VALID [2018-11-23 12:27:50,711 INFO L273 TraceCheckUtils]: 149: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:27:50,711 INFO L273 TraceCheckUtils]: 150: Hoare triple {26242#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26242#false} is VALID [2018-11-23 12:27:50,711 INFO L273 TraceCheckUtils]: 151: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:27:50,711 INFO L273 TraceCheckUtils]: 152: Hoare triple {26242#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26242#false} is VALID [2018-11-23 12:27:50,712 INFO L273 TraceCheckUtils]: 153: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:27:50,712 INFO L273 TraceCheckUtils]: 154: Hoare triple {26242#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26242#false} is VALID [2018-11-23 12:27:50,712 INFO L273 TraceCheckUtils]: 155: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:27:50,712 INFO L273 TraceCheckUtils]: 156: Hoare triple {26242#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26242#false} is VALID [2018-11-23 12:27:50,712 INFO L273 TraceCheckUtils]: 157: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:27:50,713 INFO L273 TraceCheckUtils]: 158: Hoare triple {26242#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26242#false} is VALID [2018-11-23 12:27:50,713 INFO L273 TraceCheckUtils]: 159: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:27:50,713 INFO L273 TraceCheckUtils]: 160: Hoare triple {26242#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26242#false} is VALID [2018-11-23 12:27:50,713 INFO L273 TraceCheckUtils]: 161: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:27:50,713 INFO L273 TraceCheckUtils]: 162: Hoare triple {26242#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26242#false} is VALID [2018-11-23 12:27:50,713 INFO L273 TraceCheckUtils]: 163: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:27:50,713 INFO L273 TraceCheckUtils]: 164: Hoare triple {26242#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26242#false} is VALID [2018-11-23 12:27:50,713 INFO L273 TraceCheckUtils]: 165: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:27:50,714 INFO L273 TraceCheckUtils]: 166: Hoare triple {26242#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26242#false} is VALID [2018-11-23 12:27:50,714 INFO L273 TraceCheckUtils]: 167: Hoare triple {26242#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:27:50,714 INFO L273 TraceCheckUtils]: 168: Hoare triple {26242#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26242#false} is VALID [2018-11-23 12:27:50,714 INFO L273 TraceCheckUtils]: 169: Hoare triple {26242#false} assume !(~i~0 < 10000); {26242#false} is VALID [2018-11-23 12:27:50,714 INFO L273 TraceCheckUtils]: 170: Hoare triple {26242#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26242#false} is VALID [2018-11-23 12:27:50,714 INFO L273 TraceCheckUtils]: 171: Hoare triple {26242#false} assume true; {26242#false} is VALID [2018-11-23 12:27:50,714 INFO L268 TraceCheckUtils]: 172: Hoare quadruple {26242#false} {26242#false} #74#return; {26242#false} is VALID [2018-11-23 12:27:50,714 INFO L273 TraceCheckUtils]: 173: Hoare triple {26242#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {26242#false} is VALID [2018-11-23 12:27:50,714 INFO L273 TraceCheckUtils]: 174: Hoare triple {26242#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {26242#false} is VALID [2018-11-23 12:27:50,714 INFO L273 TraceCheckUtils]: 175: Hoare triple {26242#false} assume !false; {26242#false} is VALID [2018-11-23 12:27:50,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 450 proven. 81 refuted. 0 times theorem prover too weak. 1614 trivial. 0 not checked. [2018-11-23 12:27:50,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:50,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 12] total 46 [2018-11-23 12:27:50,747 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2018-11-23 12:27:50,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:50,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-23 12:27:50,927 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:50,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 12:27:50,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 12:27:50,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:27:50,929 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 46 states. [2018-11-23 12:27:52,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:52,501 INFO L93 Difference]: Finished difference Result 187 states and 196 transitions. [2018-11-23 12:27:52,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 12:27:52,501 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2018-11-23 12:27:52,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:52,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:27:52,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 141 transitions. [2018-11-23 12:27:52,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:27:52,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 141 transitions. [2018-11-23 12:27:52,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 141 transitions. [2018-11-23 12:27:52,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:52,700 INFO L225 Difference]: With dead ends: 187 [2018-11-23 12:27:52,700 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 12:27:52,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:27:52,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 12:27:53,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-11-23 12:27:53,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:53,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 131 states. [2018-11-23 12:27:53,098 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 131 states. [2018-11-23 12:27:53,098 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 131 states. [2018-11-23 12:27:53,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:53,101 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-11-23 12:27:53,102 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-23 12:27:53,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:53,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:53,102 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 133 states. [2018-11-23 12:27:53,102 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 133 states. [2018-11-23 12:27:53,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:53,104 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-11-23 12:27:53,104 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-23 12:27:53,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:53,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:53,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:53,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:53,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-23 12:27:53,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2018-11-23 12:27:53,107 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 176 [2018-11-23 12:27:53,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:53,107 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2018-11-23 12:27:53,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 12:27:53,107 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2018-11-23 12:27:53,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-23 12:27:53,108 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:53,108 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 30, 30, 10, 10, 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-23 12:27:53,108 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:53,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:53,108 INFO L82 PathProgramCache]: Analyzing trace with hash 854412647, now seen corresponding path program 34 times [2018-11-23 12:27:53,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:53,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:53,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:53,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:53,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:54,780 INFO L256 TraceCheckUtils]: 0: Hoare triple {27553#true} call ULTIMATE.init(); {27553#true} is VALID [2018-11-23 12:27:54,780 INFO L273 TraceCheckUtils]: 1: Hoare triple {27553#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27553#true} is VALID [2018-11-23 12:27:54,780 INFO L273 TraceCheckUtils]: 2: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:27:54,780 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27553#true} {27553#true} #66#return; {27553#true} is VALID [2018-11-23 12:27:54,781 INFO L256 TraceCheckUtils]: 4: Hoare triple {27553#true} call #t~ret13 := main(); {27553#true} is VALID [2018-11-23 12:27:54,781 INFO L273 TraceCheckUtils]: 5: Hoare triple {27553#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; {27555#(= main_~i~1 0)} is VALID [2018-11-23 12:27:54,782 INFO L273 TraceCheckUtils]: 6: Hoare triple {27555#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27555#(= main_~i~1 0)} is VALID [2018-11-23 12:27:54,783 INFO L273 TraceCheckUtils]: 7: Hoare triple {27555#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27556#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:54,784 INFO L273 TraceCheckUtils]: 8: Hoare triple {27556#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27556#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:54,784 INFO L273 TraceCheckUtils]: 9: Hoare triple {27556#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27557#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:54,785 INFO L273 TraceCheckUtils]: 10: Hoare triple {27557#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27557#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:54,786 INFO L273 TraceCheckUtils]: 11: Hoare triple {27557#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27558#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:54,787 INFO L273 TraceCheckUtils]: 12: Hoare triple {27558#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27558#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:54,787 INFO L273 TraceCheckUtils]: 13: Hoare triple {27558#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27559#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:54,788 INFO L273 TraceCheckUtils]: 14: Hoare triple {27559#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27559#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:54,789 INFO L273 TraceCheckUtils]: 15: Hoare triple {27559#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27560#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:54,790 INFO L273 TraceCheckUtils]: 16: Hoare triple {27560#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27560#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:54,790 INFO L273 TraceCheckUtils]: 17: Hoare triple {27560#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27561#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:54,791 INFO L273 TraceCheckUtils]: 18: Hoare triple {27561#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27561#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:54,792 INFO L273 TraceCheckUtils]: 19: Hoare triple {27561#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27562#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:54,793 INFO L273 TraceCheckUtils]: 20: Hoare triple {27562#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27562#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:54,794 INFO L273 TraceCheckUtils]: 21: Hoare triple {27562#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27563#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:54,794 INFO L273 TraceCheckUtils]: 22: Hoare triple {27563#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27563#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:54,795 INFO L273 TraceCheckUtils]: 23: Hoare triple {27563#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27564#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:54,796 INFO L273 TraceCheckUtils]: 24: Hoare triple {27564#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27564#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:54,797 INFO L273 TraceCheckUtils]: 25: Hoare triple {27564#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27565#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:54,797 INFO L273 TraceCheckUtils]: 26: Hoare triple {27565#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27565#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:54,798 INFO L273 TraceCheckUtils]: 27: Hoare triple {27565#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27566#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:54,799 INFO L273 TraceCheckUtils]: 28: Hoare triple {27566#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27566#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:54,800 INFO L273 TraceCheckUtils]: 29: Hoare triple {27566#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27567#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:54,800 INFO L273 TraceCheckUtils]: 30: Hoare triple {27567#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27567#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:54,801 INFO L273 TraceCheckUtils]: 31: Hoare triple {27567#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27568#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:54,802 INFO L273 TraceCheckUtils]: 32: Hoare triple {27568#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27568#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:54,803 INFO L273 TraceCheckUtils]: 33: Hoare triple {27568#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27569#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:54,803 INFO L273 TraceCheckUtils]: 34: Hoare triple {27569#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27569#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:54,804 INFO L273 TraceCheckUtils]: 35: Hoare triple {27569#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27570#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:54,805 INFO L273 TraceCheckUtils]: 36: Hoare triple {27570#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27570#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:54,806 INFO L273 TraceCheckUtils]: 37: Hoare triple {27570#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27571#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:54,806 INFO L273 TraceCheckUtils]: 38: Hoare triple {27571#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27571#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:54,807 INFO L273 TraceCheckUtils]: 39: Hoare triple {27571#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27572#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:54,808 INFO L273 TraceCheckUtils]: 40: Hoare triple {27572#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27572#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:54,809 INFO L273 TraceCheckUtils]: 41: Hoare triple {27572#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27573#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:54,809 INFO L273 TraceCheckUtils]: 42: Hoare triple {27573#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27573#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:54,810 INFO L273 TraceCheckUtils]: 43: Hoare triple {27573#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27574#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:54,811 INFO L273 TraceCheckUtils]: 44: Hoare triple {27574#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27574#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:54,812 INFO L273 TraceCheckUtils]: 45: Hoare triple {27574#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27575#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:54,812 INFO L273 TraceCheckUtils]: 46: Hoare triple {27575#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27575#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:54,813 INFO L273 TraceCheckUtils]: 47: Hoare triple {27575#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27576#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:54,814 INFO L273 TraceCheckUtils]: 48: Hoare triple {27576#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27576#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:54,815 INFO L273 TraceCheckUtils]: 49: Hoare triple {27576#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27577#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:54,816 INFO L273 TraceCheckUtils]: 50: Hoare triple {27577#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27577#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:54,816 INFO L273 TraceCheckUtils]: 51: Hoare triple {27577#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27578#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:54,817 INFO L273 TraceCheckUtils]: 52: Hoare triple {27578#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27578#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:54,818 INFO L273 TraceCheckUtils]: 53: Hoare triple {27578#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27579#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:54,819 INFO L273 TraceCheckUtils]: 54: Hoare triple {27579#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27579#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:54,819 INFO L273 TraceCheckUtils]: 55: Hoare triple {27579#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27580#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:54,820 INFO L273 TraceCheckUtils]: 56: Hoare triple {27580#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27580#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:54,821 INFO L273 TraceCheckUtils]: 57: Hoare triple {27580#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27581#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:54,822 INFO L273 TraceCheckUtils]: 58: Hoare triple {27581#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27581#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:54,823 INFO L273 TraceCheckUtils]: 59: Hoare triple {27581#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27582#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:54,823 INFO L273 TraceCheckUtils]: 60: Hoare triple {27582#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27582#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:54,824 INFO L273 TraceCheckUtils]: 61: Hoare triple {27582#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27583#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:54,825 INFO L273 TraceCheckUtils]: 62: Hoare triple {27583#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {27583#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:54,826 INFO L273 TraceCheckUtils]: 63: Hoare triple {27583#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27584#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:54,826 INFO L273 TraceCheckUtils]: 64: Hoare triple {27584#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27584#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:54,827 INFO L273 TraceCheckUtils]: 65: Hoare triple {27584#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27585#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:54,828 INFO L273 TraceCheckUtils]: 66: Hoare triple {27585#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27585#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:54,829 INFO L273 TraceCheckUtils]: 67: Hoare triple {27585#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27586#(<= main_~i~1 31)} is VALID [2018-11-23 12:27:54,829 INFO L273 TraceCheckUtils]: 68: Hoare triple {27586#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27586#(<= main_~i~1 31)} is VALID [2018-11-23 12:27:54,830 INFO L273 TraceCheckUtils]: 69: Hoare triple {27586#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27587#(<= main_~i~1 32)} is VALID [2018-11-23 12:27:54,831 INFO L273 TraceCheckUtils]: 70: Hoare triple {27587#(<= main_~i~1 32)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27587#(<= main_~i~1 32)} is VALID [2018-11-23 12:27:54,832 INFO L273 TraceCheckUtils]: 71: Hoare triple {27587#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27588#(<= main_~i~1 33)} is VALID [2018-11-23 12:27:54,832 INFO L273 TraceCheckUtils]: 72: Hoare triple {27588#(<= main_~i~1 33)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27588#(<= main_~i~1 33)} is VALID [2018-11-23 12:27:54,833 INFO L273 TraceCheckUtils]: 73: Hoare triple {27588#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27589#(<= main_~i~1 34)} is VALID [2018-11-23 12:27:54,834 INFO L273 TraceCheckUtils]: 74: Hoare triple {27589#(<= main_~i~1 34)} assume !(~i~1 < 10000); {27554#false} is VALID [2018-11-23 12:27:54,834 INFO L256 TraceCheckUtils]: 75: Hoare triple {27554#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {27553#true} is VALID [2018-11-23 12:27:54,834 INFO L273 TraceCheckUtils]: 76: Hoare triple {27553#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {27553#true} is VALID [2018-11-23 12:27:54,835 INFO L273 TraceCheckUtils]: 77: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,835 INFO L273 TraceCheckUtils]: 78: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,835 INFO L273 TraceCheckUtils]: 79: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,835 INFO L273 TraceCheckUtils]: 80: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,835 INFO L273 TraceCheckUtils]: 81: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,836 INFO L273 TraceCheckUtils]: 82: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,836 INFO L273 TraceCheckUtils]: 83: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,836 INFO L273 TraceCheckUtils]: 84: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,836 INFO L273 TraceCheckUtils]: 85: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,836 INFO L273 TraceCheckUtils]: 86: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,836 INFO L273 TraceCheckUtils]: 87: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,837 INFO L273 TraceCheckUtils]: 88: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,837 INFO L273 TraceCheckUtils]: 89: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,837 INFO L273 TraceCheckUtils]: 90: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,837 INFO L273 TraceCheckUtils]: 91: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,837 INFO L273 TraceCheckUtils]: 92: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,837 INFO L273 TraceCheckUtils]: 93: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,838 INFO L273 TraceCheckUtils]: 94: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,838 INFO L273 TraceCheckUtils]: 95: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,838 INFO L273 TraceCheckUtils]: 96: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,838 INFO L273 TraceCheckUtils]: 97: Hoare triple {27553#true} assume !(~i~0 < 10000); {27553#true} is VALID [2018-11-23 12:27:54,838 INFO L273 TraceCheckUtils]: 98: Hoare triple {27553#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27553#true} is VALID [2018-11-23 12:27:54,838 INFO L273 TraceCheckUtils]: 99: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:27:54,838 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {27553#true} {27554#false} #70#return; {27554#false} is VALID [2018-11-23 12:27:54,838 INFO L273 TraceCheckUtils]: 101: Hoare triple {27554#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {27554#false} is VALID [2018-11-23 12:27:54,839 INFO L256 TraceCheckUtils]: 102: Hoare triple {27554#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {27553#true} is VALID [2018-11-23 12:27:54,839 INFO L273 TraceCheckUtils]: 103: Hoare triple {27553#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {27553#true} is VALID [2018-11-23 12:27:54,839 INFO L273 TraceCheckUtils]: 104: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,839 INFO L273 TraceCheckUtils]: 105: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,839 INFO L273 TraceCheckUtils]: 106: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,839 INFO L273 TraceCheckUtils]: 107: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,839 INFO L273 TraceCheckUtils]: 108: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,839 INFO L273 TraceCheckUtils]: 109: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,839 INFO L273 TraceCheckUtils]: 110: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,839 INFO L273 TraceCheckUtils]: 111: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,840 INFO L273 TraceCheckUtils]: 112: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,840 INFO L273 TraceCheckUtils]: 113: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,840 INFO L273 TraceCheckUtils]: 114: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,840 INFO L273 TraceCheckUtils]: 115: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,840 INFO L273 TraceCheckUtils]: 116: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,840 INFO L273 TraceCheckUtils]: 117: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,840 INFO L273 TraceCheckUtils]: 118: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,840 INFO L273 TraceCheckUtils]: 119: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,840 INFO L273 TraceCheckUtils]: 120: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,841 INFO L273 TraceCheckUtils]: 121: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,841 INFO L273 TraceCheckUtils]: 122: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,841 INFO L273 TraceCheckUtils]: 123: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,841 INFO L273 TraceCheckUtils]: 124: Hoare triple {27553#true} assume !(~i~0 < 10000); {27553#true} is VALID [2018-11-23 12:27:54,841 INFO L273 TraceCheckUtils]: 125: Hoare triple {27553#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27553#true} is VALID [2018-11-23 12:27:54,841 INFO L273 TraceCheckUtils]: 126: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:27:54,841 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {27553#true} {27554#false} #72#return; {27554#false} is VALID [2018-11-23 12:27:54,841 INFO L273 TraceCheckUtils]: 128: Hoare triple {27554#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {27554#false} is VALID [2018-11-23 12:27:54,841 INFO L273 TraceCheckUtils]: 129: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27554#false} is VALID [2018-11-23 12:27:54,841 INFO L273 TraceCheckUtils]: 130: Hoare triple {27554#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27554#false} is VALID [2018-11-23 12:27:54,842 INFO L273 TraceCheckUtils]: 131: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27554#false} is VALID [2018-11-23 12:27:54,842 INFO L273 TraceCheckUtils]: 132: Hoare triple {27554#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27554#false} is VALID [2018-11-23 12:27:54,842 INFO L273 TraceCheckUtils]: 133: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27554#false} is VALID [2018-11-23 12:27:54,842 INFO L273 TraceCheckUtils]: 134: Hoare triple {27554#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27554#false} is VALID [2018-11-23 12:27:54,842 INFO L273 TraceCheckUtils]: 135: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27554#false} is VALID [2018-11-23 12:27:54,842 INFO L273 TraceCheckUtils]: 136: Hoare triple {27554#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27554#false} is VALID [2018-11-23 12:27:54,842 INFO L273 TraceCheckUtils]: 137: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27554#false} is VALID [2018-11-23 12:27:54,842 INFO L273 TraceCheckUtils]: 138: Hoare triple {27554#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27554#false} is VALID [2018-11-23 12:27:54,842 INFO L273 TraceCheckUtils]: 139: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27554#false} is VALID [2018-11-23 12:27:54,843 INFO L273 TraceCheckUtils]: 140: Hoare triple {27554#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27554#false} is VALID [2018-11-23 12:27:54,843 INFO L273 TraceCheckUtils]: 141: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27554#false} is VALID [2018-11-23 12:27:54,843 INFO L273 TraceCheckUtils]: 142: Hoare triple {27554#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27554#false} is VALID [2018-11-23 12:27:54,843 INFO L273 TraceCheckUtils]: 143: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27554#false} is VALID [2018-11-23 12:27:54,843 INFO L273 TraceCheckUtils]: 144: Hoare triple {27554#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27554#false} is VALID [2018-11-23 12:27:54,843 INFO L273 TraceCheckUtils]: 145: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27554#false} is VALID [2018-11-23 12:27:54,843 INFO L273 TraceCheckUtils]: 146: Hoare triple {27554#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27554#false} is VALID [2018-11-23 12:27:54,843 INFO L273 TraceCheckUtils]: 147: Hoare triple {27554#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27554#false} is VALID [2018-11-23 12:27:54,843 INFO L273 TraceCheckUtils]: 148: Hoare triple {27554#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27554#false} is VALID [2018-11-23 12:27:54,843 INFO L273 TraceCheckUtils]: 149: Hoare triple {27554#false} assume !(~i~2 < 9999); {27554#false} is VALID [2018-11-23 12:27:54,844 INFO L273 TraceCheckUtils]: 150: Hoare triple {27554#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {27554#false} is VALID [2018-11-23 12:27:54,844 INFO L256 TraceCheckUtils]: 151: Hoare triple {27554#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {27553#true} is VALID [2018-11-23 12:27:54,844 INFO L273 TraceCheckUtils]: 152: Hoare triple {27553#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {27553#true} is VALID [2018-11-23 12:27:54,844 INFO L273 TraceCheckUtils]: 153: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,844 INFO L273 TraceCheckUtils]: 154: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,844 INFO L273 TraceCheckUtils]: 155: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,844 INFO L273 TraceCheckUtils]: 156: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,844 INFO L273 TraceCheckUtils]: 157: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,844 INFO L273 TraceCheckUtils]: 158: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,844 INFO L273 TraceCheckUtils]: 159: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,845 INFO L273 TraceCheckUtils]: 160: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,845 INFO L273 TraceCheckUtils]: 161: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,845 INFO L273 TraceCheckUtils]: 162: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,845 INFO L273 TraceCheckUtils]: 163: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,845 INFO L273 TraceCheckUtils]: 164: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,845 INFO L273 TraceCheckUtils]: 165: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,845 INFO L273 TraceCheckUtils]: 166: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,845 INFO L273 TraceCheckUtils]: 167: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,845 INFO L273 TraceCheckUtils]: 168: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,846 INFO L273 TraceCheckUtils]: 169: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,846 INFO L273 TraceCheckUtils]: 170: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,846 INFO L273 TraceCheckUtils]: 171: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:54,846 INFO L273 TraceCheckUtils]: 172: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:54,846 INFO L273 TraceCheckUtils]: 173: Hoare triple {27553#true} assume !(~i~0 < 10000); {27553#true} is VALID [2018-11-23 12:27:54,846 INFO L273 TraceCheckUtils]: 174: Hoare triple {27553#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27553#true} is VALID [2018-11-23 12:27:54,846 INFO L273 TraceCheckUtils]: 175: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:27:54,846 INFO L268 TraceCheckUtils]: 176: Hoare quadruple {27553#true} {27554#false} #74#return; {27554#false} is VALID [2018-11-23 12:27:54,846 INFO L273 TraceCheckUtils]: 177: Hoare triple {27554#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {27554#false} is VALID [2018-11-23 12:27:54,846 INFO L273 TraceCheckUtils]: 178: Hoare triple {27554#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {27554#false} is VALID [2018-11-23 12:27:54,847 INFO L273 TraceCheckUtils]: 179: Hoare triple {27554#false} assume !false; {27554#false} is VALID [2018-11-23 12:27:54,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2018-11-23 12:27:54,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:54,862 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:54,871 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:27:54,982 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:27:54,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:55,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:55,710 INFO L256 TraceCheckUtils]: 0: Hoare triple {27553#true} call ULTIMATE.init(); {27553#true} is VALID [2018-11-23 12:27:55,710 INFO L273 TraceCheckUtils]: 1: Hoare triple {27553#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27553#true} is VALID [2018-11-23 12:27:55,710 INFO L273 TraceCheckUtils]: 2: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:27:55,710 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27553#true} {27553#true} #66#return; {27553#true} is VALID [2018-11-23 12:27:55,710 INFO L256 TraceCheckUtils]: 4: Hoare triple {27553#true} call #t~ret13 := main(); {27553#true} is VALID [2018-11-23 12:27:55,711 INFO L273 TraceCheckUtils]: 5: Hoare triple {27553#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; {27553#true} is VALID [2018-11-23 12:27:55,711 INFO L273 TraceCheckUtils]: 6: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,711 INFO L273 TraceCheckUtils]: 7: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,711 INFO L273 TraceCheckUtils]: 8: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,711 INFO L273 TraceCheckUtils]: 9: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,712 INFO L273 TraceCheckUtils]: 10: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,712 INFO L273 TraceCheckUtils]: 11: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,712 INFO L273 TraceCheckUtils]: 12: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,712 INFO L273 TraceCheckUtils]: 13: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,712 INFO L273 TraceCheckUtils]: 14: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,712 INFO L273 TraceCheckUtils]: 15: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,713 INFO L273 TraceCheckUtils]: 16: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,713 INFO L273 TraceCheckUtils]: 17: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,713 INFO L273 TraceCheckUtils]: 18: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,713 INFO L273 TraceCheckUtils]: 19: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,713 INFO L273 TraceCheckUtils]: 20: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,713 INFO L273 TraceCheckUtils]: 21: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,713 INFO L273 TraceCheckUtils]: 22: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,713 INFO L273 TraceCheckUtils]: 23: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,713 INFO L273 TraceCheckUtils]: 24: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,714 INFO L273 TraceCheckUtils]: 25: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,714 INFO L273 TraceCheckUtils]: 26: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,714 INFO L273 TraceCheckUtils]: 27: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,714 INFO L273 TraceCheckUtils]: 28: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,714 INFO L273 TraceCheckUtils]: 29: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,714 INFO L273 TraceCheckUtils]: 30: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,714 INFO L273 TraceCheckUtils]: 31: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,714 INFO L273 TraceCheckUtils]: 32: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,714 INFO L273 TraceCheckUtils]: 33: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,714 INFO L273 TraceCheckUtils]: 34: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,715 INFO L273 TraceCheckUtils]: 35: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,715 INFO L273 TraceCheckUtils]: 36: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,715 INFO L273 TraceCheckUtils]: 37: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,715 INFO L273 TraceCheckUtils]: 38: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,715 INFO L273 TraceCheckUtils]: 39: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,715 INFO L273 TraceCheckUtils]: 40: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,715 INFO L273 TraceCheckUtils]: 41: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,715 INFO L273 TraceCheckUtils]: 42: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,715 INFO L273 TraceCheckUtils]: 43: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,715 INFO L273 TraceCheckUtils]: 44: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,716 INFO L273 TraceCheckUtils]: 45: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,716 INFO L273 TraceCheckUtils]: 46: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,716 INFO L273 TraceCheckUtils]: 47: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,716 INFO L273 TraceCheckUtils]: 48: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,716 INFO L273 TraceCheckUtils]: 49: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,716 INFO L273 TraceCheckUtils]: 50: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,716 INFO L273 TraceCheckUtils]: 51: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,716 INFO L273 TraceCheckUtils]: 52: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,716 INFO L273 TraceCheckUtils]: 53: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,716 INFO L273 TraceCheckUtils]: 54: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,717 INFO L273 TraceCheckUtils]: 55: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,717 INFO L273 TraceCheckUtils]: 56: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,717 INFO L273 TraceCheckUtils]: 57: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,717 INFO L273 TraceCheckUtils]: 58: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,717 INFO L273 TraceCheckUtils]: 59: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,717 INFO L273 TraceCheckUtils]: 60: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,717 INFO L273 TraceCheckUtils]: 61: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,717 INFO L273 TraceCheckUtils]: 62: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,717 INFO L273 TraceCheckUtils]: 63: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,718 INFO L273 TraceCheckUtils]: 64: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,718 INFO L273 TraceCheckUtils]: 65: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,718 INFO L273 TraceCheckUtils]: 66: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,718 INFO L273 TraceCheckUtils]: 67: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,718 INFO L273 TraceCheckUtils]: 68: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,718 INFO L273 TraceCheckUtils]: 69: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,718 INFO L273 TraceCheckUtils]: 70: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,718 INFO L273 TraceCheckUtils]: 71: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,718 INFO L273 TraceCheckUtils]: 72: Hoare triple {27553#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:55,718 INFO L273 TraceCheckUtils]: 73: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:55,719 INFO L273 TraceCheckUtils]: 74: Hoare triple {27553#true} assume !(~i~1 < 10000); {27553#true} is VALID [2018-11-23 12:27:55,719 INFO L256 TraceCheckUtils]: 75: Hoare triple {27553#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {27553#true} is VALID [2018-11-23 12:27:55,719 INFO L273 TraceCheckUtils]: 76: Hoare triple {27553#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {27553#true} is VALID [2018-11-23 12:27:55,719 INFO L273 TraceCheckUtils]: 77: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:55,719 INFO L273 TraceCheckUtils]: 78: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:55,719 INFO L273 TraceCheckUtils]: 79: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:55,719 INFO L273 TraceCheckUtils]: 80: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:55,719 INFO L273 TraceCheckUtils]: 81: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:55,719 INFO L273 TraceCheckUtils]: 82: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:55,719 INFO L273 TraceCheckUtils]: 83: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:55,720 INFO L273 TraceCheckUtils]: 84: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:55,720 INFO L273 TraceCheckUtils]: 85: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:55,720 INFO L273 TraceCheckUtils]: 86: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:55,720 INFO L273 TraceCheckUtils]: 87: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:55,720 INFO L273 TraceCheckUtils]: 88: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:55,720 INFO L273 TraceCheckUtils]: 89: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:55,720 INFO L273 TraceCheckUtils]: 90: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:55,720 INFO L273 TraceCheckUtils]: 91: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:55,720 INFO L273 TraceCheckUtils]: 92: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:55,720 INFO L273 TraceCheckUtils]: 93: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:55,721 INFO L273 TraceCheckUtils]: 94: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:55,721 INFO L273 TraceCheckUtils]: 95: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:55,721 INFO L273 TraceCheckUtils]: 96: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:55,721 INFO L273 TraceCheckUtils]: 97: Hoare triple {27553#true} assume !(~i~0 < 10000); {27553#true} is VALID [2018-11-23 12:27:55,721 INFO L273 TraceCheckUtils]: 98: Hoare triple {27553#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27553#true} is VALID [2018-11-23 12:27:55,721 INFO L273 TraceCheckUtils]: 99: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:27:55,721 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {27553#true} {27553#true} #70#return; {27553#true} is VALID [2018-11-23 12:27:55,721 INFO L273 TraceCheckUtils]: 101: Hoare triple {27553#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {27553#true} is VALID [2018-11-23 12:27:55,721 INFO L256 TraceCheckUtils]: 102: Hoare triple {27553#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {27553#true} is VALID [2018-11-23 12:27:55,722 INFO L273 TraceCheckUtils]: 103: Hoare triple {27553#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {27553#true} is VALID [2018-11-23 12:27:55,722 INFO L273 TraceCheckUtils]: 104: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:55,722 INFO L273 TraceCheckUtils]: 105: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:55,722 INFO L273 TraceCheckUtils]: 106: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:55,722 INFO L273 TraceCheckUtils]: 107: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:55,722 INFO L273 TraceCheckUtils]: 108: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:55,722 INFO L273 TraceCheckUtils]: 109: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:55,722 INFO L273 TraceCheckUtils]: 110: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:55,722 INFO L273 TraceCheckUtils]: 111: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:55,722 INFO L273 TraceCheckUtils]: 112: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:55,723 INFO L273 TraceCheckUtils]: 113: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:55,723 INFO L273 TraceCheckUtils]: 114: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:55,723 INFO L273 TraceCheckUtils]: 115: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:55,723 INFO L273 TraceCheckUtils]: 116: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:55,723 INFO L273 TraceCheckUtils]: 117: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:55,723 INFO L273 TraceCheckUtils]: 118: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:55,723 INFO L273 TraceCheckUtils]: 119: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:55,723 INFO L273 TraceCheckUtils]: 120: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:55,723 INFO L273 TraceCheckUtils]: 121: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:55,723 INFO L273 TraceCheckUtils]: 122: Hoare triple {27553#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:55,724 INFO L273 TraceCheckUtils]: 123: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:55,724 INFO L273 TraceCheckUtils]: 124: Hoare triple {27553#true} assume !(~i~0 < 10000); {27553#true} is VALID [2018-11-23 12:27:55,724 INFO L273 TraceCheckUtils]: 125: Hoare triple {27553#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27553#true} is VALID [2018-11-23 12:27:55,724 INFO L273 TraceCheckUtils]: 126: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:27:55,724 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {27553#true} {27553#true} #72#return; {27553#true} is VALID [2018-11-23 12:27:55,725 INFO L273 TraceCheckUtils]: 128: Hoare triple {27553#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {27977#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:55,725 INFO L273 TraceCheckUtils]: 129: Hoare triple {27977#(<= main_~i~2 0)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27977#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:55,726 INFO L273 TraceCheckUtils]: 130: Hoare triple {27977#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27984#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:55,726 INFO L273 TraceCheckUtils]: 131: Hoare triple {27984#(<= main_~i~2 1)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27984#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:55,727 INFO L273 TraceCheckUtils]: 132: Hoare triple {27984#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27991#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:55,727 INFO L273 TraceCheckUtils]: 133: Hoare triple {27991#(<= main_~i~2 2)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27991#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:55,728 INFO L273 TraceCheckUtils]: 134: Hoare triple {27991#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27998#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:55,729 INFO L273 TraceCheckUtils]: 135: Hoare triple {27998#(<= main_~i~2 3)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27998#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:55,730 INFO L273 TraceCheckUtils]: 136: Hoare triple {27998#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28005#(<= main_~i~2 4)} is VALID [2018-11-23 12:27:55,730 INFO L273 TraceCheckUtils]: 137: Hoare triple {28005#(<= main_~i~2 4)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28005#(<= main_~i~2 4)} is VALID [2018-11-23 12:27:55,731 INFO L273 TraceCheckUtils]: 138: Hoare triple {28005#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28012#(<= main_~i~2 5)} is VALID [2018-11-23 12:27:55,732 INFO L273 TraceCheckUtils]: 139: Hoare triple {28012#(<= main_~i~2 5)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28012#(<= main_~i~2 5)} is VALID [2018-11-23 12:27:55,733 INFO L273 TraceCheckUtils]: 140: Hoare triple {28012#(<= main_~i~2 5)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28019#(<= main_~i~2 6)} is VALID [2018-11-23 12:27:55,733 INFO L273 TraceCheckUtils]: 141: Hoare triple {28019#(<= main_~i~2 6)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28019#(<= main_~i~2 6)} is VALID [2018-11-23 12:27:55,734 INFO L273 TraceCheckUtils]: 142: Hoare triple {28019#(<= main_~i~2 6)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28026#(<= main_~i~2 7)} is VALID [2018-11-23 12:27:55,735 INFO L273 TraceCheckUtils]: 143: Hoare triple {28026#(<= main_~i~2 7)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28026#(<= main_~i~2 7)} is VALID [2018-11-23 12:27:55,736 INFO L273 TraceCheckUtils]: 144: Hoare triple {28026#(<= main_~i~2 7)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28033#(<= main_~i~2 8)} is VALID [2018-11-23 12:27:55,736 INFO L273 TraceCheckUtils]: 145: Hoare triple {28033#(<= main_~i~2 8)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28033#(<= main_~i~2 8)} is VALID [2018-11-23 12:27:55,737 INFO L273 TraceCheckUtils]: 146: Hoare triple {28033#(<= main_~i~2 8)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28040#(<= main_~i~2 9)} is VALID [2018-11-23 12:27:55,738 INFO L273 TraceCheckUtils]: 147: Hoare triple {28040#(<= main_~i~2 9)} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28040#(<= main_~i~2 9)} is VALID [2018-11-23 12:27:55,739 INFO L273 TraceCheckUtils]: 148: Hoare triple {28040#(<= main_~i~2 9)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28047#(<= main_~i~2 10)} is VALID [2018-11-23 12:27:55,740 INFO L273 TraceCheckUtils]: 149: Hoare triple {28047#(<= main_~i~2 10)} assume !(~i~2 < 9999); {27554#false} is VALID [2018-11-23 12:27:55,740 INFO L273 TraceCheckUtils]: 150: Hoare triple {27554#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {27554#false} is VALID [2018-11-23 12:27:55,740 INFO L256 TraceCheckUtils]: 151: Hoare triple {27554#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {27554#false} is VALID [2018-11-23 12:27:55,740 INFO L273 TraceCheckUtils]: 152: Hoare triple {27554#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {27554#false} is VALID [2018-11-23 12:27:55,740 INFO L273 TraceCheckUtils]: 153: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:27:55,741 INFO L273 TraceCheckUtils]: 154: Hoare triple {27554#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27554#false} is VALID [2018-11-23 12:27:55,741 INFO L273 TraceCheckUtils]: 155: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:27:55,741 INFO L273 TraceCheckUtils]: 156: Hoare triple {27554#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27554#false} is VALID [2018-11-23 12:27:55,741 INFO L273 TraceCheckUtils]: 157: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:27:55,741 INFO L273 TraceCheckUtils]: 158: Hoare triple {27554#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27554#false} is VALID [2018-11-23 12:27:55,742 INFO L273 TraceCheckUtils]: 159: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:27:55,742 INFO L273 TraceCheckUtils]: 160: Hoare triple {27554#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27554#false} is VALID [2018-11-23 12:27:55,742 INFO L273 TraceCheckUtils]: 161: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:27:55,742 INFO L273 TraceCheckUtils]: 162: Hoare triple {27554#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27554#false} is VALID [2018-11-23 12:27:55,742 INFO L273 TraceCheckUtils]: 163: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:27:55,742 INFO L273 TraceCheckUtils]: 164: Hoare triple {27554#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27554#false} is VALID [2018-11-23 12:27:55,743 INFO L273 TraceCheckUtils]: 165: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:27:55,743 INFO L273 TraceCheckUtils]: 166: Hoare triple {27554#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27554#false} is VALID [2018-11-23 12:27:55,743 INFO L273 TraceCheckUtils]: 167: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:27:55,743 INFO L273 TraceCheckUtils]: 168: Hoare triple {27554#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27554#false} is VALID [2018-11-23 12:27:55,743 INFO L273 TraceCheckUtils]: 169: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:27:55,743 INFO L273 TraceCheckUtils]: 170: Hoare triple {27554#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27554#false} is VALID [2018-11-23 12:27:55,743 INFO L273 TraceCheckUtils]: 171: Hoare triple {27554#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:27:55,743 INFO L273 TraceCheckUtils]: 172: Hoare triple {27554#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27554#false} is VALID [2018-11-23 12:27:55,743 INFO L273 TraceCheckUtils]: 173: Hoare triple {27554#false} assume !(~i~0 < 10000); {27554#false} is VALID [2018-11-23 12:27:55,744 INFO L273 TraceCheckUtils]: 174: Hoare triple {27554#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27554#false} is VALID [2018-11-23 12:27:55,744 INFO L273 TraceCheckUtils]: 175: Hoare triple {27554#false} assume true; {27554#false} is VALID [2018-11-23 12:27:55,744 INFO L268 TraceCheckUtils]: 176: Hoare quadruple {27554#false} {27554#false} #74#return; {27554#false} is VALID [2018-11-23 12:27:55,744 INFO L273 TraceCheckUtils]: 177: Hoare triple {27554#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {27554#false} is VALID [2018-11-23 12:27:55,744 INFO L273 TraceCheckUtils]: 178: Hoare triple {27554#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {27554#false} is VALID [2018-11-23 12:27:55,744 INFO L273 TraceCheckUtils]: 179: Hoare triple {27554#false} assume !false; {27554#false} is VALID [2018-11-23 12:27:55,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 450 proven. 100 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2018-11-23 12:27:55,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:55,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13] total 48 [2018-11-23 12:27:55,777 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2018-11-23 12:27:55,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:55,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 12:27:55,967 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-23 12:27:55,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 12:27:55,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 12:27:55,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:27:55,969 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 48 states. [2018-11-23 12:27:56,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:56,686 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2018-11-23 12:27:56,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 12:27:56,687 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2018-11-23 12:27:56,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:56,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:27:56,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 145 transitions. [2018-11-23 12:27:56,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:27:56,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 145 transitions. [2018-11-23 12:27:56,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 145 transitions. [2018-11-23 12:27:57,138 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:57,142 INFO L225 Difference]: With dead ends: 193 [2018-11-23 12:27:57,142 INFO L226 Difference]: Without dead ends: 137 [2018-11-23 12:27:57,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:27:57,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-23 12:27:57,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-11-23 12:27:57,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:57,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 135 states. [2018-11-23 12:27:57,222 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 135 states. [2018-11-23 12:27:57,222 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 135 states. [2018-11-23 12:27:57,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:57,224 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-11-23 12:27:57,225 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-11-23 12:27:57,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:57,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:57,225 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 137 states. [2018-11-23 12:27:57,225 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 137 states. [2018-11-23 12:27:57,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:57,227 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-11-23 12:27:57,227 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-11-23 12:27:57,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:57,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:57,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:57,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:57,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 12:27:57,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-11-23 12:27:57,231 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 180 [2018-11-23 12:27:57,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:57,231 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-11-23 12:27:57,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 12:27:57,231 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-11-23 12:27:57,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-23 12:27:57,232 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:57,232 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 30, 30, 11, 11, 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-23 12:27:57,232 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:57,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:57,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1113930553, now seen corresponding path program 35 times [2018-11-23 12:27:57,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:57,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:57,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:57,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:57,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:58,839 INFO L256 TraceCheckUtils]: 0: Hoare triple {28902#true} call ULTIMATE.init(); {28902#true} is VALID [2018-11-23 12:27:58,839 INFO L273 TraceCheckUtils]: 1: Hoare triple {28902#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28902#true} is VALID [2018-11-23 12:27:58,840 INFO L273 TraceCheckUtils]: 2: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:27:58,840 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28902#true} {28902#true} #66#return; {28902#true} is VALID [2018-11-23 12:27:58,840 INFO L256 TraceCheckUtils]: 4: Hoare triple {28902#true} call #t~ret13 := main(); {28902#true} is VALID [2018-11-23 12:27:58,841 INFO L273 TraceCheckUtils]: 5: Hoare triple {28902#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; {28904#(= main_~i~1 0)} is VALID [2018-11-23 12:27:58,841 INFO L273 TraceCheckUtils]: 6: Hoare triple {28904#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28904#(= main_~i~1 0)} is VALID [2018-11-23 12:27:58,843 INFO L273 TraceCheckUtils]: 7: Hoare triple {28904#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28905#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:58,843 INFO L273 TraceCheckUtils]: 8: Hoare triple {28905#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28905#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:58,845 INFO L273 TraceCheckUtils]: 9: Hoare triple {28905#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28906#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:58,845 INFO L273 TraceCheckUtils]: 10: Hoare triple {28906#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28906#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:58,847 INFO L273 TraceCheckUtils]: 11: Hoare triple {28906#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28907#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:58,847 INFO L273 TraceCheckUtils]: 12: Hoare triple {28907#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28907#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:58,849 INFO L273 TraceCheckUtils]: 13: Hoare triple {28907#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28908#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:58,849 INFO L273 TraceCheckUtils]: 14: Hoare triple {28908#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28908#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:58,851 INFO L273 TraceCheckUtils]: 15: Hoare triple {28908#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28909#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:58,851 INFO L273 TraceCheckUtils]: 16: Hoare triple {28909#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28909#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:58,853 INFO L273 TraceCheckUtils]: 17: Hoare triple {28909#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28910#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:58,853 INFO L273 TraceCheckUtils]: 18: Hoare triple {28910#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28910#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:58,855 INFO L273 TraceCheckUtils]: 19: Hoare triple {28910#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28911#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:58,855 INFO L273 TraceCheckUtils]: 20: Hoare triple {28911#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28911#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:58,857 INFO L273 TraceCheckUtils]: 21: Hoare triple {28911#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28912#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:58,857 INFO L273 TraceCheckUtils]: 22: Hoare triple {28912#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28912#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:58,859 INFO L273 TraceCheckUtils]: 23: Hoare triple {28912#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28913#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:58,859 INFO L273 TraceCheckUtils]: 24: Hoare triple {28913#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28913#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:58,862 INFO L273 TraceCheckUtils]: 25: Hoare triple {28913#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28914#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:58,862 INFO L273 TraceCheckUtils]: 26: Hoare triple {28914#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28914#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:58,864 INFO L273 TraceCheckUtils]: 27: Hoare triple {28914#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28915#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:58,864 INFO L273 TraceCheckUtils]: 28: Hoare triple {28915#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28915#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:58,867 INFO L273 TraceCheckUtils]: 29: Hoare triple {28915#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28916#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:58,867 INFO L273 TraceCheckUtils]: 30: Hoare triple {28916#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28916#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:58,868 INFO L273 TraceCheckUtils]: 31: Hoare triple {28916#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28917#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:58,868 INFO L273 TraceCheckUtils]: 32: Hoare triple {28917#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28917#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:58,869 INFO L273 TraceCheckUtils]: 33: Hoare triple {28917#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28918#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:58,869 INFO L273 TraceCheckUtils]: 34: Hoare triple {28918#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28918#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:58,870 INFO L273 TraceCheckUtils]: 35: Hoare triple {28918#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28919#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:58,870 INFO L273 TraceCheckUtils]: 36: Hoare triple {28919#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28919#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:58,871 INFO L273 TraceCheckUtils]: 37: Hoare triple {28919#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28920#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:58,872 INFO L273 TraceCheckUtils]: 38: Hoare triple {28920#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28920#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:58,873 INFO L273 TraceCheckUtils]: 39: Hoare triple {28920#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28921#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:58,873 INFO L273 TraceCheckUtils]: 40: Hoare triple {28921#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28921#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:58,874 INFO L273 TraceCheckUtils]: 41: Hoare triple {28921#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28922#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:58,875 INFO L273 TraceCheckUtils]: 42: Hoare triple {28922#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28922#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:58,876 INFO L273 TraceCheckUtils]: 43: Hoare triple {28922#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28923#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:58,876 INFO L273 TraceCheckUtils]: 44: Hoare triple {28923#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28923#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:58,877 INFO L273 TraceCheckUtils]: 45: Hoare triple {28923#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28924#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:58,878 INFO L273 TraceCheckUtils]: 46: Hoare triple {28924#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28924#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:58,879 INFO L273 TraceCheckUtils]: 47: Hoare triple {28924#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28925#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:58,879 INFO L273 TraceCheckUtils]: 48: Hoare triple {28925#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28925#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:58,880 INFO L273 TraceCheckUtils]: 49: Hoare triple {28925#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28926#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:58,881 INFO L273 TraceCheckUtils]: 50: Hoare triple {28926#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28926#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:58,882 INFO L273 TraceCheckUtils]: 51: Hoare triple {28926#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28927#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:58,883 INFO L273 TraceCheckUtils]: 52: Hoare triple {28927#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28927#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:58,883 INFO L273 TraceCheckUtils]: 53: Hoare triple {28927#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28928#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:58,884 INFO L273 TraceCheckUtils]: 54: Hoare triple {28928#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28928#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:58,885 INFO L273 TraceCheckUtils]: 55: Hoare triple {28928#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28929#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:58,886 INFO L273 TraceCheckUtils]: 56: Hoare triple {28929#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28929#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:58,886 INFO L273 TraceCheckUtils]: 57: Hoare triple {28929#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28930#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:58,887 INFO L273 TraceCheckUtils]: 58: Hoare triple {28930#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28930#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:58,888 INFO L273 TraceCheckUtils]: 59: Hoare triple {28930#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28931#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:58,889 INFO L273 TraceCheckUtils]: 60: Hoare triple {28931#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28931#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:58,890 INFO L273 TraceCheckUtils]: 61: Hoare triple {28931#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28932#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:58,890 INFO L273 TraceCheckUtils]: 62: Hoare triple {28932#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {28932#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:58,891 INFO L273 TraceCheckUtils]: 63: Hoare triple {28932#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28933#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:58,892 INFO L273 TraceCheckUtils]: 64: Hoare triple {28933#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28933#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:58,893 INFO L273 TraceCheckUtils]: 65: Hoare triple {28933#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28934#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:58,893 INFO L273 TraceCheckUtils]: 66: Hoare triple {28934#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28934#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:58,894 INFO L273 TraceCheckUtils]: 67: Hoare triple {28934#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28935#(<= main_~i~1 31)} is VALID [2018-11-23 12:27:58,895 INFO L273 TraceCheckUtils]: 68: Hoare triple {28935#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28935#(<= main_~i~1 31)} is VALID [2018-11-23 12:27:58,896 INFO L273 TraceCheckUtils]: 69: Hoare triple {28935#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28936#(<= main_~i~1 32)} is VALID [2018-11-23 12:27:58,896 INFO L273 TraceCheckUtils]: 70: Hoare triple {28936#(<= main_~i~1 32)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28936#(<= main_~i~1 32)} is VALID [2018-11-23 12:27:58,897 INFO L273 TraceCheckUtils]: 71: Hoare triple {28936#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28937#(<= main_~i~1 33)} is VALID [2018-11-23 12:27:58,898 INFO L273 TraceCheckUtils]: 72: Hoare triple {28937#(<= main_~i~1 33)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28937#(<= main_~i~1 33)} is VALID [2018-11-23 12:27:58,899 INFO L273 TraceCheckUtils]: 73: Hoare triple {28937#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28938#(<= main_~i~1 34)} is VALID [2018-11-23 12:27:58,899 INFO L273 TraceCheckUtils]: 74: Hoare triple {28938#(<= main_~i~1 34)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28938#(<= main_~i~1 34)} is VALID [2018-11-23 12:27:58,900 INFO L273 TraceCheckUtils]: 75: Hoare triple {28938#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28939#(<= main_~i~1 35)} is VALID [2018-11-23 12:27:58,901 INFO L273 TraceCheckUtils]: 76: Hoare triple {28939#(<= main_~i~1 35)} assume !(~i~1 < 10000); {28903#false} is VALID [2018-11-23 12:27:58,901 INFO L256 TraceCheckUtils]: 77: Hoare triple {28903#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {28902#true} is VALID [2018-11-23 12:27:58,902 INFO L273 TraceCheckUtils]: 78: Hoare triple {28902#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {28902#true} is VALID [2018-11-23 12:27:58,902 INFO L273 TraceCheckUtils]: 79: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,902 INFO L273 TraceCheckUtils]: 80: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,902 INFO L273 TraceCheckUtils]: 81: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,902 INFO L273 TraceCheckUtils]: 82: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,902 INFO L273 TraceCheckUtils]: 83: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,903 INFO L273 TraceCheckUtils]: 84: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,903 INFO L273 TraceCheckUtils]: 85: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,903 INFO L273 TraceCheckUtils]: 86: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,903 INFO L273 TraceCheckUtils]: 87: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,903 INFO L273 TraceCheckUtils]: 88: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,903 INFO L273 TraceCheckUtils]: 89: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,904 INFO L273 TraceCheckUtils]: 90: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,904 INFO L273 TraceCheckUtils]: 91: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,904 INFO L273 TraceCheckUtils]: 92: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,904 INFO L273 TraceCheckUtils]: 93: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,904 INFO L273 TraceCheckUtils]: 94: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,905 INFO L273 TraceCheckUtils]: 95: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,905 INFO L273 TraceCheckUtils]: 96: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,905 INFO L273 TraceCheckUtils]: 97: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,905 INFO L273 TraceCheckUtils]: 98: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,905 INFO L273 TraceCheckUtils]: 99: Hoare triple {28902#true} assume !(~i~0 < 10000); {28902#true} is VALID [2018-11-23 12:27:58,905 INFO L273 TraceCheckUtils]: 100: Hoare triple {28902#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {28902#true} is VALID [2018-11-23 12:27:58,905 INFO L273 TraceCheckUtils]: 101: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:27:58,905 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {28902#true} {28903#false} #70#return; {28903#false} is VALID [2018-11-23 12:27:58,905 INFO L273 TraceCheckUtils]: 103: Hoare triple {28903#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {28903#false} is VALID [2018-11-23 12:27:58,905 INFO L256 TraceCheckUtils]: 104: Hoare triple {28903#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {28902#true} is VALID [2018-11-23 12:27:58,906 INFO L273 TraceCheckUtils]: 105: Hoare triple {28902#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {28902#true} is VALID [2018-11-23 12:27:58,906 INFO L273 TraceCheckUtils]: 106: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,906 INFO L273 TraceCheckUtils]: 107: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,906 INFO L273 TraceCheckUtils]: 108: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,906 INFO L273 TraceCheckUtils]: 109: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,906 INFO L273 TraceCheckUtils]: 110: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,906 INFO L273 TraceCheckUtils]: 111: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,906 INFO L273 TraceCheckUtils]: 112: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,906 INFO L273 TraceCheckUtils]: 113: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,906 INFO L273 TraceCheckUtils]: 114: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,907 INFO L273 TraceCheckUtils]: 115: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,907 INFO L273 TraceCheckUtils]: 116: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,907 INFO L273 TraceCheckUtils]: 117: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,907 INFO L273 TraceCheckUtils]: 118: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,907 INFO L273 TraceCheckUtils]: 119: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,907 INFO L273 TraceCheckUtils]: 120: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,907 INFO L273 TraceCheckUtils]: 121: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,907 INFO L273 TraceCheckUtils]: 122: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,907 INFO L273 TraceCheckUtils]: 123: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,908 INFO L273 TraceCheckUtils]: 124: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,908 INFO L273 TraceCheckUtils]: 125: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,908 INFO L273 TraceCheckUtils]: 126: Hoare triple {28902#true} assume !(~i~0 < 10000); {28902#true} is VALID [2018-11-23 12:27:58,908 INFO L273 TraceCheckUtils]: 127: Hoare triple {28902#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {28902#true} is VALID [2018-11-23 12:27:58,908 INFO L273 TraceCheckUtils]: 128: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:27:58,908 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {28902#true} {28903#false} #72#return; {28903#false} is VALID [2018-11-23 12:27:58,908 INFO L273 TraceCheckUtils]: 130: Hoare triple {28903#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {28903#false} is VALID [2018-11-23 12:27:58,908 INFO L273 TraceCheckUtils]: 131: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:27:58,908 INFO L273 TraceCheckUtils]: 132: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:27:58,908 INFO L273 TraceCheckUtils]: 133: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:27:58,909 INFO L273 TraceCheckUtils]: 134: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:27:58,909 INFO L273 TraceCheckUtils]: 135: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:27:58,909 INFO L273 TraceCheckUtils]: 136: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:27:58,909 INFO L273 TraceCheckUtils]: 137: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:27:58,909 INFO L273 TraceCheckUtils]: 138: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:27:58,909 INFO L273 TraceCheckUtils]: 139: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:27:58,909 INFO L273 TraceCheckUtils]: 140: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:27:58,909 INFO L273 TraceCheckUtils]: 141: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:27:58,909 INFO L273 TraceCheckUtils]: 142: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:27:58,909 INFO L273 TraceCheckUtils]: 143: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:27:58,910 INFO L273 TraceCheckUtils]: 144: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:27:58,910 INFO L273 TraceCheckUtils]: 145: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:27:58,910 INFO L273 TraceCheckUtils]: 146: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:27:58,910 INFO L273 TraceCheckUtils]: 147: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:27:58,910 INFO L273 TraceCheckUtils]: 148: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:27:58,910 INFO L273 TraceCheckUtils]: 149: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:27:58,910 INFO L273 TraceCheckUtils]: 150: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:27:58,910 INFO L273 TraceCheckUtils]: 151: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:27:58,910 INFO L273 TraceCheckUtils]: 152: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:27:58,911 INFO L273 TraceCheckUtils]: 153: Hoare triple {28903#false} assume !(~i~2 < 9999); {28903#false} is VALID [2018-11-23 12:27:58,911 INFO L273 TraceCheckUtils]: 154: Hoare triple {28903#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {28903#false} is VALID [2018-11-23 12:27:58,911 INFO L256 TraceCheckUtils]: 155: Hoare triple {28903#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {28902#true} is VALID [2018-11-23 12:27:58,911 INFO L273 TraceCheckUtils]: 156: Hoare triple {28902#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {28902#true} is VALID [2018-11-23 12:27:58,911 INFO L273 TraceCheckUtils]: 157: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,911 INFO L273 TraceCheckUtils]: 158: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,911 INFO L273 TraceCheckUtils]: 159: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,911 INFO L273 TraceCheckUtils]: 160: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,911 INFO L273 TraceCheckUtils]: 161: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,911 INFO L273 TraceCheckUtils]: 162: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,912 INFO L273 TraceCheckUtils]: 163: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,912 INFO L273 TraceCheckUtils]: 164: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,912 INFO L273 TraceCheckUtils]: 165: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,912 INFO L273 TraceCheckUtils]: 166: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,912 INFO L273 TraceCheckUtils]: 167: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,912 INFO L273 TraceCheckUtils]: 168: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,912 INFO L273 TraceCheckUtils]: 169: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,912 INFO L273 TraceCheckUtils]: 170: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,912 INFO L273 TraceCheckUtils]: 171: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,912 INFO L273 TraceCheckUtils]: 172: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,913 INFO L273 TraceCheckUtils]: 173: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,913 INFO L273 TraceCheckUtils]: 174: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,913 INFO L273 TraceCheckUtils]: 175: Hoare triple {28902#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:58,913 INFO L273 TraceCheckUtils]: 176: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:58,913 INFO L273 TraceCheckUtils]: 177: Hoare triple {28902#true} assume !(~i~0 < 10000); {28902#true} is VALID [2018-11-23 12:27:58,913 INFO L273 TraceCheckUtils]: 178: Hoare triple {28902#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {28902#true} is VALID [2018-11-23 12:27:58,913 INFO L273 TraceCheckUtils]: 179: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:27:58,913 INFO L268 TraceCheckUtils]: 180: Hoare quadruple {28902#true} {28903#false} #74#return; {28903#false} is VALID [2018-11-23 12:27:58,913 INFO L273 TraceCheckUtils]: 181: Hoare triple {28903#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {28903#false} is VALID [2018-11-23 12:27:58,913 INFO L273 TraceCheckUtils]: 182: Hoare triple {28903#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {28903#false} is VALID [2018-11-23 12:27:58,914 INFO L273 TraceCheckUtils]: 183: Hoare triple {28903#false} assume !false; {28903#false} is VALID [2018-11-23 12:27:58,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1096 trivial. 0 not checked. [2018-11-23 12:27:58,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:58,929 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:58,945 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:28:26,337 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2018-11-23 12:28:26,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:26,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:27,141 INFO L256 TraceCheckUtils]: 0: Hoare triple {28902#true} call ULTIMATE.init(); {28902#true} is VALID [2018-11-23 12:28:27,141 INFO L273 TraceCheckUtils]: 1: Hoare triple {28902#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28902#true} is VALID [2018-11-23 12:28:27,141 INFO L273 TraceCheckUtils]: 2: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:28:27,141 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28902#true} {28902#true} #66#return; {28902#true} is VALID [2018-11-23 12:28:27,142 INFO L256 TraceCheckUtils]: 4: Hoare triple {28902#true} call #t~ret13 := main(); {28902#true} is VALID [2018-11-23 12:28:27,142 INFO L273 TraceCheckUtils]: 5: Hoare triple {28902#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; {28902#true} is VALID [2018-11-23 12:28:27,142 INFO L273 TraceCheckUtils]: 6: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,142 INFO L273 TraceCheckUtils]: 7: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,142 INFO L273 TraceCheckUtils]: 8: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,142 INFO L273 TraceCheckUtils]: 9: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,143 INFO L273 TraceCheckUtils]: 10: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,143 INFO L273 TraceCheckUtils]: 11: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,143 INFO L273 TraceCheckUtils]: 12: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,143 INFO L273 TraceCheckUtils]: 13: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,143 INFO L273 TraceCheckUtils]: 14: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,143 INFO L273 TraceCheckUtils]: 15: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,143 INFO L273 TraceCheckUtils]: 16: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,143 INFO L273 TraceCheckUtils]: 17: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,144 INFO L273 TraceCheckUtils]: 18: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,144 INFO L273 TraceCheckUtils]: 19: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,144 INFO L273 TraceCheckUtils]: 20: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,144 INFO L273 TraceCheckUtils]: 21: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,144 INFO L273 TraceCheckUtils]: 22: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,144 INFO L273 TraceCheckUtils]: 23: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,144 INFO L273 TraceCheckUtils]: 24: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,144 INFO L273 TraceCheckUtils]: 25: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,144 INFO L273 TraceCheckUtils]: 26: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,144 INFO L273 TraceCheckUtils]: 27: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,145 INFO L273 TraceCheckUtils]: 28: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,145 INFO L273 TraceCheckUtils]: 29: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,145 INFO L273 TraceCheckUtils]: 30: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,145 INFO L273 TraceCheckUtils]: 31: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,145 INFO L273 TraceCheckUtils]: 32: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,145 INFO L273 TraceCheckUtils]: 33: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,145 INFO L273 TraceCheckUtils]: 34: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,145 INFO L273 TraceCheckUtils]: 35: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,145 INFO L273 TraceCheckUtils]: 36: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,145 INFO L273 TraceCheckUtils]: 37: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,146 INFO L273 TraceCheckUtils]: 38: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,146 INFO L273 TraceCheckUtils]: 39: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,146 INFO L273 TraceCheckUtils]: 40: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,146 INFO L273 TraceCheckUtils]: 41: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,146 INFO L273 TraceCheckUtils]: 42: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,146 INFO L273 TraceCheckUtils]: 43: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,146 INFO L273 TraceCheckUtils]: 44: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,146 INFO L273 TraceCheckUtils]: 45: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,146 INFO L273 TraceCheckUtils]: 46: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,147 INFO L273 TraceCheckUtils]: 47: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,147 INFO L273 TraceCheckUtils]: 48: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,147 INFO L273 TraceCheckUtils]: 49: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,147 INFO L273 TraceCheckUtils]: 50: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,147 INFO L273 TraceCheckUtils]: 51: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,147 INFO L273 TraceCheckUtils]: 52: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,147 INFO L273 TraceCheckUtils]: 53: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,147 INFO L273 TraceCheckUtils]: 54: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,147 INFO L273 TraceCheckUtils]: 55: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,147 INFO L273 TraceCheckUtils]: 56: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,148 INFO L273 TraceCheckUtils]: 57: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,148 INFO L273 TraceCheckUtils]: 58: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,148 INFO L273 TraceCheckUtils]: 59: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,148 INFO L273 TraceCheckUtils]: 60: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,148 INFO L273 TraceCheckUtils]: 61: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,148 INFO L273 TraceCheckUtils]: 62: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,148 INFO L273 TraceCheckUtils]: 63: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,148 INFO L273 TraceCheckUtils]: 64: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,148 INFO L273 TraceCheckUtils]: 65: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,148 INFO L273 TraceCheckUtils]: 66: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,149 INFO L273 TraceCheckUtils]: 67: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,149 INFO L273 TraceCheckUtils]: 68: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,149 INFO L273 TraceCheckUtils]: 69: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,149 INFO L273 TraceCheckUtils]: 70: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,149 INFO L273 TraceCheckUtils]: 71: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,149 INFO L273 TraceCheckUtils]: 72: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,149 INFO L273 TraceCheckUtils]: 73: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,149 INFO L273 TraceCheckUtils]: 74: Hoare triple {28902#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:27,149 INFO L273 TraceCheckUtils]: 75: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:27,149 INFO L273 TraceCheckUtils]: 76: Hoare triple {28902#true} assume !(~i~1 < 10000); {28902#true} is VALID [2018-11-23 12:28:27,150 INFO L256 TraceCheckUtils]: 77: Hoare triple {28902#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {28902#true} is VALID [2018-11-23 12:28:27,150 INFO L273 TraceCheckUtils]: 78: Hoare triple {28902#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {29177#(<= bor_~i~0 1)} is VALID [2018-11-23 12:28:27,151 INFO L273 TraceCheckUtils]: 79: Hoare triple {29177#(<= bor_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {29177#(<= bor_~i~0 1)} is VALID [2018-11-23 12:28:27,151 INFO L273 TraceCheckUtils]: 80: Hoare triple {29177#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29184#(<= bor_~i~0 2)} is VALID [2018-11-23 12:28:27,152 INFO L273 TraceCheckUtils]: 81: Hoare triple {29184#(<= bor_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {29184#(<= bor_~i~0 2)} is VALID [2018-11-23 12:28:27,152 INFO L273 TraceCheckUtils]: 82: Hoare triple {29184#(<= bor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29191#(<= bor_~i~0 3)} is VALID [2018-11-23 12:28:27,153 INFO L273 TraceCheckUtils]: 83: Hoare triple {29191#(<= bor_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {29191#(<= bor_~i~0 3)} is VALID [2018-11-23 12:28:27,153 INFO L273 TraceCheckUtils]: 84: Hoare triple {29191#(<= bor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29198#(<= bor_~i~0 4)} is VALID [2018-11-23 12:28:27,153 INFO L273 TraceCheckUtils]: 85: Hoare triple {29198#(<= bor_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {29198#(<= bor_~i~0 4)} is VALID [2018-11-23 12:28:27,154 INFO L273 TraceCheckUtils]: 86: Hoare triple {29198#(<= bor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29205#(<= bor_~i~0 5)} is VALID [2018-11-23 12:28:27,155 INFO L273 TraceCheckUtils]: 87: Hoare triple {29205#(<= bor_~i~0 5)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {29205#(<= bor_~i~0 5)} is VALID [2018-11-23 12:28:27,156 INFO L273 TraceCheckUtils]: 88: Hoare triple {29205#(<= bor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29212#(<= bor_~i~0 6)} is VALID [2018-11-23 12:28:27,156 INFO L273 TraceCheckUtils]: 89: Hoare triple {29212#(<= bor_~i~0 6)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {29212#(<= bor_~i~0 6)} is VALID [2018-11-23 12:28:27,157 INFO L273 TraceCheckUtils]: 90: Hoare triple {29212#(<= bor_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29219#(<= bor_~i~0 7)} is VALID [2018-11-23 12:28:27,158 INFO L273 TraceCheckUtils]: 91: Hoare triple {29219#(<= bor_~i~0 7)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {29219#(<= bor_~i~0 7)} is VALID [2018-11-23 12:28:27,159 INFO L273 TraceCheckUtils]: 92: Hoare triple {29219#(<= bor_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29226#(<= bor_~i~0 8)} is VALID [2018-11-23 12:28:27,159 INFO L273 TraceCheckUtils]: 93: Hoare triple {29226#(<= bor_~i~0 8)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {29226#(<= bor_~i~0 8)} is VALID [2018-11-23 12:28:27,160 INFO L273 TraceCheckUtils]: 94: Hoare triple {29226#(<= bor_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29233#(<= bor_~i~0 9)} is VALID [2018-11-23 12:28:27,161 INFO L273 TraceCheckUtils]: 95: Hoare triple {29233#(<= bor_~i~0 9)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {29233#(<= bor_~i~0 9)} is VALID [2018-11-23 12:28:27,162 INFO L273 TraceCheckUtils]: 96: Hoare triple {29233#(<= bor_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29240#(<= bor_~i~0 10)} is VALID [2018-11-23 12:28:27,162 INFO L273 TraceCheckUtils]: 97: Hoare triple {29240#(<= bor_~i~0 10)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {29240#(<= bor_~i~0 10)} is VALID [2018-11-23 12:28:27,163 INFO L273 TraceCheckUtils]: 98: Hoare triple {29240#(<= bor_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29247#(<= bor_~i~0 11)} is VALID [2018-11-23 12:28:27,164 INFO L273 TraceCheckUtils]: 99: Hoare triple {29247#(<= bor_~i~0 11)} assume !(~i~0 < 10000); {28903#false} is VALID [2018-11-23 12:28:27,164 INFO L273 TraceCheckUtils]: 100: Hoare triple {28903#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {28903#false} is VALID [2018-11-23 12:28:27,164 INFO L273 TraceCheckUtils]: 101: Hoare triple {28903#false} assume true; {28903#false} is VALID [2018-11-23 12:28:27,165 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {28903#false} {28902#true} #70#return; {28903#false} is VALID [2018-11-23 12:28:27,165 INFO L273 TraceCheckUtils]: 103: Hoare triple {28903#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {28903#false} is VALID [2018-11-23 12:28:27,165 INFO L256 TraceCheckUtils]: 104: Hoare triple {28903#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {28903#false} is VALID [2018-11-23 12:28:27,165 INFO L273 TraceCheckUtils]: 105: Hoare triple {28903#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {28903#false} is VALID [2018-11-23 12:28:27,165 INFO L273 TraceCheckUtils]: 106: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:27,166 INFO L273 TraceCheckUtils]: 107: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:27,166 INFO L273 TraceCheckUtils]: 108: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:27,166 INFO L273 TraceCheckUtils]: 109: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:27,166 INFO L273 TraceCheckUtils]: 110: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:27,166 INFO L273 TraceCheckUtils]: 111: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:27,166 INFO L273 TraceCheckUtils]: 112: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:27,167 INFO L273 TraceCheckUtils]: 113: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:27,167 INFO L273 TraceCheckUtils]: 114: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:27,167 INFO L273 TraceCheckUtils]: 115: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:27,167 INFO L273 TraceCheckUtils]: 116: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:27,167 INFO L273 TraceCheckUtils]: 117: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:27,168 INFO L273 TraceCheckUtils]: 118: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:27,168 INFO L273 TraceCheckUtils]: 119: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:27,168 INFO L273 TraceCheckUtils]: 120: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:27,168 INFO L273 TraceCheckUtils]: 121: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:27,168 INFO L273 TraceCheckUtils]: 122: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:27,168 INFO L273 TraceCheckUtils]: 123: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:27,169 INFO L273 TraceCheckUtils]: 124: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:27,169 INFO L273 TraceCheckUtils]: 125: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:27,169 INFO L273 TraceCheckUtils]: 126: Hoare triple {28903#false} assume !(~i~0 < 10000); {28903#false} is VALID [2018-11-23 12:28:27,169 INFO L273 TraceCheckUtils]: 127: Hoare triple {28903#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {28903#false} is VALID [2018-11-23 12:28:27,169 INFO L273 TraceCheckUtils]: 128: Hoare triple {28903#false} assume true; {28903#false} is VALID [2018-11-23 12:28:27,169 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {28903#false} {28903#false} #72#return; {28903#false} is VALID [2018-11-23 12:28:27,169 INFO L273 TraceCheckUtils]: 130: Hoare triple {28903#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {28903#false} is VALID [2018-11-23 12:28:27,169 INFO L273 TraceCheckUtils]: 131: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:28:27,170 INFO L273 TraceCheckUtils]: 132: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:28:27,170 INFO L273 TraceCheckUtils]: 133: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:28:27,170 INFO L273 TraceCheckUtils]: 134: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:28:27,170 INFO L273 TraceCheckUtils]: 135: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:28:27,170 INFO L273 TraceCheckUtils]: 136: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:28:27,170 INFO L273 TraceCheckUtils]: 137: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:28:27,170 INFO L273 TraceCheckUtils]: 138: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:28:27,170 INFO L273 TraceCheckUtils]: 139: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:28:27,170 INFO L273 TraceCheckUtils]: 140: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:28:27,170 INFO L273 TraceCheckUtils]: 141: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:28:27,171 INFO L273 TraceCheckUtils]: 142: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:28:27,171 INFO L273 TraceCheckUtils]: 143: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:28:27,171 INFO L273 TraceCheckUtils]: 144: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:28:27,171 INFO L273 TraceCheckUtils]: 145: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:28:27,171 INFO L273 TraceCheckUtils]: 146: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:28:27,171 INFO L273 TraceCheckUtils]: 147: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:28:27,171 INFO L273 TraceCheckUtils]: 148: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:28:27,171 INFO L273 TraceCheckUtils]: 149: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:28:27,171 INFO L273 TraceCheckUtils]: 150: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:28:27,172 INFO L273 TraceCheckUtils]: 151: Hoare triple {28903#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:28:27,172 INFO L273 TraceCheckUtils]: 152: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:28:27,172 INFO L273 TraceCheckUtils]: 153: Hoare triple {28903#false} assume !(~i~2 < 9999); {28903#false} is VALID [2018-11-23 12:28:27,172 INFO L273 TraceCheckUtils]: 154: Hoare triple {28903#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {28903#false} is VALID [2018-11-23 12:28:27,172 INFO L256 TraceCheckUtils]: 155: Hoare triple {28903#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {28903#false} is VALID [2018-11-23 12:28:27,172 INFO L273 TraceCheckUtils]: 156: Hoare triple {28903#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {28903#false} is VALID [2018-11-23 12:28:27,172 INFO L273 TraceCheckUtils]: 157: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:27,172 INFO L273 TraceCheckUtils]: 158: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:27,172 INFO L273 TraceCheckUtils]: 159: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:27,172 INFO L273 TraceCheckUtils]: 160: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:27,173 INFO L273 TraceCheckUtils]: 161: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:27,173 INFO L273 TraceCheckUtils]: 162: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:27,173 INFO L273 TraceCheckUtils]: 163: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:27,173 INFO L273 TraceCheckUtils]: 164: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:27,173 INFO L273 TraceCheckUtils]: 165: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:27,173 INFO L273 TraceCheckUtils]: 166: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:27,173 INFO L273 TraceCheckUtils]: 167: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:27,173 INFO L273 TraceCheckUtils]: 168: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:27,173 INFO L273 TraceCheckUtils]: 169: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:27,173 INFO L273 TraceCheckUtils]: 170: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:27,174 INFO L273 TraceCheckUtils]: 171: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:27,174 INFO L273 TraceCheckUtils]: 172: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:27,174 INFO L273 TraceCheckUtils]: 173: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:27,174 INFO L273 TraceCheckUtils]: 174: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:27,174 INFO L273 TraceCheckUtils]: 175: Hoare triple {28903#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:27,174 INFO L273 TraceCheckUtils]: 176: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:27,174 INFO L273 TraceCheckUtils]: 177: Hoare triple {28903#false} assume !(~i~0 < 10000); {28903#false} is VALID [2018-11-23 12:28:27,174 INFO L273 TraceCheckUtils]: 178: Hoare triple {28903#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {28903#false} is VALID [2018-11-23 12:28:27,174 INFO L273 TraceCheckUtils]: 179: Hoare triple {28903#false} assume true; {28903#false} is VALID [2018-11-23 12:28:27,175 INFO L268 TraceCheckUtils]: 180: Hoare quadruple {28903#false} {28903#false} #74#return; {28903#false} is VALID [2018-11-23 12:28:27,175 INFO L273 TraceCheckUtils]: 181: Hoare triple {28903#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {28903#false} is VALID [2018-11-23 12:28:27,175 INFO L273 TraceCheckUtils]: 182: Hoare triple {28903#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {28903#false} is VALID [2018-11-23 12:28:27,175 INFO L273 TraceCheckUtils]: 183: Hoare triple {28903#false} assume !false; {28903#false} is VALID [2018-11-23 12:28:27,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 444 proven. 100 refuted. 0 times theorem prover too weak. 1777 trivial. 0 not checked. [2018-11-23 12:28:27,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:27,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 13] total 49 [2018-11-23 12:28:27,214 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2018-11-23 12:28:27,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:27,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-23 12:28:27,405 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-23 12:28:27,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-23 12:28:27,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-23 12:28:27,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:28:27,407 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 49 states. [2018-11-23 12:28:28,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:28,500 INFO L93 Difference]: Finished difference Result 199 states and 211 transitions. [2018-11-23 12:28:28,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 12:28:28,500 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2018-11-23 12:28:28,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:28,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:28:28,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 150 transitions. [2018-11-23 12:28:28,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:28:28,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 150 transitions. [2018-11-23 12:28:28,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 150 transitions. [2018-11-23 12:28:28,716 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:28,719 INFO L225 Difference]: With dead ends: 199 [2018-11-23 12:28:28,719 INFO L226 Difference]: Without dead ends: 141 [2018-11-23 12:28:28,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:28:28,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-23 12:28:28,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-11-23 12:28:28,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:28,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand 139 states. [2018-11-23 12:28:28,806 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 139 states. [2018-11-23 12:28:28,806 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 139 states. [2018-11-23 12:28:28,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:28,810 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-11-23 12:28:28,810 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-11-23 12:28:28,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:28,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:28,811 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 141 states. [2018-11-23 12:28:28,811 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 141 states. [2018-11-23 12:28:28,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:28,814 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-11-23 12:28:28,814 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-11-23 12:28:28,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:28,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:28,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:28,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:28,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-23 12:28:28,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 143 transitions. [2018-11-23 12:28:28,817 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 143 transitions. Word has length 184 [2018-11-23 12:28:28,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:28,818 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 143 transitions. [2018-11-23 12:28:28,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-23 12:28:28,818 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2018-11-23 12:28:28,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-23 12:28:28,819 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:28,819 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 33, 33, 11, 11, 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-23 12:28:28,819 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:28,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:28,820 INFO L82 PathProgramCache]: Analyzing trace with hash 2006594855, now seen corresponding path program 36 times [2018-11-23 12:28:28,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:28,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:28,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:28,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:28,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:30,415 INFO L256 TraceCheckUtils]: 0: Hoare triple {30287#true} call ULTIMATE.init(); {30287#true} is VALID [2018-11-23 12:28:30,415 INFO L273 TraceCheckUtils]: 1: Hoare triple {30287#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30287#true} is VALID [2018-11-23 12:28:30,415 INFO L273 TraceCheckUtils]: 2: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:28:30,416 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30287#true} {30287#true} #66#return; {30287#true} is VALID [2018-11-23 12:28:30,416 INFO L256 TraceCheckUtils]: 4: Hoare triple {30287#true} call #t~ret13 := main(); {30287#true} is VALID [2018-11-23 12:28:30,416 INFO L273 TraceCheckUtils]: 5: Hoare triple {30287#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; {30289#(= main_~i~1 0)} is VALID [2018-11-23 12:28:30,417 INFO L273 TraceCheckUtils]: 6: Hoare triple {30289#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30289#(= main_~i~1 0)} is VALID [2018-11-23 12:28:30,418 INFO L273 TraceCheckUtils]: 7: Hoare triple {30289#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30290#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:30,419 INFO L273 TraceCheckUtils]: 8: Hoare triple {30290#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30290#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:30,420 INFO L273 TraceCheckUtils]: 9: Hoare triple {30290#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30291#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:30,420 INFO L273 TraceCheckUtils]: 10: Hoare triple {30291#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30291#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:30,421 INFO L273 TraceCheckUtils]: 11: Hoare triple {30291#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30292#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:30,422 INFO L273 TraceCheckUtils]: 12: Hoare triple {30292#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30292#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:30,423 INFO L273 TraceCheckUtils]: 13: Hoare triple {30292#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30293#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:30,423 INFO L273 TraceCheckUtils]: 14: Hoare triple {30293#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30293#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:30,424 INFO L273 TraceCheckUtils]: 15: Hoare triple {30293#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30294#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:30,425 INFO L273 TraceCheckUtils]: 16: Hoare triple {30294#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30294#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:30,426 INFO L273 TraceCheckUtils]: 17: Hoare triple {30294#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30295#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:30,427 INFO L273 TraceCheckUtils]: 18: Hoare triple {30295#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30295#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:30,427 INFO L273 TraceCheckUtils]: 19: Hoare triple {30295#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30296#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:30,428 INFO L273 TraceCheckUtils]: 20: Hoare triple {30296#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30296#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:30,429 INFO L273 TraceCheckUtils]: 21: Hoare triple {30296#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30297#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:30,430 INFO L273 TraceCheckUtils]: 22: Hoare triple {30297#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30297#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:30,430 INFO L273 TraceCheckUtils]: 23: Hoare triple {30297#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30298#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:30,431 INFO L273 TraceCheckUtils]: 24: Hoare triple {30298#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30298#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:30,432 INFO L273 TraceCheckUtils]: 25: Hoare triple {30298#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30299#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:30,433 INFO L273 TraceCheckUtils]: 26: Hoare triple {30299#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30299#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:30,434 INFO L273 TraceCheckUtils]: 27: Hoare triple {30299#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30300#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:30,434 INFO L273 TraceCheckUtils]: 28: Hoare triple {30300#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30300#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:30,435 INFO L273 TraceCheckUtils]: 29: Hoare triple {30300#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30301#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:30,436 INFO L273 TraceCheckUtils]: 30: Hoare triple {30301#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30301#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:30,437 INFO L273 TraceCheckUtils]: 31: Hoare triple {30301#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30302#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:30,437 INFO L273 TraceCheckUtils]: 32: Hoare triple {30302#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30302#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:30,438 INFO L273 TraceCheckUtils]: 33: Hoare triple {30302#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30303#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:30,439 INFO L273 TraceCheckUtils]: 34: Hoare triple {30303#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30303#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:30,440 INFO L273 TraceCheckUtils]: 35: Hoare triple {30303#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30304#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:30,440 INFO L273 TraceCheckUtils]: 36: Hoare triple {30304#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30304#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:30,441 INFO L273 TraceCheckUtils]: 37: Hoare triple {30304#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30305#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:30,442 INFO L273 TraceCheckUtils]: 38: Hoare triple {30305#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30305#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:30,443 INFO L273 TraceCheckUtils]: 39: Hoare triple {30305#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30306#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:30,444 INFO L273 TraceCheckUtils]: 40: Hoare triple {30306#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30306#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:30,444 INFO L273 TraceCheckUtils]: 41: Hoare triple {30306#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30307#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:30,445 INFO L273 TraceCheckUtils]: 42: Hoare triple {30307#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30307#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:30,446 INFO L273 TraceCheckUtils]: 43: Hoare triple {30307#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30308#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:30,447 INFO L273 TraceCheckUtils]: 44: Hoare triple {30308#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30308#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:30,448 INFO L273 TraceCheckUtils]: 45: Hoare triple {30308#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30309#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:30,448 INFO L273 TraceCheckUtils]: 46: Hoare triple {30309#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30309#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:30,449 INFO L273 TraceCheckUtils]: 47: Hoare triple {30309#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30310#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:30,450 INFO L273 TraceCheckUtils]: 48: Hoare triple {30310#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30310#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:30,451 INFO L273 TraceCheckUtils]: 49: Hoare triple {30310#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30311#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:30,451 INFO L273 TraceCheckUtils]: 50: Hoare triple {30311#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30311#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:30,452 INFO L273 TraceCheckUtils]: 51: Hoare triple {30311#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30312#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:30,453 INFO L273 TraceCheckUtils]: 52: Hoare triple {30312#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30312#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:30,454 INFO L273 TraceCheckUtils]: 53: Hoare triple {30312#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30313#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:30,454 INFO L273 TraceCheckUtils]: 54: Hoare triple {30313#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30313#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:30,455 INFO L273 TraceCheckUtils]: 55: Hoare triple {30313#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30314#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:30,456 INFO L273 TraceCheckUtils]: 56: Hoare triple {30314#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30314#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:30,457 INFO L273 TraceCheckUtils]: 57: Hoare triple {30314#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30315#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:30,458 INFO L273 TraceCheckUtils]: 58: Hoare triple {30315#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30315#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:30,458 INFO L273 TraceCheckUtils]: 59: Hoare triple {30315#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30316#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:30,459 INFO L273 TraceCheckUtils]: 60: Hoare triple {30316#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30316#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:30,460 INFO L273 TraceCheckUtils]: 61: Hoare triple {30316#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30317#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:30,461 INFO L273 TraceCheckUtils]: 62: Hoare triple {30317#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {30317#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:30,461 INFO L273 TraceCheckUtils]: 63: Hoare triple {30317#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30318#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:30,462 INFO L273 TraceCheckUtils]: 64: Hoare triple {30318#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30318#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:30,463 INFO L273 TraceCheckUtils]: 65: Hoare triple {30318#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30319#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:30,464 INFO L273 TraceCheckUtils]: 66: Hoare triple {30319#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30319#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:30,465 INFO L273 TraceCheckUtils]: 67: Hoare triple {30319#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30320#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:30,465 INFO L273 TraceCheckUtils]: 68: Hoare triple {30320#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30320#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:30,466 INFO L273 TraceCheckUtils]: 69: Hoare triple {30320#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30321#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:30,467 INFO L273 TraceCheckUtils]: 70: Hoare triple {30321#(<= main_~i~1 32)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30321#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:30,468 INFO L273 TraceCheckUtils]: 71: Hoare triple {30321#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30322#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:30,468 INFO L273 TraceCheckUtils]: 72: Hoare triple {30322#(<= main_~i~1 33)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30322#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:30,469 INFO L273 TraceCheckUtils]: 73: Hoare triple {30322#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30323#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:30,470 INFO L273 TraceCheckUtils]: 74: Hoare triple {30323#(<= main_~i~1 34)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30323#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:30,471 INFO L273 TraceCheckUtils]: 75: Hoare triple {30323#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30324#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:30,471 INFO L273 TraceCheckUtils]: 76: Hoare triple {30324#(<= main_~i~1 35)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30324#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:30,472 INFO L273 TraceCheckUtils]: 77: Hoare triple {30324#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30325#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:30,473 INFO L273 TraceCheckUtils]: 78: Hoare triple {30325#(<= main_~i~1 36)} assume !(~i~1 < 10000); {30288#false} is VALID [2018-11-23 12:28:30,473 INFO L256 TraceCheckUtils]: 79: Hoare triple {30288#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:28:30,474 INFO L273 TraceCheckUtils]: 80: Hoare triple {30287#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {30287#true} is VALID [2018-11-23 12:28:30,474 INFO L273 TraceCheckUtils]: 81: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,474 INFO L273 TraceCheckUtils]: 82: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,474 INFO L273 TraceCheckUtils]: 83: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,474 INFO L273 TraceCheckUtils]: 84: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,474 INFO L273 TraceCheckUtils]: 85: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,475 INFO L273 TraceCheckUtils]: 86: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,475 INFO L273 TraceCheckUtils]: 87: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,475 INFO L273 TraceCheckUtils]: 88: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,475 INFO L273 TraceCheckUtils]: 89: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,475 INFO L273 TraceCheckUtils]: 90: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,476 INFO L273 TraceCheckUtils]: 91: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,476 INFO L273 TraceCheckUtils]: 92: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,476 INFO L273 TraceCheckUtils]: 93: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,476 INFO L273 TraceCheckUtils]: 94: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,476 INFO L273 TraceCheckUtils]: 95: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,476 INFO L273 TraceCheckUtils]: 96: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,476 INFO L273 TraceCheckUtils]: 97: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,477 INFO L273 TraceCheckUtils]: 98: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,477 INFO L273 TraceCheckUtils]: 99: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,477 INFO L273 TraceCheckUtils]: 100: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,477 INFO L273 TraceCheckUtils]: 101: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,477 INFO L273 TraceCheckUtils]: 102: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,477 INFO L273 TraceCheckUtils]: 103: Hoare triple {30287#true} assume !(~i~0 < 10000); {30287#true} is VALID [2018-11-23 12:28:30,477 INFO L273 TraceCheckUtils]: 104: Hoare triple {30287#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30287#true} is VALID [2018-11-23 12:28:30,477 INFO L273 TraceCheckUtils]: 105: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:28:30,477 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {30287#true} {30288#false} #70#return; {30288#false} is VALID [2018-11-23 12:28:30,477 INFO L273 TraceCheckUtils]: 107: Hoare triple {30288#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {30288#false} is VALID [2018-11-23 12:28:30,478 INFO L256 TraceCheckUtils]: 108: Hoare triple {30288#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:28:30,478 INFO L273 TraceCheckUtils]: 109: Hoare triple {30287#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {30287#true} is VALID [2018-11-23 12:28:30,478 INFO L273 TraceCheckUtils]: 110: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,478 INFO L273 TraceCheckUtils]: 111: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,478 INFO L273 TraceCheckUtils]: 112: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,478 INFO L273 TraceCheckUtils]: 113: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,478 INFO L273 TraceCheckUtils]: 114: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,478 INFO L273 TraceCheckUtils]: 115: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,478 INFO L273 TraceCheckUtils]: 116: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,478 INFO L273 TraceCheckUtils]: 117: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,479 INFO L273 TraceCheckUtils]: 118: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,479 INFO L273 TraceCheckUtils]: 119: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,479 INFO L273 TraceCheckUtils]: 120: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,479 INFO L273 TraceCheckUtils]: 121: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,479 INFO L273 TraceCheckUtils]: 122: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,479 INFO L273 TraceCheckUtils]: 123: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,479 INFO L273 TraceCheckUtils]: 124: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,479 INFO L273 TraceCheckUtils]: 125: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,479 INFO L273 TraceCheckUtils]: 126: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,480 INFO L273 TraceCheckUtils]: 127: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,480 INFO L273 TraceCheckUtils]: 128: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,480 INFO L273 TraceCheckUtils]: 129: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,480 INFO L273 TraceCheckUtils]: 130: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,480 INFO L273 TraceCheckUtils]: 131: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,480 INFO L273 TraceCheckUtils]: 132: Hoare triple {30287#true} assume !(~i~0 < 10000); {30287#true} is VALID [2018-11-23 12:28:30,480 INFO L273 TraceCheckUtils]: 133: Hoare triple {30287#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30287#true} is VALID [2018-11-23 12:28:30,480 INFO L273 TraceCheckUtils]: 134: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:28:30,480 INFO L268 TraceCheckUtils]: 135: Hoare quadruple {30287#true} {30288#false} #72#return; {30288#false} is VALID [2018-11-23 12:28:30,480 INFO L273 TraceCheckUtils]: 136: Hoare triple {30288#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {30288#false} is VALID [2018-11-23 12:28:30,481 INFO L273 TraceCheckUtils]: 137: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30288#false} is VALID [2018-11-23 12:28:30,481 INFO L273 TraceCheckUtils]: 138: Hoare triple {30288#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30288#false} is VALID [2018-11-23 12:28:30,481 INFO L273 TraceCheckUtils]: 139: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30288#false} is VALID [2018-11-23 12:28:30,481 INFO L273 TraceCheckUtils]: 140: Hoare triple {30288#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30288#false} is VALID [2018-11-23 12:28:30,481 INFO L273 TraceCheckUtils]: 141: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30288#false} is VALID [2018-11-23 12:28:30,481 INFO L273 TraceCheckUtils]: 142: Hoare triple {30288#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30288#false} is VALID [2018-11-23 12:28:30,481 INFO L273 TraceCheckUtils]: 143: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30288#false} is VALID [2018-11-23 12:28:30,481 INFO L273 TraceCheckUtils]: 144: Hoare triple {30288#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30288#false} is VALID [2018-11-23 12:28:30,481 INFO L273 TraceCheckUtils]: 145: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30288#false} is VALID [2018-11-23 12:28:30,481 INFO L273 TraceCheckUtils]: 146: Hoare triple {30288#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30288#false} is VALID [2018-11-23 12:28:30,482 INFO L273 TraceCheckUtils]: 147: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30288#false} is VALID [2018-11-23 12:28:30,482 INFO L273 TraceCheckUtils]: 148: Hoare triple {30288#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30288#false} is VALID [2018-11-23 12:28:30,482 INFO L273 TraceCheckUtils]: 149: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30288#false} is VALID [2018-11-23 12:28:30,482 INFO L273 TraceCheckUtils]: 150: Hoare triple {30288#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30288#false} is VALID [2018-11-23 12:28:30,482 INFO L273 TraceCheckUtils]: 151: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30288#false} is VALID [2018-11-23 12:28:30,482 INFO L273 TraceCheckUtils]: 152: Hoare triple {30288#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30288#false} is VALID [2018-11-23 12:28:30,482 INFO L273 TraceCheckUtils]: 153: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30288#false} is VALID [2018-11-23 12:28:30,482 INFO L273 TraceCheckUtils]: 154: Hoare triple {30288#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30288#false} is VALID [2018-11-23 12:28:30,482 INFO L273 TraceCheckUtils]: 155: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30288#false} is VALID [2018-11-23 12:28:30,482 INFO L273 TraceCheckUtils]: 156: Hoare triple {30288#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30288#false} is VALID [2018-11-23 12:28:30,483 INFO L273 TraceCheckUtils]: 157: Hoare triple {30288#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30288#false} is VALID [2018-11-23 12:28:30,483 INFO L273 TraceCheckUtils]: 158: Hoare triple {30288#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30288#false} is VALID [2018-11-23 12:28:30,483 INFO L273 TraceCheckUtils]: 159: Hoare triple {30288#false} assume !(~i~2 < 9999); {30288#false} is VALID [2018-11-23 12:28:30,483 INFO L273 TraceCheckUtils]: 160: Hoare triple {30288#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {30288#false} is VALID [2018-11-23 12:28:30,483 INFO L256 TraceCheckUtils]: 161: Hoare triple {30288#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:28:30,483 INFO L273 TraceCheckUtils]: 162: Hoare triple {30287#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {30287#true} is VALID [2018-11-23 12:28:30,483 INFO L273 TraceCheckUtils]: 163: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,483 INFO L273 TraceCheckUtils]: 164: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,483 INFO L273 TraceCheckUtils]: 165: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,483 INFO L273 TraceCheckUtils]: 166: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,484 INFO L273 TraceCheckUtils]: 167: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,484 INFO L273 TraceCheckUtils]: 168: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,484 INFO L273 TraceCheckUtils]: 169: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,484 INFO L273 TraceCheckUtils]: 170: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,484 INFO L273 TraceCheckUtils]: 171: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,484 INFO L273 TraceCheckUtils]: 172: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,484 INFO L273 TraceCheckUtils]: 173: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,484 INFO L273 TraceCheckUtils]: 174: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,484 INFO L273 TraceCheckUtils]: 175: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,485 INFO L273 TraceCheckUtils]: 176: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,485 INFO L273 TraceCheckUtils]: 177: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,485 INFO L273 TraceCheckUtils]: 178: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,485 INFO L273 TraceCheckUtils]: 179: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,485 INFO L273 TraceCheckUtils]: 180: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,485 INFO L273 TraceCheckUtils]: 181: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,485 INFO L273 TraceCheckUtils]: 182: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,485 INFO L273 TraceCheckUtils]: 183: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:30,485 INFO L273 TraceCheckUtils]: 184: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:30,485 INFO L273 TraceCheckUtils]: 185: Hoare triple {30287#true} assume !(~i~0 < 10000); {30287#true} is VALID [2018-11-23 12:28:30,486 INFO L273 TraceCheckUtils]: 186: Hoare triple {30287#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30287#true} is VALID [2018-11-23 12:28:30,486 INFO L273 TraceCheckUtils]: 187: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:28:30,486 INFO L268 TraceCheckUtils]: 188: Hoare quadruple {30287#true} {30288#false} #74#return; {30288#false} is VALID [2018-11-23 12:28:30,486 INFO L273 TraceCheckUtils]: 189: Hoare triple {30288#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {30288#false} is VALID [2018-11-23 12:28:30,486 INFO L273 TraceCheckUtils]: 190: Hoare triple {30288#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {30288#false} is VALID [2018-11-23 12:28:30,486 INFO L273 TraceCheckUtils]: 191: Hoare triple {30288#false} assume !false; {30288#false} is VALID [2018-11-23 12:28:30,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1291 trivial. 0 not checked. [2018-11-23 12:28:30,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:30,503 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:30,513 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:28:33,549 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2018-11-23 12:28:33,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:33,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:34,500 INFO L256 TraceCheckUtils]: 0: Hoare triple {30287#true} call ULTIMATE.init(); {30287#true} is VALID [2018-11-23 12:28:34,500 INFO L273 TraceCheckUtils]: 1: Hoare triple {30287#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30287#true} is VALID [2018-11-23 12:28:34,500 INFO L273 TraceCheckUtils]: 2: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:28:34,500 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30287#true} {30287#true} #66#return; {30287#true} is VALID [2018-11-23 12:28:34,501 INFO L256 TraceCheckUtils]: 4: Hoare triple {30287#true} call #t~ret13 := main(); {30287#true} is VALID [2018-11-23 12:28:34,501 INFO L273 TraceCheckUtils]: 5: Hoare triple {30287#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; {30287#true} is VALID [2018-11-23 12:28:34,501 INFO L273 TraceCheckUtils]: 6: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,501 INFO L273 TraceCheckUtils]: 7: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,501 INFO L273 TraceCheckUtils]: 8: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,501 INFO L273 TraceCheckUtils]: 9: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,501 INFO L273 TraceCheckUtils]: 10: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,501 INFO L273 TraceCheckUtils]: 11: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,501 INFO L273 TraceCheckUtils]: 12: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,502 INFO L273 TraceCheckUtils]: 13: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,502 INFO L273 TraceCheckUtils]: 14: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,502 INFO L273 TraceCheckUtils]: 15: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,502 INFO L273 TraceCheckUtils]: 16: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,502 INFO L273 TraceCheckUtils]: 17: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,502 INFO L273 TraceCheckUtils]: 18: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,502 INFO L273 TraceCheckUtils]: 19: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,502 INFO L273 TraceCheckUtils]: 20: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,502 INFO L273 TraceCheckUtils]: 21: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,502 INFO L273 TraceCheckUtils]: 22: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,503 INFO L273 TraceCheckUtils]: 23: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,503 INFO L273 TraceCheckUtils]: 24: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,503 INFO L273 TraceCheckUtils]: 25: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,503 INFO L273 TraceCheckUtils]: 26: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,503 INFO L273 TraceCheckUtils]: 27: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,503 INFO L273 TraceCheckUtils]: 28: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,503 INFO L273 TraceCheckUtils]: 29: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,503 INFO L273 TraceCheckUtils]: 30: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,503 INFO L273 TraceCheckUtils]: 31: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,504 INFO L273 TraceCheckUtils]: 32: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,504 INFO L273 TraceCheckUtils]: 33: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,504 INFO L273 TraceCheckUtils]: 34: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,504 INFO L273 TraceCheckUtils]: 35: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,504 INFO L273 TraceCheckUtils]: 36: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,504 INFO L273 TraceCheckUtils]: 37: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,504 INFO L273 TraceCheckUtils]: 38: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,504 INFO L273 TraceCheckUtils]: 39: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,504 INFO L273 TraceCheckUtils]: 40: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,504 INFO L273 TraceCheckUtils]: 41: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,505 INFO L273 TraceCheckUtils]: 42: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,505 INFO L273 TraceCheckUtils]: 43: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,505 INFO L273 TraceCheckUtils]: 44: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,505 INFO L273 TraceCheckUtils]: 45: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,505 INFO L273 TraceCheckUtils]: 46: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,505 INFO L273 TraceCheckUtils]: 47: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,505 INFO L273 TraceCheckUtils]: 48: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,505 INFO L273 TraceCheckUtils]: 49: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,505 INFO L273 TraceCheckUtils]: 50: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,505 INFO L273 TraceCheckUtils]: 51: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,506 INFO L273 TraceCheckUtils]: 52: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,506 INFO L273 TraceCheckUtils]: 53: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,506 INFO L273 TraceCheckUtils]: 54: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,506 INFO L273 TraceCheckUtils]: 55: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,506 INFO L273 TraceCheckUtils]: 56: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,506 INFO L273 TraceCheckUtils]: 57: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,506 INFO L273 TraceCheckUtils]: 58: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,506 INFO L273 TraceCheckUtils]: 59: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,507 INFO L273 TraceCheckUtils]: 60: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,507 INFO L273 TraceCheckUtils]: 61: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,507 INFO L273 TraceCheckUtils]: 62: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,507 INFO L273 TraceCheckUtils]: 63: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,507 INFO L273 TraceCheckUtils]: 64: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,507 INFO L273 TraceCheckUtils]: 65: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,507 INFO L273 TraceCheckUtils]: 66: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,507 INFO L273 TraceCheckUtils]: 67: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,507 INFO L273 TraceCheckUtils]: 68: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,507 INFO L273 TraceCheckUtils]: 69: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,508 INFO L273 TraceCheckUtils]: 70: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,508 INFO L273 TraceCheckUtils]: 71: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,508 INFO L273 TraceCheckUtils]: 72: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,508 INFO L273 TraceCheckUtils]: 73: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,508 INFO L273 TraceCheckUtils]: 74: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,508 INFO L273 TraceCheckUtils]: 75: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,508 INFO L273 TraceCheckUtils]: 76: Hoare triple {30287#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:34,508 INFO L273 TraceCheckUtils]: 77: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:34,508 INFO L273 TraceCheckUtils]: 78: Hoare triple {30287#true} assume !(~i~1 < 10000); {30287#true} is VALID [2018-11-23 12:28:34,508 INFO L256 TraceCheckUtils]: 79: Hoare triple {30287#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:28:34,509 INFO L273 TraceCheckUtils]: 80: Hoare triple {30287#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {30287#true} is VALID [2018-11-23 12:28:34,509 INFO L273 TraceCheckUtils]: 81: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:34,509 INFO L273 TraceCheckUtils]: 82: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:34,509 INFO L273 TraceCheckUtils]: 83: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:34,509 INFO L273 TraceCheckUtils]: 84: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:34,509 INFO L273 TraceCheckUtils]: 85: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:34,509 INFO L273 TraceCheckUtils]: 86: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:34,509 INFO L273 TraceCheckUtils]: 87: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:34,509 INFO L273 TraceCheckUtils]: 88: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:34,510 INFO L273 TraceCheckUtils]: 89: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:34,510 INFO L273 TraceCheckUtils]: 90: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:34,510 INFO L273 TraceCheckUtils]: 91: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:34,510 INFO L273 TraceCheckUtils]: 92: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:34,510 INFO L273 TraceCheckUtils]: 93: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:34,510 INFO L273 TraceCheckUtils]: 94: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:34,510 INFO L273 TraceCheckUtils]: 95: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:34,510 INFO L273 TraceCheckUtils]: 96: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:34,510 INFO L273 TraceCheckUtils]: 97: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:34,510 INFO L273 TraceCheckUtils]: 98: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:34,511 INFO L273 TraceCheckUtils]: 99: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:34,511 INFO L273 TraceCheckUtils]: 100: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:34,511 INFO L273 TraceCheckUtils]: 101: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:34,511 INFO L273 TraceCheckUtils]: 102: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:34,511 INFO L273 TraceCheckUtils]: 103: Hoare triple {30287#true} assume !(~i~0 < 10000); {30287#true} is VALID [2018-11-23 12:28:34,511 INFO L273 TraceCheckUtils]: 104: Hoare triple {30287#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30287#true} is VALID [2018-11-23 12:28:34,511 INFO L273 TraceCheckUtils]: 105: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:28:34,511 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {30287#true} {30287#true} #70#return; {30287#true} is VALID [2018-11-23 12:28:34,511 INFO L273 TraceCheckUtils]: 107: Hoare triple {30287#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {30287#true} is VALID [2018-11-23 12:28:34,511 INFO L256 TraceCheckUtils]: 108: Hoare triple {30287#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:28:34,512 INFO L273 TraceCheckUtils]: 109: Hoare triple {30287#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {30287#true} is VALID [2018-11-23 12:28:34,512 INFO L273 TraceCheckUtils]: 110: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:34,512 INFO L273 TraceCheckUtils]: 111: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:34,512 INFO L273 TraceCheckUtils]: 112: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:34,512 INFO L273 TraceCheckUtils]: 113: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:34,512 INFO L273 TraceCheckUtils]: 114: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:34,512 INFO L273 TraceCheckUtils]: 115: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:34,512 INFO L273 TraceCheckUtils]: 116: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:34,512 INFO L273 TraceCheckUtils]: 117: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:34,513 INFO L273 TraceCheckUtils]: 118: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:34,513 INFO L273 TraceCheckUtils]: 119: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:34,513 INFO L273 TraceCheckUtils]: 120: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:34,513 INFO L273 TraceCheckUtils]: 121: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:34,513 INFO L273 TraceCheckUtils]: 122: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:34,513 INFO L273 TraceCheckUtils]: 123: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:34,513 INFO L273 TraceCheckUtils]: 124: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:34,513 INFO L273 TraceCheckUtils]: 125: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:34,513 INFO L273 TraceCheckUtils]: 126: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:34,513 INFO L273 TraceCheckUtils]: 127: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:34,514 INFO L273 TraceCheckUtils]: 128: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:34,514 INFO L273 TraceCheckUtils]: 129: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:34,514 INFO L273 TraceCheckUtils]: 130: Hoare triple {30287#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:34,514 INFO L273 TraceCheckUtils]: 131: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:34,514 INFO L273 TraceCheckUtils]: 132: Hoare triple {30287#true} assume !(~i~0 < 10000); {30287#true} is VALID [2018-11-23 12:28:34,514 INFO L273 TraceCheckUtils]: 133: Hoare triple {30287#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30287#true} is VALID [2018-11-23 12:28:34,514 INFO L273 TraceCheckUtils]: 134: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:28:34,514 INFO L268 TraceCheckUtils]: 135: Hoare quadruple {30287#true} {30287#true} #72#return; {30287#true} is VALID [2018-11-23 12:28:34,514 INFO L273 TraceCheckUtils]: 136: Hoare triple {30287#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {30287#true} is VALID [2018-11-23 12:28:34,514 INFO L273 TraceCheckUtils]: 137: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30287#true} is VALID [2018-11-23 12:28:34,515 INFO L273 TraceCheckUtils]: 138: Hoare triple {30287#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30287#true} is VALID [2018-11-23 12:28:34,515 INFO L273 TraceCheckUtils]: 139: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30287#true} is VALID [2018-11-23 12:28:34,515 INFO L273 TraceCheckUtils]: 140: Hoare triple {30287#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30287#true} is VALID [2018-11-23 12:28:34,515 INFO L273 TraceCheckUtils]: 141: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30287#true} is VALID [2018-11-23 12:28:34,515 INFO L273 TraceCheckUtils]: 142: Hoare triple {30287#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30287#true} is VALID [2018-11-23 12:28:34,515 INFO L273 TraceCheckUtils]: 143: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30287#true} is VALID [2018-11-23 12:28:34,515 INFO L273 TraceCheckUtils]: 144: Hoare triple {30287#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30287#true} is VALID [2018-11-23 12:28:34,515 INFO L273 TraceCheckUtils]: 145: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30287#true} is VALID [2018-11-23 12:28:34,515 INFO L273 TraceCheckUtils]: 146: Hoare triple {30287#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30287#true} is VALID [2018-11-23 12:28:34,516 INFO L273 TraceCheckUtils]: 147: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30287#true} is VALID [2018-11-23 12:28:34,516 INFO L273 TraceCheckUtils]: 148: Hoare triple {30287#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30287#true} is VALID [2018-11-23 12:28:34,516 INFO L273 TraceCheckUtils]: 149: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30287#true} is VALID [2018-11-23 12:28:34,516 INFO L273 TraceCheckUtils]: 150: Hoare triple {30287#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30287#true} is VALID [2018-11-23 12:28:34,516 INFO L273 TraceCheckUtils]: 151: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30287#true} is VALID [2018-11-23 12:28:34,516 INFO L273 TraceCheckUtils]: 152: Hoare triple {30287#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30287#true} is VALID [2018-11-23 12:28:34,516 INFO L273 TraceCheckUtils]: 153: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30287#true} is VALID [2018-11-23 12:28:34,516 INFO L273 TraceCheckUtils]: 154: Hoare triple {30287#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30287#true} is VALID [2018-11-23 12:28:34,516 INFO L273 TraceCheckUtils]: 155: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30287#true} is VALID [2018-11-23 12:28:34,516 INFO L273 TraceCheckUtils]: 156: Hoare triple {30287#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30287#true} is VALID [2018-11-23 12:28:34,517 INFO L273 TraceCheckUtils]: 157: Hoare triple {30287#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30287#true} is VALID [2018-11-23 12:28:34,517 INFO L273 TraceCheckUtils]: 158: Hoare triple {30287#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30287#true} is VALID [2018-11-23 12:28:34,517 INFO L273 TraceCheckUtils]: 159: Hoare triple {30287#true} assume !(~i~2 < 9999); {30287#true} is VALID [2018-11-23 12:28:34,517 INFO L273 TraceCheckUtils]: 160: Hoare triple {30287#true} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {30287#true} is VALID [2018-11-23 12:28:34,517 INFO L256 TraceCheckUtils]: 161: Hoare triple {30287#true} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:28:34,518 INFO L273 TraceCheckUtils]: 162: Hoare triple {30287#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {30815#(<= bor_~i~0 1)} is VALID [2018-11-23 12:28:34,521 INFO L273 TraceCheckUtils]: 163: Hoare triple {30815#(<= bor_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30815#(<= bor_~i~0 1)} is VALID [2018-11-23 12:28:34,521 INFO L273 TraceCheckUtils]: 164: Hoare triple {30815#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30822#(<= bor_~i~0 2)} is VALID [2018-11-23 12:28:34,523 INFO L273 TraceCheckUtils]: 165: Hoare triple {30822#(<= bor_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30822#(<= bor_~i~0 2)} is VALID [2018-11-23 12:28:34,524 INFO L273 TraceCheckUtils]: 166: Hoare triple {30822#(<= bor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30829#(<= bor_~i~0 3)} is VALID [2018-11-23 12:28:34,525 INFO L273 TraceCheckUtils]: 167: Hoare triple {30829#(<= bor_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30829#(<= bor_~i~0 3)} is VALID [2018-11-23 12:28:34,526 INFO L273 TraceCheckUtils]: 168: Hoare triple {30829#(<= bor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30836#(<= bor_~i~0 4)} is VALID [2018-11-23 12:28:34,527 INFO L273 TraceCheckUtils]: 169: Hoare triple {30836#(<= bor_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30836#(<= bor_~i~0 4)} is VALID [2018-11-23 12:28:34,528 INFO L273 TraceCheckUtils]: 170: Hoare triple {30836#(<= bor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30843#(<= bor_~i~0 5)} is VALID [2018-11-23 12:28:34,528 INFO L273 TraceCheckUtils]: 171: Hoare triple {30843#(<= bor_~i~0 5)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30843#(<= bor_~i~0 5)} is VALID [2018-11-23 12:28:34,530 INFO L273 TraceCheckUtils]: 172: Hoare triple {30843#(<= bor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30850#(<= bor_~i~0 6)} is VALID [2018-11-23 12:28:34,530 INFO L273 TraceCheckUtils]: 173: Hoare triple {30850#(<= bor_~i~0 6)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30850#(<= bor_~i~0 6)} is VALID [2018-11-23 12:28:34,532 INFO L273 TraceCheckUtils]: 174: Hoare triple {30850#(<= bor_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30857#(<= bor_~i~0 7)} is VALID [2018-11-23 12:28:34,532 INFO L273 TraceCheckUtils]: 175: Hoare triple {30857#(<= bor_~i~0 7)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30857#(<= bor_~i~0 7)} is VALID [2018-11-23 12:28:34,534 INFO L273 TraceCheckUtils]: 176: Hoare triple {30857#(<= bor_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30864#(<= bor_~i~0 8)} is VALID [2018-11-23 12:28:34,534 INFO L273 TraceCheckUtils]: 177: Hoare triple {30864#(<= bor_~i~0 8)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30864#(<= bor_~i~0 8)} is VALID [2018-11-23 12:28:34,537 INFO L273 TraceCheckUtils]: 178: Hoare triple {30864#(<= bor_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30871#(<= bor_~i~0 9)} is VALID [2018-11-23 12:28:34,537 INFO L273 TraceCheckUtils]: 179: Hoare triple {30871#(<= bor_~i~0 9)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30871#(<= bor_~i~0 9)} is VALID [2018-11-23 12:28:34,539 INFO L273 TraceCheckUtils]: 180: Hoare triple {30871#(<= bor_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30878#(<= bor_~i~0 10)} is VALID [2018-11-23 12:28:34,539 INFO L273 TraceCheckUtils]: 181: Hoare triple {30878#(<= bor_~i~0 10)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30878#(<= bor_~i~0 10)} is VALID [2018-11-23 12:28:34,542 INFO L273 TraceCheckUtils]: 182: Hoare triple {30878#(<= bor_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30885#(<= bor_~i~0 11)} is VALID [2018-11-23 12:28:34,542 INFO L273 TraceCheckUtils]: 183: Hoare triple {30885#(<= bor_~i~0 11)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30885#(<= bor_~i~0 11)} is VALID [2018-11-23 12:28:34,545 INFO L273 TraceCheckUtils]: 184: Hoare triple {30885#(<= bor_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30892#(<= bor_~i~0 12)} is VALID [2018-11-23 12:28:34,545 INFO L273 TraceCheckUtils]: 185: Hoare triple {30892#(<= bor_~i~0 12)} assume !(~i~0 < 10000); {30288#false} is VALID [2018-11-23 12:28:34,545 INFO L273 TraceCheckUtils]: 186: Hoare triple {30288#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30288#false} is VALID [2018-11-23 12:28:34,546 INFO L273 TraceCheckUtils]: 187: Hoare triple {30288#false} assume true; {30288#false} is VALID [2018-11-23 12:28:34,546 INFO L268 TraceCheckUtils]: 188: Hoare quadruple {30288#false} {30287#true} #74#return; {30288#false} is VALID [2018-11-23 12:28:34,546 INFO L273 TraceCheckUtils]: 189: Hoare triple {30288#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {30288#false} is VALID [2018-11-23 12:28:34,546 INFO L273 TraceCheckUtils]: 190: Hoare triple {30288#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {30288#false} is VALID [2018-11-23 12:28:34,546 INFO L273 TraceCheckUtils]: 191: Hoare triple {30288#false} assume !false; {30288#false} is VALID [2018-11-23 12:28:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 536 proven. 121 refuted. 0 times theorem prover too weak. 1930 trivial. 0 not checked. [2018-11-23 12:28:34,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:34,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 14] total 51 [2018-11-23 12:28:34,582 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2018-11-23 12:28:34,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:34,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states. [2018-11-23 12:28:34,817 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:34,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-23 12:28:34,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-23 12:28:34,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 12:28:34,819 INFO L87 Difference]: Start difference. First operand 139 states and 143 transitions. Second operand 51 states. [2018-11-23 12:28:36,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:36,753 INFO L93 Difference]: Finished difference Result 205 states and 217 transitions. [2018-11-23 12:28:36,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-23 12:28:36,753 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2018-11-23 12:28:36,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:36,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:28:36,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 154 transitions. [2018-11-23 12:28:36,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:28:36,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 154 transitions. [2018-11-23 12:28:36,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 154 transitions. [2018-11-23 12:28:36,976 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:36,979 INFO L225 Difference]: With dead ends: 205 [2018-11-23 12:28:36,979 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 12:28:36,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 12:28:36,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 12:28:37,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-11-23 12:28:37,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:37,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 143 states. [2018-11-23 12:28:37,053 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 143 states. [2018-11-23 12:28:37,054 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 143 states. [2018-11-23 12:28:37,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:37,057 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-11-23 12:28:37,057 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-23 12:28:37,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:37,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:37,058 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 145 states. [2018-11-23 12:28:37,058 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 145 states. [2018-11-23 12:28:37,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:37,061 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-11-23 12:28:37,061 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-23 12:28:37,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:37,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:37,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:37,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:37,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-23 12:28:37,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2018-11-23 12:28:37,064 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 192 [2018-11-23 12:28:37,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:37,065 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2018-11-23 12:28:37,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-23 12:28:37,065 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2018-11-23 12:28:37,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-23 12:28:37,066 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:37,066 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 11, 11, 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-23 12:28:37,066 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:37,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:37,067 INFO L82 PathProgramCache]: Analyzing trace with hash 2105744263, now seen corresponding path program 37 times [2018-11-23 12:28:37,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:37,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:37,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:37,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:37,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:38,681 INFO L256 TraceCheckUtils]: 0: Hoare triple {31721#true} call ULTIMATE.init(); {31721#true} is VALID [2018-11-23 12:28:38,681 INFO L273 TraceCheckUtils]: 1: Hoare triple {31721#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31721#true} is VALID [2018-11-23 12:28:38,682 INFO L273 TraceCheckUtils]: 2: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:28:38,682 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31721#true} {31721#true} #66#return; {31721#true} is VALID [2018-11-23 12:28:38,682 INFO L256 TraceCheckUtils]: 4: Hoare triple {31721#true} call #t~ret13 := main(); {31721#true} is VALID [2018-11-23 12:28:38,685 INFO L273 TraceCheckUtils]: 5: Hoare triple {31721#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; {31723#(= main_~i~1 0)} is VALID [2018-11-23 12:28:38,685 INFO L273 TraceCheckUtils]: 6: Hoare triple {31723#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31723#(= main_~i~1 0)} is VALID [2018-11-23 12:28:38,686 INFO L273 TraceCheckUtils]: 7: Hoare triple {31723#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31724#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:38,686 INFO L273 TraceCheckUtils]: 8: Hoare triple {31724#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31724#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:38,687 INFO L273 TraceCheckUtils]: 9: Hoare triple {31724#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31725#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:38,687 INFO L273 TraceCheckUtils]: 10: Hoare triple {31725#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31725#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:38,688 INFO L273 TraceCheckUtils]: 11: Hoare triple {31725#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31726#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:38,689 INFO L273 TraceCheckUtils]: 12: Hoare triple {31726#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31726#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:38,689 INFO L273 TraceCheckUtils]: 13: Hoare triple {31726#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31727#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:38,690 INFO L273 TraceCheckUtils]: 14: Hoare triple {31727#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31727#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:38,691 INFO L273 TraceCheckUtils]: 15: Hoare triple {31727#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31728#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:38,692 INFO L273 TraceCheckUtils]: 16: Hoare triple {31728#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31728#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:38,692 INFO L273 TraceCheckUtils]: 17: Hoare triple {31728#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31729#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:38,693 INFO L273 TraceCheckUtils]: 18: Hoare triple {31729#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31729#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:38,694 INFO L273 TraceCheckUtils]: 19: Hoare triple {31729#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31730#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:38,695 INFO L273 TraceCheckUtils]: 20: Hoare triple {31730#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31730#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:38,696 INFO L273 TraceCheckUtils]: 21: Hoare triple {31730#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31731#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:38,696 INFO L273 TraceCheckUtils]: 22: Hoare triple {31731#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31731#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:38,697 INFO L273 TraceCheckUtils]: 23: Hoare triple {31731#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31732#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:38,698 INFO L273 TraceCheckUtils]: 24: Hoare triple {31732#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31732#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:38,699 INFO L273 TraceCheckUtils]: 25: Hoare triple {31732#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31733#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:38,699 INFO L273 TraceCheckUtils]: 26: Hoare triple {31733#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31733#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:38,700 INFO L273 TraceCheckUtils]: 27: Hoare triple {31733#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31734#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:38,701 INFO L273 TraceCheckUtils]: 28: Hoare triple {31734#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31734#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:38,702 INFO L273 TraceCheckUtils]: 29: Hoare triple {31734#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31735#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:38,702 INFO L273 TraceCheckUtils]: 30: Hoare triple {31735#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31735#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:38,703 INFO L273 TraceCheckUtils]: 31: Hoare triple {31735#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31736#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:38,704 INFO L273 TraceCheckUtils]: 32: Hoare triple {31736#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31736#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:38,705 INFO L273 TraceCheckUtils]: 33: Hoare triple {31736#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31737#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:38,706 INFO L273 TraceCheckUtils]: 34: Hoare triple {31737#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31737#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:38,706 INFO L273 TraceCheckUtils]: 35: Hoare triple {31737#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31738#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:38,707 INFO L273 TraceCheckUtils]: 36: Hoare triple {31738#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31738#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:38,708 INFO L273 TraceCheckUtils]: 37: Hoare triple {31738#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31739#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:38,709 INFO L273 TraceCheckUtils]: 38: Hoare triple {31739#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31739#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:38,710 INFO L273 TraceCheckUtils]: 39: Hoare triple {31739#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31740#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:38,710 INFO L273 TraceCheckUtils]: 40: Hoare triple {31740#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31740#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:38,711 INFO L273 TraceCheckUtils]: 41: Hoare triple {31740#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31741#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:38,712 INFO L273 TraceCheckUtils]: 42: Hoare triple {31741#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31741#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:38,713 INFO L273 TraceCheckUtils]: 43: Hoare triple {31741#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31742#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:38,713 INFO L273 TraceCheckUtils]: 44: Hoare triple {31742#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31742#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:38,714 INFO L273 TraceCheckUtils]: 45: Hoare triple {31742#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31743#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:38,715 INFO L273 TraceCheckUtils]: 46: Hoare triple {31743#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31743#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:38,716 INFO L273 TraceCheckUtils]: 47: Hoare triple {31743#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31744#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:38,716 INFO L273 TraceCheckUtils]: 48: Hoare triple {31744#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31744#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:38,717 INFO L273 TraceCheckUtils]: 49: Hoare triple {31744#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31745#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:38,718 INFO L273 TraceCheckUtils]: 50: Hoare triple {31745#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31745#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:38,719 INFO L273 TraceCheckUtils]: 51: Hoare triple {31745#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31746#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:38,719 INFO L273 TraceCheckUtils]: 52: Hoare triple {31746#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31746#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:38,720 INFO L273 TraceCheckUtils]: 53: Hoare triple {31746#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31747#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:38,721 INFO L273 TraceCheckUtils]: 54: Hoare triple {31747#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31747#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:38,722 INFO L273 TraceCheckUtils]: 55: Hoare triple {31747#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31748#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:38,723 INFO L273 TraceCheckUtils]: 56: Hoare triple {31748#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31748#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:38,724 INFO L273 TraceCheckUtils]: 57: Hoare triple {31748#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31749#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:38,724 INFO L273 TraceCheckUtils]: 58: Hoare triple {31749#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31749#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:38,725 INFO L273 TraceCheckUtils]: 59: Hoare triple {31749#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31750#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:38,726 INFO L273 TraceCheckUtils]: 60: Hoare triple {31750#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31750#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:38,727 INFO L273 TraceCheckUtils]: 61: Hoare triple {31750#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31751#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:38,727 INFO L273 TraceCheckUtils]: 62: Hoare triple {31751#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31751#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:38,728 INFO L273 TraceCheckUtils]: 63: Hoare triple {31751#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31752#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:38,729 INFO L273 TraceCheckUtils]: 64: Hoare triple {31752#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31752#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:38,730 INFO L273 TraceCheckUtils]: 65: Hoare triple {31752#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31753#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:38,730 INFO L273 TraceCheckUtils]: 66: Hoare triple {31753#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31753#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:38,731 INFO L273 TraceCheckUtils]: 67: Hoare triple {31753#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31754#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:38,732 INFO L273 TraceCheckUtils]: 68: Hoare triple {31754#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31754#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:38,733 INFO L273 TraceCheckUtils]: 69: Hoare triple {31754#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31755#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:38,734 INFO L273 TraceCheckUtils]: 70: Hoare triple {31755#(<= main_~i~1 32)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31755#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:38,734 INFO L273 TraceCheckUtils]: 71: Hoare triple {31755#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31756#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:38,735 INFO L273 TraceCheckUtils]: 72: Hoare triple {31756#(<= main_~i~1 33)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31756#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:38,736 INFO L273 TraceCheckUtils]: 73: Hoare triple {31756#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31757#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:38,737 INFO L273 TraceCheckUtils]: 74: Hoare triple {31757#(<= main_~i~1 34)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31757#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:38,738 INFO L273 TraceCheckUtils]: 75: Hoare triple {31757#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31758#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:38,738 INFO L273 TraceCheckUtils]: 76: Hoare triple {31758#(<= main_~i~1 35)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31758#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:38,739 INFO L273 TraceCheckUtils]: 77: Hoare triple {31758#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31759#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:38,740 INFO L273 TraceCheckUtils]: 78: Hoare triple {31759#(<= main_~i~1 36)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31759#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:38,741 INFO L273 TraceCheckUtils]: 79: Hoare triple {31759#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31760#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:38,741 INFO L273 TraceCheckUtils]: 80: Hoare triple {31760#(<= main_~i~1 37)} assume !(~i~1 < 10000); {31722#false} is VALID [2018-11-23 12:28:38,742 INFO L256 TraceCheckUtils]: 81: Hoare triple {31722#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {31721#true} is VALID [2018-11-23 12:28:38,742 INFO L273 TraceCheckUtils]: 82: Hoare triple {31721#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {31721#true} is VALID [2018-11-23 12:28:38,742 INFO L273 TraceCheckUtils]: 83: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,742 INFO L273 TraceCheckUtils]: 84: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,742 INFO L273 TraceCheckUtils]: 85: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,743 INFO L273 TraceCheckUtils]: 86: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,743 INFO L273 TraceCheckUtils]: 87: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,743 INFO L273 TraceCheckUtils]: 88: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,743 INFO L273 TraceCheckUtils]: 89: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,743 INFO L273 TraceCheckUtils]: 90: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,744 INFO L273 TraceCheckUtils]: 91: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,744 INFO L273 TraceCheckUtils]: 92: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,744 INFO L273 TraceCheckUtils]: 93: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,744 INFO L273 TraceCheckUtils]: 94: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,744 INFO L273 TraceCheckUtils]: 95: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,744 INFO L273 TraceCheckUtils]: 96: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,745 INFO L273 TraceCheckUtils]: 97: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,745 INFO L273 TraceCheckUtils]: 98: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,745 INFO L273 TraceCheckUtils]: 99: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,745 INFO L273 TraceCheckUtils]: 100: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,745 INFO L273 TraceCheckUtils]: 101: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,746 INFO L273 TraceCheckUtils]: 102: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,746 INFO L273 TraceCheckUtils]: 103: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,746 INFO L273 TraceCheckUtils]: 104: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,746 INFO L273 TraceCheckUtils]: 105: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,746 INFO L273 TraceCheckUtils]: 106: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,746 INFO L273 TraceCheckUtils]: 107: Hoare triple {31721#true} assume !(~i~0 < 10000); {31721#true} is VALID [2018-11-23 12:28:38,746 INFO L273 TraceCheckUtils]: 108: Hoare triple {31721#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {31721#true} is VALID [2018-11-23 12:28:38,746 INFO L273 TraceCheckUtils]: 109: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:28:38,746 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {31721#true} {31722#false} #70#return; {31722#false} is VALID [2018-11-23 12:28:38,747 INFO L273 TraceCheckUtils]: 111: Hoare triple {31722#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {31722#false} is VALID [2018-11-23 12:28:38,747 INFO L256 TraceCheckUtils]: 112: Hoare triple {31722#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {31721#true} is VALID [2018-11-23 12:28:38,747 INFO L273 TraceCheckUtils]: 113: Hoare triple {31721#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {31721#true} is VALID [2018-11-23 12:28:38,747 INFO L273 TraceCheckUtils]: 114: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,747 INFO L273 TraceCheckUtils]: 115: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,747 INFO L273 TraceCheckUtils]: 116: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,747 INFO L273 TraceCheckUtils]: 117: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,747 INFO L273 TraceCheckUtils]: 118: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,747 INFO L273 TraceCheckUtils]: 119: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,748 INFO L273 TraceCheckUtils]: 120: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,748 INFO L273 TraceCheckUtils]: 121: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,748 INFO L273 TraceCheckUtils]: 122: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,748 INFO L273 TraceCheckUtils]: 123: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,748 INFO L273 TraceCheckUtils]: 124: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,748 INFO L273 TraceCheckUtils]: 125: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,748 INFO L273 TraceCheckUtils]: 126: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,748 INFO L273 TraceCheckUtils]: 127: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,748 INFO L273 TraceCheckUtils]: 128: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,748 INFO L273 TraceCheckUtils]: 129: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,749 INFO L273 TraceCheckUtils]: 130: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,749 INFO L273 TraceCheckUtils]: 131: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,749 INFO L273 TraceCheckUtils]: 132: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,749 INFO L273 TraceCheckUtils]: 133: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,749 INFO L273 TraceCheckUtils]: 134: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,749 INFO L273 TraceCheckUtils]: 135: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,749 INFO L273 TraceCheckUtils]: 136: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,749 INFO L273 TraceCheckUtils]: 137: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,749 INFO L273 TraceCheckUtils]: 138: Hoare triple {31721#true} assume !(~i~0 < 10000); {31721#true} is VALID [2018-11-23 12:28:38,749 INFO L273 TraceCheckUtils]: 139: Hoare triple {31721#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {31721#true} is VALID [2018-11-23 12:28:38,750 INFO L273 TraceCheckUtils]: 140: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:28:38,750 INFO L268 TraceCheckUtils]: 141: Hoare quadruple {31721#true} {31722#false} #72#return; {31722#false} is VALID [2018-11-23 12:28:38,750 INFO L273 TraceCheckUtils]: 142: Hoare triple {31722#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {31722#false} is VALID [2018-11-23 12:28:38,750 INFO L273 TraceCheckUtils]: 143: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:38,750 INFO L273 TraceCheckUtils]: 144: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:38,750 INFO L273 TraceCheckUtils]: 145: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:38,750 INFO L273 TraceCheckUtils]: 146: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:38,750 INFO L273 TraceCheckUtils]: 147: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:38,750 INFO L273 TraceCheckUtils]: 148: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:38,751 INFO L273 TraceCheckUtils]: 149: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:38,751 INFO L273 TraceCheckUtils]: 150: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:38,751 INFO L273 TraceCheckUtils]: 151: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:38,751 INFO L273 TraceCheckUtils]: 152: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:38,751 INFO L273 TraceCheckUtils]: 153: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:38,751 INFO L273 TraceCheckUtils]: 154: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:38,751 INFO L273 TraceCheckUtils]: 155: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:38,751 INFO L273 TraceCheckUtils]: 156: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:38,751 INFO L273 TraceCheckUtils]: 157: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:38,751 INFO L273 TraceCheckUtils]: 158: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:38,752 INFO L273 TraceCheckUtils]: 159: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:38,752 INFO L273 TraceCheckUtils]: 160: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:38,752 INFO L273 TraceCheckUtils]: 161: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:38,752 INFO L273 TraceCheckUtils]: 162: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:38,752 INFO L273 TraceCheckUtils]: 163: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:38,752 INFO L273 TraceCheckUtils]: 164: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:38,752 INFO L273 TraceCheckUtils]: 165: Hoare triple {31722#false} assume !(~i~2 < 9999); {31722#false} is VALID [2018-11-23 12:28:38,752 INFO L273 TraceCheckUtils]: 166: Hoare triple {31722#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {31722#false} is VALID [2018-11-23 12:28:38,752 INFO L256 TraceCheckUtils]: 167: Hoare triple {31722#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {31721#true} is VALID [2018-11-23 12:28:38,753 INFO L273 TraceCheckUtils]: 168: Hoare triple {31721#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {31721#true} is VALID [2018-11-23 12:28:38,753 INFO L273 TraceCheckUtils]: 169: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,753 INFO L273 TraceCheckUtils]: 170: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,753 INFO L273 TraceCheckUtils]: 171: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,753 INFO L273 TraceCheckUtils]: 172: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,753 INFO L273 TraceCheckUtils]: 173: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,753 INFO L273 TraceCheckUtils]: 174: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,753 INFO L273 TraceCheckUtils]: 175: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,753 INFO L273 TraceCheckUtils]: 176: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,753 INFO L273 TraceCheckUtils]: 177: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,754 INFO L273 TraceCheckUtils]: 178: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,754 INFO L273 TraceCheckUtils]: 179: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,754 INFO L273 TraceCheckUtils]: 180: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,754 INFO L273 TraceCheckUtils]: 181: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,754 INFO L273 TraceCheckUtils]: 182: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,754 INFO L273 TraceCheckUtils]: 183: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,754 INFO L273 TraceCheckUtils]: 184: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,754 INFO L273 TraceCheckUtils]: 185: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,754 INFO L273 TraceCheckUtils]: 186: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,754 INFO L273 TraceCheckUtils]: 187: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,755 INFO L273 TraceCheckUtils]: 188: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,755 INFO L273 TraceCheckUtils]: 189: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,755 INFO L273 TraceCheckUtils]: 190: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,755 INFO L273 TraceCheckUtils]: 191: Hoare triple {31721#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:38,755 INFO L273 TraceCheckUtils]: 192: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:38,755 INFO L273 TraceCheckUtils]: 193: Hoare triple {31721#true} assume !(~i~0 < 10000); {31721#true} is VALID [2018-11-23 12:28:38,755 INFO L273 TraceCheckUtils]: 194: Hoare triple {31721#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {31721#true} is VALID [2018-11-23 12:28:38,755 INFO L273 TraceCheckUtils]: 195: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:28:38,755 INFO L268 TraceCheckUtils]: 196: Hoare quadruple {31721#true} {31722#false} #74#return; {31722#false} is VALID [2018-11-23 12:28:38,756 INFO L273 TraceCheckUtils]: 197: Hoare triple {31722#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {31722#false} is VALID [2018-11-23 12:28:38,756 INFO L273 TraceCheckUtils]: 198: Hoare triple {31722#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {31722#false} is VALID [2018-11-23 12:28:38,756 INFO L273 TraceCheckUtils]: 199: Hoare triple {31722#false} assume !false; {31722#false} is VALID [2018-11-23 12:28:38,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2018-11-23 12:28:38,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:38,774 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:38,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:38,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:39,422 INFO L256 TraceCheckUtils]: 0: Hoare triple {31721#true} call ULTIMATE.init(); {31721#true} is VALID [2018-11-23 12:28:39,422 INFO L273 TraceCheckUtils]: 1: Hoare triple {31721#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31721#true} is VALID [2018-11-23 12:28:39,422 INFO L273 TraceCheckUtils]: 2: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:28:39,423 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31721#true} {31721#true} #66#return; {31721#true} is VALID [2018-11-23 12:28:39,423 INFO L256 TraceCheckUtils]: 4: Hoare triple {31721#true} call #t~ret13 := main(); {31721#true} is VALID [2018-11-23 12:28:39,424 INFO L273 TraceCheckUtils]: 5: Hoare triple {31721#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; {31779#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:39,424 INFO L273 TraceCheckUtils]: 6: Hoare triple {31779#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31779#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:39,426 INFO L273 TraceCheckUtils]: 7: Hoare triple {31779#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31724#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:39,427 INFO L273 TraceCheckUtils]: 8: Hoare triple {31724#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31724#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:39,428 INFO L273 TraceCheckUtils]: 9: Hoare triple {31724#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31725#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:39,428 INFO L273 TraceCheckUtils]: 10: Hoare triple {31725#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31725#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:39,430 INFO L273 TraceCheckUtils]: 11: Hoare triple {31725#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31726#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:39,430 INFO L273 TraceCheckUtils]: 12: Hoare triple {31726#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31726#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:39,432 INFO L273 TraceCheckUtils]: 13: Hoare triple {31726#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31727#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:39,432 INFO L273 TraceCheckUtils]: 14: Hoare triple {31727#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31727#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:39,434 INFO L273 TraceCheckUtils]: 15: Hoare triple {31727#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31728#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:39,434 INFO L273 TraceCheckUtils]: 16: Hoare triple {31728#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31728#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:39,436 INFO L273 TraceCheckUtils]: 17: Hoare triple {31728#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31729#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:39,436 INFO L273 TraceCheckUtils]: 18: Hoare triple {31729#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31729#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:39,438 INFO L273 TraceCheckUtils]: 19: Hoare triple {31729#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31730#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:39,438 INFO L273 TraceCheckUtils]: 20: Hoare triple {31730#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31730#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:39,440 INFO L273 TraceCheckUtils]: 21: Hoare triple {31730#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31731#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:39,440 INFO L273 TraceCheckUtils]: 22: Hoare triple {31731#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31731#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:39,442 INFO L273 TraceCheckUtils]: 23: Hoare triple {31731#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31732#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:39,442 INFO L273 TraceCheckUtils]: 24: Hoare triple {31732#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31732#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:39,444 INFO L273 TraceCheckUtils]: 25: Hoare triple {31732#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31733#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:39,444 INFO L273 TraceCheckUtils]: 26: Hoare triple {31733#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31733#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:39,445 INFO L273 TraceCheckUtils]: 27: Hoare triple {31733#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31734#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:39,445 INFO L273 TraceCheckUtils]: 28: Hoare triple {31734#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31734#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:39,446 INFO L273 TraceCheckUtils]: 29: Hoare triple {31734#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31735#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:39,446 INFO L273 TraceCheckUtils]: 30: Hoare triple {31735#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31735#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:39,448 INFO L273 TraceCheckUtils]: 31: Hoare triple {31735#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31736#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:39,448 INFO L273 TraceCheckUtils]: 32: Hoare triple {31736#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31736#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:39,450 INFO L273 TraceCheckUtils]: 33: Hoare triple {31736#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31737#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:39,450 INFO L273 TraceCheckUtils]: 34: Hoare triple {31737#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31737#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:39,452 INFO L273 TraceCheckUtils]: 35: Hoare triple {31737#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31738#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:39,452 INFO L273 TraceCheckUtils]: 36: Hoare triple {31738#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31738#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:39,454 INFO L273 TraceCheckUtils]: 37: Hoare triple {31738#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31739#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:39,454 INFO L273 TraceCheckUtils]: 38: Hoare triple {31739#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31739#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:39,456 INFO L273 TraceCheckUtils]: 39: Hoare triple {31739#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31740#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:39,456 INFO L273 TraceCheckUtils]: 40: Hoare triple {31740#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31740#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:39,458 INFO L273 TraceCheckUtils]: 41: Hoare triple {31740#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31741#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:39,458 INFO L273 TraceCheckUtils]: 42: Hoare triple {31741#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31741#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:39,460 INFO L273 TraceCheckUtils]: 43: Hoare triple {31741#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31742#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:39,460 INFO L273 TraceCheckUtils]: 44: Hoare triple {31742#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31742#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:39,462 INFO L273 TraceCheckUtils]: 45: Hoare triple {31742#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31743#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:39,462 INFO L273 TraceCheckUtils]: 46: Hoare triple {31743#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31743#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:39,463 INFO L273 TraceCheckUtils]: 47: Hoare triple {31743#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31744#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:39,464 INFO L273 TraceCheckUtils]: 48: Hoare triple {31744#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31744#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:39,464 INFO L273 TraceCheckUtils]: 49: Hoare triple {31744#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31745#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:39,466 INFO L273 TraceCheckUtils]: 50: Hoare triple {31745#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31745#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:39,467 INFO L273 TraceCheckUtils]: 51: Hoare triple {31745#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31746#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:39,468 INFO L273 TraceCheckUtils]: 52: Hoare triple {31746#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31746#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:39,469 INFO L273 TraceCheckUtils]: 53: Hoare triple {31746#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31747#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:39,470 INFO L273 TraceCheckUtils]: 54: Hoare triple {31747#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31747#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:39,471 INFO L273 TraceCheckUtils]: 55: Hoare triple {31747#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31748#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:39,472 INFO L273 TraceCheckUtils]: 56: Hoare triple {31748#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31748#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:39,473 INFO L273 TraceCheckUtils]: 57: Hoare triple {31748#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31749#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:39,474 INFO L273 TraceCheckUtils]: 58: Hoare triple {31749#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31749#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:39,475 INFO L273 TraceCheckUtils]: 59: Hoare triple {31749#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31750#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:39,476 INFO L273 TraceCheckUtils]: 60: Hoare triple {31750#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31750#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:39,477 INFO L273 TraceCheckUtils]: 61: Hoare triple {31750#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31751#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:39,478 INFO L273 TraceCheckUtils]: 62: Hoare triple {31751#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {31751#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:39,479 INFO L273 TraceCheckUtils]: 63: Hoare triple {31751#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31752#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:39,480 INFO L273 TraceCheckUtils]: 64: Hoare triple {31752#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31752#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:39,481 INFO L273 TraceCheckUtils]: 65: Hoare triple {31752#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31753#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:39,482 INFO L273 TraceCheckUtils]: 66: Hoare triple {31753#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31753#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:39,483 INFO L273 TraceCheckUtils]: 67: Hoare triple {31753#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31754#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:39,484 INFO L273 TraceCheckUtils]: 68: Hoare triple {31754#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31754#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:39,485 INFO L273 TraceCheckUtils]: 69: Hoare triple {31754#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31755#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:39,486 INFO L273 TraceCheckUtils]: 70: Hoare triple {31755#(<= main_~i~1 32)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31755#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:39,487 INFO L273 TraceCheckUtils]: 71: Hoare triple {31755#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31756#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:39,488 INFO L273 TraceCheckUtils]: 72: Hoare triple {31756#(<= main_~i~1 33)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31756#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:39,489 INFO L273 TraceCheckUtils]: 73: Hoare triple {31756#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31757#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:39,490 INFO L273 TraceCheckUtils]: 74: Hoare triple {31757#(<= main_~i~1 34)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31757#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:39,491 INFO L273 TraceCheckUtils]: 75: Hoare triple {31757#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31758#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:39,492 INFO L273 TraceCheckUtils]: 76: Hoare triple {31758#(<= main_~i~1 35)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31758#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:39,493 INFO L273 TraceCheckUtils]: 77: Hoare triple {31758#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31759#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:39,494 INFO L273 TraceCheckUtils]: 78: Hoare triple {31759#(<= main_~i~1 36)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31759#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:39,495 INFO L273 TraceCheckUtils]: 79: Hoare triple {31759#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31760#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:39,496 INFO L273 TraceCheckUtils]: 80: Hoare triple {31760#(<= main_~i~1 37)} assume !(~i~1 < 10000); {31722#false} is VALID [2018-11-23 12:28:39,496 INFO L256 TraceCheckUtils]: 81: Hoare triple {31722#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {31722#false} is VALID [2018-11-23 12:28:39,496 INFO L273 TraceCheckUtils]: 82: Hoare triple {31722#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {31722#false} is VALID [2018-11-23 12:28:39,496 INFO L273 TraceCheckUtils]: 83: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,497 INFO L273 TraceCheckUtils]: 84: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,497 INFO L273 TraceCheckUtils]: 85: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,497 INFO L273 TraceCheckUtils]: 86: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,497 INFO L273 TraceCheckUtils]: 87: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,497 INFO L273 TraceCheckUtils]: 88: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,497 INFO L273 TraceCheckUtils]: 89: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,498 INFO L273 TraceCheckUtils]: 90: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,498 INFO L273 TraceCheckUtils]: 91: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,498 INFO L273 TraceCheckUtils]: 92: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,498 INFO L273 TraceCheckUtils]: 93: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,498 INFO L273 TraceCheckUtils]: 94: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,498 INFO L273 TraceCheckUtils]: 95: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,498 INFO L273 TraceCheckUtils]: 96: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,499 INFO L273 TraceCheckUtils]: 97: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,499 INFO L273 TraceCheckUtils]: 98: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,499 INFO L273 TraceCheckUtils]: 99: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,499 INFO L273 TraceCheckUtils]: 100: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,499 INFO L273 TraceCheckUtils]: 101: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,499 INFO L273 TraceCheckUtils]: 102: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,499 INFO L273 TraceCheckUtils]: 103: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,499 INFO L273 TraceCheckUtils]: 104: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,499 INFO L273 TraceCheckUtils]: 105: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,500 INFO L273 TraceCheckUtils]: 106: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,500 INFO L273 TraceCheckUtils]: 107: Hoare triple {31722#false} assume !(~i~0 < 10000); {31722#false} is VALID [2018-11-23 12:28:39,500 INFO L273 TraceCheckUtils]: 108: Hoare triple {31722#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {31722#false} is VALID [2018-11-23 12:28:39,500 INFO L273 TraceCheckUtils]: 109: Hoare triple {31722#false} assume true; {31722#false} is VALID [2018-11-23 12:28:39,500 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {31722#false} {31722#false} #70#return; {31722#false} is VALID [2018-11-23 12:28:39,500 INFO L273 TraceCheckUtils]: 111: Hoare triple {31722#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {31722#false} is VALID [2018-11-23 12:28:39,500 INFO L256 TraceCheckUtils]: 112: Hoare triple {31722#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {31722#false} is VALID [2018-11-23 12:28:39,500 INFO L273 TraceCheckUtils]: 113: Hoare triple {31722#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {31722#false} is VALID [2018-11-23 12:28:39,500 INFO L273 TraceCheckUtils]: 114: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,500 INFO L273 TraceCheckUtils]: 115: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,501 INFO L273 TraceCheckUtils]: 116: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,501 INFO L273 TraceCheckUtils]: 117: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,501 INFO L273 TraceCheckUtils]: 118: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,501 INFO L273 TraceCheckUtils]: 119: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,501 INFO L273 TraceCheckUtils]: 120: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,501 INFO L273 TraceCheckUtils]: 121: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,501 INFO L273 TraceCheckUtils]: 122: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,501 INFO L273 TraceCheckUtils]: 123: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,501 INFO L273 TraceCheckUtils]: 124: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,501 INFO L273 TraceCheckUtils]: 125: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,502 INFO L273 TraceCheckUtils]: 126: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,502 INFO L273 TraceCheckUtils]: 127: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,502 INFO L273 TraceCheckUtils]: 128: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,502 INFO L273 TraceCheckUtils]: 129: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,502 INFO L273 TraceCheckUtils]: 130: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,502 INFO L273 TraceCheckUtils]: 131: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,502 INFO L273 TraceCheckUtils]: 132: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,502 INFO L273 TraceCheckUtils]: 133: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,502 INFO L273 TraceCheckUtils]: 134: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,502 INFO L273 TraceCheckUtils]: 135: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,503 INFO L273 TraceCheckUtils]: 136: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,503 INFO L273 TraceCheckUtils]: 137: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,503 INFO L273 TraceCheckUtils]: 138: Hoare triple {31722#false} assume !(~i~0 < 10000); {31722#false} is VALID [2018-11-23 12:28:39,503 INFO L273 TraceCheckUtils]: 139: Hoare triple {31722#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {31722#false} is VALID [2018-11-23 12:28:39,503 INFO L273 TraceCheckUtils]: 140: Hoare triple {31722#false} assume true; {31722#false} is VALID [2018-11-23 12:28:39,503 INFO L268 TraceCheckUtils]: 141: Hoare quadruple {31722#false} {31722#false} #72#return; {31722#false} is VALID [2018-11-23 12:28:39,503 INFO L273 TraceCheckUtils]: 142: Hoare triple {31722#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {31722#false} is VALID [2018-11-23 12:28:39,503 INFO L273 TraceCheckUtils]: 143: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:39,503 INFO L273 TraceCheckUtils]: 144: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:39,503 INFO L273 TraceCheckUtils]: 145: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:39,504 INFO L273 TraceCheckUtils]: 146: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:39,504 INFO L273 TraceCheckUtils]: 147: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:39,504 INFO L273 TraceCheckUtils]: 148: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:39,504 INFO L273 TraceCheckUtils]: 149: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:39,504 INFO L273 TraceCheckUtils]: 150: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:39,504 INFO L273 TraceCheckUtils]: 151: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:39,504 INFO L273 TraceCheckUtils]: 152: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:39,504 INFO L273 TraceCheckUtils]: 153: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:39,504 INFO L273 TraceCheckUtils]: 154: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:39,505 INFO L273 TraceCheckUtils]: 155: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:39,505 INFO L273 TraceCheckUtils]: 156: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:39,505 INFO L273 TraceCheckUtils]: 157: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:39,505 INFO L273 TraceCheckUtils]: 158: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:39,505 INFO L273 TraceCheckUtils]: 159: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:39,505 INFO L273 TraceCheckUtils]: 160: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:39,505 INFO L273 TraceCheckUtils]: 161: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:39,505 INFO L273 TraceCheckUtils]: 162: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:39,505 INFO L273 TraceCheckUtils]: 163: Hoare triple {31722#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:39,505 INFO L273 TraceCheckUtils]: 164: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:39,506 INFO L273 TraceCheckUtils]: 165: Hoare triple {31722#false} assume !(~i~2 < 9999); {31722#false} is VALID [2018-11-23 12:28:39,506 INFO L273 TraceCheckUtils]: 166: Hoare triple {31722#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {31722#false} is VALID [2018-11-23 12:28:39,506 INFO L256 TraceCheckUtils]: 167: Hoare triple {31722#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {31722#false} is VALID [2018-11-23 12:28:39,506 INFO L273 TraceCheckUtils]: 168: Hoare triple {31722#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {31722#false} is VALID [2018-11-23 12:28:39,506 INFO L273 TraceCheckUtils]: 169: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,506 INFO L273 TraceCheckUtils]: 170: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,506 INFO L273 TraceCheckUtils]: 171: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,506 INFO L273 TraceCheckUtils]: 172: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,506 INFO L273 TraceCheckUtils]: 173: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,506 INFO L273 TraceCheckUtils]: 174: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,507 INFO L273 TraceCheckUtils]: 175: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,507 INFO L273 TraceCheckUtils]: 176: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,507 INFO L273 TraceCheckUtils]: 177: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,507 INFO L273 TraceCheckUtils]: 178: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,507 INFO L273 TraceCheckUtils]: 179: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,507 INFO L273 TraceCheckUtils]: 180: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,507 INFO L273 TraceCheckUtils]: 181: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,507 INFO L273 TraceCheckUtils]: 182: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,507 INFO L273 TraceCheckUtils]: 183: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,507 INFO L273 TraceCheckUtils]: 184: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,508 INFO L273 TraceCheckUtils]: 185: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,508 INFO L273 TraceCheckUtils]: 186: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,508 INFO L273 TraceCheckUtils]: 187: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,508 INFO L273 TraceCheckUtils]: 188: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,508 INFO L273 TraceCheckUtils]: 189: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,508 INFO L273 TraceCheckUtils]: 190: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,508 INFO L273 TraceCheckUtils]: 191: Hoare triple {31722#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:39,508 INFO L273 TraceCheckUtils]: 192: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:39,508 INFO L273 TraceCheckUtils]: 193: Hoare triple {31722#false} assume !(~i~0 < 10000); {31722#false} is VALID [2018-11-23 12:28:39,508 INFO L273 TraceCheckUtils]: 194: Hoare triple {31722#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {31722#false} is VALID [2018-11-23 12:28:39,509 INFO L273 TraceCheckUtils]: 195: Hoare triple {31722#false} assume true; {31722#false} is VALID [2018-11-23 12:28:39,509 INFO L268 TraceCheckUtils]: 196: Hoare quadruple {31722#false} {31722#false} #74#return; {31722#false} is VALID [2018-11-23 12:28:39,509 INFO L273 TraceCheckUtils]: 197: Hoare triple {31722#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {31722#false} is VALID [2018-11-23 12:28:39,509 INFO L273 TraceCheckUtils]: 198: Hoare triple {31722#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {31722#false} is VALID [2018-11-23 12:28:39,509 INFO L273 TraceCheckUtils]: 199: Hoare triple {31722#false} assume !false; {31722#false} is VALID [2018-11-23 12:28:39,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2018-11-23 12:28:39,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:39,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-11-23 12:28:39,547 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 200 [2018-11-23 12:28:39,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:39,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 12:28:39,757 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-23 12:28:39,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 12:28:39,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 12:28:39,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:28:39,758 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 41 states. [2018-11-23 12:28:40,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:40,651 INFO L93 Difference]: Finished difference Result 208 states and 216 transitions. [2018-11-23 12:28:40,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:28:40,651 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 200 [2018-11-23 12:28:40,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:40,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:28:40,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 128 transitions. [2018-11-23 12:28:40,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:28:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 128 transitions. [2018-11-23 12:28:40,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 128 transitions. [2018-11-23 12:28:40,841 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:40,845 INFO L225 Difference]: With dead ends: 208 [2018-11-23 12:28:40,845 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 12:28:40,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:28:40,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 12:28:40,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-11-23 12:28:40,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:40,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 145 states. [2018-11-23 12:28:40,927 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 145 states. [2018-11-23 12:28:40,927 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 145 states. [2018-11-23 12:28:40,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:40,930 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2018-11-23 12:28:40,931 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2018-11-23 12:28:40,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:40,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:40,931 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 146 states. [2018-11-23 12:28:40,931 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 146 states. [2018-11-23 12:28:40,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:40,934 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2018-11-23 12:28:40,934 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2018-11-23 12:28:40,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:40,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:40,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:40,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:40,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-23 12:28:40,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 149 transitions. [2018-11-23 12:28:40,936 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 149 transitions. Word has length 200 [2018-11-23 12:28:40,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:40,936 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 149 transitions. [2018-11-23 12:28:40,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 12:28:40,936 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-23 12:28:40,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-23 12:28:40,937 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:40,937 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 36, 36, 11, 11, 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-23 12:28:40,938 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:40,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:40,938 INFO L82 PathProgramCache]: Analyzing trace with hash -283013655, now seen corresponding path program 38 times [2018-11-23 12:28:40,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:40,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:40,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:40,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:40,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:42,433 INFO L256 TraceCheckUtils]: 0: Hoare triple {33179#true} call ULTIMATE.init(); {33179#true} is VALID [2018-11-23 12:28:42,433 INFO L273 TraceCheckUtils]: 1: Hoare triple {33179#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33179#true} is VALID [2018-11-23 12:28:42,434 INFO L273 TraceCheckUtils]: 2: Hoare triple {33179#true} assume true; {33179#true} is VALID [2018-11-23 12:28:42,434 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33179#true} {33179#true} #66#return; {33179#true} is VALID [2018-11-23 12:28:42,434 INFO L256 TraceCheckUtils]: 4: Hoare triple {33179#true} call #t~ret13 := main(); {33179#true} is VALID [2018-11-23 12:28:42,435 INFO L273 TraceCheckUtils]: 5: Hoare triple {33179#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; {33181#(= main_~i~1 0)} is VALID [2018-11-23 12:28:42,435 INFO L273 TraceCheckUtils]: 6: Hoare triple {33181#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33181#(= main_~i~1 0)} is VALID [2018-11-23 12:28:42,436 INFO L273 TraceCheckUtils]: 7: Hoare triple {33181#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33182#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:42,436 INFO L273 TraceCheckUtils]: 8: Hoare triple {33182#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33182#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:42,437 INFO L273 TraceCheckUtils]: 9: Hoare triple {33182#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33183#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:42,437 INFO L273 TraceCheckUtils]: 10: Hoare triple {33183#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33183#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:42,438 INFO L273 TraceCheckUtils]: 11: Hoare triple {33183#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33184#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:42,438 INFO L273 TraceCheckUtils]: 12: Hoare triple {33184#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33184#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:42,439 INFO L273 TraceCheckUtils]: 13: Hoare triple {33184#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33185#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:42,440 INFO L273 TraceCheckUtils]: 14: Hoare triple {33185#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33185#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:42,441 INFO L273 TraceCheckUtils]: 15: Hoare triple {33185#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33186#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:42,441 INFO L273 TraceCheckUtils]: 16: Hoare triple {33186#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33186#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:42,442 INFO L273 TraceCheckUtils]: 17: Hoare triple {33186#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33187#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:42,443 INFO L273 TraceCheckUtils]: 18: Hoare triple {33187#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33187#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:42,444 INFO L273 TraceCheckUtils]: 19: Hoare triple {33187#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33188#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:42,444 INFO L273 TraceCheckUtils]: 20: Hoare triple {33188#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33188#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:42,445 INFO L273 TraceCheckUtils]: 21: Hoare triple {33188#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33189#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:42,446 INFO L273 TraceCheckUtils]: 22: Hoare triple {33189#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33189#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:42,447 INFO L273 TraceCheckUtils]: 23: Hoare triple {33189#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33190#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:42,447 INFO L273 TraceCheckUtils]: 24: Hoare triple {33190#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33190#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:42,448 INFO L273 TraceCheckUtils]: 25: Hoare triple {33190#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33191#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:42,449 INFO L273 TraceCheckUtils]: 26: Hoare triple {33191#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33191#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:42,450 INFO L273 TraceCheckUtils]: 27: Hoare triple {33191#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33192#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:42,451 INFO L273 TraceCheckUtils]: 28: Hoare triple {33192#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33192#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:42,451 INFO L273 TraceCheckUtils]: 29: Hoare triple {33192#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33193#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:42,452 INFO L273 TraceCheckUtils]: 30: Hoare triple {33193#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33193#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:42,453 INFO L273 TraceCheckUtils]: 31: Hoare triple {33193#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33194#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:42,454 INFO L273 TraceCheckUtils]: 32: Hoare triple {33194#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33194#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:42,454 INFO L273 TraceCheckUtils]: 33: Hoare triple {33194#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33195#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:42,455 INFO L273 TraceCheckUtils]: 34: Hoare triple {33195#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33195#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:42,456 INFO L273 TraceCheckUtils]: 35: Hoare triple {33195#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33196#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:42,457 INFO L273 TraceCheckUtils]: 36: Hoare triple {33196#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33196#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:42,458 INFO L273 TraceCheckUtils]: 37: Hoare triple {33196#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33197#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:42,458 INFO L273 TraceCheckUtils]: 38: Hoare triple {33197#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33197#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:42,459 INFO L273 TraceCheckUtils]: 39: Hoare triple {33197#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33198#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:42,460 INFO L273 TraceCheckUtils]: 40: Hoare triple {33198#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33198#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:42,461 INFO L273 TraceCheckUtils]: 41: Hoare triple {33198#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33199#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:42,461 INFO L273 TraceCheckUtils]: 42: Hoare triple {33199#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33199#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:42,462 INFO L273 TraceCheckUtils]: 43: Hoare triple {33199#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33200#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:42,463 INFO L273 TraceCheckUtils]: 44: Hoare triple {33200#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33200#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:42,464 INFO L273 TraceCheckUtils]: 45: Hoare triple {33200#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33201#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:42,465 INFO L273 TraceCheckUtils]: 46: Hoare triple {33201#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33201#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:42,465 INFO L273 TraceCheckUtils]: 47: Hoare triple {33201#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33202#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:42,466 INFO L273 TraceCheckUtils]: 48: Hoare triple {33202#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33202#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:42,467 INFO L273 TraceCheckUtils]: 49: Hoare triple {33202#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33203#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:42,468 INFO L273 TraceCheckUtils]: 50: Hoare triple {33203#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33203#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:42,469 INFO L273 TraceCheckUtils]: 51: Hoare triple {33203#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33204#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:42,469 INFO L273 TraceCheckUtils]: 52: Hoare triple {33204#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33204#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:42,470 INFO L273 TraceCheckUtils]: 53: Hoare triple {33204#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33205#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:42,471 INFO L273 TraceCheckUtils]: 54: Hoare triple {33205#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33205#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:42,472 INFO L273 TraceCheckUtils]: 55: Hoare triple {33205#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33206#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:42,472 INFO L273 TraceCheckUtils]: 56: Hoare triple {33206#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33206#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:42,473 INFO L273 TraceCheckUtils]: 57: Hoare triple {33206#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33207#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:42,474 INFO L273 TraceCheckUtils]: 58: Hoare triple {33207#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33207#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:42,475 INFO L273 TraceCheckUtils]: 59: Hoare triple {33207#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33208#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:42,475 INFO L273 TraceCheckUtils]: 60: Hoare triple {33208#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33208#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:42,476 INFO L273 TraceCheckUtils]: 61: Hoare triple {33208#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33209#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:42,477 INFO L273 TraceCheckUtils]: 62: Hoare triple {33209#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33209#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:42,478 INFO L273 TraceCheckUtils]: 63: Hoare triple {33209#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33210#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:42,479 INFO L273 TraceCheckUtils]: 64: Hoare triple {33210#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33210#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:42,480 INFO L273 TraceCheckUtils]: 65: Hoare triple {33210#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33211#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:42,480 INFO L273 TraceCheckUtils]: 66: Hoare triple {33211#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33211#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:42,481 INFO L273 TraceCheckUtils]: 67: Hoare triple {33211#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33212#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:42,482 INFO L273 TraceCheckUtils]: 68: Hoare triple {33212#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33212#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:42,483 INFO L273 TraceCheckUtils]: 69: Hoare triple {33212#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33213#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:42,483 INFO L273 TraceCheckUtils]: 70: Hoare triple {33213#(<= main_~i~1 32)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33213#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:42,484 INFO L273 TraceCheckUtils]: 71: Hoare triple {33213#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33214#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:42,485 INFO L273 TraceCheckUtils]: 72: Hoare triple {33214#(<= main_~i~1 33)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33214#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:42,486 INFO L273 TraceCheckUtils]: 73: Hoare triple {33214#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33215#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:42,486 INFO L273 TraceCheckUtils]: 74: Hoare triple {33215#(<= main_~i~1 34)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33215#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:42,487 INFO L273 TraceCheckUtils]: 75: Hoare triple {33215#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33216#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:42,488 INFO L273 TraceCheckUtils]: 76: Hoare triple {33216#(<= main_~i~1 35)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33216#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:42,489 INFO L273 TraceCheckUtils]: 77: Hoare triple {33216#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33217#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:42,489 INFO L273 TraceCheckUtils]: 78: Hoare triple {33217#(<= main_~i~1 36)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33217#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:42,490 INFO L273 TraceCheckUtils]: 79: Hoare triple {33217#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33218#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:42,491 INFO L273 TraceCheckUtils]: 80: Hoare triple {33218#(<= main_~i~1 37)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33218#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:42,492 INFO L273 TraceCheckUtils]: 81: Hoare triple {33218#(<= main_~i~1 37)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33219#(<= main_~i~1 38)} is VALID [2018-11-23 12:28:42,493 INFO L273 TraceCheckUtils]: 82: Hoare triple {33219#(<= main_~i~1 38)} assume !(~i~1 < 10000); {33180#false} is VALID [2018-11-23 12:28:42,493 INFO L256 TraceCheckUtils]: 83: Hoare triple {33180#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {33179#true} is VALID [2018-11-23 12:28:42,493 INFO L273 TraceCheckUtils]: 84: Hoare triple {33179#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {33179#true} is VALID [2018-11-23 12:28:42,493 INFO L273 TraceCheckUtils]: 85: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,494 INFO L273 TraceCheckUtils]: 86: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,494 INFO L273 TraceCheckUtils]: 87: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,494 INFO L273 TraceCheckUtils]: 88: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,494 INFO L273 TraceCheckUtils]: 89: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,494 INFO L273 TraceCheckUtils]: 90: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,494 INFO L273 TraceCheckUtils]: 91: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,495 INFO L273 TraceCheckUtils]: 92: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,495 INFO L273 TraceCheckUtils]: 93: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,495 INFO L273 TraceCheckUtils]: 94: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,495 INFO L273 TraceCheckUtils]: 95: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,495 INFO L273 TraceCheckUtils]: 96: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,495 INFO L273 TraceCheckUtils]: 97: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,496 INFO L273 TraceCheckUtils]: 98: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,496 INFO L273 TraceCheckUtils]: 99: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,496 INFO L273 TraceCheckUtils]: 100: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,496 INFO L273 TraceCheckUtils]: 101: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,496 INFO L273 TraceCheckUtils]: 102: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,497 INFO L273 TraceCheckUtils]: 103: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,497 INFO L273 TraceCheckUtils]: 104: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,497 INFO L273 TraceCheckUtils]: 105: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,497 INFO L273 TraceCheckUtils]: 106: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,497 INFO L273 TraceCheckUtils]: 107: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,497 INFO L273 TraceCheckUtils]: 108: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,497 INFO L273 TraceCheckUtils]: 109: Hoare triple {33179#true} assume !(~i~0 < 10000); {33179#true} is VALID [2018-11-23 12:28:42,497 INFO L273 TraceCheckUtils]: 110: Hoare triple {33179#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {33179#true} is VALID [2018-11-23 12:28:42,498 INFO L273 TraceCheckUtils]: 111: Hoare triple {33179#true} assume true; {33179#true} is VALID [2018-11-23 12:28:42,498 INFO L268 TraceCheckUtils]: 112: Hoare quadruple {33179#true} {33180#false} #70#return; {33180#false} is VALID [2018-11-23 12:28:42,498 INFO L273 TraceCheckUtils]: 113: Hoare triple {33180#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {33180#false} is VALID [2018-11-23 12:28:42,498 INFO L256 TraceCheckUtils]: 114: Hoare triple {33180#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {33179#true} is VALID [2018-11-23 12:28:42,498 INFO L273 TraceCheckUtils]: 115: Hoare triple {33179#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {33179#true} is VALID [2018-11-23 12:28:42,498 INFO L273 TraceCheckUtils]: 116: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,498 INFO L273 TraceCheckUtils]: 117: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,498 INFO L273 TraceCheckUtils]: 118: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,498 INFO L273 TraceCheckUtils]: 119: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,498 INFO L273 TraceCheckUtils]: 120: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,499 INFO L273 TraceCheckUtils]: 121: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,499 INFO L273 TraceCheckUtils]: 122: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,499 INFO L273 TraceCheckUtils]: 123: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,499 INFO L273 TraceCheckUtils]: 124: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,499 INFO L273 TraceCheckUtils]: 125: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,499 INFO L273 TraceCheckUtils]: 126: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,499 INFO L273 TraceCheckUtils]: 127: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,499 INFO L273 TraceCheckUtils]: 128: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,499 INFO L273 TraceCheckUtils]: 129: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,499 INFO L273 TraceCheckUtils]: 130: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,500 INFO L273 TraceCheckUtils]: 131: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,500 INFO L273 TraceCheckUtils]: 132: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,500 INFO L273 TraceCheckUtils]: 133: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,500 INFO L273 TraceCheckUtils]: 134: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,500 INFO L273 TraceCheckUtils]: 135: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,500 INFO L273 TraceCheckUtils]: 136: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,500 INFO L273 TraceCheckUtils]: 137: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,500 INFO L273 TraceCheckUtils]: 138: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,500 INFO L273 TraceCheckUtils]: 139: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,500 INFO L273 TraceCheckUtils]: 140: Hoare triple {33179#true} assume !(~i~0 < 10000); {33179#true} is VALID [2018-11-23 12:28:42,501 INFO L273 TraceCheckUtils]: 141: Hoare triple {33179#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {33179#true} is VALID [2018-11-23 12:28:42,501 INFO L273 TraceCheckUtils]: 142: Hoare triple {33179#true} assume true; {33179#true} is VALID [2018-11-23 12:28:42,501 INFO L268 TraceCheckUtils]: 143: Hoare quadruple {33179#true} {33180#false} #72#return; {33180#false} is VALID [2018-11-23 12:28:42,501 INFO L273 TraceCheckUtils]: 144: Hoare triple {33180#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {33180#false} is VALID [2018-11-23 12:28:42,501 INFO L273 TraceCheckUtils]: 145: Hoare triple {33180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:42,501 INFO L273 TraceCheckUtils]: 146: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:42,501 INFO L273 TraceCheckUtils]: 147: Hoare triple {33180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:42,501 INFO L273 TraceCheckUtils]: 148: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:42,501 INFO L273 TraceCheckUtils]: 149: Hoare triple {33180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:42,502 INFO L273 TraceCheckUtils]: 150: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:42,502 INFO L273 TraceCheckUtils]: 151: Hoare triple {33180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:42,502 INFO L273 TraceCheckUtils]: 152: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:42,502 INFO L273 TraceCheckUtils]: 153: Hoare triple {33180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:42,502 INFO L273 TraceCheckUtils]: 154: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:42,502 INFO L273 TraceCheckUtils]: 155: Hoare triple {33180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:42,502 INFO L273 TraceCheckUtils]: 156: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:42,502 INFO L273 TraceCheckUtils]: 157: Hoare triple {33180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:42,502 INFO L273 TraceCheckUtils]: 158: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:42,502 INFO L273 TraceCheckUtils]: 159: Hoare triple {33180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:42,503 INFO L273 TraceCheckUtils]: 160: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:42,503 INFO L273 TraceCheckUtils]: 161: Hoare triple {33180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:42,503 INFO L273 TraceCheckUtils]: 162: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:42,503 INFO L273 TraceCheckUtils]: 163: Hoare triple {33180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:42,503 INFO L273 TraceCheckUtils]: 164: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:42,503 INFO L273 TraceCheckUtils]: 165: Hoare triple {33180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:42,503 INFO L273 TraceCheckUtils]: 166: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:42,503 INFO L273 TraceCheckUtils]: 167: Hoare triple {33180#false} assume !(~i~2 < 9999); {33180#false} is VALID [2018-11-23 12:28:42,503 INFO L273 TraceCheckUtils]: 168: Hoare triple {33180#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {33180#false} is VALID [2018-11-23 12:28:42,503 INFO L256 TraceCheckUtils]: 169: Hoare triple {33180#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {33179#true} is VALID [2018-11-23 12:28:42,504 INFO L273 TraceCheckUtils]: 170: Hoare triple {33179#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {33179#true} is VALID [2018-11-23 12:28:42,504 INFO L273 TraceCheckUtils]: 171: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,504 INFO L273 TraceCheckUtils]: 172: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,504 INFO L273 TraceCheckUtils]: 173: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,504 INFO L273 TraceCheckUtils]: 174: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,504 INFO L273 TraceCheckUtils]: 175: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,504 INFO L273 TraceCheckUtils]: 176: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,504 INFO L273 TraceCheckUtils]: 177: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,504 INFO L273 TraceCheckUtils]: 178: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,504 INFO L273 TraceCheckUtils]: 179: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,505 INFO L273 TraceCheckUtils]: 180: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,505 INFO L273 TraceCheckUtils]: 181: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,505 INFO L273 TraceCheckUtils]: 182: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,505 INFO L273 TraceCheckUtils]: 183: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,505 INFO L273 TraceCheckUtils]: 184: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,505 INFO L273 TraceCheckUtils]: 185: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,505 INFO L273 TraceCheckUtils]: 186: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,505 INFO L273 TraceCheckUtils]: 187: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,505 INFO L273 TraceCheckUtils]: 188: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,505 INFO L273 TraceCheckUtils]: 189: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,506 INFO L273 TraceCheckUtils]: 190: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,506 INFO L273 TraceCheckUtils]: 191: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,506 INFO L273 TraceCheckUtils]: 192: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,506 INFO L273 TraceCheckUtils]: 193: Hoare triple {33179#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:42,506 INFO L273 TraceCheckUtils]: 194: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:42,506 INFO L273 TraceCheckUtils]: 195: Hoare triple {33179#true} assume !(~i~0 < 10000); {33179#true} is VALID [2018-11-23 12:28:42,506 INFO L273 TraceCheckUtils]: 196: Hoare triple {33179#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {33179#true} is VALID [2018-11-23 12:28:42,506 INFO L273 TraceCheckUtils]: 197: Hoare triple {33179#true} assume true; {33179#true} is VALID [2018-11-23 12:28:42,506 INFO L268 TraceCheckUtils]: 198: Hoare quadruple {33179#true} {33180#false} #74#return; {33180#false} is VALID [2018-11-23 12:28:42,506 INFO L273 TraceCheckUtils]: 199: Hoare triple {33180#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {33180#false} is VALID [2018-11-23 12:28:42,507 INFO L273 TraceCheckUtils]: 200: Hoare triple {33180#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {33180#false} is VALID [2018-11-23 12:28:42,507 INFO L273 TraceCheckUtils]: 201: Hoare triple {33180#false} assume !false; {33180#false} is VALID [2018-11-23 12:28:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2948 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2018-11-23 12:28:42,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:42,525 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:42,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:28:42,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:28:42,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:42,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:43,731 INFO L256 TraceCheckUtils]: 0: Hoare triple {33179#true} call ULTIMATE.init(); {33179#true} is VALID [2018-11-23 12:28:43,732 INFO L273 TraceCheckUtils]: 1: Hoare triple {33179#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33179#true} is VALID [2018-11-23 12:28:43,732 INFO L273 TraceCheckUtils]: 2: Hoare triple {33179#true} assume true; {33179#true} is VALID [2018-11-23 12:28:43,732 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33179#true} {33179#true} #66#return; {33179#true} is VALID [2018-11-23 12:28:43,733 INFO L256 TraceCheckUtils]: 4: Hoare triple {33179#true} call #t~ret13 := main(); {33179#true} is VALID [2018-11-23 12:28:43,734 INFO L273 TraceCheckUtils]: 5: Hoare triple {33179#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; {33238#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:43,734 INFO L273 TraceCheckUtils]: 6: Hoare triple {33238#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33238#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:43,735 INFO L273 TraceCheckUtils]: 7: Hoare triple {33238#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33182#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:43,735 INFO L273 TraceCheckUtils]: 8: Hoare triple {33182#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33182#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:43,736 INFO L273 TraceCheckUtils]: 9: Hoare triple {33182#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33183#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:43,736 INFO L273 TraceCheckUtils]: 10: Hoare triple {33183#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33183#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:43,737 INFO L273 TraceCheckUtils]: 11: Hoare triple {33183#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33184#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:43,737 INFO L273 TraceCheckUtils]: 12: Hoare triple {33184#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33184#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:43,738 INFO L273 TraceCheckUtils]: 13: Hoare triple {33184#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33185#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:43,739 INFO L273 TraceCheckUtils]: 14: Hoare triple {33185#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33185#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:43,740 INFO L273 TraceCheckUtils]: 15: Hoare triple {33185#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33186#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:43,741 INFO L273 TraceCheckUtils]: 16: Hoare triple {33186#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33186#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:43,741 INFO L273 TraceCheckUtils]: 17: Hoare triple {33186#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33187#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:43,742 INFO L273 TraceCheckUtils]: 18: Hoare triple {33187#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33187#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:43,743 INFO L273 TraceCheckUtils]: 19: Hoare triple {33187#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33188#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:43,744 INFO L273 TraceCheckUtils]: 20: Hoare triple {33188#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33188#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:43,745 INFO L273 TraceCheckUtils]: 21: Hoare triple {33188#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33189#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:43,745 INFO L273 TraceCheckUtils]: 22: Hoare triple {33189#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33189#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:43,746 INFO L273 TraceCheckUtils]: 23: Hoare triple {33189#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33190#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:43,747 INFO L273 TraceCheckUtils]: 24: Hoare triple {33190#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33190#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:43,748 INFO L273 TraceCheckUtils]: 25: Hoare triple {33190#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33191#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:43,748 INFO L273 TraceCheckUtils]: 26: Hoare triple {33191#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33191#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:43,749 INFO L273 TraceCheckUtils]: 27: Hoare triple {33191#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33192#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:43,750 INFO L273 TraceCheckUtils]: 28: Hoare triple {33192#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33192#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:43,751 INFO L273 TraceCheckUtils]: 29: Hoare triple {33192#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33193#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:43,751 INFO L273 TraceCheckUtils]: 30: Hoare triple {33193#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33193#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:43,752 INFO L273 TraceCheckUtils]: 31: Hoare triple {33193#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33194#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:43,753 INFO L273 TraceCheckUtils]: 32: Hoare triple {33194#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33194#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:43,754 INFO L273 TraceCheckUtils]: 33: Hoare triple {33194#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33195#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:43,755 INFO L273 TraceCheckUtils]: 34: Hoare triple {33195#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33195#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:43,756 INFO L273 TraceCheckUtils]: 35: Hoare triple {33195#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33196#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:43,756 INFO L273 TraceCheckUtils]: 36: Hoare triple {33196#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33196#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:43,757 INFO L273 TraceCheckUtils]: 37: Hoare triple {33196#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33197#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:43,758 INFO L273 TraceCheckUtils]: 38: Hoare triple {33197#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33197#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:43,759 INFO L273 TraceCheckUtils]: 39: Hoare triple {33197#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33198#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:43,759 INFO L273 TraceCheckUtils]: 40: Hoare triple {33198#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33198#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:43,760 INFO L273 TraceCheckUtils]: 41: Hoare triple {33198#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33199#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:43,761 INFO L273 TraceCheckUtils]: 42: Hoare triple {33199#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33199#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:43,762 INFO L273 TraceCheckUtils]: 43: Hoare triple {33199#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33200#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:43,762 INFO L273 TraceCheckUtils]: 44: Hoare triple {33200#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33200#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:43,763 INFO L273 TraceCheckUtils]: 45: Hoare triple {33200#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33201#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:43,764 INFO L273 TraceCheckUtils]: 46: Hoare triple {33201#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33201#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:43,765 INFO L273 TraceCheckUtils]: 47: Hoare triple {33201#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33202#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:43,766 INFO L273 TraceCheckUtils]: 48: Hoare triple {33202#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33202#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:43,766 INFO L273 TraceCheckUtils]: 49: Hoare triple {33202#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33203#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:43,767 INFO L273 TraceCheckUtils]: 50: Hoare triple {33203#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33203#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:43,768 INFO L273 TraceCheckUtils]: 51: Hoare triple {33203#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33204#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:43,769 INFO L273 TraceCheckUtils]: 52: Hoare triple {33204#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33204#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:43,770 INFO L273 TraceCheckUtils]: 53: Hoare triple {33204#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33205#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:43,770 INFO L273 TraceCheckUtils]: 54: Hoare triple {33205#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33205#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:43,771 INFO L273 TraceCheckUtils]: 55: Hoare triple {33205#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33206#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:43,772 INFO L273 TraceCheckUtils]: 56: Hoare triple {33206#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33206#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:43,773 INFO L273 TraceCheckUtils]: 57: Hoare triple {33206#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33207#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:43,773 INFO L273 TraceCheckUtils]: 58: Hoare triple {33207#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33207#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:43,774 INFO L273 TraceCheckUtils]: 59: Hoare triple {33207#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33208#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:43,775 INFO L273 TraceCheckUtils]: 60: Hoare triple {33208#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33208#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:43,776 INFO L273 TraceCheckUtils]: 61: Hoare triple {33208#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33209#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:43,777 INFO L273 TraceCheckUtils]: 62: Hoare triple {33209#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {33209#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:43,777 INFO L273 TraceCheckUtils]: 63: Hoare triple {33209#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33210#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:43,778 INFO L273 TraceCheckUtils]: 64: Hoare triple {33210#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33210#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:43,779 INFO L273 TraceCheckUtils]: 65: Hoare triple {33210#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33211#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:43,780 INFO L273 TraceCheckUtils]: 66: Hoare triple {33211#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33211#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:43,781 INFO L273 TraceCheckUtils]: 67: Hoare triple {33211#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33212#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:43,781 INFO L273 TraceCheckUtils]: 68: Hoare triple {33212#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33212#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:43,782 INFO L273 TraceCheckUtils]: 69: Hoare triple {33212#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33213#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:43,783 INFO L273 TraceCheckUtils]: 70: Hoare triple {33213#(<= main_~i~1 32)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33213#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:43,784 INFO L273 TraceCheckUtils]: 71: Hoare triple {33213#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33214#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:43,784 INFO L273 TraceCheckUtils]: 72: Hoare triple {33214#(<= main_~i~1 33)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33214#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:43,785 INFO L273 TraceCheckUtils]: 73: Hoare triple {33214#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33215#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:43,786 INFO L273 TraceCheckUtils]: 74: Hoare triple {33215#(<= main_~i~1 34)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33215#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:43,787 INFO L273 TraceCheckUtils]: 75: Hoare triple {33215#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33216#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:43,787 INFO L273 TraceCheckUtils]: 76: Hoare triple {33216#(<= main_~i~1 35)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33216#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:43,788 INFO L273 TraceCheckUtils]: 77: Hoare triple {33216#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33217#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:43,789 INFO L273 TraceCheckUtils]: 78: Hoare triple {33217#(<= main_~i~1 36)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33217#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:43,790 INFO L273 TraceCheckUtils]: 79: Hoare triple {33217#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33218#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:43,791 INFO L273 TraceCheckUtils]: 80: Hoare triple {33218#(<= main_~i~1 37)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33218#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:43,791 INFO L273 TraceCheckUtils]: 81: Hoare triple {33218#(<= main_~i~1 37)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33219#(<= main_~i~1 38)} is VALID [2018-11-23 12:28:43,792 INFO L273 TraceCheckUtils]: 82: Hoare triple {33219#(<= main_~i~1 38)} assume !(~i~1 < 10000); {33180#false} is VALID [2018-11-23 12:28:43,793 INFO L256 TraceCheckUtils]: 83: Hoare triple {33180#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {33180#false} is VALID [2018-11-23 12:28:43,793 INFO L273 TraceCheckUtils]: 84: Hoare triple {33180#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {33180#false} is VALID [2018-11-23 12:28:43,793 INFO L273 TraceCheckUtils]: 85: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,793 INFO L273 TraceCheckUtils]: 86: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,793 INFO L273 TraceCheckUtils]: 87: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,793 INFO L273 TraceCheckUtils]: 88: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,794 INFO L273 TraceCheckUtils]: 89: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,794 INFO L273 TraceCheckUtils]: 90: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,794 INFO L273 TraceCheckUtils]: 91: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,794 INFO L273 TraceCheckUtils]: 92: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,794 INFO L273 TraceCheckUtils]: 93: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,795 INFO L273 TraceCheckUtils]: 94: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,795 INFO L273 TraceCheckUtils]: 95: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,795 INFO L273 TraceCheckUtils]: 96: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,795 INFO L273 TraceCheckUtils]: 97: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,795 INFO L273 TraceCheckUtils]: 98: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,795 INFO L273 TraceCheckUtils]: 99: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,796 INFO L273 TraceCheckUtils]: 100: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,796 INFO L273 TraceCheckUtils]: 101: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,796 INFO L273 TraceCheckUtils]: 102: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,796 INFO L273 TraceCheckUtils]: 103: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,796 INFO L273 TraceCheckUtils]: 104: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,796 INFO L273 TraceCheckUtils]: 105: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,797 INFO L273 TraceCheckUtils]: 106: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,797 INFO L273 TraceCheckUtils]: 107: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,797 INFO L273 TraceCheckUtils]: 108: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,797 INFO L273 TraceCheckUtils]: 109: Hoare triple {33180#false} assume !(~i~0 < 10000); {33180#false} is VALID [2018-11-23 12:28:43,797 INFO L273 TraceCheckUtils]: 110: Hoare triple {33180#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {33180#false} is VALID [2018-11-23 12:28:43,797 INFO L273 TraceCheckUtils]: 111: Hoare triple {33180#false} assume true; {33180#false} is VALID [2018-11-23 12:28:43,798 INFO L268 TraceCheckUtils]: 112: Hoare quadruple {33180#false} {33180#false} #70#return; {33180#false} is VALID [2018-11-23 12:28:43,798 INFO L273 TraceCheckUtils]: 113: Hoare triple {33180#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {33180#false} is VALID [2018-11-23 12:28:43,798 INFO L256 TraceCheckUtils]: 114: Hoare triple {33180#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {33180#false} is VALID [2018-11-23 12:28:43,798 INFO L273 TraceCheckUtils]: 115: Hoare triple {33180#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {33180#false} is VALID [2018-11-23 12:28:43,798 INFO L273 TraceCheckUtils]: 116: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,798 INFO L273 TraceCheckUtils]: 117: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,798 INFO L273 TraceCheckUtils]: 118: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,798 INFO L273 TraceCheckUtils]: 119: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,798 INFO L273 TraceCheckUtils]: 120: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,799 INFO L273 TraceCheckUtils]: 121: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,799 INFO L273 TraceCheckUtils]: 122: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,799 INFO L273 TraceCheckUtils]: 123: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,799 INFO L273 TraceCheckUtils]: 124: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,799 INFO L273 TraceCheckUtils]: 125: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,799 INFO L273 TraceCheckUtils]: 126: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,799 INFO L273 TraceCheckUtils]: 127: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,799 INFO L273 TraceCheckUtils]: 128: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,799 INFO L273 TraceCheckUtils]: 129: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,799 INFO L273 TraceCheckUtils]: 130: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,800 INFO L273 TraceCheckUtils]: 131: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,800 INFO L273 TraceCheckUtils]: 132: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,824 INFO L273 TraceCheckUtils]: 133: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,825 INFO L273 TraceCheckUtils]: 134: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,825 INFO L273 TraceCheckUtils]: 135: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,825 INFO L273 TraceCheckUtils]: 136: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,825 INFO L273 TraceCheckUtils]: 137: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,825 INFO L273 TraceCheckUtils]: 138: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,825 INFO L273 TraceCheckUtils]: 139: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,825 INFO L273 TraceCheckUtils]: 140: Hoare triple {33180#false} assume !(~i~0 < 10000); {33180#false} is VALID [2018-11-23 12:28:43,826 INFO L273 TraceCheckUtils]: 141: Hoare triple {33180#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {33180#false} is VALID [2018-11-23 12:28:43,826 INFO L273 TraceCheckUtils]: 142: Hoare triple {33180#false} assume true; {33180#false} is VALID [2018-11-23 12:28:43,826 INFO L268 TraceCheckUtils]: 143: Hoare quadruple {33180#false} {33180#false} #72#return; {33180#false} is VALID [2018-11-23 12:28:43,826 INFO L273 TraceCheckUtils]: 144: Hoare triple {33180#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {33180#false} is VALID [2018-11-23 12:28:43,826 INFO L273 TraceCheckUtils]: 145: Hoare triple {33180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:43,826 INFO L273 TraceCheckUtils]: 146: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:43,826 INFO L273 TraceCheckUtils]: 147: Hoare triple {33180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:43,827 INFO L273 TraceCheckUtils]: 148: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:43,827 INFO L273 TraceCheckUtils]: 149: Hoare triple {33180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:43,827 INFO L273 TraceCheckUtils]: 150: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:43,827 INFO L273 TraceCheckUtils]: 151: Hoare triple {33180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:43,827 INFO L273 TraceCheckUtils]: 152: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:43,827 INFO L273 TraceCheckUtils]: 153: Hoare triple {33180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:43,827 INFO L273 TraceCheckUtils]: 154: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:43,828 INFO L273 TraceCheckUtils]: 155: Hoare triple {33180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:43,828 INFO L273 TraceCheckUtils]: 156: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:43,828 INFO L273 TraceCheckUtils]: 157: Hoare triple {33180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:43,828 INFO L273 TraceCheckUtils]: 158: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:43,828 INFO L273 TraceCheckUtils]: 159: Hoare triple {33180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:43,828 INFO L273 TraceCheckUtils]: 160: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:43,828 INFO L273 TraceCheckUtils]: 161: Hoare triple {33180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:43,828 INFO L273 TraceCheckUtils]: 162: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:43,829 INFO L273 TraceCheckUtils]: 163: Hoare triple {33180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:43,829 INFO L273 TraceCheckUtils]: 164: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:43,829 INFO L273 TraceCheckUtils]: 165: Hoare triple {33180#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:43,829 INFO L273 TraceCheckUtils]: 166: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:43,829 INFO L273 TraceCheckUtils]: 167: Hoare triple {33180#false} assume !(~i~2 < 9999); {33180#false} is VALID [2018-11-23 12:28:43,829 INFO L273 TraceCheckUtils]: 168: Hoare triple {33180#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {33180#false} is VALID [2018-11-23 12:28:43,829 INFO L256 TraceCheckUtils]: 169: Hoare triple {33180#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {33180#false} is VALID [2018-11-23 12:28:43,829 INFO L273 TraceCheckUtils]: 170: Hoare triple {33180#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {33180#false} is VALID [2018-11-23 12:28:43,829 INFO L273 TraceCheckUtils]: 171: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,829 INFO L273 TraceCheckUtils]: 172: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,830 INFO L273 TraceCheckUtils]: 173: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,830 INFO L273 TraceCheckUtils]: 174: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,830 INFO L273 TraceCheckUtils]: 175: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,830 INFO L273 TraceCheckUtils]: 176: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,830 INFO L273 TraceCheckUtils]: 177: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,830 INFO L273 TraceCheckUtils]: 178: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,830 INFO L273 TraceCheckUtils]: 179: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,830 INFO L273 TraceCheckUtils]: 180: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,830 INFO L273 TraceCheckUtils]: 181: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,830 INFO L273 TraceCheckUtils]: 182: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,831 INFO L273 TraceCheckUtils]: 183: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,831 INFO L273 TraceCheckUtils]: 184: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,831 INFO L273 TraceCheckUtils]: 185: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,831 INFO L273 TraceCheckUtils]: 186: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,831 INFO L273 TraceCheckUtils]: 187: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,831 INFO L273 TraceCheckUtils]: 188: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,831 INFO L273 TraceCheckUtils]: 189: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,831 INFO L273 TraceCheckUtils]: 190: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,831 INFO L273 TraceCheckUtils]: 191: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,831 INFO L273 TraceCheckUtils]: 192: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,832 INFO L273 TraceCheckUtils]: 193: Hoare triple {33180#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:43,832 INFO L273 TraceCheckUtils]: 194: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:43,832 INFO L273 TraceCheckUtils]: 195: Hoare triple {33180#false} assume !(~i~0 < 10000); {33180#false} is VALID [2018-11-23 12:28:43,832 INFO L273 TraceCheckUtils]: 196: Hoare triple {33180#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {33180#false} is VALID [2018-11-23 12:28:43,832 INFO L273 TraceCheckUtils]: 197: Hoare triple {33180#false} assume true; {33180#false} is VALID [2018-11-23 12:28:43,832 INFO L268 TraceCheckUtils]: 198: Hoare quadruple {33180#false} {33180#false} #74#return; {33180#false} is VALID [2018-11-23 12:28:43,832 INFO L273 TraceCheckUtils]: 199: Hoare triple {33180#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {33180#false} is VALID [2018-11-23 12:28:43,832 INFO L273 TraceCheckUtils]: 200: Hoare triple {33180#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {33180#false} is VALID [2018-11-23 12:28:43,832 INFO L273 TraceCheckUtils]: 201: Hoare triple {33180#false} assume !false; {33180#false} is VALID [2018-11-23 12:28:43,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2948 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2018-11-23 12:28:43,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:43,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-23 12:28:43,871 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 202 [2018-11-23 12:28:43,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:43,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:28:44,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:44,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:28:44,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:28:44,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:28:44,044 INFO L87 Difference]: Start difference. First operand 145 states and 149 transitions. Second operand 42 states. [2018-11-23 12:28:44,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:44,546 INFO L93 Difference]: Finished difference Result 210 states and 218 transitions. [2018-11-23 12:28:44,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 12:28:44,546 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 202 [2018-11-23 12:28:44,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:28:44,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 130 transitions. [2018-11-23 12:28:44,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:28:44,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 130 transitions. [2018-11-23 12:28:44,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 130 transitions. [2018-11-23 12:28:44,773 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:44,775 INFO L225 Difference]: With dead ends: 210 [2018-11-23 12:28:44,776 INFO L226 Difference]: Without dead ends: 148 [2018-11-23 12:28:44,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:28:44,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-23 12:28:44,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-11-23 12:28:44,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:44,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 147 states. [2018-11-23 12:28:44,916 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 147 states. [2018-11-23 12:28:44,916 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 147 states. [2018-11-23 12:28:44,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:44,919 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-11-23 12:28:44,920 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2018-11-23 12:28:44,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:44,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:44,920 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 148 states. [2018-11-23 12:28:44,920 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 148 states. [2018-11-23 12:28:44,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:44,923 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-11-23 12:28:44,924 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2018-11-23 12:28:44,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:44,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:44,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:44,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:44,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-23 12:28:44,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2018-11-23 12:28:44,927 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 202 [2018-11-23 12:28:44,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:44,928 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2018-11-23 12:28:44,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:28:44,928 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2018-11-23 12:28:44,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-23 12:28:44,929 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:44,929 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 36, 36, 11, 11, 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-23 12:28:44,929 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:44,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:44,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1928130507, now seen corresponding path program 39 times [2018-11-23 12:28:44,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:44,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:44,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:44,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:44,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:46,497 INFO L256 TraceCheckUtils]: 0: Hoare triple {34654#true} call ULTIMATE.init(); {34654#true} is VALID [2018-11-23 12:28:46,498 INFO L273 TraceCheckUtils]: 1: Hoare triple {34654#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34654#true} is VALID [2018-11-23 12:28:46,498 INFO L273 TraceCheckUtils]: 2: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:28:46,498 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34654#true} {34654#true} #66#return; {34654#true} is VALID [2018-11-23 12:28:46,498 INFO L256 TraceCheckUtils]: 4: Hoare triple {34654#true} call #t~ret13 := main(); {34654#true} is VALID [2018-11-23 12:28:46,499 INFO L273 TraceCheckUtils]: 5: Hoare triple {34654#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; {34656#(= main_~i~1 0)} is VALID [2018-11-23 12:28:46,500 INFO L273 TraceCheckUtils]: 6: Hoare triple {34656#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34656#(= main_~i~1 0)} is VALID [2018-11-23 12:28:46,500 INFO L273 TraceCheckUtils]: 7: Hoare triple {34656#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34657#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:46,501 INFO L273 TraceCheckUtils]: 8: Hoare triple {34657#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34657#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:46,502 INFO L273 TraceCheckUtils]: 9: Hoare triple {34657#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34658#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:46,503 INFO L273 TraceCheckUtils]: 10: Hoare triple {34658#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34658#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:46,504 INFO L273 TraceCheckUtils]: 11: Hoare triple {34658#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34659#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:46,504 INFO L273 TraceCheckUtils]: 12: Hoare triple {34659#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34659#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:46,505 INFO L273 TraceCheckUtils]: 13: Hoare triple {34659#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34660#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:46,506 INFO L273 TraceCheckUtils]: 14: Hoare triple {34660#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34660#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:46,507 INFO L273 TraceCheckUtils]: 15: Hoare triple {34660#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34661#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:46,507 INFO L273 TraceCheckUtils]: 16: Hoare triple {34661#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34661#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:46,508 INFO L273 TraceCheckUtils]: 17: Hoare triple {34661#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34662#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:46,509 INFO L273 TraceCheckUtils]: 18: Hoare triple {34662#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34662#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:46,510 INFO L273 TraceCheckUtils]: 19: Hoare triple {34662#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34663#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:46,510 INFO L273 TraceCheckUtils]: 20: Hoare triple {34663#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34663#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:46,511 INFO L273 TraceCheckUtils]: 21: Hoare triple {34663#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34664#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:46,512 INFO L273 TraceCheckUtils]: 22: Hoare triple {34664#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34664#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:46,513 INFO L273 TraceCheckUtils]: 23: Hoare triple {34664#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34665#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:46,514 INFO L273 TraceCheckUtils]: 24: Hoare triple {34665#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34665#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:46,515 INFO L273 TraceCheckUtils]: 25: Hoare triple {34665#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34666#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:46,515 INFO L273 TraceCheckUtils]: 26: Hoare triple {34666#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34666#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:46,516 INFO L273 TraceCheckUtils]: 27: Hoare triple {34666#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34667#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:46,517 INFO L273 TraceCheckUtils]: 28: Hoare triple {34667#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34667#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:46,518 INFO L273 TraceCheckUtils]: 29: Hoare triple {34667#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34668#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:46,518 INFO L273 TraceCheckUtils]: 30: Hoare triple {34668#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34668#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:46,519 INFO L273 TraceCheckUtils]: 31: Hoare triple {34668#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34669#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:46,520 INFO L273 TraceCheckUtils]: 32: Hoare triple {34669#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34669#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:46,521 INFO L273 TraceCheckUtils]: 33: Hoare triple {34669#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34670#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:46,521 INFO L273 TraceCheckUtils]: 34: Hoare triple {34670#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34670#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:46,522 INFO L273 TraceCheckUtils]: 35: Hoare triple {34670#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34671#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:46,523 INFO L273 TraceCheckUtils]: 36: Hoare triple {34671#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34671#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:46,524 INFO L273 TraceCheckUtils]: 37: Hoare triple {34671#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34672#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:46,525 INFO L273 TraceCheckUtils]: 38: Hoare triple {34672#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34672#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:46,525 INFO L273 TraceCheckUtils]: 39: Hoare triple {34672#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34673#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:46,526 INFO L273 TraceCheckUtils]: 40: Hoare triple {34673#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34673#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:46,527 INFO L273 TraceCheckUtils]: 41: Hoare triple {34673#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34674#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:46,528 INFO L273 TraceCheckUtils]: 42: Hoare triple {34674#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34674#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:46,529 INFO L273 TraceCheckUtils]: 43: Hoare triple {34674#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34675#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:46,529 INFO L273 TraceCheckUtils]: 44: Hoare triple {34675#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34675#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:46,530 INFO L273 TraceCheckUtils]: 45: Hoare triple {34675#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34676#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:46,531 INFO L273 TraceCheckUtils]: 46: Hoare triple {34676#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34676#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:46,532 INFO L273 TraceCheckUtils]: 47: Hoare triple {34676#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34677#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:46,532 INFO L273 TraceCheckUtils]: 48: Hoare triple {34677#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34677#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:46,533 INFO L273 TraceCheckUtils]: 49: Hoare triple {34677#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34678#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:46,534 INFO L273 TraceCheckUtils]: 50: Hoare triple {34678#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34678#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:46,535 INFO L273 TraceCheckUtils]: 51: Hoare triple {34678#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34679#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:46,535 INFO L273 TraceCheckUtils]: 52: Hoare triple {34679#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34679#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:46,536 INFO L273 TraceCheckUtils]: 53: Hoare triple {34679#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34680#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:46,537 INFO L273 TraceCheckUtils]: 54: Hoare triple {34680#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34680#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:46,538 INFO L273 TraceCheckUtils]: 55: Hoare triple {34680#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34681#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:46,539 INFO L273 TraceCheckUtils]: 56: Hoare triple {34681#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34681#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:46,539 INFO L273 TraceCheckUtils]: 57: Hoare triple {34681#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34682#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:46,540 INFO L273 TraceCheckUtils]: 58: Hoare triple {34682#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34682#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:46,541 INFO L273 TraceCheckUtils]: 59: Hoare triple {34682#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34683#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:46,542 INFO L273 TraceCheckUtils]: 60: Hoare triple {34683#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34683#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:46,542 INFO L273 TraceCheckUtils]: 61: Hoare triple {34683#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34684#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:46,543 INFO L273 TraceCheckUtils]: 62: Hoare triple {34684#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {34684#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:46,544 INFO L273 TraceCheckUtils]: 63: Hoare triple {34684#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34685#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:46,545 INFO L273 TraceCheckUtils]: 64: Hoare triple {34685#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34685#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:46,546 INFO L273 TraceCheckUtils]: 65: Hoare triple {34685#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34686#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:46,546 INFO L273 TraceCheckUtils]: 66: Hoare triple {34686#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34686#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:46,547 INFO L273 TraceCheckUtils]: 67: Hoare triple {34686#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34687#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:46,548 INFO L273 TraceCheckUtils]: 68: Hoare triple {34687#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34687#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:46,549 INFO L273 TraceCheckUtils]: 69: Hoare triple {34687#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34688#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:46,549 INFO L273 TraceCheckUtils]: 70: Hoare triple {34688#(<= main_~i~1 32)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34688#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:46,550 INFO L273 TraceCheckUtils]: 71: Hoare triple {34688#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34689#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:46,551 INFO L273 TraceCheckUtils]: 72: Hoare triple {34689#(<= main_~i~1 33)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34689#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:46,552 INFO L273 TraceCheckUtils]: 73: Hoare triple {34689#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34690#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:46,553 INFO L273 TraceCheckUtils]: 74: Hoare triple {34690#(<= main_~i~1 34)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34690#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:46,553 INFO L273 TraceCheckUtils]: 75: Hoare triple {34690#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34691#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:46,554 INFO L273 TraceCheckUtils]: 76: Hoare triple {34691#(<= main_~i~1 35)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34691#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:46,555 INFO L273 TraceCheckUtils]: 77: Hoare triple {34691#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34692#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:46,556 INFO L273 TraceCheckUtils]: 78: Hoare triple {34692#(<= main_~i~1 36)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34692#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:46,556 INFO L273 TraceCheckUtils]: 79: Hoare triple {34692#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34693#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:46,557 INFO L273 TraceCheckUtils]: 80: Hoare triple {34693#(<= main_~i~1 37)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34693#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:46,558 INFO L273 TraceCheckUtils]: 81: Hoare triple {34693#(<= main_~i~1 37)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34694#(<= main_~i~1 38)} is VALID [2018-11-23 12:28:46,559 INFO L273 TraceCheckUtils]: 82: Hoare triple {34694#(<= main_~i~1 38)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34694#(<= main_~i~1 38)} is VALID [2018-11-23 12:28:46,560 INFO L273 TraceCheckUtils]: 83: Hoare triple {34694#(<= main_~i~1 38)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34695#(<= main_~i~1 39)} is VALID [2018-11-23 12:28:46,560 INFO L273 TraceCheckUtils]: 84: Hoare triple {34695#(<= main_~i~1 39)} assume !(~i~1 < 10000); {34655#false} is VALID [2018-11-23 12:28:46,561 INFO L256 TraceCheckUtils]: 85: Hoare triple {34655#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {34654#true} is VALID [2018-11-23 12:28:46,561 INFO L273 TraceCheckUtils]: 86: Hoare triple {34654#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34654#true} is VALID [2018-11-23 12:28:46,561 INFO L273 TraceCheckUtils]: 87: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,561 INFO L273 TraceCheckUtils]: 88: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,561 INFO L273 TraceCheckUtils]: 89: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,562 INFO L273 TraceCheckUtils]: 90: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,562 INFO L273 TraceCheckUtils]: 91: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,562 INFO L273 TraceCheckUtils]: 92: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,562 INFO L273 TraceCheckUtils]: 93: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,562 INFO L273 TraceCheckUtils]: 94: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,563 INFO L273 TraceCheckUtils]: 95: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,563 INFO L273 TraceCheckUtils]: 96: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,563 INFO L273 TraceCheckUtils]: 97: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,563 INFO L273 TraceCheckUtils]: 98: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,563 INFO L273 TraceCheckUtils]: 99: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,563 INFO L273 TraceCheckUtils]: 100: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,564 INFO L273 TraceCheckUtils]: 101: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,564 INFO L273 TraceCheckUtils]: 102: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,564 INFO L273 TraceCheckUtils]: 103: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,564 INFO L273 TraceCheckUtils]: 104: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,564 INFO L273 TraceCheckUtils]: 105: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,565 INFO L273 TraceCheckUtils]: 106: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,565 INFO L273 TraceCheckUtils]: 107: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,565 INFO L273 TraceCheckUtils]: 108: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,565 INFO L273 TraceCheckUtils]: 109: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,565 INFO L273 TraceCheckUtils]: 110: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,565 INFO L273 TraceCheckUtils]: 111: Hoare triple {34654#true} assume !(~i~0 < 10000); {34654#true} is VALID [2018-11-23 12:28:46,565 INFO L273 TraceCheckUtils]: 112: Hoare triple {34654#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34654#true} is VALID [2018-11-23 12:28:46,565 INFO L273 TraceCheckUtils]: 113: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:28:46,565 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {34654#true} {34655#false} #70#return; {34655#false} is VALID [2018-11-23 12:28:46,566 INFO L273 TraceCheckUtils]: 115: Hoare triple {34655#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {34655#false} is VALID [2018-11-23 12:28:46,566 INFO L256 TraceCheckUtils]: 116: Hoare triple {34655#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {34654#true} is VALID [2018-11-23 12:28:46,566 INFO L273 TraceCheckUtils]: 117: Hoare triple {34654#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34654#true} is VALID [2018-11-23 12:28:46,566 INFO L273 TraceCheckUtils]: 118: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,566 INFO L273 TraceCheckUtils]: 119: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,566 INFO L273 TraceCheckUtils]: 120: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,566 INFO L273 TraceCheckUtils]: 121: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,566 INFO L273 TraceCheckUtils]: 122: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,566 INFO L273 TraceCheckUtils]: 123: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,566 INFO L273 TraceCheckUtils]: 124: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,567 INFO L273 TraceCheckUtils]: 125: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,567 INFO L273 TraceCheckUtils]: 126: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,567 INFO L273 TraceCheckUtils]: 127: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,567 INFO L273 TraceCheckUtils]: 128: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,567 INFO L273 TraceCheckUtils]: 129: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,567 INFO L273 TraceCheckUtils]: 130: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,567 INFO L273 TraceCheckUtils]: 131: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,567 INFO L273 TraceCheckUtils]: 132: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,567 INFO L273 TraceCheckUtils]: 133: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,567 INFO L273 TraceCheckUtils]: 134: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,568 INFO L273 TraceCheckUtils]: 135: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,568 INFO L273 TraceCheckUtils]: 136: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,568 INFO L273 TraceCheckUtils]: 137: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,568 INFO L273 TraceCheckUtils]: 138: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,568 INFO L273 TraceCheckUtils]: 139: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,568 INFO L273 TraceCheckUtils]: 140: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,568 INFO L273 TraceCheckUtils]: 141: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,568 INFO L273 TraceCheckUtils]: 142: Hoare triple {34654#true} assume !(~i~0 < 10000); {34654#true} is VALID [2018-11-23 12:28:46,568 INFO L273 TraceCheckUtils]: 143: Hoare triple {34654#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34654#true} is VALID [2018-11-23 12:28:46,569 INFO L273 TraceCheckUtils]: 144: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:28:46,569 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {34654#true} {34655#false} #72#return; {34655#false} is VALID [2018-11-23 12:28:46,569 INFO L273 TraceCheckUtils]: 146: Hoare triple {34655#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {34655#false} is VALID [2018-11-23 12:28:46,569 INFO L273 TraceCheckUtils]: 147: Hoare triple {34655#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34655#false} is VALID [2018-11-23 12:28:46,569 INFO L273 TraceCheckUtils]: 148: Hoare triple {34655#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34655#false} is VALID [2018-11-23 12:28:46,569 INFO L273 TraceCheckUtils]: 149: Hoare triple {34655#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34655#false} is VALID [2018-11-23 12:28:46,569 INFO L273 TraceCheckUtils]: 150: Hoare triple {34655#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34655#false} is VALID [2018-11-23 12:28:46,569 INFO L273 TraceCheckUtils]: 151: Hoare triple {34655#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34655#false} is VALID [2018-11-23 12:28:46,569 INFO L273 TraceCheckUtils]: 152: Hoare triple {34655#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34655#false} is VALID [2018-11-23 12:28:46,569 INFO L273 TraceCheckUtils]: 153: Hoare triple {34655#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34655#false} is VALID [2018-11-23 12:28:46,570 INFO L273 TraceCheckUtils]: 154: Hoare triple {34655#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34655#false} is VALID [2018-11-23 12:28:46,570 INFO L273 TraceCheckUtils]: 155: Hoare triple {34655#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34655#false} is VALID [2018-11-23 12:28:46,570 INFO L273 TraceCheckUtils]: 156: Hoare triple {34655#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34655#false} is VALID [2018-11-23 12:28:46,570 INFO L273 TraceCheckUtils]: 157: Hoare triple {34655#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34655#false} is VALID [2018-11-23 12:28:46,570 INFO L273 TraceCheckUtils]: 158: Hoare triple {34655#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34655#false} is VALID [2018-11-23 12:28:46,570 INFO L273 TraceCheckUtils]: 159: Hoare triple {34655#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34655#false} is VALID [2018-11-23 12:28:46,570 INFO L273 TraceCheckUtils]: 160: Hoare triple {34655#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34655#false} is VALID [2018-11-23 12:28:46,570 INFO L273 TraceCheckUtils]: 161: Hoare triple {34655#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34655#false} is VALID [2018-11-23 12:28:46,570 INFO L273 TraceCheckUtils]: 162: Hoare triple {34655#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34655#false} is VALID [2018-11-23 12:28:46,571 INFO L273 TraceCheckUtils]: 163: Hoare triple {34655#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34655#false} is VALID [2018-11-23 12:28:46,571 INFO L273 TraceCheckUtils]: 164: Hoare triple {34655#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34655#false} is VALID [2018-11-23 12:28:46,571 INFO L273 TraceCheckUtils]: 165: Hoare triple {34655#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34655#false} is VALID [2018-11-23 12:28:46,571 INFO L273 TraceCheckUtils]: 166: Hoare triple {34655#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34655#false} is VALID [2018-11-23 12:28:46,571 INFO L273 TraceCheckUtils]: 167: Hoare triple {34655#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34655#false} is VALID [2018-11-23 12:28:46,571 INFO L273 TraceCheckUtils]: 168: Hoare triple {34655#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34655#false} is VALID [2018-11-23 12:28:46,571 INFO L273 TraceCheckUtils]: 169: Hoare triple {34655#false} assume !(~i~2 < 9999); {34655#false} is VALID [2018-11-23 12:28:46,571 INFO L273 TraceCheckUtils]: 170: Hoare triple {34655#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {34655#false} is VALID [2018-11-23 12:28:46,571 INFO L256 TraceCheckUtils]: 171: Hoare triple {34655#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {34654#true} is VALID [2018-11-23 12:28:46,571 INFO L273 TraceCheckUtils]: 172: Hoare triple {34654#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34654#true} is VALID [2018-11-23 12:28:46,572 INFO L273 TraceCheckUtils]: 173: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,572 INFO L273 TraceCheckUtils]: 174: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,572 INFO L273 TraceCheckUtils]: 175: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,572 INFO L273 TraceCheckUtils]: 176: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,572 INFO L273 TraceCheckUtils]: 177: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,572 INFO L273 TraceCheckUtils]: 178: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,572 INFO L273 TraceCheckUtils]: 179: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,572 INFO L273 TraceCheckUtils]: 180: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,572 INFO L273 TraceCheckUtils]: 181: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,572 INFO L273 TraceCheckUtils]: 182: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,573 INFO L273 TraceCheckUtils]: 183: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,573 INFO L273 TraceCheckUtils]: 184: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,573 INFO L273 TraceCheckUtils]: 185: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,573 INFO L273 TraceCheckUtils]: 186: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,573 INFO L273 TraceCheckUtils]: 187: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,573 INFO L273 TraceCheckUtils]: 188: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,573 INFO L273 TraceCheckUtils]: 189: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,573 INFO L273 TraceCheckUtils]: 190: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,573 INFO L273 TraceCheckUtils]: 191: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,574 INFO L273 TraceCheckUtils]: 192: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,574 INFO L273 TraceCheckUtils]: 193: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,574 INFO L273 TraceCheckUtils]: 194: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,574 INFO L273 TraceCheckUtils]: 195: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:46,574 INFO L273 TraceCheckUtils]: 196: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:46,574 INFO L273 TraceCheckUtils]: 197: Hoare triple {34654#true} assume !(~i~0 < 10000); {34654#true} is VALID [2018-11-23 12:28:46,574 INFO L273 TraceCheckUtils]: 198: Hoare triple {34654#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34654#true} is VALID [2018-11-23 12:28:46,574 INFO L273 TraceCheckUtils]: 199: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:28:46,574 INFO L268 TraceCheckUtils]: 200: Hoare quadruple {34654#true} {34655#false} #74#return; {34655#false} is VALID [2018-11-23 12:28:46,574 INFO L273 TraceCheckUtils]: 201: Hoare triple {34655#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {34655#false} is VALID [2018-11-23 12:28:46,575 INFO L273 TraceCheckUtils]: 202: Hoare triple {34655#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {34655#false} is VALID [2018-11-23 12:28:46,575 INFO L273 TraceCheckUtils]: 203: Hoare triple {34655#false} assume !false; {34655#false} is VALID [2018-11-23 12:28:46,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2018-11-23 12:28:46,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:46,594 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:46,603 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:28:47,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-11-23 12:28:47,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:47,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:48,531 INFO L256 TraceCheckUtils]: 0: Hoare triple {34654#true} call ULTIMATE.init(); {34654#true} is VALID [2018-11-23 12:28:48,532 INFO L273 TraceCheckUtils]: 1: Hoare triple {34654#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34654#true} is VALID [2018-11-23 12:28:48,532 INFO L273 TraceCheckUtils]: 2: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:28:48,532 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34654#true} {34654#true} #66#return; {34654#true} is VALID [2018-11-23 12:28:48,532 INFO L256 TraceCheckUtils]: 4: Hoare triple {34654#true} call #t~ret13 := main(); {34654#true} is VALID [2018-11-23 12:28:48,532 INFO L273 TraceCheckUtils]: 5: Hoare triple {34654#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; {34654#true} is VALID [2018-11-23 12:28:48,533 INFO L273 TraceCheckUtils]: 6: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,533 INFO L273 TraceCheckUtils]: 7: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,533 INFO L273 TraceCheckUtils]: 8: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,533 INFO L273 TraceCheckUtils]: 9: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,533 INFO L273 TraceCheckUtils]: 10: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,534 INFO L273 TraceCheckUtils]: 11: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,534 INFO L273 TraceCheckUtils]: 12: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,534 INFO L273 TraceCheckUtils]: 13: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,534 INFO L273 TraceCheckUtils]: 14: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,534 INFO L273 TraceCheckUtils]: 15: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,534 INFO L273 TraceCheckUtils]: 16: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,535 INFO L273 TraceCheckUtils]: 17: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,535 INFO L273 TraceCheckUtils]: 18: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,535 INFO L273 TraceCheckUtils]: 19: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,535 INFO L273 TraceCheckUtils]: 20: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,535 INFO L273 TraceCheckUtils]: 21: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,535 INFO L273 TraceCheckUtils]: 22: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,536 INFO L273 TraceCheckUtils]: 23: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,536 INFO L273 TraceCheckUtils]: 24: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,536 INFO L273 TraceCheckUtils]: 25: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,536 INFO L273 TraceCheckUtils]: 26: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,536 INFO L273 TraceCheckUtils]: 27: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,536 INFO L273 TraceCheckUtils]: 28: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,536 INFO L273 TraceCheckUtils]: 29: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,536 INFO L273 TraceCheckUtils]: 30: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,536 INFO L273 TraceCheckUtils]: 31: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,536 INFO L273 TraceCheckUtils]: 32: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,537 INFO L273 TraceCheckUtils]: 33: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,537 INFO L273 TraceCheckUtils]: 34: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,537 INFO L273 TraceCheckUtils]: 35: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,537 INFO L273 TraceCheckUtils]: 36: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,537 INFO L273 TraceCheckUtils]: 37: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,537 INFO L273 TraceCheckUtils]: 38: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,537 INFO L273 TraceCheckUtils]: 39: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,537 INFO L273 TraceCheckUtils]: 40: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,537 INFO L273 TraceCheckUtils]: 41: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,537 INFO L273 TraceCheckUtils]: 42: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,538 INFO L273 TraceCheckUtils]: 43: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,538 INFO L273 TraceCheckUtils]: 44: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,538 INFO L273 TraceCheckUtils]: 45: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,538 INFO L273 TraceCheckUtils]: 46: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,538 INFO L273 TraceCheckUtils]: 47: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,538 INFO L273 TraceCheckUtils]: 48: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,538 INFO L273 TraceCheckUtils]: 49: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,538 INFO L273 TraceCheckUtils]: 50: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,538 INFO L273 TraceCheckUtils]: 51: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,538 INFO L273 TraceCheckUtils]: 52: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,539 INFO L273 TraceCheckUtils]: 53: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,539 INFO L273 TraceCheckUtils]: 54: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,539 INFO L273 TraceCheckUtils]: 55: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,539 INFO L273 TraceCheckUtils]: 56: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,539 INFO L273 TraceCheckUtils]: 57: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,539 INFO L273 TraceCheckUtils]: 58: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,539 INFO L273 TraceCheckUtils]: 59: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,539 INFO L273 TraceCheckUtils]: 60: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,539 INFO L273 TraceCheckUtils]: 61: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,539 INFO L273 TraceCheckUtils]: 62: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,540 INFO L273 TraceCheckUtils]: 63: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,540 INFO L273 TraceCheckUtils]: 64: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,540 INFO L273 TraceCheckUtils]: 65: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,540 INFO L273 TraceCheckUtils]: 66: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,540 INFO L273 TraceCheckUtils]: 67: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,540 INFO L273 TraceCheckUtils]: 68: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,540 INFO L273 TraceCheckUtils]: 69: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,540 INFO L273 TraceCheckUtils]: 70: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,540 INFO L273 TraceCheckUtils]: 71: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,540 INFO L273 TraceCheckUtils]: 72: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,541 INFO L273 TraceCheckUtils]: 73: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,541 INFO L273 TraceCheckUtils]: 74: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,541 INFO L273 TraceCheckUtils]: 75: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,541 INFO L273 TraceCheckUtils]: 76: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,541 INFO L273 TraceCheckUtils]: 77: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,541 INFO L273 TraceCheckUtils]: 78: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,541 INFO L273 TraceCheckUtils]: 79: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,541 INFO L273 TraceCheckUtils]: 80: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,541 INFO L273 TraceCheckUtils]: 81: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,541 INFO L273 TraceCheckUtils]: 82: Hoare triple {34654#true} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:48,542 INFO L273 TraceCheckUtils]: 83: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:48,542 INFO L273 TraceCheckUtils]: 84: Hoare triple {34654#true} assume !(~i~1 < 10000); {34654#true} is VALID [2018-11-23 12:28:48,542 INFO L256 TraceCheckUtils]: 85: Hoare triple {34654#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {34654#true} is VALID [2018-11-23 12:28:48,542 INFO L273 TraceCheckUtils]: 86: Hoare triple {34654#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34654#true} is VALID [2018-11-23 12:28:48,542 INFO L273 TraceCheckUtils]: 87: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:48,542 INFO L273 TraceCheckUtils]: 88: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:48,542 INFO L273 TraceCheckUtils]: 89: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:48,542 INFO L273 TraceCheckUtils]: 90: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:48,542 INFO L273 TraceCheckUtils]: 91: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:48,542 INFO L273 TraceCheckUtils]: 92: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:48,543 INFO L273 TraceCheckUtils]: 93: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:48,543 INFO L273 TraceCheckUtils]: 94: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:48,543 INFO L273 TraceCheckUtils]: 95: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:48,543 INFO L273 TraceCheckUtils]: 96: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:48,543 INFO L273 TraceCheckUtils]: 97: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:48,543 INFO L273 TraceCheckUtils]: 98: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:48,543 INFO L273 TraceCheckUtils]: 99: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:48,543 INFO L273 TraceCheckUtils]: 100: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:48,543 INFO L273 TraceCheckUtils]: 101: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:48,544 INFO L273 TraceCheckUtils]: 102: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:48,544 INFO L273 TraceCheckUtils]: 103: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:48,544 INFO L273 TraceCheckUtils]: 104: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:48,544 INFO L273 TraceCheckUtils]: 105: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:48,544 INFO L273 TraceCheckUtils]: 106: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:48,544 INFO L273 TraceCheckUtils]: 107: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:48,544 INFO L273 TraceCheckUtils]: 108: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:48,544 INFO L273 TraceCheckUtils]: 109: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:48,544 INFO L273 TraceCheckUtils]: 110: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:48,544 INFO L273 TraceCheckUtils]: 111: Hoare triple {34654#true} assume !(~i~0 < 10000); {34654#true} is VALID [2018-11-23 12:28:48,545 INFO L273 TraceCheckUtils]: 112: Hoare triple {34654#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34654#true} is VALID [2018-11-23 12:28:48,545 INFO L273 TraceCheckUtils]: 113: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:28:48,545 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {34654#true} {34654#true} #70#return; {34654#true} is VALID [2018-11-23 12:28:48,545 INFO L273 TraceCheckUtils]: 115: Hoare triple {34654#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {34654#true} is VALID [2018-11-23 12:28:48,545 INFO L256 TraceCheckUtils]: 116: Hoare triple {34654#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {34654#true} is VALID [2018-11-23 12:28:48,545 INFO L273 TraceCheckUtils]: 117: Hoare triple {34654#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34654#true} is VALID [2018-11-23 12:28:48,545 INFO L273 TraceCheckUtils]: 118: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:48,545 INFO L273 TraceCheckUtils]: 119: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:48,545 INFO L273 TraceCheckUtils]: 120: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:48,545 INFO L273 TraceCheckUtils]: 121: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:48,546 INFO L273 TraceCheckUtils]: 122: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:48,546 INFO L273 TraceCheckUtils]: 123: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:48,546 INFO L273 TraceCheckUtils]: 124: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:48,546 INFO L273 TraceCheckUtils]: 125: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:48,546 INFO L273 TraceCheckUtils]: 126: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:48,546 INFO L273 TraceCheckUtils]: 127: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:48,546 INFO L273 TraceCheckUtils]: 128: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:48,546 INFO L273 TraceCheckUtils]: 129: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:48,546 INFO L273 TraceCheckUtils]: 130: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:48,546 INFO L273 TraceCheckUtils]: 131: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:48,547 INFO L273 TraceCheckUtils]: 132: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:48,547 INFO L273 TraceCheckUtils]: 133: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:48,547 INFO L273 TraceCheckUtils]: 134: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:48,547 INFO L273 TraceCheckUtils]: 135: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:48,547 INFO L273 TraceCheckUtils]: 136: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:48,547 INFO L273 TraceCheckUtils]: 137: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:48,547 INFO L273 TraceCheckUtils]: 138: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:48,547 INFO L273 TraceCheckUtils]: 139: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:48,547 INFO L273 TraceCheckUtils]: 140: Hoare triple {34654#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:48,547 INFO L273 TraceCheckUtils]: 141: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:48,548 INFO L273 TraceCheckUtils]: 142: Hoare triple {34654#true} assume !(~i~0 < 10000); {34654#true} is VALID [2018-11-23 12:28:48,548 INFO L273 TraceCheckUtils]: 143: Hoare triple {34654#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34654#true} is VALID [2018-11-23 12:28:48,548 INFO L273 TraceCheckUtils]: 144: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:28:48,548 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {34654#true} {34654#true} #72#return; {34654#true} is VALID [2018-11-23 12:28:48,548 INFO L273 TraceCheckUtils]: 146: Hoare triple {34654#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {34654#true} is VALID [2018-11-23 12:28:48,548 INFO L273 TraceCheckUtils]: 147: Hoare triple {34654#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34654#true} is VALID [2018-11-23 12:28:48,548 INFO L273 TraceCheckUtils]: 148: Hoare triple {34654#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34654#true} is VALID [2018-11-23 12:28:48,548 INFO L273 TraceCheckUtils]: 149: Hoare triple {34654#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34654#true} is VALID [2018-11-23 12:28:48,548 INFO L273 TraceCheckUtils]: 150: Hoare triple {34654#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34654#true} is VALID [2018-11-23 12:28:48,548 INFO L273 TraceCheckUtils]: 151: Hoare triple {34654#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34654#true} is VALID [2018-11-23 12:28:48,549 INFO L273 TraceCheckUtils]: 152: Hoare triple {34654#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34654#true} is VALID [2018-11-23 12:28:48,549 INFO L273 TraceCheckUtils]: 153: Hoare triple {34654#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34654#true} is VALID [2018-11-23 12:28:48,549 INFO L273 TraceCheckUtils]: 154: Hoare triple {34654#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34654#true} is VALID [2018-11-23 12:28:48,549 INFO L273 TraceCheckUtils]: 155: Hoare triple {34654#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34654#true} is VALID [2018-11-23 12:28:48,549 INFO L273 TraceCheckUtils]: 156: Hoare triple {34654#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34654#true} is VALID [2018-11-23 12:28:48,549 INFO L273 TraceCheckUtils]: 157: Hoare triple {34654#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34654#true} is VALID [2018-11-23 12:28:48,549 INFO L273 TraceCheckUtils]: 158: Hoare triple {34654#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34654#true} is VALID [2018-11-23 12:28:48,549 INFO L273 TraceCheckUtils]: 159: Hoare triple {34654#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34654#true} is VALID [2018-11-23 12:28:48,549 INFO L273 TraceCheckUtils]: 160: Hoare triple {34654#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34654#true} is VALID [2018-11-23 12:28:48,550 INFO L273 TraceCheckUtils]: 161: Hoare triple {34654#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34654#true} is VALID [2018-11-23 12:28:48,550 INFO L273 TraceCheckUtils]: 162: Hoare triple {34654#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34654#true} is VALID [2018-11-23 12:28:48,550 INFO L273 TraceCheckUtils]: 163: Hoare triple {34654#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34654#true} is VALID [2018-11-23 12:28:48,550 INFO L273 TraceCheckUtils]: 164: Hoare triple {34654#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34654#true} is VALID [2018-11-23 12:28:48,550 INFO L273 TraceCheckUtils]: 165: Hoare triple {34654#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34654#true} is VALID [2018-11-23 12:28:48,550 INFO L273 TraceCheckUtils]: 166: Hoare triple {34654#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34654#true} is VALID [2018-11-23 12:28:48,550 INFO L273 TraceCheckUtils]: 167: Hoare triple {34654#true} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34654#true} is VALID [2018-11-23 12:28:48,550 INFO L273 TraceCheckUtils]: 168: Hoare triple {34654#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34654#true} is VALID [2018-11-23 12:28:48,550 INFO L273 TraceCheckUtils]: 169: Hoare triple {34654#true} assume !(~i~2 < 9999); {34654#true} is VALID [2018-11-23 12:28:48,550 INFO L273 TraceCheckUtils]: 170: Hoare triple {34654#true} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {34654#true} is VALID [2018-11-23 12:28:48,551 INFO L256 TraceCheckUtils]: 171: Hoare triple {34654#true} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {34654#true} is VALID [2018-11-23 12:28:48,551 INFO L273 TraceCheckUtils]: 172: Hoare triple {34654#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {35215#(<= bor_~i~0 1)} is VALID [2018-11-23 12:28:48,552 INFO L273 TraceCheckUtils]: 173: Hoare triple {35215#(<= bor_~i~0 1)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {35215#(<= bor_~i~0 1)} is VALID [2018-11-23 12:28:48,552 INFO L273 TraceCheckUtils]: 174: Hoare triple {35215#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35222#(<= bor_~i~0 2)} is VALID [2018-11-23 12:28:48,553 INFO L273 TraceCheckUtils]: 175: Hoare triple {35222#(<= bor_~i~0 2)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {35222#(<= bor_~i~0 2)} is VALID [2018-11-23 12:28:48,553 INFO L273 TraceCheckUtils]: 176: Hoare triple {35222#(<= bor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35229#(<= bor_~i~0 3)} is VALID [2018-11-23 12:28:48,553 INFO L273 TraceCheckUtils]: 177: Hoare triple {35229#(<= bor_~i~0 3)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {35229#(<= bor_~i~0 3)} is VALID [2018-11-23 12:28:48,554 INFO L273 TraceCheckUtils]: 178: Hoare triple {35229#(<= bor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35236#(<= bor_~i~0 4)} is VALID [2018-11-23 12:28:48,554 INFO L273 TraceCheckUtils]: 179: Hoare triple {35236#(<= bor_~i~0 4)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {35236#(<= bor_~i~0 4)} is VALID [2018-11-23 12:28:48,555 INFO L273 TraceCheckUtils]: 180: Hoare triple {35236#(<= bor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35243#(<= bor_~i~0 5)} is VALID [2018-11-23 12:28:48,555 INFO L273 TraceCheckUtils]: 181: Hoare triple {35243#(<= bor_~i~0 5)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {35243#(<= bor_~i~0 5)} is VALID [2018-11-23 12:28:48,556 INFO L273 TraceCheckUtils]: 182: Hoare triple {35243#(<= bor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35250#(<= bor_~i~0 6)} is VALID [2018-11-23 12:28:48,557 INFO L273 TraceCheckUtils]: 183: Hoare triple {35250#(<= bor_~i~0 6)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {35250#(<= bor_~i~0 6)} is VALID [2018-11-23 12:28:48,558 INFO L273 TraceCheckUtils]: 184: Hoare triple {35250#(<= bor_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35257#(<= bor_~i~0 7)} is VALID [2018-11-23 12:28:48,558 INFO L273 TraceCheckUtils]: 185: Hoare triple {35257#(<= bor_~i~0 7)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {35257#(<= bor_~i~0 7)} is VALID [2018-11-23 12:28:48,559 INFO L273 TraceCheckUtils]: 186: Hoare triple {35257#(<= bor_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35264#(<= bor_~i~0 8)} is VALID [2018-11-23 12:28:48,560 INFO L273 TraceCheckUtils]: 187: Hoare triple {35264#(<= bor_~i~0 8)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {35264#(<= bor_~i~0 8)} is VALID [2018-11-23 12:28:48,561 INFO L273 TraceCheckUtils]: 188: Hoare triple {35264#(<= bor_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35271#(<= bor_~i~0 9)} is VALID [2018-11-23 12:28:48,562 INFO L273 TraceCheckUtils]: 189: Hoare triple {35271#(<= bor_~i~0 9)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {35271#(<= bor_~i~0 9)} is VALID [2018-11-23 12:28:48,562 INFO L273 TraceCheckUtils]: 190: Hoare triple {35271#(<= bor_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35278#(<= bor_~i~0 10)} is VALID [2018-11-23 12:28:48,563 INFO L273 TraceCheckUtils]: 191: Hoare triple {35278#(<= bor_~i~0 10)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {35278#(<= bor_~i~0 10)} is VALID [2018-11-23 12:28:48,564 INFO L273 TraceCheckUtils]: 192: Hoare triple {35278#(<= bor_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35285#(<= bor_~i~0 11)} is VALID [2018-11-23 12:28:48,565 INFO L273 TraceCheckUtils]: 193: Hoare triple {35285#(<= bor_~i~0 11)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {35285#(<= bor_~i~0 11)} is VALID [2018-11-23 12:28:48,566 INFO L273 TraceCheckUtils]: 194: Hoare triple {35285#(<= bor_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35292#(<= bor_~i~0 12)} is VALID [2018-11-23 12:28:48,566 INFO L273 TraceCheckUtils]: 195: Hoare triple {35292#(<= bor_~i~0 12)} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {35292#(<= bor_~i~0 12)} is VALID [2018-11-23 12:28:48,567 INFO L273 TraceCheckUtils]: 196: Hoare triple {35292#(<= bor_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35299#(<= bor_~i~0 13)} is VALID [2018-11-23 12:28:48,568 INFO L273 TraceCheckUtils]: 197: Hoare triple {35299#(<= bor_~i~0 13)} assume !(~i~0 < 10000); {34655#false} is VALID [2018-11-23 12:28:48,568 INFO L273 TraceCheckUtils]: 198: Hoare triple {34655#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34655#false} is VALID [2018-11-23 12:28:48,568 INFO L273 TraceCheckUtils]: 199: Hoare triple {34655#false} assume true; {34655#false} is VALID [2018-11-23 12:28:48,568 INFO L268 TraceCheckUtils]: 200: Hoare quadruple {34655#false} {34654#true} #74#return; {34655#false} is VALID [2018-11-23 12:28:48,569 INFO L273 TraceCheckUtils]: 201: Hoare triple {34655#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {34655#false} is VALID [2018-11-23 12:28:48,569 INFO L273 TraceCheckUtils]: 202: Hoare triple {34655#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {34655#false} is VALID [2018-11-23 12:28:48,569 INFO L273 TraceCheckUtils]: 203: Hoare triple {34655#false} assume !false; {34655#false} is VALID [2018-11-23 12:28:48,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 632 proven. 144 refuted. 0 times theorem prover too weak. 2249 trivial. 0 not checked. [2018-11-23 12:28:48,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:48,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 15] total 55 [2018-11-23 12:28:48,607 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 204 [2018-11-23 12:28:48,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:48,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states. [2018-11-23 12:28:48,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:48,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-23 12:28:48,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-23 12:28:48,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 12:28:48,824 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 55 states. [2018-11-23 12:28:50,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:50,081 INFO L93 Difference]: Finished difference Result 215 states and 227 transitions. [2018-11-23 12:28:50,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-23 12:28:50,081 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 204 [2018-11-23 12:28:50,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:50,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:28:50,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 162 transitions. [2018-11-23 12:28:50,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:28:50,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 162 transitions. [2018-11-23 12:28:50,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 162 transitions. [2018-11-23 12:28:50,320 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:50,323 INFO L225 Difference]: With dead ends: 215 [2018-11-23 12:28:50,323 INFO L226 Difference]: Without dead ends: 153 [2018-11-23 12:28:50,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 12:28:50,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-23 12:28:50,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-11-23 12:28:50,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:50,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 151 states. [2018-11-23 12:28:50,437 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 151 states. [2018-11-23 12:28:50,437 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 151 states. [2018-11-23 12:28:50,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:50,441 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-11-23 12:28:50,441 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-23 12:28:50,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:50,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:50,442 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 153 states. [2018-11-23 12:28:50,442 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 153 states. [2018-11-23 12:28:50,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:50,445 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-11-23 12:28:50,445 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-23 12:28:50,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:50,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:50,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:50,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:50,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-23 12:28:50,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 155 transitions. [2018-11-23 12:28:50,448 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 155 transitions. Word has length 204 [2018-11-23 12:28:50,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:50,448 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 155 transitions. [2018-11-23 12:28:50,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-23 12:28:50,448 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 155 transitions. [2018-11-23 12:28:50,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-23 12:28:50,449 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:50,449 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 11, 11, 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-23 12:28:50,449 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:50,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:50,450 INFO L82 PathProgramCache]: Analyzing trace with hash -15611861, now seen corresponding path program 40 times [2018-11-23 12:28:50,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:50,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:50,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:50,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:50,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:52,156 INFO L256 TraceCheckUtils]: 0: Hoare triple {36171#true} call ULTIMATE.init(); {36171#true} is VALID [2018-11-23 12:28:52,156 INFO L273 TraceCheckUtils]: 1: Hoare triple {36171#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36171#true} is VALID [2018-11-23 12:28:52,157 INFO L273 TraceCheckUtils]: 2: Hoare triple {36171#true} assume true; {36171#true} is VALID [2018-11-23 12:28:52,157 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36171#true} {36171#true} #66#return; {36171#true} is VALID [2018-11-23 12:28:52,157 INFO L256 TraceCheckUtils]: 4: Hoare triple {36171#true} call #t~ret13 := main(); {36171#true} is VALID [2018-11-23 12:28:52,158 INFO L273 TraceCheckUtils]: 5: Hoare triple {36171#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; {36173#(= main_~i~1 0)} is VALID [2018-11-23 12:28:52,158 INFO L273 TraceCheckUtils]: 6: Hoare triple {36173#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36173#(= main_~i~1 0)} is VALID [2018-11-23 12:28:52,159 INFO L273 TraceCheckUtils]: 7: Hoare triple {36173#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36174#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:52,159 INFO L273 TraceCheckUtils]: 8: Hoare triple {36174#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36174#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:52,160 INFO L273 TraceCheckUtils]: 9: Hoare triple {36174#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36175#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:52,160 INFO L273 TraceCheckUtils]: 10: Hoare triple {36175#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36175#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:52,161 INFO L273 TraceCheckUtils]: 11: Hoare triple {36175#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36176#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:52,161 INFO L273 TraceCheckUtils]: 12: Hoare triple {36176#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36176#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:52,162 INFO L273 TraceCheckUtils]: 13: Hoare triple {36176#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36177#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:52,163 INFO L273 TraceCheckUtils]: 14: Hoare triple {36177#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36177#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:52,164 INFO L273 TraceCheckUtils]: 15: Hoare triple {36177#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36178#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:52,164 INFO L273 TraceCheckUtils]: 16: Hoare triple {36178#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36178#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:52,165 INFO L273 TraceCheckUtils]: 17: Hoare triple {36178#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36179#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:52,166 INFO L273 TraceCheckUtils]: 18: Hoare triple {36179#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36179#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:52,167 INFO L273 TraceCheckUtils]: 19: Hoare triple {36179#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36180#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:52,168 INFO L273 TraceCheckUtils]: 20: Hoare triple {36180#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36180#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:52,168 INFO L273 TraceCheckUtils]: 21: Hoare triple {36180#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36181#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:52,169 INFO L273 TraceCheckUtils]: 22: Hoare triple {36181#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36181#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:52,170 INFO L273 TraceCheckUtils]: 23: Hoare triple {36181#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36182#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:52,171 INFO L273 TraceCheckUtils]: 24: Hoare triple {36182#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36182#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:52,171 INFO L273 TraceCheckUtils]: 25: Hoare triple {36182#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36183#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:52,172 INFO L273 TraceCheckUtils]: 26: Hoare triple {36183#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36183#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:52,173 INFO L273 TraceCheckUtils]: 27: Hoare triple {36183#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36184#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:52,174 INFO L273 TraceCheckUtils]: 28: Hoare triple {36184#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36184#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:52,175 INFO L273 TraceCheckUtils]: 29: Hoare triple {36184#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36185#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:52,175 INFO L273 TraceCheckUtils]: 30: Hoare triple {36185#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36185#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:52,176 INFO L273 TraceCheckUtils]: 31: Hoare triple {36185#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36186#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:52,177 INFO L273 TraceCheckUtils]: 32: Hoare triple {36186#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36186#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:52,178 INFO L273 TraceCheckUtils]: 33: Hoare triple {36186#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36187#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:52,178 INFO L273 TraceCheckUtils]: 34: Hoare triple {36187#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36187#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:52,179 INFO L273 TraceCheckUtils]: 35: Hoare triple {36187#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36188#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:52,180 INFO L273 TraceCheckUtils]: 36: Hoare triple {36188#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36188#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:52,181 INFO L273 TraceCheckUtils]: 37: Hoare triple {36188#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36189#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:52,182 INFO L273 TraceCheckUtils]: 38: Hoare triple {36189#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36189#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:52,182 INFO L273 TraceCheckUtils]: 39: Hoare triple {36189#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36190#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:52,183 INFO L273 TraceCheckUtils]: 40: Hoare triple {36190#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36190#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:52,184 INFO L273 TraceCheckUtils]: 41: Hoare triple {36190#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36191#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:52,185 INFO L273 TraceCheckUtils]: 42: Hoare triple {36191#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36191#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:52,185 INFO L273 TraceCheckUtils]: 43: Hoare triple {36191#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36192#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:52,186 INFO L273 TraceCheckUtils]: 44: Hoare triple {36192#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36192#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:52,187 INFO L273 TraceCheckUtils]: 45: Hoare triple {36192#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36193#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:52,188 INFO L273 TraceCheckUtils]: 46: Hoare triple {36193#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36193#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:52,189 INFO L273 TraceCheckUtils]: 47: Hoare triple {36193#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36194#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:52,189 INFO L273 TraceCheckUtils]: 48: Hoare triple {36194#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36194#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:52,190 INFO L273 TraceCheckUtils]: 49: Hoare triple {36194#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36195#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:52,191 INFO L273 TraceCheckUtils]: 50: Hoare triple {36195#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36195#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:52,192 INFO L273 TraceCheckUtils]: 51: Hoare triple {36195#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36196#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:52,192 INFO L273 TraceCheckUtils]: 52: Hoare triple {36196#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36196#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:52,193 INFO L273 TraceCheckUtils]: 53: Hoare triple {36196#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36197#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:52,194 INFO L273 TraceCheckUtils]: 54: Hoare triple {36197#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36197#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:52,195 INFO L273 TraceCheckUtils]: 55: Hoare triple {36197#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36198#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:52,196 INFO L273 TraceCheckUtils]: 56: Hoare triple {36198#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36198#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:52,196 INFO L273 TraceCheckUtils]: 57: Hoare triple {36198#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36199#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:52,197 INFO L273 TraceCheckUtils]: 58: Hoare triple {36199#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36199#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:52,198 INFO L273 TraceCheckUtils]: 59: Hoare triple {36199#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36200#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:52,199 INFO L273 TraceCheckUtils]: 60: Hoare triple {36200#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36200#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:52,200 INFO L273 TraceCheckUtils]: 61: Hoare triple {36200#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36201#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:52,200 INFO L273 TraceCheckUtils]: 62: Hoare triple {36201#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36201#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:52,201 INFO L273 TraceCheckUtils]: 63: Hoare triple {36201#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36202#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:52,202 INFO L273 TraceCheckUtils]: 64: Hoare triple {36202#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36202#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:52,203 INFO L273 TraceCheckUtils]: 65: Hoare triple {36202#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36203#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:52,203 INFO L273 TraceCheckUtils]: 66: Hoare triple {36203#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36203#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:52,204 INFO L273 TraceCheckUtils]: 67: Hoare triple {36203#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36204#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:52,205 INFO L273 TraceCheckUtils]: 68: Hoare triple {36204#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36204#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:52,206 INFO L273 TraceCheckUtils]: 69: Hoare triple {36204#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36205#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:52,206 INFO L273 TraceCheckUtils]: 70: Hoare triple {36205#(<= main_~i~1 32)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36205#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:52,207 INFO L273 TraceCheckUtils]: 71: Hoare triple {36205#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36206#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:52,208 INFO L273 TraceCheckUtils]: 72: Hoare triple {36206#(<= main_~i~1 33)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36206#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:52,209 INFO L273 TraceCheckUtils]: 73: Hoare triple {36206#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36207#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:52,210 INFO L273 TraceCheckUtils]: 74: Hoare triple {36207#(<= main_~i~1 34)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36207#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:52,210 INFO L273 TraceCheckUtils]: 75: Hoare triple {36207#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36208#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:52,211 INFO L273 TraceCheckUtils]: 76: Hoare triple {36208#(<= main_~i~1 35)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36208#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:52,212 INFO L273 TraceCheckUtils]: 77: Hoare triple {36208#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36209#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:52,213 INFO L273 TraceCheckUtils]: 78: Hoare triple {36209#(<= main_~i~1 36)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36209#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:52,214 INFO L273 TraceCheckUtils]: 79: Hoare triple {36209#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36210#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:52,214 INFO L273 TraceCheckUtils]: 80: Hoare triple {36210#(<= main_~i~1 37)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36210#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:52,215 INFO L273 TraceCheckUtils]: 81: Hoare triple {36210#(<= main_~i~1 37)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36211#(<= main_~i~1 38)} is VALID [2018-11-23 12:28:52,216 INFO L273 TraceCheckUtils]: 82: Hoare triple {36211#(<= main_~i~1 38)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36211#(<= main_~i~1 38)} is VALID [2018-11-23 12:28:52,217 INFO L273 TraceCheckUtils]: 83: Hoare triple {36211#(<= main_~i~1 38)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36212#(<= main_~i~1 39)} is VALID [2018-11-23 12:28:52,217 INFO L273 TraceCheckUtils]: 84: Hoare triple {36212#(<= main_~i~1 39)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36212#(<= main_~i~1 39)} is VALID [2018-11-23 12:28:52,218 INFO L273 TraceCheckUtils]: 85: Hoare triple {36212#(<= main_~i~1 39)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36213#(<= main_~i~1 40)} is VALID [2018-11-23 12:28:52,219 INFO L273 TraceCheckUtils]: 86: Hoare triple {36213#(<= main_~i~1 40)} assume !(~i~1 < 10000); {36172#false} is VALID [2018-11-23 12:28:52,219 INFO L256 TraceCheckUtils]: 87: Hoare triple {36172#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {36171#true} is VALID [2018-11-23 12:28:52,219 INFO L273 TraceCheckUtils]: 88: Hoare triple {36171#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {36171#true} is VALID [2018-11-23 12:28:52,220 INFO L273 TraceCheckUtils]: 89: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,220 INFO L273 TraceCheckUtils]: 90: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,220 INFO L273 TraceCheckUtils]: 91: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,220 INFO L273 TraceCheckUtils]: 92: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,220 INFO L273 TraceCheckUtils]: 93: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,221 INFO L273 TraceCheckUtils]: 94: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,221 INFO L273 TraceCheckUtils]: 95: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,221 INFO L273 TraceCheckUtils]: 96: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,221 INFO L273 TraceCheckUtils]: 97: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,221 INFO L273 TraceCheckUtils]: 98: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,221 INFO L273 TraceCheckUtils]: 99: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,222 INFO L273 TraceCheckUtils]: 100: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,222 INFO L273 TraceCheckUtils]: 101: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,222 INFO L273 TraceCheckUtils]: 102: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,222 INFO L273 TraceCheckUtils]: 103: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,222 INFO L273 TraceCheckUtils]: 104: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,222 INFO L273 TraceCheckUtils]: 105: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,223 INFO L273 TraceCheckUtils]: 106: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,223 INFO L273 TraceCheckUtils]: 107: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,223 INFO L273 TraceCheckUtils]: 108: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,223 INFO L273 TraceCheckUtils]: 109: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,223 INFO L273 TraceCheckUtils]: 110: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,223 INFO L273 TraceCheckUtils]: 111: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,224 INFO L273 TraceCheckUtils]: 112: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,224 INFO L273 TraceCheckUtils]: 113: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,224 INFO L273 TraceCheckUtils]: 114: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,224 INFO L273 TraceCheckUtils]: 115: Hoare triple {36171#true} assume !(~i~0 < 10000); {36171#true} is VALID [2018-11-23 12:28:52,224 INFO L273 TraceCheckUtils]: 116: Hoare triple {36171#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {36171#true} is VALID [2018-11-23 12:28:52,224 INFO L273 TraceCheckUtils]: 117: Hoare triple {36171#true} assume true; {36171#true} is VALID [2018-11-23 12:28:52,224 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {36171#true} {36172#false} #70#return; {36172#false} is VALID [2018-11-23 12:28:52,224 INFO L273 TraceCheckUtils]: 119: Hoare triple {36172#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {36172#false} is VALID [2018-11-23 12:28:52,224 INFO L256 TraceCheckUtils]: 120: Hoare triple {36172#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {36171#true} is VALID [2018-11-23 12:28:52,224 INFO L273 TraceCheckUtils]: 121: Hoare triple {36171#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {36171#true} is VALID [2018-11-23 12:28:52,225 INFO L273 TraceCheckUtils]: 122: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,225 INFO L273 TraceCheckUtils]: 123: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,225 INFO L273 TraceCheckUtils]: 124: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,225 INFO L273 TraceCheckUtils]: 125: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,225 INFO L273 TraceCheckUtils]: 126: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,225 INFO L273 TraceCheckUtils]: 127: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,225 INFO L273 TraceCheckUtils]: 128: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,225 INFO L273 TraceCheckUtils]: 129: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,225 INFO L273 TraceCheckUtils]: 130: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,226 INFO L273 TraceCheckUtils]: 131: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,226 INFO L273 TraceCheckUtils]: 132: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,226 INFO L273 TraceCheckUtils]: 133: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,226 INFO L273 TraceCheckUtils]: 134: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,226 INFO L273 TraceCheckUtils]: 135: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,226 INFO L273 TraceCheckUtils]: 136: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,226 INFO L273 TraceCheckUtils]: 137: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,226 INFO L273 TraceCheckUtils]: 138: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,226 INFO L273 TraceCheckUtils]: 139: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,226 INFO L273 TraceCheckUtils]: 140: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,227 INFO L273 TraceCheckUtils]: 141: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,227 INFO L273 TraceCheckUtils]: 142: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,227 INFO L273 TraceCheckUtils]: 143: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,227 INFO L273 TraceCheckUtils]: 144: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,227 INFO L273 TraceCheckUtils]: 145: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,227 INFO L273 TraceCheckUtils]: 146: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,227 INFO L273 TraceCheckUtils]: 147: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,227 INFO L273 TraceCheckUtils]: 148: Hoare triple {36171#true} assume !(~i~0 < 10000); {36171#true} is VALID [2018-11-23 12:28:52,227 INFO L273 TraceCheckUtils]: 149: Hoare triple {36171#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {36171#true} is VALID [2018-11-23 12:28:52,227 INFO L273 TraceCheckUtils]: 150: Hoare triple {36171#true} assume true; {36171#true} is VALID [2018-11-23 12:28:52,228 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {36171#true} {36172#false} #72#return; {36172#false} is VALID [2018-11-23 12:28:52,228 INFO L273 TraceCheckUtils]: 152: Hoare triple {36172#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {36172#false} is VALID [2018-11-23 12:28:52,228 INFO L273 TraceCheckUtils]: 153: Hoare triple {36172#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:52,228 INFO L273 TraceCheckUtils]: 154: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:52,228 INFO L273 TraceCheckUtils]: 155: Hoare triple {36172#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:52,228 INFO L273 TraceCheckUtils]: 156: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:52,228 INFO L273 TraceCheckUtils]: 157: Hoare triple {36172#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:52,228 INFO L273 TraceCheckUtils]: 158: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:52,228 INFO L273 TraceCheckUtils]: 159: Hoare triple {36172#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:52,229 INFO L273 TraceCheckUtils]: 160: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:52,229 INFO L273 TraceCheckUtils]: 161: Hoare triple {36172#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:52,229 INFO L273 TraceCheckUtils]: 162: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:52,229 INFO L273 TraceCheckUtils]: 163: Hoare triple {36172#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:52,229 INFO L273 TraceCheckUtils]: 164: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:52,229 INFO L273 TraceCheckUtils]: 165: Hoare triple {36172#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:52,229 INFO L273 TraceCheckUtils]: 166: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:52,229 INFO L273 TraceCheckUtils]: 167: Hoare triple {36172#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:52,229 INFO L273 TraceCheckUtils]: 168: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:52,229 INFO L273 TraceCheckUtils]: 169: Hoare triple {36172#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:52,230 INFO L273 TraceCheckUtils]: 170: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:52,230 INFO L273 TraceCheckUtils]: 171: Hoare triple {36172#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:52,230 INFO L273 TraceCheckUtils]: 172: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:52,230 INFO L273 TraceCheckUtils]: 173: Hoare triple {36172#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:52,230 INFO L273 TraceCheckUtils]: 174: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:52,230 INFO L273 TraceCheckUtils]: 175: Hoare triple {36172#false} assume !(~i~2 < 9999); {36172#false} is VALID [2018-11-23 12:28:52,230 INFO L273 TraceCheckUtils]: 176: Hoare triple {36172#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {36172#false} is VALID [2018-11-23 12:28:52,230 INFO L256 TraceCheckUtils]: 177: Hoare triple {36172#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {36171#true} is VALID [2018-11-23 12:28:52,230 INFO L273 TraceCheckUtils]: 178: Hoare triple {36171#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {36171#true} is VALID [2018-11-23 12:28:52,230 INFO L273 TraceCheckUtils]: 179: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,231 INFO L273 TraceCheckUtils]: 180: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,231 INFO L273 TraceCheckUtils]: 181: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,231 INFO L273 TraceCheckUtils]: 182: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,231 INFO L273 TraceCheckUtils]: 183: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,231 INFO L273 TraceCheckUtils]: 184: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,231 INFO L273 TraceCheckUtils]: 185: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,231 INFO L273 TraceCheckUtils]: 186: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,231 INFO L273 TraceCheckUtils]: 187: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,231 INFO L273 TraceCheckUtils]: 188: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,231 INFO L273 TraceCheckUtils]: 189: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,232 INFO L273 TraceCheckUtils]: 190: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,232 INFO L273 TraceCheckUtils]: 191: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,232 INFO L273 TraceCheckUtils]: 192: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,232 INFO L273 TraceCheckUtils]: 193: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,232 INFO L273 TraceCheckUtils]: 194: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,232 INFO L273 TraceCheckUtils]: 195: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,232 INFO L273 TraceCheckUtils]: 196: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,232 INFO L273 TraceCheckUtils]: 197: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,232 INFO L273 TraceCheckUtils]: 198: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,232 INFO L273 TraceCheckUtils]: 199: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,233 INFO L273 TraceCheckUtils]: 200: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,233 INFO L273 TraceCheckUtils]: 201: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,233 INFO L273 TraceCheckUtils]: 202: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,233 INFO L273 TraceCheckUtils]: 203: Hoare triple {36171#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:52,233 INFO L273 TraceCheckUtils]: 204: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:52,233 INFO L273 TraceCheckUtils]: 205: Hoare triple {36171#true} assume !(~i~0 < 10000); {36171#true} is VALID [2018-11-23 12:28:52,233 INFO L273 TraceCheckUtils]: 206: Hoare triple {36171#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {36171#true} is VALID [2018-11-23 12:28:52,233 INFO L273 TraceCheckUtils]: 207: Hoare triple {36171#true} assume true; {36171#true} is VALID [2018-11-23 12:28:52,233 INFO L268 TraceCheckUtils]: 208: Hoare quadruple {36171#true} {36172#false} #74#return; {36172#false} is VALID [2018-11-23 12:28:52,234 INFO L273 TraceCheckUtils]: 209: Hoare triple {36172#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {36172#false} is VALID [2018-11-23 12:28:52,234 INFO L273 TraceCheckUtils]: 210: Hoare triple {36172#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {36172#false} is VALID [2018-11-23 12:28:52,234 INFO L273 TraceCheckUtils]: 211: Hoare triple {36172#false} assume !false; {36172#false} is VALID [2018-11-23 12:28:52,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2018-11-23 12:28:52,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:52,254 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:52,263 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:28:52,388 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:28:52,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:52,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:52,939 INFO L256 TraceCheckUtils]: 0: Hoare triple {36171#true} call ULTIMATE.init(); {36171#true} is VALID [2018-11-23 12:28:52,939 INFO L273 TraceCheckUtils]: 1: Hoare triple {36171#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36171#true} is VALID [2018-11-23 12:28:52,939 INFO L273 TraceCheckUtils]: 2: Hoare triple {36171#true} assume true; {36171#true} is VALID [2018-11-23 12:28:52,940 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36171#true} {36171#true} #66#return; {36171#true} is VALID [2018-11-23 12:28:52,940 INFO L256 TraceCheckUtils]: 4: Hoare triple {36171#true} call #t~ret13 := main(); {36171#true} is VALID [2018-11-23 12:28:52,941 INFO L273 TraceCheckUtils]: 5: Hoare triple {36171#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; {36232#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:52,941 INFO L273 TraceCheckUtils]: 6: Hoare triple {36232#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36232#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:52,942 INFO L273 TraceCheckUtils]: 7: Hoare triple {36232#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36174#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:52,942 INFO L273 TraceCheckUtils]: 8: Hoare triple {36174#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36174#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:52,943 INFO L273 TraceCheckUtils]: 9: Hoare triple {36174#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36175#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:52,943 INFO L273 TraceCheckUtils]: 10: Hoare triple {36175#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36175#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:52,944 INFO L273 TraceCheckUtils]: 11: Hoare triple {36175#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36176#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:52,945 INFO L273 TraceCheckUtils]: 12: Hoare triple {36176#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36176#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:52,946 INFO L273 TraceCheckUtils]: 13: Hoare triple {36176#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36177#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:52,946 INFO L273 TraceCheckUtils]: 14: Hoare triple {36177#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36177#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:52,947 INFO L273 TraceCheckUtils]: 15: Hoare triple {36177#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36178#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:52,948 INFO L273 TraceCheckUtils]: 16: Hoare triple {36178#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36178#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:52,949 INFO L273 TraceCheckUtils]: 17: Hoare triple {36178#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36179#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:52,949 INFO L273 TraceCheckUtils]: 18: Hoare triple {36179#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36179#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:52,950 INFO L273 TraceCheckUtils]: 19: Hoare triple {36179#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36180#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:52,951 INFO L273 TraceCheckUtils]: 20: Hoare triple {36180#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36180#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:52,952 INFO L273 TraceCheckUtils]: 21: Hoare triple {36180#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36181#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:52,953 INFO L273 TraceCheckUtils]: 22: Hoare triple {36181#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36181#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:52,953 INFO L273 TraceCheckUtils]: 23: Hoare triple {36181#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36182#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:52,954 INFO L273 TraceCheckUtils]: 24: Hoare triple {36182#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36182#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:52,955 INFO L273 TraceCheckUtils]: 25: Hoare triple {36182#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36183#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:52,956 INFO L273 TraceCheckUtils]: 26: Hoare triple {36183#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36183#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:52,957 INFO L273 TraceCheckUtils]: 27: Hoare triple {36183#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36184#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:52,957 INFO L273 TraceCheckUtils]: 28: Hoare triple {36184#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36184#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:52,958 INFO L273 TraceCheckUtils]: 29: Hoare triple {36184#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36185#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:52,959 INFO L273 TraceCheckUtils]: 30: Hoare triple {36185#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36185#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:52,960 INFO L273 TraceCheckUtils]: 31: Hoare triple {36185#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36186#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:52,960 INFO L273 TraceCheckUtils]: 32: Hoare triple {36186#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36186#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:52,961 INFO L273 TraceCheckUtils]: 33: Hoare triple {36186#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36187#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:52,962 INFO L273 TraceCheckUtils]: 34: Hoare triple {36187#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36187#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:52,963 INFO L273 TraceCheckUtils]: 35: Hoare triple {36187#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36188#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:52,963 INFO L273 TraceCheckUtils]: 36: Hoare triple {36188#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36188#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:52,964 INFO L273 TraceCheckUtils]: 37: Hoare triple {36188#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36189#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:52,965 INFO L273 TraceCheckUtils]: 38: Hoare triple {36189#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36189#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:52,966 INFO L273 TraceCheckUtils]: 39: Hoare triple {36189#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36190#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:52,967 INFO L273 TraceCheckUtils]: 40: Hoare triple {36190#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36190#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:52,967 INFO L273 TraceCheckUtils]: 41: Hoare triple {36190#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36191#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:52,968 INFO L273 TraceCheckUtils]: 42: Hoare triple {36191#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36191#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:52,969 INFO L273 TraceCheckUtils]: 43: Hoare triple {36191#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36192#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:52,970 INFO L273 TraceCheckUtils]: 44: Hoare triple {36192#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36192#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:52,971 INFO L273 TraceCheckUtils]: 45: Hoare triple {36192#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36193#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:52,971 INFO L273 TraceCheckUtils]: 46: Hoare triple {36193#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36193#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:52,972 INFO L273 TraceCheckUtils]: 47: Hoare triple {36193#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36194#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:52,973 INFO L273 TraceCheckUtils]: 48: Hoare triple {36194#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36194#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:52,974 INFO L273 TraceCheckUtils]: 49: Hoare triple {36194#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36195#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:52,974 INFO L273 TraceCheckUtils]: 50: Hoare triple {36195#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36195#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:52,975 INFO L273 TraceCheckUtils]: 51: Hoare triple {36195#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36196#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:52,976 INFO L273 TraceCheckUtils]: 52: Hoare triple {36196#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36196#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:52,977 INFO L273 TraceCheckUtils]: 53: Hoare triple {36196#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36197#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:52,977 INFO L273 TraceCheckUtils]: 54: Hoare triple {36197#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36197#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:52,978 INFO L273 TraceCheckUtils]: 55: Hoare triple {36197#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36198#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:52,979 INFO L273 TraceCheckUtils]: 56: Hoare triple {36198#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36198#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:52,980 INFO L273 TraceCheckUtils]: 57: Hoare triple {36198#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36199#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:52,981 INFO L273 TraceCheckUtils]: 58: Hoare triple {36199#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36199#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:52,981 INFO L273 TraceCheckUtils]: 59: Hoare triple {36199#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36200#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:52,982 INFO L273 TraceCheckUtils]: 60: Hoare triple {36200#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36200#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:52,983 INFO L273 TraceCheckUtils]: 61: Hoare triple {36200#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36201#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:52,984 INFO L273 TraceCheckUtils]: 62: Hoare triple {36201#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {36201#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:52,985 INFO L273 TraceCheckUtils]: 63: Hoare triple {36201#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36202#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:52,985 INFO L273 TraceCheckUtils]: 64: Hoare triple {36202#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36202#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:52,986 INFO L273 TraceCheckUtils]: 65: Hoare triple {36202#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36203#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:52,987 INFO L273 TraceCheckUtils]: 66: Hoare triple {36203#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36203#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:52,988 INFO L273 TraceCheckUtils]: 67: Hoare triple {36203#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36204#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:52,988 INFO L273 TraceCheckUtils]: 68: Hoare triple {36204#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36204#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:52,989 INFO L273 TraceCheckUtils]: 69: Hoare triple {36204#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36205#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:52,990 INFO L273 TraceCheckUtils]: 70: Hoare triple {36205#(<= main_~i~1 32)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36205#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:52,991 INFO L273 TraceCheckUtils]: 71: Hoare triple {36205#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36206#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:52,991 INFO L273 TraceCheckUtils]: 72: Hoare triple {36206#(<= main_~i~1 33)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36206#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:52,992 INFO L273 TraceCheckUtils]: 73: Hoare triple {36206#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36207#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:52,993 INFO L273 TraceCheckUtils]: 74: Hoare triple {36207#(<= main_~i~1 34)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36207#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:52,994 INFO L273 TraceCheckUtils]: 75: Hoare triple {36207#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36208#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:52,995 INFO L273 TraceCheckUtils]: 76: Hoare triple {36208#(<= main_~i~1 35)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36208#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:52,995 INFO L273 TraceCheckUtils]: 77: Hoare triple {36208#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36209#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:52,996 INFO L273 TraceCheckUtils]: 78: Hoare triple {36209#(<= main_~i~1 36)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36209#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:52,997 INFO L273 TraceCheckUtils]: 79: Hoare triple {36209#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36210#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:52,998 INFO L273 TraceCheckUtils]: 80: Hoare triple {36210#(<= main_~i~1 37)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36210#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:52,999 INFO L273 TraceCheckUtils]: 81: Hoare triple {36210#(<= main_~i~1 37)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36211#(<= main_~i~1 38)} is VALID [2018-11-23 12:28:52,999 INFO L273 TraceCheckUtils]: 82: Hoare triple {36211#(<= main_~i~1 38)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36211#(<= main_~i~1 38)} is VALID [2018-11-23 12:28:53,000 INFO L273 TraceCheckUtils]: 83: Hoare triple {36211#(<= main_~i~1 38)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36212#(<= main_~i~1 39)} is VALID [2018-11-23 12:28:53,001 INFO L273 TraceCheckUtils]: 84: Hoare triple {36212#(<= main_~i~1 39)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36212#(<= main_~i~1 39)} is VALID [2018-11-23 12:28:53,002 INFO L273 TraceCheckUtils]: 85: Hoare triple {36212#(<= main_~i~1 39)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36213#(<= main_~i~1 40)} is VALID [2018-11-23 12:28:53,002 INFO L273 TraceCheckUtils]: 86: Hoare triple {36213#(<= main_~i~1 40)} assume !(~i~1 < 10000); {36172#false} is VALID [2018-11-23 12:28:53,003 INFO L256 TraceCheckUtils]: 87: Hoare triple {36172#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {36172#false} is VALID [2018-11-23 12:28:53,003 INFO L273 TraceCheckUtils]: 88: Hoare triple {36172#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {36172#false} is VALID [2018-11-23 12:28:53,003 INFO L273 TraceCheckUtils]: 89: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,003 INFO L273 TraceCheckUtils]: 90: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,003 INFO L273 TraceCheckUtils]: 91: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,004 INFO L273 TraceCheckUtils]: 92: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,004 INFO L273 TraceCheckUtils]: 93: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,004 INFO L273 TraceCheckUtils]: 94: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,004 INFO L273 TraceCheckUtils]: 95: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,004 INFO L273 TraceCheckUtils]: 96: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,004 INFO L273 TraceCheckUtils]: 97: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,005 INFO L273 TraceCheckUtils]: 98: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,005 INFO L273 TraceCheckUtils]: 99: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,005 INFO L273 TraceCheckUtils]: 100: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,005 INFO L273 TraceCheckUtils]: 101: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,005 INFO L273 TraceCheckUtils]: 102: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,005 INFO L273 TraceCheckUtils]: 103: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,005 INFO L273 TraceCheckUtils]: 104: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,005 INFO L273 TraceCheckUtils]: 105: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,006 INFO L273 TraceCheckUtils]: 106: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,006 INFO L273 TraceCheckUtils]: 107: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,006 INFO L273 TraceCheckUtils]: 108: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,006 INFO L273 TraceCheckUtils]: 109: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,006 INFO L273 TraceCheckUtils]: 110: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,006 INFO L273 TraceCheckUtils]: 111: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,006 INFO L273 TraceCheckUtils]: 112: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,006 INFO L273 TraceCheckUtils]: 113: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,006 INFO L273 TraceCheckUtils]: 114: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,006 INFO L273 TraceCheckUtils]: 115: Hoare triple {36172#false} assume !(~i~0 < 10000); {36172#false} is VALID [2018-11-23 12:28:53,007 INFO L273 TraceCheckUtils]: 116: Hoare triple {36172#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {36172#false} is VALID [2018-11-23 12:28:53,007 INFO L273 TraceCheckUtils]: 117: Hoare triple {36172#false} assume true; {36172#false} is VALID [2018-11-23 12:28:53,007 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {36172#false} {36172#false} #70#return; {36172#false} is VALID [2018-11-23 12:28:53,007 INFO L273 TraceCheckUtils]: 119: Hoare triple {36172#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {36172#false} is VALID [2018-11-23 12:28:53,007 INFO L256 TraceCheckUtils]: 120: Hoare triple {36172#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {36172#false} is VALID [2018-11-23 12:28:53,007 INFO L273 TraceCheckUtils]: 121: Hoare triple {36172#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {36172#false} is VALID [2018-11-23 12:28:53,007 INFO L273 TraceCheckUtils]: 122: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,007 INFO L273 TraceCheckUtils]: 123: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,007 INFO L273 TraceCheckUtils]: 124: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,008 INFO L273 TraceCheckUtils]: 125: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,008 INFO L273 TraceCheckUtils]: 126: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,008 INFO L273 TraceCheckUtils]: 127: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,008 INFO L273 TraceCheckUtils]: 128: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,008 INFO L273 TraceCheckUtils]: 129: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,008 INFO L273 TraceCheckUtils]: 130: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,008 INFO L273 TraceCheckUtils]: 131: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,008 INFO L273 TraceCheckUtils]: 132: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,008 INFO L273 TraceCheckUtils]: 133: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,008 INFO L273 TraceCheckUtils]: 134: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,009 INFO L273 TraceCheckUtils]: 135: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,009 INFO L273 TraceCheckUtils]: 136: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,009 INFO L273 TraceCheckUtils]: 137: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,009 INFO L273 TraceCheckUtils]: 138: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,009 INFO L273 TraceCheckUtils]: 139: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,009 INFO L273 TraceCheckUtils]: 140: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,009 INFO L273 TraceCheckUtils]: 141: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,009 INFO L273 TraceCheckUtils]: 142: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,009 INFO L273 TraceCheckUtils]: 143: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,010 INFO L273 TraceCheckUtils]: 144: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,010 INFO L273 TraceCheckUtils]: 145: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,010 INFO L273 TraceCheckUtils]: 146: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,010 INFO L273 TraceCheckUtils]: 147: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,010 INFO L273 TraceCheckUtils]: 148: Hoare triple {36172#false} assume !(~i~0 < 10000); {36172#false} is VALID [2018-11-23 12:28:53,010 INFO L273 TraceCheckUtils]: 149: Hoare triple {36172#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {36172#false} is VALID [2018-11-23 12:28:53,010 INFO L273 TraceCheckUtils]: 150: Hoare triple {36172#false} assume true; {36172#false} is VALID [2018-11-23 12:28:53,010 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {36172#false} {36172#false} #72#return; {36172#false} is VALID [2018-11-23 12:28:53,010 INFO L273 TraceCheckUtils]: 152: Hoare triple {36172#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {36172#false} is VALID [2018-11-23 12:28:53,010 INFO L273 TraceCheckUtils]: 153: Hoare triple {36172#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:53,011 INFO L273 TraceCheckUtils]: 154: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:53,011 INFO L273 TraceCheckUtils]: 155: Hoare triple {36172#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:53,011 INFO L273 TraceCheckUtils]: 156: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:53,011 INFO L273 TraceCheckUtils]: 157: Hoare triple {36172#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:53,011 INFO L273 TraceCheckUtils]: 158: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:53,011 INFO L273 TraceCheckUtils]: 159: Hoare triple {36172#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:53,011 INFO L273 TraceCheckUtils]: 160: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:53,011 INFO L273 TraceCheckUtils]: 161: Hoare triple {36172#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:53,011 INFO L273 TraceCheckUtils]: 162: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:53,012 INFO L273 TraceCheckUtils]: 163: Hoare triple {36172#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:53,012 INFO L273 TraceCheckUtils]: 164: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:53,012 INFO L273 TraceCheckUtils]: 165: Hoare triple {36172#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:53,012 INFO L273 TraceCheckUtils]: 166: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:53,012 INFO L273 TraceCheckUtils]: 167: Hoare triple {36172#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:53,012 INFO L273 TraceCheckUtils]: 168: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:53,012 INFO L273 TraceCheckUtils]: 169: Hoare triple {36172#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:53,012 INFO L273 TraceCheckUtils]: 170: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:53,012 INFO L273 TraceCheckUtils]: 171: Hoare triple {36172#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:53,012 INFO L273 TraceCheckUtils]: 172: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:53,013 INFO L273 TraceCheckUtils]: 173: Hoare triple {36172#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:53,013 INFO L273 TraceCheckUtils]: 174: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:53,013 INFO L273 TraceCheckUtils]: 175: Hoare triple {36172#false} assume !(~i~2 < 9999); {36172#false} is VALID [2018-11-23 12:28:53,013 INFO L273 TraceCheckUtils]: 176: Hoare triple {36172#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {36172#false} is VALID [2018-11-23 12:28:53,013 INFO L256 TraceCheckUtils]: 177: Hoare triple {36172#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {36172#false} is VALID [2018-11-23 12:28:53,013 INFO L273 TraceCheckUtils]: 178: Hoare triple {36172#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, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {36172#false} is VALID [2018-11-23 12:28:53,013 INFO L273 TraceCheckUtils]: 179: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,013 INFO L273 TraceCheckUtils]: 180: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,013 INFO L273 TraceCheckUtils]: 181: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,013 INFO L273 TraceCheckUtils]: 182: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,014 INFO L273 TraceCheckUtils]: 183: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,014 INFO L273 TraceCheckUtils]: 184: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,014 INFO L273 TraceCheckUtils]: 185: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,014 INFO L273 TraceCheckUtils]: 186: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,014 INFO L273 TraceCheckUtils]: 187: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,014 INFO L273 TraceCheckUtils]: 188: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,014 INFO L273 TraceCheckUtils]: 189: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,014 INFO L273 TraceCheckUtils]: 190: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,014 INFO L273 TraceCheckUtils]: 191: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,014 INFO L273 TraceCheckUtils]: 192: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,015 INFO L273 TraceCheckUtils]: 193: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,015 INFO L273 TraceCheckUtils]: 194: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,015 INFO L273 TraceCheckUtils]: 195: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,015 INFO L273 TraceCheckUtils]: 196: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,015 INFO L273 TraceCheckUtils]: 197: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,015 INFO L273 TraceCheckUtils]: 198: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,015 INFO L273 TraceCheckUtils]: 199: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,015 INFO L273 TraceCheckUtils]: 200: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,015 INFO L273 TraceCheckUtils]: 201: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,016 INFO L273 TraceCheckUtils]: 202: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,016 INFO L273 TraceCheckUtils]: 203: Hoare triple {36172#false} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:53,016 INFO L273 TraceCheckUtils]: 204: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:53,016 INFO L273 TraceCheckUtils]: 205: Hoare triple {36172#false} assume !(~i~0 < 10000); {36172#false} is VALID [2018-11-23 12:28:53,016 INFO L273 TraceCheckUtils]: 206: Hoare triple {36172#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {36172#false} is VALID [2018-11-23 12:28:53,016 INFO L273 TraceCheckUtils]: 207: Hoare triple {36172#false} assume true; {36172#false} is VALID [2018-11-23 12:28:53,016 INFO L268 TraceCheckUtils]: 208: Hoare quadruple {36172#false} {36172#false} #74#return; {36172#false} is VALID [2018-11-23 12:28:53,016 INFO L273 TraceCheckUtils]: 209: Hoare triple {36172#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {36172#false} is VALID [2018-11-23 12:28:53,016 INFO L273 TraceCheckUtils]: 210: Hoare triple {36172#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {36172#false} is VALID [2018-11-23 12:28:53,016 INFO L273 TraceCheckUtils]: 211: Hoare triple {36172#false} assume !false; {36172#false} is VALID [2018-11-23 12:28:53,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2018-11-23 12:28:53,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:53,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2018-11-23 12:28:53,072 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 212 [2018-11-23 12:28:53,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:53,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-23 12:28:53,304 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-23 12:28:53,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 12:28:53,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 12:28:53,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 12:28:53,305 INFO L87 Difference]: Start difference. First operand 151 states and 155 transitions. Second operand 44 states. [2018-11-23 12:28:54,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:54,894 INFO L93 Difference]: Finished difference Result 218 states and 226 transitions. [2018-11-23 12:28:54,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 12:28:54,894 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 212 [2018-11-23 12:28:54,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:54,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:28:54,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 134 transitions. [2018-11-23 12:28:54,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:28:54,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 134 transitions. [2018-11-23 12:28:54,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 134 transitions. [2018-11-23 12:28:55,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:55,136 INFO L225 Difference]: With dead ends: 218 [2018-11-23 12:28:55,136 INFO L226 Difference]: Without dead ends: 154 [2018-11-23 12:28:55,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 12:28:55,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-23 12:28:55,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-11-23 12:28:55,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:55,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand 153 states. [2018-11-23 12:28:55,220 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 153 states. [2018-11-23 12:28:55,220 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 153 states. [2018-11-23 12:28:55,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:55,223 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2018-11-23 12:28:55,223 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2018-11-23 12:28:55,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:55,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:55,223 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 154 states. [2018-11-23 12:28:55,223 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 154 states. [2018-11-23 12:28:55,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:55,226 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2018-11-23 12:28:55,226 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2018-11-23 12:28:55,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:55,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:55,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:55,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:55,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-23 12:28:55,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 157 transitions. [2018-11-23 12:28:55,230 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 157 transitions. Word has length 212 [2018-11-23 12:28:55,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:55,230 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 157 transitions. [2018-11-23 12:28:55,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 12:28:55,230 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-23 12:28:55,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-23 12:28:55,231 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:55,232 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 39, 39, 11, 11, 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-23 12:28:55,232 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:55,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:55,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1698842739, now seen corresponding path program 41 times [2018-11-23 12:28:55,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:55,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:55,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:55,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:55,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:56,998 INFO L256 TraceCheckUtils]: 0: Hoare triple {37711#true} call ULTIMATE.init(); {37711#true} is VALID [2018-11-23 12:28:56,998 INFO L273 TraceCheckUtils]: 1: Hoare triple {37711#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37711#true} is VALID [2018-11-23 12:28:56,998 INFO L273 TraceCheckUtils]: 2: Hoare triple {37711#true} assume true; {37711#true} is VALID [2018-11-23 12:28:56,999 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37711#true} {37711#true} #66#return; {37711#true} is VALID [2018-11-23 12:28:56,999 INFO L256 TraceCheckUtils]: 4: Hoare triple {37711#true} call #t~ret13 := main(); {37711#true} is VALID [2018-11-23 12:28:57,000 INFO L273 TraceCheckUtils]: 5: Hoare triple {37711#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; {37713#(= main_~i~1 0)} is VALID [2018-11-23 12:28:57,000 INFO L273 TraceCheckUtils]: 6: Hoare triple {37713#(= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37713#(= main_~i~1 0)} is VALID [2018-11-23 12:28:57,001 INFO L273 TraceCheckUtils]: 7: Hoare triple {37713#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37714#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:57,002 INFO L273 TraceCheckUtils]: 8: Hoare triple {37714#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37714#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:57,003 INFO L273 TraceCheckUtils]: 9: Hoare triple {37714#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37715#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:57,003 INFO L273 TraceCheckUtils]: 10: Hoare triple {37715#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37715#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:57,004 INFO L273 TraceCheckUtils]: 11: Hoare triple {37715#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37716#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:57,005 INFO L273 TraceCheckUtils]: 12: Hoare triple {37716#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37716#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:57,006 INFO L273 TraceCheckUtils]: 13: Hoare triple {37716#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37717#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:57,007 INFO L273 TraceCheckUtils]: 14: Hoare triple {37717#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37717#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:57,007 INFO L273 TraceCheckUtils]: 15: Hoare triple {37717#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37718#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:57,008 INFO L273 TraceCheckUtils]: 16: Hoare triple {37718#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37718#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:57,009 INFO L273 TraceCheckUtils]: 17: Hoare triple {37718#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37719#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:57,010 INFO L273 TraceCheckUtils]: 18: Hoare triple {37719#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37719#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:57,010 INFO L273 TraceCheckUtils]: 19: Hoare triple {37719#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37720#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:57,011 INFO L273 TraceCheckUtils]: 20: Hoare triple {37720#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37720#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:57,012 INFO L273 TraceCheckUtils]: 21: Hoare triple {37720#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37721#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:57,013 INFO L273 TraceCheckUtils]: 22: Hoare triple {37721#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37721#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:57,014 INFO L273 TraceCheckUtils]: 23: Hoare triple {37721#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37722#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:57,014 INFO L273 TraceCheckUtils]: 24: Hoare triple {37722#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37722#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:57,015 INFO L273 TraceCheckUtils]: 25: Hoare triple {37722#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37723#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:57,016 INFO L273 TraceCheckUtils]: 26: Hoare triple {37723#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37723#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:57,017 INFO L273 TraceCheckUtils]: 27: Hoare triple {37723#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37724#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:57,017 INFO L273 TraceCheckUtils]: 28: Hoare triple {37724#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37724#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:57,018 INFO L273 TraceCheckUtils]: 29: Hoare triple {37724#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37725#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:57,019 INFO L273 TraceCheckUtils]: 30: Hoare triple {37725#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37725#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:57,020 INFO L273 TraceCheckUtils]: 31: Hoare triple {37725#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37726#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:57,020 INFO L273 TraceCheckUtils]: 32: Hoare triple {37726#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37726#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:57,021 INFO L273 TraceCheckUtils]: 33: Hoare triple {37726#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37727#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:57,022 INFO L273 TraceCheckUtils]: 34: Hoare triple {37727#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37727#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:57,023 INFO L273 TraceCheckUtils]: 35: Hoare triple {37727#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37728#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:57,024 INFO L273 TraceCheckUtils]: 36: Hoare triple {37728#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37728#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:57,025 INFO L273 TraceCheckUtils]: 37: Hoare triple {37728#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37729#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:57,025 INFO L273 TraceCheckUtils]: 38: Hoare triple {37729#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37729#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:57,026 INFO L273 TraceCheckUtils]: 39: Hoare triple {37729#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37730#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:57,027 INFO L273 TraceCheckUtils]: 40: Hoare triple {37730#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37730#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:57,028 INFO L273 TraceCheckUtils]: 41: Hoare triple {37730#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37731#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:57,028 INFO L273 TraceCheckUtils]: 42: Hoare triple {37731#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37731#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:57,029 INFO L273 TraceCheckUtils]: 43: Hoare triple {37731#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37732#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:57,030 INFO L273 TraceCheckUtils]: 44: Hoare triple {37732#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37732#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:57,031 INFO L273 TraceCheckUtils]: 45: Hoare triple {37732#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37733#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:57,031 INFO L273 TraceCheckUtils]: 46: Hoare triple {37733#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37733#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:57,032 INFO L273 TraceCheckUtils]: 47: Hoare triple {37733#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37734#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:57,033 INFO L273 TraceCheckUtils]: 48: Hoare triple {37734#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37734#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:57,034 INFO L273 TraceCheckUtils]: 49: Hoare triple {37734#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37735#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:57,035 INFO L273 TraceCheckUtils]: 50: Hoare triple {37735#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37735#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:57,035 INFO L273 TraceCheckUtils]: 51: Hoare triple {37735#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37736#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:57,036 INFO L273 TraceCheckUtils]: 52: Hoare triple {37736#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37736#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:57,037 INFO L273 TraceCheckUtils]: 53: Hoare triple {37736#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37737#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:57,038 INFO L273 TraceCheckUtils]: 54: Hoare triple {37737#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37737#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:57,038 INFO L273 TraceCheckUtils]: 55: Hoare triple {37737#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37738#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:57,039 INFO L273 TraceCheckUtils]: 56: Hoare triple {37738#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37738#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:57,040 INFO L273 TraceCheckUtils]: 57: Hoare triple {37738#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37739#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:57,041 INFO L273 TraceCheckUtils]: 58: Hoare triple {37739#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37739#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:57,042 INFO L273 TraceCheckUtils]: 59: Hoare triple {37739#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37740#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:57,042 INFO L273 TraceCheckUtils]: 60: Hoare triple {37740#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37740#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:57,043 INFO L273 TraceCheckUtils]: 61: Hoare triple {37740#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37741#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:57,044 INFO L273 TraceCheckUtils]: 62: Hoare triple {37741#(<= 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 + 4 * ~i~1, 4);havoc #t~nondet4; {37741#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:57,045 INFO L273 TraceCheckUtils]: 63: Hoare triple {37741#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37742#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:57,045 INFO L273 TraceCheckUtils]: 64: Hoare triple {37742#(<= main_~i~1 29)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37742#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:57,046 INFO L273 TraceCheckUtils]: 65: Hoare triple {37742#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37743#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:57,047 INFO L273 TraceCheckUtils]: 66: Hoare triple {37743#(<= main_~i~1 30)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37743#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:57,048 INFO L273 TraceCheckUtils]: 67: Hoare triple {37743#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37744#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:57,048 INFO L273 TraceCheckUtils]: 68: Hoare triple {37744#(<= main_~i~1 31)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37744#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:57,049 INFO L273 TraceCheckUtils]: 69: Hoare triple {37744#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37745#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:57,050 INFO L273 TraceCheckUtils]: 70: Hoare triple {37745#(<= main_~i~1 32)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37745#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:57,051 INFO L273 TraceCheckUtils]: 71: Hoare triple {37745#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37746#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:57,052 INFO L273 TraceCheckUtils]: 72: Hoare triple {37746#(<= main_~i~1 33)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37746#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:57,052 INFO L273 TraceCheckUtils]: 73: Hoare triple {37746#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37747#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:57,053 INFO L273 TraceCheckUtils]: 74: Hoare triple {37747#(<= main_~i~1 34)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37747#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:57,054 INFO L273 TraceCheckUtils]: 75: Hoare triple {37747#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37748#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:57,055 INFO L273 TraceCheckUtils]: 76: Hoare triple {37748#(<= main_~i~1 35)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37748#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:57,056 INFO L273 TraceCheckUtils]: 77: Hoare triple {37748#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37749#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:57,056 INFO L273 TraceCheckUtils]: 78: Hoare triple {37749#(<= main_~i~1 36)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37749#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:57,057 INFO L273 TraceCheckUtils]: 79: Hoare triple {37749#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37750#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:57,058 INFO L273 TraceCheckUtils]: 80: Hoare triple {37750#(<= main_~i~1 37)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37750#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:57,059 INFO L273 TraceCheckUtils]: 81: Hoare triple {37750#(<= main_~i~1 37)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37751#(<= main_~i~1 38)} is VALID [2018-11-23 12:28:57,059 INFO L273 TraceCheckUtils]: 82: Hoare triple {37751#(<= main_~i~1 38)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37751#(<= main_~i~1 38)} is VALID [2018-11-23 12:28:57,060 INFO L273 TraceCheckUtils]: 83: Hoare triple {37751#(<= main_~i~1 38)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37752#(<= main_~i~1 39)} is VALID [2018-11-23 12:28:57,061 INFO L273 TraceCheckUtils]: 84: Hoare triple {37752#(<= main_~i~1 39)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37752#(<= main_~i~1 39)} is VALID [2018-11-23 12:28:57,062 INFO L273 TraceCheckUtils]: 85: Hoare triple {37752#(<= main_~i~1 39)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37753#(<= main_~i~1 40)} is VALID [2018-11-23 12:28:57,062 INFO L273 TraceCheckUtils]: 86: Hoare triple {37753#(<= main_~i~1 40)} assume !!(~i~1 < 10000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37753#(<= main_~i~1 40)} is VALID [2018-11-23 12:28:57,063 INFO L273 TraceCheckUtils]: 87: Hoare triple {37753#(<= main_~i~1 40)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37754#(<= main_~i~1 41)} is VALID [2018-11-23 12:28:57,064 INFO L273 TraceCheckUtils]: 88: Hoare triple {37754#(<= main_~i~1 41)} assume !(~i~1 < 10000); {37712#false} is VALID [2018-11-23 12:28:57,064 INFO L256 TraceCheckUtils]: 89: Hoare triple {37712#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {37711#true} is VALID [2018-11-23 12:28:57,065 INFO L273 TraceCheckUtils]: 90: Hoare triple {37711#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {37711#true} is VALID [2018-11-23 12:28:57,065 INFO L273 TraceCheckUtils]: 91: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,065 INFO L273 TraceCheckUtils]: 92: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,065 INFO L273 TraceCheckUtils]: 93: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,065 INFO L273 TraceCheckUtils]: 94: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,065 INFO L273 TraceCheckUtils]: 95: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,066 INFO L273 TraceCheckUtils]: 96: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,066 INFO L273 TraceCheckUtils]: 97: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,066 INFO L273 TraceCheckUtils]: 98: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,066 INFO L273 TraceCheckUtils]: 99: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,066 INFO L273 TraceCheckUtils]: 100: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,067 INFO L273 TraceCheckUtils]: 101: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,067 INFO L273 TraceCheckUtils]: 102: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,067 INFO L273 TraceCheckUtils]: 103: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,067 INFO L273 TraceCheckUtils]: 104: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,067 INFO L273 TraceCheckUtils]: 105: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,067 INFO L273 TraceCheckUtils]: 106: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,067 INFO L273 TraceCheckUtils]: 107: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,067 INFO L273 TraceCheckUtils]: 108: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,067 INFO L273 TraceCheckUtils]: 109: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,067 INFO L273 TraceCheckUtils]: 110: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,068 INFO L273 TraceCheckUtils]: 111: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,068 INFO L273 TraceCheckUtils]: 112: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,068 INFO L273 TraceCheckUtils]: 113: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,068 INFO L273 TraceCheckUtils]: 114: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,068 INFO L273 TraceCheckUtils]: 115: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,068 INFO L273 TraceCheckUtils]: 116: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,068 INFO L273 TraceCheckUtils]: 117: Hoare triple {37711#true} assume !(~i~0 < 10000); {37711#true} is VALID [2018-11-23 12:28:57,068 INFO L273 TraceCheckUtils]: 118: Hoare triple {37711#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {37711#true} is VALID [2018-11-23 12:28:57,068 INFO L273 TraceCheckUtils]: 119: Hoare triple {37711#true} assume true; {37711#true} is VALID [2018-11-23 12:28:57,068 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {37711#true} {37712#false} #70#return; {37712#false} is VALID [2018-11-23 12:28:57,069 INFO L273 TraceCheckUtils]: 121: Hoare triple {37712#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, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {37712#false} is VALID [2018-11-23 12:28:57,069 INFO L256 TraceCheckUtils]: 122: Hoare triple {37712#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {37711#true} is VALID [2018-11-23 12:28:57,069 INFO L273 TraceCheckUtils]: 123: Hoare triple {37711#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {37711#true} is VALID [2018-11-23 12:28:57,069 INFO L273 TraceCheckUtils]: 124: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,069 INFO L273 TraceCheckUtils]: 125: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,069 INFO L273 TraceCheckUtils]: 126: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,069 INFO L273 TraceCheckUtils]: 127: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,069 INFO L273 TraceCheckUtils]: 128: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,069 INFO L273 TraceCheckUtils]: 129: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,069 INFO L273 TraceCheckUtils]: 130: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,070 INFO L273 TraceCheckUtils]: 131: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,070 INFO L273 TraceCheckUtils]: 132: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,070 INFO L273 TraceCheckUtils]: 133: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,070 INFO L273 TraceCheckUtils]: 134: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,070 INFO L273 TraceCheckUtils]: 135: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,070 INFO L273 TraceCheckUtils]: 136: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,070 INFO L273 TraceCheckUtils]: 137: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,070 INFO L273 TraceCheckUtils]: 138: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,070 INFO L273 TraceCheckUtils]: 139: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,070 INFO L273 TraceCheckUtils]: 140: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,071 INFO L273 TraceCheckUtils]: 141: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,071 INFO L273 TraceCheckUtils]: 142: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,071 INFO L273 TraceCheckUtils]: 143: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,071 INFO L273 TraceCheckUtils]: 144: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,071 INFO L273 TraceCheckUtils]: 145: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,071 INFO L273 TraceCheckUtils]: 146: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,071 INFO L273 TraceCheckUtils]: 147: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,071 INFO L273 TraceCheckUtils]: 148: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,071 INFO L273 TraceCheckUtils]: 149: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,072 INFO L273 TraceCheckUtils]: 150: Hoare triple {37711#true} assume !(~i~0 < 10000); {37711#true} is VALID [2018-11-23 12:28:57,072 INFO L273 TraceCheckUtils]: 151: Hoare triple {37711#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {37711#true} is VALID [2018-11-23 12:28:57,072 INFO L273 TraceCheckUtils]: 152: Hoare triple {37711#true} assume true; {37711#true} is VALID [2018-11-23 12:28:57,072 INFO L268 TraceCheckUtils]: 153: Hoare quadruple {37711#true} {37712#false} #72#return; {37712#false} is VALID [2018-11-23 12:28:57,072 INFO L273 TraceCheckUtils]: 154: Hoare triple {37712#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, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {37712#false} is VALID [2018-11-23 12:28:57,072 INFO L273 TraceCheckUtils]: 155: Hoare triple {37712#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37712#false} is VALID [2018-11-23 12:28:57,072 INFO L273 TraceCheckUtils]: 156: Hoare triple {37712#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37712#false} is VALID [2018-11-23 12:28:57,072 INFO L273 TraceCheckUtils]: 157: Hoare triple {37712#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37712#false} is VALID [2018-11-23 12:28:57,072 INFO L273 TraceCheckUtils]: 158: Hoare triple {37712#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37712#false} is VALID [2018-11-23 12:28:57,072 INFO L273 TraceCheckUtils]: 159: Hoare triple {37712#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37712#false} is VALID [2018-11-23 12:28:57,073 INFO L273 TraceCheckUtils]: 160: Hoare triple {37712#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37712#false} is VALID [2018-11-23 12:28:57,073 INFO L273 TraceCheckUtils]: 161: Hoare triple {37712#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37712#false} is VALID [2018-11-23 12:28:57,073 INFO L273 TraceCheckUtils]: 162: Hoare triple {37712#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37712#false} is VALID [2018-11-23 12:28:57,073 INFO L273 TraceCheckUtils]: 163: Hoare triple {37712#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37712#false} is VALID [2018-11-23 12:28:57,073 INFO L273 TraceCheckUtils]: 164: Hoare triple {37712#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37712#false} is VALID [2018-11-23 12:28:57,073 INFO L273 TraceCheckUtils]: 165: Hoare triple {37712#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37712#false} is VALID [2018-11-23 12:28:57,073 INFO L273 TraceCheckUtils]: 166: Hoare triple {37712#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37712#false} is VALID [2018-11-23 12:28:57,073 INFO L273 TraceCheckUtils]: 167: Hoare triple {37712#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37712#false} is VALID [2018-11-23 12:28:57,073 INFO L273 TraceCheckUtils]: 168: Hoare triple {37712#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37712#false} is VALID [2018-11-23 12:28:57,073 INFO L273 TraceCheckUtils]: 169: Hoare triple {37712#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37712#false} is VALID [2018-11-23 12:28:57,074 INFO L273 TraceCheckUtils]: 170: Hoare triple {37712#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37712#false} is VALID [2018-11-23 12:28:57,074 INFO L273 TraceCheckUtils]: 171: Hoare triple {37712#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37712#false} is VALID [2018-11-23 12:28:57,074 INFO L273 TraceCheckUtils]: 172: Hoare triple {37712#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37712#false} is VALID [2018-11-23 12:28:57,074 INFO L273 TraceCheckUtils]: 173: Hoare triple {37712#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37712#false} is VALID [2018-11-23 12:28:57,074 INFO L273 TraceCheckUtils]: 174: Hoare triple {37712#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37712#false} is VALID [2018-11-23 12:28:57,074 INFO L273 TraceCheckUtils]: 175: Hoare triple {37712#false} assume !!(~i~2 < 9999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37712#false} is VALID [2018-11-23 12:28:57,074 INFO L273 TraceCheckUtils]: 176: Hoare triple {37712#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37712#false} is VALID [2018-11-23 12:28:57,074 INFO L273 TraceCheckUtils]: 177: Hoare triple {37712#false} assume !(~i~2 < 9999); {37712#false} is VALID [2018-11-23 12:28:57,074 INFO L273 TraceCheckUtils]: 178: Hoare triple {37712#false} call write~int(~temp~0, ~#x~0.base, 39996 + ~#x~0.offset, 4); {37712#false} is VALID [2018-11-23 12:28:57,074 INFO L256 TraceCheckUtils]: 179: Hoare triple {37712#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {37711#true} is VALID [2018-11-23 12:28:57,075 INFO L273 TraceCheckUtils]: 180: Hoare triple {37711#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {37711#true} is VALID [2018-11-23 12:28:57,075 INFO L273 TraceCheckUtils]: 181: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,075 INFO L273 TraceCheckUtils]: 182: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,075 INFO L273 TraceCheckUtils]: 183: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,075 INFO L273 TraceCheckUtils]: 184: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,075 INFO L273 TraceCheckUtils]: 185: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,075 INFO L273 TraceCheckUtils]: 186: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,075 INFO L273 TraceCheckUtils]: 187: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,075 INFO L273 TraceCheckUtils]: 188: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,076 INFO L273 TraceCheckUtils]: 189: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,076 INFO L273 TraceCheckUtils]: 190: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,076 INFO L273 TraceCheckUtils]: 191: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,076 INFO L273 TraceCheckUtils]: 192: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,076 INFO L273 TraceCheckUtils]: 193: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,076 INFO L273 TraceCheckUtils]: 194: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,076 INFO L273 TraceCheckUtils]: 195: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,076 INFO L273 TraceCheckUtils]: 196: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,076 INFO L273 TraceCheckUtils]: 197: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,076 INFO L273 TraceCheckUtils]: 198: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,077 INFO L273 TraceCheckUtils]: 199: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,077 INFO L273 TraceCheckUtils]: 200: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,077 INFO L273 TraceCheckUtils]: 201: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,077 INFO L273 TraceCheckUtils]: 202: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,077 INFO L273 TraceCheckUtils]: 203: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,077 INFO L273 TraceCheckUtils]: 204: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,077 INFO L273 TraceCheckUtils]: 205: Hoare triple {37711#true} assume !!(~i~0 < 10000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:57,077 INFO L273 TraceCheckUtils]: 206: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:57,077 INFO L273 TraceCheckUtils]: 207: Hoare triple {37711#true} assume !(~i~0 < 10000); {37711#true} is VALID [2018-11-23 12:28:57,077 INFO L273 TraceCheckUtils]: 208: Hoare triple {37711#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {37711#true} is VALID [2018-11-23 12:28:57,078 INFO L273 TraceCheckUtils]: 209: Hoare triple {37711#true} assume true; {37711#true} is VALID [2018-11-23 12:28:57,078 INFO L268 TraceCheckUtils]: 210: Hoare quadruple {37711#true} {37712#false} #74#return; {37712#false} is VALID [2018-11-23 12:28:57,078 INFO L273 TraceCheckUtils]: 211: Hoare triple {37712#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {37712#false} is VALID [2018-11-23 12:28:57,078 INFO L273 TraceCheckUtils]: 212: Hoare triple {37712#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {37712#false} is VALID [2018-11-23 12:28:57,078 INFO L273 TraceCheckUtils]: 213: Hoare triple {37712#false} assume !false; {37712#false} is VALID [2018-11-23 12:28:57,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3416 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2018-11-23 12:28:57,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:57,099 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:57,108 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1