java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-crafted/bAnd1_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:06:48,607 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:06:48,611 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:06:48,625 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:06:48,626 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:06:48,630 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:06:48,631 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:06:48,633 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:06:48,636 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:06:48,642 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:06:48,643 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:06:48,646 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:06:48,647 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:06:48,648 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:06:48,649 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:06:48,652 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:06:48,654 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:06:48,655 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:06:48,660 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:06:48,663 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:06:48,665 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:06:48,666 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:06:48,670 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:06:48,671 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:06:48,671 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:06:48,672 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:06:48,674 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:06:48,674 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:06:48,677 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:06:48,678 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:06:48,678 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:06:48,679 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:06:48,679 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:06:48,679 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:06:48,682 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:06:48,682 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:06:48,683 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:06:48,709 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:06:48,709 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:06:48,710 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:06:48,710 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:06:48,712 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:06:48,712 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:06:48,712 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:06:48,712 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:06:48,713 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:06:48,714 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:06:48,714 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:06:48,714 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:06:48,714 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:06:48,714 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:06:48,714 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:06:48,715 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:06:48,715 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:06:48,715 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:06:48,715 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:06:48,716 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:06:48,716 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:06:48,716 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:06:48,716 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:06:48,716 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:06:48,716 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:06:48,717 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:06:48,717 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:06:48,717 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:06:48,717 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:06:48,717 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:06:48,779 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:06:48,795 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:06:48,800 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:06:48,801 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:06:48,802 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:06:48,802 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/bAnd1_true-unreach-call.i [2018-11-14 17:06:48,866 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e82e8ada7/a271fb6ab3df4dc9b10010806a9e8be5/FLAGbd6946dfb [2018-11-14 17:06:49,283 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:06:49,283 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/bAnd1_true-unreach-call.i [2018-11-14 17:06:49,290 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e82e8ada7/a271fb6ab3df4dc9b10010806a9e8be5/FLAGbd6946dfb [2018-11-14 17:06:49,306 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e82e8ada7/a271fb6ab3df4dc9b10010806a9e8be5 [2018-11-14 17:06:49,317 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:06:49,319 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:06:49,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:06:49,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:06:49,324 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:06:49,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:06:49" (1/1) ... [2018-11-14 17:06:49,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3268ea2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:49, skipping insertion in model container [2018-11-14 17:06:49,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:06:49" (1/1) ... [2018-11-14 17:06:49,339 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:06:49,361 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:06:49,587 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:06:49,599 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:06:49,641 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:06:49,662 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:06:49,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:49 WrapperNode [2018-11-14 17:06:49,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:06:49,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:06:49,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:06:49,664 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:06:49,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:49" (1/1) ... [2018-11-14 17:06:49,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:49" (1/1) ... [2018-11-14 17:06:49,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:49" (1/1) ... [2018-11-14 17:06:49,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:49" (1/1) ... [2018-11-14 17:06:49,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:49" (1/1) ... [2018-11-14 17:06:49,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:49" (1/1) ... [2018-11-14 17:06:49,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:49" (1/1) ... [2018-11-14 17:06:49,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:06:49,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:06:49,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:06:49,735 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:06:49,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:06:49,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:06:49,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:06:49,867 INFO L138 BoogieDeclarations]: Found implementation of procedure bAnd [2018-11-14 17:06:49,867 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:06:49,867 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:06:49,867 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:06:49,867 INFO L130 BoogieDeclarations]: Found specification of procedure bAnd [2018-11-14 17:06:49,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:06:49,868 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:06:49,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:06:49,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:06:49,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:06:49,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:06:49,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:06:49,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:06:50,592 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:06:50,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:06:50 BoogieIcfgContainer [2018-11-14 17:06:50,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:06:50,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:06:50,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:06:50,597 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:06:50,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:06:49" (1/3) ... [2018-11-14 17:06:50,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4778396d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:06:50, skipping insertion in model container [2018-11-14 17:06:50,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:06:49" (2/3) ... [2018-11-14 17:06:50,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4778396d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:06:50, skipping insertion in model container [2018-11-14 17:06:50,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:06:50" (3/3) ... [2018-11-14 17:06:50,601 INFO L112 eAbstractionObserver]: Analyzing ICFG bAnd1_true-unreach-call.i [2018-11-14 17:06:50,609 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:06:50,616 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:06:50,632 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:06:50,665 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:06:50,666 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:06:50,666 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:06:50,666 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:06:50,666 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:06:50,667 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:06:50,667 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:06:50,667 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:06:50,667 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:06:50,686 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-14 17:06:50,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 17:06:50,693 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:06:50,695 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:06:50,697 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:06:50,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:06:50,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1401494287, now seen corresponding path program 1 times [2018-11-14 17:06:50,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:06:50,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:06:50,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:50,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:06:50,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:50,921 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-14 17:06:50,926 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37#true} is VALID [2018-11-14 17:06:50,927 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 17:06:50,928 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #69#return; {37#true} is VALID [2018-11-14 17:06:50,928 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret13 := main(); {37#true} is VALID [2018-11-14 17:06:50,928 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {37#true} is VALID [2018-11-14 17:06:50,946 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-14 17:06:50,946 INFO L256 TraceCheckUtils]: 7: Hoare triple {38#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {37#true} is VALID [2018-11-14 17:06:50,947 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {37#true} is VALID [2018-11-14 17:06:50,947 INFO L273 TraceCheckUtils]: 9: Hoare triple {37#true} assume !true; {37#true} is VALID [2018-11-14 17:06:50,948 INFO L273 TraceCheckUtils]: 10: Hoare triple {37#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {37#true} is VALID [2018-11-14 17:06:50,948 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 17:06:50,948 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {37#true} {38#false} #73#return; {38#false} is VALID [2018-11-14 17:06:50,949 INFO L273 TraceCheckUtils]: 13: Hoare triple {38#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {38#false} is VALID [2018-11-14 17:06:50,949 INFO L256 TraceCheckUtils]: 14: Hoare triple {38#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {37#true} is VALID [2018-11-14 17:06:50,950 INFO L273 TraceCheckUtils]: 15: Hoare triple {37#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {37#true} is VALID [2018-11-14 17:06:50,950 INFO L273 TraceCheckUtils]: 16: Hoare triple {37#true} assume !true; {37#true} is VALID [2018-11-14 17:06:50,950 INFO L273 TraceCheckUtils]: 17: Hoare triple {37#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {37#true} is VALID [2018-11-14 17:06:50,951 INFO L273 TraceCheckUtils]: 18: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 17:06:50,951 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {37#true} {38#false} #75#return; {38#false} is VALID [2018-11-14 17:06:50,951 INFO L273 TraceCheckUtils]: 20: Hoare triple {38#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {38#false} is VALID [2018-11-14 17:06:50,952 INFO L273 TraceCheckUtils]: 21: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-14 17:06:50,952 INFO L273 TraceCheckUtils]: 22: Hoare triple {38#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {38#false} is VALID [2018-11-14 17:06:50,952 INFO L256 TraceCheckUtils]: 23: Hoare triple {38#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {37#true} is VALID [2018-11-14 17:06:50,953 INFO L273 TraceCheckUtils]: 24: Hoare triple {37#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {37#true} is VALID [2018-11-14 17:06:50,953 INFO L273 TraceCheckUtils]: 25: Hoare triple {37#true} assume !true; {37#true} is VALID [2018-11-14 17:06:50,953 INFO L273 TraceCheckUtils]: 26: Hoare triple {37#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {37#true} is VALID [2018-11-14 17:06:50,954 INFO L273 TraceCheckUtils]: 27: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 17:06:50,954 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {37#true} {38#false} #77#return; {38#false} is VALID [2018-11-14 17:06:50,954 INFO L273 TraceCheckUtils]: 29: Hoare triple {38#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {38#false} is VALID [2018-11-14 17:06:50,955 INFO L273 TraceCheckUtils]: 30: Hoare triple {38#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {38#false} is VALID [2018-11-14 17:06:50,955 INFO L273 TraceCheckUtils]: 31: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-14 17:06:50,961 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-14 17:06:50,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:06:50,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:06:50,970 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 17:06:50,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:06:50,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:06:51,200 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:51,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:06:51,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:06:51,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:06:51,212 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-14 17:06:51,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:51,365 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2018-11-14 17:06:51,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:06:51,366 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 17:06:51,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:06:51,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:06:51,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-14 17:06:51,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:06:51,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-14 17:06:51,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 76 transitions. [2018-11-14 17:06:51,667 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:51,678 INFO L225 Difference]: With dead ends: 59 [2018-11-14 17:06:51,679 INFO L226 Difference]: Without dead ends: 29 [2018-11-14 17:06:51,683 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:06:51,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-14 17:06:51,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-14 17:06:51,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:06:51,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-14 17:06:51,727 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 17:06:51,727 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 17:06:51,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:51,734 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-14 17:06:51,734 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 17:06:51,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:51,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:51,737 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 17:06:51,737 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 17:06:51,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:51,742 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-14 17:06:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 17:06:51,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:51,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:51,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:06:51,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:06:51,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 17:06:51,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-14 17:06:51,750 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 32 [2018-11-14 17:06:51,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:06:51,750 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-14 17:06:51,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:06:51,751 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 17:06:51,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 17:06:51,753 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:06:51,753 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:06:51,753 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:06:51,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:06:51,754 INFO L82 PathProgramCache]: Analyzing trace with hash -741637549, now seen corresponding path program 1 times [2018-11-14 17:06:51,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:06:51,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:06:51,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:51,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:06:51,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:51,917 INFO L256 TraceCheckUtils]: 0: Hoare triple {215#true} call ULTIMATE.init(); {215#true} is VALID [2018-11-14 17:06:51,918 INFO L273 TraceCheckUtils]: 1: Hoare triple {215#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {215#true} is VALID [2018-11-14 17:06:51,918 INFO L273 TraceCheckUtils]: 2: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:06:51,918 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} #69#return; {215#true} is VALID [2018-11-14 17:06:51,922 INFO L256 TraceCheckUtils]: 4: Hoare triple {215#true} call #t~ret13 := main(); {215#true} is VALID [2018-11-14 17:06:51,933 INFO L273 TraceCheckUtils]: 5: Hoare triple {215#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {217#(= main_~i~1 0)} is VALID [2018-11-14 17:06:51,934 INFO L273 TraceCheckUtils]: 6: Hoare triple {217#(= main_~i~1 0)} assume true; {217#(= main_~i~1 0)} is VALID [2018-11-14 17:06:51,935 INFO L273 TraceCheckUtils]: 7: Hoare triple {217#(= main_~i~1 0)} assume !(~i~1 < 100); {216#false} is VALID [2018-11-14 17:06:51,935 INFO L256 TraceCheckUtils]: 8: Hoare triple {216#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {215#true} is VALID [2018-11-14 17:06:51,935 INFO L273 TraceCheckUtils]: 9: Hoare triple {215#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {215#true} is VALID [2018-11-14 17:06:51,936 INFO L273 TraceCheckUtils]: 10: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:06:51,936 INFO L273 TraceCheckUtils]: 11: Hoare triple {215#true} assume !(~i~0 < 100); {215#true} is VALID [2018-11-14 17:06:51,936 INFO L273 TraceCheckUtils]: 12: Hoare triple {215#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {215#true} is VALID [2018-11-14 17:06:51,936 INFO L273 TraceCheckUtils]: 13: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:06:51,937 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {215#true} {216#false} #73#return; {216#false} is VALID [2018-11-14 17:06:51,937 INFO L273 TraceCheckUtils]: 15: Hoare triple {216#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {216#false} is VALID [2018-11-14 17:06:51,937 INFO L256 TraceCheckUtils]: 16: Hoare triple {216#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {215#true} is VALID [2018-11-14 17:06:51,937 INFO L273 TraceCheckUtils]: 17: Hoare triple {215#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {215#true} is VALID [2018-11-14 17:06:51,938 INFO L273 TraceCheckUtils]: 18: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:06:51,938 INFO L273 TraceCheckUtils]: 19: Hoare triple {215#true} assume !(~i~0 < 100); {215#true} is VALID [2018-11-14 17:06:51,939 INFO L273 TraceCheckUtils]: 20: Hoare triple {215#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {215#true} is VALID [2018-11-14 17:06:51,939 INFO L273 TraceCheckUtils]: 21: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:06:51,940 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {215#true} {216#false} #75#return; {216#false} is VALID [2018-11-14 17:06:51,940 INFO L273 TraceCheckUtils]: 23: Hoare triple {216#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {216#false} is VALID [2018-11-14 17:06:51,941 INFO L273 TraceCheckUtils]: 24: Hoare triple {216#false} assume true; {216#false} is VALID [2018-11-14 17:06:51,941 INFO L273 TraceCheckUtils]: 25: Hoare triple {216#false} assume !(~i~2 < 99); {216#false} is VALID [2018-11-14 17:06:51,941 INFO L273 TraceCheckUtils]: 26: Hoare triple {216#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {216#false} is VALID [2018-11-14 17:06:51,942 INFO L256 TraceCheckUtils]: 27: Hoare triple {216#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {215#true} is VALID [2018-11-14 17:06:51,942 INFO L273 TraceCheckUtils]: 28: Hoare triple {215#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {215#true} is VALID [2018-11-14 17:06:51,942 INFO L273 TraceCheckUtils]: 29: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:06:51,943 INFO L273 TraceCheckUtils]: 30: Hoare triple {215#true} assume !(~i~0 < 100); {215#true} is VALID [2018-11-14 17:06:51,943 INFO L273 TraceCheckUtils]: 31: Hoare triple {215#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {215#true} is VALID [2018-11-14 17:06:51,943 INFO L273 TraceCheckUtils]: 32: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:06:51,944 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {215#true} {216#false} #77#return; {216#false} is VALID [2018-11-14 17:06:51,944 INFO L273 TraceCheckUtils]: 34: Hoare triple {216#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {216#false} is VALID [2018-11-14 17:06:51,944 INFO L273 TraceCheckUtils]: 35: Hoare triple {216#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {216#false} is VALID [2018-11-14 17:06:51,945 INFO L273 TraceCheckUtils]: 36: Hoare triple {216#false} assume !false; {216#false} is VALID [2018-11-14 17:06:51,948 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 17:06:51,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:06:51,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:06:51,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-14 17:06:51,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:06:51,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:06:52,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:52,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:06:52,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:06:52,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:06:52,161 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2018-11-14 17:06:52,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:52,525 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-14 17:06:52,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:06:52,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-14 17:06:52,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:06:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:06:52,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-14 17:06:52,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:06:52,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-14 17:06:52,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2018-11-14 17:06:52,758 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:52,764 INFO L225 Difference]: With dead ends: 52 [2018-11-14 17:06:52,764 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 17:06:52,766 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:06:52,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 17:06:52,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-14 17:06:52,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:06:52,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-14 17:06:52,787 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-14 17:06:52,787 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-14 17:06:52,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:52,791 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-14 17:06:52,791 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 17:06:52,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:52,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:52,793 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-14 17:06:52,793 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-14 17:06:52,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:52,796 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-14 17:06:52,796 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 17:06:52,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:52,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:52,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:06:52,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:06:52,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:06:52,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-14 17:06:52,801 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 37 [2018-11-14 17:06:52,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:06:52,801 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-14 17:06:52,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:06:52,801 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-14 17:06:52,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 17:06:52,803 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:06:52,803 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:06:52,803 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:06:52,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:06:52,804 INFO L82 PathProgramCache]: Analyzing trace with hash 989317657, now seen corresponding path program 1 times [2018-11-14 17:06:52,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:06:52,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:06:52,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:52,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:06:52,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:52,884 INFO L256 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2018-11-14 17:06:52,885 INFO L273 TraceCheckUtils]: 1: Hoare triple {397#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {397#true} is VALID [2018-11-14 17:06:52,885 INFO L273 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:06:52,886 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #69#return; {397#true} is VALID [2018-11-14 17:06:52,886 INFO L256 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret13 := main(); {397#true} is VALID [2018-11-14 17:06:52,886 INFO L273 TraceCheckUtils]: 5: Hoare triple {397#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {397#true} is VALID [2018-11-14 17:06:52,887 INFO L273 TraceCheckUtils]: 6: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:06:52,887 INFO L273 TraceCheckUtils]: 7: Hoare triple {397#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {397#true} is VALID [2018-11-14 17:06:52,887 INFO L273 TraceCheckUtils]: 8: Hoare triple {397#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {397#true} is VALID [2018-11-14 17:06:52,888 INFO L273 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:06:52,888 INFO L273 TraceCheckUtils]: 10: Hoare triple {397#true} assume !(~i~1 < 100); {397#true} is VALID [2018-11-14 17:06:52,888 INFO L256 TraceCheckUtils]: 11: Hoare triple {397#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {397#true} is VALID [2018-11-14 17:06:52,889 INFO L273 TraceCheckUtils]: 12: Hoare triple {397#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {399#(= bAnd_~i~0 1)} is VALID [2018-11-14 17:06:52,890 INFO L273 TraceCheckUtils]: 13: Hoare triple {399#(= bAnd_~i~0 1)} assume true; {399#(= bAnd_~i~0 1)} is VALID [2018-11-14 17:06:52,892 INFO L273 TraceCheckUtils]: 14: Hoare triple {399#(= bAnd_~i~0 1)} assume !(~i~0 < 100); {398#false} is VALID [2018-11-14 17:06:52,892 INFO L273 TraceCheckUtils]: 15: Hoare triple {398#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {398#false} is VALID [2018-11-14 17:06:52,892 INFO L273 TraceCheckUtils]: 16: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:06:52,893 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {398#false} {397#true} #73#return; {398#false} is VALID [2018-11-14 17:06:52,893 INFO L273 TraceCheckUtils]: 18: Hoare triple {398#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {398#false} is VALID [2018-11-14 17:06:52,893 INFO L256 TraceCheckUtils]: 19: Hoare triple {398#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {397#true} is VALID [2018-11-14 17:06:52,894 INFO L273 TraceCheckUtils]: 20: Hoare triple {397#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {397#true} is VALID [2018-11-14 17:06:52,894 INFO L273 TraceCheckUtils]: 21: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:06:52,895 INFO L273 TraceCheckUtils]: 22: Hoare triple {397#true} assume !(~i~0 < 100); {397#true} is VALID [2018-11-14 17:06:52,895 INFO L273 TraceCheckUtils]: 23: Hoare triple {397#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {397#true} is VALID [2018-11-14 17:06:52,895 INFO L273 TraceCheckUtils]: 24: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:06:52,896 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {397#true} {398#false} #75#return; {398#false} is VALID [2018-11-14 17:06:52,896 INFO L273 TraceCheckUtils]: 26: Hoare triple {398#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {398#false} is VALID [2018-11-14 17:06:52,896 INFO L273 TraceCheckUtils]: 27: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:06:52,896 INFO L273 TraceCheckUtils]: 28: Hoare triple {398#false} assume !(~i~2 < 99); {398#false} is VALID [2018-11-14 17:06:52,897 INFO L273 TraceCheckUtils]: 29: Hoare triple {398#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {398#false} is VALID [2018-11-14 17:06:52,897 INFO L256 TraceCheckUtils]: 30: Hoare triple {398#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {397#true} is VALID [2018-11-14 17:06:52,897 INFO L273 TraceCheckUtils]: 31: Hoare triple {397#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {397#true} is VALID [2018-11-14 17:06:52,898 INFO L273 TraceCheckUtils]: 32: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:06:52,898 INFO L273 TraceCheckUtils]: 33: Hoare triple {397#true} assume !(~i~0 < 100); {397#true} is VALID [2018-11-14 17:06:52,898 INFO L273 TraceCheckUtils]: 34: Hoare triple {397#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {397#true} is VALID [2018-11-14 17:06:52,899 INFO L273 TraceCheckUtils]: 35: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:06:52,899 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {397#true} {398#false} #77#return; {398#false} is VALID [2018-11-14 17:06:52,899 INFO L273 TraceCheckUtils]: 37: Hoare triple {398#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {398#false} is VALID [2018-11-14 17:06:52,900 INFO L273 TraceCheckUtils]: 38: Hoare triple {398#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {398#false} is VALID [2018-11-14 17:06:52,900 INFO L273 TraceCheckUtils]: 39: Hoare triple {398#false} assume !false; {398#false} is VALID [2018-11-14 17:06:52,903 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-14 17:06:52,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:06:52,903 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:06:52,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:06:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:52,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:52,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:06:53,132 INFO L256 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2018-11-14 17:06:53,133 INFO L273 TraceCheckUtils]: 1: Hoare triple {397#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {397#true} is VALID [2018-11-14 17:06:53,133 INFO L273 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:06:53,133 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #69#return; {397#true} is VALID [2018-11-14 17:06:53,134 INFO L256 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret13 := main(); {397#true} is VALID [2018-11-14 17:06:53,134 INFO L273 TraceCheckUtils]: 5: Hoare triple {397#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {397#true} is VALID [2018-11-14 17:06:53,134 INFO L273 TraceCheckUtils]: 6: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:06:53,135 INFO L273 TraceCheckUtils]: 7: Hoare triple {397#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {397#true} is VALID [2018-11-14 17:06:53,135 INFO L273 TraceCheckUtils]: 8: Hoare triple {397#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {397#true} is VALID [2018-11-14 17:06:53,135 INFO L273 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:06:53,136 INFO L273 TraceCheckUtils]: 10: Hoare triple {397#true} assume !(~i~1 < 100); {397#true} is VALID [2018-11-14 17:06:53,136 INFO L256 TraceCheckUtils]: 11: Hoare triple {397#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {397#true} is VALID [2018-11-14 17:06:53,151 INFO L273 TraceCheckUtils]: 12: Hoare triple {397#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {439#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:06:53,152 INFO L273 TraceCheckUtils]: 13: Hoare triple {439#(<= bAnd_~i~0 1)} assume true; {439#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:06:53,153 INFO L273 TraceCheckUtils]: 14: Hoare triple {439#(<= bAnd_~i~0 1)} assume !(~i~0 < 100); {398#false} is VALID [2018-11-14 17:06:53,153 INFO L273 TraceCheckUtils]: 15: Hoare triple {398#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {398#false} is VALID [2018-11-14 17:06:53,154 INFO L273 TraceCheckUtils]: 16: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:06:53,154 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {398#false} {397#true} #73#return; {398#false} is VALID [2018-11-14 17:06:53,154 INFO L273 TraceCheckUtils]: 18: Hoare triple {398#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {398#false} is VALID [2018-11-14 17:06:53,155 INFO L256 TraceCheckUtils]: 19: Hoare triple {398#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {398#false} is VALID [2018-11-14 17:06:53,155 INFO L273 TraceCheckUtils]: 20: Hoare triple {398#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {398#false} is VALID [2018-11-14 17:06:53,155 INFO L273 TraceCheckUtils]: 21: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:06:53,156 INFO L273 TraceCheckUtils]: 22: Hoare triple {398#false} assume !(~i~0 < 100); {398#false} is VALID [2018-11-14 17:06:53,156 INFO L273 TraceCheckUtils]: 23: Hoare triple {398#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {398#false} is VALID [2018-11-14 17:06:53,156 INFO L273 TraceCheckUtils]: 24: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:06:53,156 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {398#false} {398#false} #75#return; {398#false} is VALID [2018-11-14 17:06:53,157 INFO L273 TraceCheckUtils]: 26: Hoare triple {398#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {398#false} is VALID [2018-11-14 17:06:53,157 INFO L273 TraceCheckUtils]: 27: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:06:53,157 INFO L273 TraceCheckUtils]: 28: Hoare triple {398#false} assume !(~i~2 < 99); {398#false} is VALID [2018-11-14 17:06:53,158 INFO L273 TraceCheckUtils]: 29: Hoare triple {398#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {398#false} is VALID [2018-11-14 17:06:53,158 INFO L256 TraceCheckUtils]: 30: Hoare triple {398#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {398#false} is VALID [2018-11-14 17:06:53,158 INFO L273 TraceCheckUtils]: 31: Hoare triple {398#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {398#false} is VALID [2018-11-14 17:06:53,158 INFO L273 TraceCheckUtils]: 32: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:06:53,159 INFO L273 TraceCheckUtils]: 33: Hoare triple {398#false} assume !(~i~0 < 100); {398#false} is VALID [2018-11-14 17:06:53,159 INFO L273 TraceCheckUtils]: 34: Hoare triple {398#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {398#false} is VALID [2018-11-14 17:06:53,159 INFO L273 TraceCheckUtils]: 35: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:06:53,160 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {398#false} {398#false} #77#return; {398#false} is VALID [2018-11-14 17:06:53,160 INFO L273 TraceCheckUtils]: 37: Hoare triple {398#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {398#false} is VALID [2018-11-14 17:06:53,160 INFO L273 TraceCheckUtils]: 38: Hoare triple {398#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {398#false} is VALID [2018-11-14 17:06:53,160 INFO L273 TraceCheckUtils]: 39: Hoare triple {398#false} assume !false; {398#false} is VALID [2018-11-14 17:06:53,163 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-14 17:06:53,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:06:53,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-14 17:06:53,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-14 17:06:53,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:06:53,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:06:53,365 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:53,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:06:53,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:06:53,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:06:53,366 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2018-11-14 17:06:53,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:53,678 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-11-14 17:06:53,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:06:53,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-14 17:06:53,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:06:53,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:06:53,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 17:06:53,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:06:53,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 17:06:53,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2018-11-14 17:06:53,808 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:53,811 INFO L225 Difference]: With dead ends: 53 [2018-11-14 17:06:53,811 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 17:06:53,812 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:06:53,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 17:06:53,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-14 17:06:53,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:06:53,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-14 17:06:53,831 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-14 17:06:53,832 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-14 17:06:53,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:53,835 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-14 17:06:53,835 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 17:06:53,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:53,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:53,836 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-14 17:06:53,836 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-14 17:06:53,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:53,839 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-14 17:06:53,839 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 17:06:53,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:53,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:53,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:06:53,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:06:53,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 17:06:53,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-14 17:06:53,844 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 40 [2018-11-14 17:06:53,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:06:53,844 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-14 17:06:53,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:06:53,845 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-14 17:06:53,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 17:06:53,846 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:06:53,847 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:06:53,847 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:06:53,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:06:53,847 INFO L82 PathProgramCache]: Analyzing trace with hash 841579359, now seen corresponding path program 1 times [2018-11-14 17:06:53,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:06:53,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:06:53,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:53,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:06:53,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:53,947 INFO L256 TraceCheckUtils]: 0: Hoare triple {705#true} call ULTIMATE.init(); {705#true} is VALID [2018-11-14 17:06:53,947 INFO L273 TraceCheckUtils]: 1: Hoare triple {705#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {705#true} is VALID [2018-11-14 17:06:53,948 INFO L273 TraceCheckUtils]: 2: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:06:53,948 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {705#true} {705#true} #69#return; {705#true} is VALID [2018-11-14 17:06:53,949 INFO L256 TraceCheckUtils]: 4: Hoare triple {705#true} call #t~ret13 := main(); {705#true} is VALID [2018-11-14 17:06:53,949 INFO L273 TraceCheckUtils]: 5: Hoare triple {705#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {705#true} is VALID [2018-11-14 17:06:53,949 INFO L273 TraceCheckUtils]: 6: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:06:53,950 INFO L273 TraceCheckUtils]: 7: Hoare triple {705#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {705#true} is VALID [2018-11-14 17:06:53,950 INFO L273 TraceCheckUtils]: 8: Hoare triple {705#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {705#true} is VALID [2018-11-14 17:06:53,950 INFO L273 TraceCheckUtils]: 9: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:06:53,950 INFO L273 TraceCheckUtils]: 10: Hoare triple {705#true} assume !(~i~1 < 100); {705#true} is VALID [2018-11-14 17:06:53,951 INFO L256 TraceCheckUtils]: 11: Hoare triple {705#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {705#true} is VALID [2018-11-14 17:06:53,951 INFO L273 TraceCheckUtils]: 12: Hoare triple {705#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {705#true} is VALID [2018-11-14 17:06:53,951 INFO L273 TraceCheckUtils]: 13: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:06:53,952 INFO L273 TraceCheckUtils]: 14: Hoare triple {705#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {705#true} is VALID [2018-11-14 17:06:53,952 INFO L273 TraceCheckUtils]: 15: Hoare triple {705#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {705#true} is VALID [2018-11-14 17:06:53,952 INFO L273 TraceCheckUtils]: 16: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:06:53,952 INFO L273 TraceCheckUtils]: 17: Hoare triple {705#true} assume !(~i~0 < 100); {705#true} is VALID [2018-11-14 17:06:53,953 INFO L273 TraceCheckUtils]: 18: Hoare triple {705#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {705#true} is VALID [2018-11-14 17:06:53,953 INFO L273 TraceCheckUtils]: 19: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:06:53,953 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {705#true} {705#true} #73#return; {705#true} is VALID [2018-11-14 17:06:53,954 INFO L273 TraceCheckUtils]: 21: Hoare triple {705#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {705#true} is VALID [2018-11-14 17:06:53,954 INFO L256 TraceCheckUtils]: 22: Hoare triple {705#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {705#true} is VALID [2018-11-14 17:06:53,954 INFO L273 TraceCheckUtils]: 23: Hoare triple {705#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {705#true} is VALID [2018-11-14 17:06:53,954 INFO L273 TraceCheckUtils]: 24: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:06:53,955 INFO L273 TraceCheckUtils]: 25: Hoare triple {705#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {705#true} is VALID [2018-11-14 17:06:53,955 INFO L273 TraceCheckUtils]: 26: Hoare triple {705#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {705#true} is VALID [2018-11-14 17:06:53,955 INFO L273 TraceCheckUtils]: 27: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:06:53,956 INFO L273 TraceCheckUtils]: 28: Hoare triple {705#true} assume !(~i~0 < 100); {705#true} is VALID [2018-11-14 17:06:53,956 INFO L273 TraceCheckUtils]: 29: Hoare triple {705#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {705#true} is VALID [2018-11-14 17:06:53,956 INFO L273 TraceCheckUtils]: 30: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:06:53,956 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {705#true} {705#true} #75#return; {705#true} is VALID [2018-11-14 17:06:53,958 INFO L273 TraceCheckUtils]: 32: Hoare triple {705#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {707#(= main_~i~2 0)} is VALID [2018-11-14 17:06:53,958 INFO L273 TraceCheckUtils]: 33: Hoare triple {707#(= main_~i~2 0)} assume true; {707#(= main_~i~2 0)} is VALID [2018-11-14 17:06:53,970 INFO L273 TraceCheckUtils]: 34: Hoare triple {707#(= main_~i~2 0)} assume !(~i~2 < 99); {706#false} is VALID [2018-11-14 17:06:53,971 INFO L273 TraceCheckUtils]: 35: Hoare triple {706#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {706#false} is VALID [2018-11-14 17:06:53,971 INFO L256 TraceCheckUtils]: 36: Hoare triple {706#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {705#true} is VALID [2018-11-14 17:06:53,971 INFO L273 TraceCheckUtils]: 37: Hoare triple {705#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {705#true} is VALID [2018-11-14 17:06:53,971 INFO L273 TraceCheckUtils]: 38: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:06:53,972 INFO L273 TraceCheckUtils]: 39: Hoare triple {705#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {705#true} is VALID [2018-11-14 17:06:53,972 INFO L273 TraceCheckUtils]: 40: Hoare triple {705#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {705#true} is VALID [2018-11-14 17:06:53,972 INFO L273 TraceCheckUtils]: 41: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:06:53,973 INFO L273 TraceCheckUtils]: 42: Hoare triple {705#true} assume !(~i~0 < 100); {705#true} is VALID [2018-11-14 17:06:53,973 INFO L273 TraceCheckUtils]: 43: Hoare triple {705#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {705#true} is VALID [2018-11-14 17:06:53,973 INFO L273 TraceCheckUtils]: 44: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:06:53,973 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {705#true} {706#false} #77#return; {706#false} is VALID [2018-11-14 17:06:53,974 INFO L273 TraceCheckUtils]: 46: Hoare triple {706#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {706#false} is VALID [2018-11-14 17:06:53,974 INFO L273 TraceCheckUtils]: 47: Hoare triple {706#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {706#false} is VALID [2018-11-14 17:06:53,974 INFO L273 TraceCheckUtils]: 48: Hoare triple {706#false} assume !false; {706#false} is VALID [2018-11-14 17:06:53,978 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 17:06:53,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:06:53,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:06:53,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-14 17:06:53,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:06:53,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:06:54,048 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:54,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:06:54,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:06:54,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:06:54,050 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-11-14 17:06:54,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:54,162 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-14 17:06:54,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:06:54,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-14 17:06:54,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:06:54,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:06:54,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-14 17:06:54,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:06:54,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-14 17:06:54,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2018-11-14 17:06:54,275 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:54,277 INFO L225 Difference]: With dead ends: 51 [2018-11-14 17:06:54,277 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 17:06:54,278 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:06:54,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 17:06:54,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-14 17:06:54,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:06:54,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2018-11-14 17:06:54,294 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2018-11-14 17:06:54,295 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2018-11-14 17:06:54,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:54,297 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-14 17:06:54,298 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-14 17:06:54,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:54,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:54,299 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2018-11-14 17:06:54,299 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2018-11-14 17:06:54,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:54,308 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-14 17:06:54,309 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-14 17:06:54,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:54,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:54,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:06:54,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:06:54,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:06:54,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-14 17:06:54,313 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 49 [2018-11-14 17:06:54,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:06:54,313 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-14 17:06:54,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:06:54,314 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-14 17:06:54,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-14 17:06:54,315 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:06:54,316 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:06:54,316 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:06:54,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:06:54,316 INFO L82 PathProgramCache]: Analyzing trace with hash 611709709, now seen corresponding path program 1 times [2018-11-14 17:06:54,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:06:54,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:06:54,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:54,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:06:54,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:54,441 INFO L256 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2018-11-14 17:06:54,441 INFO L273 TraceCheckUtils]: 1: Hoare triple {900#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {900#true} is VALID [2018-11-14 17:06:54,442 INFO L273 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:06:54,442 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #69#return; {900#true} is VALID [2018-11-14 17:06:54,443 INFO L256 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret13 := main(); {900#true} is VALID [2018-11-14 17:06:54,449 INFO L273 TraceCheckUtils]: 5: Hoare triple {900#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {902#(= main_~i~1 0)} is VALID [2018-11-14 17:06:54,449 INFO L273 TraceCheckUtils]: 6: Hoare triple {902#(= main_~i~1 0)} assume true; {902#(= main_~i~1 0)} is VALID [2018-11-14 17:06:54,451 INFO L273 TraceCheckUtils]: 7: Hoare triple {902#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {902#(= main_~i~1 0)} is VALID [2018-11-14 17:06:54,451 INFO L273 TraceCheckUtils]: 8: Hoare triple {902#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {903#(<= main_~i~1 1)} is VALID [2018-11-14 17:06:54,453 INFO L273 TraceCheckUtils]: 9: Hoare triple {903#(<= main_~i~1 1)} assume true; {903#(<= main_~i~1 1)} is VALID [2018-11-14 17:06:54,453 INFO L273 TraceCheckUtils]: 10: Hoare triple {903#(<= main_~i~1 1)} assume !(~i~1 < 100); {901#false} is VALID [2018-11-14 17:06:54,454 INFO L256 TraceCheckUtils]: 11: Hoare triple {901#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {900#true} is VALID [2018-11-14 17:06:54,454 INFO L273 TraceCheckUtils]: 12: Hoare triple {900#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {900#true} is VALID [2018-11-14 17:06:54,454 INFO L273 TraceCheckUtils]: 13: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:06:54,455 INFO L273 TraceCheckUtils]: 14: Hoare triple {900#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {900#true} is VALID [2018-11-14 17:06:54,455 INFO L273 TraceCheckUtils]: 15: Hoare triple {900#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {900#true} is VALID [2018-11-14 17:06:54,456 INFO L273 TraceCheckUtils]: 16: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:06:54,456 INFO L273 TraceCheckUtils]: 17: Hoare triple {900#true} assume !(~i~0 < 100); {900#true} is VALID [2018-11-14 17:06:54,457 INFO L273 TraceCheckUtils]: 18: Hoare triple {900#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {900#true} is VALID [2018-11-14 17:06:54,457 INFO L273 TraceCheckUtils]: 19: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:06:54,457 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {900#true} {901#false} #73#return; {901#false} is VALID [2018-11-14 17:06:54,458 INFO L273 TraceCheckUtils]: 21: Hoare triple {901#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {901#false} is VALID [2018-11-14 17:06:54,458 INFO L256 TraceCheckUtils]: 22: Hoare triple {901#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {900#true} is VALID [2018-11-14 17:06:54,458 INFO L273 TraceCheckUtils]: 23: Hoare triple {900#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {900#true} is VALID [2018-11-14 17:06:54,458 INFO L273 TraceCheckUtils]: 24: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:06:54,459 INFO L273 TraceCheckUtils]: 25: Hoare triple {900#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {900#true} is VALID [2018-11-14 17:06:54,459 INFO L273 TraceCheckUtils]: 26: Hoare triple {900#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {900#true} is VALID [2018-11-14 17:06:54,459 INFO L273 TraceCheckUtils]: 27: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:06:54,459 INFO L273 TraceCheckUtils]: 28: Hoare triple {900#true} assume !(~i~0 < 100); {900#true} is VALID [2018-11-14 17:06:54,460 INFO L273 TraceCheckUtils]: 29: Hoare triple {900#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {900#true} is VALID [2018-11-14 17:06:54,460 INFO L273 TraceCheckUtils]: 30: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:06:54,460 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {900#true} {901#false} #75#return; {901#false} is VALID [2018-11-14 17:06:54,461 INFO L273 TraceCheckUtils]: 32: Hoare triple {901#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {901#false} is VALID [2018-11-14 17:06:54,461 INFO L273 TraceCheckUtils]: 33: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:06:54,461 INFO L273 TraceCheckUtils]: 34: Hoare triple {901#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {901#false} is VALID [2018-11-14 17:06:54,461 INFO L273 TraceCheckUtils]: 35: Hoare triple {901#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {901#false} is VALID [2018-11-14 17:06:54,462 INFO L273 TraceCheckUtils]: 36: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:06:54,462 INFO L273 TraceCheckUtils]: 37: Hoare triple {901#false} assume !(~i~2 < 99); {901#false} is VALID [2018-11-14 17:06:54,462 INFO L273 TraceCheckUtils]: 38: Hoare triple {901#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {901#false} is VALID [2018-11-14 17:06:54,463 INFO L256 TraceCheckUtils]: 39: Hoare triple {901#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {900#true} is VALID [2018-11-14 17:06:54,463 INFO L273 TraceCheckUtils]: 40: Hoare triple {900#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {900#true} is VALID [2018-11-14 17:06:54,463 INFO L273 TraceCheckUtils]: 41: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:06:54,464 INFO L273 TraceCheckUtils]: 42: Hoare triple {900#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {900#true} is VALID [2018-11-14 17:06:54,464 INFO L273 TraceCheckUtils]: 43: Hoare triple {900#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {900#true} is VALID [2018-11-14 17:06:54,464 INFO L273 TraceCheckUtils]: 44: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:06:54,465 INFO L273 TraceCheckUtils]: 45: Hoare triple {900#true} assume !(~i~0 < 100); {900#true} is VALID [2018-11-14 17:06:54,465 INFO L273 TraceCheckUtils]: 46: Hoare triple {900#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {900#true} is VALID [2018-11-14 17:06:54,465 INFO L273 TraceCheckUtils]: 47: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:06:54,466 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {900#true} {901#false} #77#return; {901#false} is VALID [2018-11-14 17:06:54,466 INFO L273 TraceCheckUtils]: 49: Hoare triple {901#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {901#false} is VALID [2018-11-14 17:06:54,466 INFO L273 TraceCheckUtils]: 50: Hoare triple {901#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {901#false} is VALID [2018-11-14 17:06:54,467 INFO L273 TraceCheckUtils]: 51: Hoare triple {901#false} assume !false; {901#false} is VALID [2018-11-14 17:06:54,472 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 17:06:54,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:06:54,473 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:06:54,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:06:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:54,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:06:54,840 INFO L256 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2018-11-14 17:06:54,840 INFO L273 TraceCheckUtils]: 1: Hoare triple {900#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {900#true} is VALID [2018-11-14 17:06:54,841 INFO L273 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:06:54,841 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #69#return; {900#true} is VALID [2018-11-14 17:06:54,842 INFO L256 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret13 := main(); {900#true} is VALID [2018-11-14 17:06:54,847 INFO L273 TraceCheckUtils]: 5: Hoare triple {900#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {922#(<= main_~i~1 0)} is VALID [2018-11-14 17:06:54,849 INFO L273 TraceCheckUtils]: 6: Hoare triple {922#(<= main_~i~1 0)} assume true; {922#(<= main_~i~1 0)} is VALID [2018-11-14 17:06:54,849 INFO L273 TraceCheckUtils]: 7: Hoare triple {922#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {922#(<= main_~i~1 0)} is VALID [2018-11-14 17:06:54,850 INFO L273 TraceCheckUtils]: 8: Hoare triple {922#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {903#(<= main_~i~1 1)} is VALID [2018-11-14 17:06:54,850 INFO L273 TraceCheckUtils]: 9: Hoare triple {903#(<= main_~i~1 1)} assume true; {903#(<= main_~i~1 1)} is VALID [2018-11-14 17:06:54,851 INFO L273 TraceCheckUtils]: 10: Hoare triple {903#(<= main_~i~1 1)} assume !(~i~1 < 100); {901#false} is VALID [2018-11-14 17:06:54,851 INFO L256 TraceCheckUtils]: 11: Hoare triple {901#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {901#false} is VALID [2018-11-14 17:06:54,851 INFO L273 TraceCheckUtils]: 12: Hoare triple {901#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {901#false} is VALID [2018-11-14 17:06:54,852 INFO L273 TraceCheckUtils]: 13: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:06:54,852 INFO L273 TraceCheckUtils]: 14: Hoare triple {901#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {901#false} is VALID [2018-11-14 17:06:54,852 INFO L273 TraceCheckUtils]: 15: Hoare triple {901#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {901#false} is VALID [2018-11-14 17:06:54,852 INFO L273 TraceCheckUtils]: 16: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:06:54,852 INFO L273 TraceCheckUtils]: 17: Hoare triple {901#false} assume !(~i~0 < 100); {901#false} is VALID [2018-11-14 17:06:54,853 INFO L273 TraceCheckUtils]: 18: Hoare triple {901#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {901#false} is VALID [2018-11-14 17:06:54,853 INFO L273 TraceCheckUtils]: 19: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:06:54,853 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {901#false} {901#false} #73#return; {901#false} is VALID [2018-11-14 17:06:54,854 INFO L273 TraceCheckUtils]: 21: Hoare triple {901#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {901#false} is VALID [2018-11-14 17:06:54,854 INFO L256 TraceCheckUtils]: 22: Hoare triple {901#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {901#false} is VALID [2018-11-14 17:06:54,854 INFO L273 TraceCheckUtils]: 23: Hoare triple {901#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {901#false} is VALID [2018-11-14 17:06:54,854 INFO L273 TraceCheckUtils]: 24: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:06:54,855 INFO L273 TraceCheckUtils]: 25: Hoare triple {901#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {901#false} is VALID [2018-11-14 17:06:54,855 INFO L273 TraceCheckUtils]: 26: Hoare triple {901#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {901#false} is VALID [2018-11-14 17:06:54,855 INFO L273 TraceCheckUtils]: 27: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:06:54,855 INFO L273 TraceCheckUtils]: 28: Hoare triple {901#false} assume !(~i~0 < 100); {901#false} is VALID [2018-11-14 17:06:54,856 INFO L273 TraceCheckUtils]: 29: Hoare triple {901#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {901#false} is VALID [2018-11-14 17:06:54,856 INFO L273 TraceCheckUtils]: 30: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:06:54,856 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {901#false} {901#false} #75#return; {901#false} is VALID [2018-11-14 17:06:54,857 INFO L273 TraceCheckUtils]: 32: Hoare triple {901#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {901#false} is VALID [2018-11-14 17:06:54,857 INFO L273 TraceCheckUtils]: 33: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:06:54,857 INFO L273 TraceCheckUtils]: 34: Hoare triple {901#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {901#false} is VALID [2018-11-14 17:06:54,857 INFO L273 TraceCheckUtils]: 35: Hoare triple {901#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {901#false} is VALID [2018-11-14 17:06:54,858 INFO L273 TraceCheckUtils]: 36: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:06:54,858 INFO L273 TraceCheckUtils]: 37: Hoare triple {901#false} assume !(~i~2 < 99); {901#false} is VALID [2018-11-14 17:06:54,858 INFO L273 TraceCheckUtils]: 38: Hoare triple {901#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {901#false} is VALID [2018-11-14 17:06:54,858 INFO L256 TraceCheckUtils]: 39: Hoare triple {901#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {901#false} is VALID [2018-11-14 17:06:54,859 INFO L273 TraceCheckUtils]: 40: Hoare triple {901#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {901#false} is VALID [2018-11-14 17:06:54,859 INFO L273 TraceCheckUtils]: 41: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:06:54,859 INFO L273 TraceCheckUtils]: 42: Hoare triple {901#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {901#false} is VALID [2018-11-14 17:06:54,860 INFO L273 TraceCheckUtils]: 43: Hoare triple {901#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {901#false} is VALID [2018-11-14 17:06:54,860 INFO L273 TraceCheckUtils]: 44: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:06:54,860 INFO L273 TraceCheckUtils]: 45: Hoare triple {901#false} assume !(~i~0 < 100); {901#false} is VALID [2018-11-14 17:06:54,860 INFO L273 TraceCheckUtils]: 46: Hoare triple {901#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {901#false} is VALID [2018-11-14 17:06:54,861 INFO L273 TraceCheckUtils]: 47: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:06:54,861 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {901#false} {901#false} #77#return; {901#false} is VALID [2018-11-14 17:06:54,861 INFO L273 TraceCheckUtils]: 49: Hoare triple {901#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {901#false} is VALID [2018-11-14 17:06:54,861 INFO L273 TraceCheckUtils]: 50: Hoare triple {901#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {901#false} is VALID [2018-11-14 17:06:54,862 INFO L273 TraceCheckUtils]: 51: Hoare triple {901#false} assume !false; {901#false} is VALID [2018-11-14 17:06:54,865 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 17:06:54,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:06:54,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 17:06:54,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-14 17:06:54,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:06:54,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:06:54,987 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:54,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:06:54,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:06:54,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:06:54,988 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2018-11-14 17:06:55,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:55,126 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-11-14 17:06:55,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:06:55,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-14 17:06:55,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:06:55,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:06:55,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2018-11-14 17:06:55,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:06:55,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2018-11-14 17:06:55,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2018-11-14 17:06:55,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:55,249 INFO L225 Difference]: With dead ends: 63 [2018-11-14 17:06:55,250 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 17:06:55,251 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:06:55,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 17:06:55,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-14 17:06:55,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:06:55,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2018-11-14 17:06:55,283 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2018-11-14 17:06:55,283 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2018-11-14 17:06:55,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:55,286 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-14 17:06:55,286 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-14 17:06:55,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:55,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:55,287 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2018-11-14 17:06:55,287 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2018-11-14 17:06:55,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:55,289 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-14 17:06:55,290 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-14 17:06:55,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:55,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:55,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:06:55,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:06:55,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 17:06:55,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-14 17:06:55,293 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 52 [2018-11-14 17:06:55,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:06:55,294 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-14 17:06:55,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:06:55,294 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-14 17:06:55,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-14 17:06:55,295 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:06:55,295 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:06:55,296 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:06:55,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:06:55,296 INFO L82 PathProgramCache]: Analyzing trace with hash -349935993, now seen corresponding path program 2 times [2018-11-14 17:06:55,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:06:55,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:06:55,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:55,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:06:55,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:55,460 INFO L256 TraceCheckUtils]: 0: Hoare triple {1277#true} call ULTIMATE.init(); {1277#true} is VALID [2018-11-14 17:06:55,461 INFO L273 TraceCheckUtils]: 1: Hoare triple {1277#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1277#true} is VALID [2018-11-14 17:06:55,461 INFO L273 TraceCheckUtils]: 2: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:06:55,461 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1277#true} {1277#true} #69#return; {1277#true} is VALID [2018-11-14 17:06:55,462 INFO L256 TraceCheckUtils]: 4: Hoare triple {1277#true} call #t~ret13 := main(); {1277#true} is VALID [2018-11-14 17:06:55,462 INFO L273 TraceCheckUtils]: 5: Hoare triple {1277#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1279#(= main_~i~1 0)} is VALID [2018-11-14 17:06:55,463 INFO L273 TraceCheckUtils]: 6: Hoare triple {1279#(= main_~i~1 0)} assume true; {1279#(= main_~i~1 0)} is VALID [2018-11-14 17:06:55,464 INFO L273 TraceCheckUtils]: 7: Hoare triple {1279#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1279#(= main_~i~1 0)} is VALID [2018-11-14 17:06:55,464 INFO L273 TraceCheckUtils]: 8: Hoare triple {1279#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 17:06:55,465 INFO L273 TraceCheckUtils]: 9: Hoare triple {1280#(<= main_~i~1 1)} assume true; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 17:06:55,465 INFO L273 TraceCheckUtils]: 10: Hoare triple {1280#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 17:06:55,466 INFO L273 TraceCheckUtils]: 11: Hoare triple {1280#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1281#(<= main_~i~1 2)} is VALID [2018-11-14 17:06:55,467 INFO L273 TraceCheckUtils]: 12: Hoare triple {1281#(<= main_~i~1 2)} assume true; {1281#(<= main_~i~1 2)} is VALID [2018-11-14 17:06:55,468 INFO L273 TraceCheckUtils]: 13: Hoare triple {1281#(<= main_~i~1 2)} assume !(~i~1 < 100); {1278#false} is VALID [2018-11-14 17:06:55,468 INFO L256 TraceCheckUtils]: 14: Hoare triple {1278#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {1277#true} is VALID [2018-11-14 17:06:55,468 INFO L273 TraceCheckUtils]: 15: Hoare triple {1277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1277#true} is VALID [2018-11-14 17:06:55,469 INFO L273 TraceCheckUtils]: 16: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:06:55,469 INFO L273 TraceCheckUtils]: 17: Hoare triple {1277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1277#true} is VALID [2018-11-14 17:06:55,469 INFO L273 TraceCheckUtils]: 18: Hoare triple {1277#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1277#true} is VALID [2018-11-14 17:06:55,470 INFO L273 TraceCheckUtils]: 19: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:06:55,470 INFO L273 TraceCheckUtils]: 20: Hoare triple {1277#true} assume !(~i~0 < 100); {1277#true} is VALID [2018-11-14 17:06:55,470 INFO L273 TraceCheckUtils]: 21: Hoare triple {1277#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1277#true} is VALID [2018-11-14 17:06:55,471 INFO L273 TraceCheckUtils]: 22: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:06:55,471 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1277#true} {1278#false} #73#return; {1278#false} is VALID [2018-11-14 17:06:55,472 INFO L273 TraceCheckUtils]: 24: Hoare triple {1278#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {1278#false} is VALID [2018-11-14 17:06:55,472 INFO L256 TraceCheckUtils]: 25: Hoare triple {1278#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {1277#true} is VALID [2018-11-14 17:06:55,472 INFO L273 TraceCheckUtils]: 26: Hoare triple {1277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1277#true} is VALID [2018-11-14 17:06:55,472 INFO L273 TraceCheckUtils]: 27: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:06:55,473 INFO L273 TraceCheckUtils]: 28: Hoare triple {1277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1277#true} is VALID [2018-11-14 17:06:55,473 INFO L273 TraceCheckUtils]: 29: Hoare triple {1277#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1277#true} is VALID [2018-11-14 17:06:55,473 INFO L273 TraceCheckUtils]: 30: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:06:55,473 INFO L273 TraceCheckUtils]: 31: Hoare triple {1277#true} assume !(~i~0 < 100); {1277#true} is VALID [2018-11-14 17:06:55,473 INFO L273 TraceCheckUtils]: 32: Hoare triple {1277#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1277#true} is VALID [2018-11-14 17:06:55,474 INFO L273 TraceCheckUtils]: 33: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:06:55,474 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1277#true} {1278#false} #75#return; {1278#false} is VALID [2018-11-14 17:06:55,474 INFO L273 TraceCheckUtils]: 35: Hoare triple {1278#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1278#false} is VALID [2018-11-14 17:06:55,474 INFO L273 TraceCheckUtils]: 36: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:06:55,474 INFO L273 TraceCheckUtils]: 37: Hoare triple {1278#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {1278#false} is VALID [2018-11-14 17:06:55,474 INFO L273 TraceCheckUtils]: 38: Hoare triple {1278#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {1278#false} is VALID [2018-11-14 17:06:55,475 INFO L273 TraceCheckUtils]: 39: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:06:55,475 INFO L273 TraceCheckUtils]: 40: Hoare triple {1278#false} assume !(~i~2 < 99); {1278#false} is VALID [2018-11-14 17:06:55,475 INFO L273 TraceCheckUtils]: 41: Hoare triple {1278#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {1278#false} is VALID [2018-11-14 17:06:55,475 INFO L256 TraceCheckUtils]: 42: Hoare triple {1278#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {1277#true} is VALID [2018-11-14 17:06:55,476 INFO L273 TraceCheckUtils]: 43: Hoare triple {1277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1277#true} is VALID [2018-11-14 17:06:55,476 INFO L273 TraceCheckUtils]: 44: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:06:55,476 INFO L273 TraceCheckUtils]: 45: Hoare triple {1277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1277#true} is VALID [2018-11-14 17:06:55,476 INFO L273 TraceCheckUtils]: 46: Hoare triple {1277#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1277#true} is VALID [2018-11-14 17:06:55,476 INFO L273 TraceCheckUtils]: 47: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:06:55,477 INFO L273 TraceCheckUtils]: 48: Hoare triple {1277#true} assume !(~i~0 < 100); {1277#true} is VALID [2018-11-14 17:06:55,477 INFO L273 TraceCheckUtils]: 49: Hoare triple {1277#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1277#true} is VALID [2018-11-14 17:06:55,477 INFO L273 TraceCheckUtils]: 50: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:06:55,477 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {1277#true} {1278#false} #77#return; {1278#false} is VALID [2018-11-14 17:06:55,477 INFO L273 TraceCheckUtils]: 52: Hoare triple {1278#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1278#false} is VALID [2018-11-14 17:06:55,478 INFO L273 TraceCheckUtils]: 53: Hoare triple {1278#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1278#false} is VALID [2018-11-14 17:06:55,478 INFO L273 TraceCheckUtils]: 54: Hoare triple {1278#false} assume !false; {1278#false} is VALID [2018-11-14 17:06:55,481 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 17:06:55,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:06:55,482 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:06:55,491 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:06:55,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:06:55,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:06:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:55,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:06:55,724 INFO L256 TraceCheckUtils]: 0: Hoare triple {1277#true} call ULTIMATE.init(); {1277#true} is VALID [2018-11-14 17:06:55,724 INFO L273 TraceCheckUtils]: 1: Hoare triple {1277#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1277#true} is VALID [2018-11-14 17:06:55,725 INFO L273 TraceCheckUtils]: 2: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:06:55,725 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1277#true} {1277#true} #69#return; {1277#true} is VALID [2018-11-14 17:06:55,726 INFO L256 TraceCheckUtils]: 4: Hoare triple {1277#true} call #t~ret13 := main(); {1277#true} is VALID [2018-11-14 17:06:55,731 INFO L273 TraceCheckUtils]: 5: Hoare triple {1277#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1300#(<= main_~i~1 0)} is VALID [2018-11-14 17:06:55,732 INFO L273 TraceCheckUtils]: 6: Hoare triple {1300#(<= main_~i~1 0)} assume true; {1300#(<= main_~i~1 0)} is VALID [2018-11-14 17:06:55,732 INFO L273 TraceCheckUtils]: 7: Hoare triple {1300#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1300#(<= main_~i~1 0)} is VALID [2018-11-14 17:06:55,733 INFO L273 TraceCheckUtils]: 8: Hoare triple {1300#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 17:06:55,734 INFO L273 TraceCheckUtils]: 9: Hoare triple {1280#(<= main_~i~1 1)} assume true; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 17:06:55,734 INFO L273 TraceCheckUtils]: 10: Hoare triple {1280#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 17:06:55,735 INFO L273 TraceCheckUtils]: 11: Hoare triple {1280#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1281#(<= main_~i~1 2)} is VALID [2018-11-14 17:06:55,735 INFO L273 TraceCheckUtils]: 12: Hoare triple {1281#(<= main_~i~1 2)} assume true; {1281#(<= main_~i~1 2)} is VALID [2018-11-14 17:06:55,736 INFO L273 TraceCheckUtils]: 13: Hoare triple {1281#(<= main_~i~1 2)} assume !(~i~1 < 100); {1278#false} is VALID [2018-11-14 17:06:55,736 INFO L256 TraceCheckUtils]: 14: Hoare triple {1278#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {1278#false} is VALID [2018-11-14 17:06:55,736 INFO L273 TraceCheckUtils]: 15: Hoare triple {1278#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1278#false} is VALID [2018-11-14 17:06:55,737 INFO L273 TraceCheckUtils]: 16: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:06:55,737 INFO L273 TraceCheckUtils]: 17: Hoare triple {1278#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1278#false} is VALID [2018-11-14 17:06:55,737 INFO L273 TraceCheckUtils]: 18: Hoare triple {1278#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1278#false} is VALID [2018-11-14 17:06:55,738 INFO L273 TraceCheckUtils]: 19: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:06:55,738 INFO L273 TraceCheckUtils]: 20: Hoare triple {1278#false} assume !(~i~0 < 100); {1278#false} is VALID [2018-11-14 17:06:55,738 INFO L273 TraceCheckUtils]: 21: Hoare triple {1278#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1278#false} is VALID [2018-11-14 17:06:55,739 INFO L273 TraceCheckUtils]: 22: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:06:55,739 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1278#false} {1278#false} #73#return; {1278#false} is VALID [2018-11-14 17:06:55,739 INFO L273 TraceCheckUtils]: 24: Hoare triple {1278#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {1278#false} is VALID [2018-11-14 17:06:55,740 INFO L256 TraceCheckUtils]: 25: Hoare triple {1278#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {1278#false} is VALID [2018-11-14 17:06:55,740 INFO L273 TraceCheckUtils]: 26: Hoare triple {1278#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1278#false} is VALID [2018-11-14 17:06:55,740 INFO L273 TraceCheckUtils]: 27: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:06:55,741 INFO L273 TraceCheckUtils]: 28: Hoare triple {1278#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1278#false} is VALID [2018-11-14 17:06:55,741 INFO L273 TraceCheckUtils]: 29: Hoare triple {1278#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1278#false} is VALID [2018-11-14 17:06:55,741 INFO L273 TraceCheckUtils]: 30: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:06:55,741 INFO L273 TraceCheckUtils]: 31: Hoare triple {1278#false} assume !(~i~0 < 100); {1278#false} is VALID [2018-11-14 17:06:55,742 INFO L273 TraceCheckUtils]: 32: Hoare triple {1278#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1278#false} is VALID [2018-11-14 17:06:55,742 INFO L273 TraceCheckUtils]: 33: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:06:55,742 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1278#false} {1278#false} #75#return; {1278#false} is VALID [2018-11-14 17:06:55,742 INFO L273 TraceCheckUtils]: 35: Hoare triple {1278#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1278#false} is VALID [2018-11-14 17:06:55,743 INFO L273 TraceCheckUtils]: 36: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:06:55,743 INFO L273 TraceCheckUtils]: 37: Hoare triple {1278#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {1278#false} is VALID [2018-11-14 17:06:55,743 INFO L273 TraceCheckUtils]: 38: Hoare triple {1278#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {1278#false} is VALID [2018-11-14 17:06:55,743 INFO L273 TraceCheckUtils]: 39: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:06:55,744 INFO L273 TraceCheckUtils]: 40: Hoare triple {1278#false} assume !(~i~2 < 99); {1278#false} is VALID [2018-11-14 17:06:55,744 INFO L273 TraceCheckUtils]: 41: Hoare triple {1278#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {1278#false} is VALID [2018-11-14 17:06:55,744 INFO L256 TraceCheckUtils]: 42: Hoare triple {1278#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {1278#false} is VALID [2018-11-14 17:06:55,744 INFO L273 TraceCheckUtils]: 43: Hoare triple {1278#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1278#false} is VALID [2018-11-14 17:06:55,744 INFO L273 TraceCheckUtils]: 44: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:06:55,745 INFO L273 TraceCheckUtils]: 45: Hoare triple {1278#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1278#false} is VALID [2018-11-14 17:06:55,745 INFO L273 TraceCheckUtils]: 46: Hoare triple {1278#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1278#false} is VALID [2018-11-14 17:06:55,745 INFO L273 TraceCheckUtils]: 47: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:06:55,745 INFO L273 TraceCheckUtils]: 48: Hoare triple {1278#false} assume !(~i~0 < 100); {1278#false} is VALID [2018-11-14 17:06:55,746 INFO L273 TraceCheckUtils]: 49: Hoare triple {1278#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1278#false} is VALID [2018-11-14 17:06:55,746 INFO L273 TraceCheckUtils]: 50: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:06:55,746 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {1278#false} {1278#false} #77#return; {1278#false} is VALID [2018-11-14 17:06:55,746 INFO L273 TraceCheckUtils]: 52: Hoare triple {1278#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1278#false} is VALID [2018-11-14 17:06:55,747 INFO L273 TraceCheckUtils]: 53: Hoare triple {1278#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1278#false} is VALID [2018-11-14 17:06:55,747 INFO L273 TraceCheckUtils]: 54: Hoare triple {1278#false} assume !false; {1278#false} is VALID [2018-11-14 17:06:55,751 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 17:06:55,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:06:55,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 17:06:55,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-11-14 17:06:55,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:06:55,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:06:55,830 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:55,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:06:55,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:06:55,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:06:55,831 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 6 states. [2018-11-14 17:06:55,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:55,995 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-14 17:06:55,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:06:55,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-11-14 17:06:55,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:06:55,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:06:55,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2018-11-14 17:06:55,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:06:56,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2018-11-14 17:06:56,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2018-11-14 17:06:56,228 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:56,230 INFO L225 Difference]: With dead ends: 66 [2018-11-14 17:06:56,230 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 17:06:56,231 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:06:56,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 17:06:56,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-14 17:06:56,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:06:56,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2018-11-14 17:06:56,243 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2018-11-14 17:06:56,243 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2018-11-14 17:06:56,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:56,246 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-14 17:06:56,246 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 17:06:56,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:56,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:56,247 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2018-11-14 17:06:56,248 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2018-11-14 17:06:56,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:56,250 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-14 17:06:56,250 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 17:06:56,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:56,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:56,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:06:56,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:06:56,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 17:06:56,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-14 17:06:56,253 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 55 [2018-11-14 17:06:56,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:06:56,254 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-14 17:06:56,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:06:56,254 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-14 17:06:56,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-14 17:06:56,255 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:06:56,255 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:06:56,255 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:06:56,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:06:56,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1305179955, now seen corresponding path program 3 times [2018-11-14 17:06:56,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:06:56,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:06:56,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:56,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:06:56,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:56,534 INFO L256 TraceCheckUtils]: 0: Hoare triple {1678#true} call ULTIMATE.init(); {1678#true} is VALID [2018-11-14 17:06:56,535 INFO L273 TraceCheckUtils]: 1: Hoare triple {1678#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1678#true} is VALID [2018-11-14 17:06:56,535 INFO L273 TraceCheckUtils]: 2: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:06:56,535 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1678#true} {1678#true} #69#return; {1678#true} is VALID [2018-11-14 17:06:56,536 INFO L256 TraceCheckUtils]: 4: Hoare triple {1678#true} call #t~ret13 := main(); {1678#true} is VALID [2018-11-14 17:06:56,536 INFO L273 TraceCheckUtils]: 5: Hoare triple {1678#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1680#(= main_~i~1 0)} is VALID [2018-11-14 17:06:56,537 INFO L273 TraceCheckUtils]: 6: Hoare triple {1680#(= main_~i~1 0)} assume true; {1680#(= main_~i~1 0)} is VALID [2018-11-14 17:06:56,538 INFO L273 TraceCheckUtils]: 7: Hoare triple {1680#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1680#(= main_~i~1 0)} is VALID [2018-11-14 17:06:56,538 INFO L273 TraceCheckUtils]: 8: Hoare triple {1680#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1681#(<= main_~i~1 1)} is VALID [2018-11-14 17:06:56,539 INFO L273 TraceCheckUtils]: 9: Hoare triple {1681#(<= main_~i~1 1)} assume true; {1681#(<= main_~i~1 1)} is VALID [2018-11-14 17:06:56,539 INFO L273 TraceCheckUtils]: 10: Hoare triple {1681#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1681#(<= main_~i~1 1)} is VALID [2018-11-14 17:06:56,540 INFO L273 TraceCheckUtils]: 11: Hoare triple {1681#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1682#(<= main_~i~1 2)} is VALID [2018-11-14 17:06:56,540 INFO L273 TraceCheckUtils]: 12: Hoare triple {1682#(<= main_~i~1 2)} assume true; {1682#(<= main_~i~1 2)} is VALID [2018-11-14 17:06:56,541 INFO L273 TraceCheckUtils]: 13: Hoare triple {1682#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1682#(<= main_~i~1 2)} is VALID [2018-11-14 17:06:56,542 INFO L273 TraceCheckUtils]: 14: Hoare triple {1682#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1683#(<= main_~i~1 3)} is VALID [2018-11-14 17:06:56,543 INFO L273 TraceCheckUtils]: 15: Hoare triple {1683#(<= main_~i~1 3)} assume true; {1683#(<= main_~i~1 3)} is VALID [2018-11-14 17:06:56,544 INFO L273 TraceCheckUtils]: 16: Hoare triple {1683#(<= main_~i~1 3)} assume !(~i~1 < 100); {1679#false} is VALID [2018-11-14 17:06:56,544 INFO L256 TraceCheckUtils]: 17: Hoare triple {1679#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 17:06:56,544 INFO L273 TraceCheckUtils]: 18: Hoare triple {1678#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1678#true} is VALID [2018-11-14 17:06:56,544 INFO L273 TraceCheckUtils]: 19: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:06:56,545 INFO L273 TraceCheckUtils]: 20: Hoare triple {1678#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1678#true} is VALID [2018-11-14 17:06:56,545 INFO L273 TraceCheckUtils]: 21: Hoare triple {1678#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1678#true} is VALID [2018-11-14 17:06:56,545 INFO L273 TraceCheckUtils]: 22: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:06:56,546 INFO L273 TraceCheckUtils]: 23: Hoare triple {1678#true} assume !(~i~0 < 100); {1678#true} is VALID [2018-11-14 17:06:56,546 INFO L273 TraceCheckUtils]: 24: Hoare triple {1678#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 17:06:56,546 INFO L273 TraceCheckUtils]: 25: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:06:56,547 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1678#true} {1679#false} #73#return; {1679#false} is VALID [2018-11-14 17:06:56,547 INFO L273 TraceCheckUtils]: 27: Hoare triple {1679#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {1679#false} is VALID [2018-11-14 17:06:56,547 INFO L256 TraceCheckUtils]: 28: Hoare triple {1679#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 17:06:56,548 INFO L273 TraceCheckUtils]: 29: Hoare triple {1678#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1678#true} is VALID [2018-11-14 17:06:56,548 INFO L273 TraceCheckUtils]: 30: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:06:56,548 INFO L273 TraceCheckUtils]: 31: Hoare triple {1678#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1678#true} is VALID [2018-11-14 17:06:56,548 INFO L273 TraceCheckUtils]: 32: Hoare triple {1678#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1678#true} is VALID [2018-11-14 17:06:56,549 INFO L273 TraceCheckUtils]: 33: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:06:56,549 INFO L273 TraceCheckUtils]: 34: Hoare triple {1678#true} assume !(~i~0 < 100); {1678#true} is VALID [2018-11-14 17:06:56,549 INFO L273 TraceCheckUtils]: 35: Hoare triple {1678#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 17:06:56,549 INFO L273 TraceCheckUtils]: 36: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:06:56,549 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1678#true} {1679#false} #75#return; {1679#false} is VALID [2018-11-14 17:06:56,550 INFO L273 TraceCheckUtils]: 38: Hoare triple {1679#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1679#false} is VALID [2018-11-14 17:06:56,550 INFO L273 TraceCheckUtils]: 39: Hoare triple {1679#false} assume true; {1679#false} is VALID [2018-11-14 17:06:56,550 INFO L273 TraceCheckUtils]: 40: Hoare triple {1679#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {1679#false} is VALID [2018-11-14 17:06:56,550 INFO L273 TraceCheckUtils]: 41: Hoare triple {1679#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {1679#false} is VALID [2018-11-14 17:06:56,550 INFO L273 TraceCheckUtils]: 42: Hoare triple {1679#false} assume true; {1679#false} is VALID [2018-11-14 17:06:56,550 INFO L273 TraceCheckUtils]: 43: Hoare triple {1679#false} assume !(~i~2 < 99); {1679#false} is VALID [2018-11-14 17:06:56,551 INFO L273 TraceCheckUtils]: 44: Hoare triple {1679#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {1679#false} is VALID [2018-11-14 17:06:56,551 INFO L256 TraceCheckUtils]: 45: Hoare triple {1679#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 17:06:56,551 INFO L273 TraceCheckUtils]: 46: Hoare triple {1678#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1678#true} is VALID [2018-11-14 17:06:56,551 INFO L273 TraceCheckUtils]: 47: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:06:56,551 INFO L273 TraceCheckUtils]: 48: Hoare triple {1678#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1678#true} is VALID [2018-11-14 17:06:56,551 INFO L273 TraceCheckUtils]: 49: Hoare triple {1678#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1678#true} is VALID [2018-11-14 17:06:56,552 INFO L273 TraceCheckUtils]: 50: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:06:56,552 INFO L273 TraceCheckUtils]: 51: Hoare triple {1678#true} assume !(~i~0 < 100); {1678#true} is VALID [2018-11-14 17:06:56,552 INFO L273 TraceCheckUtils]: 52: Hoare triple {1678#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 17:06:56,552 INFO L273 TraceCheckUtils]: 53: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:06:56,552 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1678#true} {1679#false} #77#return; {1679#false} is VALID [2018-11-14 17:06:56,552 INFO L273 TraceCheckUtils]: 55: Hoare triple {1679#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1679#false} is VALID [2018-11-14 17:06:56,553 INFO L273 TraceCheckUtils]: 56: Hoare triple {1679#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1679#false} is VALID [2018-11-14 17:06:56,553 INFO L273 TraceCheckUtils]: 57: Hoare triple {1679#false} assume !false; {1679#false} is VALID [2018-11-14 17:06:56,556 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 17:06:56,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:06:56,556 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:06:56,565 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:06:56,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 17:06:56,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:06:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:56,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:06:56,797 INFO L256 TraceCheckUtils]: 0: Hoare triple {1678#true} call ULTIMATE.init(); {1678#true} is VALID [2018-11-14 17:06:56,797 INFO L273 TraceCheckUtils]: 1: Hoare triple {1678#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1678#true} is VALID [2018-11-14 17:06:56,798 INFO L273 TraceCheckUtils]: 2: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:06:56,798 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1678#true} {1678#true} #69#return; {1678#true} is VALID [2018-11-14 17:06:56,798 INFO L256 TraceCheckUtils]: 4: Hoare triple {1678#true} call #t~ret13 := main(); {1678#true} is VALID [2018-11-14 17:06:56,799 INFO L273 TraceCheckUtils]: 5: Hoare triple {1678#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1678#true} is VALID [2018-11-14 17:06:56,799 INFO L273 TraceCheckUtils]: 6: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:06:56,799 INFO L273 TraceCheckUtils]: 7: Hoare triple {1678#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1678#true} is VALID [2018-11-14 17:06:56,799 INFO L273 TraceCheckUtils]: 8: Hoare triple {1678#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1678#true} is VALID [2018-11-14 17:06:56,799 INFO L273 TraceCheckUtils]: 9: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:06:56,800 INFO L273 TraceCheckUtils]: 10: Hoare triple {1678#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1678#true} is VALID [2018-11-14 17:06:56,800 INFO L273 TraceCheckUtils]: 11: Hoare triple {1678#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1678#true} is VALID [2018-11-14 17:06:56,800 INFO L273 TraceCheckUtils]: 12: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:06:56,800 INFO L273 TraceCheckUtils]: 13: Hoare triple {1678#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1678#true} is VALID [2018-11-14 17:06:56,800 INFO L273 TraceCheckUtils]: 14: Hoare triple {1678#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1678#true} is VALID [2018-11-14 17:06:56,801 INFO L273 TraceCheckUtils]: 15: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:06:56,801 INFO L273 TraceCheckUtils]: 16: Hoare triple {1678#true} assume !(~i~1 < 100); {1678#true} is VALID [2018-11-14 17:06:56,801 INFO L256 TraceCheckUtils]: 17: Hoare triple {1678#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 17:06:56,801 INFO L273 TraceCheckUtils]: 18: Hoare triple {1678#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1678#true} is VALID [2018-11-14 17:06:56,802 INFO L273 TraceCheckUtils]: 19: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:06:56,802 INFO L273 TraceCheckUtils]: 20: Hoare triple {1678#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1678#true} is VALID [2018-11-14 17:06:56,802 INFO L273 TraceCheckUtils]: 21: Hoare triple {1678#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1678#true} is VALID [2018-11-14 17:06:56,802 INFO L273 TraceCheckUtils]: 22: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:06:56,802 INFO L273 TraceCheckUtils]: 23: Hoare triple {1678#true} assume !(~i~0 < 100); {1678#true} is VALID [2018-11-14 17:06:56,803 INFO L273 TraceCheckUtils]: 24: Hoare triple {1678#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 17:06:56,803 INFO L273 TraceCheckUtils]: 25: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:06:56,803 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1678#true} {1678#true} #73#return; {1678#true} is VALID [2018-11-14 17:06:56,803 INFO L273 TraceCheckUtils]: 27: Hoare triple {1678#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {1678#true} is VALID [2018-11-14 17:06:56,804 INFO L256 TraceCheckUtils]: 28: Hoare triple {1678#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 17:06:56,804 INFO L273 TraceCheckUtils]: 29: Hoare triple {1678#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1678#true} is VALID [2018-11-14 17:06:56,804 INFO L273 TraceCheckUtils]: 30: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:06:56,804 INFO L273 TraceCheckUtils]: 31: Hoare triple {1678#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1678#true} is VALID [2018-11-14 17:06:56,804 INFO L273 TraceCheckUtils]: 32: Hoare triple {1678#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1678#true} is VALID [2018-11-14 17:06:56,805 INFO L273 TraceCheckUtils]: 33: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:06:56,805 INFO L273 TraceCheckUtils]: 34: Hoare triple {1678#true} assume !(~i~0 < 100); {1678#true} is VALID [2018-11-14 17:06:56,805 INFO L273 TraceCheckUtils]: 35: Hoare triple {1678#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 17:06:56,805 INFO L273 TraceCheckUtils]: 36: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:06:56,805 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1678#true} {1678#true} #75#return; {1678#true} is VALID [2018-11-14 17:06:56,805 INFO L273 TraceCheckUtils]: 38: Hoare triple {1678#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1678#true} is VALID [2018-11-14 17:06:56,806 INFO L273 TraceCheckUtils]: 39: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:06:56,806 INFO L273 TraceCheckUtils]: 40: Hoare triple {1678#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {1678#true} is VALID [2018-11-14 17:06:56,806 INFO L273 TraceCheckUtils]: 41: Hoare triple {1678#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {1678#true} is VALID [2018-11-14 17:06:56,806 INFO L273 TraceCheckUtils]: 42: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:06:56,807 INFO L273 TraceCheckUtils]: 43: Hoare triple {1678#true} assume !(~i~2 < 99); {1678#true} is VALID [2018-11-14 17:06:56,807 INFO L273 TraceCheckUtils]: 44: Hoare triple {1678#true} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {1678#true} is VALID [2018-11-14 17:06:56,807 INFO L256 TraceCheckUtils]: 45: Hoare triple {1678#true} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 17:06:56,820 INFO L273 TraceCheckUtils]: 46: Hoare triple {1678#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1825#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:06:56,824 INFO L273 TraceCheckUtils]: 47: Hoare triple {1825#(<= bAnd_~i~0 1)} assume true; {1825#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:06:56,824 INFO L273 TraceCheckUtils]: 48: Hoare triple {1825#(<= bAnd_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1825#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:06:56,825 INFO L273 TraceCheckUtils]: 49: Hoare triple {1825#(<= bAnd_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1835#(<= bAnd_~i~0 2)} is VALID [2018-11-14 17:06:56,825 INFO L273 TraceCheckUtils]: 50: Hoare triple {1835#(<= bAnd_~i~0 2)} assume true; {1835#(<= bAnd_~i~0 2)} is VALID [2018-11-14 17:06:56,826 INFO L273 TraceCheckUtils]: 51: Hoare triple {1835#(<= bAnd_~i~0 2)} assume !(~i~0 < 100); {1679#false} is VALID [2018-11-14 17:06:56,826 INFO L273 TraceCheckUtils]: 52: Hoare triple {1679#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1679#false} is VALID [2018-11-14 17:06:56,826 INFO L273 TraceCheckUtils]: 53: Hoare triple {1679#false} assume true; {1679#false} is VALID [2018-11-14 17:06:56,826 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1679#false} {1678#true} #77#return; {1679#false} is VALID [2018-11-14 17:06:56,826 INFO L273 TraceCheckUtils]: 55: Hoare triple {1679#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1679#false} is VALID [2018-11-14 17:06:56,827 INFO L273 TraceCheckUtils]: 56: Hoare triple {1679#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1679#false} is VALID [2018-11-14 17:06:56,827 INFO L273 TraceCheckUtils]: 57: Hoare triple {1679#false} assume !false; {1679#false} is VALID [2018-11-14 17:06:56,830 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-14 17:06:56,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:06:56,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-14 17:06:56,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-14 17:06:56,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:06:56,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:06:56,983 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:56,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:06:56,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:06:56,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:06:56,985 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-11-14 17:06:57,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:57,278 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2018-11-14 17:06:57,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:06:57,278 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-14 17:06:57,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:06:57,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:06:57,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2018-11-14 17:06:57,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:06:57,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2018-11-14 17:06:57,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2018-11-14 17:06:57,390 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:57,392 INFO L225 Difference]: With dead ends: 73 [2018-11-14 17:06:57,392 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 17:06:57,393 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:06:57,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 17:06:57,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-14 17:06:57,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:06:57,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-14 17:06:57,419 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-14 17:06:57,419 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-14 17:06:57,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:57,421 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-14 17:06:57,421 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-14 17:06:57,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:57,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:57,421 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-14 17:06:57,422 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-14 17:06:57,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:57,424 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-14 17:06:57,424 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-14 17:06:57,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:57,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:57,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:06:57,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:06:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 17:06:57,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-14 17:06:57,427 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 58 [2018-11-14 17:06:57,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:06:57,428 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-14 17:06:57,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:06:57,428 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-14 17:06:57,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-14 17:06:57,429 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:06:57,429 INFO L375 BasicCegarLoop]: trace histogram [9, 6, 6, 5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:06:57,429 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:06:57,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:06:57,430 INFO L82 PathProgramCache]: Analyzing trace with hash 375282389, now seen corresponding path program 4 times [2018-11-14 17:06:57,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:06:57,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:06:57,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:57,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:06:57,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:58,088 INFO L256 TraceCheckUtils]: 0: Hoare triple {2121#true} call ULTIMATE.init(); {2121#true} is VALID [2018-11-14 17:06:58,089 INFO L273 TraceCheckUtils]: 1: Hoare triple {2121#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2121#true} is VALID [2018-11-14 17:06:58,089 INFO L273 TraceCheckUtils]: 2: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:06:58,089 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2121#true} {2121#true} #69#return; {2121#true} is VALID [2018-11-14 17:06:58,090 INFO L256 TraceCheckUtils]: 4: Hoare triple {2121#true} call #t~ret13 := main(); {2121#true} is VALID [2018-11-14 17:06:58,091 INFO L273 TraceCheckUtils]: 5: Hoare triple {2121#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2123#(= main_~i~1 0)} is VALID [2018-11-14 17:06:58,091 INFO L273 TraceCheckUtils]: 6: Hoare triple {2123#(= main_~i~1 0)} assume true; {2123#(= main_~i~1 0)} is VALID [2018-11-14 17:06:58,092 INFO L273 TraceCheckUtils]: 7: Hoare triple {2123#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2123#(= main_~i~1 0)} is VALID [2018-11-14 17:06:58,093 INFO L273 TraceCheckUtils]: 8: Hoare triple {2123#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 17:06:58,093 INFO L273 TraceCheckUtils]: 9: Hoare triple {2124#(<= main_~i~1 1)} assume true; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 17:06:58,094 INFO L273 TraceCheckUtils]: 10: Hoare triple {2124#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 17:06:58,094 INFO L273 TraceCheckUtils]: 11: Hoare triple {2124#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 17:06:58,095 INFO L273 TraceCheckUtils]: 12: Hoare triple {2125#(<= main_~i~1 2)} assume true; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 17:06:58,095 INFO L273 TraceCheckUtils]: 13: Hoare triple {2125#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 17:06:58,096 INFO L273 TraceCheckUtils]: 14: Hoare triple {2125#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 17:06:58,096 INFO L273 TraceCheckUtils]: 15: Hoare triple {2126#(<= main_~i~1 3)} assume true; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 17:06:58,096 INFO L273 TraceCheckUtils]: 16: Hoare triple {2126#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 17:06:58,097 INFO L273 TraceCheckUtils]: 17: Hoare triple {2126#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2127#(<= main_~i~1 4)} is VALID [2018-11-14 17:06:58,097 INFO L273 TraceCheckUtils]: 18: Hoare triple {2127#(<= main_~i~1 4)} assume true; {2127#(<= main_~i~1 4)} is VALID [2018-11-14 17:06:58,098 INFO L273 TraceCheckUtils]: 19: Hoare triple {2127#(<= main_~i~1 4)} assume !(~i~1 < 100); {2122#false} is VALID [2018-11-14 17:06:58,098 INFO L256 TraceCheckUtils]: 20: Hoare triple {2122#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {2121#true} is VALID [2018-11-14 17:06:58,098 INFO L273 TraceCheckUtils]: 21: Hoare triple {2121#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2121#true} is VALID [2018-11-14 17:06:58,098 INFO L273 TraceCheckUtils]: 22: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:06:58,098 INFO L273 TraceCheckUtils]: 23: Hoare triple {2121#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 17:06:58,099 INFO L273 TraceCheckUtils]: 24: Hoare triple {2121#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2121#true} is VALID [2018-11-14 17:06:58,099 INFO L273 TraceCheckUtils]: 25: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:06:58,099 INFO L273 TraceCheckUtils]: 26: Hoare triple {2121#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 17:06:58,100 INFO L273 TraceCheckUtils]: 27: Hoare triple {2121#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2121#true} is VALID [2018-11-14 17:06:58,100 INFO L273 TraceCheckUtils]: 28: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:06:58,101 INFO L273 TraceCheckUtils]: 29: Hoare triple {2121#true} assume !(~i~0 < 100); {2121#true} is VALID [2018-11-14 17:06:58,101 INFO L273 TraceCheckUtils]: 30: Hoare triple {2121#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2121#true} is VALID [2018-11-14 17:06:58,101 INFO L273 TraceCheckUtils]: 31: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:06:58,102 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2121#true} {2122#false} #73#return; {2122#false} is VALID [2018-11-14 17:06:58,102 INFO L273 TraceCheckUtils]: 33: Hoare triple {2122#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {2122#false} is VALID [2018-11-14 17:06:58,102 INFO L256 TraceCheckUtils]: 34: Hoare triple {2122#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {2121#true} is VALID [2018-11-14 17:06:58,103 INFO L273 TraceCheckUtils]: 35: Hoare triple {2121#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2121#true} is VALID [2018-11-14 17:06:58,103 INFO L273 TraceCheckUtils]: 36: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:06:58,103 INFO L273 TraceCheckUtils]: 37: Hoare triple {2121#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 17:06:58,103 INFO L273 TraceCheckUtils]: 38: Hoare triple {2121#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2121#true} is VALID [2018-11-14 17:06:58,104 INFO L273 TraceCheckUtils]: 39: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:06:58,104 INFO L273 TraceCheckUtils]: 40: Hoare triple {2121#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 17:06:58,104 INFO L273 TraceCheckUtils]: 41: Hoare triple {2121#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2121#true} is VALID [2018-11-14 17:06:58,104 INFO L273 TraceCheckUtils]: 42: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:06:58,104 INFO L273 TraceCheckUtils]: 43: Hoare triple {2121#true} assume !(~i~0 < 100); {2121#true} is VALID [2018-11-14 17:06:58,105 INFO L273 TraceCheckUtils]: 44: Hoare triple {2121#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2121#true} is VALID [2018-11-14 17:06:58,105 INFO L273 TraceCheckUtils]: 45: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:06:58,105 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {2121#true} {2122#false} #75#return; {2122#false} is VALID [2018-11-14 17:06:58,105 INFO L273 TraceCheckUtils]: 47: Hoare triple {2122#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2122#false} is VALID [2018-11-14 17:06:58,105 INFO L273 TraceCheckUtils]: 48: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:06:58,106 INFO L273 TraceCheckUtils]: 49: Hoare triple {2122#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {2122#false} is VALID [2018-11-14 17:06:58,106 INFO L273 TraceCheckUtils]: 50: Hoare triple {2122#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {2122#false} is VALID [2018-11-14 17:06:58,106 INFO L273 TraceCheckUtils]: 51: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:06:58,106 INFO L273 TraceCheckUtils]: 52: Hoare triple {2122#false} assume !(~i~2 < 99); {2122#false} is VALID [2018-11-14 17:06:58,107 INFO L273 TraceCheckUtils]: 53: Hoare triple {2122#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {2122#false} is VALID [2018-11-14 17:06:58,107 INFO L256 TraceCheckUtils]: 54: Hoare triple {2122#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {2121#true} is VALID [2018-11-14 17:06:58,107 INFO L273 TraceCheckUtils]: 55: Hoare triple {2121#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2121#true} is VALID [2018-11-14 17:06:58,107 INFO L273 TraceCheckUtils]: 56: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:06:58,107 INFO L273 TraceCheckUtils]: 57: Hoare triple {2121#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 17:06:58,108 INFO L273 TraceCheckUtils]: 58: Hoare triple {2121#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2121#true} is VALID [2018-11-14 17:06:58,108 INFO L273 TraceCheckUtils]: 59: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:06:58,108 INFO L273 TraceCheckUtils]: 60: Hoare triple {2121#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 17:06:58,108 INFO L273 TraceCheckUtils]: 61: Hoare triple {2121#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2121#true} is VALID [2018-11-14 17:06:58,108 INFO L273 TraceCheckUtils]: 62: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:06:58,109 INFO L273 TraceCheckUtils]: 63: Hoare triple {2121#true} assume !(~i~0 < 100); {2121#true} is VALID [2018-11-14 17:06:58,109 INFO L273 TraceCheckUtils]: 64: Hoare triple {2121#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2121#true} is VALID [2018-11-14 17:06:58,109 INFO L273 TraceCheckUtils]: 65: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:06:58,109 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {2121#true} {2122#false} #77#return; {2122#false} is VALID [2018-11-14 17:06:58,109 INFO L273 TraceCheckUtils]: 67: Hoare triple {2122#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2122#false} is VALID [2018-11-14 17:06:58,110 INFO L273 TraceCheckUtils]: 68: Hoare triple {2122#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2122#false} is VALID [2018-11-14 17:06:58,110 INFO L273 TraceCheckUtils]: 69: Hoare triple {2122#false} assume !false; {2122#false} is VALID [2018-11-14 17:06:58,115 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-14 17:06:58,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:06:58,116 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:06:58,144 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:06:58,179 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:06:58,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:06:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:58,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:06:58,343 INFO L256 TraceCheckUtils]: 0: Hoare triple {2121#true} call ULTIMATE.init(); {2121#true} is VALID [2018-11-14 17:06:58,343 INFO L273 TraceCheckUtils]: 1: Hoare triple {2121#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2121#true} is VALID [2018-11-14 17:06:58,343 INFO L273 TraceCheckUtils]: 2: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:06:58,344 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2121#true} {2121#true} #69#return; {2121#true} is VALID [2018-11-14 17:06:58,344 INFO L256 TraceCheckUtils]: 4: Hoare triple {2121#true} call #t~ret13 := main(); {2121#true} is VALID [2018-11-14 17:06:58,345 INFO L273 TraceCheckUtils]: 5: Hoare triple {2121#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2146#(<= main_~i~1 0)} is VALID [2018-11-14 17:06:58,345 INFO L273 TraceCheckUtils]: 6: Hoare triple {2146#(<= main_~i~1 0)} assume true; {2146#(<= main_~i~1 0)} is VALID [2018-11-14 17:06:58,346 INFO L273 TraceCheckUtils]: 7: Hoare triple {2146#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2146#(<= main_~i~1 0)} is VALID [2018-11-14 17:06:58,346 INFO L273 TraceCheckUtils]: 8: Hoare triple {2146#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 17:06:58,347 INFO L273 TraceCheckUtils]: 9: Hoare triple {2124#(<= main_~i~1 1)} assume true; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 17:06:58,347 INFO L273 TraceCheckUtils]: 10: Hoare triple {2124#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 17:06:58,348 INFO L273 TraceCheckUtils]: 11: Hoare triple {2124#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 17:06:58,348 INFO L273 TraceCheckUtils]: 12: Hoare triple {2125#(<= main_~i~1 2)} assume true; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 17:06:58,348 INFO L273 TraceCheckUtils]: 13: Hoare triple {2125#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 17:06:58,349 INFO L273 TraceCheckUtils]: 14: Hoare triple {2125#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 17:06:58,350 INFO L273 TraceCheckUtils]: 15: Hoare triple {2126#(<= main_~i~1 3)} assume true; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 17:06:58,350 INFO L273 TraceCheckUtils]: 16: Hoare triple {2126#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 17:06:58,351 INFO L273 TraceCheckUtils]: 17: Hoare triple {2126#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2127#(<= main_~i~1 4)} is VALID [2018-11-14 17:06:58,352 INFO L273 TraceCheckUtils]: 18: Hoare triple {2127#(<= main_~i~1 4)} assume true; {2127#(<= main_~i~1 4)} is VALID [2018-11-14 17:06:58,352 INFO L273 TraceCheckUtils]: 19: Hoare triple {2127#(<= main_~i~1 4)} assume !(~i~1 < 100); {2122#false} is VALID [2018-11-14 17:06:58,353 INFO L256 TraceCheckUtils]: 20: Hoare triple {2122#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {2122#false} is VALID [2018-11-14 17:06:58,353 INFO L273 TraceCheckUtils]: 21: Hoare triple {2122#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2122#false} is VALID [2018-11-14 17:06:58,353 INFO L273 TraceCheckUtils]: 22: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:06:58,353 INFO L273 TraceCheckUtils]: 23: Hoare triple {2122#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 17:06:58,353 INFO L273 TraceCheckUtils]: 24: Hoare triple {2122#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2122#false} is VALID [2018-11-14 17:06:58,354 INFO L273 TraceCheckUtils]: 25: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:06:58,354 INFO L273 TraceCheckUtils]: 26: Hoare triple {2122#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 17:06:58,354 INFO L273 TraceCheckUtils]: 27: Hoare triple {2122#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2122#false} is VALID [2018-11-14 17:06:58,354 INFO L273 TraceCheckUtils]: 28: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:06:58,355 INFO L273 TraceCheckUtils]: 29: Hoare triple {2122#false} assume !(~i~0 < 100); {2122#false} is VALID [2018-11-14 17:06:58,355 INFO L273 TraceCheckUtils]: 30: Hoare triple {2122#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2122#false} is VALID [2018-11-14 17:06:58,355 INFO L273 TraceCheckUtils]: 31: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:06:58,355 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2122#false} {2122#false} #73#return; {2122#false} is VALID [2018-11-14 17:06:58,355 INFO L273 TraceCheckUtils]: 33: Hoare triple {2122#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {2122#false} is VALID [2018-11-14 17:06:58,355 INFO L256 TraceCheckUtils]: 34: Hoare triple {2122#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {2122#false} is VALID [2018-11-14 17:06:58,355 INFO L273 TraceCheckUtils]: 35: Hoare triple {2122#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2122#false} is VALID [2018-11-14 17:06:58,356 INFO L273 TraceCheckUtils]: 36: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:06:58,356 INFO L273 TraceCheckUtils]: 37: Hoare triple {2122#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 17:06:58,356 INFO L273 TraceCheckUtils]: 38: Hoare triple {2122#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2122#false} is VALID [2018-11-14 17:06:58,356 INFO L273 TraceCheckUtils]: 39: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:06:58,356 INFO L273 TraceCheckUtils]: 40: Hoare triple {2122#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 17:06:58,356 INFO L273 TraceCheckUtils]: 41: Hoare triple {2122#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2122#false} is VALID [2018-11-14 17:06:58,356 INFO L273 TraceCheckUtils]: 42: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:06:58,356 INFO L273 TraceCheckUtils]: 43: Hoare triple {2122#false} assume !(~i~0 < 100); {2122#false} is VALID [2018-11-14 17:06:58,357 INFO L273 TraceCheckUtils]: 44: Hoare triple {2122#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2122#false} is VALID [2018-11-14 17:06:58,357 INFO L273 TraceCheckUtils]: 45: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:06:58,357 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {2122#false} {2122#false} #75#return; {2122#false} is VALID [2018-11-14 17:06:58,357 INFO L273 TraceCheckUtils]: 47: Hoare triple {2122#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2122#false} is VALID [2018-11-14 17:06:58,357 INFO L273 TraceCheckUtils]: 48: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:06:58,357 INFO L273 TraceCheckUtils]: 49: Hoare triple {2122#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {2122#false} is VALID [2018-11-14 17:06:58,357 INFO L273 TraceCheckUtils]: 50: Hoare triple {2122#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {2122#false} is VALID [2018-11-14 17:06:58,358 INFO L273 TraceCheckUtils]: 51: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:06:58,358 INFO L273 TraceCheckUtils]: 52: Hoare triple {2122#false} assume !(~i~2 < 99); {2122#false} is VALID [2018-11-14 17:06:58,358 INFO L273 TraceCheckUtils]: 53: Hoare triple {2122#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {2122#false} is VALID [2018-11-14 17:06:58,358 INFO L256 TraceCheckUtils]: 54: Hoare triple {2122#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {2122#false} is VALID [2018-11-14 17:06:58,358 INFO L273 TraceCheckUtils]: 55: Hoare triple {2122#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2122#false} is VALID [2018-11-14 17:06:58,358 INFO L273 TraceCheckUtils]: 56: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:06:58,358 INFO L273 TraceCheckUtils]: 57: Hoare triple {2122#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 17:06:58,358 INFO L273 TraceCheckUtils]: 58: Hoare triple {2122#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2122#false} is VALID [2018-11-14 17:06:58,359 INFO L273 TraceCheckUtils]: 59: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:06:58,359 INFO L273 TraceCheckUtils]: 60: Hoare triple {2122#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 17:06:58,359 INFO L273 TraceCheckUtils]: 61: Hoare triple {2122#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2122#false} is VALID [2018-11-14 17:06:58,359 INFO L273 TraceCheckUtils]: 62: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:06:58,359 INFO L273 TraceCheckUtils]: 63: Hoare triple {2122#false} assume !(~i~0 < 100); {2122#false} is VALID [2018-11-14 17:06:58,360 INFO L273 TraceCheckUtils]: 64: Hoare triple {2122#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2122#false} is VALID [2018-11-14 17:06:58,360 INFO L273 TraceCheckUtils]: 65: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:06:58,360 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {2122#false} {2122#false} #77#return; {2122#false} is VALID [2018-11-14 17:06:58,360 INFO L273 TraceCheckUtils]: 67: Hoare triple {2122#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2122#false} is VALID [2018-11-14 17:06:58,360 INFO L273 TraceCheckUtils]: 68: Hoare triple {2122#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2122#false} is VALID [2018-11-14 17:06:58,361 INFO L273 TraceCheckUtils]: 69: Hoare triple {2122#false} assume !false; {2122#false} is VALID [2018-11-14 17:06:58,366 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-14 17:06:58,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:06:58,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 17:06:58,392 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-11-14 17:06:58,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:06:58,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:06:58,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:58,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:06:58,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:06:58,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:06:58,485 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 8 states. [2018-11-14 17:06:58,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:58,705 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-14 17:06:58,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:06:58,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-11-14 17:06:58,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:06:58,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:06:58,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2018-11-14 17:06:58,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:06:58,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2018-11-14 17:06:58,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2018-11-14 17:06:58,875 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:58,876 INFO L225 Difference]: With dead ends: 78 [2018-11-14 17:06:58,876 INFO L226 Difference]: Without dead ends: 51 [2018-11-14 17:06:58,877 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:06:58,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-14 17:06:58,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-14 17:06:58,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:06:58,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 50 states. [2018-11-14 17:06:58,903 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 50 states. [2018-11-14 17:06:58,903 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 50 states. [2018-11-14 17:06:58,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:58,905 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-14 17:06:58,905 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-14 17:06:58,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:58,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:58,906 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 51 states. [2018-11-14 17:06:58,906 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 51 states. [2018-11-14 17:06:58,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:58,908 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-14 17:06:58,908 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-14 17:06:58,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:58,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:58,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:06:58,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:06:58,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 17:06:58,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-14 17:06:58,911 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 70 [2018-11-14 17:06:58,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:06:58,912 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-14 17:06:58,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:06:58,912 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-14 17:06:58,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-14 17:06:58,913 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:06:58,913 INFO L375 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 5, 5, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:06:58,913 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:06:58,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:06:58,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1521001423, now seen corresponding path program 5 times [2018-11-14 17:06:58,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:06:58,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:06:58,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:58,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:06:58,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:59,201 INFO L256 TraceCheckUtils]: 0: Hoare triple {2615#true} call ULTIMATE.init(); {2615#true} is VALID [2018-11-14 17:06:59,202 INFO L273 TraceCheckUtils]: 1: Hoare triple {2615#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2615#true} is VALID [2018-11-14 17:06:59,202 INFO L273 TraceCheckUtils]: 2: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:06:59,202 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2615#true} {2615#true} #69#return; {2615#true} is VALID [2018-11-14 17:06:59,202 INFO L256 TraceCheckUtils]: 4: Hoare triple {2615#true} call #t~ret13 := main(); {2615#true} is VALID [2018-11-14 17:06:59,202 INFO L273 TraceCheckUtils]: 5: Hoare triple {2615#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2617#(= main_~i~1 0)} is VALID [2018-11-14 17:06:59,203 INFO L273 TraceCheckUtils]: 6: Hoare triple {2617#(= main_~i~1 0)} assume true; {2617#(= main_~i~1 0)} is VALID [2018-11-14 17:06:59,203 INFO L273 TraceCheckUtils]: 7: Hoare triple {2617#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2617#(= main_~i~1 0)} is VALID [2018-11-14 17:06:59,204 INFO L273 TraceCheckUtils]: 8: Hoare triple {2617#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2618#(<= main_~i~1 1)} is VALID [2018-11-14 17:06:59,204 INFO L273 TraceCheckUtils]: 9: Hoare triple {2618#(<= main_~i~1 1)} assume true; {2618#(<= main_~i~1 1)} is VALID [2018-11-14 17:06:59,204 INFO L273 TraceCheckUtils]: 10: Hoare triple {2618#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2618#(<= main_~i~1 1)} is VALID [2018-11-14 17:06:59,205 INFO L273 TraceCheckUtils]: 11: Hoare triple {2618#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2619#(<= main_~i~1 2)} is VALID [2018-11-14 17:06:59,205 INFO L273 TraceCheckUtils]: 12: Hoare triple {2619#(<= main_~i~1 2)} assume true; {2619#(<= main_~i~1 2)} is VALID [2018-11-14 17:06:59,206 INFO L273 TraceCheckUtils]: 13: Hoare triple {2619#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2619#(<= main_~i~1 2)} is VALID [2018-11-14 17:06:59,207 INFO L273 TraceCheckUtils]: 14: Hoare triple {2619#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2620#(<= main_~i~1 3)} is VALID [2018-11-14 17:06:59,207 INFO L273 TraceCheckUtils]: 15: Hoare triple {2620#(<= main_~i~1 3)} assume true; {2620#(<= main_~i~1 3)} is VALID [2018-11-14 17:06:59,209 INFO L273 TraceCheckUtils]: 16: Hoare triple {2620#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2620#(<= main_~i~1 3)} is VALID [2018-11-14 17:06:59,210 INFO L273 TraceCheckUtils]: 17: Hoare triple {2620#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2621#(<= main_~i~1 4)} is VALID [2018-11-14 17:06:59,210 INFO L273 TraceCheckUtils]: 18: Hoare triple {2621#(<= main_~i~1 4)} assume true; {2621#(<= main_~i~1 4)} is VALID [2018-11-14 17:06:59,211 INFO L273 TraceCheckUtils]: 19: Hoare triple {2621#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2621#(<= main_~i~1 4)} is VALID [2018-11-14 17:06:59,211 INFO L273 TraceCheckUtils]: 20: Hoare triple {2621#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2622#(<= main_~i~1 5)} is VALID [2018-11-14 17:06:59,211 INFO L273 TraceCheckUtils]: 21: Hoare triple {2622#(<= main_~i~1 5)} assume true; {2622#(<= main_~i~1 5)} is VALID [2018-11-14 17:06:59,212 INFO L273 TraceCheckUtils]: 22: Hoare triple {2622#(<= main_~i~1 5)} assume !(~i~1 < 100); {2616#false} is VALID [2018-11-14 17:06:59,212 INFO L256 TraceCheckUtils]: 23: Hoare triple {2616#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {2615#true} is VALID [2018-11-14 17:06:59,212 INFO L273 TraceCheckUtils]: 24: Hoare triple {2615#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2615#true} is VALID [2018-11-14 17:06:59,212 INFO L273 TraceCheckUtils]: 25: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:06:59,212 INFO L273 TraceCheckUtils]: 26: Hoare triple {2615#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 17:06:59,212 INFO L273 TraceCheckUtils]: 27: Hoare triple {2615#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2615#true} is VALID [2018-11-14 17:06:59,213 INFO L273 TraceCheckUtils]: 28: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:06:59,213 INFO L273 TraceCheckUtils]: 29: Hoare triple {2615#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 17:06:59,213 INFO L273 TraceCheckUtils]: 30: Hoare triple {2615#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2615#true} is VALID [2018-11-14 17:06:59,213 INFO L273 TraceCheckUtils]: 31: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:06:59,213 INFO L273 TraceCheckUtils]: 32: Hoare triple {2615#true} assume !(~i~0 < 100); {2615#true} is VALID [2018-11-14 17:06:59,213 INFO L273 TraceCheckUtils]: 33: Hoare triple {2615#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2615#true} is VALID [2018-11-14 17:06:59,214 INFO L273 TraceCheckUtils]: 34: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:06:59,214 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2615#true} {2616#false} #73#return; {2616#false} is VALID [2018-11-14 17:06:59,214 INFO L273 TraceCheckUtils]: 36: Hoare triple {2616#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {2616#false} is VALID [2018-11-14 17:06:59,214 INFO L256 TraceCheckUtils]: 37: Hoare triple {2616#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {2615#true} is VALID [2018-11-14 17:06:59,215 INFO L273 TraceCheckUtils]: 38: Hoare triple {2615#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2615#true} is VALID [2018-11-14 17:06:59,215 INFO L273 TraceCheckUtils]: 39: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:06:59,215 INFO L273 TraceCheckUtils]: 40: Hoare triple {2615#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 17:06:59,215 INFO L273 TraceCheckUtils]: 41: Hoare triple {2615#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2615#true} is VALID [2018-11-14 17:06:59,215 INFO L273 TraceCheckUtils]: 42: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:06:59,216 INFO L273 TraceCheckUtils]: 43: Hoare triple {2615#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 17:06:59,216 INFO L273 TraceCheckUtils]: 44: Hoare triple {2615#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2615#true} is VALID [2018-11-14 17:06:59,216 INFO L273 TraceCheckUtils]: 45: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:06:59,216 INFO L273 TraceCheckUtils]: 46: Hoare triple {2615#true} assume !(~i~0 < 100); {2615#true} is VALID [2018-11-14 17:06:59,216 INFO L273 TraceCheckUtils]: 47: Hoare triple {2615#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2615#true} is VALID [2018-11-14 17:06:59,216 INFO L273 TraceCheckUtils]: 48: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:06:59,216 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {2615#true} {2616#false} #75#return; {2616#false} is VALID [2018-11-14 17:06:59,216 INFO L273 TraceCheckUtils]: 50: Hoare triple {2616#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2616#false} is VALID [2018-11-14 17:06:59,217 INFO L273 TraceCheckUtils]: 51: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:06:59,217 INFO L273 TraceCheckUtils]: 52: Hoare triple {2616#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {2616#false} is VALID [2018-11-14 17:06:59,217 INFO L273 TraceCheckUtils]: 53: Hoare triple {2616#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {2616#false} is VALID [2018-11-14 17:06:59,217 INFO L273 TraceCheckUtils]: 54: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:06:59,217 INFO L273 TraceCheckUtils]: 55: Hoare triple {2616#false} assume !(~i~2 < 99); {2616#false} is VALID [2018-11-14 17:06:59,217 INFO L273 TraceCheckUtils]: 56: Hoare triple {2616#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {2616#false} is VALID [2018-11-14 17:06:59,217 INFO L256 TraceCheckUtils]: 57: Hoare triple {2616#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {2615#true} is VALID [2018-11-14 17:06:59,218 INFO L273 TraceCheckUtils]: 58: Hoare triple {2615#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2615#true} is VALID [2018-11-14 17:06:59,218 INFO L273 TraceCheckUtils]: 59: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:06:59,218 INFO L273 TraceCheckUtils]: 60: Hoare triple {2615#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 17:06:59,218 INFO L273 TraceCheckUtils]: 61: Hoare triple {2615#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2615#true} is VALID [2018-11-14 17:06:59,218 INFO L273 TraceCheckUtils]: 62: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:06:59,219 INFO L273 TraceCheckUtils]: 63: Hoare triple {2615#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 17:06:59,219 INFO L273 TraceCheckUtils]: 64: Hoare triple {2615#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2615#true} is VALID [2018-11-14 17:06:59,219 INFO L273 TraceCheckUtils]: 65: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:06:59,219 INFO L273 TraceCheckUtils]: 66: Hoare triple {2615#true} assume !(~i~0 < 100); {2615#true} is VALID [2018-11-14 17:06:59,219 INFO L273 TraceCheckUtils]: 67: Hoare triple {2615#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2615#true} is VALID [2018-11-14 17:06:59,219 INFO L273 TraceCheckUtils]: 68: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:06:59,220 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {2615#true} {2616#false} #77#return; {2616#false} is VALID [2018-11-14 17:06:59,220 INFO L273 TraceCheckUtils]: 70: Hoare triple {2616#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2616#false} is VALID [2018-11-14 17:06:59,220 INFO L273 TraceCheckUtils]: 71: Hoare triple {2616#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2616#false} is VALID [2018-11-14 17:06:59,220 INFO L273 TraceCheckUtils]: 72: Hoare triple {2616#false} assume !false; {2616#false} is VALID [2018-11-14 17:06:59,223 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-14 17:06:59,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:06:59,224 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:06:59,241 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:06:59,308 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 17:06:59,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:06:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:59,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:06:59,492 INFO L256 TraceCheckUtils]: 0: Hoare triple {2615#true} call ULTIMATE.init(); {2615#true} is VALID [2018-11-14 17:06:59,492 INFO L273 TraceCheckUtils]: 1: Hoare triple {2615#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2615#true} is VALID [2018-11-14 17:06:59,493 INFO L273 TraceCheckUtils]: 2: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:06:59,493 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2615#true} {2615#true} #69#return; {2615#true} is VALID [2018-11-14 17:06:59,493 INFO L256 TraceCheckUtils]: 4: Hoare triple {2615#true} call #t~ret13 := main(); {2615#true} is VALID [2018-11-14 17:06:59,494 INFO L273 TraceCheckUtils]: 5: Hoare triple {2615#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2615#true} is VALID [2018-11-14 17:06:59,494 INFO L273 TraceCheckUtils]: 6: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:06:59,494 INFO L273 TraceCheckUtils]: 7: Hoare triple {2615#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2615#true} is VALID [2018-11-14 17:06:59,494 INFO L273 TraceCheckUtils]: 8: Hoare triple {2615#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2615#true} is VALID [2018-11-14 17:06:59,495 INFO L273 TraceCheckUtils]: 9: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:06:59,495 INFO L273 TraceCheckUtils]: 10: Hoare triple {2615#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2615#true} is VALID [2018-11-14 17:06:59,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {2615#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2615#true} is VALID [2018-11-14 17:06:59,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:06:59,495 INFO L273 TraceCheckUtils]: 13: Hoare triple {2615#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2615#true} is VALID [2018-11-14 17:06:59,496 INFO L273 TraceCheckUtils]: 14: Hoare triple {2615#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2615#true} is VALID [2018-11-14 17:06:59,496 INFO L273 TraceCheckUtils]: 15: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:06:59,496 INFO L273 TraceCheckUtils]: 16: Hoare triple {2615#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2615#true} is VALID [2018-11-14 17:06:59,496 INFO L273 TraceCheckUtils]: 17: Hoare triple {2615#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2615#true} is VALID [2018-11-14 17:06:59,496 INFO L273 TraceCheckUtils]: 18: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:06:59,496 INFO L273 TraceCheckUtils]: 19: Hoare triple {2615#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2615#true} is VALID [2018-11-14 17:06:59,497 INFO L273 TraceCheckUtils]: 20: Hoare triple {2615#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2615#true} is VALID [2018-11-14 17:06:59,497 INFO L273 TraceCheckUtils]: 21: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:06:59,497 INFO L273 TraceCheckUtils]: 22: Hoare triple {2615#true} assume !(~i~1 < 100); {2615#true} is VALID [2018-11-14 17:06:59,497 INFO L256 TraceCheckUtils]: 23: Hoare triple {2615#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {2615#true} is VALID [2018-11-14 17:06:59,498 INFO L273 TraceCheckUtils]: 24: Hoare triple {2615#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2698#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:06:59,498 INFO L273 TraceCheckUtils]: 25: Hoare triple {2698#(<= bAnd_~i~0 1)} assume true; {2698#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:06:59,498 INFO L273 TraceCheckUtils]: 26: Hoare triple {2698#(<= bAnd_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2698#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:06:59,499 INFO L273 TraceCheckUtils]: 27: Hoare triple {2698#(<= bAnd_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2708#(<= bAnd_~i~0 2)} is VALID [2018-11-14 17:06:59,499 INFO L273 TraceCheckUtils]: 28: Hoare triple {2708#(<= bAnd_~i~0 2)} assume true; {2708#(<= bAnd_~i~0 2)} is VALID [2018-11-14 17:06:59,500 INFO L273 TraceCheckUtils]: 29: Hoare triple {2708#(<= bAnd_~i~0 2)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2708#(<= bAnd_~i~0 2)} is VALID [2018-11-14 17:06:59,500 INFO L273 TraceCheckUtils]: 30: Hoare triple {2708#(<= bAnd_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2718#(<= bAnd_~i~0 3)} is VALID [2018-11-14 17:06:59,501 INFO L273 TraceCheckUtils]: 31: Hoare triple {2718#(<= bAnd_~i~0 3)} assume true; {2718#(<= bAnd_~i~0 3)} is VALID [2018-11-14 17:06:59,502 INFO L273 TraceCheckUtils]: 32: Hoare triple {2718#(<= bAnd_~i~0 3)} assume !(~i~0 < 100); {2616#false} is VALID [2018-11-14 17:06:59,502 INFO L273 TraceCheckUtils]: 33: Hoare triple {2616#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2616#false} is VALID [2018-11-14 17:06:59,502 INFO L273 TraceCheckUtils]: 34: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:06:59,502 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2616#false} {2615#true} #73#return; {2616#false} is VALID [2018-11-14 17:06:59,503 INFO L273 TraceCheckUtils]: 36: Hoare triple {2616#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {2616#false} is VALID [2018-11-14 17:06:59,503 INFO L256 TraceCheckUtils]: 37: Hoare triple {2616#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {2616#false} is VALID [2018-11-14 17:06:59,503 INFO L273 TraceCheckUtils]: 38: Hoare triple {2616#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2616#false} is VALID [2018-11-14 17:06:59,504 INFO L273 TraceCheckUtils]: 39: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:06:59,504 INFO L273 TraceCheckUtils]: 40: Hoare triple {2616#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2616#false} is VALID [2018-11-14 17:06:59,505 INFO L273 TraceCheckUtils]: 41: Hoare triple {2616#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2616#false} is VALID [2018-11-14 17:06:59,505 INFO L273 TraceCheckUtils]: 42: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:06:59,505 INFO L273 TraceCheckUtils]: 43: Hoare triple {2616#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2616#false} is VALID [2018-11-14 17:06:59,506 INFO L273 TraceCheckUtils]: 44: Hoare triple {2616#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2616#false} is VALID [2018-11-14 17:06:59,506 INFO L273 TraceCheckUtils]: 45: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:06:59,506 INFO L273 TraceCheckUtils]: 46: Hoare triple {2616#false} assume !(~i~0 < 100); {2616#false} is VALID [2018-11-14 17:06:59,506 INFO L273 TraceCheckUtils]: 47: Hoare triple {2616#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2616#false} is VALID [2018-11-14 17:06:59,507 INFO L273 TraceCheckUtils]: 48: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:06:59,507 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {2616#false} {2616#false} #75#return; {2616#false} is VALID [2018-11-14 17:06:59,507 INFO L273 TraceCheckUtils]: 50: Hoare triple {2616#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2616#false} is VALID [2018-11-14 17:06:59,507 INFO L273 TraceCheckUtils]: 51: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:06:59,508 INFO L273 TraceCheckUtils]: 52: Hoare triple {2616#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {2616#false} is VALID [2018-11-14 17:06:59,508 INFO L273 TraceCheckUtils]: 53: Hoare triple {2616#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {2616#false} is VALID [2018-11-14 17:06:59,508 INFO L273 TraceCheckUtils]: 54: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:06:59,508 INFO L273 TraceCheckUtils]: 55: Hoare triple {2616#false} assume !(~i~2 < 99); {2616#false} is VALID [2018-11-14 17:06:59,509 INFO L273 TraceCheckUtils]: 56: Hoare triple {2616#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {2616#false} is VALID [2018-11-14 17:06:59,509 INFO L256 TraceCheckUtils]: 57: Hoare triple {2616#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {2616#false} is VALID [2018-11-14 17:06:59,509 INFO L273 TraceCheckUtils]: 58: Hoare triple {2616#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2616#false} is VALID [2018-11-14 17:06:59,509 INFO L273 TraceCheckUtils]: 59: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:06:59,509 INFO L273 TraceCheckUtils]: 60: Hoare triple {2616#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2616#false} is VALID [2018-11-14 17:06:59,510 INFO L273 TraceCheckUtils]: 61: Hoare triple {2616#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2616#false} is VALID [2018-11-14 17:06:59,510 INFO L273 TraceCheckUtils]: 62: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:06:59,510 INFO L273 TraceCheckUtils]: 63: Hoare triple {2616#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2616#false} is VALID [2018-11-14 17:06:59,510 INFO L273 TraceCheckUtils]: 64: Hoare triple {2616#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2616#false} is VALID [2018-11-14 17:06:59,511 INFO L273 TraceCheckUtils]: 65: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:06:59,511 INFO L273 TraceCheckUtils]: 66: Hoare triple {2616#false} assume !(~i~0 < 100); {2616#false} is VALID [2018-11-14 17:06:59,511 INFO L273 TraceCheckUtils]: 67: Hoare triple {2616#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2616#false} is VALID [2018-11-14 17:06:59,511 INFO L273 TraceCheckUtils]: 68: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:06:59,511 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {2616#false} {2616#false} #77#return; {2616#false} is VALID [2018-11-14 17:06:59,512 INFO L273 TraceCheckUtils]: 70: Hoare triple {2616#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2616#false} is VALID [2018-11-14 17:06:59,512 INFO L273 TraceCheckUtils]: 71: Hoare triple {2616#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2616#false} is VALID [2018-11-14 17:06:59,512 INFO L273 TraceCheckUtils]: 72: Hoare triple {2616#false} assume !false; {2616#false} is VALID [2018-11-14 17:06:59,517 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 46 proven. 7 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-11-14 17:06:59,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:06:59,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-14 17:06:59,549 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2018-11-14 17:06:59,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:06:59,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 17:06:59,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:59,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 17:06:59,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 17:06:59,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:06:59,711 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 11 states. [2018-11-14 17:07:00,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:00,491 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2018-11-14 17:07:00,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 17:07:00,492 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2018-11-14 17:07:00,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:00,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:07:00,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2018-11-14 17:07:00,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:07:00,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2018-11-14 17:07:00,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 88 transitions. [2018-11-14 17:07:00,574 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:00,576 INFO L225 Difference]: With dead ends: 85 [2018-11-14 17:07:00,576 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 17:07:00,578 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:07:00,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 17:07:00,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-11-14 17:07:00,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:00,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 56 states. [2018-11-14 17:07:00,650 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 56 states. [2018-11-14 17:07:00,650 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 56 states. [2018-11-14 17:07:00,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:00,652 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-11-14 17:07:00,652 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-14 17:07:00,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:00,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:00,653 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 58 states. [2018-11-14 17:07:00,653 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 58 states. [2018-11-14 17:07:00,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:00,655 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-11-14 17:07:00,656 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-14 17:07:00,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:00,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:00,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:00,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:00,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 17:07:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-14 17:07:00,659 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 73 [2018-11-14 17:07:00,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:00,659 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-14 17:07:00,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 17:07:00,659 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-14 17:07:00,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-14 17:07:00,660 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:00,661 INFO L375 BasicCegarLoop]: trace histogram [12, 9, 9, 7, 6, 6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:07:00,661 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:00,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:00,661 INFO L82 PathProgramCache]: Analyzing trace with hash -335328825, now seen corresponding path program 6 times [2018-11-14 17:07:00,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:00,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:00,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:00,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:00,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:01,118 INFO L256 TraceCheckUtils]: 0: Hoare triple {3152#true} call ULTIMATE.init(); {3152#true} is VALID [2018-11-14 17:07:01,119 INFO L273 TraceCheckUtils]: 1: Hoare triple {3152#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3152#true} is VALID [2018-11-14 17:07:01,119 INFO L273 TraceCheckUtils]: 2: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,119 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3152#true} {3152#true} #69#return; {3152#true} is VALID [2018-11-14 17:07:01,119 INFO L256 TraceCheckUtils]: 4: Hoare triple {3152#true} call #t~ret13 := main(); {3152#true} is VALID [2018-11-14 17:07:01,120 INFO L273 TraceCheckUtils]: 5: Hoare triple {3152#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3154#(= main_~i~1 0)} is VALID [2018-11-14 17:07:01,120 INFO L273 TraceCheckUtils]: 6: Hoare triple {3154#(= main_~i~1 0)} assume true; {3154#(= main_~i~1 0)} is VALID [2018-11-14 17:07:01,121 INFO L273 TraceCheckUtils]: 7: Hoare triple {3154#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3154#(= main_~i~1 0)} is VALID [2018-11-14 17:07:01,122 INFO L273 TraceCheckUtils]: 8: Hoare triple {3154#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3155#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:01,122 INFO L273 TraceCheckUtils]: 9: Hoare triple {3155#(<= main_~i~1 1)} assume true; {3155#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:01,123 INFO L273 TraceCheckUtils]: 10: Hoare triple {3155#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3155#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:01,123 INFO L273 TraceCheckUtils]: 11: Hoare triple {3155#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3156#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:01,124 INFO L273 TraceCheckUtils]: 12: Hoare triple {3156#(<= main_~i~1 2)} assume true; {3156#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:01,124 INFO L273 TraceCheckUtils]: 13: Hoare triple {3156#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3156#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:01,125 INFO L273 TraceCheckUtils]: 14: Hoare triple {3156#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3157#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:01,126 INFO L273 TraceCheckUtils]: 15: Hoare triple {3157#(<= main_~i~1 3)} assume true; {3157#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:01,126 INFO L273 TraceCheckUtils]: 16: Hoare triple {3157#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3157#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:01,127 INFO L273 TraceCheckUtils]: 17: Hoare triple {3157#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3158#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:01,127 INFO L273 TraceCheckUtils]: 18: Hoare triple {3158#(<= main_~i~1 4)} assume true; {3158#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:01,128 INFO L273 TraceCheckUtils]: 19: Hoare triple {3158#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3158#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:01,129 INFO L273 TraceCheckUtils]: 20: Hoare triple {3158#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3159#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:01,129 INFO L273 TraceCheckUtils]: 21: Hoare triple {3159#(<= main_~i~1 5)} assume true; {3159#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:01,130 INFO L273 TraceCheckUtils]: 22: Hoare triple {3159#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3159#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:01,130 INFO L273 TraceCheckUtils]: 23: Hoare triple {3159#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3160#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:01,131 INFO L273 TraceCheckUtils]: 24: Hoare triple {3160#(<= main_~i~1 6)} assume true; {3160#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:01,131 INFO L273 TraceCheckUtils]: 25: Hoare triple {3160#(<= main_~i~1 6)} assume !(~i~1 < 100); {3153#false} is VALID [2018-11-14 17:07:01,132 INFO L256 TraceCheckUtils]: 26: Hoare triple {3153#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {3152#true} is VALID [2018-11-14 17:07:01,132 INFO L273 TraceCheckUtils]: 27: Hoare triple {3152#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3152#true} is VALID [2018-11-14 17:07:01,132 INFO L273 TraceCheckUtils]: 28: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,132 INFO L273 TraceCheckUtils]: 29: Hoare triple {3152#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:01,132 INFO L273 TraceCheckUtils]: 30: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:07:01,133 INFO L273 TraceCheckUtils]: 31: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,133 INFO L273 TraceCheckUtils]: 32: Hoare triple {3152#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:01,133 INFO L273 TraceCheckUtils]: 33: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:07:01,133 INFO L273 TraceCheckUtils]: 34: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,133 INFO L273 TraceCheckUtils]: 35: Hoare triple {3152#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:01,134 INFO L273 TraceCheckUtils]: 36: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:07:01,134 INFO L273 TraceCheckUtils]: 37: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,134 INFO L273 TraceCheckUtils]: 38: Hoare triple {3152#true} assume !(~i~0 < 100); {3152#true} is VALID [2018-11-14 17:07:01,134 INFO L273 TraceCheckUtils]: 39: Hoare triple {3152#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3152#true} is VALID [2018-11-14 17:07:01,134 INFO L273 TraceCheckUtils]: 40: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,135 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {3152#true} {3153#false} #73#return; {3153#false} is VALID [2018-11-14 17:07:01,135 INFO L273 TraceCheckUtils]: 42: Hoare triple {3153#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {3153#false} is VALID [2018-11-14 17:07:01,135 INFO L256 TraceCheckUtils]: 43: Hoare triple {3153#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {3152#true} is VALID [2018-11-14 17:07:01,135 INFO L273 TraceCheckUtils]: 44: Hoare triple {3152#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3152#true} is VALID [2018-11-14 17:07:01,135 INFO L273 TraceCheckUtils]: 45: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,135 INFO L273 TraceCheckUtils]: 46: Hoare triple {3152#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:01,136 INFO L273 TraceCheckUtils]: 47: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:07:01,136 INFO L273 TraceCheckUtils]: 48: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,136 INFO L273 TraceCheckUtils]: 49: Hoare triple {3152#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:01,136 INFO L273 TraceCheckUtils]: 50: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:07:01,136 INFO L273 TraceCheckUtils]: 51: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,136 INFO L273 TraceCheckUtils]: 52: Hoare triple {3152#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:01,136 INFO L273 TraceCheckUtils]: 53: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:07:01,136 INFO L273 TraceCheckUtils]: 54: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,137 INFO L273 TraceCheckUtils]: 55: Hoare triple {3152#true} assume !(~i~0 < 100); {3152#true} is VALID [2018-11-14 17:07:01,137 INFO L273 TraceCheckUtils]: 56: Hoare triple {3152#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3152#true} is VALID [2018-11-14 17:07:01,137 INFO L273 TraceCheckUtils]: 57: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,137 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {3152#true} {3153#false} #75#return; {3153#false} is VALID [2018-11-14 17:07:01,137 INFO L273 TraceCheckUtils]: 59: Hoare triple {3153#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3153#false} is VALID [2018-11-14 17:07:01,137 INFO L273 TraceCheckUtils]: 60: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 17:07:01,137 INFO L273 TraceCheckUtils]: 61: Hoare triple {3153#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {3153#false} is VALID [2018-11-14 17:07:01,137 INFO L273 TraceCheckUtils]: 62: Hoare triple {3153#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {3153#false} is VALID [2018-11-14 17:07:01,138 INFO L273 TraceCheckUtils]: 63: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 17:07:01,138 INFO L273 TraceCheckUtils]: 64: Hoare triple {3153#false} assume !(~i~2 < 99); {3153#false} is VALID [2018-11-14 17:07:01,138 INFO L273 TraceCheckUtils]: 65: Hoare triple {3153#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {3153#false} is VALID [2018-11-14 17:07:01,138 INFO L256 TraceCheckUtils]: 66: Hoare triple {3153#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {3152#true} is VALID [2018-11-14 17:07:01,138 INFO L273 TraceCheckUtils]: 67: Hoare triple {3152#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3152#true} is VALID [2018-11-14 17:07:01,138 INFO L273 TraceCheckUtils]: 68: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,138 INFO L273 TraceCheckUtils]: 69: Hoare triple {3152#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:01,138 INFO L273 TraceCheckUtils]: 70: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:07:01,139 INFO L273 TraceCheckUtils]: 71: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,139 INFO L273 TraceCheckUtils]: 72: Hoare triple {3152#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:01,139 INFO L273 TraceCheckUtils]: 73: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:07:01,139 INFO L273 TraceCheckUtils]: 74: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,139 INFO L273 TraceCheckUtils]: 75: Hoare triple {3152#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:01,139 INFO L273 TraceCheckUtils]: 76: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:07:01,139 INFO L273 TraceCheckUtils]: 77: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,139 INFO L273 TraceCheckUtils]: 78: Hoare triple {3152#true} assume !(~i~0 < 100); {3152#true} is VALID [2018-11-14 17:07:01,140 INFO L273 TraceCheckUtils]: 79: Hoare triple {3152#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3152#true} is VALID [2018-11-14 17:07:01,140 INFO L273 TraceCheckUtils]: 80: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,140 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {3152#true} {3153#false} #77#return; {3153#false} is VALID [2018-11-14 17:07:01,140 INFO L273 TraceCheckUtils]: 82: Hoare triple {3153#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3153#false} is VALID [2018-11-14 17:07:01,140 INFO L273 TraceCheckUtils]: 83: Hoare triple {3153#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3153#false} is VALID [2018-11-14 17:07:01,141 INFO L273 TraceCheckUtils]: 84: Hoare triple {3153#false} assume !false; {3153#false} is VALID [2018-11-14 17:07:01,145 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-11-14 17:07:01,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:01,145 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:07:01,157 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:07:01,246 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-14 17:07:01,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:01,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:01,439 INFO L256 TraceCheckUtils]: 0: Hoare triple {3152#true} call ULTIMATE.init(); {3152#true} is VALID [2018-11-14 17:07:01,439 INFO L273 TraceCheckUtils]: 1: Hoare triple {3152#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3152#true} is VALID [2018-11-14 17:07:01,440 INFO L273 TraceCheckUtils]: 2: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,440 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3152#true} {3152#true} #69#return; {3152#true} is VALID [2018-11-14 17:07:01,440 INFO L256 TraceCheckUtils]: 4: Hoare triple {3152#true} call #t~ret13 := main(); {3152#true} is VALID [2018-11-14 17:07:01,441 INFO L273 TraceCheckUtils]: 5: Hoare triple {3152#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3152#true} is VALID [2018-11-14 17:07:01,441 INFO L273 TraceCheckUtils]: 6: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,441 INFO L273 TraceCheckUtils]: 7: Hoare triple {3152#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3152#true} is VALID [2018-11-14 17:07:01,442 INFO L273 TraceCheckUtils]: 8: Hoare triple {3152#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3152#true} is VALID [2018-11-14 17:07:01,442 INFO L273 TraceCheckUtils]: 9: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,442 INFO L273 TraceCheckUtils]: 10: Hoare triple {3152#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3152#true} is VALID [2018-11-14 17:07:01,442 INFO L273 TraceCheckUtils]: 11: Hoare triple {3152#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3152#true} is VALID [2018-11-14 17:07:01,442 INFO L273 TraceCheckUtils]: 12: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,443 INFO L273 TraceCheckUtils]: 13: Hoare triple {3152#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3152#true} is VALID [2018-11-14 17:07:01,443 INFO L273 TraceCheckUtils]: 14: Hoare triple {3152#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3152#true} is VALID [2018-11-14 17:07:01,443 INFO L273 TraceCheckUtils]: 15: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,443 INFO L273 TraceCheckUtils]: 16: Hoare triple {3152#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3152#true} is VALID [2018-11-14 17:07:01,443 INFO L273 TraceCheckUtils]: 17: Hoare triple {3152#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3152#true} is VALID [2018-11-14 17:07:01,443 INFO L273 TraceCheckUtils]: 18: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,444 INFO L273 TraceCheckUtils]: 19: Hoare triple {3152#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3152#true} is VALID [2018-11-14 17:07:01,444 INFO L273 TraceCheckUtils]: 20: Hoare triple {3152#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3152#true} is VALID [2018-11-14 17:07:01,444 INFO L273 TraceCheckUtils]: 21: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,444 INFO L273 TraceCheckUtils]: 22: Hoare triple {3152#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3152#true} is VALID [2018-11-14 17:07:01,444 INFO L273 TraceCheckUtils]: 23: Hoare triple {3152#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3152#true} is VALID [2018-11-14 17:07:01,444 INFO L273 TraceCheckUtils]: 24: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,445 INFO L273 TraceCheckUtils]: 25: Hoare triple {3152#true} assume !(~i~1 < 100); {3152#true} is VALID [2018-11-14 17:07:01,445 INFO L256 TraceCheckUtils]: 26: Hoare triple {3152#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {3152#true} is VALID [2018-11-14 17:07:01,445 INFO L273 TraceCheckUtils]: 27: Hoare triple {3152#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3152#true} is VALID [2018-11-14 17:07:01,445 INFO L273 TraceCheckUtils]: 28: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,445 INFO L273 TraceCheckUtils]: 29: Hoare triple {3152#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:01,445 INFO L273 TraceCheckUtils]: 30: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:07:01,445 INFO L273 TraceCheckUtils]: 31: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,446 INFO L273 TraceCheckUtils]: 32: Hoare triple {3152#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:01,446 INFO L273 TraceCheckUtils]: 33: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:07:01,446 INFO L273 TraceCheckUtils]: 34: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,446 INFO L273 TraceCheckUtils]: 35: Hoare triple {3152#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:01,446 INFO L273 TraceCheckUtils]: 36: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:07:01,446 INFO L273 TraceCheckUtils]: 37: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,446 INFO L273 TraceCheckUtils]: 38: Hoare triple {3152#true} assume !(~i~0 < 100); {3152#true} is VALID [2018-11-14 17:07:01,446 INFO L273 TraceCheckUtils]: 39: Hoare triple {3152#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3152#true} is VALID [2018-11-14 17:07:01,447 INFO L273 TraceCheckUtils]: 40: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,447 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {3152#true} {3152#true} #73#return; {3152#true} is VALID [2018-11-14 17:07:01,447 INFO L273 TraceCheckUtils]: 42: Hoare triple {3152#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {3152#true} is VALID [2018-11-14 17:07:01,447 INFO L256 TraceCheckUtils]: 43: Hoare triple {3152#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {3152#true} is VALID [2018-11-14 17:07:01,447 INFO L273 TraceCheckUtils]: 44: Hoare triple {3152#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3152#true} is VALID [2018-11-14 17:07:01,447 INFO L273 TraceCheckUtils]: 45: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,447 INFO L273 TraceCheckUtils]: 46: Hoare triple {3152#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:01,448 INFO L273 TraceCheckUtils]: 47: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:07:01,448 INFO L273 TraceCheckUtils]: 48: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,448 INFO L273 TraceCheckUtils]: 49: Hoare triple {3152#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:01,448 INFO L273 TraceCheckUtils]: 50: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:07:01,448 INFO L273 TraceCheckUtils]: 51: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,448 INFO L273 TraceCheckUtils]: 52: Hoare triple {3152#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:07:01,448 INFO L273 TraceCheckUtils]: 53: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:07:01,448 INFO L273 TraceCheckUtils]: 54: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,449 INFO L273 TraceCheckUtils]: 55: Hoare triple {3152#true} assume !(~i~0 < 100); {3152#true} is VALID [2018-11-14 17:07:01,449 INFO L273 TraceCheckUtils]: 56: Hoare triple {3152#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3152#true} is VALID [2018-11-14 17:07:01,449 INFO L273 TraceCheckUtils]: 57: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:07:01,449 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {3152#true} {3152#true} #75#return; {3152#true} is VALID [2018-11-14 17:07:01,449 INFO L273 TraceCheckUtils]: 59: Hoare triple {3152#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3341#(<= main_~i~2 0)} is VALID [2018-11-14 17:07:01,450 INFO L273 TraceCheckUtils]: 60: Hoare triple {3341#(<= main_~i~2 0)} assume true; {3341#(<= main_~i~2 0)} is VALID [2018-11-14 17:07:01,450 INFO L273 TraceCheckUtils]: 61: Hoare triple {3341#(<= main_~i~2 0)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {3341#(<= main_~i~2 0)} is VALID [2018-11-14 17:07:01,451 INFO L273 TraceCheckUtils]: 62: Hoare triple {3341#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {3351#(<= main_~i~2 1)} is VALID [2018-11-14 17:07:01,451 INFO L273 TraceCheckUtils]: 63: Hoare triple {3351#(<= main_~i~2 1)} assume true; {3351#(<= main_~i~2 1)} is VALID [2018-11-14 17:07:01,451 INFO L273 TraceCheckUtils]: 64: Hoare triple {3351#(<= main_~i~2 1)} assume !(~i~2 < 99); {3153#false} is VALID [2018-11-14 17:07:01,452 INFO L273 TraceCheckUtils]: 65: Hoare triple {3153#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {3153#false} is VALID [2018-11-14 17:07:01,452 INFO L256 TraceCheckUtils]: 66: Hoare triple {3153#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {3153#false} is VALID [2018-11-14 17:07:01,452 INFO L273 TraceCheckUtils]: 67: Hoare triple {3153#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3153#false} is VALID [2018-11-14 17:07:01,452 INFO L273 TraceCheckUtils]: 68: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 17:07:01,452 INFO L273 TraceCheckUtils]: 69: Hoare triple {3153#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3153#false} is VALID [2018-11-14 17:07:01,452 INFO L273 TraceCheckUtils]: 70: Hoare triple {3153#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3153#false} is VALID [2018-11-14 17:07:01,452 INFO L273 TraceCheckUtils]: 71: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 17:07:01,452 INFO L273 TraceCheckUtils]: 72: Hoare triple {3153#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3153#false} is VALID [2018-11-14 17:07:01,453 INFO L273 TraceCheckUtils]: 73: Hoare triple {3153#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3153#false} is VALID [2018-11-14 17:07:01,453 INFO L273 TraceCheckUtils]: 74: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 17:07:01,453 INFO L273 TraceCheckUtils]: 75: Hoare triple {3153#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3153#false} is VALID [2018-11-14 17:07:01,453 INFO L273 TraceCheckUtils]: 76: Hoare triple {3153#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3153#false} is VALID [2018-11-14 17:07:01,453 INFO L273 TraceCheckUtils]: 77: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 17:07:01,453 INFO L273 TraceCheckUtils]: 78: Hoare triple {3153#false} assume !(~i~0 < 100); {3153#false} is VALID [2018-11-14 17:07:01,454 INFO L273 TraceCheckUtils]: 79: Hoare triple {3153#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3153#false} is VALID [2018-11-14 17:07:01,454 INFO L273 TraceCheckUtils]: 80: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 17:07:01,454 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {3153#false} {3153#false} #77#return; {3153#false} is VALID [2018-11-14 17:07:01,454 INFO L273 TraceCheckUtils]: 82: Hoare triple {3153#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3153#false} is VALID [2018-11-14 17:07:01,454 INFO L273 TraceCheckUtils]: 83: Hoare triple {3153#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3153#false} is VALID [2018-11-14 17:07:01,454 INFO L273 TraceCheckUtils]: 84: Hoare triple {3153#false} assume !false; {3153#false} is VALID [2018-11-14 17:07:01,458 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 90 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-14 17:07:01,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:01,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-11-14 17:07:01,481 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-11-14 17:07:01,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:01,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 17:07:01,580 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:01,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 17:07:01,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 17:07:01,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:07:01,581 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 11 states. [2018-11-14 17:07:01,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:01,924 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2018-11-14 17:07:01,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 17:07:01,924 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-11-14 17:07:01,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:01,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:07:01,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2018-11-14 17:07:01,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:07:01,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2018-11-14 17:07:01,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 85 transitions. [2018-11-14 17:07:02,013 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:02,015 INFO L225 Difference]: With dead ends: 94 [2018-11-14 17:07:02,016 INFO L226 Difference]: Without dead ends: 64 [2018-11-14 17:07:02,016 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:07:02,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-14 17:07:02,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-11-14 17:07:02,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:02,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 62 states. [2018-11-14 17:07:02,040 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 62 states. [2018-11-14 17:07:02,040 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 62 states. [2018-11-14 17:07:02,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:02,042 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-14 17:07:02,043 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-14 17:07:02,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:02,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:02,043 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 64 states. [2018-11-14 17:07:02,043 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 64 states. [2018-11-14 17:07:02,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:02,045 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-14 17:07:02,045 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-14 17:07:02,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:02,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:02,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:02,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:02,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-14 17:07:02,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-11-14 17:07:02,048 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 85 [2018-11-14 17:07:02,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:02,048 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-11-14 17:07:02,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 17:07:02,049 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-11-14 17:07:02,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-14 17:07:02,050 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:02,050 INFO L375 BasicCegarLoop]: trace histogram [12, 9, 9, 8, 7, 7, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:07:02,050 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:02,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:02,051 INFO L82 PathProgramCache]: Analyzing trace with hash 318027935, now seen corresponding path program 7 times [2018-11-14 17:07:02,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:02,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:02,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:02,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:02,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:02,599 INFO L256 TraceCheckUtils]: 0: Hoare triple {3757#true} call ULTIMATE.init(); {3757#true} is VALID [2018-11-14 17:07:02,600 INFO L273 TraceCheckUtils]: 1: Hoare triple {3757#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3757#true} is VALID [2018-11-14 17:07:02,600 INFO L273 TraceCheckUtils]: 2: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:02,600 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3757#true} {3757#true} #69#return; {3757#true} is VALID [2018-11-14 17:07:02,600 INFO L256 TraceCheckUtils]: 4: Hoare triple {3757#true} call #t~ret13 := main(); {3757#true} is VALID [2018-11-14 17:07:02,601 INFO L273 TraceCheckUtils]: 5: Hoare triple {3757#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3759#(= main_~i~1 0)} is VALID [2018-11-14 17:07:02,601 INFO L273 TraceCheckUtils]: 6: Hoare triple {3759#(= main_~i~1 0)} assume true; {3759#(= main_~i~1 0)} is VALID [2018-11-14 17:07:02,602 INFO L273 TraceCheckUtils]: 7: Hoare triple {3759#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3759#(= main_~i~1 0)} is VALID [2018-11-14 17:07:02,602 INFO L273 TraceCheckUtils]: 8: Hoare triple {3759#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3760#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:02,603 INFO L273 TraceCheckUtils]: 9: Hoare triple {3760#(<= main_~i~1 1)} assume true; {3760#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:02,603 INFO L273 TraceCheckUtils]: 10: Hoare triple {3760#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3760#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:02,604 INFO L273 TraceCheckUtils]: 11: Hoare triple {3760#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3761#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:02,605 INFO L273 TraceCheckUtils]: 12: Hoare triple {3761#(<= main_~i~1 2)} assume true; {3761#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:02,605 INFO L273 TraceCheckUtils]: 13: Hoare triple {3761#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3761#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:02,606 INFO L273 TraceCheckUtils]: 14: Hoare triple {3761#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3762#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:02,606 INFO L273 TraceCheckUtils]: 15: Hoare triple {3762#(<= main_~i~1 3)} assume true; {3762#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:02,607 INFO L273 TraceCheckUtils]: 16: Hoare triple {3762#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3762#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:02,608 INFO L273 TraceCheckUtils]: 17: Hoare triple {3762#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3763#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:02,608 INFO L273 TraceCheckUtils]: 18: Hoare triple {3763#(<= main_~i~1 4)} assume true; {3763#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:02,609 INFO L273 TraceCheckUtils]: 19: Hoare triple {3763#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3763#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:02,609 INFO L273 TraceCheckUtils]: 20: Hoare triple {3763#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3764#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:02,610 INFO L273 TraceCheckUtils]: 21: Hoare triple {3764#(<= main_~i~1 5)} assume true; {3764#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:02,611 INFO L273 TraceCheckUtils]: 22: Hoare triple {3764#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3764#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:02,611 INFO L273 TraceCheckUtils]: 23: Hoare triple {3764#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3765#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:02,612 INFO L273 TraceCheckUtils]: 24: Hoare triple {3765#(<= main_~i~1 6)} assume true; {3765#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:02,612 INFO L273 TraceCheckUtils]: 25: Hoare triple {3765#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3765#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:02,613 INFO L273 TraceCheckUtils]: 26: Hoare triple {3765#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3766#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:02,614 INFO L273 TraceCheckUtils]: 27: Hoare triple {3766#(<= main_~i~1 7)} assume true; {3766#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:02,614 INFO L273 TraceCheckUtils]: 28: Hoare triple {3766#(<= main_~i~1 7)} assume !(~i~1 < 100); {3758#false} is VALID [2018-11-14 17:07:02,615 INFO L256 TraceCheckUtils]: 29: Hoare triple {3758#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {3757#true} is VALID [2018-11-14 17:07:02,615 INFO L273 TraceCheckUtils]: 30: Hoare triple {3757#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3757#true} is VALID [2018-11-14 17:07:02,615 INFO L273 TraceCheckUtils]: 31: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:02,615 INFO L273 TraceCheckUtils]: 32: Hoare triple {3757#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 17:07:02,615 INFO L273 TraceCheckUtils]: 33: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 17:07:02,616 INFO L273 TraceCheckUtils]: 34: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:02,616 INFO L273 TraceCheckUtils]: 35: Hoare triple {3757#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 17:07:02,616 INFO L273 TraceCheckUtils]: 36: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 17:07:02,616 INFO L273 TraceCheckUtils]: 37: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:02,617 INFO L273 TraceCheckUtils]: 38: Hoare triple {3757#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 17:07:02,617 INFO L273 TraceCheckUtils]: 39: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 17:07:02,617 INFO L273 TraceCheckUtils]: 40: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:02,617 INFO L273 TraceCheckUtils]: 41: Hoare triple {3757#true} assume !(~i~0 < 100); {3757#true} is VALID [2018-11-14 17:07:02,617 INFO L273 TraceCheckUtils]: 42: Hoare triple {3757#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3757#true} is VALID [2018-11-14 17:07:02,617 INFO L273 TraceCheckUtils]: 43: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:02,618 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {3757#true} {3758#false} #73#return; {3758#false} is VALID [2018-11-14 17:07:02,618 INFO L273 TraceCheckUtils]: 45: Hoare triple {3758#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {3758#false} is VALID [2018-11-14 17:07:02,618 INFO L256 TraceCheckUtils]: 46: Hoare triple {3758#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {3757#true} is VALID [2018-11-14 17:07:02,618 INFO L273 TraceCheckUtils]: 47: Hoare triple {3757#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3757#true} is VALID [2018-11-14 17:07:02,618 INFO L273 TraceCheckUtils]: 48: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:02,618 INFO L273 TraceCheckUtils]: 49: Hoare triple {3757#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 17:07:02,618 INFO L273 TraceCheckUtils]: 50: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 17:07:02,618 INFO L273 TraceCheckUtils]: 51: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:02,619 INFO L273 TraceCheckUtils]: 52: Hoare triple {3757#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 17:07:02,619 INFO L273 TraceCheckUtils]: 53: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 17:07:02,619 INFO L273 TraceCheckUtils]: 54: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:02,619 INFO L273 TraceCheckUtils]: 55: Hoare triple {3757#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 17:07:02,619 INFO L273 TraceCheckUtils]: 56: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 17:07:02,619 INFO L273 TraceCheckUtils]: 57: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:02,619 INFO L273 TraceCheckUtils]: 58: Hoare triple {3757#true} assume !(~i~0 < 100); {3757#true} is VALID [2018-11-14 17:07:02,619 INFO L273 TraceCheckUtils]: 59: Hoare triple {3757#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3757#true} is VALID [2018-11-14 17:07:02,620 INFO L273 TraceCheckUtils]: 60: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:02,620 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {3757#true} {3758#false} #75#return; {3758#false} is VALID [2018-11-14 17:07:02,620 INFO L273 TraceCheckUtils]: 62: Hoare triple {3758#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3758#false} is VALID [2018-11-14 17:07:02,620 INFO L273 TraceCheckUtils]: 63: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:02,620 INFO L273 TraceCheckUtils]: 64: Hoare triple {3758#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {3758#false} is VALID [2018-11-14 17:07:02,620 INFO L273 TraceCheckUtils]: 65: Hoare triple {3758#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {3758#false} is VALID [2018-11-14 17:07:02,620 INFO L273 TraceCheckUtils]: 66: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:02,620 INFO L273 TraceCheckUtils]: 67: Hoare triple {3758#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {3758#false} is VALID [2018-11-14 17:07:02,620 INFO L273 TraceCheckUtils]: 68: Hoare triple {3758#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {3758#false} is VALID [2018-11-14 17:07:02,621 INFO L273 TraceCheckUtils]: 69: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:02,621 INFO L273 TraceCheckUtils]: 70: Hoare triple {3758#false} assume !(~i~2 < 99); {3758#false} is VALID [2018-11-14 17:07:02,621 INFO L273 TraceCheckUtils]: 71: Hoare triple {3758#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {3758#false} is VALID [2018-11-14 17:07:02,621 INFO L256 TraceCheckUtils]: 72: Hoare triple {3758#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {3757#true} is VALID [2018-11-14 17:07:02,621 INFO L273 TraceCheckUtils]: 73: Hoare triple {3757#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3757#true} is VALID [2018-11-14 17:07:02,621 INFO L273 TraceCheckUtils]: 74: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:02,621 INFO L273 TraceCheckUtils]: 75: Hoare triple {3757#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 17:07:02,621 INFO L273 TraceCheckUtils]: 76: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 17:07:02,622 INFO L273 TraceCheckUtils]: 77: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:02,622 INFO L273 TraceCheckUtils]: 78: Hoare triple {3757#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 17:07:02,622 INFO L273 TraceCheckUtils]: 79: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 17:07:02,622 INFO L273 TraceCheckUtils]: 80: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:02,622 INFO L273 TraceCheckUtils]: 81: Hoare triple {3757#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 17:07:02,622 INFO L273 TraceCheckUtils]: 82: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 17:07:02,622 INFO L273 TraceCheckUtils]: 83: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:02,622 INFO L273 TraceCheckUtils]: 84: Hoare triple {3757#true} assume !(~i~0 < 100); {3757#true} is VALID [2018-11-14 17:07:02,623 INFO L273 TraceCheckUtils]: 85: Hoare triple {3757#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3757#true} is VALID [2018-11-14 17:07:02,623 INFO L273 TraceCheckUtils]: 86: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:02,623 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {3757#true} {3758#false} #77#return; {3758#false} is VALID [2018-11-14 17:07:02,623 INFO L273 TraceCheckUtils]: 88: Hoare triple {3758#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3758#false} is VALID [2018-11-14 17:07:02,623 INFO L273 TraceCheckUtils]: 89: Hoare triple {3758#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3758#false} is VALID [2018-11-14 17:07:02,623 INFO L273 TraceCheckUtils]: 90: Hoare triple {3758#false} assume !false; {3758#false} is VALID [2018-11-14 17:07:02,628 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-14 17:07:02,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:02,628 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:07:02,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:07:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:02,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:02,896 INFO L256 TraceCheckUtils]: 0: Hoare triple {3757#true} call ULTIMATE.init(); {3757#true} is VALID [2018-11-14 17:07:02,897 INFO L273 TraceCheckUtils]: 1: Hoare triple {3757#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3757#true} is VALID [2018-11-14 17:07:02,897 INFO L273 TraceCheckUtils]: 2: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:07:02,897 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3757#true} {3757#true} #69#return; {3757#true} is VALID [2018-11-14 17:07:02,898 INFO L256 TraceCheckUtils]: 4: Hoare triple {3757#true} call #t~ret13 := main(); {3757#true} is VALID [2018-11-14 17:07:02,899 INFO L273 TraceCheckUtils]: 5: Hoare triple {3757#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3785#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:02,899 INFO L273 TraceCheckUtils]: 6: Hoare triple {3785#(<= main_~i~1 0)} assume true; {3785#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:02,900 INFO L273 TraceCheckUtils]: 7: Hoare triple {3785#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3785#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:02,900 INFO L273 TraceCheckUtils]: 8: Hoare triple {3785#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3760#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:02,901 INFO L273 TraceCheckUtils]: 9: Hoare triple {3760#(<= main_~i~1 1)} assume true; {3760#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:02,901 INFO L273 TraceCheckUtils]: 10: Hoare triple {3760#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3760#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:02,902 INFO L273 TraceCheckUtils]: 11: Hoare triple {3760#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3761#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:02,902 INFO L273 TraceCheckUtils]: 12: Hoare triple {3761#(<= main_~i~1 2)} assume true; {3761#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:02,903 INFO L273 TraceCheckUtils]: 13: Hoare triple {3761#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3761#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:02,904 INFO L273 TraceCheckUtils]: 14: Hoare triple {3761#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3762#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:02,904 INFO L273 TraceCheckUtils]: 15: Hoare triple {3762#(<= main_~i~1 3)} assume true; {3762#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:02,905 INFO L273 TraceCheckUtils]: 16: Hoare triple {3762#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3762#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:02,906 INFO L273 TraceCheckUtils]: 17: Hoare triple {3762#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3763#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:02,907 INFO L273 TraceCheckUtils]: 18: Hoare triple {3763#(<= main_~i~1 4)} assume true; {3763#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:02,907 INFO L273 TraceCheckUtils]: 19: Hoare triple {3763#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3763#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:02,908 INFO L273 TraceCheckUtils]: 20: Hoare triple {3763#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3764#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:02,909 INFO L273 TraceCheckUtils]: 21: Hoare triple {3764#(<= main_~i~1 5)} assume true; {3764#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:02,910 INFO L273 TraceCheckUtils]: 22: Hoare triple {3764#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3764#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:02,911 INFO L273 TraceCheckUtils]: 23: Hoare triple {3764#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3765#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:02,911 INFO L273 TraceCheckUtils]: 24: Hoare triple {3765#(<= main_~i~1 6)} assume true; {3765#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:02,912 INFO L273 TraceCheckUtils]: 25: Hoare triple {3765#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3765#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:02,913 INFO L273 TraceCheckUtils]: 26: Hoare triple {3765#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3766#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:02,914 INFO L273 TraceCheckUtils]: 27: Hoare triple {3766#(<= main_~i~1 7)} assume true; {3766#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:02,915 INFO L273 TraceCheckUtils]: 28: Hoare triple {3766#(<= main_~i~1 7)} assume !(~i~1 < 100); {3758#false} is VALID [2018-11-14 17:07:02,915 INFO L256 TraceCheckUtils]: 29: Hoare triple {3758#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {3758#false} is VALID [2018-11-14 17:07:02,916 INFO L273 TraceCheckUtils]: 30: Hoare triple {3758#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3758#false} is VALID [2018-11-14 17:07:02,916 INFO L273 TraceCheckUtils]: 31: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:02,916 INFO L273 TraceCheckUtils]: 32: Hoare triple {3758#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 17:07:02,917 INFO L273 TraceCheckUtils]: 33: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 17:07:02,917 INFO L273 TraceCheckUtils]: 34: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:02,917 INFO L273 TraceCheckUtils]: 35: Hoare triple {3758#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 17:07:02,918 INFO L273 TraceCheckUtils]: 36: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 17:07:02,918 INFO L273 TraceCheckUtils]: 37: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:02,918 INFO L273 TraceCheckUtils]: 38: Hoare triple {3758#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 17:07:02,918 INFO L273 TraceCheckUtils]: 39: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 17:07:02,919 INFO L273 TraceCheckUtils]: 40: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:02,919 INFO L273 TraceCheckUtils]: 41: Hoare triple {3758#false} assume !(~i~0 < 100); {3758#false} is VALID [2018-11-14 17:07:02,919 INFO L273 TraceCheckUtils]: 42: Hoare triple {3758#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3758#false} is VALID [2018-11-14 17:07:02,919 INFO L273 TraceCheckUtils]: 43: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:02,919 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {3758#false} {3758#false} #73#return; {3758#false} is VALID [2018-11-14 17:07:02,920 INFO L273 TraceCheckUtils]: 45: Hoare triple {3758#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {3758#false} is VALID [2018-11-14 17:07:02,920 INFO L256 TraceCheckUtils]: 46: Hoare triple {3758#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {3758#false} is VALID [2018-11-14 17:07:02,920 INFO L273 TraceCheckUtils]: 47: Hoare triple {3758#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3758#false} is VALID [2018-11-14 17:07:02,920 INFO L273 TraceCheckUtils]: 48: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:02,920 INFO L273 TraceCheckUtils]: 49: Hoare triple {3758#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 17:07:02,921 INFO L273 TraceCheckUtils]: 50: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 17:07:02,921 INFO L273 TraceCheckUtils]: 51: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:02,921 INFO L273 TraceCheckUtils]: 52: Hoare triple {3758#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 17:07:02,921 INFO L273 TraceCheckUtils]: 53: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 17:07:02,921 INFO L273 TraceCheckUtils]: 54: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:02,922 INFO L273 TraceCheckUtils]: 55: Hoare triple {3758#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 17:07:02,922 INFO L273 TraceCheckUtils]: 56: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 17:07:02,922 INFO L273 TraceCheckUtils]: 57: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:02,922 INFO L273 TraceCheckUtils]: 58: Hoare triple {3758#false} assume !(~i~0 < 100); {3758#false} is VALID [2018-11-14 17:07:02,923 INFO L273 TraceCheckUtils]: 59: Hoare triple {3758#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3758#false} is VALID [2018-11-14 17:07:02,923 INFO L273 TraceCheckUtils]: 60: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:02,923 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {3758#false} {3758#false} #75#return; {3758#false} is VALID [2018-11-14 17:07:02,923 INFO L273 TraceCheckUtils]: 62: Hoare triple {3758#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3758#false} is VALID [2018-11-14 17:07:02,923 INFO L273 TraceCheckUtils]: 63: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:02,924 INFO L273 TraceCheckUtils]: 64: Hoare triple {3758#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {3758#false} is VALID [2018-11-14 17:07:02,924 INFO L273 TraceCheckUtils]: 65: Hoare triple {3758#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {3758#false} is VALID [2018-11-14 17:07:02,924 INFO L273 TraceCheckUtils]: 66: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:02,924 INFO L273 TraceCheckUtils]: 67: Hoare triple {3758#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {3758#false} is VALID [2018-11-14 17:07:02,924 INFO L273 TraceCheckUtils]: 68: Hoare triple {3758#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {3758#false} is VALID [2018-11-14 17:07:02,925 INFO L273 TraceCheckUtils]: 69: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:02,925 INFO L273 TraceCheckUtils]: 70: Hoare triple {3758#false} assume !(~i~2 < 99); {3758#false} is VALID [2018-11-14 17:07:02,925 INFO L273 TraceCheckUtils]: 71: Hoare triple {3758#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {3758#false} is VALID [2018-11-14 17:07:02,925 INFO L256 TraceCheckUtils]: 72: Hoare triple {3758#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {3758#false} is VALID [2018-11-14 17:07:02,925 INFO L273 TraceCheckUtils]: 73: Hoare triple {3758#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3758#false} is VALID [2018-11-14 17:07:02,926 INFO L273 TraceCheckUtils]: 74: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:02,926 INFO L273 TraceCheckUtils]: 75: Hoare triple {3758#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 17:07:02,926 INFO L273 TraceCheckUtils]: 76: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 17:07:02,926 INFO L273 TraceCheckUtils]: 77: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:02,926 INFO L273 TraceCheckUtils]: 78: Hoare triple {3758#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 17:07:02,927 INFO L273 TraceCheckUtils]: 79: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 17:07:02,927 INFO L273 TraceCheckUtils]: 80: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:02,927 INFO L273 TraceCheckUtils]: 81: Hoare triple {3758#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 17:07:02,927 INFO L273 TraceCheckUtils]: 82: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 17:07:02,927 INFO L273 TraceCheckUtils]: 83: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:02,928 INFO L273 TraceCheckUtils]: 84: Hoare triple {3758#false} assume !(~i~0 < 100); {3758#false} is VALID [2018-11-14 17:07:02,928 INFO L273 TraceCheckUtils]: 85: Hoare triple {3758#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3758#false} is VALID [2018-11-14 17:07:02,928 INFO L273 TraceCheckUtils]: 86: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:07:02,928 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {3758#false} {3758#false} #77#return; {3758#false} is VALID [2018-11-14 17:07:02,928 INFO L273 TraceCheckUtils]: 88: Hoare triple {3758#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3758#false} is VALID [2018-11-14 17:07:02,928 INFO L273 TraceCheckUtils]: 89: Hoare triple {3758#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3758#false} is VALID [2018-11-14 17:07:02,929 INFO L273 TraceCheckUtils]: 90: Hoare triple {3758#false} assume !false; {3758#false} is VALID [2018-11-14 17:07:02,932 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-14 17:07:02,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:02,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 17:07:02,954 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2018-11-14 17:07:02,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:02,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 17:07:03,021 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:03,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 17:07:03,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 17:07:03,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:07:03,022 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 11 states. [2018-11-14 17:07:03,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:03,468 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-11-14 17:07:03,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 17:07:03,468 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2018-11-14 17:07:03,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:03,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:07:03,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2018-11-14 17:07:03,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:07:03,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2018-11-14 17:07:03,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2018-11-14 17:07:03,547 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:03,549 INFO L225 Difference]: With dead ends: 99 [2018-11-14 17:07:03,549 INFO L226 Difference]: Without dead ends: 66 [2018-11-14 17:07:03,550 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:07:03,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-14 17:07:03,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-11-14 17:07:03,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:03,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 65 states. [2018-11-14 17:07:03,658 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 65 states. [2018-11-14 17:07:03,659 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 65 states. [2018-11-14 17:07:03,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:03,660 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-14 17:07:03,660 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-14 17:07:03,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:03,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:03,661 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 66 states. [2018-11-14 17:07:03,661 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 66 states. [2018-11-14 17:07:03,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:03,663 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-14 17:07:03,663 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-14 17:07:03,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:03,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:03,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:03,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:03,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-14 17:07:03,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-11-14 17:07:03,665 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 91 [2018-11-14 17:07:03,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:03,666 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-11-14 17:07:03,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 17:07:03,666 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-14 17:07:03,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-14 17:07:03,667 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:03,667 INFO L375 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 8, 8, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:07:03,667 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:03,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:03,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1006612453, now seen corresponding path program 8 times [2018-11-14 17:07:03,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:03,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:03,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:03,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:07:03,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:04,062 INFO L256 TraceCheckUtils]: 0: Hoare triple {4395#true} call ULTIMATE.init(); {4395#true} is VALID [2018-11-14 17:07:04,062 INFO L273 TraceCheckUtils]: 1: Hoare triple {4395#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4395#true} is VALID [2018-11-14 17:07:04,062 INFO L273 TraceCheckUtils]: 2: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:04,063 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4395#true} {4395#true} #69#return; {4395#true} is VALID [2018-11-14 17:07:04,063 INFO L256 TraceCheckUtils]: 4: Hoare triple {4395#true} call #t~ret13 := main(); {4395#true} is VALID [2018-11-14 17:07:04,063 INFO L273 TraceCheckUtils]: 5: Hoare triple {4395#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4397#(= main_~i~1 0)} is VALID [2018-11-14 17:07:04,064 INFO L273 TraceCheckUtils]: 6: Hoare triple {4397#(= main_~i~1 0)} assume true; {4397#(= main_~i~1 0)} is VALID [2018-11-14 17:07:04,064 INFO L273 TraceCheckUtils]: 7: Hoare triple {4397#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4397#(= main_~i~1 0)} is VALID [2018-11-14 17:07:04,066 INFO L273 TraceCheckUtils]: 8: Hoare triple {4397#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4398#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:04,066 INFO L273 TraceCheckUtils]: 9: Hoare triple {4398#(<= main_~i~1 1)} assume true; {4398#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:04,068 INFO L273 TraceCheckUtils]: 10: Hoare triple {4398#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4398#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:04,068 INFO L273 TraceCheckUtils]: 11: Hoare triple {4398#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4399#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:04,070 INFO L273 TraceCheckUtils]: 12: Hoare triple {4399#(<= main_~i~1 2)} assume true; {4399#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:04,070 INFO L273 TraceCheckUtils]: 13: Hoare triple {4399#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4399#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:04,072 INFO L273 TraceCheckUtils]: 14: Hoare triple {4399#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4400#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:04,072 INFO L273 TraceCheckUtils]: 15: Hoare triple {4400#(<= main_~i~1 3)} assume true; {4400#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:04,074 INFO L273 TraceCheckUtils]: 16: Hoare triple {4400#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4400#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:04,074 INFO L273 TraceCheckUtils]: 17: Hoare triple {4400#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4401#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:04,076 INFO L273 TraceCheckUtils]: 18: Hoare triple {4401#(<= main_~i~1 4)} assume true; {4401#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:04,076 INFO L273 TraceCheckUtils]: 19: Hoare triple {4401#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4401#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:04,078 INFO L273 TraceCheckUtils]: 20: Hoare triple {4401#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4402#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:04,078 INFO L273 TraceCheckUtils]: 21: Hoare triple {4402#(<= main_~i~1 5)} assume true; {4402#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:04,080 INFO L273 TraceCheckUtils]: 22: Hoare triple {4402#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4402#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:04,080 INFO L273 TraceCheckUtils]: 23: Hoare triple {4402#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4403#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:04,082 INFO L273 TraceCheckUtils]: 24: Hoare triple {4403#(<= main_~i~1 6)} assume true; {4403#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:04,082 INFO L273 TraceCheckUtils]: 25: Hoare triple {4403#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4403#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:04,084 INFO L273 TraceCheckUtils]: 26: Hoare triple {4403#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4404#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:04,084 INFO L273 TraceCheckUtils]: 27: Hoare triple {4404#(<= main_~i~1 7)} assume true; {4404#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:04,086 INFO L273 TraceCheckUtils]: 28: Hoare triple {4404#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4404#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:04,086 INFO L273 TraceCheckUtils]: 29: Hoare triple {4404#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4405#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:04,088 INFO L273 TraceCheckUtils]: 30: Hoare triple {4405#(<= main_~i~1 8)} assume true; {4405#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:04,088 INFO L273 TraceCheckUtils]: 31: Hoare triple {4405#(<= main_~i~1 8)} assume !(~i~1 < 100); {4396#false} is VALID [2018-11-14 17:07:04,088 INFO L256 TraceCheckUtils]: 32: Hoare triple {4396#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {4395#true} is VALID [2018-11-14 17:07:04,088 INFO L273 TraceCheckUtils]: 33: Hoare triple {4395#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4395#true} is VALID [2018-11-14 17:07:04,089 INFO L273 TraceCheckUtils]: 34: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:04,089 INFO L273 TraceCheckUtils]: 35: Hoare triple {4395#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 17:07:04,089 INFO L273 TraceCheckUtils]: 36: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 17:07:04,089 INFO L273 TraceCheckUtils]: 37: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:04,089 INFO L273 TraceCheckUtils]: 38: Hoare triple {4395#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 17:07:04,089 INFO L273 TraceCheckUtils]: 39: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 17:07:04,090 INFO L273 TraceCheckUtils]: 40: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:04,090 INFO L273 TraceCheckUtils]: 41: Hoare triple {4395#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 17:07:04,090 INFO L273 TraceCheckUtils]: 42: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 17:07:04,090 INFO L273 TraceCheckUtils]: 43: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:04,090 INFO L273 TraceCheckUtils]: 44: Hoare triple {4395#true} assume !(~i~0 < 100); {4395#true} is VALID [2018-11-14 17:07:04,091 INFO L273 TraceCheckUtils]: 45: Hoare triple {4395#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4395#true} is VALID [2018-11-14 17:07:04,091 INFO L273 TraceCheckUtils]: 46: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:04,091 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {4395#true} {4396#false} #73#return; {4396#false} is VALID [2018-11-14 17:07:04,091 INFO L273 TraceCheckUtils]: 48: Hoare triple {4396#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {4396#false} is VALID [2018-11-14 17:07:04,092 INFO L256 TraceCheckUtils]: 49: Hoare triple {4396#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {4395#true} is VALID [2018-11-14 17:07:04,092 INFO L273 TraceCheckUtils]: 50: Hoare triple {4395#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4395#true} is VALID [2018-11-14 17:07:04,092 INFO L273 TraceCheckUtils]: 51: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:04,092 INFO L273 TraceCheckUtils]: 52: Hoare triple {4395#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 17:07:04,092 INFO L273 TraceCheckUtils]: 53: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 17:07:04,093 INFO L273 TraceCheckUtils]: 54: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:04,093 INFO L273 TraceCheckUtils]: 55: Hoare triple {4395#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 17:07:04,093 INFO L273 TraceCheckUtils]: 56: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 17:07:04,093 INFO L273 TraceCheckUtils]: 57: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:04,093 INFO L273 TraceCheckUtils]: 58: Hoare triple {4395#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 17:07:04,093 INFO L273 TraceCheckUtils]: 59: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 17:07:04,093 INFO L273 TraceCheckUtils]: 60: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:04,094 INFO L273 TraceCheckUtils]: 61: Hoare triple {4395#true} assume !(~i~0 < 100); {4395#true} is VALID [2018-11-14 17:07:04,094 INFO L273 TraceCheckUtils]: 62: Hoare triple {4395#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4395#true} is VALID [2018-11-14 17:07:04,094 INFO L273 TraceCheckUtils]: 63: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:04,094 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {4395#true} {4396#false} #75#return; {4396#false} is VALID [2018-11-14 17:07:04,094 INFO L273 TraceCheckUtils]: 65: Hoare triple {4396#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {4396#false} is VALID [2018-11-14 17:07:04,094 INFO L273 TraceCheckUtils]: 66: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:04,095 INFO L273 TraceCheckUtils]: 67: Hoare triple {4396#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {4396#false} is VALID [2018-11-14 17:07:04,095 INFO L273 TraceCheckUtils]: 68: Hoare triple {4396#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {4396#false} is VALID [2018-11-14 17:07:04,095 INFO L273 TraceCheckUtils]: 69: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:04,095 INFO L273 TraceCheckUtils]: 70: Hoare triple {4396#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {4396#false} is VALID [2018-11-14 17:07:04,095 INFO L273 TraceCheckUtils]: 71: Hoare triple {4396#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {4396#false} is VALID [2018-11-14 17:07:04,095 INFO L273 TraceCheckUtils]: 72: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:04,096 INFO L273 TraceCheckUtils]: 73: Hoare triple {4396#false} assume !(~i~2 < 99); {4396#false} is VALID [2018-11-14 17:07:04,096 INFO L273 TraceCheckUtils]: 74: Hoare triple {4396#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {4396#false} is VALID [2018-11-14 17:07:04,096 INFO L256 TraceCheckUtils]: 75: Hoare triple {4396#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {4395#true} is VALID [2018-11-14 17:07:04,096 INFO L273 TraceCheckUtils]: 76: Hoare triple {4395#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4395#true} is VALID [2018-11-14 17:07:04,096 INFO L273 TraceCheckUtils]: 77: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:04,096 INFO L273 TraceCheckUtils]: 78: Hoare triple {4395#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 17:07:04,096 INFO L273 TraceCheckUtils]: 79: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 17:07:04,097 INFO L273 TraceCheckUtils]: 80: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:04,097 INFO L273 TraceCheckUtils]: 81: Hoare triple {4395#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 17:07:04,097 INFO L273 TraceCheckUtils]: 82: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 17:07:04,097 INFO L273 TraceCheckUtils]: 83: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:04,097 INFO L273 TraceCheckUtils]: 84: Hoare triple {4395#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 17:07:04,097 INFO L273 TraceCheckUtils]: 85: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 17:07:04,098 INFO L273 TraceCheckUtils]: 86: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:04,098 INFO L273 TraceCheckUtils]: 87: Hoare triple {4395#true} assume !(~i~0 < 100); {4395#true} is VALID [2018-11-14 17:07:04,098 INFO L273 TraceCheckUtils]: 88: Hoare triple {4395#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4395#true} is VALID [2018-11-14 17:07:04,098 INFO L273 TraceCheckUtils]: 89: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:04,098 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {4395#true} {4396#false} #77#return; {4396#false} is VALID [2018-11-14 17:07:04,098 INFO L273 TraceCheckUtils]: 91: Hoare triple {4396#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {4396#false} is VALID [2018-11-14 17:07:04,098 INFO L273 TraceCheckUtils]: 92: Hoare triple {4396#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {4396#false} is VALID [2018-11-14 17:07:04,099 INFO L273 TraceCheckUtils]: 93: Hoare triple {4396#false} assume !false; {4396#false} is VALID [2018-11-14 17:07:04,107 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-14 17:07:04,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:04,107 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:07:04,116 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:07:04,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:07:04,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:04,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:04,378 INFO L256 TraceCheckUtils]: 0: Hoare triple {4395#true} call ULTIMATE.init(); {4395#true} is VALID [2018-11-14 17:07:04,378 INFO L273 TraceCheckUtils]: 1: Hoare triple {4395#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4395#true} is VALID [2018-11-14 17:07:04,379 INFO L273 TraceCheckUtils]: 2: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:07:04,379 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4395#true} {4395#true} #69#return; {4395#true} is VALID [2018-11-14 17:07:04,379 INFO L256 TraceCheckUtils]: 4: Hoare triple {4395#true} call #t~ret13 := main(); {4395#true} is VALID [2018-11-14 17:07:04,380 INFO L273 TraceCheckUtils]: 5: Hoare triple {4395#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4424#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:04,381 INFO L273 TraceCheckUtils]: 6: Hoare triple {4424#(<= main_~i~1 0)} assume true; {4424#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:04,381 INFO L273 TraceCheckUtils]: 7: Hoare triple {4424#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4424#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:04,381 INFO L273 TraceCheckUtils]: 8: Hoare triple {4424#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4398#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:04,382 INFO L273 TraceCheckUtils]: 9: Hoare triple {4398#(<= main_~i~1 1)} assume true; {4398#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:04,382 INFO L273 TraceCheckUtils]: 10: Hoare triple {4398#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4398#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:04,383 INFO L273 TraceCheckUtils]: 11: Hoare triple {4398#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4399#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:04,383 INFO L273 TraceCheckUtils]: 12: Hoare triple {4399#(<= main_~i~1 2)} assume true; {4399#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:04,384 INFO L273 TraceCheckUtils]: 13: Hoare triple {4399#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4399#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:04,384 INFO L273 TraceCheckUtils]: 14: Hoare triple {4399#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4400#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:04,385 INFO L273 TraceCheckUtils]: 15: Hoare triple {4400#(<= main_~i~1 3)} assume true; {4400#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:04,386 INFO L273 TraceCheckUtils]: 16: Hoare triple {4400#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4400#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:04,386 INFO L273 TraceCheckUtils]: 17: Hoare triple {4400#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4401#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:04,387 INFO L273 TraceCheckUtils]: 18: Hoare triple {4401#(<= main_~i~1 4)} assume true; {4401#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:04,388 INFO L273 TraceCheckUtils]: 19: Hoare triple {4401#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4401#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:04,389 INFO L273 TraceCheckUtils]: 20: Hoare triple {4401#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4402#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:04,389 INFO L273 TraceCheckUtils]: 21: Hoare triple {4402#(<= main_~i~1 5)} assume true; {4402#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:04,390 INFO L273 TraceCheckUtils]: 22: Hoare triple {4402#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4402#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:04,391 INFO L273 TraceCheckUtils]: 23: Hoare triple {4402#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4403#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:04,391 INFO L273 TraceCheckUtils]: 24: Hoare triple {4403#(<= main_~i~1 6)} assume true; {4403#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:04,392 INFO L273 TraceCheckUtils]: 25: Hoare triple {4403#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4403#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:04,393 INFO L273 TraceCheckUtils]: 26: Hoare triple {4403#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4404#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:04,393 INFO L273 TraceCheckUtils]: 27: Hoare triple {4404#(<= main_~i~1 7)} assume true; {4404#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:04,394 INFO L273 TraceCheckUtils]: 28: Hoare triple {4404#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4404#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:04,395 INFO L273 TraceCheckUtils]: 29: Hoare triple {4404#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4405#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:04,395 INFO L273 TraceCheckUtils]: 30: Hoare triple {4405#(<= main_~i~1 8)} assume true; {4405#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:04,396 INFO L273 TraceCheckUtils]: 31: Hoare triple {4405#(<= main_~i~1 8)} assume !(~i~1 < 100); {4396#false} is VALID [2018-11-14 17:07:04,396 INFO L256 TraceCheckUtils]: 32: Hoare triple {4396#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {4396#false} is VALID [2018-11-14 17:07:04,397 INFO L273 TraceCheckUtils]: 33: Hoare triple {4396#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4396#false} is VALID [2018-11-14 17:07:04,397 INFO L273 TraceCheckUtils]: 34: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:04,397 INFO L273 TraceCheckUtils]: 35: Hoare triple {4396#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 17:07:04,397 INFO L273 TraceCheckUtils]: 36: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 17:07:04,398 INFO L273 TraceCheckUtils]: 37: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:04,398 INFO L273 TraceCheckUtils]: 38: Hoare triple {4396#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 17:07:04,398 INFO L273 TraceCheckUtils]: 39: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 17:07:04,398 INFO L273 TraceCheckUtils]: 40: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:04,399 INFO L273 TraceCheckUtils]: 41: Hoare triple {4396#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 17:07:04,399 INFO L273 TraceCheckUtils]: 42: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 17:07:04,399 INFO L273 TraceCheckUtils]: 43: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:04,399 INFO L273 TraceCheckUtils]: 44: Hoare triple {4396#false} assume !(~i~0 < 100); {4396#false} is VALID [2018-11-14 17:07:04,399 INFO L273 TraceCheckUtils]: 45: Hoare triple {4396#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4396#false} is VALID [2018-11-14 17:07:04,400 INFO L273 TraceCheckUtils]: 46: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:04,400 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {4396#false} {4396#false} #73#return; {4396#false} is VALID [2018-11-14 17:07:04,400 INFO L273 TraceCheckUtils]: 48: Hoare triple {4396#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {4396#false} is VALID [2018-11-14 17:07:04,400 INFO L256 TraceCheckUtils]: 49: Hoare triple {4396#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {4396#false} is VALID [2018-11-14 17:07:04,400 INFO L273 TraceCheckUtils]: 50: Hoare triple {4396#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4396#false} is VALID [2018-11-14 17:07:04,400 INFO L273 TraceCheckUtils]: 51: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:04,401 INFO L273 TraceCheckUtils]: 52: Hoare triple {4396#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 17:07:04,401 INFO L273 TraceCheckUtils]: 53: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 17:07:04,401 INFO L273 TraceCheckUtils]: 54: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:04,401 INFO L273 TraceCheckUtils]: 55: Hoare triple {4396#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 17:07:04,401 INFO L273 TraceCheckUtils]: 56: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 17:07:04,401 INFO L273 TraceCheckUtils]: 57: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:04,402 INFO L273 TraceCheckUtils]: 58: Hoare triple {4396#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 17:07:04,402 INFO L273 TraceCheckUtils]: 59: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 17:07:04,402 INFO L273 TraceCheckUtils]: 60: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:04,402 INFO L273 TraceCheckUtils]: 61: Hoare triple {4396#false} assume !(~i~0 < 100); {4396#false} is VALID [2018-11-14 17:07:04,402 INFO L273 TraceCheckUtils]: 62: Hoare triple {4396#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4396#false} is VALID [2018-11-14 17:07:04,402 INFO L273 TraceCheckUtils]: 63: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:04,403 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {4396#false} {4396#false} #75#return; {4396#false} is VALID [2018-11-14 17:07:04,403 INFO L273 TraceCheckUtils]: 65: Hoare triple {4396#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {4396#false} is VALID [2018-11-14 17:07:04,403 INFO L273 TraceCheckUtils]: 66: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:04,403 INFO L273 TraceCheckUtils]: 67: Hoare triple {4396#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {4396#false} is VALID [2018-11-14 17:07:04,403 INFO L273 TraceCheckUtils]: 68: Hoare triple {4396#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {4396#false} is VALID [2018-11-14 17:07:04,403 INFO L273 TraceCheckUtils]: 69: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:04,403 INFO L273 TraceCheckUtils]: 70: Hoare triple {4396#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {4396#false} is VALID [2018-11-14 17:07:04,404 INFO L273 TraceCheckUtils]: 71: Hoare triple {4396#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {4396#false} is VALID [2018-11-14 17:07:04,404 INFO L273 TraceCheckUtils]: 72: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:04,404 INFO L273 TraceCheckUtils]: 73: Hoare triple {4396#false} assume !(~i~2 < 99); {4396#false} is VALID [2018-11-14 17:07:04,404 INFO L273 TraceCheckUtils]: 74: Hoare triple {4396#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {4396#false} is VALID [2018-11-14 17:07:04,404 INFO L256 TraceCheckUtils]: 75: Hoare triple {4396#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {4396#false} is VALID [2018-11-14 17:07:04,404 INFO L273 TraceCheckUtils]: 76: Hoare triple {4396#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4396#false} is VALID [2018-11-14 17:07:04,405 INFO L273 TraceCheckUtils]: 77: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:04,405 INFO L273 TraceCheckUtils]: 78: Hoare triple {4396#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 17:07:04,405 INFO L273 TraceCheckUtils]: 79: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 17:07:04,405 INFO L273 TraceCheckUtils]: 80: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:04,405 INFO L273 TraceCheckUtils]: 81: Hoare triple {4396#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 17:07:04,405 INFO L273 TraceCheckUtils]: 82: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 17:07:04,406 INFO L273 TraceCheckUtils]: 83: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:04,406 INFO L273 TraceCheckUtils]: 84: Hoare triple {4396#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 17:07:04,406 INFO L273 TraceCheckUtils]: 85: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 17:07:04,406 INFO L273 TraceCheckUtils]: 86: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:04,406 INFO L273 TraceCheckUtils]: 87: Hoare triple {4396#false} assume !(~i~0 < 100); {4396#false} is VALID [2018-11-14 17:07:04,406 INFO L273 TraceCheckUtils]: 88: Hoare triple {4396#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4396#false} is VALID [2018-11-14 17:07:04,406 INFO L273 TraceCheckUtils]: 89: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:07:04,407 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {4396#false} {4396#false} #77#return; {4396#false} is VALID [2018-11-14 17:07:04,407 INFO L273 TraceCheckUtils]: 91: Hoare triple {4396#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {4396#false} is VALID [2018-11-14 17:07:04,407 INFO L273 TraceCheckUtils]: 92: Hoare triple {4396#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {4396#false} is VALID [2018-11-14 17:07:04,407 INFO L273 TraceCheckUtils]: 93: Hoare triple {4396#false} assume !false; {4396#false} is VALID [2018-11-14 17:07:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-14 17:07:04,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:04,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 17:07:04,437 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-11-14 17:07:04,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:04,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 17:07:04,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:04,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 17:07:04,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 17:07:04,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:07:04,551 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 12 states. [2018-11-14 17:07:04,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:04,912 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2018-11-14 17:07:04,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 17:07:04,912 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-11-14 17:07:04,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:04,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:07:04,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2018-11-14 17:07:04,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:07:04,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2018-11-14 17:07:04,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 84 transitions. [2018-11-14 17:07:05,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:05,087 INFO L225 Difference]: With dead ends: 102 [2018-11-14 17:07:05,087 INFO L226 Difference]: Without dead ends: 69 [2018-11-14 17:07:05,088 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:07:05,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-14 17:07:05,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-11-14 17:07:05,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:05,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 68 states. [2018-11-14 17:07:05,140 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 68 states. [2018-11-14 17:07:05,140 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 68 states. [2018-11-14 17:07:05,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:05,143 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-14 17:07:05,143 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-14 17:07:05,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:05,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:05,143 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 69 states. [2018-11-14 17:07:05,143 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 69 states. [2018-11-14 17:07:05,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:05,145 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-14 17:07:05,145 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-14 17:07:05,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:05,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:05,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:05,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:05,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-14 17:07:05,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-11-14 17:07:05,147 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 94 [2018-11-14 17:07:05,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:05,148 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-14 17:07:05,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 17:07:05,148 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-14 17:07:05,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-14 17:07:05,149 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:05,149 INFO L375 BasicCegarLoop]: trace histogram [12, 10, 9, 9, 9, 9, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:07:05,149 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:05,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:05,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1864182495, now seen corresponding path program 9 times [2018-11-14 17:07:05,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:05,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:05,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:05,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:05,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:05,624 INFO L256 TraceCheckUtils]: 0: Hoare triple {5057#true} call ULTIMATE.init(); {5057#true} is VALID [2018-11-14 17:07:05,625 INFO L273 TraceCheckUtils]: 1: Hoare triple {5057#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5057#true} is VALID [2018-11-14 17:07:05,625 INFO L273 TraceCheckUtils]: 2: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,625 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5057#true} {5057#true} #69#return; {5057#true} is VALID [2018-11-14 17:07:05,625 INFO L256 TraceCheckUtils]: 4: Hoare triple {5057#true} call #t~ret13 := main(); {5057#true} is VALID [2018-11-14 17:07:05,626 INFO L273 TraceCheckUtils]: 5: Hoare triple {5057#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5059#(= main_~i~1 0)} is VALID [2018-11-14 17:07:05,626 INFO L273 TraceCheckUtils]: 6: Hoare triple {5059#(= main_~i~1 0)} assume true; {5059#(= main_~i~1 0)} is VALID [2018-11-14 17:07:05,627 INFO L273 TraceCheckUtils]: 7: Hoare triple {5059#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5059#(= main_~i~1 0)} is VALID [2018-11-14 17:07:05,627 INFO L273 TraceCheckUtils]: 8: Hoare triple {5059#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5060#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:05,628 INFO L273 TraceCheckUtils]: 9: Hoare triple {5060#(<= main_~i~1 1)} assume true; {5060#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:05,628 INFO L273 TraceCheckUtils]: 10: Hoare triple {5060#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5060#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:05,629 INFO L273 TraceCheckUtils]: 11: Hoare triple {5060#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5061#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:05,629 INFO L273 TraceCheckUtils]: 12: Hoare triple {5061#(<= main_~i~1 2)} assume true; {5061#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:05,629 INFO L273 TraceCheckUtils]: 13: Hoare triple {5061#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5061#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:05,630 INFO L273 TraceCheckUtils]: 14: Hoare triple {5061#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5062#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:05,631 INFO L273 TraceCheckUtils]: 15: Hoare triple {5062#(<= main_~i~1 3)} assume true; {5062#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:05,631 INFO L273 TraceCheckUtils]: 16: Hoare triple {5062#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5062#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:05,632 INFO L273 TraceCheckUtils]: 17: Hoare triple {5062#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5063#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:05,633 INFO L273 TraceCheckUtils]: 18: Hoare triple {5063#(<= main_~i~1 4)} assume true; {5063#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:05,633 INFO L273 TraceCheckUtils]: 19: Hoare triple {5063#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5063#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:05,634 INFO L273 TraceCheckUtils]: 20: Hoare triple {5063#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5064#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:05,634 INFO L273 TraceCheckUtils]: 21: Hoare triple {5064#(<= main_~i~1 5)} assume true; {5064#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:05,635 INFO L273 TraceCheckUtils]: 22: Hoare triple {5064#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5064#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:05,636 INFO L273 TraceCheckUtils]: 23: Hoare triple {5064#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5065#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:05,636 INFO L273 TraceCheckUtils]: 24: Hoare triple {5065#(<= main_~i~1 6)} assume true; {5065#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:05,637 INFO L273 TraceCheckUtils]: 25: Hoare triple {5065#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5065#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:05,638 INFO L273 TraceCheckUtils]: 26: Hoare triple {5065#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5066#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:05,638 INFO L273 TraceCheckUtils]: 27: Hoare triple {5066#(<= main_~i~1 7)} assume true; {5066#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:05,639 INFO L273 TraceCheckUtils]: 28: Hoare triple {5066#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5066#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:05,639 INFO L273 TraceCheckUtils]: 29: Hoare triple {5066#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5067#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:05,640 INFO L273 TraceCheckUtils]: 30: Hoare triple {5067#(<= main_~i~1 8)} assume true; {5067#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:05,640 INFO L273 TraceCheckUtils]: 31: Hoare triple {5067#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5067#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:05,641 INFO L273 TraceCheckUtils]: 32: Hoare triple {5067#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5068#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:05,642 INFO L273 TraceCheckUtils]: 33: Hoare triple {5068#(<= main_~i~1 9)} assume true; {5068#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:05,642 INFO L273 TraceCheckUtils]: 34: Hoare triple {5068#(<= main_~i~1 9)} assume !(~i~1 < 100); {5058#false} is VALID [2018-11-14 17:07:05,643 INFO L256 TraceCheckUtils]: 35: Hoare triple {5058#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 17:07:05,643 INFO L273 TraceCheckUtils]: 36: Hoare triple {5057#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5057#true} is VALID [2018-11-14 17:07:05,643 INFO L273 TraceCheckUtils]: 37: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,643 INFO L273 TraceCheckUtils]: 38: Hoare triple {5057#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:05,644 INFO L273 TraceCheckUtils]: 39: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:07:05,644 INFO L273 TraceCheckUtils]: 40: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,644 INFO L273 TraceCheckUtils]: 41: Hoare triple {5057#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:05,644 INFO L273 TraceCheckUtils]: 42: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:07:05,644 INFO L273 TraceCheckUtils]: 43: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,645 INFO L273 TraceCheckUtils]: 44: Hoare triple {5057#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:05,645 INFO L273 TraceCheckUtils]: 45: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:07:05,645 INFO L273 TraceCheckUtils]: 46: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,645 INFO L273 TraceCheckUtils]: 47: Hoare triple {5057#true} assume !(~i~0 < 100); {5057#true} is VALID [2018-11-14 17:07:05,645 INFO L273 TraceCheckUtils]: 48: Hoare triple {5057#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5057#true} is VALID [2018-11-14 17:07:05,646 INFO L273 TraceCheckUtils]: 49: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,646 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {5057#true} {5058#false} #73#return; {5058#false} is VALID [2018-11-14 17:07:05,646 INFO L273 TraceCheckUtils]: 51: Hoare triple {5058#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {5058#false} is VALID [2018-11-14 17:07:05,646 INFO L256 TraceCheckUtils]: 52: Hoare triple {5058#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 17:07:05,646 INFO L273 TraceCheckUtils]: 53: Hoare triple {5057#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5057#true} is VALID [2018-11-14 17:07:05,646 INFO L273 TraceCheckUtils]: 54: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,647 INFO L273 TraceCheckUtils]: 55: Hoare triple {5057#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:05,647 INFO L273 TraceCheckUtils]: 56: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:07:05,647 INFO L273 TraceCheckUtils]: 57: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,647 INFO L273 TraceCheckUtils]: 58: Hoare triple {5057#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:05,647 INFO L273 TraceCheckUtils]: 59: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:07:05,648 INFO L273 TraceCheckUtils]: 60: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,648 INFO L273 TraceCheckUtils]: 61: Hoare triple {5057#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:05,648 INFO L273 TraceCheckUtils]: 62: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:07:05,648 INFO L273 TraceCheckUtils]: 63: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,648 INFO L273 TraceCheckUtils]: 64: Hoare triple {5057#true} assume !(~i~0 < 100); {5057#true} is VALID [2018-11-14 17:07:05,648 INFO L273 TraceCheckUtils]: 65: Hoare triple {5057#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5057#true} is VALID [2018-11-14 17:07:05,649 INFO L273 TraceCheckUtils]: 66: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,649 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {5057#true} {5058#false} #75#return; {5058#false} is VALID [2018-11-14 17:07:05,649 INFO L273 TraceCheckUtils]: 68: Hoare triple {5058#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {5058#false} is VALID [2018-11-14 17:07:05,649 INFO L273 TraceCheckUtils]: 69: Hoare triple {5058#false} assume true; {5058#false} is VALID [2018-11-14 17:07:05,649 INFO L273 TraceCheckUtils]: 70: Hoare triple {5058#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5058#false} is VALID [2018-11-14 17:07:05,649 INFO L273 TraceCheckUtils]: 71: Hoare triple {5058#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5058#false} is VALID [2018-11-14 17:07:05,650 INFO L273 TraceCheckUtils]: 72: Hoare triple {5058#false} assume true; {5058#false} is VALID [2018-11-14 17:07:05,650 INFO L273 TraceCheckUtils]: 73: Hoare triple {5058#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5058#false} is VALID [2018-11-14 17:07:05,650 INFO L273 TraceCheckUtils]: 74: Hoare triple {5058#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5058#false} is VALID [2018-11-14 17:07:05,650 INFO L273 TraceCheckUtils]: 75: Hoare triple {5058#false} assume true; {5058#false} is VALID [2018-11-14 17:07:05,650 INFO L273 TraceCheckUtils]: 76: Hoare triple {5058#false} assume !(~i~2 < 99); {5058#false} is VALID [2018-11-14 17:07:05,650 INFO L273 TraceCheckUtils]: 77: Hoare triple {5058#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {5058#false} is VALID [2018-11-14 17:07:05,651 INFO L256 TraceCheckUtils]: 78: Hoare triple {5058#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 17:07:05,651 INFO L273 TraceCheckUtils]: 79: Hoare triple {5057#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5057#true} is VALID [2018-11-14 17:07:05,651 INFO L273 TraceCheckUtils]: 80: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,651 INFO L273 TraceCheckUtils]: 81: Hoare triple {5057#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:05,651 INFO L273 TraceCheckUtils]: 82: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:07:05,651 INFO L273 TraceCheckUtils]: 83: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,652 INFO L273 TraceCheckUtils]: 84: Hoare triple {5057#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:05,652 INFO L273 TraceCheckUtils]: 85: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:07:05,652 INFO L273 TraceCheckUtils]: 86: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,652 INFO L273 TraceCheckUtils]: 87: Hoare triple {5057#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:05,652 INFO L273 TraceCheckUtils]: 88: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:07:05,652 INFO L273 TraceCheckUtils]: 89: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,653 INFO L273 TraceCheckUtils]: 90: Hoare triple {5057#true} assume !(~i~0 < 100); {5057#true} is VALID [2018-11-14 17:07:05,653 INFO L273 TraceCheckUtils]: 91: Hoare triple {5057#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5057#true} is VALID [2018-11-14 17:07:05,653 INFO L273 TraceCheckUtils]: 92: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,653 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {5057#true} {5058#false} #77#return; {5058#false} is VALID [2018-11-14 17:07:05,653 INFO L273 TraceCheckUtils]: 94: Hoare triple {5058#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5058#false} is VALID [2018-11-14 17:07:05,654 INFO L273 TraceCheckUtils]: 95: Hoare triple {5058#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5058#false} is VALID [2018-11-14 17:07:05,654 INFO L273 TraceCheckUtils]: 96: Hoare triple {5058#false} assume !false; {5058#false} is VALID [2018-11-14 17:07:05,659 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-14 17:07:05,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:05,660 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:07:05,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:07:05,703 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 17:07:05,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:05,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:05,849 INFO L256 TraceCheckUtils]: 0: Hoare triple {5057#true} call ULTIMATE.init(); {5057#true} is VALID [2018-11-14 17:07:05,850 INFO L273 TraceCheckUtils]: 1: Hoare triple {5057#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5057#true} is VALID [2018-11-14 17:07:05,850 INFO L273 TraceCheckUtils]: 2: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,850 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5057#true} {5057#true} #69#return; {5057#true} is VALID [2018-11-14 17:07:05,851 INFO L256 TraceCheckUtils]: 4: Hoare triple {5057#true} call #t~ret13 := main(); {5057#true} is VALID [2018-11-14 17:07:05,851 INFO L273 TraceCheckUtils]: 5: Hoare triple {5057#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5057#true} is VALID [2018-11-14 17:07:05,851 INFO L273 TraceCheckUtils]: 6: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,851 INFO L273 TraceCheckUtils]: 7: Hoare triple {5057#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 17:07:05,851 INFO L273 TraceCheckUtils]: 8: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 17:07:05,852 INFO L273 TraceCheckUtils]: 9: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,852 INFO L273 TraceCheckUtils]: 10: Hoare triple {5057#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 17:07:05,852 INFO L273 TraceCheckUtils]: 11: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 17:07:05,852 INFO L273 TraceCheckUtils]: 12: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,852 INFO L273 TraceCheckUtils]: 13: Hoare triple {5057#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 17:07:05,852 INFO L273 TraceCheckUtils]: 14: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 17:07:05,853 INFO L273 TraceCheckUtils]: 15: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,853 INFO L273 TraceCheckUtils]: 16: Hoare triple {5057#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 17:07:05,853 INFO L273 TraceCheckUtils]: 17: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 17:07:05,853 INFO L273 TraceCheckUtils]: 18: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,853 INFO L273 TraceCheckUtils]: 19: Hoare triple {5057#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 17:07:05,853 INFO L273 TraceCheckUtils]: 20: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 17:07:05,853 INFO L273 TraceCheckUtils]: 21: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,853 INFO L273 TraceCheckUtils]: 22: Hoare triple {5057#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 17:07:05,854 INFO L273 TraceCheckUtils]: 23: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 17:07:05,854 INFO L273 TraceCheckUtils]: 24: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,854 INFO L273 TraceCheckUtils]: 25: Hoare triple {5057#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 17:07:05,854 INFO L273 TraceCheckUtils]: 26: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 17:07:05,854 INFO L273 TraceCheckUtils]: 27: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,854 INFO L273 TraceCheckUtils]: 28: Hoare triple {5057#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 17:07:05,854 INFO L273 TraceCheckUtils]: 29: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 17:07:05,854 INFO L273 TraceCheckUtils]: 30: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,855 INFO L273 TraceCheckUtils]: 31: Hoare triple {5057#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 17:07:05,855 INFO L273 TraceCheckUtils]: 32: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 17:07:05,855 INFO L273 TraceCheckUtils]: 33: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,855 INFO L273 TraceCheckUtils]: 34: Hoare triple {5057#true} assume !(~i~1 < 100); {5057#true} is VALID [2018-11-14 17:07:05,855 INFO L256 TraceCheckUtils]: 35: Hoare triple {5057#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 17:07:05,855 INFO L273 TraceCheckUtils]: 36: Hoare triple {5057#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5057#true} is VALID [2018-11-14 17:07:05,855 INFO L273 TraceCheckUtils]: 37: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,855 INFO L273 TraceCheckUtils]: 38: Hoare triple {5057#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:05,855 INFO L273 TraceCheckUtils]: 39: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:07:05,856 INFO L273 TraceCheckUtils]: 40: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,856 INFO L273 TraceCheckUtils]: 41: Hoare triple {5057#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:05,856 INFO L273 TraceCheckUtils]: 42: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:07:05,856 INFO L273 TraceCheckUtils]: 43: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,856 INFO L273 TraceCheckUtils]: 44: Hoare triple {5057#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:05,856 INFO L273 TraceCheckUtils]: 45: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:07:05,856 INFO L273 TraceCheckUtils]: 46: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,856 INFO L273 TraceCheckUtils]: 47: Hoare triple {5057#true} assume !(~i~0 < 100); {5057#true} is VALID [2018-11-14 17:07:05,857 INFO L273 TraceCheckUtils]: 48: Hoare triple {5057#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5057#true} is VALID [2018-11-14 17:07:05,857 INFO L273 TraceCheckUtils]: 49: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,857 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {5057#true} {5057#true} #73#return; {5057#true} is VALID [2018-11-14 17:07:05,857 INFO L273 TraceCheckUtils]: 51: Hoare triple {5057#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {5057#true} is VALID [2018-11-14 17:07:05,857 INFO L256 TraceCheckUtils]: 52: Hoare triple {5057#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 17:07:05,857 INFO L273 TraceCheckUtils]: 53: Hoare triple {5057#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5057#true} is VALID [2018-11-14 17:07:05,857 INFO L273 TraceCheckUtils]: 54: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,857 INFO L273 TraceCheckUtils]: 55: Hoare triple {5057#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:05,858 INFO L273 TraceCheckUtils]: 56: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:07:05,858 INFO L273 TraceCheckUtils]: 57: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,858 INFO L273 TraceCheckUtils]: 58: Hoare triple {5057#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:05,858 INFO L273 TraceCheckUtils]: 59: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:07:05,858 INFO L273 TraceCheckUtils]: 60: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,858 INFO L273 TraceCheckUtils]: 61: Hoare triple {5057#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:07:05,858 INFO L273 TraceCheckUtils]: 62: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:07:05,858 INFO L273 TraceCheckUtils]: 63: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,859 INFO L273 TraceCheckUtils]: 64: Hoare triple {5057#true} assume !(~i~0 < 100); {5057#true} is VALID [2018-11-14 17:07:05,859 INFO L273 TraceCheckUtils]: 65: Hoare triple {5057#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5057#true} is VALID [2018-11-14 17:07:05,859 INFO L273 TraceCheckUtils]: 66: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,859 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {5057#true} {5057#true} #75#return; {5057#true} is VALID [2018-11-14 17:07:05,859 INFO L273 TraceCheckUtils]: 68: Hoare triple {5057#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {5057#true} is VALID [2018-11-14 17:07:05,859 INFO L273 TraceCheckUtils]: 69: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,859 INFO L273 TraceCheckUtils]: 70: Hoare triple {5057#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5057#true} is VALID [2018-11-14 17:07:05,859 INFO L273 TraceCheckUtils]: 71: Hoare triple {5057#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5057#true} is VALID [2018-11-14 17:07:05,860 INFO L273 TraceCheckUtils]: 72: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,860 INFO L273 TraceCheckUtils]: 73: Hoare triple {5057#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5057#true} is VALID [2018-11-14 17:07:05,860 INFO L273 TraceCheckUtils]: 74: Hoare triple {5057#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5057#true} is VALID [2018-11-14 17:07:05,860 INFO L273 TraceCheckUtils]: 75: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:07:05,860 INFO L273 TraceCheckUtils]: 76: Hoare triple {5057#true} assume !(~i~2 < 99); {5057#true} is VALID [2018-11-14 17:07:05,860 INFO L273 TraceCheckUtils]: 77: Hoare triple {5057#true} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {5057#true} is VALID [2018-11-14 17:07:05,860 INFO L256 TraceCheckUtils]: 78: Hoare triple {5057#true} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 17:07:05,861 INFO L273 TraceCheckUtils]: 79: Hoare triple {5057#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5309#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:07:05,861 INFO L273 TraceCheckUtils]: 80: Hoare triple {5309#(<= bAnd_~i~0 1)} assume true; {5309#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:07:05,862 INFO L273 TraceCheckUtils]: 81: Hoare triple {5309#(<= bAnd_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5309#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:07:05,862 INFO L273 TraceCheckUtils]: 82: Hoare triple {5309#(<= bAnd_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5319#(<= bAnd_~i~0 2)} is VALID [2018-11-14 17:07:05,862 INFO L273 TraceCheckUtils]: 83: Hoare triple {5319#(<= bAnd_~i~0 2)} assume true; {5319#(<= bAnd_~i~0 2)} is VALID [2018-11-14 17:07:05,863 INFO L273 TraceCheckUtils]: 84: Hoare triple {5319#(<= bAnd_~i~0 2)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5319#(<= bAnd_~i~0 2)} is VALID [2018-11-14 17:07:05,863 INFO L273 TraceCheckUtils]: 85: Hoare triple {5319#(<= bAnd_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5329#(<= bAnd_~i~0 3)} is VALID [2018-11-14 17:07:05,864 INFO L273 TraceCheckUtils]: 86: Hoare triple {5329#(<= bAnd_~i~0 3)} assume true; {5329#(<= bAnd_~i~0 3)} is VALID [2018-11-14 17:07:05,864 INFO L273 TraceCheckUtils]: 87: Hoare triple {5329#(<= bAnd_~i~0 3)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5329#(<= bAnd_~i~0 3)} is VALID [2018-11-14 17:07:05,864 INFO L273 TraceCheckUtils]: 88: Hoare triple {5329#(<= bAnd_~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5339#(<= bAnd_~i~0 4)} is VALID [2018-11-14 17:07:05,865 INFO L273 TraceCheckUtils]: 89: Hoare triple {5339#(<= bAnd_~i~0 4)} assume true; {5339#(<= bAnd_~i~0 4)} is VALID [2018-11-14 17:07:05,866 INFO L273 TraceCheckUtils]: 90: Hoare triple {5339#(<= bAnd_~i~0 4)} assume !(~i~0 < 100); {5058#false} is VALID [2018-11-14 17:07:05,866 INFO L273 TraceCheckUtils]: 91: Hoare triple {5058#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5058#false} is VALID [2018-11-14 17:07:05,866 INFO L273 TraceCheckUtils]: 92: Hoare triple {5058#false} assume true; {5058#false} is VALID [2018-11-14 17:07:05,866 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {5058#false} {5057#true} #77#return; {5058#false} is VALID [2018-11-14 17:07:05,866 INFO L273 TraceCheckUtils]: 94: Hoare triple {5058#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5058#false} is VALID [2018-11-14 17:07:05,867 INFO L273 TraceCheckUtils]: 95: Hoare triple {5058#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5058#false} is VALID [2018-11-14 17:07:05,867 INFO L273 TraceCheckUtils]: 96: Hoare triple {5058#false} assume !false; {5058#false} is VALID [2018-11-14 17:07:05,872 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 88 proven. 15 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-14 17:07:05,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:05,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 16 [2018-11-14 17:07:05,895 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 97 [2018-11-14 17:07:05,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:05,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 17:07:05,976 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:05,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 17:07:05,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 17:07:05,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:07:05,977 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 16 states. [2018-11-14 17:07:06,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:06,431 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-11-14 17:07:06,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 17:07:06,431 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 97 [2018-11-14 17:07:06,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:06,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:07:06,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 103 transitions. [2018-11-14 17:07:06,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:07:06,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 103 transitions. [2018-11-14 17:07:06,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 103 transitions. [2018-11-14 17:07:07,074 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:07,076 INFO L225 Difference]: With dead ends: 109 [2018-11-14 17:07:07,076 INFO L226 Difference]: Without dead ends: 76 [2018-11-14 17:07:07,077 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:07:07,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-14 17:07:07,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-11-14 17:07:07,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:07,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 74 states. [2018-11-14 17:07:07,619 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 74 states. [2018-11-14 17:07:07,619 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 74 states. [2018-11-14 17:07:07,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:07,621 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-14 17:07:07,621 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-14 17:07:07,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:07,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:07,622 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 76 states. [2018-11-14 17:07:07,622 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 76 states. [2018-11-14 17:07:07,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:07,624 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-14 17:07:07,624 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-14 17:07:07,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:07,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:07,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:07,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:07,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-14 17:07:07,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-11-14 17:07:07,628 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 97 [2018-11-14 17:07:07,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:07,628 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-11-14 17:07:07,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 17:07:07,628 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-11-14 17:07:07,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-14 17:07:07,630 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:07,630 INFO L375 BasicCegarLoop]: trace histogram [15, 12, 12, 11, 10, 10, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:07:07,630 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:07,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:07,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1090680019, now seen corresponding path program 10 times [2018-11-14 17:07:07,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:07,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:07,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:07,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:07,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:07,929 INFO L256 TraceCheckUtils]: 0: Hoare triple {5763#true} call ULTIMATE.init(); {5763#true} is VALID [2018-11-14 17:07:07,929 INFO L273 TraceCheckUtils]: 1: Hoare triple {5763#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5763#true} is VALID [2018-11-14 17:07:07,929 INFO L273 TraceCheckUtils]: 2: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:07,930 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5763#true} {5763#true} #69#return; {5763#true} is VALID [2018-11-14 17:07:07,930 INFO L256 TraceCheckUtils]: 4: Hoare triple {5763#true} call #t~ret13 := main(); {5763#true} is VALID [2018-11-14 17:07:07,931 INFO L273 TraceCheckUtils]: 5: Hoare triple {5763#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5765#(= main_~i~1 0)} is VALID [2018-11-14 17:07:07,931 INFO L273 TraceCheckUtils]: 6: Hoare triple {5765#(= main_~i~1 0)} assume true; {5765#(= main_~i~1 0)} is VALID [2018-11-14 17:07:07,932 INFO L273 TraceCheckUtils]: 7: Hoare triple {5765#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5765#(= main_~i~1 0)} is VALID [2018-11-14 17:07:07,932 INFO L273 TraceCheckUtils]: 8: Hoare triple {5765#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5766#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:07,933 INFO L273 TraceCheckUtils]: 9: Hoare triple {5766#(<= main_~i~1 1)} assume true; {5766#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:07,934 INFO L273 TraceCheckUtils]: 10: Hoare triple {5766#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5766#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:07,934 INFO L273 TraceCheckUtils]: 11: Hoare triple {5766#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5767#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:07,935 INFO L273 TraceCheckUtils]: 12: Hoare triple {5767#(<= main_~i~1 2)} assume true; {5767#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:07,935 INFO L273 TraceCheckUtils]: 13: Hoare triple {5767#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5767#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:07,939 INFO L273 TraceCheckUtils]: 14: Hoare triple {5767#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5768#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:07,939 INFO L273 TraceCheckUtils]: 15: Hoare triple {5768#(<= main_~i~1 3)} assume true; {5768#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:07,940 INFO L273 TraceCheckUtils]: 16: Hoare triple {5768#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5768#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:07,941 INFO L273 TraceCheckUtils]: 17: Hoare triple {5768#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5769#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:07,941 INFO L273 TraceCheckUtils]: 18: Hoare triple {5769#(<= main_~i~1 4)} assume true; {5769#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:07,941 INFO L273 TraceCheckUtils]: 19: Hoare triple {5769#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5769#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:07,942 INFO L273 TraceCheckUtils]: 20: Hoare triple {5769#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5770#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:07,942 INFO L273 TraceCheckUtils]: 21: Hoare triple {5770#(<= main_~i~1 5)} assume true; {5770#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:07,942 INFO L273 TraceCheckUtils]: 22: Hoare triple {5770#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5770#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:07,943 INFO L273 TraceCheckUtils]: 23: Hoare triple {5770#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5771#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:07,943 INFO L273 TraceCheckUtils]: 24: Hoare triple {5771#(<= main_~i~1 6)} assume true; {5771#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:07,943 INFO L273 TraceCheckUtils]: 25: Hoare triple {5771#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5771#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:07,944 INFO L273 TraceCheckUtils]: 26: Hoare triple {5771#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5772#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:07,945 INFO L273 TraceCheckUtils]: 27: Hoare triple {5772#(<= main_~i~1 7)} assume true; {5772#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:07,945 INFO L273 TraceCheckUtils]: 28: Hoare triple {5772#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5772#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:07,946 INFO L273 TraceCheckUtils]: 29: Hoare triple {5772#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5773#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:07,947 INFO L273 TraceCheckUtils]: 30: Hoare triple {5773#(<= main_~i~1 8)} assume true; {5773#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:07,947 INFO L273 TraceCheckUtils]: 31: Hoare triple {5773#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5773#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:07,948 INFO L273 TraceCheckUtils]: 32: Hoare triple {5773#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5774#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:07,948 INFO L273 TraceCheckUtils]: 33: Hoare triple {5774#(<= main_~i~1 9)} assume true; {5774#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:07,949 INFO L273 TraceCheckUtils]: 34: Hoare triple {5774#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5774#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:07,950 INFO L273 TraceCheckUtils]: 35: Hoare triple {5774#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5775#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:07,950 INFO L273 TraceCheckUtils]: 36: Hoare triple {5775#(<= main_~i~1 10)} assume true; {5775#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:07,951 INFO L273 TraceCheckUtils]: 37: Hoare triple {5775#(<= main_~i~1 10)} assume !(~i~1 < 100); {5764#false} is VALID [2018-11-14 17:07:07,951 INFO L256 TraceCheckUtils]: 38: Hoare triple {5764#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {5763#true} is VALID [2018-11-14 17:07:07,951 INFO L273 TraceCheckUtils]: 39: Hoare triple {5763#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5763#true} is VALID [2018-11-14 17:07:07,952 INFO L273 TraceCheckUtils]: 40: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:07,952 INFO L273 TraceCheckUtils]: 41: Hoare triple {5763#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:07:07,952 INFO L273 TraceCheckUtils]: 42: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 17:07:07,952 INFO L273 TraceCheckUtils]: 43: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:07,952 INFO L273 TraceCheckUtils]: 44: Hoare triple {5763#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:07:07,953 INFO L273 TraceCheckUtils]: 45: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 17:07:07,953 INFO L273 TraceCheckUtils]: 46: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:07,953 INFO L273 TraceCheckUtils]: 47: Hoare triple {5763#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:07:07,953 INFO L273 TraceCheckUtils]: 48: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 17:07:07,953 INFO L273 TraceCheckUtils]: 49: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:07,953 INFO L273 TraceCheckUtils]: 50: Hoare triple {5763#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:07:07,954 INFO L273 TraceCheckUtils]: 51: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 17:07:07,954 INFO L273 TraceCheckUtils]: 52: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:07,954 INFO L273 TraceCheckUtils]: 53: Hoare triple {5763#true} assume !(~i~0 < 100); {5763#true} is VALID [2018-11-14 17:07:07,954 INFO L273 TraceCheckUtils]: 54: Hoare triple {5763#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5763#true} is VALID [2018-11-14 17:07:07,954 INFO L273 TraceCheckUtils]: 55: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:07,954 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {5763#true} {5764#false} #73#return; {5764#false} is VALID [2018-11-14 17:07:07,955 INFO L273 TraceCheckUtils]: 57: Hoare triple {5764#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {5764#false} is VALID [2018-11-14 17:07:07,955 INFO L256 TraceCheckUtils]: 58: Hoare triple {5764#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {5763#true} is VALID [2018-11-14 17:07:07,955 INFO L273 TraceCheckUtils]: 59: Hoare triple {5763#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5763#true} is VALID [2018-11-14 17:07:07,955 INFO L273 TraceCheckUtils]: 60: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:07,955 INFO L273 TraceCheckUtils]: 61: Hoare triple {5763#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:07:07,955 INFO L273 TraceCheckUtils]: 62: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 17:07:07,956 INFO L273 TraceCheckUtils]: 63: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:07,956 INFO L273 TraceCheckUtils]: 64: Hoare triple {5763#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:07:07,956 INFO L273 TraceCheckUtils]: 65: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 17:07:07,956 INFO L273 TraceCheckUtils]: 66: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:07,956 INFO L273 TraceCheckUtils]: 67: Hoare triple {5763#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:07:07,956 INFO L273 TraceCheckUtils]: 68: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 17:07:07,957 INFO L273 TraceCheckUtils]: 69: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:07,957 INFO L273 TraceCheckUtils]: 70: Hoare triple {5763#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:07:07,957 INFO L273 TraceCheckUtils]: 71: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 17:07:07,957 INFO L273 TraceCheckUtils]: 72: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:07,957 INFO L273 TraceCheckUtils]: 73: Hoare triple {5763#true} assume !(~i~0 < 100); {5763#true} is VALID [2018-11-14 17:07:07,958 INFO L273 TraceCheckUtils]: 74: Hoare triple {5763#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5763#true} is VALID [2018-11-14 17:07:07,958 INFO L273 TraceCheckUtils]: 75: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:07,958 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {5763#true} {5764#false} #75#return; {5764#false} is VALID [2018-11-14 17:07:07,958 INFO L273 TraceCheckUtils]: 77: Hoare triple {5764#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {5764#false} is VALID [2018-11-14 17:07:07,958 INFO L273 TraceCheckUtils]: 78: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:07,959 INFO L273 TraceCheckUtils]: 79: Hoare triple {5764#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5764#false} is VALID [2018-11-14 17:07:07,959 INFO L273 TraceCheckUtils]: 80: Hoare triple {5764#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5764#false} is VALID [2018-11-14 17:07:07,959 INFO L273 TraceCheckUtils]: 81: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:07,959 INFO L273 TraceCheckUtils]: 82: Hoare triple {5764#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5764#false} is VALID [2018-11-14 17:07:07,959 INFO L273 TraceCheckUtils]: 83: Hoare triple {5764#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5764#false} is VALID [2018-11-14 17:07:07,959 INFO L273 TraceCheckUtils]: 84: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:07,960 INFO L273 TraceCheckUtils]: 85: Hoare triple {5764#false} assume !(~i~2 < 99); {5764#false} is VALID [2018-11-14 17:07:07,960 INFO L273 TraceCheckUtils]: 86: Hoare triple {5764#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {5764#false} is VALID [2018-11-14 17:07:07,960 INFO L256 TraceCheckUtils]: 87: Hoare triple {5764#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {5763#true} is VALID [2018-11-14 17:07:07,960 INFO L273 TraceCheckUtils]: 88: Hoare triple {5763#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5763#true} is VALID [2018-11-14 17:07:07,960 INFO L273 TraceCheckUtils]: 89: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:07,961 INFO L273 TraceCheckUtils]: 90: Hoare triple {5763#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:07:07,961 INFO L273 TraceCheckUtils]: 91: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 17:07:07,961 INFO L273 TraceCheckUtils]: 92: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:07,961 INFO L273 TraceCheckUtils]: 93: Hoare triple {5763#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:07:07,961 INFO L273 TraceCheckUtils]: 94: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 17:07:07,961 INFO L273 TraceCheckUtils]: 95: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:07,962 INFO L273 TraceCheckUtils]: 96: Hoare triple {5763#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:07:07,962 INFO L273 TraceCheckUtils]: 97: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 17:07:07,962 INFO L273 TraceCheckUtils]: 98: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:07,962 INFO L273 TraceCheckUtils]: 99: Hoare triple {5763#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:07:07,962 INFO L273 TraceCheckUtils]: 100: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 17:07:07,962 INFO L273 TraceCheckUtils]: 101: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:07,963 INFO L273 TraceCheckUtils]: 102: Hoare triple {5763#true} assume !(~i~0 < 100); {5763#true} is VALID [2018-11-14 17:07:07,963 INFO L273 TraceCheckUtils]: 103: Hoare triple {5763#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5763#true} is VALID [2018-11-14 17:07:07,963 INFO L273 TraceCheckUtils]: 104: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:07,963 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {5763#true} {5764#false} #77#return; {5764#false} is VALID [2018-11-14 17:07:07,963 INFO L273 TraceCheckUtils]: 106: Hoare triple {5764#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5764#false} is VALID [2018-11-14 17:07:07,963 INFO L273 TraceCheckUtils]: 107: Hoare triple {5764#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5764#false} is VALID [2018-11-14 17:07:07,964 INFO L273 TraceCheckUtils]: 108: Hoare triple {5764#false} assume !false; {5764#false} is VALID [2018-11-14 17:07:07,973 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-11-14 17:07:07,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:07,973 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:07:07,990 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:07:08,028 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:07:08,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:08,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:08,205 INFO L256 TraceCheckUtils]: 0: Hoare triple {5763#true} call ULTIMATE.init(); {5763#true} is VALID [2018-11-14 17:07:08,205 INFO L273 TraceCheckUtils]: 1: Hoare triple {5763#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5763#true} is VALID [2018-11-14 17:07:08,206 INFO L273 TraceCheckUtils]: 2: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:07:08,206 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5763#true} {5763#true} #69#return; {5763#true} is VALID [2018-11-14 17:07:08,206 INFO L256 TraceCheckUtils]: 4: Hoare triple {5763#true} call #t~ret13 := main(); {5763#true} is VALID [2018-11-14 17:07:08,207 INFO L273 TraceCheckUtils]: 5: Hoare triple {5763#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5794#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:08,207 INFO L273 TraceCheckUtils]: 6: Hoare triple {5794#(<= main_~i~1 0)} assume true; {5794#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:08,208 INFO L273 TraceCheckUtils]: 7: Hoare triple {5794#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5794#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:08,208 INFO L273 TraceCheckUtils]: 8: Hoare triple {5794#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5766#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:08,209 INFO L273 TraceCheckUtils]: 9: Hoare triple {5766#(<= main_~i~1 1)} assume true; {5766#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:08,209 INFO L273 TraceCheckUtils]: 10: Hoare triple {5766#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5766#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:08,209 INFO L273 TraceCheckUtils]: 11: Hoare triple {5766#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5767#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:08,210 INFO L273 TraceCheckUtils]: 12: Hoare triple {5767#(<= main_~i~1 2)} assume true; {5767#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:08,210 INFO L273 TraceCheckUtils]: 13: Hoare triple {5767#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5767#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:08,211 INFO L273 TraceCheckUtils]: 14: Hoare triple {5767#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5768#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:08,211 INFO L273 TraceCheckUtils]: 15: Hoare triple {5768#(<= main_~i~1 3)} assume true; {5768#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:08,212 INFO L273 TraceCheckUtils]: 16: Hoare triple {5768#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5768#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:08,212 INFO L273 TraceCheckUtils]: 17: Hoare triple {5768#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5769#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:08,213 INFO L273 TraceCheckUtils]: 18: Hoare triple {5769#(<= main_~i~1 4)} assume true; {5769#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:08,213 INFO L273 TraceCheckUtils]: 19: Hoare triple {5769#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5769#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:08,214 INFO L273 TraceCheckUtils]: 20: Hoare triple {5769#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5770#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:08,215 INFO L273 TraceCheckUtils]: 21: Hoare triple {5770#(<= main_~i~1 5)} assume true; {5770#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:08,215 INFO L273 TraceCheckUtils]: 22: Hoare triple {5770#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5770#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:08,216 INFO L273 TraceCheckUtils]: 23: Hoare triple {5770#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5771#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:08,217 INFO L273 TraceCheckUtils]: 24: Hoare triple {5771#(<= main_~i~1 6)} assume true; {5771#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:08,217 INFO L273 TraceCheckUtils]: 25: Hoare triple {5771#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5771#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:08,218 INFO L273 TraceCheckUtils]: 26: Hoare triple {5771#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5772#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:08,218 INFO L273 TraceCheckUtils]: 27: Hoare triple {5772#(<= main_~i~1 7)} assume true; {5772#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:08,219 INFO L273 TraceCheckUtils]: 28: Hoare triple {5772#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5772#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:08,220 INFO L273 TraceCheckUtils]: 29: Hoare triple {5772#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5773#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:08,220 INFO L273 TraceCheckUtils]: 30: Hoare triple {5773#(<= main_~i~1 8)} assume true; {5773#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:08,221 INFO L273 TraceCheckUtils]: 31: Hoare triple {5773#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5773#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:08,222 INFO L273 TraceCheckUtils]: 32: Hoare triple {5773#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5774#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:08,222 INFO L273 TraceCheckUtils]: 33: Hoare triple {5774#(<= main_~i~1 9)} assume true; {5774#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:08,223 INFO L273 TraceCheckUtils]: 34: Hoare triple {5774#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5774#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:08,223 INFO L273 TraceCheckUtils]: 35: Hoare triple {5774#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5775#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:08,224 INFO L273 TraceCheckUtils]: 36: Hoare triple {5775#(<= main_~i~1 10)} assume true; {5775#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:08,225 INFO L273 TraceCheckUtils]: 37: Hoare triple {5775#(<= main_~i~1 10)} assume !(~i~1 < 100); {5764#false} is VALID [2018-11-14 17:07:08,225 INFO L256 TraceCheckUtils]: 38: Hoare triple {5764#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {5764#false} is VALID [2018-11-14 17:07:08,225 INFO L273 TraceCheckUtils]: 39: Hoare triple {5764#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5764#false} is VALID [2018-11-14 17:07:08,225 INFO L273 TraceCheckUtils]: 40: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:08,226 INFO L273 TraceCheckUtils]: 41: Hoare triple {5764#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:07:08,226 INFO L273 TraceCheckUtils]: 42: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 17:07:08,226 INFO L273 TraceCheckUtils]: 43: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:08,226 INFO L273 TraceCheckUtils]: 44: Hoare triple {5764#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:07:08,226 INFO L273 TraceCheckUtils]: 45: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 17:07:08,227 INFO L273 TraceCheckUtils]: 46: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:08,227 INFO L273 TraceCheckUtils]: 47: Hoare triple {5764#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:07:08,227 INFO L273 TraceCheckUtils]: 48: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 17:07:08,227 INFO L273 TraceCheckUtils]: 49: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:08,228 INFO L273 TraceCheckUtils]: 50: Hoare triple {5764#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:07:08,228 INFO L273 TraceCheckUtils]: 51: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 17:07:08,228 INFO L273 TraceCheckUtils]: 52: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:08,229 INFO L273 TraceCheckUtils]: 53: Hoare triple {5764#false} assume !(~i~0 < 100); {5764#false} is VALID [2018-11-14 17:07:08,229 INFO L273 TraceCheckUtils]: 54: Hoare triple {5764#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5764#false} is VALID [2018-11-14 17:07:08,229 INFO L273 TraceCheckUtils]: 55: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:08,229 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {5764#false} {5764#false} #73#return; {5764#false} is VALID [2018-11-14 17:07:08,229 INFO L273 TraceCheckUtils]: 57: Hoare triple {5764#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {5764#false} is VALID [2018-11-14 17:07:08,229 INFO L256 TraceCheckUtils]: 58: Hoare triple {5764#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {5764#false} is VALID [2018-11-14 17:07:08,230 INFO L273 TraceCheckUtils]: 59: Hoare triple {5764#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5764#false} is VALID [2018-11-14 17:07:08,230 INFO L273 TraceCheckUtils]: 60: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:08,230 INFO L273 TraceCheckUtils]: 61: Hoare triple {5764#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:07:08,230 INFO L273 TraceCheckUtils]: 62: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 17:07:08,230 INFO L273 TraceCheckUtils]: 63: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:08,230 INFO L273 TraceCheckUtils]: 64: Hoare triple {5764#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:07:08,231 INFO L273 TraceCheckUtils]: 65: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 17:07:08,231 INFO L273 TraceCheckUtils]: 66: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:08,231 INFO L273 TraceCheckUtils]: 67: Hoare triple {5764#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:07:08,231 INFO L273 TraceCheckUtils]: 68: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 17:07:08,231 INFO L273 TraceCheckUtils]: 69: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:08,232 INFO L273 TraceCheckUtils]: 70: Hoare triple {5764#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:07:08,232 INFO L273 TraceCheckUtils]: 71: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 17:07:08,232 INFO L273 TraceCheckUtils]: 72: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:08,232 INFO L273 TraceCheckUtils]: 73: Hoare triple {5764#false} assume !(~i~0 < 100); {5764#false} is VALID [2018-11-14 17:07:08,232 INFO L273 TraceCheckUtils]: 74: Hoare triple {5764#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5764#false} is VALID [2018-11-14 17:07:08,232 INFO L273 TraceCheckUtils]: 75: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:08,232 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {5764#false} {5764#false} #75#return; {5764#false} is VALID [2018-11-14 17:07:08,233 INFO L273 TraceCheckUtils]: 77: Hoare triple {5764#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {5764#false} is VALID [2018-11-14 17:07:08,233 INFO L273 TraceCheckUtils]: 78: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:08,233 INFO L273 TraceCheckUtils]: 79: Hoare triple {5764#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5764#false} is VALID [2018-11-14 17:07:08,233 INFO L273 TraceCheckUtils]: 80: Hoare triple {5764#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5764#false} is VALID [2018-11-14 17:07:08,233 INFO L273 TraceCheckUtils]: 81: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:08,233 INFO L273 TraceCheckUtils]: 82: Hoare triple {5764#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5764#false} is VALID [2018-11-14 17:07:08,234 INFO L273 TraceCheckUtils]: 83: Hoare triple {5764#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5764#false} is VALID [2018-11-14 17:07:08,234 INFO L273 TraceCheckUtils]: 84: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:08,234 INFO L273 TraceCheckUtils]: 85: Hoare triple {5764#false} assume !(~i~2 < 99); {5764#false} is VALID [2018-11-14 17:07:08,234 INFO L273 TraceCheckUtils]: 86: Hoare triple {5764#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {5764#false} is VALID [2018-11-14 17:07:08,234 INFO L256 TraceCheckUtils]: 87: Hoare triple {5764#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {5764#false} is VALID [2018-11-14 17:07:08,234 INFO L273 TraceCheckUtils]: 88: Hoare triple {5764#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5764#false} is VALID [2018-11-14 17:07:08,235 INFO L273 TraceCheckUtils]: 89: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:08,235 INFO L273 TraceCheckUtils]: 90: Hoare triple {5764#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:07:08,235 INFO L273 TraceCheckUtils]: 91: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 17:07:08,235 INFO L273 TraceCheckUtils]: 92: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:08,235 INFO L273 TraceCheckUtils]: 93: Hoare triple {5764#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:07:08,235 INFO L273 TraceCheckUtils]: 94: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 17:07:08,236 INFO L273 TraceCheckUtils]: 95: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:08,236 INFO L273 TraceCheckUtils]: 96: Hoare triple {5764#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:07:08,236 INFO L273 TraceCheckUtils]: 97: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 17:07:08,236 INFO L273 TraceCheckUtils]: 98: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:08,236 INFO L273 TraceCheckUtils]: 99: Hoare triple {5764#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:07:08,236 INFO L273 TraceCheckUtils]: 100: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 17:07:08,237 INFO L273 TraceCheckUtils]: 101: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:08,237 INFO L273 TraceCheckUtils]: 102: Hoare triple {5764#false} assume !(~i~0 < 100); {5764#false} is VALID [2018-11-14 17:07:08,237 INFO L273 TraceCheckUtils]: 103: Hoare triple {5764#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5764#false} is VALID [2018-11-14 17:07:08,237 INFO L273 TraceCheckUtils]: 104: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:07:08,237 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {5764#false} {5764#false} #77#return; {5764#false} is VALID [2018-11-14 17:07:08,237 INFO L273 TraceCheckUtils]: 106: Hoare triple {5764#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5764#false} is VALID [2018-11-14 17:07:08,238 INFO L273 TraceCheckUtils]: 107: Hoare triple {5764#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5764#false} is VALID [2018-11-14 17:07:08,238 INFO L273 TraceCheckUtils]: 108: Hoare triple {5764#false} assume !false; {5764#false} is VALID [2018-11-14 17:07:08,244 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-11-14 17:07:08,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:08,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-14 17:07:08,266 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 109 [2018-11-14 17:07:08,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:08,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 17:07:08,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:08,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 17:07:08,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 17:07:08,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:07:08,343 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 14 states. [2018-11-14 17:07:08,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:08,696 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-11-14 17:07:08,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 17:07:08,697 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 109 [2018-11-14 17:07:08,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:08,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:07:08,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 90 transitions. [2018-11-14 17:07:08,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:07:08,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 90 transitions. [2018-11-14 17:07:08,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 90 transitions. [2018-11-14 17:07:09,097 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:09,099 INFO L225 Difference]: With dead ends: 114 [2018-11-14 17:07:09,099 INFO L226 Difference]: Without dead ends: 78 [2018-11-14 17:07:09,100 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:07:09,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-14 17:07:09,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-14 17:07:09,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:09,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-14 17:07:09,162 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-14 17:07:09,162 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-14 17:07:09,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:09,164 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-14 17:07:09,164 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-14 17:07:09,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:09,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:09,164 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-14 17:07:09,164 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-14 17:07:09,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:09,166 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-14 17:07:09,166 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-14 17:07:09,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:09,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:09,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:09,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:09,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-14 17:07:09,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-14 17:07:09,169 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 109 [2018-11-14 17:07:09,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:09,169 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-14 17:07:09,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 17:07:09,170 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-14 17:07:09,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-14 17:07:09,171 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:09,171 INFO L375 BasicCegarLoop]: trace histogram [15, 12, 12, 12, 11, 11, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:07:09,171 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:09,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:09,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1670093159, now seen corresponding path program 11 times [2018-11-14 17:07:09,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:09,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:09,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:09,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:09,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:10,629 INFO L256 TraceCheckUtils]: 0: Hoare triple {6518#true} call ULTIMATE.init(); {6518#true} is VALID [2018-11-14 17:07:10,629 INFO L273 TraceCheckUtils]: 1: Hoare triple {6518#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6518#true} is VALID [2018-11-14 17:07:10,630 INFO L273 TraceCheckUtils]: 2: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:10,630 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6518#true} {6518#true} #69#return; {6518#true} is VALID [2018-11-14 17:07:10,630 INFO L256 TraceCheckUtils]: 4: Hoare triple {6518#true} call #t~ret13 := main(); {6518#true} is VALID [2018-11-14 17:07:10,630 INFO L273 TraceCheckUtils]: 5: Hoare triple {6518#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {6520#(= main_~i~1 0)} is VALID [2018-11-14 17:07:10,631 INFO L273 TraceCheckUtils]: 6: Hoare triple {6520#(= main_~i~1 0)} assume true; {6520#(= main_~i~1 0)} is VALID [2018-11-14 17:07:10,631 INFO L273 TraceCheckUtils]: 7: Hoare triple {6520#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6520#(= main_~i~1 0)} is VALID [2018-11-14 17:07:10,632 INFO L273 TraceCheckUtils]: 8: Hoare triple {6520#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6521#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:10,632 INFO L273 TraceCheckUtils]: 9: Hoare triple {6521#(<= main_~i~1 1)} assume true; {6521#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:10,633 INFO L273 TraceCheckUtils]: 10: Hoare triple {6521#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6521#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:10,633 INFO L273 TraceCheckUtils]: 11: Hoare triple {6521#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6522#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:10,633 INFO L273 TraceCheckUtils]: 12: Hoare triple {6522#(<= main_~i~1 2)} assume true; {6522#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:10,634 INFO L273 TraceCheckUtils]: 13: Hoare triple {6522#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6522#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:10,634 INFO L273 TraceCheckUtils]: 14: Hoare triple {6522#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6523#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:10,635 INFO L273 TraceCheckUtils]: 15: Hoare triple {6523#(<= main_~i~1 3)} assume true; {6523#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:10,635 INFO L273 TraceCheckUtils]: 16: Hoare triple {6523#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6523#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:10,636 INFO L273 TraceCheckUtils]: 17: Hoare triple {6523#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6524#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:10,636 INFO L273 TraceCheckUtils]: 18: Hoare triple {6524#(<= main_~i~1 4)} assume true; {6524#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:10,637 INFO L273 TraceCheckUtils]: 19: Hoare triple {6524#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6524#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:10,638 INFO L273 TraceCheckUtils]: 20: Hoare triple {6524#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6525#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:10,638 INFO L273 TraceCheckUtils]: 21: Hoare triple {6525#(<= main_~i~1 5)} assume true; {6525#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:10,639 INFO L273 TraceCheckUtils]: 22: Hoare triple {6525#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6525#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:10,640 INFO L273 TraceCheckUtils]: 23: Hoare triple {6525#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6526#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:10,640 INFO L273 TraceCheckUtils]: 24: Hoare triple {6526#(<= main_~i~1 6)} assume true; {6526#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:10,641 INFO L273 TraceCheckUtils]: 25: Hoare triple {6526#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6526#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:10,641 INFO L273 TraceCheckUtils]: 26: Hoare triple {6526#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6527#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:10,642 INFO L273 TraceCheckUtils]: 27: Hoare triple {6527#(<= main_~i~1 7)} assume true; {6527#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:10,642 INFO L273 TraceCheckUtils]: 28: Hoare triple {6527#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6527#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:10,643 INFO L273 TraceCheckUtils]: 29: Hoare triple {6527#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6528#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:10,644 INFO L273 TraceCheckUtils]: 30: Hoare triple {6528#(<= main_~i~1 8)} assume true; {6528#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:10,644 INFO L273 TraceCheckUtils]: 31: Hoare triple {6528#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6528#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:10,645 INFO L273 TraceCheckUtils]: 32: Hoare triple {6528#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6529#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:10,645 INFO L273 TraceCheckUtils]: 33: Hoare triple {6529#(<= main_~i~1 9)} assume true; {6529#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:10,646 INFO L273 TraceCheckUtils]: 34: Hoare triple {6529#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6529#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:10,647 INFO L273 TraceCheckUtils]: 35: Hoare triple {6529#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6530#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:10,647 INFO L273 TraceCheckUtils]: 36: Hoare triple {6530#(<= main_~i~1 10)} assume true; {6530#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:10,648 INFO L273 TraceCheckUtils]: 37: Hoare triple {6530#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6530#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:10,649 INFO L273 TraceCheckUtils]: 38: Hoare triple {6530#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6531#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:10,649 INFO L273 TraceCheckUtils]: 39: Hoare triple {6531#(<= main_~i~1 11)} assume true; {6531#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:10,650 INFO L273 TraceCheckUtils]: 40: Hoare triple {6531#(<= main_~i~1 11)} assume !(~i~1 < 100); {6519#false} is VALID [2018-11-14 17:07:10,650 INFO L256 TraceCheckUtils]: 41: Hoare triple {6519#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {6518#true} is VALID [2018-11-14 17:07:10,650 INFO L273 TraceCheckUtils]: 42: Hoare triple {6518#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6518#true} is VALID [2018-11-14 17:07:10,650 INFO L273 TraceCheckUtils]: 43: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:10,651 INFO L273 TraceCheckUtils]: 44: Hoare triple {6518#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:07:10,651 INFO L273 TraceCheckUtils]: 45: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 17:07:10,651 INFO L273 TraceCheckUtils]: 46: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:10,651 INFO L273 TraceCheckUtils]: 47: Hoare triple {6518#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:07:10,652 INFO L273 TraceCheckUtils]: 48: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 17:07:10,652 INFO L273 TraceCheckUtils]: 49: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:10,652 INFO L273 TraceCheckUtils]: 50: Hoare triple {6518#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:07:10,652 INFO L273 TraceCheckUtils]: 51: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 17:07:10,652 INFO L273 TraceCheckUtils]: 52: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:10,652 INFO L273 TraceCheckUtils]: 53: Hoare triple {6518#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:07:10,653 INFO L273 TraceCheckUtils]: 54: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 17:07:10,653 INFO L273 TraceCheckUtils]: 55: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:10,653 INFO L273 TraceCheckUtils]: 56: Hoare triple {6518#true} assume !(~i~0 < 100); {6518#true} is VALID [2018-11-14 17:07:10,653 INFO L273 TraceCheckUtils]: 57: Hoare triple {6518#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6518#true} is VALID [2018-11-14 17:07:10,654 INFO L273 TraceCheckUtils]: 58: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:10,654 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {6518#true} {6519#false} #73#return; {6519#false} is VALID [2018-11-14 17:07:10,654 INFO L273 TraceCheckUtils]: 60: Hoare triple {6519#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {6519#false} is VALID [2018-11-14 17:07:10,654 INFO L256 TraceCheckUtils]: 61: Hoare triple {6519#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {6518#true} is VALID [2018-11-14 17:07:10,654 INFO L273 TraceCheckUtils]: 62: Hoare triple {6518#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6518#true} is VALID [2018-11-14 17:07:10,654 INFO L273 TraceCheckUtils]: 63: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:10,655 INFO L273 TraceCheckUtils]: 64: Hoare triple {6518#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:07:10,655 INFO L273 TraceCheckUtils]: 65: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 17:07:10,655 INFO L273 TraceCheckUtils]: 66: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:10,655 INFO L273 TraceCheckUtils]: 67: Hoare triple {6518#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:07:10,655 INFO L273 TraceCheckUtils]: 68: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 17:07:10,655 INFO L273 TraceCheckUtils]: 69: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:10,655 INFO L273 TraceCheckUtils]: 70: Hoare triple {6518#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:07:10,655 INFO L273 TraceCheckUtils]: 71: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 17:07:10,655 INFO L273 TraceCheckUtils]: 72: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:10,656 INFO L273 TraceCheckUtils]: 73: Hoare triple {6518#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:07:10,656 INFO L273 TraceCheckUtils]: 74: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 17:07:10,656 INFO L273 TraceCheckUtils]: 75: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:10,656 INFO L273 TraceCheckUtils]: 76: Hoare triple {6518#true} assume !(~i~0 < 100); {6518#true} is VALID [2018-11-14 17:07:10,656 INFO L273 TraceCheckUtils]: 77: Hoare triple {6518#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6518#true} is VALID [2018-11-14 17:07:10,656 INFO L273 TraceCheckUtils]: 78: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:10,656 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {6518#true} {6519#false} #75#return; {6519#false} is VALID [2018-11-14 17:07:10,656 INFO L273 TraceCheckUtils]: 80: Hoare triple {6519#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {6519#false} is VALID [2018-11-14 17:07:10,657 INFO L273 TraceCheckUtils]: 81: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:10,657 INFO L273 TraceCheckUtils]: 82: Hoare triple {6519#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {6519#false} is VALID [2018-11-14 17:07:10,657 INFO L273 TraceCheckUtils]: 83: Hoare triple {6519#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {6519#false} is VALID [2018-11-14 17:07:10,657 INFO L273 TraceCheckUtils]: 84: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:10,657 INFO L273 TraceCheckUtils]: 85: Hoare triple {6519#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {6519#false} is VALID [2018-11-14 17:07:10,657 INFO L273 TraceCheckUtils]: 86: Hoare triple {6519#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {6519#false} is VALID [2018-11-14 17:07:10,657 INFO L273 TraceCheckUtils]: 87: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:10,657 INFO L273 TraceCheckUtils]: 88: Hoare triple {6519#false} assume !(~i~2 < 99); {6519#false} is VALID [2018-11-14 17:07:10,657 INFO L273 TraceCheckUtils]: 89: Hoare triple {6519#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {6519#false} is VALID [2018-11-14 17:07:10,658 INFO L256 TraceCheckUtils]: 90: Hoare triple {6519#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {6518#true} is VALID [2018-11-14 17:07:10,658 INFO L273 TraceCheckUtils]: 91: Hoare triple {6518#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6518#true} is VALID [2018-11-14 17:07:10,658 INFO L273 TraceCheckUtils]: 92: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:10,658 INFO L273 TraceCheckUtils]: 93: Hoare triple {6518#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:07:10,658 INFO L273 TraceCheckUtils]: 94: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 17:07:10,658 INFO L273 TraceCheckUtils]: 95: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:10,658 INFO L273 TraceCheckUtils]: 96: Hoare triple {6518#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:07:10,658 INFO L273 TraceCheckUtils]: 97: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 17:07:10,659 INFO L273 TraceCheckUtils]: 98: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:10,659 INFO L273 TraceCheckUtils]: 99: Hoare triple {6518#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:07:10,659 INFO L273 TraceCheckUtils]: 100: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 17:07:10,659 INFO L273 TraceCheckUtils]: 101: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:10,659 INFO L273 TraceCheckUtils]: 102: Hoare triple {6518#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:07:10,659 INFO L273 TraceCheckUtils]: 103: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 17:07:10,659 INFO L273 TraceCheckUtils]: 104: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:10,659 INFO L273 TraceCheckUtils]: 105: Hoare triple {6518#true} assume !(~i~0 < 100); {6518#true} is VALID [2018-11-14 17:07:10,659 INFO L273 TraceCheckUtils]: 106: Hoare triple {6518#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6518#true} is VALID [2018-11-14 17:07:10,660 INFO L273 TraceCheckUtils]: 107: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:10,660 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {6518#true} {6519#false} #77#return; {6519#false} is VALID [2018-11-14 17:07:10,660 INFO L273 TraceCheckUtils]: 109: Hoare triple {6519#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {6519#false} is VALID [2018-11-14 17:07:10,660 INFO L273 TraceCheckUtils]: 110: Hoare triple {6519#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {6519#false} is VALID [2018-11-14 17:07:10,660 INFO L273 TraceCheckUtils]: 111: Hoare triple {6519#false} assume !false; {6519#false} is VALID [2018-11-14 17:07:10,666 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-11-14 17:07:10,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:10,666 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:07:10,675 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:07:10,898 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-14 17:07:10,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:10,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:11,085 INFO L256 TraceCheckUtils]: 0: Hoare triple {6518#true} call ULTIMATE.init(); {6518#true} is VALID [2018-11-14 17:07:11,086 INFO L273 TraceCheckUtils]: 1: Hoare triple {6518#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6518#true} is VALID [2018-11-14 17:07:11,086 INFO L273 TraceCheckUtils]: 2: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:11,086 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6518#true} {6518#true} #69#return; {6518#true} is VALID [2018-11-14 17:07:11,086 INFO L256 TraceCheckUtils]: 4: Hoare triple {6518#true} call #t~ret13 := main(); {6518#true} is VALID [2018-11-14 17:07:11,087 INFO L273 TraceCheckUtils]: 5: Hoare triple {6518#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {6518#true} is VALID [2018-11-14 17:07:11,087 INFO L273 TraceCheckUtils]: 6: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:11,087 INFO L273 TraceCheckUtils]: 7: Hoare triple {6518#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 17:07:11,087 INFO L273 TraceCheckUtils]: 8: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 17:07:11,087 INFO L273 TraceCheckUtils]: 9: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:11,088 INFO L273 TraceCheckUtils]: 10: Hoare triple {6518#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 17:07:11,088 INFO L273 TraceCheckUtils]: 11: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 17:07:11,088 INFO L273 TraceCheckUtils]: 12: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:11,088 INFO L273 TraceCheckUtils]: 13: Hoare triple {6518#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 17:07:11,088 INFO L273 TraceCheckUtils]: 14: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 17:07:11,088 INFO L273 TraceCheckUtils]: 15: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:11,089 INFO L273 TraceCheckUtils]: 16: Hoare triple {6518#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 17:07:11,089 INFO L273 TraceCheckUtils]: 17: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 17:07:11,089 INFO L273 TraceCheckUtils]: 18: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:11,089 INFO L273 TraceCheckUtils]: 19: Hoare triple {6518#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 17:07:11,089 INFO L273 TraceCheckUtils]: 20: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 17:07:11,090 INFO L273 TraceCheckUtils]: 21: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:11,090 INFO L273 TraceCheckUtils]: 22: Hoare triple {6518#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 17:07:11,090 INFO L273 TraceCheckUtils]: 23: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 17:07:11,090 INFO L273 TraceCheckUtils]: 24: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:11,090 INFO L273 TraceCheckUtils]: 25: Hoare triple {6518#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 17:07:11,090 INFO L273 TraceCheckUtils]: 26: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 17:07:11,091 INFO L273 TraceCheckUtils]: 27: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:11,091 INFO L273 TraceCheckUtils]: 28: Hoare triple {6518#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 17:07:11,091 INFO L273 TraceCheckUtils]: 29: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 17:07:11,091 INFO L273 TraceCheckUtils]: 30: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:11,091 INFO L273 TraceCheckUtils]: 31: Hoare triple {6518#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 17:07:11,091 INFO L273 TraceCheckUtils]: 32: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 17:07:11,092 INFO L273 TraceCheckUtils]: 33: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:11,092 INFO L273 TraceCheckUtils]: 34: Hoare triple {6518#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 17:07:11,092 INFO L273 TraceCheckUtils]: 35: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 17:07:11,092 INFO L273 TraceCheckUtils]: 36: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:11,092 INFO L273 TraceCheckUtils]: 37: Hoare triple {6518#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 17:07:11,093 INFO L273 TraceCheckUtils]: 38: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 17:07:11,093 INFO L273 TraceCheckUtils]: 39: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:07:11,093 INFO L273 TraceCheckUtils]: 40: Hoare triple {6518#true} assume !(~i~1 < 100); {6518#true} is VALID [2018-11-14 17:07:11,093 INFO L256 TraceCheckUtils]: 41: Hoare triple {6518#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {6518#true} is VALID [2018-11-14 17:07:11,109 INFO L273 TraceCheckUtils]: 42: Hoare triple {6518#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6661#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:07:11,118 INFO L273 TraceCheckUtils]: 43: Hoare triple {6661#(<= bAnd_~i~0 1)} assume true; {6661#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:07:11,131 INFO L273 TraceCheckUtils]: 44: Hoare triple {6661#(<= bAnd_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6661#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:07:11,140 INFO L273 TraceCheckUtils]: 45: Hoare triple {6661#(<= bAnd_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6671#(<= bAnd_~i~0 2)} is VALID [2018-11-14 17:07:11,149 INFO L273 TraceCheckUtils]: 46: Hoare triple {6671#(<= bAnd_~i~0 2)} assume true; {6671#(<= bAnd_~i~0 2)} is VALID [2018-11-14 17:07:11,150 INFO L273 TraceCheckUtils]: 47: Hoare triple {6671#(<= bAnd_~i~0 2)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6671#(<= bAnd_~i~0 2)} is VALID [2018-11-14 17:07:11,155 INFO L273 TraceCheckUtils]: 48: Hoare triple {6671#(<= bAnd_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6681#(<= bAnd_~i~0 3)} is VALID [2018-11-14 17:07:11,155 INFO L273 TraceCheckUtils]: 49: Hoare triple {6681#(<= bAnd_~i~0 3)} assume true; {6681#(<= bAnd_~i~0 3)} is VALID [2018-11-14 17:07:11,158 INFO L273 TraceCheckUtils]: 50: Hoare triple {6681#(<= bAnd_~i~0 3)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6681#(<= bAnd_~i~0 3)} is VALID [2018-11-14 17:07:11,158 INFO L273 TraceCheckUtils]: 51: Hoare triple {6681#(<= bAnd_~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6691#(<= bAnd_~i~0 4)} is VALID [2018-11-14 17:07:11,158 INFO L273 TraceCheckUtils]: 52: Hoare triple {6691#(<= bAnd_~i~0 4)} assume true; {6691#(<= bAnd_~i~0 4)} is VALID [2018-11-14 17:07:11,159 INFO L273 TraceCheckUtils]: 53: Hoare triple {6691#(<= bAnd_~i~0 4)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6691#(<= bAnd_~i~0 4)} is VALID [2018-11-14 17:07:11,159 INFO L273 TraceCheckUtils]: 54: Hoare triple {6691#(<= bAnd_~i~0 4)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6701#(<= bAnd_~i~0 5)} is VALID [2018-11-14 17:07:11,160 INFO L273 TraceCheckUtils]: 55: Hoare triple {6701#(<= bAnd_~i~0 5)} assume true; {6701#(<= bAnd_~i~0 5)} is VALID [2018-11-14 17:07:11,160 INFO L273 TraceCheckUtils]: 56: Hoare triple {6701#(<= bAnd_~i~0 5)} assume !(~i~0 < 100); {6519#false} is VALID [2018-11-14 17:07:11,160 INFO L273 TraceCheckUtils]: 57: Hoare triple {6519#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6519#false} is VALID [2018-11-14 17:07:11,160 INFO L273 TraceCheckUtils]: 58: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:11,160 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {6519#false} {6518#true} #73#return; {6519#false} is VALID [2018-11-14 17:07:11,160 INFO L273 TraceCheckUtils]: 60: Hoare triple {6519#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {6519#false} is VALID [2018-11-14 17:07:11,161 INFO L256 TraceCheckUtils]: 61: Hoare triple {6519#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {6519#false} is VALID [2018-11-14 17:07:11,161 INFO L273 TraceCheckUtils]: 62: Hoare triple {6519#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6519#false} is VALID [2018-11-14 17:07:11,161 INFO L273 TraceCheckUtils]: 63: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:11,161 INFO L273 TraceCheckUtils]: 64: Hoare triple {6519#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 17:07:11,161 INFO L273 TraceCheckUtils]: 65: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 17:07:11,161 INFO L273 TraceCheckUtils]: 66: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:11,161 INFO L273 TraceCheckUtils]: 67: Hoare triple {6519#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 17:07:11,161 INFO L273 TraceCheckUtils]: 68: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 17:07:11,161 INFO L273 TraceCheckUtils]: 69: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:11,162 INFO L273 TraceCheckUtils]: 70: Hoare triple {6519#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 17:07:11,162 INFO L273 TraceCheckUtils]: 71: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 17:07:11,162 INFO L273 TraceCheckUtils]: 72: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:11,162 INFO L273 TraceCheckUtils]: 73: Hoare triple {6519#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 17:07:11,162 INFO L273 TraceCheckUtils]: 74: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 17:07:11,162 INFO L273 TraceCheckUtils]: 75: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:11,162 INFO L273 TraceCheckUtils]: 76: Hoare triple {6519#false} assume !(~i~0 < 100); {6519#false} is VALID [2018-11-14 17:07:11,162 INFO L273 TraceCheckUtils]: 77: Hoare triple {6519#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6519#false} is VALID [2018-11-14 17:07:11,163 INFO L273 TraceCheckUtils]: 78: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:11,163 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {6519#false} {6519#false} #75#return; {6519#false} is VALID [2018-11-14 17:07:11,163 INFO L273 TraceCheckUtils]: 80: Hoare triple {6519#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {6519#false} is VALID [2018-11-14 17:07:11,163 INFO L273 TraceCheckUtils]: 81: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:11,163 INFO L273 TraceCheckUtils]: 82: Hoare triple {6519#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {6519#false} is VALID [2018-11-14 17:07:11,163 INFO L273 TraceCheckUtils]: 83: Hoare triple {6519#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {6519#false} is VALID [2018-11-14 17:07:11,163 INFO L273 TraceCheckUtils]: 84: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:11,163 INFO L273 TraceCheckUtils]: 85: Hoare triple {6519#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {6519#false} is VALID [2018-11-14 17:07:11,164 INFO L273 TraceCheckUtils]: 86: Hoare triple {6519#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {6519#false} is VALID [2018-11-14 17:07:11,164 INFO L273 TraceCheckUtils]: 87: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:11,164 INFO L273 TraceCheckUtils]: 88: Hoare triple {6519#false} assume !(~i~2 < 99); {6519#false} is VALID [2018-11-14 17:07:11,164 INFO L273 TraceCheckUtils]: 89: Hoare triple {6519#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {6519#false} is VALID [2018-11-14 17:07:11,164 INFO L256 TraceCheckUtils]: 90: Hoare triple {6519#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {6519#false} is VALID [2018-11-14 17:07:11,164 INFO L273 TraceCheckUtils]: 91: Hoare triple {6519#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6519#false} is VALID [2018-11-14 17:07:11,164 INFO L273 TraceCheckUtils]: 92: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:11,164 INFO L273 TraceCheckUtils]: 93: Hoare triple {6519#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 17:07:11,164 INFO L273 TraceCheckUtils]: 94: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 17:07:11,165 INFO L273 TraceCheckUtils]: 95: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:11,165 INFO L273 TraceCheckUtils]: 96: Hoare triple {6519#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 17:07:11,165 INFO L273 TraceCheckUtils]: 97: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 17:07:11,165 INFO L273 TraceCheckUtils]: 98: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:11,165 INFO L273 TraceCheckUtils]: 99: Hoare triple {6519#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 17:07:11,165 INFO L273 TraceCheckUtils]: 100: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 17:07:11,165 INFO L273 TraceCheckUtils]: 101: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:11,165 INFO L273 TraceCheckUtils]: 102: Hoare triple {6519#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 17:07:11,166 INFO L273 TraceCheckUtils]: 103: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 17:07:11,166 INFO L273 TraceCheckUtils]: 104: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:11,166 INFO L273 TraceCheckUtils]: 105: Hoare triple {6519#false} assume !(~i~0 < 100); {6519#false} is VALID [2018-11-14 17:07:11,166 INFO L273 TraceCheckUtils]: 106: Hoare triple {6519#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6519#false} is VALID [2018-11-14 17:07:11,166 INFO L273 TraceCheckUtils]: 107: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:07:11,166 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {6519#false} {6519#false} #77#return; {6519#false} is VALID [2018-11-14 17:07:11,166 INFO L273 TraceCheckUtils]: 109: Hoare triple {6519#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {6519#false} is VALID [2018-11-14 17:07:11,166 INFO L273 TraceCheckUtils]: 110: Hoare triple {6519#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {6519#false} is VALID [2018-11-14 17:07:11,166 INFO L273 TraceCheckUtils]: 111: Hoare triple {6519#false} assume !false; {6519#false} is VALID [2018-11-14 17:07:11,171 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 134 proven. 26 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-11-14 17:07:11,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:11,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2018-11-14 17:07:11,193 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 112 [2018-11-14 17:07:11,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:11,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 17:07:11,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:11,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 17:07:11,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 17:07:11,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-14 17:07:11,339 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 19 states. [2018-11-14 17:07:11,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:11,789 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2018-11-14 17:07:11,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 17:07:11,790 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 112 [2018-11-14 17:07:11,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:11,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:07:11,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 112 transitions. [2018-11-14 17:07:11,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:07:11,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 112 transitions. [2018-11-14 17:07:11,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 112 transitions. [2018-11-14 17:07:11,967 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:11,970 INFO L225 Difference]: With dead ends: 121 [2018-11-14 17:07:11,970 INFO L226 Difference]: Without dead ends: 85 [2018-11-14 17:07:11,971 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-14 17:07:11,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-14 17:07:12,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-11-14 17:07:12,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:12,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 83 states. [2018-11-14 17:07:12,081 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 83 states. [2018-11-14 17:07:12,081 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 83 states. [2018-11-14 17:07:12,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:12,084 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-11-14 17:07:12,084 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-14 17:07:12,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:12,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:12,085 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 85 states. [2018-11-14 17:07:12,085 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 85 states. [2018-11-14 17:07:12,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:12,087 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-11-14 17:07:12,087 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-14 17:07:12,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:12,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:12,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:12,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:12,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-14 17:07:12,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-11-14 17:07:12,090 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 112 [2018-11-14 17:07:12,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:12,090 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-11-14 17:07:12,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 17:07:12,091 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-14 17:07:12,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-14 17:07:12,092 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:12,092 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 15, 13, 12, 12, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:07:12,092 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:12,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:12,093 INFO L82 PathProgramCache]: Analyzing trace with hash -167472347, now seen corresponding path program 12 times [2018-11-14 17:07:12,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:12,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:12,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:12,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:12,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:13,343 INFO L256 TraceCheckUtils]: 0: Hoare triple {7318#true} call ULTIMATE.init(); {7318#true} is VALID [2018-11-14 17:07:13,343 INFO L273 TraceCheckUtils]: 1: Hoare triple {7318#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7318#true} is VALID [2018-11-14 17:07:13,343 INFO L273 TraceCheckUtils]: 2: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,344 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7318#true} {7318#true} #69#return; {7318#true} is VALID [2018-11-14 17:07:13,344 INFO L256 TraceCheckUtils]: 4: Hoare triple {7318#true} call #t~ret13 := main(); {7318#true} is VALID [2018-11-14 17:07:13,344 INFO L273 TraceCheckUtils]: 5: Hoare triple {7318#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7320#(= main_~i~1 0)} is VALID [2018-11-14 17:07:13,345 INFO L273 TraceCheckUtils]: 6: Hoare triple {7320#(= main_~i~1 0)} assume true; {7320#(= main_~i~1 0)} is VALID [2018-11-14 17:07:13,345 INFO L273 TraceCheckUtils]: 7: Hoare triple {7320#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7320#(= main_~i~1 0)} is VALID [2018-11-14 17:07:13,346 INFO L273 TraceCheckUtils]: 8: Hoare triple {7320#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7321#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:13,346 INFO L273 TraceCheckUtils]: 9: Hoare triple {7321#(<= main_~i~1 1)} assume true; {7321#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:13,346 INFO L273 TraceCheckUtils]: 10: Hoare triple {7321#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7321#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:13,347 INFO L273 TraceCheckUtils]: 11: Hoare triple {7321#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7322#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:13,347 INFO L273 TraceCheckUtils]: 12: Hoare triple {7322#(<= main_~i~1 2)} assume true; {7322#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:13,348 INFO L273 TraceCheckUtils]: 13: Hoare triple {7322#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7322#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:13,348 INFO L273 TraceCheckUtils]: 14: Hoare triple {7322#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7323#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:13,349 INFO L273 TraceCheckUtils]: 15: Hoare triple {7323#(<= main_~i~1 3)} assume true; {7323#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:13,349 INFO L273 TraceCheckUtils]: 16: Hoare triple {7323#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7323#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:13,350 INFO L273 TraceCheckUtils]: 17: Hoare triple {7323#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7324#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:13,351 INFO L273 TraceCheckUtils]: 18: Hoare triple {7324#(<= main_~i~1 4)} assume true; {7324#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:13,351 INFO L273 TraceCheckUtils]: 19: Hoare triple {7324#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7324#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:13,352 INFO L273 TraceCheckUtils]: 20: Hoare triple {7324#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7325#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:13,352 INFO L273 TraceCheckUtils]: 21: Hoare triple {7325#(<= main_~i~1 5)} assume true; {7325#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:13,353 INFO L273 TraceCheckUtils]: 22: Hoare triple {7325#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7325#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:13,354 INFO L273 TraceCheckUtils]: 23: Hoare triple {7325#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7326#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:13,354 INFO L273 TraceCheckUtils]: 24: Hoare triple {7326#(<= main_~i~1 6)} assume true; {7326#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:13,355 INFO L273 TraceCheckUtils]: 25: Hoare triple {7326#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7326#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:13,355 INFO L273 TraceCheckUtils]: 26: Hoare triple {7326#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7327#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:13,356 INFO L273 TraceCheckUtils]: 27: Hoare triple {7327#(<= main_~i~1 7)} assume true; {7327#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:13,356 INFO L273 TraceCheckUtils]: 28: Hoare triple {7327#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7327#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:13,357 INFO L273 TraceCheckUtils]: 29: Hoare triple {7327#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7328#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:13,357 INFO L273 TraceCheckUtils]: 30: Hoare triple {7328#(<= main_~i~1 8)} assume true; {7328#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:13,358 INFO L273 TraceCheckUtils]: 31: Hoare triple {7328#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7328#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:13,359 INFO L273 TraceCheckUtils]: 32: Hoare triple {7328#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7329#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:13,359 INFO L273 TraceCheckUtils]: 33: Hoare triple {7329#(<= main_~i~1 9)} assume true; {7329#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:13,360 INFO L273 TraceCheckUtils]: 34: Hoare triple {7329#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7329#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:13,360 INFO L273 TraceCheckUtils]: 35: Hoare triple {7329#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7330#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:13,361 INFO L273 TraceCheckUtils]: 36: Hoare triple {7330#(<= main_~i~1 10)} assume true; {7330#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:13,362 INFO L273 TraceCheckUtils]: 37: Hoare triple {7330#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7330#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:13,362 INFO L273 TraceCheckUtils]: 38: Hoare triple {7330#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7331#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:13,363 INFO L273 TraceCheckUtils]: 39: Hoare triple {7331#(<= main_~i~1 11)} assume true; {7331#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:13,363 INFO L273 TraceCheckUtils]: 40: Hoare triple {7331#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7331#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:13,364 INFO L273 TraceCheckUtils]: 41: Hoare triple {7331#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7332#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:13,365 INFO L273 TraceCheckUtils]: 42: Hoare triple {7332#(<= main_~i~1 12)} assume true; {7332#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:13,365 INFO L273 TraceCheckUtils]: 43: Hoare triple {7332#(<= main_~i~1 12)} assume !(~i~1 < 100); {7319#false} is VALID [2018-11-14 17:07:13,365 INFO L256 TraceCheckUtils]: 44: Hoare triple {7319#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {7318#true} is VALID [2018-11-14 17:07:13,366 INFO L273 TraceCheckUtils]: 45: Hoare triple {7318#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7318#true} is VALID [2018-11-14 17:07:13,366 INFO L273 TraceCheckUtils]: 46: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,366 INFO L273 TraceCheckUtils]: 47: Hoare triple {7318#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:13,366 INFO L273 TraceCheckUtils]: 48: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:07:13,367 INFO L273 TraceCheckUtils]: 49: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,367 INFO L273 TraceCheckUtils]: 50: Hoare triple {7318#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:13,367 INFO L273 TraceCheckUtils]: 51: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:07:13,367 INFO L273 TraceCheckUtils]: 52: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,367 INFO L273 TraceCheckUtils]: 53: Hoare triple {7318#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:13,367 INFO L273 TraceCheckUtils]: 54: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:07:13,368 INFO L273 TraceCheckUtils]: 55: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,368 INFO L273 TraceCheckUtils]: 56: Hoare triple {7318#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:13,368 INFO L273 TraceCheckUtils]: 57: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:07:13,368 INFO L273 TraceCheckUtils]: 58: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,368 INFO L273 TraceCheckUtils]: 59: Hoare triple {7318#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:13,368 INFO L273 TraceCheckUtils]: 60: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:07:13,368 INFO L273 TraceCheckUtils]: 61: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,368 INFO L273 TraceCheckUtils]: 62: Hoare triple {7318#true} assume !(~i~0 < 100); {7318#true} is VALID [2018-11-14 17:07:13,369 INFO L273 TraceCheckUtils]: 63: Hoare triple {7318#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7318#true} is VALID [2018-11-14 17:07:13,369 INFO L273 TraceCheckUtils]: 64: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,369 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {7318#true} {7319#false} #73#return; {7319#false} is VALID [2018-11-14 17:07:13,369 INFO L273 TraceCheckUtils]: 66: Hoare triple {7319#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {7319#false} is VALID [2018-11-14 17:07:13,369 INFO L256 TraceCheckUtils]: 67: Hoare triple {7319#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {7318#true} is VALID [2018-11-14 17:07:13,369 INFO L273 TraceCheckUtils]: 68: Hoare triple {7318#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7318#true} is VALID [2018-11-14 17:07:13,369 INFO L273 TraceCheckUtils]: 69: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,369 INFO L273 TraceCheckUtils]: 70: Hoare triple {7318#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:13,370 INFO L273 TraceCheckUtils]: 71: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:07:13,370 INFO L273 TraceCheckUtils]: 72: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,370 INFO L273 TraceCheckUtils]: 73: Hoare triple {7318#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:13,370 INFO L273 TraceCheckUtils]: 74: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:07:13,370 INFO L273 TraceCheckUtils]: 75: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,370 INFO L273 TraceCheckUtils]: 76: Hoare triple {7318#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:13,370 INFO L273 TraceCheckUtils]: 77: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:07:13,371 INFO L273 TraceCheckUtils]: 78: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,371 INFO L273 TraceCheckUtils]: 79: Hoare triple {7318#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:13,371 INFO L273 TraceCheckUtils]: 80: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:07:13,371 INFO L273 TraceCheckUtils]: 81: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,371 INFO L273 TraceCheckUtils]: 82: Hoare triple {7318#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:13,371 INFO L273 TraceCheckUtils]: 83: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:07:13,371 INFO L273 TraceCheckUtils]: 84: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,372 INFO L273 TraceCheckUtils]: 85: Hoare triple {7318#true} assume !(~i~0 < 100); {7318#true} is VALID [2018-11-14 17:07:13,372 INFO L273 TraceCheckUtils]: 86: Hoare triple {7318#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7318#true} is VALID [2018-11-14 17:07:13,372 INFO L273 TraceCheckUtils]: 87: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,372 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {7318#true} {7319#false} #75#return; {7319#false} is VALID [2018-11-14 17:07:13,372 INFO L273 TraceCheckUtils]: 89: Hoare triple {7319#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {7319#false} is VALID [2018-11-14 17:07:13,372 INFO L273 TraceCheckUtils]: 90: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:13,373 INFO L273 TraceCheckUtils]: 91: Hoare triple {7319#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {7319#false} is VALID [2018-11-14 17:07:13,373 INFO L273 TraceCheckUtils]: 92: Hoare triple {7319#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {7319#false} is VALID [2018-11-14 17:07:13,373 INFO L273 TraceCheckUtils]: 93: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:13,373 INFO L273 TraceCheckUtils]: 94: Hoare triple {7319#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {7319#false} is VALID [2018-11-14 17:07:13,373 INFO L273 TraceCheckUtils]: 95: Hoare triple {7319#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {7319#false} is VALID [2018-11-14 17:07:13,373 INFO L273 TraceCheckUtils]: 96: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:13,373 INFO L273 TraceCheckUtils]: 97: Hoare triple {7319#false} assume !(~i~2 < 99); {7319#false} is VALID [2018-11-14 17:07:13,374 INFO L273 TraceCheckUtils]: 98: Hoare triple {7319#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {7319#false} is VALID [2018-11-14 17:07:13,374 INFO L256 TraceCheckUtils]: 99: Hoare triple {7319#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {7318#true} is VALID [2018-11-14 17:07:13,374 INFO L273 TraceCheckUtils]: 100: Hoare triple {7318#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7318#true} is VALID [2018-11-14 17:07:13,374 INFO L273 TraceCheckUtils]: 101: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,374 INFO L273 TraceCheckUtils]: 102: Hoare triple {7318#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:13,374 INFO L273 TraceCheckUtils]: 103: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:07:13,374 INFO L273 TraceCheckUtils]: 104: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,375 INFO L273 TraceCheckUtils]: 105: Hoare triple {7318#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:13,375 INFO L273 TraceCheckUtils]: 106: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:07:13,375 INFO L273 TraceCheckUtils]: 107: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,375 INFO L273 TraceCheckUtils]: 108: Hoare triple {7318#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:13,375 INFO L273 TraceCheckUtils]: 109: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:07:13,375 INFO L273 TraceCheckUtils]: 110: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,376 INFO L273 TraceCheckUtils]: 111: Hoare triple {7318#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:13,376 INFO L273 TraceCheckUtils]: 112: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:07:13,376 INFO L273 TraceCheckUtils]: 113: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,376 INFO L273 TraceCheckUtils]: 114: Hoare triple {7318#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:13,376 INFO L273 TraceCheckUtils]: 115: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:07:13,376 INFO L273 TraceCheckUtils]: 116: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,376 INFO L273 TraceCheckUtils]: 117: Hoare triple {7318#true} assume !(~i~0 < 100); {7318#true} is VALID [2018-11-14 17:07:13,377 INFO L273 TraceCheckUtils]: 118: Hoare triple {7318#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7318#true} is VALID [2018-11-14 17:07:13,377 INFO L273 TraceCheckUtils]: 119: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,377 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {7318#true} {7319#false} #77#return; {7319#false} is VALID [2018-11-14 17:07:13,377 INFO L273 TraceCheckUtils]: 121: Hoare triple {7319#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {7319#false} is VALID [2018-11-14 17:07:13,377 INFO L273 TraceCheckUtils]: 122: Hoare triple {7319#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {7319#false} is VALID [2018-11-14 17:07:13,377 INFO L273 TraceCheckUtils]: 123: Hoare triple {7319#false} assume !false; {7319#false} is VALID [2018-11-14 17:07:13,392 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2018-11-14 17:07:13,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:13,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:07:13,401 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:07:13,470 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 17:07:13,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:13,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:13,704 INFO L256 TraceCheckUtils]: 0: Hoare triple {7318#true} call ULTIMATE.init(); {7318#true} is VALID [2018-11-14 17:07:13,705 INFO L273 TraceCheckUtils]: 1: Hoare triple {7318#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7318#true} is VALID [2018-11-14 17:07:13,705 INFO L273 TraceCheckUtils]: 2: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,705 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7318#true} {7318#true} #69#return; {7318#true} is VALID [2018-11-14 17:07:13,705 INFO L256 TraceCheckUtils]: 4: Hoare triple {7318#true} call #t~ret13 := main(); {7318#true} is VALID [2018-11-14 17:07:13,706 INFO L273 TraceCheckUtils]: 5: Hoare triple {7318#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7318#true} is VALID [2018-11-14 17:07:13,706 INFO L273 TraceCheckUtils]: 6: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,706 INFO L273 TraceCheckUtils]: 7: Hoare triple {7318#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 17:07:13,706 INFO L273 TraceCheckUtils]: 8: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 17:07:13,707 INFO L273 TraceCheckUtils]: 9: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,707 INFO L273 TraceCheckUtils]: 10: Hoare triple {7318#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 17:07:13,707 INFO L273 TraceCheckUtils]: 11: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 17:07:13,707 INFO L273 TraceCheckUtils]: 12: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,707 INFO L273 TraceCheckUtils]: 13: Hoare triple {7318#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 17:07:13,708 INFO L273 TraceCheckUtils]: 14: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 17:07:13,708 INFO L273 TraceCheckUtils]: 15: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,708 INFO L273 TraceCheckUtils]: 16: Hoare triple {7318#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 17:07:13,708 INFO L273 TraceCheckUtils]: 17: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 17:07:13,708 INFO L273 TraceCheckUtils]: 18: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,708 INFO L273 TraceCheckUtils]: 19: Hoare triple {7318#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 17:07:13,708 INFO L273 TraceCheckUtils]: 20: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 17:07:13,709 INFO L273 TraceCheckUtils]: 21: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,709 INFO L273 TraceCheckUtils]: 22: Hoare triple {7318#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 17:07:13,709 INFO L273 TraceCheckUtils]: 23: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 17:07:13,709 INFO L273 TraceCheckUtils]: 24: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,709 INFO L273 TraceCheckUtils]: 25: Hoare triple {7318#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 17:07:13,709 INFO L273 TraceCheckUtils]: 26: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 17:07:13,709 INFO L273 TraceCheckUtils]: 27: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,710 INFO L273 TraceCheckUtils]: 28: Hoare triple {7318#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 17:07:13,710 INFO L273 TraceCheckUtils]: 29: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 17:07:13,710 INFO L273 TraceCheckUtils]: 30: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,710 INFO L273 TraceCheckUtils]: 31: Hoare triple {7318#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 17:07:13,710 INFO L273 TraceCheckUtils]: 32: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 17:07:13,710 INFO L273 TraceCheckUtils]: 33: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,711 INFO L273 TraceCheckUtils]: 34: Hoare triple {7318#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 17:07:13,711 INFO L273 TraceCheckUtils]: 35: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 17:07:13,711 INFO L273 TraceCheckUtils]: 36: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,711 INFO L273 TraceCheckUtils]: 37: Hoare triple {7318#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 17:07:13,711 INFO L273 TraceCheckUtils]: 38: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 17:07:13,711 INFO L273 TraceCheckUtils]: 39: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,711 INFO L273 TraceCheckUtils]: 40: Hoare triple {7318#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 17:07:13,712 INFO L273 TraceCheckUtils]: 41: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 17:07:13,712 INFO L273 TraceCheckUtils]: 42: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,712 INFO L273 TraceCheckUtils]: 43: Hoare triple {7318#true} assume !(~i~1 < 100); {7318#true} is VALID [2018-11-14 17:07:13,712 INFO L256 TraceCheckUtils]: 44: Hoare triple {7318#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {7318#true} is VALID [2018-11-14 17:07:13,712 INFO L273 TraceCheckUtils]: 45: Hoare triple {7318#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7318#true} is VALID [2018-11-14 17:07:13,712 INFO L273 TraceCheckUtils]: 46: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,712 INFO L273 TraceCheckUtils]: 47: Hoare triple {7318#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:13,713 INFO L273 TraceCheckUtils]: 48: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:07:13,713 INFO L273 TraceCheckUtils]: 49: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,713 INFO L273 TraceCheckUtils]: 50: Hoare triple {7318#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:13,713 INFO L273 TraceCheckUtils]: 51: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:07:13,713 INFO L273 TraceCheckUtils]: 52: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,713 INFO L273 TraceCheckUtils]: 53: Hoare triple {7318#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:13,714 INFO L273 TraceCheckUtils]: 54: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:07:13,714 INFO L273 TraceCheckUtils]: 55: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,714 INFO L273 TraceCheckUtils]: 56: Hoare triple {7318#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:13,714 INFO L273 TraceCheckUtils]: 57: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:07:13,714 INFO L273 TraceCheckUtils]: 58: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,714 INFO L273 TraceCheckUtils]: 59: Hoare triple {7318#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:13,714 INFO L273 TraceCheckUtils]: 60: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:07:13,715 INFO L273 TraceCheckUtils]: 61: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,715 INFO L273 TraceCheckUtils]: 62: Hoare triple {7318#true} assume !(~i~0 < 100); {7318#true} is VALID [2018-11-14 17:07:13,715 INFO L273 TraceCheckUtils]: 63: Hoare triple {7318#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7318#true} is VALID [2018-11-14 17:07:13,715 INFO L273 TraceCheckUtils]: 64: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,715 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {7318#true} {7318#true} #73#return; {7318#true} is VALID [2018-11-14 17:07:13,715 INFO L273 TraceCheckUtils]: 66: Hoare triple {7318#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {7318#true} is VALID [2018-11-14 17:07:13,715 INFO L256 TraceCheckUtils]: 67: Hoare triple {7318#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {7318#true} is VALID [2018-11-14 17:07:13,716 INFO L273 TraceCheckUtils]: 68: Hoare triple {7318#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7318#true} is VALID [2018-11-14 17:07:13,716 INFO L273 TraceCheckUtils]: 69: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,716 INFO L273 TraceCheckUtils]: 70: Hoare triple {7318#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:13,716 INFO L273 TraceCheckUtils]: 71: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:07:13,716 INFO L273 TraceCheckUtils]: 72: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,716 INFO L273 TraceCheckUtils]: 73: Hoare triple {7318#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:13,717 INFO L273 TraceCheckUtils]: 74: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:07:13,717 INFO L273 TraceCheckUtils]: 75: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,717 INFO L273 TraceCheckUtils]: 76: Hoare triple {7318#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:13,717 INFO L273 TraceCheckUtils]: 77: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:07:13,717 INFO L273 TraceCheckUtils]: 78: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,717 INFO L273 TraceCheckUtils]: 79: Hoare triple {7318#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:13,717 INFO L273 TraceCheckUtils]: 80: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:07:13,718 INFO L273 TraceCheckUtils]: 81: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,718 INFO L273 TraceCheckUtils]: 82: Hoare triple {7318#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:07:13,718 INFO L273 TraceCheckUtils]: 83: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:07:13,718 INFO L273 TraceCheckUtils]: 84: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,718 INFO L273 TraceCheckUtils]: 85: Hoare triple {7318#true} assume !(~i~0 < 100); {7318#true} is VALID [2018-11-14 17:07:13,718 INFO L273 TraceCheckUtils]: 86: Hoare triple {7318#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7318#true} is VALID [2018-11-14 17:07:13,718 INFO L273 TraceCheckUtils]: 87: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:07:13,719 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {7318#true} {7318#true} #75#return; {7318#true} is VALID [2018-11-14 17:07:13,719 INFO L273 TraceCheckUtils]: 89: Hoare triple {7318#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {7603#(<= main_~i~2 0)} is VALID [2018-11-14 17:07:13,720 INFO L273 TraceCheckUtils]: 90: Hoare triple {7603#(<= main_~i~2 0)} assume true; {7603#(<= main_~i~2 0)} is VALID [2018-11-14 17:07:13,720 INFO L273 TraceCheckUtils]: 91: Hoare triple {7603#(<= main_~i~2 0)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {7603#(<= main_~i~2 0)} is VALID [2018-11-14 17:07:13,721 INFO L273 TraceCheckUtils]: 92: Hoare triple {7603#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {7613#(<= main_~i~2 1)} is VALID [2018-11-14 17:07:13,721 INFO L273 TraceCheckUtils]: 93: Hoare triple {7613#(<= main_~i~2 1)} assume true; {7613#(<= main_~i~2 1)} is VALID [2018-11-14 17:07:13,721 INFO L273 TraceCheckUtils]: 94: Hoare triple {7613#(<= main_~i~2 1)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {7613#(<= main_~i~2 1)} is VALID [2018-11-14 17:07:13,722 INFO L273 TraceCheckUtils]: 95: Hoare triple {7613#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {7623#(<= main_~i~2 2)} is VALID [2018-11-14 17:07:13,722 INFO L273 TraceCheckUtils]: 96: Hoare triple {7623#(<= main_~i~2 2)} assume true; {7623#(<= main_~i~2 2)} is VALID [2018-11-14 17:07:13,723 INFO L273 TraceCheckUtils]: 97: Hoare triple {7623#(<= main_~i~2 2)} assume !(~i~2 < 99); {7319#false} is VALID [2018-11-14 17:07:13,723 INFO L273 TraceCheckUtils]: 98: Hoare triple {7319#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {7319#false} is VALID [2018-11-14 17:07:13,723 INFO L256 TraceCheckUtils]: 99: Hoare triple {7319#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {7319#false} is VALID [2018-11-14 17:07:13,723 INFO L273 TraceCheckUtils]: 100: Hoare triple {7319#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7319#false} is VALID [2018-11-14 17:07:13,724 INFO L273 TraceCheckUtils]: 101: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:13,724 INFO L273 TraceCheckUtils]: 102: Hoare triple {7319#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7319#false} is VALID [2018-11-14 17:07:13,724 INFO L273 TraceCheckUtils]: 103: Hoare triple {7319#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7319#false} is VALID [2018-11-14 17:07:13,724 INFO L273 TraceCheckUtils]: 104: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:13,725 INFO L273 TraceCheckUtils]: 105: Hoare triple {7319#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7319#false} is VALID [2018-11-14 17:07:13,725 INFO L273 TraceCheckUtils]: 106: Hoare triple {7319#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7319#false} is VALID [2018-11-14 17:07:13,725 INFO L273 TraceCheckUtils]: 107: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:13,726 INFO L273 TraceCheckUtils]: 108: Hoare triple {7319#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7319#false} is VALID [2018-11-14 17:07:13,726 INFO L273 TraceCheckUtils]: 109: Hoare triple {7319#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7319#false} is VALID [2018-11-14 17:07:13,726 INFO L273 TraceCheckUtils]: 110: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:13,726 INFO L273 TraceCheckUtils]: 111: Hoare triple {7319#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7319#false} is VALID [2018-11-14 17:07:13,726 INFO L273 TraceCheckUtils]: 112: Hoare triple {7319#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7319#false} is VALID [2018-11-14 17:07:13,726 INFO L273 TraceCheckUtils]: 113: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:13,727 INFO L273 TraceCheckUtils]: 114: Hoare triple {7319#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7319#false} is VALID [2018-11-14 17:07:13,727 INFO L273 TraceCheckUtils]: 115: Hoare triple {7319#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7319#false} is VALID [2018-11-14 17:07:13,727 INFO L273 TraceCheckUtils]: 116: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:13,727 INFO L273 TraceCheckUtils]: 117: Hoare triple {7319#false} assume !(~i~0 < 100); {7319#false} is VALID [2018-11-14 17:07:13,727 INFO L273 TraceCheckUtils]: 118: Hoare triple {7319#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7319#false} is VALID [2018-11-14 17:07:13,727 INFO L273 TraceCheckUtils]: 119: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:07:13,728 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {7319#false} {7319#false} #77#return; {7319#false} is VALID [2018-11-14 17:07:13,728 INFO L273 TraceCheckUtils]: 121: Hoare triple {7319#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {7319#false} is VALID [2018-11-14 17:07:13,728 INFO L273 TraceCheckUtils]: 122: Hoare triple {7319#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {7319#false} is VALID [2018-11-14 17:07:13,728 INFO L273 TraceCheckUtils]: 123: Hoare triple {7319#false} assume !false; {7319#false} is VALID [2018-11-14 17:07:13,741 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 202 proven. 7 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2018-11-14 17:07:13,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:13,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2018-11-14 17:07:13,762 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 124 [2018-11-14 17:07:13,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:13,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 17:07:13,858 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:13,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 17:07:13,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 17:07:13,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:07:13,859 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 18 states. [2018-11-14 17:07:14,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:14,521 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-11-14 17:07:14,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 17:07:14,521 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 124 [2018-11-14 17:07:14,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:14,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:07:14,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 106 transitions. [2018-11-14 17:07:14,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:07:14,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 106 transitions. [2018-11-14 17:07:14,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 106 transitions. [2018-11-14 17:07:15,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:15,008 INFO L225 Difference]: With dead ends: 130 [2018-11-14 17:07:15,008 INFO L226 Difference]: Without dead ends: 91 [2018-11-14 17:07:15,009 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:07:15,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-14 17:07:15,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2018-11-14 17:07:15,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:15,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 89 states. [2018-11-14 17:07:15,033 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 89 states. [2018-11-14 17:07:15,033 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 89 states. [2018-11-14 17:07:15,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:15,036 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-11-14 17:07:15,037 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-11-14 17:07:15,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:15,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:15,037 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 91 states. [2018-11-14 17:07:15,037 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 91 states. [2018-11-14 17:07:15,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:15,040 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-11-14 17:07:15,040 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-11-14 17:07:15,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:15,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:15,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:15,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-14 17:07:15,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-11-14 17:07:15,043 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2018-11-14 17:07:15,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:15,043 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-11-14 17:07:15,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 17:07:15,044 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-14 17:07:15,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-14 17:07:15,045 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:15,045 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 15, 14, 13, 13, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:07:15,046 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:15,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:15,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1755612877, now seen corresponding path program 13 times [2018-11-14 17:07:15,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:15,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:15,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:15,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:15,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:15,677 INFO L256 TraceCheckUtils]: 0: Hoare triple {8185#true} call ULTIMATE.init(); {8185#true} is VALID [2018-11-14 17:07:15,678 INFO L273 TraceCheckUtils]: 1: Hoare triple {8185#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8185#true} is VALID [2018-11-14 17:07:15,678 INFO L273 TraceCheckUtils]: 2: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:15,678 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8185#true} {8185#true} #69#return; {8185#true} is VALID [2018-11-14 17:07:15,678 INFO L256 TraceCheckUtils]: 4: Hoare triple {8185#true} call #t~ret13 := main(); {8185#true} is VALID [2018-11-14 17:07:15,679 INFO L273 TraceCheckUtils]: 5: Hoare triple {8185#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {8187#(= main_~i~1 0)} is VALID [2018-11-14 17:07:15,679 INFO L273 TraceCheckUtils]: 6: Hoare triple {8187#(= main_~i~1 0)} assume true; {8187#(= main_~i~1 0)} is VALID [2018-11-14 17:07:15,680 INFO L273 TraceCheckUtils]: 7: Hoare triple {8187#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8187#(= main_~i~1 0)} is VALID [2018-11-14 17:07:15,681 INFO L273 TraceCheckUtils]: 8: Hoare triple {8187#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8188#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:15,681 INFO L273 TraceCheckUtils]: 9: Hoare triple {8188#(<= main_~i~1 1)} assume true; {8188#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:15,681 INFO L273 TraceCheckUtils]: 10: Hoare triple {8188#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8188#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:15,682 INFO L273 TraceCheckUtils]: 11: Hoare triple {8188#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8189#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:15,682 INFO L273 TraceCheckUtils]: 12: Hoare triple {8189#(<= main_~i~1 2)} assume true; {8189#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:15,682 INFO L273 TraceCheckUtils]: 13: Hoare triple {8189#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8189#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:15,683 INFO L273 TraceCheckUtils]: 14: Hoare triple {8189#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8190#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:15,683 INFO L273 TraceCheckUtils]: 15: Hoare triple {8190#(<= main_~i~1 3)} assume true; {8190#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:15,683 INFO L273 TraceCheckUtils]: 16: Hoare triple {8190#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8190#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:15,684 INFO L273 TraceCheckUtils]: 17: Hoare triple {8190#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8191#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:15,684 INFO L273 TraceCheckUtils]: 18: Hoare triple {8191#(<= main_~i~1 4)} assume true; {8191#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:15,685 INFO L273 TraceCheckUtils]: 19: Hoare triple {8191#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8191#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:15,686 INFO L273 TraceCheckUtils]: 20: Hoare triple {8191#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8192#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:15,686 INFO L273 TraceCheckUtils]: 21: Hoare triple {8192#(<= main_~i~1 5)} assume true; {8192#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:15,687 INFO L273 TraceCheckUtils]: 22: Hoare triple {8192#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8192#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:15,690 INFO L273 TraceCheckUtils]: 23: Hoare triple {8192#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8193#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:15,691 INFO L273 TraceCheckUtils]: 24: Hoare triple {8193#(<= main_~i~1 6)} assume true; {8193#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:15,692 INFO L273 TraceCheckUtils]: 25: Hoare triple {8193#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8193#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:15,692 INFO L273 TraceCheckUtils]: 26: Hoare triple {8193#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8194#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:15,693 INFO L273 TraceCheckUtils]: 27: Hoare triple {8194#(<= main_~i~1 7)} assume true; {8194#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:15,693 INFO L273 TraceCheckUtils]: 28: Hoare triple {8194#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8194#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:15,694 INFO L273 TraceCheckUtils]: 29: Hoare triple {8194#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8195#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:15,694 INFO L273 TraceCheckUtils]: 30: Hoare triple {8195#(<= main_~i~1 8)} assume true; {8195#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:15,694 INFO L273 TraceCheckUtils]: 31: Hoare triple {8195#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8195#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:15,695 INFO L273 TraceCheckUtils]: 32: Hoare triple {8195#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8196#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:15,695 INFO L273 TraceCheckUtils]: 33: Hoare triple {8196#(<= main_~i~1 9)} assume true; {8196#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:15,696 INFO L273 TraceCheckUtils]: 34: Hoare triple {8196#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8196#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:15,696 INFO L273 TraceCheckUtils]: 35: Hoare triple {8196#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8197#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:15,697 INFO L273 TraceCheckUtils]: 36: Hoare triple {8197#(<= main_~i~1 10)} assume true; {8197#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:15,698 INFO L273 TraceCheckUtils]: 37: Hoare triple {8197#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8197#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:15,698 INFO L273 TraceCheckUtils]: 38: Hoare triple {8197#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8198#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:15,699 INFO L273 TraceCheckUtils]: 39: Hoare triple {8198#(<= main_~i~1 11)} assume true; {8198#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:15,699 INFO L273 TraceCheckUtils]: 40: Hoare triple {8198#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8198#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:15,700 INFO L273 TraceCheckUtils]: 41: Hoare triple {8198#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8199#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:15,701 INFO L273 TraceCheckUtils]: 42: Hoare triple {8199#(<= main_~i~1 12)} assume true; {8199#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:15,701 INFO L273 TraceCheckUtils]: 43: Hoare triple {8199#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8199#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:15,702 INFO L273 TraceCheckUtils]: 44: Hoare triple {8199#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8200#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:15,702 INFO L273 TraceCheckUtils]: 45: Hoare triple {8200#(<= main_~i~1 13)} assume true; {8200#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:15,703 INFO L273 TraceCheckUtils]: 46: Hoare triple {8200#(<= main_~i~1 13)} assume !(~i~1 < 100); {8186#false} is VALID [2018-11-14 17:07:15,703 INFO L256 TraceCheckUtils]: 47: Hoare triple {8186#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {8185#true} is VALID [2018-11-14 17:07:15,703 INFO L273 TraceCheckUtils]: 48: Hoare triple {8185#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8185#true} is VALID [2018-11-14 17:07:15,704 INFO L273 TraceCheckUtils]: 49: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:15,704 INFO L273 TraceCheckUtils]: 50: Hoare triple {8185#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:15,704 INFO L273 TraceCheckUtils]: 51: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:07:15,704 INFO L273 TraceCheckUtils]: 52: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:15,704 INFO L273 TraceCheckUtils]: 53: Hoare triple {8185#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:15,705 INFO L273 TraceCheckUtils]: 54: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:07:15,705 INFO L273 TraceCheckUtils]: 55: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:15,705 INFO L273 TraceCheckUtils]: 56: Hoare triple {8185#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:15,705 INFO L273 TraceCheckUtils]: 57: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:07:15,705 INFO L273 TraceCheckUtils]: 58: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:15,706 INFO L273 TraceCheckUtils]: 59: Hoare triple {8185#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:15,706 INFO L273 TraceCheckUtils]: 60: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:07:15,706 INFO L273 TraceCheckUtils]: 61: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:15,706 INFO L273 TraceCheckUtils]: 62: Hoare triple {8185#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:15,706 INFO L273 TraceCheckUtils]: 63: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:07:15,706 INFO L273 TraceCheckUtils]: 64: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:15,706 INFO L273 TraceCheckUtils]: 65: Hoare triple {8185#true} assume !(~i~0 < 100); {8185#true} is VALID [2018-11-14 17:07:15,707 INFO L273 TraceCheckUtils]: 66: Hoare triple {8185#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8185#true} is VALID [2018-11-14 17:07:15,707 INFO L273 TraceCheckUtils]: 67: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:15,707 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {8185#true} {8186#false} #73#return; {8186#false} is VALID [2018-11-14 17:07:15,707 INFO L273 TraceCheckUtils]: 69: Hoare triple {8186#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {8186#false} is VALID [2018-11-14 17:07:15,707 INFO L256 TraceCheckUtils]: 70: Hoare triple {8186#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {8185#true} is VALID [2018-11-14 17:07:15,707 INFO L273 TraceCheckUtils]: 71: Hoare triple {8185#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8185#true} is VALID [2018-11-14 17:07:15,707 INFO L273 TraceCheckUtils]: 72: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:15,707 INFO L273 TraceCheckUtils]: 73: Hoare triple {8185#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:15,707 INFO L273 TraceCheckUtils]: 74: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:07:15,708 INFO L273 TraceCheckUtils]: 75: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:15,708 INFO L273 TraceCheckUtils]: 76: Hoare triple {8185#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:15,708 INFO L273 TraceCheckUtils]: 77: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:07:15,708 INFO L273 TraceCheckUtils]: 78: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:15,708 INFO L273 TraceCheckUtils]: 79: Hoare triple {8185#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:15,708 INFO L273 TraceCheckUtils]: 80: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:07:15,708 INFO L273 TraceCheckUtils]: 81: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:15,708 INFO L273 TraceCheckUtils]: 82: Hoare triple {8185#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:15,709 INFO L273 TraceCheckUtils]: 83: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:07:15,709 INFO L273 TraceCheckUtils]: 84: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:15,709 INFO L273 TraceCheckUtils]: 85: Hoare triple {8185#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:15,709 INFO L273 TraceCheckUtils]: 86: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:07:15,709 INFO L273 TraceCheckUtils]: 87: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:15,709 INFO L273 TraceCheckUtils]: 88: Hoare triple {8185#true} assume !(~i~0 < 100); {8185#true} is VALID [2018-11-14 17:07:15,709 INFO L273 TraceCheckUtils]: 89: Hoare triple {8185#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8185#true} is VALID [2018-11-14 17:07:15,709 INFO L273 TraceCheckUtils]: 90: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:15,709 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {8185#true} {8186#false} #75#return; {8186#false} is VALID [2018-11-14 17:07:15,710 INFO L273 TraceCheckUtils]: 92: Hoare triple {8186#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {8186#false} is VALID [2018-11-14 17:07:15,710 INFO L273 TraceCheckUtils]: 93: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:15,710 INFO L273 TraceCheckUtils]: 94: Hoare triple {8186#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {8186#false} is VALID [2018-11-14 17:07:15,710 INFO L273 TraceCheckUtils]: 95: Hoare triple {8186#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {8186#false} is VALID [2018-11-14 17:07:15,710 INFO L273 TraceCheckUtils]: 96: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:15,710 INFO L273 TraceCheckUtils]: 97: Hoare triple {8186#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {8186#false} is VALID [2018-11-14 17:07:15,710 INFO L273 TraceCheckUtils]: 98: Hoare triple {8186#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {8186#false} is VALID [2018-11-14 17:07:15,710 INFO L273 TraceCheckUtils]: 99: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:15,710 INFO L273 TraceCheckUtils]: 100: Hoare triple {8186#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {8186#false} is VALID [2018-11-14 17:07:15,711 INFO L273 TraceCheckUtils]: 101: Hoare triple {8186#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {8186#false} is VALID [2018-11-14 17:07:15,711 INFO L273 TraceCheckUtils]: 102: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:15,711 INFO L273 TraceCheckUtils]: 103: Hoare triple {8186#false} assume !(~i~2 < 99); {8186#false} is VALID [2018-11-14 17:07:15,711 INFO L273 TraceCheckUtils]: 104: Hoare triple {8186#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {8186#false} is VALID [2018-11-14 17:07:15,711 INFO L256 TraceCheckUtils]: 105: Hoare triple {8186#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {8185#true} is VALID [2018-11-14 17:07:15,711 INFO L273 TraceCheckUtils]: 106: Hoare triple {8185#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8185#true} is VALID [2018-11-14 17:07:15,711 INFO L273 TraceCheckUtils]: 107: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:15,711 INFO L273 TraceCheckUtils]: 108: Hoare triple {8185#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:15,712 INFO L273 TraceCheckUtils]: 109: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:07:15,712 INFO L273 TraceCheckUtils]: 110: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:15,712 INFO L273 TraceCheckUtils]: 111: Hoare triple {8185#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:15,712 INFO L273 TraceCheckUtils]: 112: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:07:15,712 INFO L273 TraceCheckUtils]: 113: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:15,712 INFO L273 TraceCheckUtils]: 114: Hoare triple {8185#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:15,712 INFO L273 TraceCheckUtils]: 115: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:07:15,712 INFO L273 TraceCheckUtils]: 116: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:15,712 INFO L273 TraceCheckUtils]: 117: Hoare triple {8185#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:15,713 INFO L273 TraceCheckUtils]: 118: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:07:15,713 INFO L273 TraceCheckUtils]: 119: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:15,713 INFO L273 TraceCheckUtils]: 120: Hoare triple {8185#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:07:15,713 INFO L273 TraceCheckUtils]: 121: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:07:15,713 INFO L273 TraceCheckUtils]: 122: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:15,713 INFO L273 TraceCheckUtils]: 123: Hoare triple {8185#true} assume !(~i~0 < 100); {8185#true} is VALID [2018-11-14 17:07:15,713 INFO L273 TraceCheckUtils]: 124: Hoare triple {8185#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8185#true} is VALID [2018-11-14 17:07:15,713 INFO L273 TraceCheckUtils]: 125: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:15,713 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {8185#true} {8186#false} #77#return; {8186#false} is VALID [2018-11-14 17:07:15,714 INFO L273 TraceCheckUtils]: 127: Hoare triple {8186#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {8186#false} is VALID [2018-11-14 17:07:15,714 INFO L273 TraceCheckUtils]: 128: Hoare triple {8186#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {8186#false} is VALID [2018-11-14 17:07:15,714 INFO L273 TraceCheckUtils]: 129: Hoare triple {8186#false} assume !false; {8186#false} is VALID [2018-11-14 17:07:15,721 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2018-11-14 17:07:15,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:15,721 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:07:15,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:07:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:15,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:16,071 INFO L256 TraceCheckUtils]: 0: Hoare triple {8185#true} call ULTIMATE.init(); {8185#true} is VALID [2018-11-14 17:07:16,071 INFO L273 TraceCheckUtils]: 1: Hoare triple {8185#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8185#true} is VALID [2018-11-14 17:07:16,072 INFO L273 TraceCheckUtils]: 2: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:07:16,072 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8185#true} {8185#true} #69#return; {8185#true} is VALID [2018-11-14 17:07:16,072 INFO L256 TraceCheckUtils]: 4: Hoare triple {8185#true} call #t~ret13 := main(); {8185#true} is VALID [2018-11-14 17:07:16,073 INFO L273 TraceCheckUtils]: 5: Hoare triple {8185#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {8219#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:16,073 INFO L273 TraceCheckUtils]: 6: Hoare triple {8219#(<= main_~i~1 0)} assume true; {8219#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:16,074 INFO L273 TraceCheckUtils]: 7: Hoare triple {8219#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8219#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:16,075 INFO L273 TraceCheckUtils]: 8: Hoare triple {8219#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8188#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:16,075 INFO L273 TraceCheckUtils]: 9: Hoare triple {8188#(<= main_~i~1 1)} assume true; {8188#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:16,075 INFO L273 TraceCheckUtils]: 10: Hoare triple {8188#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8188#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:16,076 INFO L273 TraceCheckUtils]: 11: Hoare triple {8188#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8189#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:16,076 INFO L273 TraceCheckUtils]: 12: Hoare triple {8189#(<= main_~i~1 2)} assume true; {8189#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:16,076 INFO L273 TraceCheckUtils]: 13: Hoare triple {8189#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8189#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:16,077 INFO L273 TraceCheckUtils]: 14: Hoare triple {8189#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8190#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:16,078 INFO L273 TraceCheckUtils]: 15: Hoare triple {8190#(<= main_~i~1 3)} assume true; {8190#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:16,078 INFO L273 TraceCheckUtils]: 16: Hoare triple {8190#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8190#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:16,079 INFO L273 TraceCheckUtils]: 17: Hoare triple {8190#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8191#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:16,079 INFO L273 TraceCheckUtils]: 18: Hoare triple {8191#(<= main_~i~1 4)} assume true; {8191#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:16,080 INFO L273 TraceCheckUtils]: 19: Hoare triple {8191#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8191#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:16,081 INFO L273 TraceCheckUtils]: 20: Hoare triple {8191#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8192#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:16,081 INFO L273 TraceCheckUtils]: 21: Hoare triple {8192#(<= main_~i~1 5)} assume true; {8192#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:16,082 INFO L273 TraceCheckUtils]: 22: Hoare triple {8192#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8192#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:16,083 INFO L273 TraceCheckUtils]: 23: Hoare triple {8192#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8193#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:16,083 INFO L273 TraceCheckUtils]: 24: Hoare triple {8193#(<= main_~i~1 6)} assume true; {8193#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:16,084 INFO L273 TraceCheckUtils]: 25: Hoare triple {8193#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8193#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:16,084 INFO L273 TraceCheckUtils]: 26: Hoare triple {8193#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8194#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:16,085 INFO L273 TraceCheckUtils]: 27: Hoare triple {8194#(<= main_~i~1 7)} assume true; {8194#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:16,085 INFO L273 TraceCheckUtils]: 28: Hoare triple {8194#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8194#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:16,086 INFO L273 TraceCheckUtils]: 29: Hoare triple {8194#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8195#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:16,087 INFO L273 TraceCheckUtils]: 30: Hoare triple {8195#(<= main_~i~1 8)} assume true; {8195#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:16,087 INFO L273 TraceCheckUtils]: 31: Hoare triple {8195#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8195#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:16,088 INFO L273 TraceCheckUtils]: 32: Hoare triple {8195#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8196#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:16,089 INFO L273 TraceCheckUtils]: 33: Hoare triple {8196#(<= main_~i~1 9)} assume true; {8196#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:16,089 INFO L273 TraceCheckUtils]: 34: Hoare triple {8196#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8196#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:16,090 INFO L273 TraceCheckUtils]: 35: Hoare triple {8196#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8197#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:16,090 INFO L273 TraceCheckUtils]: 36: Hoare triple {8197#(<= main_~i~1 10)} assume true; {8197#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:16,091 INFO L273 TraceCheckUtils]: 37: Hoare triple {8197#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8197#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:16,092 INFO L273 TraceCheckUtils]: 38: Hoare triple {8197#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8198#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:16,092 INFO L273 TraceCheckUtils]: 39: Hoare triple {8198#(<= main_~i~1 11)} assume true; {8198#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:16,093 INFO L273 TraceCheckUtils]: 40: Hoare triple {8198#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8198#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:16,093 INFO L273 TraceCheckUtils]: 41: Hoare triple {8198#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8199#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:16,094 INFO L273 TraceCheckUtils]: 42: Hoare triple {8199#(<= main_~i~1 12)} assume true; {8199#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:16,094 INFO L273 TraceCheckUtils]: 43: Hoare triple {8199#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8199#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:16,095 INFO L273 TraceCheckUtils]: 44: Hoare triple {8199#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8200#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:16,096 INFO L273 TraceCheckUtils]: 45: Hoare triple {8200#(<= main_~i~1 13)} assume true; {8200#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:16,096 INFO L273 TraceCheckUtils]: 46: Hoare triple {8200#(<= main_~i~1 13)} assume !(~i~1 < 100); {8186#false} is VALID [2018-11-14 17:07:16,097 INFO L256 TraceCheckUtils]: 47: Hoare triple {8186#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {8186#false} is VALID [2018-11-14 17:07:16,097 INFO L273 TraceCheckUtils]: 48: Hoare triple {8186#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8186#false} is VALID [2018-11-14 17:07:16,097 INFO L273 TraceCheckUtils]: 49: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:16,097 INFO L273 TraceCheckUtils]: 50: Hoare triple {8186#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:16,097 INFO L273 TraceCheckUtils]: 51: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:07:16,098 INFO L273 TraceCheckUtils]: 52: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:16,098 INFO L273 TraceCheckUtils]: 53: Hoare triple {8186#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:16,098 INFO L273 TraceCheckUtils]: 54: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:07:16,098 INFO L273 TraceCheckUtils]: 55: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:16,098 INFO L273 TraceCheckUtils]: 56: Hoare triple {8186#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:16,099 INFO L273 TraceCheckUtils]: 57: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:07:16,099 INFO L273 TraceCheckUtils]: 58: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:16,099 INFO L273 TraceCheckUtils]: 59: Hoare triple {8186#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:16,099 INFO L273 TraceCheckUtils]: 60: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:07:16,099 INFO L273 TraceCheckUtils]: 61: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:16,099 INFO L273 TraceCheckUtils]: 62: Hoare triple {8186#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:16,099 INFO L273 TraceCheckUtils]: 63: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:07:16,099 INFO L273 TraceCheckUtils]: 64: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:16,100 INFO L273 TraceCheckUtils]: 65: Hoare triple {8186#false} assume !(~i~0 < 100); {8186#false} is VALID [2018-11-14 17:07:16,100 INFO L273 TraceCheckUtils]: 66: Hoare triple {8186#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8186#false} is VALID [2018-11-14 17:07:16,100 INFO L273 TraceCheckUtils]: 67: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:16,100 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {8186#false} {8186#false} #73#return; {8186#false} is VALID [2018-11-14 17:07:16,100 INFO L273 TraceCheckUtils]: 69: Hoare triple {8186#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {8186#false} is VALID [2018-11-14 17:07:16,100 INFO L256 TraceCheckUtils]: 70: Hoare triple {8186#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {8186#false} is VALID [2018-11-14 17:07:16,100 INFO L273 TraceCheckUtils]: 71: Hoare triple {8186#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8186#false} is VALID [2018-11-14 17:07:16,100 INFO L273 TraceCheckUtils]: 72: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:16,100 INFO L273 TraceCheckUtils]: 73: Hoare triple {8186#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:16,101 INFO L273 TraceCheckUtils]: 74: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:07:16,101 INFO L273 TraceCheckUtils]: 75: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:16,101 INFO L273 TraceCheckUtils]: 76: Hoare triple {8186#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:16,101 INFO L273 TraceCheckUtils]: 77: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:07:16,101 INFO L273 TraceCheckUtils]: 78: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:16,101 INFO L273 TraceCheckUtils]: 79: Hoare triple {8186#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:16,101 INFO L273 TraceCheckUtils]: 80: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:07:16,101 INFO L273 TraceCheckUtils]: 81: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:16,101 INFO L273 TraceCheckUtils]: 82: Hoare triple {8186#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:16,102 INFO L273 TraceCheckUtils]: 83: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:07:16,102 INFO L273 TraceCheckUtils]: 84: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:16,102 INFO L273 TraceCheckUtils]: 85: Hoare triple {8186#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:16,102 INFO L273 TraceCheckUtils]: 86: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:07:16,102 INFO L273 TraceCheckUtils]: 87: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:16,102 INFO L273 TraceCheckUtils]: 88: Hoare triple {8186#false} assume !(~i~0 < 100); {8186#false} is VALID [2018-11-14 17:07:16,102 INFO L273 TraceCheckUtils]: 89: Hoare triple {8186#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8186#false} is VALID [2018-11-14 17:07:16,102 INFO L273 TraceCheckUtils]: 90: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:16,103 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {8186#false} {8186#false} #75#return; {8186#false} is VALID [2018-11-14 17:07:16,103 INFO L273 TraceCheckUtils]: 92: Hoare triple {8186#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {8186#false} is VALID [2018-11-14 17:07:16,103 INFO L273 TraceCheckUtils]: 93: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:16,103 INFO L273 TraceCheckUtils]: 94: Hoare triple {8186#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {8186#false} is VALID [2018-11-14 17:07:16,103 INFO L273 TraceCheckUtils]: 95: Hoare triple {8186#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {8186#false} is VALID [2018-11-14 17:07:16,103 INFO L273 TraceCheckUtils]: 96: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:16,103 INFO L273 TraceCheckUtils]: 97: Hoare triple {8186#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {8186#false} is VALID [2018-11-14 17:07:16,103 INFO L273 TraceCheckUtils]: 98: Hoare triple {8186#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {8186#false} is VALID [2018-11-14 17:07:16,103 INFO L273 TraceCheckUtils]: 99: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:16,104 INFO L273 TraceCheckUtils]: 100: Hoare triple {8186#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {8186#false} is VALID [2018-11-14 17:07:16,104 INFO L273 TraceCheckUtils]: 101: Hoare triple {8186#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {8186#false} is VALID [2018-11-14 17:07:16,104 INFO L273 TraceCheckUtils]: 102: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:16,104 INFO L273 TraceCheckUtils]: 103: Hoare triple {8186#false} assume !(~i~2 < 99); {8186#false} is VALID [2018-11-14 17:07:16,104 INFO L273 TraceCheckUtils]: 104: Hoare triple {8186#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {8186#false} is VALID [2018-11-14 17:07:16,104 INFO L256 TraceCheckUtils]: 105: Hoare triple {8186#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {8186#false} is VALID [2018-11-14 17:07:16,104 INFO L273 TraceCheckUtils]: 106: Hoare triple {8186#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8186#false} is VALID [2018-11-14 17:07:16,104 INFO L273 TraceCheckUtils]: 107: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:16,104 INFO L273 TraceCheckUtils]: 108: Hoare triple {8186#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:16,105 INFO L273 TraceCheckUtils]: 109: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:07:16,105 INFO L273 TraceCheckUtils]: 110: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:16,105 INFO L273 TraceCheckUtils]: 111: Hoare triple {8186#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:16,105 INFO L273 TraceCheckUtils]: 112: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:07:16,105 INFO L273 TraceCheckUtils]: 113: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:16,105 INFO L273 TraceCheckUtils]: 114: Hoare triple {8186#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:16,105 INFO L273 TraceCheckUtils]: 115: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:07:16,105 INFO L273 TraceCheckUtils]: 116: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:16,105 INFO L273 TraceCheckUtils]: 117: Hoare triple {8186#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:16,106 INFO L273 TraceCheckUtils]: 118: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:07:16,106 INFO L273 TraceCheckUtils]: 119: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:16,106 INFO L273 TraceCheckUtils]: 120: Hoare triple {8186#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:07:16,106 INFO L273 TraceCheckUtils]: 121: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:07:16,106 INFO L273 TraceCheckUtils]: 122: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:16,106 INFO L273 TraceCheckUtils]: 123: Hoare triple {8186#false} assume !(~i~0 < 100); {8186#false} is VALID [2018-11-14 17:07:16,106 INFO L273 TraceCheckUtils]: 124: Hoare triple {8186#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8186#false} is VALID [2018-11-14 17:07:16,106 INFO L273 TraceCheckUtils]: 125: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:07:16,106 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {8186#false} {8186#false} #77#return; {8186#false} is VALID [2018-11-14 17:07:16,107 INFO L273 TraceCheckUtils]: 127: Hoare triple {8186#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {8186#false} is VALID [2018-11-14 17:07:16,107 INFO L273 TraceCheckUtils]: 128: Hoare triple {8186#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {8186#false} is VALID [2018-11-14 17:07:16,107 INFO L273 TraceCheckUtils]: 129: Hoare triple {8186#false} assume !false; {8186#false} is VALID [2018-11-14 17:07:16,114 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2018-11-14 17:07:16,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:16,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-14 17:07:16,137 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 130 [2018-11-14 17:07:16,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:16,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 17:07:16,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:16,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 17:07:16,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 17:07:16,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 17:07:16,218 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 17 states. [2018-11-14 17:07:16,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:16,658 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2018-11-14 17:07:16,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 17:07:16,658 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 130 [2018-11-14 17:07:16,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:16,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:07:16,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2018-11-14 17:07:16,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:07:16,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2018-11-14 17:07:16,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 99 transitions. [2018-11-14 17:07:17,184 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:17,187 INFO L225 Difference]: With dead ends: 135 [2018-11-14 17:07:17,187 INFO L226 Difference]: Without dead ends: 93 [2018-11-14 17:07:17,188 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 17:07:17,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-14 17:07:17,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-11-14 17:07:17,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:17,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 92 states. [2018-11-14 17:07:17,215 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 92 states. [2018-11-14 17:07:17,215 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 92 states. [2018-11-14 17:07:17,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:17,218 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-11-14 17:07:17,219 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-14 17:07:17,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:17,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:17,219 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 93 states. [2018-11-14 17:07:17,220 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 93 states. [2018-11-14 17:07:17,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:17,222 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-11-14 17:07:17,222 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-14 17:07:17,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:17,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:17,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:17,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:17,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-14 17:07:17,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-11-14 17:07:17,225 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 130 [2018-11-14 17:07:17,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:17,225 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-11-14 17:07:17,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 17:07:17,226 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-14 17:07:17,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-14 17:07:17,227 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:17,227 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 14, 14, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:07:17,227 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:17,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:17,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1039240391, now seen corresponding path program 14 times [2018-11-14 17:07:17,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:17,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:17,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:17,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:07:17,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:17,592 INFO L256 TraceCheckUtils]: 0: Hoare triple {9084#true} call ULTIMATE.init(); {9084#true} is VALID [2018-11-14 17:07:17,592 INFO L273 TraceCheckUtils]: 1: Hoare triple {9084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9084#true} is VALID [2018-11-14 17:07:17,592 INFO L273 TraceCheckUtils]: 2: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:17,593 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9084#true} {9084#true} #69#return; {9084#true} is VALID [2018-11-14 17:07:17,593 INFO L256 TraceCheckUtils]: 4: Hoare triple {9084#true} call #t~ret13 := main(); {9084#true} is VALID [2018-11-14 17:07:17,593 INFO L273 TraceCheckUtils]: 5: Hoare triple {9084#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9086#(= main_~i~1 0)} is VALID [2018-11-14 17:07:17,594 INFO L273 TraceCheckUtils]: 6: Hoare triple {9086#(= main_~i~1 0)} assume true; {9086#(= main_~i~1 0)} is VALID [2018-11-14 17:07:17,594 INFO L273 TraceCheckUtils]: 7: Hoare triple {9086#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9086#(= main_~i~1 0)} is VALID [2018-11-14 17:07:17,595 INFO L273 TraceCheckUtils]: 8: Hoare triple {9086#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9087#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:17,595 INFO L273 TraceCheckUtils]: 9: Hoare triple {9087#(<= main_~i~1 1)} assume true; {9087#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:17,595 INFO L273 TraceCheckUtils]: 10: Hoare triple {9087#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9087#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:17,596 INFO L273 TraceCheckUtils]: 11: Hoare triple {9087#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9088#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:17,596 INFO L273 TraceCheckUtils]: 12: Hoare triple {9088#(<= main_~i~1 2)} assume true; {9088#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:17,596 INFO L273 TraceCheckUtils]: 13: Hoare triple {9088#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9088#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:17,597 INFO L273 TraceCheckUtils]: 14: Hoare triple {9088#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9089#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:17,598 INFO L273 TraceCheckUtils]: 15: Hoare triple {9089#(<= main_~i~1 3)} assume true; {9089#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:17,598 INFO L273 TraceCheckUtils]: 16: Hoare triple {9089#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9089#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:17,599 INFO L273 TraceCheckUtils]: 17: Hoare triple {9089#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9090#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:17,599 INFO L273 TraceCheckUtils]: 18: Hoare triple {9090#(<= main_~i~1 4)} assume true; {9090#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:17,600 INFO L273 TraceCheckUtils]: 19: Hoare triple {9090#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9090#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:17,601 INFO L273 TraceCheckUtils]: 20: Hoare triple {9090#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9091#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:17,601 INFO L273 TraceCheckUtils]: 21: Hoare triple {9091#(<= main_~i~1 5)} assume true; {9091#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:17,602 INFO L273 TraceCheckUtils]: 22: Hoare triple {9091#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9091#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:17,603 INFO L273 TraceCheckUtils]: 23: Hoare triple {9091#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9092#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:17,603 INFO L273 TraceCheckUtils]: 24: Hoare triple {9092#(<= main_~i~1 6)} assume true; {9092#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:17,604 INFO L273 TraceCheckUtils]: 25: Hoare triple {9092#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9092#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:17,604 INFO L273 TraceCheckUtils]: 26: Hoare triple {9092#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9093#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:17,605 INFO L273 TraceCheckUtils]: 27: Hoare triple {9093#(<= main_~i~1 7)} assume true; {9093#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:17,605 INFO L273 TraceCheckUtils]: 28: Hoare triple {9093#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9093#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:17,606 INFO L273 TraceCheckUtils]: 29: Hoare triple {9093#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9094#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:17,607 INFO L273 TraceCheckUtils]: 30: Hoare triple {9094#(<= main_~i~1 8)} assume true; {9094#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:17,607 INFO L273 TraceCheckUtils]: 31: Hoare triple {9094#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9094#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:17,608 INFO L273 TraceCheckUtils]: 32: Hoare triple {9094#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9095#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:17,609 INFO L273 TraceCheckUtils]: 33: Hoare triple {9095#(<= main_~i~1 9)} assume true; {9095#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:17,609 INFO L273 TraceCheckUtils]: 34: Hoare triple {9095#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9095#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:17,610 INFO L273 TraceCheckUtils]: 35: Hoare triple {9095#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9096#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:17,610 INFO L273 TraceCheckUtils]: 36: Hoare triple {9096#(<= main_~i~1 10)} assume true; {9096#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:17,611 INFO L273 TraceCheckUtils]: 37: Hoare triple {9096#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9096#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:17,612 INFO L273 TraceCheckUtils]: 38: Hoare triple {9096#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9097#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:17,612 INFO L273 TraceCheckUtils]: 39: Hoare triple {9097#(<= main_~i~1 11)} assume true; {9097#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:17,613 INFO L273 TraceCheckUtils]: 40: Hoare triple {9097#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9097#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:17,614 INFO L273 TraceCheckUtils]: 41: Hoare triple {9097#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9098#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:17,614 INFO L273 TraceCheckUtils]: 42: Hoare triple {9098#(<= main_~i~1 12)} assume true; {9098#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:17,615 INFO L273 TraceCheckUtils]: 43: Hoare triple {9098#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9098#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:17,615 INFO L273 TraceCheckUtils]: 44: Hoare triple {9098#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9099#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:17,616 INFO L273 TraceCheckUtils]: 45: Hoare triple {9099#(<= main_~i~1 13)} assume true; {9099#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:17,616 INFO L273 TraceCheckUtils]: 46: Hoare triple {9099#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9099#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:17,617 INFO L273 TraceCheckUtils]: 47: Hoare triple {9099#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9100#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:17,618 INFO L273 TraceCheckUtils]: 48: Hoare triple {9100#(<= main_~i~1 14)} assume true; {9100#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:17,618 INFO L273 TraceCheckUtils]: 49: Hoare triple {9100#(<= main_~i~1 14)} assume !(~i~1 < 100); {9085#false} is VALID [2018-11-14 17:07:17,619 INFO L256 TraceCheckUtils]: 50: Hoare triple {9085#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {9084#true} is VALID [2018-11-14 17:07:17,619 INFO L273 TraceCheckUtils]: 51: Hoare triple {9084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9084#true} is VALID [2018-11-14 17:07:17,619 INFO L273 TraceCheckUtils]: 52: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:17,619 INFO L273 TraceCheckUtils]: 53: Hoare triple {9084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:17,619 INFO L273 TraceCheckUtils]: 54: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:07:17,620 INFO L273 TraceCheckUtils]: 55: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:17,620 INFO L273 TraceCheckUtils]: 56: Hoare triple {9084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:17,620 INFO L273 TraceCheckUtils]: 57: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:07:17,620 INFO L273 TraceCheckUtils]: 58: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:17,620 INFO L273 TraceCheckUtils]: 59: Hoare triple {9084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:17,621 INFO L273 TraceCheckUtils]: 60: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:07:17,621 INFO L273 TraceCheckUtils]: 61: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:17,621 INFO L273 TraceCheckUtils]: 62: Hoare triple {9084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:17,621 INFO L273 TraceCheckUtils]: 63: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:07:17,621 INFO L273 TraceCheckUtils]: 64: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:17,621 INFO L273 TraceCheckUtils]: 65: Hoare triple {9084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:17,621 INFO L273 TraceCheckUtils]: 66: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:07:17,621 INFO L273 TraceCheckUtils]: 67: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:17,621 INFO L273 TraceCheckUtils]: 68: Hoare triple {9084#true} assume !(~i~0 < 100); {9084#true} is VALID [2018-11-14 17:07:17,622 INFO L273 TraceCheckUtils]: 69: Hoare triple {9084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9084#true} is VALID [2018-11-14 17:07:17,622 INFO L273 TraceCheckUtils]: 70: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:17,622 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {9084#true} {9085#false} #73#return; {9085#false} is VALID [2018-11-14 17:07:17,622 INFO L273 TraceCheckUtils]: 72: Hoare triple {9085#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {9085#false} is VALID [2018-11-14 17:07:17,622 INFO L256 TraceCheckUtils]: 73: Hoare triple {9085#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {9084#true} is VALID [2018-11-14 17:07:17,622 INFO L273 TraceCheckUtils]: 74: Hoare triple {9084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9084#true} is VALID [2018-11-14 17:07:17,622 INFO L273 TraceCheckUtils]: 75: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:17,622 INFO L273 TraceCheckUtils]: 76: Hoare triple {9084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:17,622 INFO L273 TraceCheckUtils]: 77: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:07:17,623 INFO L273 TraceCheckUtils]: 78: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:17,623 INFO L273 TraceCheckUtils]: 79: Hoare triple {9084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:17,623 INFO L273 TraceCheckUtils]: 80: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:07:17,623 INFO L273 TraceCheckUtils]: 81: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:17,623 INFO L273 TraceCheckUtils]: 82: Hoare triple {9084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:17,623 INFO L273 TraceCheckUtils]: 83: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:07:17,623 INFO L273 TraceCheckUtils]: 84: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:17,623 INFO L273 TraceCheckUtils]: 85: Hoare triple {9084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:17,624 INFO L273 TraceCheckUtils]: 86: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:07:17,624 INFO L273 TraceCheckUtils]: 87: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:17,624 INFO L273 TraceCheckUtils]: 88: Hoare triple {9084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:17,624 INFO L273 TraceCheckUtils]: 89: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:07:17,624 INFO L273 TraceCheckUtils]: 90: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:17,624 INFO L273 TraceCheckUtils]: 91: Hoare triple {9084#true} assume !(~i~0 < 100); {9084#true} is VALID [2018-11-14 17:07:17,624 INFO L273 TraceCheckUtils]: 92: Hoare triple {9084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9084#true} is VALID [2018-11-14 17:07:17,624 INFO L273 TraceCheckUtils]: 93: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:17,625 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {9084#true} {9085#false} #75#return; {9085#false} is VALID [2018-11-14 17:07:17,625 INFO L273 TraceCheckUtils]: 95: Hoare triple {9085#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {9085#false} is VALID [2018-11-14 17:07:17,625 INFO L273 TraceCheckUtils]: 96: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:17,625 INFO L273 TraceCheckUtils]: 97: Hoare triple {9085#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {9085#false} is VALID [2018-11-14 17:07:17,625 INFO L273 TraceCheckUtils]: 98: Hoare triple {9085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {9085#false} is VALID [2018-11-14 17:07:17,625 INFO L273 TraceCheckUtils]: 99: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:17,625 INFO L273 TraceCheckUtils]: 100: Hoare triple {9085#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {9085#false} is VALID [2018-11-14 17:07:17,625 INFO L273 TraceCheckUtils]: 101: Hoare triple {9085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {9085#false} is VALID [2018-11-14 17:07:17,625 INFO L273 TraceCheckUtils]: 102: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:17,626 INFO L273 TraceCheckUtils]: 103: Hoare triple {9085#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {9085#false} is VALID [2018-11-14 17:07:17,626 INFO L273 TraceCheckUtils]: 104: Hoare triple {9085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {9085#false} is VALID [2018-11-14 17:07:17,626 INFO L273 TraceCheckUtils]: 105: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:17,626 INFO L273 TraceCheckUtils]: 106: Hoare triple {9085#false} assume !(~i~2 < 99); {9085#false} is VALID [2018-11-14 17:07:17,626 INFO L273 TraceCheckUtils]: 107: Hoare triple {9085#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {9085#false} is VALID [2018-11-14 17:07:17,626 INFO L256 TraceCheckUtils]: 108: Hoare triple {9085#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {9084#true} is VALID [2018-11-14 17:07:17,626 INFO L273 TraceCheckUtils]: 109: Hoare triple {9084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9084#true} is VALID [2018-11-14 17:07:17,626 INFO L273 TraceCheckUtils]: 110: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:17,627 INFO L273 TraceCheckUtils]: 111: Hoare triple {9084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:17,627 INFO L273 TraceCheckUtils]: 112: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:07:17,627 INFO L273 TraceCheckUtils]: 113: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:17,627 INFO L273 TraceCheckUtils]: 114: Hoare triple {9084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:17,627 INFO L273 TraceCheckUtils]: 115: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:07:17,627 INFO L273 TraceCheckUtils]: 116: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:17,627 INFO L273 TraceCheckUtils]: 117: Hoare triple {9084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:17,627 INFO L273 TraceCheckUtils]: 118: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:07:17,627 INFO L273 TraceCheckUtils]: 119: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:17,628 INFO L273 TraceCheckUtils]: 120: Hoare triple {9084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:17,628 INFO L273 TraceCheckUtils]: 121: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:07:17,628 INFO L273 TraceCheckUtils]: 122: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:17,628 INFO L273 TraceCheckUtils]: 123: Hoare triple {9084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:07:17,628 INFO L273 TraceCheckUtils]: 124: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:07:17,628 INFO L273 TraceCheckUtils]: 125: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:17,628 INFO L273 TraceCheckUtils]: 126: Hoare triple {9084#true} assume !(~i~0 < 100); {9084#true} is VALID [2018-11-14 17:07:17,628 INFO L273 TraceCheckUtils]: 127: Hoare triple {9084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9084#true} is VALID [2018-11-14 17:07:17,629 INFO L273 TraceCheckUtils]: 128: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:17,629 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {9084#true} {9085#false} #77#return; {9085#false} is VALID [2018-11-14 17:07:17,629 INFO L273 TraceCheckUtils]: 130: Hoare triple {9085#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {9085#false} is VALID [2018-11-14 17:07:17,629 INFO L273 TraceCheckUtils]: 131: Hoare triple {9085#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {9085#false} is VALID [2018-11-14 17:07:17,629 INFO L273 TraceCheckUtils]: 132: Hoare triple {9085#false} assume !false; {9085#false} is VALID [2018-11-14 17:07:17,640 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2018-11-14 17:07:17,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:17,640 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:07:17,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:07:17,704 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:07:17,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:17,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:17,986 INFO L256 TraceCheckUtils]: 0: Hoare triple {9084#true} call ULTIMATE.init(); {9084#true} is VALID [2018-11-14 17:07:17,986 INFO L273 TraceCheckUtils]: 1: Hoare triple {9084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9084#true} is VALID [2018-11-14 17:07:17,987 INFO L273 TraceCheckUtils]: 2: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:07:17,987 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9084#true} {9084#true} #69#return; {9084#true} is VALID [2018-11-14 17:07:17,987 INFO L256 TraceCheckUtils]: 4: Hoare triple {9084#true} call #t~ret13 := main(); {9084#true} is VALID [2018-11-14 17:07:17,988 INFO L273 TraceCheckUtils]: 5: Hoare triple {9084#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9119#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:17,988 INFO L273 TraceCheckUtils]: 6: Hoare triple {9119#(<= main_~i~1 0)} assume true; {9119#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:17,989 INFO L273 TraceCheckUtils]: 7: Hoare triple {9119#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9119#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:17,989 INFO L273 TraceCheckUtils]: 8: Hoare triple {9119#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9087#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:17,989 INFO L273 TraceCheckUtils]: 9: Hoare triple {9087#(<= main_~i~1 1)} assume true; {9087#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:17,990 INFO L273 TraceCheckUtils]: 10: Hoare triple {9087#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9087#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:17,990 INFO L273 TraceCheckUtils]: 11: Hoare triple {9087#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9088#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:17,991 INFO L273 TraceCheckUtils]: 12: Hoare triple {9088#(<= main_~i~1 2)} assume true; {9088#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:17,991 INFO L273 TraceCheckUtils]: 13: Hoare triple {9088#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9088#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:17,992 INFO L273 TraceCheckUtils]: 14: Hoare triple {9088#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9089#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:17,992 INFO L273 TraceCheckUtils]: 15: Hoare triple {9089#(<= main_~i~1 3)} assume true; {9089#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:17,993 INFO L273 TraceCheckUtils]: 16: Hoare triple {9089#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9089#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:18,002 INFO L273 TraceCheckUtils]: 17: Hoare triple {9089#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9090#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:18,002 INFO L273 TraceCheckUtils]: 18: Hoare triple {9090#(<= main_~i~1 4)} assume true; {9090#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:18,002 INFO L273 TraceCheckUtils]: 19: Hoare triple {9090#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9090#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:18,003 INFO L273 TraceCheckUtils]: 20: Hoare triple {9090#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9091#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:18,003 INFO L273 TraceCheckUtils]: 21: Hoare triple {9091#(<= main_~i~1 5)} assume true; {9091#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:18,004 INFO L273 TraceCheckUtils]: 22: Hoare triple {9091#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9091#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:18,004 INFO L273 TraceCheckUtils]: 23: Hoare triple {9091#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9092#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:18,004 INFO L273 TraceCheckUtils]: 24: Hoare triple {9092#(<= main_~i~1 6)} assume true; {9092#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:18,005 INFO L273 TraceCheckUtils]: 25: Hoare triple {9092#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9092#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:18,005 INFO L273 TraceCheckUtils]: 26: Hoare triple {9092#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9093#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:18,005 INFO L273 TraceCheckUtils]: 27: Hoare triple {9093#(<= main_~i~1 7)} assume true; {9093#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:18,006 INFO L273 TraceCheckUtils]: 28: Hoare triple {9093#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9093#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:18,006 INFO L273 TraceCheckUtils]: 29: Hoare triple {9093#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9094#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:18,007 INFO L273 TraceCheckUtils]: 30: Hoare triple {9094#(<= main_~i~1 8)} assume true; {9094#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:18,007 INFO L273 TraceCheckUtils]: 31: Hoare triple {9094#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9094#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:18,008 INFO L273 TraceCheckUtils]: 32: Hoare triple {9094#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9095#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:18,008 INFO L273 TraceCheckUtils]: 33: Hoare triple {9095#(<= main_~i~1 9)} assume true; {9095#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:18,009 INFO L273 TraceCheckUtils]: 34: Hoare triple {9095#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9095#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:18,010 INFO L273 TraceCheckUtils]: 35: Hoare triple {9095#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9096#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:18,010 INFO L273 TraceCheckUtils]: 36: Hoare triple {9096#(<= main_~i~1 10)} assume true; {9096#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:18,011 INFO L273 TraceCheckUtils]: 37: Hoare triple {9096#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9096#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:18,011 INFO L273 TraceCheckUtils]: 38: Hoare triple {9096#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9097#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:18,012 INFO L273 TraceCheckUtils]: 39: Hoare triple {9097#(<= main_~i~1 11)} assume true; {9097#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:18,013 INFO L273 TraceCheckUtils]: 40: Hoare triple {9097#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9097#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:18,013 INFO L273 TraceCheckUtils]: 41: Hoare triple {9097#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9098#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:18,014 INFO L273 TraceCheckUtils]: 42: Hoare triple {9098#(<= main_~i~1 12)} assume true; {9098#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:18,014 INFO L273 TraceCheckUtils]: 43: Hoare triple {9098#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9098#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:18,015 INFO L273 TraceCheckUtils]: 44: Hoare triple {9098#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9099#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:18,016 INFO L273 TraceCheckUtils]: 45: Hoare triple {9099#(<= main_~i~1 13)} assume true; {9099#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:18,016 INFO L273 TraceCheckUtils]: 46: Hoare triple {9099#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9099#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:18,017 INFO L273 TraceCheckUtils]: 47: Hoare triple {9099#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9100#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:18,017 INFO L273 TraceCheckUtils]: 48: Hoare triple {9100#(<= main_~i~1 14)} assume true; {9100#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:18,018 INFO L273 TraceCheckUtils]: 49: Hoare triple {9100#(<= main_~i~1 14)} assume !(~i~1 < 100); {9085#false} is VALID [2018-11-14 17:07:18,018 INFO L256 TraceCheckUtils]: 50: Hoare triple {9085#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {9085#false} is VALID [2018-11-14 17:07:18,019 INFO L273 TraceCheckUtils]: 51: Hoare triple {9085#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9085#false} is VALID [2018-11-14 17:07:18,019 INFO L273 TraceCheckUtils]: 52: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:18,019 INFO L273 TraceCheckUtils]: 53: Hoare triple {9085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:18,019 INFO L273 TraceCheckUtils]: 54: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:07:18,019 INFO L273 TraceCheckUtils]: 55: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:18,020 INFO L273 TraceCheckUtils]: 56: Hoare triple {9085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:18,020 INFO L273 TraceCheckUtils]: 57: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:07:18,020 INFO L273 TraceCheckUtils]: 58: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:18,020 INFO L273 TraceCheckUtils]: 59: Hoare triple {9085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:18,020 INFO L273 TraceCheckUtils]: 60: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:07:18,020 INFO L273 TraceCheckUtils]: 61: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:18,021 INFO L273 TraceCheckUtils]: 62: Hoare triple {9085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:18,021 INFO L273 TraceCheckUtils]: 63: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:07:18,021 INFO L273 TraceCheckUtils]: 64: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:18,021 INFO L273 TraceCheckUtils]: 65: Hoare triple {9085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:18,021 INFO L273 TraceCheckUtils]: 66: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:07:18,021 INFO L273 TraceCheckUtils]: 67: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:18,022 INFO L273 TraceCheckUtils]: 68: Hoare triple {9085#false} assume !(~i~0 < 100); {9085#false} is VALID [2018-11-14 17:07:18,022 INFO L273 TraceCheckUtils]: 69: Hoare triple {9085#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9085#false} is VALID [2018-11-14 17:07:18,022 INFO L273 TraceCheckUtils]: 70: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:18,022 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {9085#false} {9085#false} #73#return; {9085#false} is VALID [2018-11-14 17:07:18,022 INFO L273 TraceCheckUtils]: 72: Hoare triple {9085#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {9085#false} is VALID [2018-11-14 17:07:18,022 INFO L256 TraceCheckUtils]: 73: Hoare triple {9085#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {9085#false} is VALID [2018-11-14 17:07:18,022 INFO L273 TraceCheckUtils]: 74: Hoare triple {9085#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9085#false} is VALID [2018-11-14 17:07:18,022 INFO L273 TraceCheckUtils]: 75: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:18,022 INFO L273 TraceCheckUtils]: 76: Hoare triple {9085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:18,023 INFO L273 TraceCheckUtils]: 77: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:07:18,023 INFO L273 TraceCheckUtils]: 78: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:18,023 INFO L273 TraceCheckUtils]: 79: Hoare triple {9085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:18,023 INFO L273 TraceCheckUtils]: 80: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:07:18,023 INFO L273 TraceCheckUtils]: 81: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:18,023 INFO L273 TraceCheckUtils]: 82: Hoare triple {9085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:18,023 INFO L273 TraceCheckUtils]: 83: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:07:18,023 INFO L273 TraceCheckUtils]: 84: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:18,024 INFO L273 TraceCheckUtils]: 85: Hoare triple {9085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:18,024 INFO L273 TraceCheckUtils]: 86: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:07:18,024 INFO L273 TraceCheckUtils]: 87: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:18,024 INFO L273 TraceCheckUtils]: 88: Hoare triple {9085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:18,024 INFO L273 TraceCheckUtils]: 89: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:07:18,024 INFO L273 TraceCheckUtils]: 90: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:18,024 INFO L273 TraceCheckUtils]: 91: Hoare triple {9085#false} assume !(~i~0 < 100); {9085#false} is VALID [2018-11-14 17:07:18,024 INFO L273 TraceCheckUtils]: 92: Hoare triple {9085#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9085#false} is VALID [2018-11-14 17:07:18,024 INFO L273 TraceCheckUtils]: 93: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:18,025 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {9085#false} {9085#false} #75#return; {9085#false} is VALID [2018-11-14 17:07:18,025 INFO L273 TraceCheckUtils]: 95: Hoare triple {9085#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {9085#false} is VALID [2018-11-14 17:07:18,025 INFO L273 TraceCheckUtils]: 96: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:18,025 INFO L273 TraceCheckUtils]: 97: Hoare triple {9085#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {9085#false} is VALID [2018-11-14 17:07:18,025 INFO L273 TraceCheckUtils]: 98: Hoare triple {9085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {9085#false} is VALID [2018-11-14 17:07:18,025 INFO L273 TraceCheckUtils]: 99: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:18,025 INFO L273 TraceCheckUtils]: 100: Hoare triple {9085#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {9085#false} is VALID [2018-11-14 17:07:18,025 INFO L273 TraceCheckUtils]: 101: Hoare triple {9085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {9085#false} is VALID [2018-11-14 17:07:18,025 INFO L273 TraceCheckUtils]: 102: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:18,026 INFO L273 TraceCheckUtils]: 103: Hoare triple {9085#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {9085#false} is VALID [2018-11-14 17:07:18,026 INFO L273 TraceCheckUtils]: 104: Hoare triple {9085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {9085#false} is VALID [2018-11-14 17:07:18,026 INFO L273 TraceCheckUtils]: 105: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:18,026 INFO L273 TraceCheckUtils]: 106: Hoare triple {9085#false} assume !(~i~2 < 99); {9085#false} is VALID [2018-11-14 17:07:18,026 INFO L273 TraceCheckUtils]: 107: Hoare triple {9085#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {9085#false} is VALID [2018-11-14 17:07:18,026 INFO L256 TraceCheckUtils]: 108: Hoare triple {9085#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {9085#false} is VALID [2018-11-14 17:07:18,026 INFO L273 TraceCheckUtils]: 109: Hoare triple {9085#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9085#false} is VALID [2018-11-14 17:07:18,026 INFO L273 TraceCheckUtils]: 110: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:18,026 INFO L273 TraceCheckUtils]: 111: Hoare triple {9085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:18,027 INFO L273 TraceCheckUtils]: 112: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:07:18,027 INFO L273 TraceCheckUtils]: 113: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:18,027 INFO L273 TraceCheckUtils]: 114: Hoare triple {9085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:18,027 INFO L273 TraceCheckUtils]: 115: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:07:18,027 INFO L273 TraceCheckUtils]: 116: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:18,027 INFO L273 TraceCheckUtils]: 117: Hoare triple {9085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:18,027 INFO L273 TraceCheckUtils]: 118: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:07:18,027 INFO L273 TraceCheckUtils]: 119: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:18,027 INFO L273 TraceCheckUtils]: 120: Hoare triple {9085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:18,028 INFO L273 TraceCheckUtils]: 121: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:07:18,028 INFO L273 TraceCheckUtils]: 122: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:18,028 INFO L273 TraceCheckUtils]: 123: Hoare triple {9085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:07:18,028 INFO L273 TraceCheckUtils]: 124: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:07:18,028 INFO L273 TraceCheckUtils]: 125: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:18,028 INFO L273 TraceCheckUtils]: 126: Hoare triple {9085#false} assume !(~i~0 < 100); {9085#false} is VALID [2018-11-14 17:07:18,029 INFO L273 TraceCheckUtils]: 127: Hoare triple {9085#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9085#false} is VALID [2018-11-14 17:07:18,029 INFO L273 TraceCheckUtils]: 128: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:07:18,029 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {9085#false} {9085#false} #77#return; {9085#false} is VALID [2018-11-14 17:07:18,029 INFO L273 TraceCheckUtils]: 130: Hoare triple {9085#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {9085#false} is VALID [2018-11-14 17:07:18,029 INFO L273 TraceCheckUtils]: 131: Hoare triple {9085#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {9085#false} is VALID [2018-11-14 17:07:18,029 INFO L273 TraceCheckUtils]: 132: Hoare triple {9085#false} assume !false; {9085#false} is VALID [2018-11-14 17:07:18,037 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2018-11-14 17:07:18,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:18,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-14 17:07:18,059 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 133 [2018-11-14 17:07:18,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:18,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 17:07:18,141 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:18,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 17:07:18,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 17:07:18,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:07:18,142 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 18 states. [2018-11-14 17:07:19,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:19,137 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-11-14 17:07:19,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 17:07:19,137 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 133 [2018-11-14 17:07:19,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:07:19,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 102 transitions. [2018-11-14 17:07:19,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:07:19,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 102 transitions. [2018-11-14 17:07:19,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 102 transitions. [2018-11-14 17:07:19,328 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:19,330 INFO L225 Difference]: With dead ends: 138 [2018-11-14 17:07:19,330 INFO L226 Difference]: Without dead ends: 96 [2018-11-14 17:07:19,331 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:07:19,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-14 17:07:19,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-14 17:07:19,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:19,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 95 states. [2018-11-14 17:07:19,441 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 95 states. [2018-11-14 17:07:19,441 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 95 states. [2018-11-14 17:07:19,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:19,443 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-14 17:07:19,443 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-14 17:07:19,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:19,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:19,444 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 96 states. [2018-11-14 17:07:19,444 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 96 states. [2018-11-14 17:07:19,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:19,445 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-14 17:07:19,445 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-14 17:07:19,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:19,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:19,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:19,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:19,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-14 17:07:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-11-14 17:07:19,448 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 133 [2018-11-14 17:07:19,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:19,448 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-11-14 17:07:19,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 17:07:19,448 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-14 17:07:19,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-14 17:07:19,449 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:19,449 INFO L375 BasicCegarLoop]: trace histogram [18, 16, 15, 15, 15, 15, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:07:19,449 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:19,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:19,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1279003789, now seen corresponding path program 15 times [2018-11-14 17:07:19,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:19,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:19,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:19,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:19,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:21,396 INFO L256 TraceCheckUtils]: 0: Hoare triple {10007#true} call ULTIMATE.init(); {10007#true} is VALID [2018-11-14 17:07:21,396 INFO L273 TraceCheckUtils]: 1: Hoare triple {10007#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10007#true} is VALID [2018-11-14 17:07:21,396 INFO L273 TraceCheckUtils]: 2: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,397 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10007#true} {10007#true} #69#return; {10007#true} is VALID [2018-11-14 17:07:21,397 INFO L256 TraceCheckUtils]: 4: Hoare triple {10007#true} call #t~ret13 := main(); {10007#true} is VALID [2018-11-14 17:07:21,397 INFO L273 TraceCheckUtils]: 5: Hoare triple {10007#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10009#(= main_~i~1 0)} is VALID [2018-11-14 17:07:21,398 INFO L273 TraceCheckUtils]: 6: Hoare triple {10009#(= main_~i~1 0)} assume true; {10009#(= main_~i~1 0)} is VALID [2018-11-14 17:07:21,398 INFO L273 TraceCheckUtils]: 7: Hoare triple {10009#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10009#(= main_~i~1 0)} is VALID [2018-11-14 17:07:21,399 INFO L273 TraceCheckUtils]: 8: Hoare triple {10009#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10010#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:21,400 INFO L273 TraceCheckUtils]: 9: Hoare triple {10010#(<= main_~i~1 1)} assume true; {10010#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:21,400 INFO L273 TraceCheckUtils]: 10: Hoare triple {10010#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10010#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:21,400 INFO L273 TraceCheckUtils]: 11: Hoare triple {10010#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10011#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:21,401 INFO L273 TraceCheckUtils]: 12: Hoare triple {10011#(<= main_~i~1 2)} assume true; {10011#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:21,401 INFO L273 TraceCheckUtils]: 13: Hoare triple {10011#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10011#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:21,401 INFO L273 TraceCheckUtils]: 14: Hoare triple {10011#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10012#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:21,402 INFO L273 TraceCheckUtils]: 15: Hoare triple {10012#(<= main_~i~1 3)} assume true; {10012#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:21,402 INFO L273 TraceCheckUtils]: 16: Hoare triple {10012#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10012#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:21,403 INFO L273 TraceCheckUtils]: 17: Hoare triple {10012#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10013#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:21,404 INFO L273 TraceCheckUtils]: 18: Hoare triple {10013#(<= main_~i~1 4)} assume true; {10013#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:21,404 INFO L273 TraceCheckUtils]: 19: Hoare triple {10013#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10013#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:21,405 INFO L273 TraceCheckUtils]: 20: Hoare triple {10013#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10014#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:21,405 INFO L273 TraceCheckUtils]: 21: Hoare triple {10014#(<= main_~i~1 5)} assume true; {10014#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:21,406 INFO L273 TraceCheckUtils]: 22: Hoare triple {10014#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10014#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:21,407 INFO L273 TraceCheckUtils]: 23: Hoare triple {10014#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10015#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:21,407 INFO L273 TraceCheckUtils]: 24: Hoare triple {10015#(<= main_~i~1 6)} assume true; {10015#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:21,408 INFO L273 TraceCheckUtils]: 25: Hoare triple {10015#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10015#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:21,408 INFO L273 TraceCheckUtils]: 26: Hoare triple {10015#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10016#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:21,409 INFO L273 TraceCheckUtils]: 27: Hoare triple {10016#(<= main_~i~1 7)} assume true; {10016#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:21,410 INFO L273 TraceCheckUtils]: 28: Hoare triple {10016#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10016#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:21,410 INFO L273 TraceCheckUtils]: 29: Hoare triple {10016#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10017#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:21,411 INFO L273 TraceCheckUtils]: 30: Hoare triple {10017#(<= main_~i~1 8)} assume true; {10017#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:21,411 INFO L273 TraceCheckUtils]: 31: Hoare triple {10017#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10017#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:21,412 INFO L273 TraceCheckUtils]: 32: Hoare triple {10017#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10018#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:21,413 INFO L273 TraceCheckUtils]: 33: Hoare triple {10018#(<= main_~i~1 9)} assume true; {10018#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:21,413 INFO L273 TraceCheckUtils]: 34: Hoare triple {10018#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10018#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:21,414 INFO L273 TraceCheckUtils]: 35: Hoare triple {10018#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10019#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:21,414 INFO L273 TraceCheckUtils]: 36: Hoare triple {10019#(<= main_~i~1 10)} assume true; {10019#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:21,415 INFO L273 TraceCheckUtils]: 37: Hoare triple {10019#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10019#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:21,416 INFO L273 TraceCheckUtils]: 38: Hoare triple {10019#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10020#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:21,416 INFO L273 TraceCheckUtils]: 39: Hoare triple {10020#(<= main_~i~1 11)} assume true; {10020#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:21,417 INFO L273 TraceCheckUtils]: 40: Hoare triple {10020#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10020#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:21,417 INFO L273 TraceCheckUtils]: 41: Hoare triple {10020#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10021#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:21,418 INFO L273 TraceCheckUtils]: 42: Hoare triple {10021#(<= main_~i~1 12)} assume true; {10021#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:21,418 INFO L273 TraceCheckUtils]: 43: Hoare triple {10021#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10021#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:21,419 INFO L273 TraceCheckUtils]: 44: Hoare triple {10021#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10022#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:21,420 INFO L273 TraceCheckUtils]: 45: Hoare triple {10022#(<= main_~i~1 13)} assume true; {10022#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:21,420 INFO L273 TraceCheckUtils]: 46: Hoare triple {10022#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10022#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:21,421 INFO L273 TraceCheckUtils]: 47: Hoare triple {10022#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10023#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:21,422 INFO L273 TraceCheckUtils]: 48: Hoare triple {10023#(<= main_~i~1 14)} assume true; {10023#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:21,422 INFO L273 TraceCheckUtils]: 49: Hoare triple {10023#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10023#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:21,423 INFO L273 TraceCheckUtils]: 50: Hoare triple {10023#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10024#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:21,423 INFO L273 TraceCheckUtils]: 51: Hoare triple {10024#(<= main_~i~1 15)} assume true; {10024#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:21,424 INFO L273 TraceCheckUtils]: 52: Hoare triple {10024#(<= main_~i~1 15)} assume !(~i~1 < 100); {10008#false} is VALID [2018-11-14 17:07:21,424 INFO L256 TraceCheckUtils]: 53: Hoare triple {10008#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {10007#true} is VALID [2018-11-14 17:07:21,424 INFO L273 TraceCheckUtils]: 54: Hoare triple {10007#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10007#true} is VALID [2018-11-14 17:07:21,425 INFO L273 TraceCheckUtils]: 55: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,425 INFO L273 TraceCheckUtils]: 56: Hoare triple {10007#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:07:21,425 INFO L273 TraceCheckUtils]: 57: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:07:21,425 INFO L273 TraceCheckUtils]: 58: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,425 INFO L273 TraceCheckUtils]: 59: Hoare triple {10007#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:07:21,426 INFO L273 TraceCheckUtils]: 60: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:07:21,426 INFO L273 TraceCheckUtils]: 61: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,426 INFO L273 TraceCheckUtils]: 62: Hoare triple {10007#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:07:21,426 INFO L273 TraceCheckUtils]: 63: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:07:21,426 INFO L273 TraceCheckUtils]: 64: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,427 INFO L273 TraceCheckUtils]: 65: Hoare triple {10007#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:07:21,427 INFO L273 TraceCheckUtils]: 66: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:07:21,427 INFO L273 TraceCheckUtils]: 67: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,427 INFO L273 TraceCheckUtils]: 68: Hoare triple {10007#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:07:21,427 INFO L273 TraceCheckUtils]: 69: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:07:21,428 INFO L273 TraceCheckUtils]: 70: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,428 INFO L273 TraceCheckUtils]: 71: Hoare triple {10007#true} assume !(~i~0 < 100); {10007#true} is VALID [2018-11-14 17:07:21,428 INFO L273 TraceCheckUtils]: 72: Hoare triple {10007#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10007#true} is VALID [2018-11-14 17:07:21,428 INFO L273 TraceCheckUtils]: 73: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,428 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {10007#true} {10008#false} #73#return; {10008#false} is VALID [2018-11-14 17:07:21,429 INFO L273 TraceCheckUtils]: 75: Hoare triple {10008#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {10008#false} is VALID [2018-11-14 17:07:21,429 INFO L256 TraceCheckUtils]: 76: Hoare triple {10008#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {10007#true} is VALID [2018-11-14 17:07:21,429 INFO L273 TraceCheckUtils]: 77: Hoare triple {10007#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10007#true} is VALID [2018-11-14 17:07:21,429 INFO L273 TraceCheckUtils]: 78: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,429 INFO L273 TraceCheckUtils]: 79: Hoare triple {10007#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:07:21,430 INFO L273 TraceCheckUtils]: 80: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:07:21,430 INFO L273 TraceCheckUtils]: 81: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,430 INFO L273 TraceCheckUtils]: 82: Hoare triple {10007#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:07:21,430 INFO L273 TraceCheckUtils]: 83: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:07:21,430 INFO L273 TraceCheckUtils]: 84: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,430 INFO L273 TraceCheckUtils]: 85: Hoare triple {10007#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:07:21,430 INFO L273 TraceCheckUtils]: 86: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:07:21,430 INFO L273 TraceCheckUtils]: 87: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,431 INFO L273 TraceCheckUtils]: 88: Hoare triple {10007#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:07:21,431 INFO L273 TraceCheckUtils]: 89: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:07:21,431 INFO L273 TraceCheckUtils]: 90: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,431 INFO L273 TraceCheckUtils]: 91: Hoare triple {10007#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:07:21,431 INFO L273 TraceCheckUtils]: 92: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:07:21,431 INFO L273 TraceCheckUtils]: 93: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,431 INFO L273 TraceCheckUtils]: 94: Hoare triple {10007#true} assume !(~i~0 < 100); {10007#true} is VALID [2018-11-14 17:07:21,431 INFO L273 TraceCheckUtils]: 95: Hoare triple {10007#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10007#true} is VALID [2018-11-14 17:07:21,431 INFO L273 TraceCheckUtils]: 96: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,432 INFO L268 TraceCheckUtils]: 97: Hoare quadruple {10007#true} {10008#false} #75#return; {10008#false} is VALID [2018-11-14 17:07:21,432 INFO L273 TraceCheckUtils]: 98: Hoare triple {10008#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {10008#false} is VALID [2018-11-14 17:07:21,432 INFO L273 TraceCheckUtils]: 99: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:07:21,432 INFO L273 TraceCheckUtils]: 100: Hoare triple {10008#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10008#false} is VALID [2018-11-14 17:07:21,432 INFO L273 TraceCheckUtils]: 101: Hoare triple {10008#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10008#false} is VALID [2018-11-14 17:07:21,432 INFO L273 TraceCheckUtils]: 102: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:07:21,432 INFO L273 TraceCheckUtils]: 103: Hoare triple {10008#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10008#false} is VALID [2018-11-14 17:07:21,432 INFO L273 TraceCheckUtils]: 104: Hoare triple {10008#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10008#false} is VALID [2018-11-14 17:07:21,432 INFO L273 TraceCheckUtils]: 105: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:07:21,433 INFO L273 TraceCheckUtils]: 106: Hoare triple {10008#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10008#false} is VALID [2018-11-14 17:07:21,433 INFO L273 TraceCheckUtils]: 107: Hoare triple {10008#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10008#false} is VALID [2018-11-14 17:07:21,433 INFO L273 TraceCheckUtils]: 108: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:07:21,433 INFO L273 TraceCheckUtils]: 109: Hoare triple {10008#false} assume !(~i~2 < 99); {10008#false} is VALID [2018-11-14 17:07:21,433 INFO L273 TraceCheckUtils]: 110: Hoare triple {10008#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {10008#false} is VALID [2018-11-14 17:07:21,433 INFO L256 TraceCheckUtils]: 111: Hoare triple {10008#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {10007#true} is VALID [2018-11-14 17:07:21,433 INFO L273 TraceCheckUtils]: 112: Hoare triple {10007#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10007#true} is VALID [2018-11-14 17:07:21,433 INFO L273 TraceCheckUtils]: 113: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,434 INFO L273 TraceCheckUtils]: 114: Hoare triple {10007#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:07:21,434 INFO L273 TraceCheckUtils]: 115: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:07:21,434 INFO L273 TraceCheckUtils]: 116: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,434 INFO L273 TraceCheckUtils]: 117: Hoare triple {10007#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:07:21,434 INFO L273 TraceCheckUtils]: 118: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:07:21,434 INFO L273 TraceCheckUtils]: 119: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,434 INFO L273 TraceCheckUtils]: 120: Hoare triple {10007#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:07:21,434 INFO L273 TraceCheckUtils]: 121: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:07:21,434 INFO L273 TraceCheckUtils]: 122: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,435 INFO L273 TraceCheckUtils]: 123: Hoare triple {10007#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:07:21,435 INFO L273 TraceCheckUtils]: 124: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:07:21,435 INFO L273 TraceCheckUtils]: 125: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,435 INFO L273 TraceCheckUtils]: 126: Hoare triple {10007#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:07:21,435 INFO L273 TraceCheckUtils]: 127: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:07:21,435 INFO L273 TraceCheckUtils]: 128: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,435 INFO L273 TraceCheckUtils]: 129: Hoare triple {10007#true} assume !(~i~0 < 100); {10007#true} is VALID [2018-11-14 17:07:21,435 INFO L273 TraceCheckUtils]: 130: Hoare triple {10007#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10007#true} is VALID [2018-11-14 17:07:21,435 INFO L273 TraceCheckUtils]: 131: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,436 INFO L268 TraceCheckUtils]: 132: Hoare quadruple {10007#true} {10008#false} #77#return; {10008#false} is VALID [2018-11-14 17:07:21,436 INFO L273 TraceCheckUtils]: 133: Hoare triple {10008#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {10008#false} is VALID [2018-11-14 17:07:21,436 INFO L273 TraceCheckUtils]: 134: Hoare triple {10008#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {10008#false} is VALID [2018-11-14 17:07:21,436 INFO L273 TraceCheckUtils]: 135: Hoare triple {10008#false} assume !false; {10008#false} is VALID [2018-11-14 17:07:21,444 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2018-11-14 17:07:21,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:21,444 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:07:21,453 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:07:21,492 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-14 17:07:21,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:21,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:21,676 INFO L256 TraceCheckUtils]: 0: Hoare triple {10007#true} call ULTIMATE.init(); {10007#true} is VALID [2018-11-14 17:07:21,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {10007#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10007#true} is VALID [2018-11-14 17:07:21,677 INFO L273 TraceCheckUtils]: 2: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,677 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10007#true} {10007#true} #69#return; {10007#true} is VALID [2018-11-14 17:07:21,677 INFO L256 TraceCheckUtils]: 4: Hoare triple {10007#true} call #t~ret13 := main(); {10007#true} is VALID [2018-11-14 17:07:21,677 INFO L273 TraceCheckUtils]: 5: Hoare triple {10007#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10007#true} is VALID [2018-11-14 17:07:21,678 INFO L273 TraceCheckUtils]: 6: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,678 INFO L273 TraceCheckUtils]: 7: Hoare triple {10007#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:07:21,678 INFO L273 TraceCheckUtils]: 8: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:07:21,678 INFO L273 TraceCheckUtils]: 9: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,678 INFO L273 TraceCheckUtils]: 10: Hoare triple {10007#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:07:21,679 INFO L273 TraceCheckUtils]: 11: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:07:21,679 INFO L273 TraceCheckUtils]: 12: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,679 INFO L273 TraceCheckUtils]: 13: Hoare triple {10007#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:07:21,679 INFO L273 TraceCheckUtils]: 14: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:07:21,679 INFO L273 TraceCheckUtils]: 15: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,679 INFO L273 TraceCheckUtils]: 16: Hoare triple {10007#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:07:21,679 INFO L273 TraceCheckUtils]: 17: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:07:21,680 INFO L273 TraceCheckUtils]: 18: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,680 INFO L273 TraceCheckUtils]: 19: Hoare triple {10007#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:07:21,680 INFO L273 TraceCheckUtils]: 20: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:07:21,680 INFO L273 TraceCheckUtils]: 21: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,680 INFO L273 TraceCheckUtils]: 22: Hoare triple {10007#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:07:21,680 INFO L273 TraceCheckUtils]: 23: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:07:21,680 INFO L273 TraceCheckUtils]: 24: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,680 INFO L273 TraceCheckUtils]: 25: Hoare triple {10007#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:07:21,680 INFO L273 TraceCheckUtils]: 26: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:07:21,681 INFO L273 TraceCheckUtils]: 27: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,681 INFO L273 TraceCheckUtils]: 28: Hoare triple {10007#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:07:21,681 INFO L273 TraceCheckUtils]: 29: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:07:21,681 INFO L273 TraceCheckUtils]: 30: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,681 INFO L273 TraceCheckUtils]: 31: Hoare triple {10007#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:07:21,681 INFO L273 TraceCheckUtils]: 32: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:07:21,681 INFO L273 TraceCheckUtils]: 33: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,681 INFO L273 TraceCheckUtils]: 34: Hoare triple {10007#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:07:21,681 INFO L273 TraceCheckUtils]: 35: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:07:21,682 INFO L273 TraceCheckUtils]: 36: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,682 INFO L273 TraceCheckUtils]: 37: Hoare triple {10007#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:07:21,682 INFO L273 TraceCheckUtils]: 38: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:07:21,682 INFO L273 TraceCheckUtils]: 39: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,682 INFO L273 TraceCheckUtils]: 40: Hoare triple {10007#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:07:21,682 INFO L273 TraceCheckUtils]: 41: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:07:21,682 INFO L273 TraceCheckUtils]: 42: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,682 INFO L273 TraceCheckUtils]: 43: Hoare triple {10007#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:07:21,683 INFO L273 TraceCheckUtils]: 44: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:07:21,683 INFO L273 TraceCheckUtils]: 45: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,683 INFO L273 TraceCheckUtils]: 46: Hoare triple {10007#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:07:21,683 INFO L273 TraceCheckUtils]: 47: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:07:21,683 INFO L273 TraceCheckUtils]: 48: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,683 INFO L273 TraceCheckUtils]: 49: Hoare triple {10007#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:07:21,683 INFO L273 TraceCheckUtils]: 50: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:07:21,683 INFO L273 TraceCheckUtils]: 51: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,683 INFO L273 TraceCheckUtils]: 52: Hoare triple {10007#true} assume !(~i~1 < 100); {10007#true} is VALID [2018-11-14 17:07:21,684 INFO L256 TraceCheckUtils]: 53: Hoare triple {10007#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {10007#true} is VALID [2018-11-14 17:07:21,684 INFO L273 TraceCheckUtils]: 54: Hoare triple {10007#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10007#true} is VALID [2018-11-14 17:07:21,684 INFO L273 TraceCheckUtils]: 55: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,684 INFO L273 TraceCheckUtils]: 56: Hoare triple {10007#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:07:21,684 INFO L273 TraceCheckUtils]: 57: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:07:21,684 INFO L273 TraceCheckUtils]: 58: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,684 INFO L273 TraceCheckUtils]: 59: Hoare triple {10007#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:07:21,684 INFO L273 TraceCheckUtils]: 60: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:07:21,685 INFO L273 TraceCheckUtils]: 61: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,685 INFO L273 TraceCheckUtils]: 62: Hoare triple {10007#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:07:21,685 INFO L273 TraceCheckUtils]: 63: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:07:21,685 INFO L273 TraceCheckUtils]: 64: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,685 INFO L273 TraceCheckUtils]: 65: Hoare triple {10007#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:07:21,685 INFO L273 TraceCheckUtils]: 66: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:07:21,685 INFO L273 TraceCheckUtils]: 67: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,685 INFO L273 TraceCheckUtils]: 68: Hoare triple {10007#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:07:21,685 INFO L273 TraceCheckUtils]: 69: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:07:21,686 INFO L273 TraceCheckUtils]: 70: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,686 INFO L273 TraceCheckUtils]: 71: Hoare triple {10007#true} assume !(~i~0 < 100); {10007#true} is VALID [2018-11-14 17:07:21,686 INFO L273 TraceCheckUtils]: 72: Hoare triple {10007#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10007#true} is VALID [2018-11-14 17:07:21,686 INFO L273 TraceCheckUtils]: 73: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,686 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {10007#true} {10007#true} #73#return; {10007#true} is VALID [2018-11-14 17:07:21,686 INFO L273 TraceCheckUtils]: 75: Hoare triple {10007#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {10007#true} is VALID [2018-11-14 17:07:21,686 INFO L256 TraceCheckUtils]: 76: Hoare triple {10007#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {10007#true} is VALID [2018-11-14 17:07:21,686 INFO L273 TraceCheckUtils]: 77: Hoare triple {10007#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10007#true} is VALID [2018-11-14 17:07:21,686 INFO L273 TraceCheckUtils]: 78: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,687 INFO L273 TraceCheckUtils]: 79: Hoare triple {10007#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:07:21,687 INFO L273 TraceCheckUtils]: 80: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:07:21,687 INFO L273 TraceCheckUtils]: 81: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,687 INFO L273 TraceCheckUtils]: 82: Hoare triple {10007#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:07:21,687 INFO L273 TraceCheckUtils]: 83: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:07:21,687 INFO L273 TraceCheckUtils]: 84: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,687 INFO L273 TraceCheckUtils]: 85: Hoare triple {10007#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:07:21,687 INFO L273 TraceCheckUtils]: 86: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:07:21,687 INFO L273 TraceCheckUtils]: 87: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,688 INFO L273 TraceCheckUtils]: 88: Hoare triple {10007#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:07:21,688 INFO L273 TraceCheckUtils]: 89: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:07:21,688 INFO L273 TraceCheckUtils]: 90: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,688 INFO L273 TraceCheckUtils]: 91: Hoare triple {10007#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:07:21,688 INFO L273 TraceCheckUtils]: 92: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:07:21,688 INFO L273 TraceCheckUtils]: 93: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,688 INFO L273 TraceCheckUtils]: 94: Hoare triple {10007#true} assume !(~i~0 < 100); {10007#true} is VALID [2018-11-14 17:07:21,688 INFO L273 TraceCheckUtils]: 95: Hoare triple {10007#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10007#true} is VALID [2018-11-14 17:07:21,689 INFO L273 TraceCheckUtils]: 96: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:07:21,689 INFO L268 TraceCheckUtils]: 97: Hoare quadruple {10007#true} {10007#true} #75#return; {10007#true} is VALID [2018-11-14 17:07:21,689 INFO L273 TraceCheckUtils]: 98: Hoare triple {10007#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {10322#(<= main_~i~2 0)} is VALID [2018-11-14 17:07:21,690 INFO L273 TraceCheckUtils]: 99: Hoare triple {10322#(<= main_~i~2 0)} assume true; {10322#(<= main_~i~2 0)} is VALID [2018-11-14 17:07:21,690 INFO L273 TraceCheckUtils]: 100: Hoare triple {10322#(<= main_~i~2 0)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10322#(<= main_~i~2 0)} is VALID [2018-11-14 17:07:21,690 INFO L273 TraceCheckUtils]: 101: Hoare triple {10322#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10332#(<= main_~i~2 1)} is VALID [2018-11-14 17:07:21,691 INFO L273 TraceCheckUtils]: 102: Hoare triple {10332#(<= main_~i~2 1)} assume true; {10332#(<= main_~i~2 1)} is VALID [2018-11-14 17:07:21,691 INFO L273 TraceCheckUtils]: 103: Hoare triple {10332#(<= main_~i~2 1)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10332#(<= main_~i~2 1)} is VALID [2018-11-14 17:07:21,691 INFO L273 TraceCheckUtils]: 104: Hoare triple {10332#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10342#(<= main_~i~2 2)} is VALID [2018-11-14 17:07:21,692 INFO L273 TraceCheckUtils]: 105: Hoare triple {10342#(<= main_~i~2 2)} assume true; {10342#(<= main_~i~2 2)} is VALID [2018-11-14 17:07:21,692 INFO L273 TraceCheckUtils]: 106: Hoare triple {10342#(<= main_~i~2 2)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10342#(<= main_~i~2 2)} is VALID [2018-11-14 17:07:21,693 INFO L273 TraceCheckUtils]: 107: Hoare triple {10342#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10352#(<= main_~i~2 3)} is VALID [2018-11-14 17:07:21,693 INFO L273 TraceCheckUtils]: 108: Hoare triple {10352#(<= main_~i~2 3)} assume true; {10352#(<= main_~i~2 3)} is VALID [2018-11-14 17:07:21,694 INFO L273 TraceCheckUtils]: 109: Hoare triple {10352#(<= main_~i~2 3)} assume !(~i~2 < 99); {10008#false} is VALID [2018-11-14 17:07:21,694 INFO L273 TraceCheckUtils]: 110: Hoare triple {10008#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {10008#false} is VALID [2018-11-14 17:07:21,694 INFO L256 TraceCheckUtils]: 111: Hoare triple {10008#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {10008#false} is VALID [2018-11-14 17:07:21,695 INFO L273 TraceCheckUtils]: 112: Hoare triple {10008#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10008#false} is VALID [2018-11-14 17:07:21,695 INFO L273 TraceCheckUtils]: 113: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:07:21,695 INFO L273 TraceCheckUtils]: 114: Hoare triple {10008#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10008#false} is VALID [2018-11-14 17:07:21,695 INFO L273 TraceCheckUtils]: 115: Hoare triple {10008#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10008#false} is VALID [2018-11-14 17:07:21,695 INFO L273 TraceCheckUtils]: 116: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:07:21,696 INFO L273 TraceCheckUtils]: 117: Hoare triple {10008#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10008#false} is VALID [2018-11-14 17:07:21,696 INFO L273 TraceCheckUtils]: 118: Hoare triple {10008#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10008#false} is VALID [2018-11-14 17:07:21,696 INFO L273 TraceCheckUtils]: 119: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:07:21,696 INFO L273 TraceCheckUtils]: 120: Hoare triple {10008#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10008#false} is VALID [2018-11-14 17:07:21,696 INFO L273 TraceCheckUtils]: 121: Hoare triple {10008#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10008#false} is VALID [2018-11-14 17:07:21,697 INFO L273 TraceCheckUtils]: 122: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:07:21,697 INFO L273 TraceCheckUtils]: 123: Hoare triple {10008#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10008#false} is VALID [2018-11-14 17:07:21,697 INFO L273 TraceCheckUtils]: 124: Hoare triple {10008#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10008#false} is VALID [2018-11-14 17:07:21,697 INFO L273 TraceCheckUtils]: 125: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:07:21,697 INFO L273 TraceCheckUtils]: 126: Hoare triple {10008#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10008#false} is VALID [2018-11-14 17:07:21,697 INFO L273 TraceCheckUtils]: 127: Hoare triple {10008#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10008#false} is VALID [2018-11-14 17:07:21,698 INFO L273 TraceCheckUtils]: 128: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:07:21,698 INFO L273 TraceCheckUtils]: 129: Hoare triple {10008#false} assume !(~i~0 < 100); {10008#false} is VALID [2018-11-14 17:07:21,698 INFO L273 TraceCheckUtils]: 130: Hoare triple {10008#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10008#false} is VALID [2018-11-14 17:07:21,698 INFO L273 TraceCheckUtils]: 131: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:07:21,698 INFO L268 TraceCheckUtils]: 132: Hoare quadruple {10008#false} {10008#false} #77#return; {10008#false} is VALID [2018-11-14 17:07:21,698 INFO L273 TraceCheckUtils]: 133: Hoare triple {10008#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {10008#false} is VALID [2018-11-14 17:07:21,698 INFO L273 TraceCheckUtils]: 134: Hoare triple {10008#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {10008#false} is VALID [2018-11-14 17:07:21,698 INFO L273 TraceCheckUtils]: 135: Hoare triple {10008#false} assume !false; {10008#false} is VALID [2018-11-14 17:07:21,709 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 202 proven. 15 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2018-11-14 17:07:21,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:21,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6] total 22 [2018-11-14 17:07:21,730 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 136 [2018-11-14 17:07:21,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:21,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 17:07:21,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:21,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 17:07:21,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 17:07:21,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-11-14 17:07:21,840 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 22 states. [2018-11-14 17:07:22,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:22,322 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-11-14 17:07:22,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 17:07:22,322 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 136 [2018-11-14 17:07:22,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:22,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 17:07:22,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 118 transitions. [2018-11-14 17:07:22,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 17:07:22,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 118 transitions. [2018-11-14 17:07:22,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 118 transitions. [2018-11-14 17:07:22,472 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:22,474 INFO L225 Difference]: With dead ends: 145 [2018-11-14 17:07:22,474 INFO L226 Difference]: Without dead ends: 103 [2018-11-14 17:07:22,475 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-11-14 17:07:22,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-14 17:07:22,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-11-14 17:07:22,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:22,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 101 states. [2018-11-14 17:07:22,508 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 101 states. [2018-11-14 17:07:22,509 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 101 states. [2018-11-14 17:07:22,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:22,511 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-11-14 17:07:22,512 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-14 17:07:22,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:22,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:22,512 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 103 states. [2018-11-14 17:07:22,513 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 103 states. [2018-11-14 17:07:22,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:22,515 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-11-14 17:07:22,515 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-14 17:07:22,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:22,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:22,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:22,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:22,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-14 17:07:22,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2018-11-14 17:07:22,518 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 136 [2018-11-14 17:07:22,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:22,518 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2018-11-14 17:07:22,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-14 17:07:22,518 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-14 17:07:22,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-14 17:07:22,519 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:22,520 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 16, 16, 15, 15, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:07:22,520 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:22,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:22,520 INFO L82 PathProgramCache]: Analyzing trace with hash 562002789, now seen corresponding path program 16 times [2018-11-14 17:07:22,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:22,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:22,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:22,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:22,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:23,062 INFO L256 TraceCheckUtils]: 0: Hoare triple {10974#true} call ULTIMATE.init(); {10974#true} is VALID [2018-11-14 17:07:23,062 INFO L273 TraceCheckUtils]: 1: Hoare triple {10974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10974#true} is VALID [2018-11-14 17:07:23,062 INFO L273 TraceCheckUtils]: 2: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,062 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10974#true} {10974#true} #69#return; {10974#true} is VALID [2018-11-14 17:07:23,063 INFO L256 TraceCheckUtils]: 4: Hoare triple {10974#true} call #t~ret13 := main(); {10974#true} is VALID [2018-11-14 17:07:23,063 INFO L273 TraceCheckUtils]: 5: Hoare triple {10974#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10976#(= main_~i~1 0)} is VALID [2018-11-14 17:07:23,064 INFO L273 TraceCheckUtils]: 6: Hoare triple {10976#(= main_~i~1 0)} assume true; {10976#(= main_~i~1 0)} is VALID [2018-11-14 17:07:23,064 INFO L273 TraceCheckUtils]: 7: Hoare triple {10976#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10976#(= main_~i~1 0)} is VALID [2018-11-14 17:07:23,065 INFO L273 TraceCheckUtils]: 8: Hoare triple {10976#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10977#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:23,065 INFO L273 TraceCheckUtils]: 9: Hoare triple {10977#(<= main_~i~1 1)} assume true; {10977#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:23,066 INFO L273 TraceCheckUtils]: 10: Hoare triple {10977#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10977#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:23,067 INFO L273 TraceCheckUtils]: 11: Hoare triple {10977#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10978#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:23,067 INFO L273 TraceCheckUtils]: 12: Hoare triple {10978#(<= main_~i~1 2)} assume true; {10978#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:23,068 INFO L273 TraceCheckUtils]: 13: Hoare triple {10978#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10978#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:23,068 INFO L273 TraceCheckUtils]: 14: Hoare triple {10978#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10979#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:23,069 INFO L273 TraceCheckUtils]: 15: Hoare triple {10979#(<= main_~i~1 3)} assume true; {10979#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:23,069 INFO L273 TraceCheckUtils]: 16: Hoare triple {10979#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10979#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:23,070 INFO L273 TraceCheckUtils]: 17: Hoare triple {10979#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10980#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:23,071 INFO L273 TraceCheckUtils]: 18: Hoare triple {10980#(<= main_~i~1 4)} assume true; {10980#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:23,071 INFO L273 TraceCheckUtils]: 19: Hoare triple {10980#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10980#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:23,072 INFO L273 TraceCheckUtils]: 20: Hoare triple {10980#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10981#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:23,072 INFO L273 TraceCheckUtils]: 21: Hoare triple {10981#(<= main_~i~1 5)} assume true; {10981#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:23,073 INFO L273 TraceCheckUtils]: 22: Hoare triple {10981#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10981#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:23,073 INFO L273 TraceCheckUtils]: 23: Hoare triple {10981#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10982#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:23,074 INFO L273 TraceCheckUtils]: 24: Hoare triple {10982#(<= main_~i~1 6)} assume true; {10982#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:23,074 INFO L273 TraceCheckUtils]: 25: Hoare triple {10982#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10982#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:23,075 INFO L273 TraceCheckUtils]: 26: Hoare triple {10982#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10983#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:23,076 INFO L273 TraceCheckUtils]: 27: Hoare triple {10983#(<= main_~i~1 7)} assume true; {10983#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:23,076 INFO L273 TraceCheckUtils]: 28: Hoare triple {10983#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10983#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:23,077 INFO L273 TraceCheckUtils]: 29: Hoare triple {10983#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10984#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:23,077 INFO L273 TraceCheckUtils]: 30: Hoare triple {10984#(<= main_~i~1 8)} assume true; {10984#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:23,078 INFO L273 TraceCheckUtils]: 31: Hoare triple {10984#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10984#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:23,079 INFO L273 TraceCheckUtils]: 32: Hoare triple {10984#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10985#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:23,079 INFO L273 TraceCheckUtils]: 33: Hoare triple {10985#(<= main_~i~1 9)} assume true; {10985#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:23,080 INFO L273 TraceCheckUtils]: 34: Hoare triple {10985#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10985#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:23,080 INFO L273 TraceCheckUtils]: 35: Hoare triple {10985#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10986#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:23,081 INFO L273 TraceCheckUtils]: 36: Hoare triple {10986#(<= main_~i~1 10)} assume true; {10986#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:23,081 INFO L273 TraceCheckUtils]: 37: Hoare triple {10986#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10986#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:23,082 INFO L273 TraceCheckUtils]: 38: Hoare triple {10986#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10987#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:23,083 INFO L273 TraceCheckUtils]: 39: Hoare triple {10987#(<= main_~i~1 11)} assume true; {10987#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:23,083 INFO L273 TraceCheckUtils]: 40: Hoare triple {10987#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10987#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:23,084 INFO L273 TraceCheckUtils]: 41: Hoare triple {10987#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10988#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:23,085 INFO L273 TraceCheckUtils]: 42: Hoare triple {10988#(<= main_~i~1 12)} assume true; {10988#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:23,085 INFO L273 TraceCheckUtils]: 43: Hoare triple {10988#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10988#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:23,086 INFO L273 TraceCheckUtils]: 44: Hoare triple {10988#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10989#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:23,086 INFO L273 TraceCheckUtils]: 45: Hoare triple {10989#(<= main_~i~1 13)} assume true; {10989#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:23,087 INFO L273 TraceCheckUtils]: 46: Hoare triple {10989#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10989#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:23,088 INFO L273 TraceCheckUtils]: 47: Hoare triple {10989#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10990#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:23,088 INFO L273 TraceCheckUtils]: 48: Hoare triple {10990#(<= main_~i~1 14)} assume true; {10990#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:23,089 INFO L273 TraceCheckUtils]: 49: Hoare triple {10990#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10990#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:23,089 INFO L273 TraceCheckUtils]: 50: Hoare triple {10990#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10991#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:23,090 INFO L273 TraceCheckUtils]: 51: Hoare triple {10991#(<= main_~i~1 15)} assume true; {10991#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:23,090 INFO L273 TraceCheckUtils]: 52: Hoare triple {10991#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10991#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:23,091 INFO L273 TraceCheckUtils]: 53: Hoare triple {10991#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10992#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:23,092 INFO L273 TraceCheckUtils]: 54: Hoare triple {10992#(<= main_~i~1 16)} assume true; {10992#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:23,092 INFO L273 TraceCheckUtils]: 55: Hoare triple {10992#(<= main_~i~1 16)} assume !(~i~1 < 100); {10975#false} is VALID [2018-11-14 17:07:23,093 INFO L256 TraceCheckUtils]: 56: Hoare triple {10975#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 17:07:23,093 INFO L273 TraceCheckUtils]: 57: Hoare triple {10974#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10974#true} is VALID [2018-11-14 17:07:23,093 INFO L273 TraceCheckUtils]: 58: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,093 INFO L273 TraceCheckUtils]: 59: Hoare triple {10974#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:07:23,093 INFO L273 TraceCheckUtils]: 60: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:07:23,094 INFO L273 TraceCheckUtils]: 61: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,094 INFO L273 TraceCheckUtils]: 62: Hoare triple {10974#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:07:23,094 INFO L273 TraceCheckUtils]: 63: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:07:23,094 INFO L273 TraceCheckUtils]: 64: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,094 INFO L273 TraceCheckUtils]: 65: Hoare triple {10974#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:07:23,095 INFO L273 TraceCheckUtils]: 66: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:07:23,095 INFO L273 TraceCheckUtils]: 67: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,095 INFO L273 TraceCheckUtils]: 68: Hoare triple {10974#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:07:23,095 INFO L273 TraceCheckUtils]: 69: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:07:23,095 INFO L273 TraceCheckUtils]: 70: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,095 INFO L273 TraceCheckUtils]: 71: Hoare triple {10974#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:07:23,095 INFO L273 TraceCheckUtils]: 72: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:07:23,095 INFO L273 TraceCheckUtils]: 73: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,096 INFO L273 TraceCheckUtils]: 74: Hoare triple {10974#true} assume !(~i~0 < 100); {10974#true} is VALID [2018-11-14 17:07:23,096 INFO L273 TraceCheckUtils]: 75: Hoare triple {10974#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10974#true} is VALID [2018-11-14 17:07:23,096 INFO L273 TraceCheckUtils]: 76: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,096 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {10974#true} {10975#false} #73#return; {10975#false} is VALID [2018-11-14 17:07:23,096 INFO L273 TraceCheckUtils]: 78: Hoare triple {10975#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {10975#false} is VALID [2018-11-14 17:07:23,096 INFO L256 TraceCheckUtils]: 79: Hoare triple {10975#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 17:07:23,096 INFO L273 TraceCheckUtils]: 80: Hoare triple {10974#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10974#true} is VALID [2018-11-14 17:07:23,096 INFO L273 TraceCheckUtils]: 81: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,096 INFO L273 TraceCheckUtils]: 82: Hoare triple {10974#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:07:23,097 INFO L273 TraceCheckUtils]: 83: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:07:23,097 INFO L273 TraceCheckUtils]: 84: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,097 INFO L273 TraceCheckUtils]: 85: Hoare triple {10974#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:07:23,097 INFO L273 TraceCheckUtils]: 86: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:07:23,097 INFO L273 TraceCheckUtils]: 87: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,097 INFO L273 TraceCheckUtils]: 88: Hoare triple {10974#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:07:23,097 INFO L273 TraceCheckUtils]: 89: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:07:23,097 INFO L273 TraceCheckUtils]: 90: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,098 INFO L273 TraceCheckUtils]: 91: Hoare triple {10974#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:07:23,098 INFO L273 TraceCheckUtils]: 92: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:07:23,098 INFO L273 TraceCheckUtils]: 93: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,098 INFO L273 TraceCheckUtils]: 94: Hoare triple {10974#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:07:23,098 INFO L273 TraceCheckUtils]: 95: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:07:23,098 INFO L273 TraceCheckUtils]: 96: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,098 INFO L273 TraceCheckUtils]: 97: Hoare triple {10974#true} assume !(~i~0 < 100); {10974#true} is VALID [2018-11-14 17:07:23,098 INFO L273 TraceCheckUtils]: 98: Hoare triple {10974#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10974#true} is VALID [2018-11-14 17:07:23,098 INFO L273 TraceCheckUtils]: 99: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,099 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {10974#true} {10975#false} #75#return; {10975#false} is VALID [2018-11-14 17:07:23,099 INFO L273 TraceCheckUtils]: 101: Hoare triple {10975#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {10975#false} is VALID [2018-11-14 17:07:23,099 INFO L273 TraceCheckUtils]: 102: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 17:07:23,099 INFO L273 TraceCheckUtils]: 103: Hoare triple {10975#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10975#false} is VALID [2018-11-14 17:07:23,099 INFO L273 TraceCheckUtils]: 104: Hoare triple {10975#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10975#false} is VALID [2018-11-14 17:07:23,099 INFO L273 TraceCheckUtils]: 105: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 17:07:23,099 INFO L273 TraceCheckUtils]: 106: Hoare triple {10975#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10975#false} is VALID [2018-11-14 17:07:23,099 INFO L273 TraceCheckUtils]: 107: Hoare triple {10975#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10975#false} is VALID [2018-11-14 17:07:23,099 INFO L273 TraceCheckUtils]: 108: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 17:07:23,100 INFO L273 TraceCheckUtils]: 109: Hoare triple {10975#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10975#false} is VALID [2018-11-14 17:07:23,100 INFO L273 TraceCheckUtils]: 110: Hoare triple {10975#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10975#false} is VALID [2018-11-14 17:07:23,100 INFO L273 TraceCheckUtils]: 111: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 17:07:23,100 INFO L273 TraceCheckUtils]: 112: Hoare triple {10975#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10975#false} is VALID [2018-11-14 17:07:23,100 INFO L273 TraceCheckUtils]: 113: Hoare triple {10975#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10975#false} is VALID [2018-11-14 17:07:23,100 INFO L273 TraceCheckUtils]: 114: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 17:07:23,100 INFO L273 TraceCheckUtils]: 115: Hoare triple {10975#false} assume !(~i~2 < 99); {10975#false} is VALID [2018-11-14 17:07:23,100 INFO L273 TraceCheckUtils]: 116: Hoare triple {10975#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {10975#false} is VALID [2018-11-14 17:07:23,100 INFO L256 TraceCheckUtils]: 117: Hoare triple {10975#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 17:07:23,101 INFO L273 TraceCheckUtils]: 118: Hoare triple {10974#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10974#true} is VALID [2018-11-14 17:07:23,101 INFO L273 TraceCheckUtils]: 119: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,101 INFO L273 TraceCheckUtils]: 120: Hoare triple {10974#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:07:23,101 INFO L273 TraceCheckUtils]: 121: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:07:23,101 INFO L273 TraceCheckUtils]: 122: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,101 INFO L273 TraceCheckUtils]: 123: Hoare triple {10974#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:07:23,101 INFO L273 TraceCheckUtils]: 124: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:07:23,101 INFO L273 TraceCheckUtils]: 125: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,101 INFO L273 TraceCheckUtils]: 126: Hoare triple {10974#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:07:23,102 INFO L273 TraceCheckUtils]: 127: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:07:23,102 INFO L273 TraceCheckUtils]: 128: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,102 INFO L273 TraceCheckUtils]: 129: Hoare triple {10974#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:07:23,102 INFO L273 TraceCheckUtils]: 130: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:07:23,102 INFO L273 TraceCheckUtils]: 131: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,102 INFO L273 TraceCheckUtils]: 132: Hoare triple {10974#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:07:23,102 INFO L273 TraceCheckUtils]: 133: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:07:23,102 INFO L273 TraceCheckUtils]: 134: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,103 INFO L273 TraceCheckUtils]: 135: Hoare triple {10974#true} assume !(~i~0 < 100); {10974#true} is VALID [2018-11-14 17:07:23,103 INFO L273 TraceCheckUtils]: 136: Hoare triple {10974#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10974#true} is VALID [2018-11-14 17:07:23,103 INFO L273 TraceCheckUtils]: 137: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,103 INFO L268 TraceCheckUtils]: 138: Hoare quadruple {10974#true} {10975#false} #77#return; {10975#false} is VALID [2018-11-14 17:07:23,103 INFO L273 TraceCheckUtils]: 139: Hoare triple {10975#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {10975#false} is VALID [2018-11-14 17:07:23,103 INFO L273 TraceCheckUtils]: 140: Hoare triple {10975#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {10975#false} is VALID [2018-11-14 17:07:23,103 INFO L273 TraceCheckUtils]: 141: Hoare triple {10975#false} assume !false; {10975#false} is VALID [2018-11-14 17:07:23,112 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 449 trivial. 0 not checked. [2018-11-14 17:07:23,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:23,112 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:07:23,122 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:07:23,175 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:07:23,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:23,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:23,480 INFO L256 TraceCheckUtils]: 0: Hoare triple {10974#true} call ULTIMATE.init(); {10974#true} is VALID [2018-11-14 17:07:23,481 INFO L273 TraceCheckUtils]: 1: Hoare triple {10974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10974#true} is VALID [2018-11-14 17:07:23,481 INFO L273 TraceCheckUtils]: 2: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,481 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10974#true} {10974#true} #69#return; {10974#true} is VALID [2018-11-14 17:07:23,481 INFO L256 TraceCheckUtils]: 4: Hoare triple {10974#true} call #t~ret13 := main(); {10974#true} is VALID [2018-11-14 17:07:23,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {10974#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10974#true} is VALID [2018-11-14 17:07:23,482 INFO L273 TraceCheckUtils]: 6: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,482 INFO L273 TraceCheckUtils]: 7: Hoare triple {10974#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:07:23,482 INFO L273 TraceCheckUtils]: 8: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:07:23,482 INFO L273 TraceCheckUtils]: 9: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,483 INFO L273 TraceCheckUtils]: 10: Hoare triple {10974#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:07:23,483 INFO L273 TraceCheckUtils]: 11: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:07:23,483 INFO L273 TraceCheckUtils]: 12: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,483 INFO L273 TraceCheckUtils]: 13: Hoare triple {10974#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:07:23,483 INFO L273 TraceCheckUtils]: 14: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:07:23,483 INFO L273 TraceCheckUtils]: 15: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,484 INFO L273 TraceCheckUtils]: 16: Hoare triple {10974#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:07:23,484 INFO L273 TraceCheckUtils]: 17: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:07:23,484 INFO L273 TraceCheckUtils]: 18: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,484 INFO L273 TraceCheckUtils]: 19: Hoare triple {10974#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:07:23,484 INFO L273 TraceCheckUtils]: 20: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:07:23,484 INFO L273 TraceCheckUtils]: 21: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,484 INFO L273 TraceCheckUtils]: 22: Hoare triple {10974#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:07:23,484 INFO L273 TraceCheckUtils]: 23: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:07:23,485 INFO L273 TraceCheckUtils]: 24: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,485 INFO L273 TraceCheckUtils]: 25: Hoare triple {10974#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:07:23,485 INFO L273 TraceCheckUtils]: 26: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:07:23,485 INFO L273 TraceCheckUtils]: 27: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,485 INFO L273 TraceCheckUtils]: 28: Hoare triple {10974#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:07:23,485 INFO L273 TraceCheckUtils]: 29: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:07:23,485 INFO L273 TraceCheckUtils]: 30: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,485 INFO L273 TraceCheckUtils]: 31: Hoare triple {10974#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:07:23,485 INFO L273 TraceCheckUtils]: 32: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:07:23,486 INFO L273 TraceCheckUtils]: 33: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,486 INFO L273 TraceCheckUtils]: 34: Hoare triple {10974#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:07:23,486 INFO L273 TraceCheckUtils]: 35: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:07:23,486 INFO L273 TraceCheckUtils]: 36: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,486 INFO L273 TraceCheckUtils]: 37: Hoare triple {10974#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:07:23,486 INFO L273 TraceCheckUtils]: 38: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:07:23,486 INFO L273 TraceCheckUtils]: 39: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,486 INFO L273 TraceCheckUtils]: 40: Hoare triple {10974#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:07:23,486 INFO L273 TraceCheckUtils]: 41: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:07:23,487 INFO L273 TraceCheckUtils]: 42: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,487 INFO L273 TraceCheckUtils]: 43: Hoare triple {10974#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:07:23,487 INFO L273 TraceCheckUtils]: 44: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:07:23,487 INFO L273 TraceCheckUtils]: 45: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,487 INFO L273 TraceCheckUtils]: 46: Hoare triple {10974#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:07:23,487 INFO L273 TraceCheckUtils]: 47: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:07:23,487 INFO L273 TraceCheckUtils]: 48: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,487 INFO L273 TraceCheckUtils]: 49: Hoare triple {10974#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:07:23,488 INFO L273 TraceCheckUtils]: 50: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:07:23,488 INFO L273 TraceCheckUtils]: 51: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,488 INFO L273 TraceCheckUtils]: 52: Hoare triple {10974#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:07:23,488 INFO L273 TraceCheckUtils]: 53: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:07:23,488 INFO L273 TraceCheckUtils]: 54: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,488 INFO L273 TraceCheckUtils]: 55: Hoare triple {10974#true} assume !(~i~1 < 100); {10974#true} is VALID [2018-11-14 17:07:23,488 INFO L256 TraceCheckUtils]: 56: Hoare triple {10974#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 17:07:23,488 INFO L273 TraceCheckUtils]: 57: Hoare triple {10974#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10974#true} is VALID [2018-11-14 17:07:23,488 INFO L273 TraceCheckUtils]: 58: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,489 INFO L273 TraceCheckUtils]: 59: Hoare triple {10974#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:07:23,489 INFO L273 TraceCheckUtils]: 60: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:07:23,489 INFO L273 TraceCheckUtils]: 61: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,489 INFO L273 TraceCheckUtils]: 62: Hoare triple {10974#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:07:23,489 INFO L273 TraceCheckUtils]: 63: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:07:23,489 INFO L273 TraceCheckUtils]: 64: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,489 INFO L273 TraceCheckUtils]: 65: Hoare triple {10974#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:07:23,489 INFO L273 TraceCheckUtils]: 66: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:07:23,489 INFO L273 TraceCheckUtils]: 67: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,490 INFO L273 TraceCheckUtils]: 68: Hoare triple {10974#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:07:23,490 INFO L273 TraceCheckUtils]: 69: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:07:23,490 INFO L273 TraceCheckUtils]: 70: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,490 INFO L273 TraceCheckUtils]: 71: Hoare triple {10974#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:07:23,490 INFO L273 TraceCheckUtils]: 72: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:07:23,490 INFO L273 TraceCheckUtils]: 73: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,490 INFO L273 TraceCheckUtils]: 74: Hoare triple {10974#true} assume !(~i~0 < 100); {10974#true} is VALID [2018-11-14 17:07:23,490 INFO L273 TraceCheckUtils]: 75: Hoare triple {10974#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10974#true} is VALID [2018-11-14 17:07:23,490 INFO L273 TraceCheckUtils]: 76: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,491 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {10974#true} {10974#true} #73#return; {10974#true} is VALID [2018-11-14 17:07:23,491 INFO L273 TraceCheckUtils]: 78: Hoare triple {10974#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {10974#true} is VALID [2018-11-14 17:07:23,491 INFO L256 TraceCheckUtils]: 79: Hoare triple {10974#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 17:07:23,491 INFO L273 TraceCheckUtils]: 80: Hoare triple {10974#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10974#true} is VALID [2018-11-14 17:07:23,491 INFO L273 TraceCheckUtils]: 81: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,491 INFO L273 TraceCheckUtils]: 82: Hoare triple {10974#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:07:23,491 INFO L273 TraceCheckUtils]: 83: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:07:23,491 INFO L273 TraceCheckUtils]: 84: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,491 INFO L273 TraceCheckUtils]: 85: Hoare triple {10974#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:07:23,492 INFO L273 TraceCheckUtils]: 86: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:07:23,492 INFO L273 TraceCheckUtils]: 87: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,492 INFO L273 TraceCheckUtils]: 88: Hoare triple {10974#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:07:23,492 INFO L273 TraceCheckUtils]: 89: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:07:23,492 INFO L273 TraceCheckUtils]: 90: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,492 INFO L273 TraceCheckUtils]: 91: Hoare triple {10974#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:07:23,492 INFO L273 TraceCheckUtils]: 92: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:07:23,492 INFO L273 TraceCheckUtils]: 93: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,493 INFO L273 TraceCheckUtils]: 94: Hoare triple {10974#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:07:23,493 INFO L273 TraceCheckUtils]: 95: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:07:23,493 INFO L273 TraceCheckUtils]: 96: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,493 INFO L273 TraceCheckUtils]: 97: Hoare triple {10974#true} assume !(~i~0 < 100); {10974#true} is VALID [2018-11-14 17:07:23,493 INFO L273 TraceCheckUtils]: 98: Hoare triple {10974#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10974#true} is VALID [2018-11-14 17:07:23,493 INFO L273 TraceCheckUtils]: 99: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,494 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {10974#true} {10974#true} #75#return; {10974#true} is VALID [2018-11-14 17:07:23,494 INFO L273 TraceCheckUtils]: 101: Hoare triple {10974#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {10974#true} is VALID [2018-11-14 17:07:23,494 INFO L273 TraceCheckUtils]: 102: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,494 INFO L273 TraceCheckUtils]: 103: Hoare triple {10974#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10974#true} is VALID [2018-11-14 17:07:23,494 INFO L273 TraceCheckUtils]: 104: Hoare triple {10974#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10974#true} is VALID [2018-11-14 17:07:23,494 INFO L273 TraceCheckUtils]: 105: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,495 INFO L273 TraceCheckUtils]: 106: Hoare triple {10974#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10974#true} is VALID [2018-11-14 17:07:23,495 INFO L273 TraceCheckUtils]: 107: Hoare triple {10974#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10974#true} is VALID [2018-11-14 17:07:23,495 INFO L273 TraceCheckUtils]: 108: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,495 INFO L273 TraceCheckUtils]: 109: Hoare triple {10974#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10974#true} is VALID [2018-11-14 17:07:23,495 INFO L273 TraceCheckUtils]: 110: Hoare triple {10974#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10974#true} is VALID [2018-11-14 17:07:23,496 INFO L273 TraceCheckUtils]: 111: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,496 INFO L273 TraceCheckUtils]: 112: Hoare triple {10974#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10974#true} is VALID [2018-11-14 17:07:23,496 INFO L273 TraceCheckUtils]: 113: Hoare triple {10974#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10974#true} is VALID [2018-11-14 17:07:23,496 INFO L273 TraceCheckUtils]: 114: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:07:23,496 INFO L273 TraceCheckUtils]: 115: Hoare triple {10974#true} assume !(~i~2 < 99); {10974#true} is VALID [2018-11-14 17:07:23,496 INFO L273 TraceCheckUtils]: 116: Hoare triple {10974#true} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {10974#true} is VALID [2018-11-14 17:07:23,497 INFO L256 TraceCheckUtils]: 117: Hoare triple {10974#true} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 17:07:23,515 INFO L273 TraceCheckUtils]: 118: Hoare triple {10974#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11350#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:07:23,528 INFO L273 TraceCheckUtils]: 119: Hoare triple {11350#(<= bAnd_~i~0 1)} assume true; {11350#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:07:23,537 INFO L273 TraceCheckUtils]: 120: Hoare triple {11350#(<= bAnd_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11350#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:07:23,551 INFO L273 TraceCheckUtils]: 121: Hoare triple {11350#(<= bAnd_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11360#(<= bAnd_~i~0 2)} is VALID [2018-11-14 17:07:23,560 INFO L273 TraceCheckUtils]: 122: Hoare triple {11360#(<= bAnd_~i~0 2)} assume true; {11360#(<= bAnd_~i~0 2)} is VALID [2018-11-14 17:07:23,574 INFO L273 TraceCheckUtils]: 123: Hoare triple {11360#(<= bAnd_~i~0 2)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11360#(<= bAnd_~i~0 2)} is VALID [2018-11-14 17:07:23,583 INFO L273 TraceCheckUtils]: 124: Hoare triple {11360#(<= bAnd_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11370#(<= bAnd_~i~0 3)} is VALID [2018-11-14 17:07:23,595 INFO L273 TraceCheckUtils]: 125: Hoare triple {11370#(<= bAnd_~i~0 3)} assume true; {11370#(<= bAnd_~i~0 3)} is VALID [2018-11-14 17:07:23,610 INFO L273 TraceCheckUtils]: 126: Hoare triple {11370#(<= bAnd_~i~0 3)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11370#(<= bAnd_~i~0 3)} is VALID [2018-11-14 17:07:23,624 INFO L273 TraceCheckUtils]: 127: Hoare triple {11370#(<= bAnd_~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11380#(<= bAnd_~i~0 4)} is VALID [2018-11-14 17:07:23,633 INFO L273 TraceCheckUtils]: 128: Hoare triple {11380#(<= bAnd_~i~0 4)} assume true; {11380#(<= bAnd_~i~0 4)} is VALID [2018-11-14 17:07:23,645 INFO L273 TraceCheckUtils]: 129: Hoare triple {11380#(<= bAnd_~i~0 4)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11380#(<= bAnd_~i~0 4)} is VALID [2018-11-14 17:07:23,660 INFO L273 TraceCheckUtils]: 130: Hoare triple {11380#(<= bAnd_~i~0 4)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11390#(<= bAnd_~i~0 5)} is VALID [2018-11-14 17:07:23,669 INFO L273 TraceCheckUtils]: 131: Hoare triple {11390#(<= bAnd_~i~0 5)} assume true; {11390#(<= bAnd_~i~0 5)} is VALID [2018-11-14 17:07:23,681 INFO L273 TraceCheckUtils]: 132: Hoare triple {11390#(<= bAnd_~i~0 5)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11390#(<= bAnd_~i~0 5)} is VALID [2018-11-14 17:07:23,695 INFO L273 TraceCheckUtils]: 133: Hoare triple {11390#(<= bAnd_~i~0 5)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11400#(<= bAnd_~i~0 6)} is VALID [2018-11-14 17:07:23,704 INFO L273 TraceCheckUtils]: 134: Hoare triple {11400#(<= bAnd_~i~0 6)} assume true; {11400#(<= bAnd_~i~0 6)} is VALID [2018-11-14 17:07:23,713 INFO L273 TraceCheckUtils]: 135: Hoare triple {11400#(<= bAnd_~i~0 6)} assume !(~i~0 < 100); {10975#false} is VALID [2018-11-14 17:07:23,713 INFO L273 TraceCheckUtils]: 136: Hoare triple {10975#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10975#false} is VALID [2018-11-14 17:07:23,713 INFO L273 TraceCheckUtils]: 137: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 17:07:23,714 INFO L268 TraceCheckUtils]: 138: Hoare quadruple {10975#false} {10974#true} #77#return; {10975#false} is VALID [2018-11-14 17:07:23,714 INFO L273 TraceCheckUtils]: 139: Hoare triple {10975#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {10975#false} is VALID [2018-11-14 17:07:23,714 INFO L273 TraceCheckUtils]: 140: Hoare triple {10975#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {10975#false} is VALID [2018-11-14 17:07:23,714 INFO L273 TraceCheckUtils]: 141: Hoare triple {10975#false} assume !false; {10975#false} is VALID [2018-11-14 17:07:23,725 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 200 proven. 40 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2018-11-14 17:07:23,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:23,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 8] total 25 [2018-11-14 17:07:23,759 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 142 [2018-11-14 17:07:23,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:23,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-14 17:07:23,910 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:23,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-14 17:07:23,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-14 17:07:23,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=402, Unknown=0, NotChecked=0, Total=600 [2018-11-14 17:07:23,911 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 25 states. [2018-11-14 17:07:24,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:24,949 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2018-11-14 17:07:24,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 17:07:24,949 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 142 [2018-11-14 17:07:24,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:24,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 17:07:24,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 130 transitions. [2018-11-14 17:07:24,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 17:07:24,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 130 transitions. [2018-11-14 17:07:24,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 130 transitions. [2018-11-14 17:07:25,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:25,130 INFO L225 Difference]: With dead ends: 154 [2018-11-14 17:07:25,130 INFO L226 Difference]: Without dead ends: 109 [2018-11-14 17:07:25,131 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=402, Unknown=0, NotChecked=0, Total=600 [2018-11-14 17:07:25,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-14 17:07:25,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-11-14 17:07:25,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:25,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 107 states. [2018-11-14 17:07:25,157 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 107 states. [2018-11-14 17:07:25,157 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 107 states. [2018-11-14 17:07:25,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:25,160 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-11-14 17:07:25,160 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-11-14 17:07:25,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:25,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:25,161 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 109 states. [2018-11-14 17:07:25,161 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 109 states. [2018-11-14 17:07:25,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:25,164 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-11-14 17:07:25,164 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-11-14 17:07:25,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:25,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:25,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:25,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:25,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-14 17:07:25,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-11-14 17:07:25,167 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 142 [2018-11-14 17:07:25,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:25,167 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-11-14 17:07:25,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-14 17:07:25,167 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-11-14 17:07:25,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-14 17:07:25,169 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:25,169 INFO L375 BasicCegarLoop]: trace histogram [21, 18, 18, 18, 17, 17, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:07:25,169 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:25,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:25,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1450365401, now seen corresponding path program 17 times [2018-11-14 17:07:25,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:25,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:25,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:25,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:25,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:26,254 INFO L256 TraceCheckUtils]: 0: Hoare triple {11994#true} call ULTIMATE.init(); {11994#true} is VALID [2018-11-14 17:07:26,254 INFO L273 TraceCheckUtils]: 1: Hoare triple {11994#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11994#true} is VALID [2018-11-14 17:07:26,254 INFO L273 TraceCheckUtils]: 2: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,255 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11994#true} {11994#true} #69#return; {11994#true} is VALID [2018-11-14 17:07:26,255 INFO L256 TraceCheckUtils]: 4: Hoare triple {11994#true} call #t~ret13 := main(); {11994#true} is VALID [2018-11-14 17:07:26,255 INFO L273 TraceCheckUtils]: 5: Hoare triple {11994#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {11996#(= main_~i~1 0)} is VALID [2018-11-14 17:07:26,255 INFO L273 TraceCheckUtils]: 6: Hoare triple {11996#(= main_~i~1 0)} assume true; {11996#(= main_~i~1 0)} is VALID [2018-11-14 17:07:26,256 INFO L273 TraceCheckUtils]: 7: Hoare triple {11996#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11996#(= main_~i~1 0)} is VALID [2018-11-14 17:07:26,256 INFO L273 TraceCheckUtils]: 8: Hoare triple {11996#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11997#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:26,256 INFO L273 TraceCheckUtils]: 9: Hoare triple {11997#(<= main_~i~1 1)} assume true; {11997#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:26,257 INFO L273 TraceCheckUtils]: 10: Hoare triple {11997#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11997#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:26,257 INFO L273 TraceCheckUtils]: 11: Hoare triple {11997#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11998#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:26,258 INFO L273 TraceCheckUtils]: 12: Hoare triple {11998#(<= main_~i~1 2)} assume true; {11998#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:26,258 INFO L273 TraceCheckUtils]: 13: Hoare triple {11998#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11998#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:26,259 INFO L273 TraceCheckUtils]: 14: Hoare triple {11998#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11999#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:26,259 INFO L273 TraceCheckUtils]: 15: Hoare triple {11999#(<= main_~i~1 3)} assume true; {11999#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:26,260 INFO L273 TraceCheckUtils]: 16: Hoare triple {11999#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11999#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:26,260 INFO L273 TraceCheckUtils]: 17: Hoare triple {11999#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12000#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:26,261 INFO L273 TraceCheckUtils]: 18: Hoare triple {12000#(<= main_~i~1 4)} assume true; {12000#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:26,261 INFO L273 TraceCheckUtils]: 19: Hoare triple {12000#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12000#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:26,262 INFO L273 TraceCheckUtils]: 20: Hoare triple {12000#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12001#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:26,263 INFO L273 TraceCheckUtils]: 21: Hoare triple {12001#(<= main_~i~1 5)} assume true; {12001#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:26,263 INFO L273 TraceCheckUtils]: 22: Hoare triple {12001#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12001#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:26,264 INFO L273 TraceCheckUtils]: 23: Hoare triple {12001#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12002#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:26,264 INFO L273 TraceCheckUtils]: 24: Hoare triple {12002#(<= main_~i~1 6)} assume true; {12002#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:26,265 INFO L273 TraceCheckUtils]: 25: Hoare triple {12002#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12002#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:26,266 INFO L273 TraceCheckUtils]: 26: Hoare triple {12002#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12003#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:26,266 INFO L273 TraceCheckUtils]: 27: Hoare triple {12003#(<= main_~i~1 7)} assume true; {12003#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:26,267 INFO L273 TraceCheckUtils]: 28: Hoare triple {12003#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12003#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:26,267 INFO L273 TraceCheckUtils]: 29: Hoare triple {12003#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12004#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:26,268 INFO L273 TraceCheckUtils]: 30: Hoare triple {12004#(<= main_~i~1 8)} assume true; {12004#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:26,268 INFO L273 TraceCheckUtils]: 31: Hoare triple {12004#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12004#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:26,269 INFO L273 TraceCheckUtils]: 32: Hoare triple {12004#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12005#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:26,270 INFO L273 TraceCheckUtils]: 33: Hoare triple {12005#(<= main_~i~1 9)} assume true; {12005#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:26,270 INFO L273 TraceCheckUtils]: 34: Hoare triple {12005#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12005#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:26,271 INFO L273 TraceCheckUtils]: 35: Hoare triple {12005#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12006#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:26,271 INFO L273 TraceCheckUtils]: 36: Hoare triple {12006#(<= main_~i~1 10)} assume true; {12006#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:26,272 INFO L273 TraceCheckUtils]: 37: Hoare triple {12006#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12006#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:26,272 INFO L273 TraceCheckUtils]: 38: Hoare triple {12006#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12007#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:26,273 INFO L273 TraceCheckUtils]: 39: Hoare triple {12007#(<= main_~i~1 11)} assume true; {12007#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:26,273 INFO L273 TraceCheckUtils]: 40: Hoare triple {12007#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12007#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:26,274 INFO L273 TraceCheckUtils]: 41: Hoare triple {12007#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12008#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:26,274 INFO L273 TraceCheckUtils]: 42: Hoare triple {12008#(<= main_~i~1 12)} assume true; {12008#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:26,275 INFO L273 TraceCheckUtils]: 43: Hoare triple {12008#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12008#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:26,276 INFO L273 TraceCheckUtils]: 44: Hoare triple {12008#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12009#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:26,276 INFO L273 TraceCheckUtils]: 45: Hoare triple {12009#(<= main_~i~1 13)} assume true; {12009#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:26,277 INFO L273 TraceCheckUtils]: 46: Hoare triple {12009#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12009#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:26,277 INFO L273 TraceCheckUtils]: 47: Hoare triple {12009#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12010#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:26,278 INFO L273 TraceCheckUtils]: 48: Hoare triple {12010#(<= main_~i~1 14)} assume true; {12010#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:26,278 INFO L273 TraceCheckUtils]: 49: Hoare triple {12010#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12010#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:26,279 INFO L273 TraceCheckUtils]: 50: Hoare triple {12010#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12011#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:26,279 INFO L273 TraceCheckUtils]: 51: Hoare triple {12011#(<= main_~i~1 15)} assume true; {12011#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:26,280 INFO L273 TraceCheckUtils]: 52: Hoare triple {12011#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12011#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:26,281 INFO L273 TraceCheckUtils]: 53: Hoare triple {12011#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12012#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:26,281 INFO L273 TraceCheckUtils]: 54: Hoare triple {12012#(<= main_~i~1 16)} assume true; {12012#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:26,282 INFO L273 TraceCheckUtils]: 55: Hoare triple {12012#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12012#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:26,282 INFO L273 TraceCheckUtils]: 56: Hoare triple {12012#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12013#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:26,283 INFO L273 TraceCheckUtils]: 57: Hoare triple {12013#(<= main_~i~1 17)} assume true; {12013#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:26,283 INFO L273 TraceCheckUtils]: 58: Hoare triple {12013#(<= main_~i~1 17)} assume !(~i~1 < 100); {11995#false} is VALID [2018-11-14 17:07:26,284 INFO L256 TraceCheckUtils]: 59: Hoare triple {11995#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {11994#true} is VALID [2018-11-14 17:07:26,284 INFO L273 TraceCheckUtils]: 60: Hoare triple {11994#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11994#true} is VALID [2018-11-14 17:07:26,284 INFO L273 TraceCheckUtils]: 61: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,284 INFO L273 TraceCheckUtils]: 62: Hoare triple {11994#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:07:26,284 INFO L273 TraceCheckUtils]: 63: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:07:26,284 INFO L273 TraceCheckUtils]: 64: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,285 INFO L273 TraceCheckUtils]: 65: Hoare triple {11994#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:07:26,285 INFO L273 TraceCheckUtils]: 66: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:07:26,285 INFO L273 TraceCheckUtils]: 67: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,285 INFO L273 TraceCheckUtils]: 68: Hoare triple {11994#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:07:26,285 INFO L273 TraceCheckUtils]: 69: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:07:26,286 INFO L273 TraceCheckUtils]: 70: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,286 INFO L273 TraceCheckUtils]: 71: Hoare triple {11994#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:07:26,286 INFO L273 TraceCheckUtils]: 72: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:07:26,286 INFO L273 TraceCheckUtils]: 73: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,286 INFO L273 TraceCheckUtils]: 74: Hoare triple {11994#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:07:26,286 INFO L273 TraceCheckUtils]: 75: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:07:26,287 INFO L273 TraceCheckUtils]: 76: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,287 INFO L273 TraceCheckUtils]: 77: Hoare triple {11994#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:07:26,287 INFO L273 TraceCheckUtils]: 78: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:07:26,287 INFO L273 TraceCheckUtils]: 79: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,287 INFO L273 TraceCheckUtils]: 80: Hoare triple {11994#true} assume !(~i~0 < 100); {11994#true} is VALID [2018-11-14 17:07:26,287 INFO L273 TraceCheckUtils]: 81: Hoare triple {11994#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11994#true} is VALID [2018-11-14 17:07:26,287 INFO L273 TraceCheckUtils]: 82: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,287 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {11994#true} {11995#false} #73#return; {11995#false} is VALID [2018-11-14 17:07:26,288 INFO L273 TraceCheckUtils]: 84: Hoare triple {11995#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {11995#false} is VALID [2018-11-14 17:07:26,288 INFO L256 TraceCheckUtils]: 85: Hoare triple {11995#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {11994#true} is VALID [2018-11-14 17:07:26,288 INFO L273 TraceCheckUtils]: 86: Hoare triple {11994#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11994#true} is VALID [2018-11-14 17:07:26,288 INFO L273 TraceCheckUtils]: 87: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,288 INFO L273 TraceCheckUtils]: 88: Hoare triple {11994#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:07:26,288 INFO L273 TraceCheckUtils]: 89: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:07:26,288 INFO L273 TraceCheckUtils]: 90: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,288 INFO L273 TraceCheckUtils]: 91: Hoare triple {11994#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:07:26,288 INFO L273 TraceCheckUtils]: 92: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:07:26,289 INFO L273 TraceCheckUtils]: 93: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,289 INFO L273 TraceCheckUtils]: 94: Hoare triple {11994#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:07:26,289 INFO L273 TraceCheckUtils]: 95: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:07:26,289 INFO L273 TraceCheckUtils]: 96: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,289 INFO L273 TraceCheckUtils]: 97: Hoare triple {11994#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:07:26,289 INFO L273 TraceCheckUtils]: 98: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:07:26,289 INFO L273 TraceCheckUtils]: 99: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,289 INFO L273 TraceCheckUtils]: 100: Hoare triple {11994#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:07:26,289 INFO L273 TraceCheckUtils]: 101: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:07:26,290 INFO L273 TraceCheckUtils]: 102: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,290 INFO L273 TraceCheckUtils]: 103: Hoare triple {11994#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:07:26,290 INFO L273 TraceCheckUtils]: 104: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:07:26,290 INFO L273 TraceCheckUtils]: 105: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,290 INFO L273 TraceCheckUtils]: 106: Hoare triple {11994#true} assume !(~i~0 < 100); {11994#true} is VALID [2018-11-14 17:07:26,290 INFO L273 TraceCheckUtils]: 107: Hoare triple {11994#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11994#true} is VALID [2018-11-14 17:07:26,290 INFO L273 TraceCheckUtils]: 108: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,290 INFO L268 TraceCheckUtils]: 109: Hoare quadruple {11994#true} {11995#false} #75#return; {11995#false} is VALID [2018-11-14 17:07:26,290 INFO L273 TraceCheckUtils]: 110: Hoare triple {11995#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {11995#false} is VALID [2018-11-14 17:07:26,291 INFO L273 TraceCheckUtils]: 111: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:26,291 INFO L273 TraceCheckUtils]: 112: Hoare triple {11995#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 17:07:26,291 INFO L273 TraceCheckUtils]: 113: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 17:07:26,291 INFO L273 TraceCheckUtils]: 114: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:26,291 INFO L273 TraceCheckUtils]: 115: Hoare triple {11995#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 17:07:26,291 INFO L273 TraceCheckUtils]: 116: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 17:07:26,291 INFO L273 TraceCheckUtils]: 117: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:26,291 INFO L273 TraceCheckUtils]: 118: Hoare triple {11995#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 17:07:26,291 INFO L273 TraceCheckUtils]: 119: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 17:07:26,292 INFO L273 TraceCheckUtils]: 120: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:26,292 INFO L273 TraceCheckUtils]: 121: Hoare triple {11995#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 17:07:26,292 INFO L273 TraceCheckUtils]: 122: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 17:07:26,292 INFO L273 TraceCheckUtils]: 123: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:26,292 INFO L273 TraceCheckUtils]: 124: Hoare triple {11995#false} assume !(~i~2 < 99); {11995#false} is VALID [2018-11-14 17:07:26,292 INFO L273 TraceCheckUtils]: 125: Hoare triple {11995#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {11995#false} is VALID [2018-11-14 17:07:26,292 INFO L256 TraceCheckUtils]: 126: Hoare triple {11995#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {11994#true} is VALID [2018-11-14 17:07:26,292 INFO L273 TraceCheckUtils]: 127: Hoare triple {11994#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11994#true} is VALID [2018-11-14 17:07:26,292 INFO L273 TraceCheckUtils]: 128: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,293 INFO L273 TraceCheckUtils]: 129: Hoare triple {11994#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:07:26,293 INFO L273 TraceCheckUtils]: 130: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:07:26,293 INFO L273 TraceCheckUtils]: 131: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,293 INFO L273 TraceCheckUtils]: 132: Hoare triple {11994#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:07:26,293 INFO L273 TraceCheckUtils]: 133: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:07:26,293 INFO L273 TraceCheckUtils]: 134: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,293 INFO L273 TraceCheckUtils]: 135: Hoare triple {11994#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:07:26,293 INFO L273 TraceCheckUtils]: 136: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:07:26,293 INFO L273 TraceCheckUtils]: 137: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,294 INFO L273 TraceCheckUtils]: 138: Hoare triple {11994#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:07:26,294 INFO L273 TraceCheckUtils]: 139: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:07:26,294 INFO L273 TraceCheckUtils]: 140: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,294 INFO L273 TraceCheckUtils]: 141: Hoare triple {11994#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:07:26,294 INFO L273 TraceCheckUtils]: 142: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:07:26,294 INFO L273 TraceCheckUtils]: 143: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,294 INFO L273 TraceCheckUtils]: 144: Hoare triple {11994#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:07:26,294 INFO L273 TraceCheckUtils]: 145: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:07:26,294 INFO L273 TraceCheckUtils]: 146: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,295 INFO L273 TraceCheckUtils]: 147: Hoare triple {11994#true} assume !(~i~0 < 100); {11994#true} is VALID [2018-11-14 17:07:26,295 INFO L273 TraceCheckUtils]: 148: Hoare triple {11994#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11994#true} is VALID [2018-11-14 17:07:26,295 INFO L273 TraceCheckUtils]: 149: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:26,295 INFO L268 TraceCheckUtils]: 150: Hoare quadruple {11994#true} {11995#false} #77#return; {11995#false} is VALID [2018-11-14 17:07:26,295 INFO L273 TraceCheckUtils]: 151: Hoare triple {11995#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {11995#false} is VALID [2018-11-14 17:07:26,295 INFO L273 TraceCheckUtils]: 152: Hoare triple {11995#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {11995#false} is VALID [2018-11-14 17:07:26,295 INFO L273 TraceCheckUtils]: 153: Hoare triple {11995#false} assume !false; {11995#false} is VALID [2018-11-14 17:07:26,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2018-11-14 17:07:26,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:26,308 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:07:26,319 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:07:26,941 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-11-14 17:07:26,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:26,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:27,235 INFO L256 TraceCheckUtils]: 0: Hoare triple {11994#true} call ULTIMATE.init(); {11994#true} is VALID [2018-11-14 17:07:27,235 INFO L273 TraceCheckUtils]: 1: Hoare triple {11994#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11994#true} is VALID [2018-11-14 17:07:27,235 INFO L273 TraceCheckUtils]: 2: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,235 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11994#true} {11994#true} #69#return; {11994#true} is VALID [2018-11-14 17:07:27,236 INFO L256 TraceCheckUtils]: 4: Hoare triple {11994#true} call #t~ret13 := main(); {11994#true} is VALID [2018-11-14 17:07:27,236 INFO L273 TraceCheckUtils]: 5: Hoare triple {11994#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {11994#true} is VALID [2018-11-14 17:07:27,236 INFO L273 TraceCheckUtils]: 6: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,236 INFO L273 TraceCheckUtils]: 7: Hoare triple {11994#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:07:27,237 INFO L273 TraceCheckUtils]: 8: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:07:27,237 INFO L273 TraceCheckUtils]: 9: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,237 INFO L273 TraceCheckUtils]: 10: Hoare triple {11994#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:07:27,238 INFO L273 TraceCheckUtils]: 11: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:07:27,238 INFO L273 TraceCheckUtils]: 12: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,238 INFO L273 TraceCheckUtils]: 13: Hoare triple {11994#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:07:27,238 INFO L273 TraceCheckUtils]: 14: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:07:27,238 INFO L273 TraceCheckUtils]: 15: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,238 INFO L273 TraceCheckUtils]: 16: Hoare triple {11994#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:07:27,239 INFO L273 TraceCheckUtils]: 17: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:07:27,239 INFO L273 TraceCheckUtils]: 18: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,239 INFO L273 TraceCheckUtils]: 19: Hoare triple {11994#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:07:27,239 INFO L273 TraceCheckUtils]: 20: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:07:27,239 INFO L273 TraceCheckUtils]: 21: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,239 INFO L273 TraceCheckUtils]: 22: Hoare triple {11994#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:07:27,240 INFO L273 TraceCheckUtils]: 23: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:07:27,240 INFO L273 TraceCheckUtils]: 24: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,240 INFO L273 TraceCheckUtils]: 25: Hoare triple {11994#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:07:27,240 INFO L273 TraceCheckUtils]: 26: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:07:27,240 INFO L273 TraceCheckUtils]: 27: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,240 INFO L273 TraceCheckUtils]: 28: Hoare triple {11994#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:07:27,241 INFO L273 TraceCheckUtils]: 29: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:07:27,241 INFO L273 TraceCheckUtils]: 30: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,241 INFO L273 TraceCheckUtils]: 31: Hoare triple {11994#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:07:27,241 INFO L273 TraceCheckUtils]: 32: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:07:27,241 INFO L273 TraceCheckUtils]: 33: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,241 INFO L273 TraceCheckUtils]: 34: Hoare triple {11994#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:07:27,242 INFO L273 TraceCheckUtils]: 35: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:07:27,242 INFO L273 TraceCheckUtils]: 36: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,242 INFO L273 TraceCheckUtils]: 37: Hoare triple {11994#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:07:27,242 INFO L273 TraceCheckUtils]: 38: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:07:27,242 INFO L273 TraceCheckUtils]: 39: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,242 INFO L273 TraceCheckUtils]: 40: Hoare triple {11994#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:07:27,243 INFO L273 TraceCheckUtils]: 41: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:07:27,243 INFO L273 TraceCheckUtils]: 42: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,243 INFO L273 TraceCheckUtils]: 43: Hoare triple {11994#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:07:27,243 INFO L273 TraceCheckUtils]: 44: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:07:27,243 INFO L273 TraceCheckUtils]: 45: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,243 INFO L273 TraceCheckUtils]: 46: Hoare triple {11994#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:07:27,244 INFO L273 TraceCheckUtils]: 47: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:07:27,244 INFO L273 TraceCheckUtils]: 48: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,244 INFO L273 TraceCheckUtils]: 49: Hoare triple {11994#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:07:27,244 INFO L273 TraceCheckUtils]: 50: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:07:27,244 INFO L273 TraceCheckUtils]: 51: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,244 INFO L273 TraceCheckUtils]: 52: Hoare triple {11994#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:07:27,245 INFO L273 TraceCheckUtils]: 53: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:07:27,245 INFO L273 TraceCheckUtils]: 54: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,245 INFO L273 TraceCheckUtils]: 55: Hoare triple {11994#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:07:27,245 INFO L273 TraceCheckUtils]: 56: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:07:27,245 INFO L273 TraceCheckUtils]: 57: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:07:27,245 INFO L273 TraceCheckUtils]: 58: Hoare triple {11994#true} assume !(~i~1 < 100); {11994#true} is VALID [2018-11-14 17:07:27,246 INFO L256 TraceCheckUtils]: 59: Hoare triple {11994#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {11994#true} is VALID [2018-11-14 17:07:27,261 INFO L273 TraceCheckUtils]: 60: Hoare triple {11994#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12197#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:07:27,269 INFO L273 TraceCheckUtils]: 61: Hoare triple {12197#(<= bAnd_~i~0 1)} assume true; {12197#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:07:27,282 INFO L273 TraceCheckUtils]: 62: Hoare triple {12197#(<= bAnd_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12197#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:07:27,283 INFO L273 TraceCheckUtils]: 63: Hoare triple {12197#(<= bAnd_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12207#(<= bAnd_~i~0 2)} is VALID [2018-11-14 17:07:27,283 INFO L273 TraceCheckUtils]: 64: Hoare triple {12207#(<= bAnd_~i~0 2)} assume true; {12207#(<= bAnd_~i~0 2)} is VALID [2018-11-14 17:07:27,284 INFO L273 TraceCheckUtils]: 65: Hoare triple {12207#(<= bAnd_~i~0 2)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12207#(<= bAnd_~i~0 2)} is VALID [2018-11-14 17:07:27,284 INFO L273 TraceCheckUtils]: 66: Hoare triple {12207#(<= bAnd_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12217#(<= bAnd_~i~0 3)} is VALID [2018-11-14 17:07:27,284 INFO L273 TraceCheckUtils]: 67: Hoare triple {12217#(<= bAnd_~i~0 3)} assume true; {12217#(<= bAnd_~i~0 3)} is VALID [2018-11-14 17:07:27,285 INFO L273 TraceCheckUtils]: 68: Hoare triple {12217#(<= bAnd_~i~0 3)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12217#(<= bAnd_~i~0 3)} is VALID [2018-11-14 17:07:27,285 INFO L273 TraceCheckUtils]: 69: Hoare triple {12217#(<= bAnd_~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12227#(<= bAnd_~i~0 4)} is VALID [2018-11-14 17:07:27,285 INFO L273 TraceCheckUtils]: 70: Hoare triple {12227#(<= bAnd_~i~0 4)} assume true; {12227#(<= bAnd_~i~0 4)} is VALID [2018-11-14 17:07:27,286 INFO L273 TraceCheckUtils]: 71: Hoare triple {12227#(<= bAnd_~i~0 4)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12227#(<= bAnd_~i~0 4)} is VALID [2018-11-14 17:07:27,286 INFO L273 TraceCheckUtils]: 72: Hoare triple {12227#(<= bAnd_~i~0 4)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12237#(<= bAnd_~i~0 5)} is VALID [2018-11-14 17:07:27,287 INFO L273 TraceCheckUtils]: 73: Hoare triple {12237#(<= bAnd_~i~0 5)} assume true; {12237#(<= bAnd_~i~0 5)} is VALID [2018-11-14 17:07:27,287 INFO L273 TraceCheckUtils]: 74: Hoare triple {12237#(<= bAnd_~i~0 5)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12237#(<= bAnd_~i~0 5)} is VALID [2018-11-14 17:07:27,288 INFO L273 TraceCheckUtils]: 75: Hoare triple {12237#(<= bAnd_~i~0 5)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12247#(<= bAnd_~i~0 6)} is VALID [2018-11-14 17:07:27,289 INFO L273 TraceCheckUtils]: 76: Hoare triple {12247#(<= bAnd_~i~0 6)} assume true; {12247#(<= bAnd_~i~0 6)} is VALID [2018-11-14 17:07:27,289 INFO L273 TraceCheckUtils]: 77: Hoare triple {12247#(<= bAnd_~i~0 6)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12247#(<= bAnd_~i~0 6)} is VALID [2018-11-14 17:07:27,290 INFO L273 TraceCheckUtils]: 78: Hoare triple {12247#(<= bAnd_~i~0 6)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12257#(<= bAnd_~i~0 7)} is VALID [2018-11-14 17:07:27,290 INFO L273 TraceCheckUtils]: 79: Hoare triple {12257#(<= bAnd_~i~0 7)} assume true; {12257#(<= bAnd_~i~0 7)} is VALID [2018-11-14 17:07:27,291 INFO L273 TraceCheckUtils]: 80: Hoare triple {12257#(<= bAnd_~i~0 7)} assume !(~i~0 < 100); {11995#false} is VALID [2018-11-14 17:07:27,291 INFO L273 TraceCheckUtils]: 81: Hoare triple {11995#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11995#false} is VALID [2018-11-14 17:07:27,291 INFO L273 TraceCheckUtils]: 82: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,292 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {11995#false} {11994#true} #73#return; {11995#false} is VALID [2018-11-14 17:07:27,292 INFO L273 TraceCheckUtils]: 84: Hoare triple {11995#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {11995#false} is VALID [2018-11-14 17:07:27,292 INFO L256 TraceCheckUtils]: 85: Hoare triple {11995#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {11995#false} is VALID [2018-11-14 17:07:27,292 INFO L273 TraceCheckUtils]: 86: Hoare triple {11995#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11995#false} is VALID [2018-11-14 17:07:27,292 INFO L273 TraceCheckUtils]: 87: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,293 INFO L273 TraceCheckUtils]: 88: Hoare triple {11995#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:07:27,293 INFO L273 TraceCheckUtils]: 89: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 17:07:27,293 INFO L273 TraceCheckUtils]: 90: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,293 INFO L273 TraceCheckUtils]: 91: Hoare triple {11995#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:07:27,293 INFO L273 TraceCheckUtils]: 92: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 17:07:27,294 INFO L273 TraceCheckUtils]: 93: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,294 INFO L273 TraceCheckUtils]: 94: Hoare triple {11995#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:07:27,294 INFO L273 TraceCheckUtils]: 95: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 17:07:27,294 INFO L273 TraceCheckUtils]: 96: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,294 INFO L273 TraceCheckUtils]: 97: Hoare triple {11995#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:07:27,294 INFO L273 TraceCheckUtils]: 98: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 17:07:27,295 INFO L273 TraceCheckUtils]: 99: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,295 INFO L273 TraceCheckUtils]: 100: Hoare triple {11995#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:07:27,295 INFO L273 TraceCheckUtils]: 101: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 17:07:27,295 INFO L273 TraceCheckUtils]: 102: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,295 INFO L273 TraceCheckUtils]: 103: Hoare triple {11995#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:07:27,296 INFO L273 TraceCheckUtils]: 104: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 17:07:27,296 INFO L273 TraceCheckUtils]: 105: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,296 INFO L273 TraceCheckUtils]: 106: Hoare triple {11995#false} assume !(~i~0 < 100); {11995#false} is VALID [2018-11-14 17:07:27,296 INFO L273 TraceCheckUtils]: 107: Hoare triple {11995#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11995#false} is VALID [2018-11-14 17:07:27,296 INFO L273 TraceCheckUtils]: 108: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,296 INFO L268 TraceCheckUtils]: 109: Hoare quadruple {11995#false} {11995#false} #75#return; {11995#false} is VALID [2018-11-14 17:07:27,297 INFO L273 TraceCheckUtils]: 110: Hoare triple {11995#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {11995#false} is VALID [2018-11-14 17:07:27,297 INFO L273 TraceCheckUtils]: 111: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,297 INFO L273 TraceCheckUtils]: 112: Hoare triple {11995#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 17:07:27,297 INFO L273 TraceCheckUtils]: 113: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 17:07:27,297 INFO L273 TraceCheckUtils]: 114: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,297 INFO L273 TraceCheckUtils]: 115: Hoare triple {11995#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 17:07:27,297 INFO L273 TraceCheckUtils]: 116: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 17:07:27,297 INFO L273 TraceCheckUtils]: 117: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,298 INFO L273 TraceCheckUtils]: 118: Hoare triple {11995#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 17:07:27,298 INFO L273 TraceCheckUtils]: 119: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 17:07:27,298 INFO L273 TraceCheckUtils]: 120: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,298 INFO L273 TraceCheckUtils]: 121: Hoare triple {11995#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 17:07:27,298 INFO L273 TraceCheckUtils]: 122: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 17:07:27,298 INFO L273 TraceCheckUtils]: 123: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,298 INFO L273 TraceCheckUtils]: 124: Hoare triple {11995#false} assume !(~i~2 < 99); {11995#false} is VALID [2018-11-14 17:07:27,298 INFO L273 TraceCheckUtils]: 125: Hoare triple {11995#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {11995#false} is VALID [2018-11-14 17:07:27,298 INFO L256 TraceCheckUtils]: 126: Hoare triple {11995#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {11995#false} is VALID [2018-11-14 17:07:27,299 INFO L273 TraceCheckUtils]: 127: Hoare triple {11995#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11995#false} is VALID [2018-11-14 17:07:27,299 INFO L273 TraceCheckUtils]: 128: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,299 INFO L273 TraceCheckUtils]: 129: Hoare triple {11995#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:07:27,299 INFO L273 TraceCheckUtils]: 130: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 17:07:27,299 INFO L273 TraceCheckUtils]: 131: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,299 INFO L273 TraceCheckUtils]: 132: Hoare triple {11995#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:07:27,299 INFO L273 TraceCheckUtils]: 133: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 17:07:27,299 INFO L273 TraceCheckUtils]: 134: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,299 INFO L273 TraceCheckUtils]: 135: Hoare triple {11995#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:07:27,300 INFO L273 TraceCheckUtils]: 136: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 17:07:27,300 INFO L273 TraceCheckUtils]: 137: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,300 INFO L273 TraceCheckUtils]: 138: Hoare triple {11995#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:07:27,300 INFO L273 TraceCheckUtils]: 139: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 17:07:27,300 INFO L273 TraceCheckUtils]: 140: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,300 INFO L273 TraceCheckUtils]: 141: Hoare triple {11995#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:07:27,300 INFO L273 TraceCheckUtils]: 142: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 17:07:27,300 INFO L273 TraceCheckUtils]: 143: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,300 INFO L273 TraceCheckUtils]: 144: Hoare triple {11995#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:07:27,300 INFO L273 TraceCheckUtils]: 145: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 17:07:27,301 INFO L273 TraceCheckUtils]: 146: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,301 INFO L273 TraceCheckUtils]: 147: Hoare triple {11995#false} assume !(~i~0 < 100); {11995#false} is VALID [2018-11-14 17:07:27,301 INFO L273 TraceCheckUtils]: 148: Hoare triple {11995#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11995#false} is VALID [2018-11-14 17:07:27,301 INFO L273 TraceCheckUtils]: 149: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:07:27,301 INFO L268 TraceCheckUtils]: 150: Hoare quadruple {11995#false} {11995#false} #77#return; {11995#false} is VALID [2018-11-14 17:07:27,301 INFO L273 TraceCheckUtils]: 151: Hoare triple {11995#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {11995#false} is VALID [2018-11-14 17:07:27,301 INFO L273 TraceCheckUtils]: 152: Hoare triple {11995#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {11995#false} is VALID [2018-11-14 17:07:27,301 INFO L273 TraceCheckUtils]: 153: Hoare triple {11995#false} assume !false; {11995#false} is VALID [2018-11-14 17:07:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 270 proven. 57 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2018-11-14 17:07:27,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:27,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2018-11-14 17:07:27,333 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 154 [2018-11-14 17:07:27,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:27,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-14 17:07:27,442 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:27,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-14 17:07:27,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-14 17:07:27,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-14 17:07:27,443 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 27 states. [2018-11-14 17:07:28,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:28,287 INFO L93 Difference]: Finished difference Result 163 states and 175 transitions. [2018-11-14 17:07:28,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-14 17:07:28,287 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 154 [2018-11-14 17:07:28,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:28,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:07:28,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 136 transitions. [2018-11-14 17:07:28,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:07:28,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 136 transitions. [2018-11-14 17:07:28,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 136 transitions. [2018-11-14 17:07:28,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:28,473 INFO L225 Difference]: With dead ends: 163 [2018-11-14 17:07:28,473 INFO L226 Difference]: Without dead ends: 115 [2018-11-14 17:07:28,474 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-14 17:07:28,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-14 17:07:28,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-11-14 17:07:28,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:28,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 113 states. [2018-11-14 17:07:28,516 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 113 states. [2018-11-14 17:07:28,516 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 113 states. [2018-11-14 17:07:28,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:28,520 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-11-14 17:07:28,520 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-14 17:07:28,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:28,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:28,520 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 115 states. [2018-11-14 17:07:28,521 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 115 states. [2018-11-14 17:07:28,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:28,523 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-11-14 17:07:28,523 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-14 17:07:28,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:28,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:28,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:28,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:28,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-14 17:07:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2018-11-14 17:07:28,527 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 154 [2018-11-14 17:07:28,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:28,527 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2018-11-14 17:07:28,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-14 17:07:28,527 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-14 17:07:28,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-14 17:07:28,528 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:28,528 INFO L375 BasicCegarLoop]: trace histogram [24, 21, 21, 19, 18, 18, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:07:28,529 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:28,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:28,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1920636699, now seen corresponding path program 18 times [2018-11-14 17:07:28,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:28,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:28,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:28,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:28,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:28,970 INFO L256 TraceCheckUtils]: 0: Hoare triple {13084#true} call ULTIMATE.init(); {13084#true} is VALID [2018-11-14 17:07:28,970 INFO L273 TraceCheckUtils]: 1: Hoare triple {13084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13084#true} is VALID [2018-11-14 17:07:28,970 INFO L273 TraceCheckUtils]: 2: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:28,970 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13084#true} {13084#true} #69#return; {13084#true} is VALID [2018-11-14 17:07:28,970 INFO L256 TraceCheckUtils]: 4: Hoare triple {13084#true} call #t~ret13 := main(); {13084#true} is VALID [2018-11-14 17:07:28,971 INFO L273 TraceCheckUtils]: 5: Hoare triple {13084#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {13086#(= main_~i~1 0)} is VALID [2018-11-14 17:07:28,971 INFO L273 TraceCheckUtils]: 6: Hoare triple {13086#(= main_~i~1 0)} assume true; {13086#(= main_~i~1 0)} is VALID [2018-11-14 17:07:28,972 INFO L273 TraceCheckUtils]: 7: Hoare triple {13086#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13086#(= main_~i~1 0)} is VALID [2018-11-14 17:07:28,972 INFO L273 TraceCheckUtils]: 8: Hoare triple {13086#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13087#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:28,973 INFO L273 TraceCheckUtils]: 9: Hoare triple {13087#(<= main_~i~1 1)} assume true; {13087#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:28,973 INFO L273 TraceCheckUtils]: 10: Hoare triple {13087#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13087#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:28,973 INFO L273 TraceCheckUtils]: 11: Hoare triple {13087#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13088#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:28,974 INFO L273 TraceCheckUtils]: 12: Hoare triple {13088#(<= main_~i~1 2)} assume true; {13088#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:28,974 INFO L273 TraceCheckUtils]: 13: Hoare triple {13088#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13088#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:28,975 INFO L273 TraceCheckUtils]: 14: Hoare triple {13088#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13089#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:28,975 INFO L273 TraceCheckUtils]: 15: Hoare triple {13089#(<= main_~i~1 3)} assume true; {13089#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:28,976 INFO L273 TraceCheckUtils]: 16: Hoare triple {13089#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13089#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:28,977 INFO L273 TraceCheckUtils]: 17: Hoare triple {13089#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13090#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:28,977 INFO L273 TraceCheckUtils]: 18: Hoare triple {13090#(<= main_~i~1 4)} assume true; {13090#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:28,978 INFO L273 TraceCheckUtils]: 19: Hoare triple {13090#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13090#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:28,978 INFO L273 TraceCheckUtils]: 20: Hoare triple {13090#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13091#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:28,979 INFO L273 TraceCheckUtils]: 21: Hoare triple {13091#(<= main_~i~1 5)} assume true; {13091#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:28,979 INFO L273 TraceCheckUtils]: 22: Hoare triple {13091#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13091#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:28,980 INFO L273 TraceCheckUtils]: 23: Hoare triple {13091#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13092#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:28,981 INFO L273 TraceCheckUtils]: 24: Hoare triple {13092#(<= main_~i~1 6)} assume true; {13092#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:28,981 INFO L273 TraceCheckUtils]: 25: Hoare triple {13092#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13092#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:28,982 INFO L273 TraceCheckUtils]: 26: Hoare triple {13092#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13093#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:28,982 INFO L273 TraceCheckUtils]: 27: Hoare triple {13093#(<= main_~i~1 7)} assume true; {13093#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:28,983 INFO L273 TraceCheckUtils]: 28: Hoare triple {13093#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13093#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:28,984 INFO L273 TraceCheckUtils]: 29: Hoare triple {13093#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13094#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:28,984 INFO L273 TraceCheckUtils]: 30: Hoare triple {13094#(<= main_~i~1 8)} assume true; {13094#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:28,985 INFO L273 TraceCheckUtils]: 31: Hoare triple {13094#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13094#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:28,985 INFO L273 TraceCheckUtils]: 32: Hoare triple {13094#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13095#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:28,986 INFO L273 TraceCheckUtils]: 33: Hoare triple {13095#(<= main_~i~1 9)} assume true; {13095#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:28,986 INFO L273 TraceCheckUtils]: 34: Hoare triple {13095#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13095#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:28,987 INFO L273 TraceCheckUtils]: 35: Hoare triple {13095#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13096#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:28,988 INFO L273 TraceCheckUtils]: 36: Hoare triple {13096#(<= main_~i~1 10)} assume true; {13096#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:28,988 INFO L273 TraceCheckUtils]: 37: Hoare triple {13096#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13096#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:28,989 INFO L273 TraceCheckUtils]: 38: Hoare triple {13096#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13097#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:28,989 INFO L273 TraceCheckUtils]: 39: Hoare triple {13097#(<= main_~i~1 11)} assume true; {13097#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:28,993 INFO L273 TraceCheckUtils]: 40: Hoare triple {13097#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13097#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:28,994 INFO L273 TraceCheckUtils]: 41: Hoare triple {13097#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13098#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:28,994 INFO L273 TraceCheckUtils]: 42: Hoare triple {13098#(<= main_~i~1 12)} assume true; {13098#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:28,994 INFO L273 TraceCheckUtils]: 43: Hoare triple {13098#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13098#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:28,995 INFO L273 TraceCheckUtils]: 44: Hoare triple {13098#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13099#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:28,995 INFO L273 TraceCheckUtils]: 45: Hoare triple {13099#(<= main_~i~1 13)} assume true; {13099#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:28,995 INFO L273 TraceCheckUtils]: 46: Hoare triple {13099#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13099#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:28,996 INFO L273 TraceCheckUtils]: 47: Hoare triple {13099#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13100#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:28,996 INFO L273 TraceCheckUtils]: 48: Hoare triple {13100#(<= main_~i~1 14)} assume true; {13100#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:28,996 INFO L273 TraceCheckUtils]: 49: Hoare triple {13100#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13100#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:28,997 INFO L273 TraceCheckUtils]: 50: Hoare triple {13100#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13101#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:28,997 INFO L273 TraceCheckUtils]: 51: Hoare triple {13101#(<= main_~i~1 15)} assume true; {13101#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:28,998 INFO L273 TraceCheckUtils]: 52: Hoare triple {13101#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13101#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:28,999 INFO L273 TraceCheckUtils]: 53: Hoare triple {13101#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13102#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:28,999 INFO L273 TraceCheckUtils]: 54: Hoare triple {13102#(<= main_~i~1 16)} assume true; {13102#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:29,000 INFO L273 TraceCheckUtils]: 55: Hoare triple {13102#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13102#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:29,000 INFO L273 TraceCheckUtils]: 56: Hoare triple {13102#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13103#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:29,001 INFO L273 TraceCheckUtils]: 57: Hoare triple {13103#(<= main_~i~1 17)} assume true; {13103#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:29,001 INFO L273 TraceCheckUtils]: 58: Hoare triple {13103#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13103#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:29,002 INFO L273 TraceCheckUtils]: 59: Hoare triple {13103#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13104#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:29,003 INFO L273 TraceCheckUtils]: 60: Hoare triple {13104#(<= main_~i~1 18)} assume true; {13104#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:29,003 INFO L273 TraceCheckUtils]: 61: Hoare triple {13104#(<= main_~i~1 18)} assume !(~i~1 < 100); {13085#false} is VALID [2018-11-14 17:07:29,004 INFO L256 TraceCheckUtils]: 62: Hoare triple {13085#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {13084#true} is VALID [2018-11-14 17:07:29,004 INFO L273 TraceCheckUtils]: 63: Hoare triple {13084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13084#true} is VALID [2018-11-14 17:07:29,004 INFO L273 TraceCheckUtils]: 64: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,004 INFO L273 TraceCheckUtils]: 65: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:29,005 INFO L273 TraceCheckUtils]: 66: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:29,005 INFO L273 TraceCheckUtils]: 67: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,005 INFO L273 TraceCheckUtils]: 68: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:29,005 INFO L273 TraceCheckUtils]: 69: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:29,006 INFO L273 TraceCheckUtils]: 70: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,006 INFO L273 TraceCheckUtils]: 71: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:29,006 INFO L273 TraceCheckUtils]: 72: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:29,006 INFO L273 TraceCheckUtils]: 73: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,007 INFO L273 TraceCheckUtils]: 74: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:29,007 INFO L273 TraceCheckUtils]: 75: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:29,007 INFO L273 TraceCheckUtils]: 76: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,007 INFO L273 TraceCheckUtils]: 77: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:29,007 INFO L273 TraceCheckUtils]: 78: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:29,008 INFO L273 TraceCheckUtils]: 79: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,008 INFO L273 TraceCheckUtils]: 80: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:29,008 INFO L273 TraceCheckUtils]: 81: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:29,008 INFO L273 TraceCheckUtils]: 82: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,008 INFO L273 TraceCheckUtils]: 83: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:29,008 INFO L273 TraceCheckUtils]: 84: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:29,008 INFO L273 TraceCheckUtils]: 85: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,008 INFO L273 TraceCheckUtils]: 86: Hoare triple {13084#true} assume !(~i~0 < 100); {13084#true} is VALID [2018-11-14 17:07:29,008 INFO L273 TraceCheckUtils]: 87: Hoare triple {13084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13084#true} is VALID [2018-11-14 17:07:29,009 INFO L273 TraceCheckUtils]: 88: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,009 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {13084#true} {13085#false} #73#return; {13085#false} is VALID [2018-11-14 17:07:29,009 INFO L273 TraceCheckUtils]: 90: Hoare triple {13085#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {13085#false} is VALID [2018-11-14 17:07:29,009 INFO L256 TraceCheckUtils]: 91: Hoare triple {13085#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {13084#true} is VALID [2018-11-14 17:07:29,009 INFO L273 TraceCheckUtils]: 92: Hoare triple {13084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13084#true} is VALID [2018-11-14 17:07:29,009 INFO L273 TraceCheckUtils]: 93: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,009 INFO L273 TraceCheckUtils]: 94: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:29,009 INFO L273 TraceCheckUtils]: 95: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:29,009 INFO L273 TraceCheckUtils]: 96: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,010 INFO L273 TraceCheckUtils]: 97: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:29,010 INFO L273 TraceCheckUtils]: 98: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:29,010 INFO L273 TraceCheckUtils]: 99: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,010 INFO L273 TraceCheckUtils]: 100: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:29,010 INFO L273 TraceCheckUtils]: 101: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:29,010 INFO L273 TraceCheckUtils]: 102: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,010 INFO L273 TraceCheckUtils]: 103: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:29,010 INFO L273 TraceCheckUtils]: 104: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:29,011 INFO L273 TraceCheckUtils]: 105: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,011 INFO L273 TraceCheckUtils]: 106: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:29,011 INFO L273 TraceCheckUtils]: 107: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:29,011 INFO L273 TraceCheckUtils]: 108: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,011 INFO L273 TraceCheckUtils]: 109: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:29,011 INFO L273 TraceCheckUtils]: 110: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:29,012 INFO L273 TraceCheckUtils]: 111: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,012 INFO L273 TraceCheckUtils]: 112: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:29,012 INFO L273 TraceCheckUtils]: 113: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:29,012 INFO L273 TraceCheckUtils]: 114: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,012 INFO L273 TraceCheckUtils]: 115: Hoare triple {13084#true} assume !(~i~0 < 100); {13084#true} is VALID [2018-11-14 17:07:29,012 INFO L273 TraceCheckUtils]: 116: Hoare triple {13084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13084#true} is VALID [2018-11-14 17:07:29,013 INFO L273 TraceCheckUtils]: 117: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,013 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {13084#true} {13085#false} #75#return; {13085#false} is VALID [2018-11-14 17:07:29,013 INFO L273 TraceCheckUtils]: 119: Hoare triple {13085#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {13085#false} is VALID [2018-11-14 17:07:29,013 INFO L273 TraceCheckUtils]: 120: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:07:29,013 INFO L273 TraceCheckUtils]: 121: Hoare triple {13085#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13085#false} is VALID [2018-11-14 17:07:29,013 INFO L273 TraceCheckUtils]: 122: Hoare triple {13085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13085#false} is VALID [2018-11-14 17:07:29,013 INFO L273 TraceCheckUtils]: 123: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:07:29,014 INFO L273 TraceCheckUtils]: 124: Hoare triple {13085#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13085#false} is VALID [2018-11-14 17:07:29,014 INFO L273 TraceCheckUtils]: 125: Hoare triple {13085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13085#false} is VALID [2018-11-14 17:07:29,014 INFO L273 TraceCheckUtils]: 126: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:07:29,014 INFO L273 TraceCheckUtils]: 127: Hoare triple {13085#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13085#false} is VALID [2018-11-14 17:07:29,014 INFO L273 TraceCheckUtils]: 128: Hoare triple {13085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13085#false} is VALID [2018-11-14 17:07:29,014 INFO L273 TraceCheckUtils]: 129: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:07:29,015 INFO L273 TraceCheckUtils]: 130: Hoare triple {13085#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13085#false} is VALID [2018-11-14 17:07:29,015 INFO L273 TraceCheckUtils]: 131: Hoare triple {13085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13085#false} is VALID [2018-11-14 17:07:29,015 INFO L273 TraceCheckUtils]: 132: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:07:29,015 INFO L273 TraceCheckUtils]: 133: Hoare triple {13085#false} assume !(~i~2 < 99); {13085#false} is VALID [2018-11-14 17:07:29,015 INFO L273 TraceCheckUtils]: 134: Hoare triple {13085#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {13085#false} is VALID [2018-11-14 17:07:29,015 INFO L256 TraceCheckUtils]: 135: Hoare triple {13085#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {13084#true} is VALID [2018-11-14 17:07:29,015 INFO L273 TraceCheckUtils]: 136: Hoare triple {13084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13084#true} is VALID [2018-11-14 17:07:29,016 INFO L273 TraceCheckUtils]: 137: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,016 INFO L273 TraceCheckUtils]: 138: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:29,016 INFO L273 TraceCheckUtils]: 139: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:29,016 INFO L273 TraceCheckUtils]: 140: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,016 INFO L273 TraceCheckUtils]: 141: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:29,016 INFO L273 TraceCheckUtils]: 142: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:29,017 INFO L273 TraceCheckUtils]: 143: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,017 INFO L273 TraceCheckUtils]: 144: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:29,017 INFO L273 TraceCheckUtils]: 145: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:29,017 INFO L273 TraceCheckUtils]: 146: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,017 INFO L273 TraceCheckUtils]: 147: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:29,017 INFO L273 TraceCheckUtils]: 148: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:29,017 INFO L273 TraceCheckUtils]: 149: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,018 INFO L273 TraceCheckUtils]: 150: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:29,018 INFO L273 TraceCheckUtils]: 151: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:29,018 INFO L273 TraceCheckUtils]: 152: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,018 INFO L273 TraceCheckUtils]: 153: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:29,018 INFO L273 TraceCheckUtils]: 154: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:29,018 INFO L273 TraceCheckUtils]: 155: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,019 INFO L273 TraceCheckUtils]: 156: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:29,019 INFO L273 TraceCheckUtils]: 157: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:29,019 INFO L273 TraceCheckUtils]: 158: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,019 INFO L273 TraceCheckUtils]: 159: Hoare triple {13084#true} assume !(~i~0 < 100); {13084#true} is VALID [2018-11-14 17:07:29,019 INFO L273 TraceCheckUtils]: 160: Hoare triple {13084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13084#true} is VALID [2018-11-14 17:07:29,019 INFO L273 TraceCheckUtils]: 161: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,019 INFO L268 TraceCheckUtils]: 162: Hoare quadruple {13084#true} {13085#false} #77#return; {13085#false} is VALID [2018-11-14 17:07:29,020 INFO L273 TraceCheckUtils]: 163: Hoare triple {13085#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {13085#false} is VALID [2018-11-14 17:07:29,020 INFO L273 TraceCheckUtils]: 164: Hoare triple {13085#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {13085#false} is VALID [2018-11-14 17:07:29,020 INFO L273 TraceCheckUtils]: 165: Hoare triple {13085#false} assume !false; {13085#false} is VALID [2018-11-14 17:07:29,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-11-14 17:07:29,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:29,033 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:07:29,042 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:07:29,407 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-14 17:07:29,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:29,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:29,990 INFO L256 TraceCheckUtils]: 0: Hoare triple {13084#true} call ULTIMATE.init(); {13084#true} is VALID [2018-11-14 17:07:29,991 INFO L273 TraceCheckUtils]: 1: Hoare triple {13084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13084#true} is VALID [2018-11-14 17:07:29,991 INFO L273 TraceCheckUtils]: 2: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,991 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13084#true} {13084#true} #69#return; {13084#true} is VALID [2018-11-14 17:07:29,992 INFO L256 TraceCheckUtils]: 4: Hoare triple {13084#true} call #t~ret13 := main(); {13084#true} is VALID [2018-11-14 17:07:29,992 INFO L273 TraceCheckUtils]: 5: Hoare triple {13084#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {13084#true} is VALID [2018-11-14 17:07:29,992 INFO L273 TraceCheckUtils]: 6: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,992 INFO L273 TraceCheckUtils]: 7: Hoare triple {13084#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:07:29,993 INFO L273 TraceCheckUtils]: 8: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:07:29,993 INFO L273 TraceCheckUtils]: 9: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,993 INFO L273 TraceCheckUtils]: 10: Hoare triple {13084#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:07:29,993 INFO L273 TraceCheckUtils]: 11: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:07:29,993 INFO L273 TraceCheckUtils]: 12: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,993 INFO L273 TraceCheckUtils]: 13: Hoare triple {13084#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:07:29,994 INFO L273 TraceCheckUtils]: 14: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:07:29,994 INFO L273 TraceCheckUtils]: 15: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,994 INFO L273 TraceCheckUtils]: 16: Hoare triple {13084#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:07:29,994 INFO L273 TraceCheckUtils]: 17: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:07:29,994 INFO L273 TraceCheckUtils]: 18: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,994 INFO L273 TraceCheckUtils]: 19: Hoare triple {13084#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:07:29,995 INFO L273 TraceCheckUtils]: 20: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:07:29,995 INFO L273 TraceCheckUtils]: 21: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,995 INFO L273 TraceCheckUtils]: 22: Hoare triple {13084#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:07:29,995 INFO L273 TraceCheckUtils]: 23: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:07:29,995 INFO L273 TraceCheckUtils]: 24: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,995 INFO L273 TraceCheckUtils]: 25: Hoare triple {13084#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:07:29,996 INFO L273 TraceCheckUtils]: 26: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:07:29,996 INFO L273 TraceCheckUtils]: 27: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,996 INFO L273 TraceCheckUtils]: 28: Hoare triple {13084#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:07:29,996 INFO L273 TraceCheckUtils]: 29: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:07:29,996 INFO L273 TraceCheckUtils]: 30: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,996 INFO L273 TraceCheckUtils]: 31: Hoare triple {13084#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:07:29,996 INFO L273 TraceCheckUtils]: 32: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:07:29,997 INFO L273 TraceCheckUtils]: 33: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,997 INFO L273 TraceCheckUtils]: 34: Hoare triple {13084#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:07:29,997 INFO L273 TraceCheckUtils]: 35: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:07:29,997 INFO L273 TraceCheckUtils]: 36: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,997 INFO L273 TraceCheckUtils]: 37: Hoare triple {13084#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:07:29,997 INFO L273 TraceCheckUtils]: 38: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:07:29,998 INFO L273 TraceCheckUtils]: 39: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,998 INFO L273 TraceCheckUtils]: 40: Hoare triple {13084#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:07:29,998 INFO L273 TraceCheckUtils]: 41: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:07:29,998 INFO L273 TraceCheckUtils]: 42: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,998 INFO L273 TraceCheckUtils]: 43: Hoare triple {13084#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:07:29,998 INFO L273 TraceCheckUtils]: 44: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:07:29,999 INFO L273 TraceCheckUtils]: 45: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,999 INFO L273 TraceCheckUtils]: 46: Hoare triple {13084#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:07:29,999 INFO L273 TraceCheckUtils]: 47: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:07:29,999 INFO L273 TraceCheckUtils]: 48: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:29,999 INFO L273 TraceCheckUtils]: 49: Hoare triple {13084#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:07:30,000 INFO L273 TraceCheckUtils]: 50: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:07:30,000 INFO L273 TraceCheckUtils]: 51: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,000 INFO L273 TraceCheckUtils]: 52: Hoare triple {13084#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:07:30,000 INFO L273 TraceCheckUtils]: 53: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:07:30,000 INFO L273 TraceCheckUtils]: 54: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,000 INFO L273 TraceCheckUtils]: 55: Hoare triple {13084#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:07:30,001 INFO L273 TraceCheckUtils]: 56: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:07:30,001 INFO L273 TraceCheckUtils]: 57: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,001 INFO L273 TraceCheckUtils]: 58: Hoare triple {13084#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:07:30,001 INFO L273 TraceCheckUtils]: 59: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:07:30,001 INFO L273 TraceCheckUtils]: 60: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,001 INFO L273 TraceCheckUtils]: 61: Hoare triple {13084#true} assume !(~i~1 < 100); {13084#true} is VALID [2018-11-14 17:07:30,002 INFO L256 TraceCheckUtils]: 62: Hoare triple {13084#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {13084#true} is VALID [2018-11-14 17:07:30,002 INFO L273 TraceCheckUtils]: 63: Hoare triple {13084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13084#true} is VALID [2018-11-14 17:07:30,002 INFO L273 TraceCheckUtils]: 64: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,002 INFO L273 TraceCheckUtils]: 65: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:30,002 INFO L273 TraceCheckUtils]: 66: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:30,002 INFO L273 TraceCheckUtils]: 67: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,002 INFO L273 TraceCheckUtils]: 68: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:30,002 INFO L273 TraceCheckUtils]: 69: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:30,003 INFO L273 TraceCheckUtils]: 70: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,003 INFO L273 TraceCheckUtils]: 71: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:30,003 INFO L273 TraceCheckUtils]: 72: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:30,003 INFO L273 TraceCheckUtils]: 73: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,003 INFO L273 TraceCheckUtils]: 74: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:30,003 INFO L273 TraceCheckUtils]: 75: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:30,004 INFO L273 TraceCheckUtils]: 76: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,004 INFO L273 TraceCheckUtils]: 77: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:30,004 INFO L273 TraceCheckUtils]: 78: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:30,004 INFO L273 TraceCheckUtils]: 79: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,004 INFO L273 TraceCheckUtils]: 80: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:30,004 INFO L273 TraceCheckUtils]: 81: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:30,004 INFO L273 TraceCheckUtils]: 82: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,004 INFO L273 TraceCheckUtils]: 83: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:30,005 INFO L273 TraceCheckUtils]: 84: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:30,005 INFO L273 TraceCheckUtils]: 85: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,005 INFO L273 TraceCheckUtils]: 86: Hoare triple {13084#true} assume !(~i~0 < 100); {13084#true} is VALID [2018-11-14 17:07:30,005 INFO L273 TraceCheckUtils]: 87: Hoare triple {13084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13084#true} is VALID [2018-11-14 17:07:30,005 INFO L273 TraceCheckUtils]: 88: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,005 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {13084#true} {13084#true} #73#return; {13084#true} is VALID [2018-11-14 17:07:30,005 INFO L273 TraceCheckUtils]: 90: Hoare triple {13084#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {13084#true} is VALID [2018-11-14 17:07:30,006 INFO L256 TraceCheckUtils]: 91: Hoare triple {13084#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {13084#true} is VALID [2018-11-14 17:07:30,006 INFO L273 TraceCheckUtils]: 92: Hoare triple {13084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13084#true} is VALID [2018-11-14 17:07:30,006 INFO L273 TraceCheckUtils]: 93: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,006 INFO L273 TraceCheckUtils]: 94: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:30,006 INFO L273 TraceCheckUtils]: 95: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:30,006 INFO L273 TraceCheckUtils]: 96: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,006 INFO L273 TraceCheckUtils]: 97: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:30,007 INFO L273 TraceCheckUtils]: 98: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:30,007 INFO L273 TraceCheckUtils]: 99: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,007 INFO L273 TraceCheckUtils]: 100: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:30,007 INFO L273 TraceCheckUtils]: 101: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:30,007 INFO L273 TraceCheckUtils]: 102: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,007 INFO L273 TraceCheckUtils]: 103: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:30,007 INFO L273 TraceCheckUtils]: 104: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:30,008 INFO L273 TraceCheckUtils]: 105: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,008 INFO L273 TraceCheckUtils]: 106: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:30,008 INFO L273 TraceCheckUtils]: 107: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:30,008 INFO L273 TraceCheckUtils]: 108: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,008 INFO L273 TraceCheckUtils]: 109: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:30,008 INFO L273 TraceCheckUtils]: 110: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:30,008 INFO L273 TraceCheckUtils]: 111: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,009 INFO L273 TraceCheckUtils]: 112: Hoare triple {13084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:07:30,009 INFO L273 TraceCheckUtils]: 113: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:07:30,009 INFO L273 TraceCheckUtils]: 114: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,009 INFO L273 TraceCheckUtils]: 115: Hoare triple {13084#true} assume !(~i~0 < 100); {13084#true} is VALID [2018-11-14 17:07:30,009 INFO L273 TraceCheckUtils]: 116: Hoare triple {13084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13084#true} is VALID [2018-11-14 17:07:30,009 INFO L273 TraceCheckUtils]: 117: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:07:30,009 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {13084#true} {13084#true} #75#return; {13084#true} is VALID [2018-11-14 17:07:30,010 INFO L273 TraceCheckUtils]: 119: Hoare triple {13084#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {13465#(<= main_~i~2 0)} is VALID [2018-11-14 17:07:30,011 INFO L273 TraceCheckUtils]: 120: Hoare triple {13465#(<= main_~i~2 0)} assume true; {13465#(<= main_~i~2 0)} is VALID [2018-11-14 17:07:30,011 INFO L273 TraceCheckUtils]: 121: Hoare triple {13465#(<= main_~i~2 0)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13465#(<= main_~i~2 0)} is VALID [2018-11-14 17:07:30,011 INFO L273 TraceCheckUtils]: 122: Hoare triple {13465#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13475#(<= main_~i~2 1)} is VALID [2018-11-14 17:07:30,012 INFO L273 TraceCheckUtils]: 123: Hoare triple {13475#(<= main_~i~2 1)} assume true; {13475#(<= main_~i~2 1)} is VALID [2018-11-14 17:07:30,012 INFO L273 TraceCheckUtils]: 124: Hoare triple {13475#(<= main_~i~2 1)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13475#(<= main_~i~2 1)} is VALID [2018-11-14 17:07:30,023 INFO L273 TraceCheckUtils]: 125: Hoare triple {13475#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13485#(<= main_~i~2 2)} is VALID [2018-11-14 17:07:30,024 INFO L273 TraceCheckUtils]: 126: Hoare triple {13485#(<= main_~i~2 2)} assume true; {13485#(<= main_~i~2 2)} is VALID [2018-11-14 17:07:30,024 INFO L273 TraceCheckUtils]: 127: Hoare triple {13485#(<= main_~i~2 2)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13485#(<= main_~i~2 2)} is VALID [2018-11-14 17:07:30,025 INFO L273 TraceCheckUtils]: 128: Hoare triple {13485#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13495#(<= main_~i~2 3)} is VALID [2018-11-14 17:07:30,025 INFO L273 TraceCheckUtils]: 129: Hoare triple {13495#(<= main_~i~2 3)} assume true; {13495#(<= main_~i~2 3)} is VALID [2018-11-14 17:07:30,025 INFO L273 TraceCheckUtils]: 130: Hoare triple {13495#(<= main_~i~2 3)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13495#(<= main_~i~2 3)} is VALID [2018-11-14 17:07:30,026 INFO L273 TraceCheckUtils]: 131: Hoare triple {13495#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13505#(<= main_~i~2 4)} is VALID [2018-11-14 17:07:30,026 INFO L273 TraceCheckUtils]: 132: Hoare triple {13505#(<= main_~i~2 4)} assume true; {13505#(<= main_~i~2 4)} is VALID [2018-11-14 17:07:30,027 INFO L273 TraceCheckUtils]: 133: Hoare triple {13505#(<= main_~i~2 4)} assume !(~i~2 < 99); {13085#false} is VALID [2018-11-14 17:07:30,027 INFO L273 TraceCheckUtils]: 134: Hoare triple {13085#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {13085#false} is VALID [2018-11-14 17:07:30,028 INFO L256 TraceCheckUtils]: 135: Hoare triple {13085#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {13085#false} is VALID [2018-11-14 17:07:30,028 INFO L273 TraceCheckUtils]: 136: Hoare triple {13085#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13085#false} is VALID [2018-11-14 17:07:30,028 INFO L273 TraceCheckUtils]: 137: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:07:30,028 INFO L273 TraceCheckUtils]: 138: Hoare triple {13085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 17:07:30,029 INFO L273 TraceCheckUtils]: 139: Hoare triple {13085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13085#false} is VALID [2018-11-14 17:07:30,029 INFO L273 TraceCheckUtils]: 140: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:07:30,029 INFO L273 TraceCheckUtils]: 141: Hoare triple {13085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 17:07:30,029 INFO L273 TraceCheckUtils]: 142: Hoare triple {13085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13085#false} is VALID [2018-11-14 17:07:30,030 INFO L273 TraceCheckUtils]: 143: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:07:30,030 INFO L273 TraceCheckUtils]: 144: Hoare triple {13085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 17:07:30,030 INFO L273 TraceCheckUtils]: 145: Hoare triple {13085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13085#false} is VALID [2018-11-14 17:07:30,030 INFO L273 TraceCheckUtils]: 146: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:07:30,031 INFO L273 TraceCheckUtils]: 147: Hoare triple {13085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 17:07:30,031 INFO L273 TraceCheckUtils]: 148: Hoare triple {13085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13085#false} is VALID [2018-11-14 17:07:30,031 INFO L273 TraceCheckUtils]: 149: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:07:30,031 INFO L273 TraceCheckUtils]: 150: Hoare triple {13085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 17:07:30,031 INFO L273 TraceCheckUtils]: 151: Hoare triple {13085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13085#false} is VALID [2018-11-14 17:07:30,032 INFO L273 TraceCheckUtils]: 152: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:07:30,032 INFO L273 TraceCheckUtils]: 153: Hoare triple {13085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 17:07:30,032 INFO L273 TraceCheckUtils]: 154: Hoare triple {13085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13085#false} is VALID [2018-11-14 17:07:30,032 INFO L273 TraceCheckUtils]: 155: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:07:30,032 INFO L273 TraceCheckUtils]: 156: Hoare triple {13085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 17:07:30,032 INFO L273 TraceCheckUtils]: 157: Hoare triple {13085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13085#false} is VALID [2018-11-14 17:07:30,033 INFO L273 TraceCheckUtils]: 158: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:07:30,033 INFO L273 TraceCheckUtils]: 159: Hoare triple {13085#false} assume !(~i~0 < 100); {13085#false} is VALID [2018-11-14 17:07:30,033 INFO L273 TraceCheckUtils]: 160: Hoare triple {13085#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13085#false} is VALID [2018-11-14 17:07:30,033 INFO L273 TraceCheckUtils]: 161: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:07:30,033 INFO L268 TraceCheckUtils]: 162: Hoare quadruple {13085#false} {13085#false} #77#return; {13085#false} is VALID [2018-11-14 17:07:30,033 INFO L273 TraceCheckUtils]: 163: Hoare triple {13085#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {13085#false} is VALID [2018-11-14 17:07:30,033 INFO L273 TraceCheckUtils]: 164: Hoare triple {13085#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {13085#false} is VALID [2018-11-14 17:07:30,034 INFO L273 TraceCheckUtils]: 165: Hoare triple {13085#false} assume !false; {13085#false} is VALID [2018-11-14 17:07:30,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 362 proven. 26 refuted. 0 times theorem prover too weak. 907 trivial. 0 not checked. [2018-11-14 17:07:30,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:30,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7] total 26 [2018-11-14 17:07:30,088 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 166 [2018-11-14 17:07:30,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:30,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 17:07:30,199 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:30,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 17:07:30,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 17:07:30,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2018-11-14 17:07:30,201 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 26 states. [2018-11-14 17:07:30,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:30,794 INFO L93 Difference]: Finished difference Result 172 states and 181 transitions. [2018-11-14 17:07:30,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-14 17:07:30,795 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 166 [2018-11-14 17:07:30,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:30,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:07:30,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 130 transitions. [2018-11-14 17:07:30,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:07:30,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 130 transitions. [2018-11-14 17:07:30,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 130 transitions. [2018-11-14 17:07:30,959 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:30,963 INFO L225 Difference]: With dead ends: 172 [2018-11-14 17:07:30,963 INFO L226 Difference]: Without dead ends: 121 [2018-11-14 17:07:30,964 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2018-11-14 17:07:30,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-14 17:07:31,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-11-14 17:07:31,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:31,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 119 states. [2018-11-14 17:07:31,011 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 119 states. [2018-11-14 17:07:31,011 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 119 states. [2018-11-14 17:07:31,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:31,013 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-14 17:07:31,013 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-14 17:07:31,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:31,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:31,014 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 121 states. [2018-11-14 17:07:31,015 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 121 states. [2018-11-14 17:07:31,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:31,016 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-14 17:07:31,016 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-14 17:07:31,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:31,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:31,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:31,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:31,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-14 17:07:31,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2018-11-14 17:07:31,020 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 166 [2018-11-14 17:07:31,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:31,020 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2018-11-14 17:07:31,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 17:07:31,020 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-11-14 17:07:31,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-14 17:07:31,021 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:31,022 INFO L375 BasicCegarLoop]: trace histogram [24, 21, 21, 20, 19, 19, 6, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:07:31,022 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:31,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:31,022 INFO L82 PathProgramCache]: Analyzing trace with hash 625651725, now seen corresponding path program 19 times [2018-11-14 17:07:31,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:31,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:31,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:31,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:31,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:31,473 INFO L256 TraceCheckUtils]: 0: Hoare triple {14241#true} call ULTIMATE.init(); {14241#true} is VALID [2018-11-14 17:07:31,473 INFO L273 TraceCheckUtils]: 1: Hoare triple {14241#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14241#true} is VALID [2018-11-14 17:07:31,474 INFO L273 TraceCheckUtils]: 2: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,474 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14241#true} {14241#true} #69#return; {14241#true} is VALID [2018-11-14 17:07:31,474 INFO L256 TraceCheckUtils]: 4: Hoare triple {14241#true} call #t~ret13 := main(); {14241#true} is VALID [2018-11-14 17:07:31,475 INFO L273 TraceCheckUtils]: 5: Hoare triple {14241#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {14243#(= main_~i~1 0)} is VALID [2018-11-14 17:07:31,475 INFO L273 TraceCheckUtils]: 6: Hoare triple {14243#(= main_~i~1 0)} assume true; {14243#(= main_~i~1 0)} is VALID [2018-11-14 17:07:31,476 INFO L273 TraceCheckUtils]: 7: Hoare triple {14243#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14243#(= main_~i~1 0)} is VALID [2018-11-14 17:07:31,476 INFO L273 TraceCheckUtils]: 8: Hoare triple {14243#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14244#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:31,476 INFO L273 TraceCheckUtils]: 9: Hoare triple {14244#(<= main_~i~1 1)} assume true; {14244#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:31,477 INFO L273 TraceCheckUtils]: 10: Hoare triple {14244#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14244#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:31,477 INFO L273 TraceCheckUtils]: 11: Hoare triple {14244#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14245#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:31,477 INFO L273 TraceCheckUtils]: 12: Hoare triple {14245#(<= main_~i~1 2)} assume true; {14245#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:31,478 INFO L273 TraceCheckUtils]: 13: Hoare triple {14245#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14245#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:31,478 INFO L273 TraceCheckUtils]: 14: Hoare triple {14245#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14246#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:31,478 INFO L273 TraceCheckUtils]: 15: Hoare triple {14246#(<= main_~i~1 3)} assume true; {14246#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:31,479 INFO L273 TraceCheckUtils]: 16: Hoare triple {14246#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14246#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:31,480 INFO L273 TraceCheckUtils]: 17: Hoare triple {14246#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14247#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:31,480 INFO L273 TraceCheckUtils]: 18: Hoare triple {14247#(<= main_~i~1 4)} assume true; {14247#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:31,481 INFO L273 TraceCheckUtils]: 19: Hoare triple {14247#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14247#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:31,481 INFO L273 TraceCheckUtils]: 20: Hoare triple {14247#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14248#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:31,482 INFO L273 TraceCheckUtils]: 21: Hoare triple {14248#(<= main_~i~1 5)} assume true; {14248#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:31,482 INFO L273 TraceCheckUtils]: 22: Hoare triple {14248#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14248#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:31,483 INFO L273 TraceCheckUtils]: 23: Hoare triple {14248#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14249#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:31,484 INFO L273 TraceCheckUtils]: 24: Hoare triple {14249#(<= main_~i~1 6)} assume true; {14249#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:31,484 INFO L273 TraceCheckUtils]: 25: Hoare triple {14249#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14249#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:31,485 INFO L273 TraceCheckUtils]: 26: Hoare triple {14249#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14250#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:31,485 INFO L273 TraceCheckUtils]: 27: Hoare triple {14250#(<= main_~i~1 7)} assume true; {14250#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:31,486 INFO L273 TraceCheckUtils]: 28: Hoare triple {14250#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14250#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:31,487 INFO L273 TraceCheckUtils]: 29: Hoare triple {14250#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14251#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:31,487 INFO L273 TraceCheckUtils]: 30: Hoare triple {14251#(<= main_~i~1 8)} assume true; {14251#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:31,488 INFO L273 TraceCheckUtils]: 31: Hoare triple {14251#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14251#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:31,488 INFO L273 TraceCheckUtils]: 32: Hoare triple {14251#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14252#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:31,489 INFO L273 TraceCheckUtils]: 33: Hoare triple {14252#(<= main_~i~1 9)} assume true; {14252#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:31,489 INFO L273 TraceCheckUtils]: 34: Hoare triple {14252#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14252#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:31,490 INFO L273 TraceCheckUtils]: 35: Hoare triple {14252#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14253#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:31,491 INFO L273 TraceCheckUtils]: 36: Hoare triple {14253#(<= main_~i~1 10)} assume true; {14253#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:31,491 INFO L273 TraceCheckUtils]: 37: Hoare triple {14253#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14253#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:31,492 INFO L273 TraceCheckUtils]: 38: Hoare triple {14253#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14254#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:31,492 INFO L273 TraceCheckUtils]: 39: Hoare triple {14254#(<= main_~i~1 11)} assume true; {14254#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:31,493 INFO L273 TraceCheckUtils]: 40: Hoare triple {14254#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14254#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:31,493 INFO L273 TraceCheckUtils]: 41: Hoare triple {14254#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14255#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:31,494 INFO L273 TraceCheckUtils]: 42: Hoare triple {14255#(<= main_~i~1 12)} assume true; {14255#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:31,494 INFO L273 TraceCheckUtils]: 43: Hoare triple {14255#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14255#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:31,495 INFO L273 TraceCheckUtils]: 44: Hoare triple {14255#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14256#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:31,496 INFO L273 TraceCheckUtils]: 45: Hoare triple {14256#(<= main_~i~1 13)} assume true; {14256#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:31,496 INFO L273 TraceCheckUtils]: 46: Hoare triple {14256#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14256#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:31,497 INFO L273 TraceCheckUtils]: 47: Hoare triple {14256#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14257#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:31,502 INFO L273 TraceCheckUtils]: 48: Hoare triple {14257#(<= main_~i~1 14)} assume true; {14257#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:31,503 INFO L273 TraceCheckUtils]: 49: Hoare triple {14257#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14257#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:31,503 INFO L273 TraceCheckUtils]: 50: Hoare triple {14257#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14258#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:31,503 INFO L273 TraceCheckUtils]: 51: Hoare triple {14258#(<= main_~i~1 15)} assume true; {14258#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:31,504 INFO L273 TraceCheckUtils]: 52: Hoare triple {14258#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14258#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:31,504 INFO L273 TraceCheckUtils]: 53: Hoare triple {14258#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14259#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:31,504 INFO L273 TraceCheckUtils]: 54: Hoare triple {14259#(<= main_~i~1 16)} assume true; {14259#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:31,505 INFO L273 TraceCheckUtils]: 55: Hoare triple {14259#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14259#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:31,505 INFO L273 TraceCheckUtils]: 56: Hoare triple {14259#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14260#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:31,505 INFO L273 TraceCheckUtils]: 57: Hoare triple {14260#(<= main_~i~1 17)} assume true; {14260#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:31,506 INFO L273 TraceCheckUtils]: 58: Hoare triple {14260#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14260#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:31,506 INFO L273 TraceCheckUtils]: 59: Hoare triple {14260#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14261#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:31,506 INFO L273 TraceCheckUtils]: 60: Hoare triple {14261#(<= main_~i~1 18)} assume true; {14261#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:31,507 INFO L273 TraceCheckUtils]: 61: Hoare triple {14261#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14261#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:31,508 INFO L273 TraceCheckUtils]: 62: Hoare triple {14261#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14262#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:31,508 INFO L273 TraceCheckUtils]: 63: Hoare triple {14262#(<= main_~i~1 19)} assume true; {14262#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:31,509 INFO L273 TraceCheckUtils]: 64: Hoare triple {14262#(<= main_~i~1 19)} assume !(~i~1 < 100); {14242#false} is VALID [2018-11-14 17:07:31,509 INFO L256 TraceCheckUtils]: 65: Hoare triple {14242#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {14241#true} is VALID [2018-11-14 17:07:31,509 INFO L273 TraceCheckUtils]: 66: Hoare triple {14241#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14241#true} is VALID [2018-11-14 17:07:31,509 INFO L273 TraceCheckUtils]: 67: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,510 INFO L273 TraceCheckUtils]: 68: Hoare triple {14241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:07:31,510 INFO L273 TraceCheckUtils]: 69: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:07:31,510 INFO L273 TraceCheckUtils]: 70: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,510 INFO L273 TraceCheckUtils]: 71: Hoare triple {14241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:07:31,510 INFO L273 TraceCheckUtils]: 72: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:07:31,510 INFO L273 TraceCheckUtils]: 73: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,511 INFO L273 TraceCheckUtils]: 74: Hoare triple {14241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:07:31,511 INFO L273 TraceCheckUtils]: 75: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:07:31,511 INFO L273 TraceCheckUtils]: 76: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,511 INFO L273 TraceCheckUtils]: 77: Hoare triple {14241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:07:31,511 INFO L273 TraceCheckUtils]: 78: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:07:31,512 INFO L273 TraceCheckUtils]: 79: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,512 INFO L273 TraceCheckUtils]: 80: Hoare triple {14241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:07:31,512 INFO L273 TraceCheckUtils]: 81: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:07:31,512 INFO L273 TraceCheckUtils]: 82: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,512 INFO L273 TraceCheckUtils]: 83: Hoare triple {14241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:07:31,512 INFO L273 TraceCheckUtils]: 84: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:07:31,512 INFO L273 TraceCheckUtils]: 85: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,512 INFO L273 TraceCheckUtils]: 86: Hoare triple {14241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:07:31,512 INFO L273 TraceCheckUtils]: 87: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:07:31,513 INFO L273 TraceCheckUtils]: 88: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,513 INFO L273 TraceCheckUtils]: 89: Hoare triple {14241#true} assume !(~i~0 < 100); {14241#true} is VALID [2018-11-14 17:07:31,513 INFO L273 TraceCheckUtils]: 90: Hoare triple {14241#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14241#true} is VALID [2018-11-14 17:07:31,513 INFO L273 TraceCheckUtils]: 91: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,513 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {14241#true} {14242#false} #73#return; {14242#false} is VALID [2018-11-14 17:07:31,513 INFO L273 TraceCheckUtils]: 93: Hoare triple {14242#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {14242#false} is VALID [2018-11-14 17:07:31,513 INFO L256 TraceCheckUtils]: 94: Hoare triple {14242#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {14241#true} is VALID [2018-11-14 17:07:31,513 INFO L273 TraceCheckUtils]: 95: Hoare triple {14241#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14241#true} is VALID [2018-11-14 17:07:31,513 INFO L273 TraceCheckUtils]: 96: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,514 INFO L273 TraceCheckUtils]: 97: Hoare triple {14241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:07:31,514 INFO L273 TraceCheckUtils]: 98: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:07:31,514 INFO L273 TraceCheckUtils]: 99: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,514 INFO L273 TraceCheckUtils]: 100: Hoare triple {14241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:07:31,514 INFO L273 TraceCheckUtils]: 101: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:07:31,514 INFO L273 TraceCheckUtils]: 102: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,514 INFO L273 TraceCheckUtils]: 103: Hoare triple {14241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:07:31,514 INFO L273 TraceCheckUtils]: 104: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:07:31,514 INFO L273 TraceCheckUtils]: 105: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,515 INFO L273 TraceCheckUtils]: 106: Hoare triple {14241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:07:31,515 INFO L273 TraceCheckUtils]: 107: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:07:31,515 INFO L273 TraceCheckUtils]: 108: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,515 INFO L273 TraceCheckUtils]: 109: Hoare triple {14241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:07:31,515 INFO L273 TraceCheckUtils]: 110: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:07:31,515 INFO L273 TraceCheckUtils]: 111: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,515 INFO L273 TraceCheckUtils]: 112: Hoare triple {14241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:07:31,515 INFO L273 TraceCheckUtils]: 113: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:07:31,515 INFO L273 TraceCheckUtils]: 114: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,515 INFO L273 TraceCheckUtils]: 115: Hoare triple {14241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:07:31,516 INFO L273 TraceCheckUtils]: 116: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:07:31,516 INFO L273 TraceCheckUtils]: 117: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,516 INFO L273 TraceCheckUtils]: 118: Hoare triple {14241#true} assume !(~i~0 < 100); {14241#true} is VALID [2018-11-14 17:07:31,516 INFO L273 TraceCheckUtils]: 119: Hoare triple {14241#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14241#true} is VALID [2018-11-14 17:07:31,516 INFO L273 TraceCheckUtils]: 120: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,516 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {14241#true} {14242#false} #75#return; {14242#false} is VALID [2018-11-14 17:07:31,516 INFO L273 TraceCheckUtils]: 122: Hoare triple {14242#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {14242#false} is VALID [2018-11-14 17:07:31,516 INFO L273 TraceCheckUtils]: 123: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,516 INFO L273 TraceCheckUtils]: 124: Hoare triple {14242#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:07:31,517 INFO L273 TraceCheckUtils]: 125: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:07:31,517 INFO L273 TraceCheckUtils]: 126: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,517 INFO L273 TraceCheckUtils]: 127: Hoare triple {14242#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:07:31,517 INFO L273 TraceCheckUtils]: 128: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:07:31,517 INFO L273 TraceCheckUtils]: 129: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,517 INFO L273 TraceCheckUtils]: 130: Hoare triple {14242#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:07:31,517 INFO L273 TraceCheckUtils]: 131: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:07:31,517 INFO L273 TraceCheckUtils]: 132: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,517 INFO L273 TraceCheckUtils]: 133: Hoare triple {14242#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:07:31,518 INFO L273 TraceCheckUtils]: 134: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:07:31,518 INFO L273 TraceCheckUtils]: 135: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,518 INFO L273 TraceCheckUtils]: 136: Hoare triple {14242#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:07:31,518 INFO L273 TraceCheckUtils]: 137: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:07:31,518 INFO L273 TraceCheckUtils]: 138: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,518 INFO L273 TraceCheckUtils]: 139: Hoare triple {14242#false} assume !(~i~2 < 99); {14242#false} is VALID [2018-11-14 17:07:31,518 INFO L273 TraceCheckUtils]: 140: Hoare triple {14242#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {14242#false} is VALID [2018-11-14 17:07:31,518 INFO L256 TraceCheckUtils]: 141: Hoare triple {14242#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {14241#true} is VALID [2018-11-14 17:07:31,518 INFO L273 TraceCheckUtils]: 142: Hoare triple {14241#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14241#true} is VALID [2018-11-14 17:07:31,519 INFO L273 TraceCheckUtils]: 143: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,519 INFO L273 TraceCheckUtils]: 144: Hoare triple {14241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:07:31,519 INFO L273 TraceCheckUtils]: 145: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:07:31,519 INFO L273 TraceCheckUtils]: 146: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,519 INFO L273 TraceCheckUtils]: 147: Hoare triple {14241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:07:31,519 INFO L273 TraceCheckUtils]: 148: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:07:31,519 INFO L273 TraceCheckUtils]: 149: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,519 INFO L273 TraceCheckUtils]: 150: Hoare triple {14241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:07:31,519 INFO L273 TraceCheckUtils]: 151: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:07:31,520 INFO L273 TraceCheckUtils]: 152: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,520 INFO L273 TraceCheckUtils]: 153: Hoare triple {14241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:07:31,520 INFO L273 TraceCheckUtils]: 154: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:07:31,520 INFO L273 TraceCheckUtils]: 155: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,520 INFO L273 TraceCheckUtils]: 156: Hoare triple {14241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:07:31,520 INFO L273 TraceCheckUtils]: 157: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:07:31,520 INFO L273 TraceCheckUtils]: 158: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,520 INFO L273 TraceCheckUtils]: 159: Hoare triple {14241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:07:31,520 INFO L273 TraceCheckUtils]: 160: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:07:31,520 INFO L273 TraceCheckUtils]: 161: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,521 INFO L273 TraceCheckUtils]: 162: Hoare triple {14241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:07:31,521 INFO L273 TraceCheckUtils]: 163: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:07:31,521 INFO L273 TraceCheckUtils]: 164: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,521 INFO L273 TraceCheckUtils]: 165: Hoare triple {14241#true} assume !(~i~0 < 100); {14241#true} is VALID [2018-11-14 17:07:31,521 INFO L273 TraceCheckUtils]: 166: Hoare triple {14241#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14241#true} is VALID [2018-11-14 17:07:31,521 INFO L273 TraceCheckUtils]: 167: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,521 INFO L268 TraceCheckUtils]: 168: Hoare quadruple {14241#true} {14242#false} #77#return; {14242#false} is VALID [2018-11-14 17:07:31,521 INFO L273 TraceCheckUtils]: 169: Hoare triple {14242#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {14242#false} is VALID [2018-11-14 17:07:31,521 INFO L273 TraceCheckUtils]: 170: Hoare triple {14242#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {14242#false} is VALID [2018-11-14 17:07:31,522 INFO L273 TraceCheckUtils]: 171: Hoare triple {14242#false} assume !false; {14242#false} is VALID [2018-11-14 17:07:31,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2018-11-14 17:07:31,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:31,535 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:07:31,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:07:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:31,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:31,943 INFO L256 TraceCheckUtils]: 0: Hoare triple {14241#true} call ULTIMATE.init(); {14241#true} is VALID [2018-11-14 17:07:31,943 INFO L273 TraceCheckUtils]: 1: Hoare triple {14241#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14241#true} is VALID [2018-11-14 17:07:31,944 INFO L273 TraceCheckUtils]: 2: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:07:31,944 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14241#true} {14241#true} #69#return; {14241#true} is VALID [2018-11-14 17:07:31,944 INFO L256 TraceCheckUtils]: 4: Hoare triple {14241#true} call #t~ret13 := main(); {14241#true} is VALID [2018-11-14 17:07:31,945 INFO L273 TraceCheckUtils]: 5: Hoare triple {14241#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {14281#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:31,945 INFO L273 TraceCheckUtils]: 6: Hoare triple {14281#(<= main_~i~1 0)} assume true; {14281#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:31,946 INFO L273 TraceCheckUtils]: 7: Hoare triple {14281#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14281#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:31,946 INFO L273 TraceCheckUtils]: 8: Hoare triple {14281#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14244#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:31,946 INFO L273 TraceCheckUtils]: 9: Hoare triple {14244#(<= main_~i~1 1)} assume true; {14244#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:31,947 INFO L273 TraceCheckUtils]: 10: Hoare triple {14244#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14244#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:31,947 INFO L273 TraceCheckUtils]: 11: Hoare triple {14244#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14245#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:31,948 INFO L273 TraceCheckUtils]: 12: Hoare triple {14245#(<= main_~i~1 2)} assume true; {14245#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:31,948 INFO L273 TraceCheckUtils]: 13: Hoare triple {14245#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14245#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:31,949 INFO L273 TraceCheckUtils]: 14: Hoare triple {14245#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14246#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:31,949 INFO L273 TraceCheckUtils]: 15: Hoare triple {14246#(<= main_~i~1 3)} assume true; {14246#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:31,950 INFO L273 TraceCheckUtils]: 16: Hoare triple {14246#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14246#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:31,950 INFO L273 TraceCheckUtils]: 17: Hoare triple {14246#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14247#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:31,951 INFO L273 TraceCheckUtils]: 18: Hoare triple {14247#(<= main_~i~1 4)} assume true; {14247#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:31,951 INFO L273 TraceCheckUtils]: 19: Hoare triple {14247#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14247#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:31,952 INFO L273 TraceCheckUtils]: 20: Hoare triple {14247#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14248#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:31,952 INFO L273 TraceCheckUtils]: 21: Hoare triple {14248#(<= main_~i~1 5)} assume true; {14248#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:31,953 INFO L273 TraceCheckUtils]: 22: Hoare triple {14248#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14248#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:31,954 INFO L273 TraceCheckUtils]: 23: Hoare triple {14248#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14249#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:31,954 INFO L273 TraceCheckUtils]: 24: Hoare triple {14249#(<= main_~i~1 6)} assume true; {14249#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:31,955 INFO L273 TraceCheckUtils]: 25: Hoare triple {14249#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14249#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:31,955 INFO L273 TraceCheckUtils]: 26: Hoare triple {14249#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14250#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:31,956 INFO L273 TraceCheckUtils]: 27: Hoare triple {14250#(<= main_~i~1 7)} assume true; {14250#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:31,956 INFO L273 TraceCheckUtils]: 28: Hoare triple {14250#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14250#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:31,957 INFO L273 TraceCheckUtils]: 29: Hoare triple {14250#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14251#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:31,957 INFO L273 TraceCheckUtils]: 30: Hoare triple {14251#(<= main_~i~1 8)} assume true; {14251#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:31,958 INFO L273 TraceCheckUtils]: 31: Hoare triple {14251#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14251#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:31,958 INFO L273 TraceCheckUtils]: 32: Hoare triple {14251#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14252#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:31,959 INFO L273 TraceCheckUtils]: 33: Hoare triple {14252#(<= main_~i~1 9)} assume true; {14252#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:31,959 INFO L273 TraceCheckUtils]: 34: Hoare triple {14252#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14252#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:31,960 INFO L273 TraceCheckUtils]: 35: Hoare triple {14252#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14253#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:31,961 INFO L273 TraceCheckUtils]: 36: Hoare triple {14253#(<= main_~i~1 10)} assume true; {14253#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:31,961 INFO L273 TraceCheckUtils]: 37: Hoare triple {14253#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14253#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:31,962 INFO L273 TraceCheckUtils]: 38: Hoare triple {14253#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14254#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:31,962 INFO L273 TraceCheckUtils]: 39: Hoare triple {14254#(<= main_~i~1 11)} assume true; {14254#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:31,963 INFO L273 TraceCheckUtils]: 40: Hoare triple {14254#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14254#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:31,963 INFO L273 TraceCheckUtils]: 41: Hoare triple {14254#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14255#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:31,964 INFO L273 TraceCheckUtils]: 42: Hoare triple {14255#(<= main_~i~1 12)} assume true; {14255#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:31,964 INFO L273 TraceCheckUtils]: 43: Hoare triple {14255#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14255#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:31,965 INFO L273 TraceCheckUtils]: 44: Hoare triple {14255#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14256#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:31,966 INFO L273 TraceCheckUtils]: 45: Hoare triple {14256#(<= main_~i~1 13)} assume true; {14256#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:31,966 INFO L273 TraceCheckUtils]: 46: Hoare triple {14256#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14256#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:31,967 INFO L273 TraceCheckUtils]: 47: Hoare triple {14256#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14257#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:31,967 INFO L273 TraceCheckUtils]: 48: Hoare triple {14257#(<= main_~i~1 14)} assume true; {14257#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:31,968 INFO L273 TraceCheckUtils]: 49: Hoare triple {14257#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14257#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:31,969 INFO L273 TraceCheckUtils]: 50: Hoare triple {14257#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14258#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:31,969 INFO L273 TraceCheckUtils]: 51: Hoare triple {14258#(<= main_~i~1 15)} assume true; {14258#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:31,970 INFO L273 TraceCheckUtils]: 52: Hoare triple {14258#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14258#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:31,970 INFO L273 TraceCheckUtils]: 53: Hoare triple {14258#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14259#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:31,971 INFO L273 TraceCheckUtils]: 54: Hoare triple {14259#(<= main_~i~1 16)} assume true; {14259#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:31,971 INFO L273 TraceCheckUtils]: 55: Hoare triple {14259#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14259#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:31,972 INFO L273 TraceCheckUtils]: 56: Hoare triple {14259#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14260#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:31,973 INFO L273 TraceCheckUtils]: 57: Hoare triple {14260#(<= main_~i~1 17)} assume true; {14260#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:31,973 INFO L273 TraceCheckUtils]: 58: Hoare triple {14260#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14260#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:31,974 INFO L273 TraceCheckUtils]: 59: Hoare triple {14260#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14261#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:31,974 INFO L273 TraceCheckUtils]: 60: Hoare triple {14261#(<= main_~i~1 18)} assume true; {14261#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:31,975 INFO L273 TraceCheckUtils]: 61: Hoare triple {14261#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14261#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:31,976 INFO L273 TraceCheckUtils]: 62: Hoare triple {14261#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14262#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:31,976 INFO L273 TraceCheckUtils]: 63: Hoare triple {14262#(<= main_~i~1 19)} assume true; {14262#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:31,977 INFO L273 TraceCheckUtils]: 64: Hoare triple {14262#(<= main_~i~1 19)} assume !(~i~1 < 100); {14242#false} is VALID [2018-11-14 17:07:31,977 INFO L256 TraceCheckUtils]: 65: Hoare triple {14242#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {14242#false} is VALID [2018-11-14 17:07:31,977 INFO L273 TraceCheckUtils]: 66: Hoare triple {14242#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14242#false} is VALID [2018-11-14 17:07:31,977 INFO L273 TraceCheckUtils]: 67: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,978 INFO L273 TraceCheckUtils]: 68: Hoare triple {14242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:07:31,978 INFO L273 TraceCheckUtils]: 69: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:07:31,978 INFO L273 TraceCheckUtils]: 70: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,978 INFO L273 TraceCheckUtils]: 71: Hoare triple {14242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:07:31,978 INFO L273 TraceCheckUtils]: 72: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:07:31,978 INFO L273 TraceCheckUtils]: 73: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,979 INFO L273 TraceCheckUtils]: 74: Hoare triple {14242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:07:31,979 INFO L273 TraceCheckUtils]: 75: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:07:31,979 INFO L273 TraceCheckUtils]: 76: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,979 INFO L273 TraceCheckUtils]: 77: Hoare triple {14242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:07:31,979 INFO L273 TraceCheckUtils]: 78: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:07:31,979 INFO L273 TraceCheckUtils]: 79: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,980 INFO L273 TraceCheckUtils]: 80: Hoare triple {14242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:07:31,980 INFO L273 TraceCheckUtils]: 81: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:07:31,980 INFO L273 TraceCheckUtils]: 82: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,980 INFO L273 TraceCheckUtils]: 83: Hoare triple {14242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:07:31,980 INFO L273 TraceCheckUtils]: 84: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:07:31,981 INFO L273 TraceCheckUtils]: 85: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,981 INFO L273 TraceCheckUtils]: 86: Hoare triple {14242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:07:31,981 INFO L273 TraceCheckUtils]: 87: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:07:31,981 INFO L273 TraceCheckUtils]: 88: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,981 INFO L273 TraceCheckUtils]: 89: Hoare triple {14242#false} assume !(~i~0 < 100); {14242#false} is VALID [2018-11-14 17:07:31,981 INFO L273 TraceCheckUtils]: 90: Hoare triple {14242#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14242#false} is VALID [2018-11-14 17:07:31,981 INFO L273 TraceCheckUtils]: 91: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,981 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {14242#false} {14242#false} #73#return; {14242#false} is VALID [2018-11-14 17:07:31,981 INFO L273 TraceCheckUtils]: 93: Hoare triple {14242#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {14242#false} is VALID [2018-11-14 17:07:31,982 INFO L256 TraceCheckUtils]: 94: Hoare triple {14242#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {14242#false} is VALID [2018-11-14 17:07:31,982 INFO L273 TraceCheckUtils]: 95: Hoare triple {14242#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14242#false} is VALID [2018-11-14 17:07:31,982 INFO L273 TraceCheckUtils]: 96: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,982 INFO L273 TraceCheckUtils]: 97: Hoare triple {14242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:07:31,982 INFO L273 TraceCheckUtils]: 98: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:07:31,982 INFO L273 TraceCheckUtils]: 99: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,982 INFO L273 TraceCheckUtils]: 100: Hoare triple {14242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:07:31,982 INFO L273 TraceCheckUtils]: 101: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:07:31,982 INFO L273 TraceCheckUtils]: 102: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,983 INFO L273 TraceCheckUtils]: 103: Hoare triple {14242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:07:31,983 INFO L273 TraceCheckUtils]: 104: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:07:31,983 INFO L273 TraceCheckUtils]: 105: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,983 INFO L273 TraceCheckUtils]: 106: Hoare triple {14242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:07:31,983 INFO L273 TraceCheckUtils]: 107: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:07:31,983 INFO L273 TraceCheckUtils]: 108: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,983 INFO L273 TraceCheckUtils]: 109: Hoare triple {14242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:07:31,983 INFO L273 TraceCheckUtils]: 110: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:07:31,983 INFO L273 TraceCheckUtils]: 111: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,983 INFO L273 TraceCheckUtils]: 112: Hoare triple {14242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:07:31,984 INFO L273 TraceCheckUtils]: 113: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:07:31,984 INFO L273 TraceCheckUtils]: 114: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,984 INFO L273 TraceCheckUtils]: 115: Hoare triple {14242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:07:31,984 INFO L273 TraceCheckUtils]: 116: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:07:31,984 INFO L273 TraceCheckUtils]: 117: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,984 INFO L273 TraceCheckUtils]: 118: Hoare triple {14242#false} assume !(~i~0 < 100); {14242#false} is VALID [2018-11-14 17:07:31,984 INFO L273 TraceCheckUtils]: 119: Hoare triple {14242#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14242#false} is VALID [2018-11-14 17:07:31,984 INFO L273 TraceCheckUtils]: 120: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,984 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {14242#false} {14242#false} #75#return; {14242#false} is VALID [2018-11-14 17:07:31,985 INFO L273 TraceCheckUtils]: 122: Hoare triple {14242#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {14242#false} is VALID [2018-11-14 17:07:31,985 INFO L273 TraceCheckUtils]: 123: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,985 INFO L273 TraceCheckUtils]: 124: Hoare triple {14242#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:07:31,985 INFO L273 TraceCheckUtils]: 125: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:07:31,985 INFO L273 TraceCheckUtils]: 126: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,985 INFO L273 TraceCheckUtils]: 127: Hoare triple {14242#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:07:31,985 INFO L273 TraceCheckUtils]: 128: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:07:31,985 INFO L273 TraceCheckUtils]: 129: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,985 INFO L273 TraceCheckUtils]: 130: Hoare triple {14242#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:07:31,985 INFO L273 TraceCheckUtils]: 131: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:07:31,986 INFO L273 TraceCheckUtils]: 132: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,986 INFO L273 TraceCheckUtils]: 133: Hoare triple {14242#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:07:31,986 INFO L273 TraceCheckUtils]: 134: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:07:31,986 INFO L273 TraceCheckUtils]: 135: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,986 INFO L273 TraceCheckUtils]: 136: Hoare triple {14242#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:07:31,986 INFO L273 TraceCheckUtils]: 137: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:07:31,986 INFO L273 TraceCheckUtils]: 138: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,986 INFO L273 TraceCheckUtils]: 139: Hoare triple {14242#false} assume !(~i~2 < 99); {14242#false} is VALID [2018-11-14 17:07:31,986 INFO L273 TraceCheckUtils]: 140: Hoare triple {14242#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {14242#false} is VALID [2018-11-14 17:07:31,987 INFO L256 TraceCheckUtils]: 141: Hoare triple {14242#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {14242#false} is VALID [2018-11-14 17:07:31,987 INFO L273 TraceCheckUtils]: 142: Hoare triple {14242#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14242#false} is VALID [2018-11-14 17:07:31,987 INFO L273 TraceCheckUtils]: 143: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,987 INFO L273 TraceCheckUtils]: 144: Hoare triple {14242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:07:31,987 INFO L273 TraceCheckUtils]: 145: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:07:31,987 INFO L273 TraceCheckUtils]: 146: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,987 INFO L273 TraceCheckUtils]: 147: Hoare triple {14242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:07:31,987 INFO L273 TraceCheckUtils]: 148: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:07:31,987 INFO L273 TraceCheckUtils]: 149: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,988 INFO L273 TraceCheckUtils]: 150: Hoare triple {14242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:07:31,988 INFO L273 TraceCheckUtils]: 151: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:07:31,988 INFO L273 TraceCheckUtils]: 152: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,988 INFO L273 TraceCheckUtils]: 153: Hoare triple {14242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:07:31,988 INFO L273 TraceCheckUtils]: 154: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:07:31,988 INFO L273 TraceCheckUtils]: 155: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,988 INFO L273 TraceCheckUtils]: 156: Hoare triple {14242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:07:31,988 INFO L273 TraceCheckUtils]: 157: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:07:31,988 INFO L273 TraceCheckUtils]: 158: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,988 INFO L273 TraceCheckUtils]: 159: Hoare triple {14242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:07:31,989 INFO L273 TraceCheckUtils]: 160: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:07:31,989 INFO L273 TraceCheckUtils]: 161: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,989 INFO L273 TraceCheckUtils]: 162: Hoare triple {14242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:07:31,989 INFO L273 TraceCheckUtils]: 163: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:07:31,989 INFO L273 TraceCheckUtils]: 164: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,989 INFO L273 TraceCheckUtils]: 165: Hoare triple {14242#false} assume !(~i~0 < 100); {14242#false} is VALID [2018-11-14 17:07:31,989 INFO L273 TraceCheckUtils]: 166: Hoare triple {14242#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14242#false} is VALID [2018-11-14 17:07:31,989 INFO L273 TraceCheckUtils]: 167: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:07:31,989 INFO L268 TraceCheckUtils]: 168: Hoare quadruple {14242#false} {14242#false} #77#return; {14242#false} is VALID [2018-11-14 17:07:31,990 INFO L273 TraceCheckUtils]: 169: Hoare triple {14242#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {14242#false} is VALID [2018-11-14 17:07:31,990 INFO L273 TraceCheckUtils]: 170: Hoare triple {14242#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {14242#false} is VALID [2018-11-14 17:07:31,990 INFO L273 TraceCheckUtils]: 171: Hoare triple {14242#false} assume !false; {14242#false} is VALID [2018-11-14 17:07:32,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2018-11-14 17:07:32,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:32,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-14 17:07:32,024 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 172 [2018-11-14 17:07:32,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:32,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-14 17:07:32,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:32,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-14 17:07:32,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-14 17:07:32,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-14 17:07:32,115 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 23 states. [2018-11-14 17:07:33,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:33,117 INFO L93 Difference]: Finished difference Result 177 states and 185 transitions. [2018-11-14 17:07:33,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 17:07:33,117 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 172 [2018-11-14 17:07:33,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:33,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 17:07:33,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 117 transitions. [2018-11-14 17:07:33,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 17:07:33,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 117 transitions. [2018-11-14 17:07:33,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 117 transitions. [2018-11-14 17:07:33,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:33,235 INFO L225 Difference]: With dead ends: 177 [2018-11-14 17:07:33,235 INFO L226 Difference]: Without dead ends: 123 [2018-11-14 17:07:33,235 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-14 17:07:33,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-14 17:07:33,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-11-14 17:07:33,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:33,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 122 states. [2018-11-14 17:07:33,284 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 122 states. [2018-11-14 17:07:33,285 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 122 states. [2018-11-14 17:07:33,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:33,288 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-11-14 17:07:33,288 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-14 17:07:33,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:33,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:33,289 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 123 states. [2018-11-14 17:07:33,289 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 123 states. [2018-11-14 17:07:33,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:33,291 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-11-14 17:07:33,291 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-14 17:07:33,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:33,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:33,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:33,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:33,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-14 17:07:33,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2018-11-14 17:07:33,294 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 172 [2018-11-14 17:07:33,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:33,295 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2018-11-14 17:07:33,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-14 17:07:33,295 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2018-11-14 17:07:33,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-14 17:07:33,296 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:33,296 INFO L375 BasicCegarLoop]: trace histogram [24, 21, 21, 21, 20, 20, 6, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:07:33,296 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:33,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:33,297 INFO L82 PathProgramCache]: Analyzing trace with hash 862428551, now seen corresponding path program 20 times [2018-11-14 17:07:33,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:33,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:33,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:33,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:07:33,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:33,727 INFO L256 TraceCheckUtils]: 0: Hoare triple {15428#true} call ULTIMATE.init(); {15428#true} is VALID [2018-11-14 17:07:33,727 INFO L273 TraceCheckUtils]: 1: Hoare triple {15428#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15428#true} is VALID [2018-11-14 17:07:33,727 INFO L273 TraceCheckUtils]: 2: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:33,727 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15428#true} {15428#true} #69#return; {15428#true} is VALID [2018-11-14 17:07:33,727 INFO L256 TraceCheckUtils]: 4: Hoare triple {15428#true} call #t~ret13 := main(); {15428#true} is VALID [2018-11-14 17:07:33,728 INFO L273 TraceCheckUtils]: 5: Hoare triple {15428#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {15430#(= main_~i~1 0)} is VALID [2018-11-14 17:07:33,728 INFO L273 TraceCheckUtils]: 6: Hoare triple {15430#(= main_~i~1 0)} assume true; {15430#(= main_~i~1 0)} is VALID [2018-11-14 17:07:33,729 INFO L273 TraceCheckUtils]: 7: Hoare triple {15430#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15430#(= main_~i~1 0)} is VALID [2018-11-14 17:07:33,729 INFO L273 TraceCheckUtils]: 8: Hoare triple {15430#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15431#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:33,730 INFO L273 TraceCheckUtils]: 9: Hoare triple {15431#(<= main_~i~1 1)} assume true; {15431#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:33,730 INFO L273 TraceCheckUtils]: 10: Hoare triple {15431#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15431#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:33,731 INFO L273 TraceCheckUtils]: 11: Hoare triple {15431#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15432#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:33,731 INFO L273 TraceCheckUtils]: 12: Hoare triple {15432#(<= main_~i~1 2)} assume true; {15432#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:33,731 INFO L273 TraceCheckUtils]: 13: Hoare triple {15432#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15432#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:33,732 INFO L273 TraceCheckUtils]: 14: Hoare triple {15432#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15433#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:33,732 INFO L273 TraceCheckUtils]: 15: Hoare triple {15433#(<= main_~i~1 3)} assume true; {15433#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:33,733 INFO L273 TraceCheckUtils]: 16: Hoare triple {15433#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15433#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:33,733 INFO L273 TraceCheckUtils]: 17: Hoare triple {15433#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15434#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:33,734 INFO L273 TraceCheckUtils]: 18: Hoare triple {15434#(<= main_~i~1 4)} assume true; {15434#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:33,734 INFO L273 TraceCheckUtils]: 19: Hoare triple {15434#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15434#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:33,735 INFO L273 TraceCheckUtils]: 20: Hoare triple {15434#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15435#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:33,735 INFO L273 TraceCheckUtils]: 21: Hoare triple {15435#(<= main_~i~1 5)} assume true; {15435#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:33,736 INFO L273 TraceCheckUtils]: 22: Hoare triple {15435#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15435#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:33,737 INFO L273 TraceCheckUtils]: 23: Hoare triple {15435#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15436#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:33,737 INFO L273 TraceCheckUtils]: 24: Hoare triple {15436#(<= main_~i~1 6)} assume true; {15436#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:33,738 INFO L273 TraceCheckUtils]: 25: Hoare triple {15436#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15436#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:33,738 INFO L273 TraceCheckUtils]: 26: Hoare triple {15436#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15437#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:33,739 INFO L273 TraceCheckUtils]: 27: Hoare triple {15437#(<= main_~i~1 7)} assume true; {15437#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:33,739 INFO L273 TraceCheckUtils]: 28: Hoare triple {15437#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15437#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:33,740 INFO L273 TraceCheckUtils]: 29: Hoare triple {15437#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15438#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:33,740 INFO L273 TraceCheckUtils]: 30: Hoare triple {15438#(<= main_~i~1 8)} assume true; {15438#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:33,741 INFO L273 TraceCheckUtils]: 31: Hoare triple {15438#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15438#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:33,742 INFO L273 TraceCheckUtils]: 32: Hoare triple {15438#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15439#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:33,742 INFO L273 TraceCheckUtils]: 33: Hoare triple {15439#(<= main_~i~1 9)} assume true; {15439#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:33,742 INFO L273 TraceCheckUtils]: 34: Hoare triple {15439#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15439#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:33,743 INFO L273 TraceCheckUtils]: 35: Hoare triple {15439#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15440#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:33,744 INFO L273 TraceCheckUtils]: 36: Hoare triple {15440#(<= main_~i~1 10)} assume true; {15440#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:33,744 INFO L273 TraceCheckUtils]: 37: Hoare triple {15440#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15440#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:33,745 INFO L273 TraceCheckUtils]: 38: Hoare triple {15440#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15441#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:33,745 INFO L273 TraceCheckUtils]: 39: Hoare triple {15441#(<= main_~i~1 11)} assume true; {15441#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:33,746 INFO L273 TraceCheckUtils]: 40: Hoare triple {15441#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15441#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:33,746 INFO L273 TraceCheckUtils]: 41: Hoare triple {15441#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15442#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:33,747 INFO L273 TraceCheckUtils]: 42: Hoare triple {15442#(<= main_~i~1 12)} assume true; {15442#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:33,747 INFO L273 TraceCheckUtils]: 43: Hoare triple {15442#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15442#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:33,748 INFO L273 TraceCheckUtils]: 44: Hoare triple {15442#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15443#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:33,749 INFO L273 TraceCheckUtils]: 45: Hoare triple {15443#(<= main_~i~1 13)} assume true; {15443#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:33,749 INFO L273 TraceCheckUtils]: 46: Hoare triple {15443#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15443#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:33,750 INFO L273 TraceCheckUtils]: 47: Hoare triple {15443#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15444#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:33,750 INFO L273 TraceCheckUtils]: 48: Hoare triple {15444#(<= main_~i~1 14)} assume true; {15444#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:33,751 INFO L273 TraceCheckUtils]: 49: Hoare triple {15444#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15444#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:33,751 INFO L273 TraceCheckUtils]: 50: Hoare triple {15444#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15445#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:33,752 INFO L273 TraceCheckUtils]: 51: Hoare triple {15445#(<= main_~i~1 15)} assume true; {15445#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:33,752 INFO L273 TraceCheckUtils]: 52: Hoare triple {15445#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15445#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:33,753 INFO L273 TraceCheckUtils]: 53: Hoare triple {15445#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15446#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:33,753 INFO L273 TraceCheckUtils]: 54: Hoare triple {15446#(<= main_~i~1 16)} assume true; {15446#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:33,754 INFO L273 TraceCheckUtils]: 55: Hoare triple {15446#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15446#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:33,755 INFO L273 TraceCheckUtils]: 56: Hoare triple {15446#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15447#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:33,755 INFO L273 TraceCheckUtils]: 57: Hoare triple {15447#(<= main_~i~1 17)} assume true; {15447#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:33,756 INFO L273 TraceCheckUtils]: 58: Hoare triple {15447#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15447#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:33,756 INFO L273 TraceCheckUtils]: 59: Hoare triple {15447#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15448#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:33,757 INFO L273 TraceCheckUtils]: 60: Hoare triple {15448#(<= main_~i~1 18)} assume true; {15448#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:33,757 INFO L273 TraceCheckUtils]: 61: Hoare triple {15448#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15448#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:33,758 INFO L273 TraceCheckUtils]: 62: Hoare triple {15448#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15449#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:33,758 INFO L273 TraceCheckUtils]: 63: Hoare triple {15449#(<= main_~i~1 19)} assume true; {15449#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:33,759 INFO L273 TraceCheckUtils]: 64: Hoare triple {15449#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15449#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:33,760 INFO L273 TraceCheckUtils]: 65: Hoare triple {15449#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15450#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:33,760 INFO L273 TraceCheckUtils]: 66: Hoare triple {15450#(<= main_~i~1 20)} assume true; {15450#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:33,761 INFO L273 TraceCheckUtils]: 67: Hoare triple {15450#(<= main_~i~1 20)} assume !(~i~1 < 100); {15429#false} is VALID [2018-11-14 17:07:33,761 INFO L256 TraceCheckUtils]: 68: Hoare triple {15429#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {15428#true} is VALID [2018-11-14 17:07:33,761 INFO L273 TraceCheckUtils]: 69: Hoare triple {15428#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15428#true} is VALID [2018-11-14 17:07:33,761 INFO L273 TraceCheckUtils]: 70: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:33,762 INFO L273 TraceCheckUtils]: 71: Hoare triple {15428#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:07:33,762 INFO L273 TraceCheckUtils]: 72: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:07:33,762 INFO L273 TraceCheckUtils]: 73: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:33,762 INFO L273 TraceCheckUtils]: 74: Hoare triple {15428#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:07:33,762 INFO L273 TraceCheckUtils]: 75: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:07:33,763 INFO L273 TraceCheckUtils]: 76: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:33,763 INFO L273 TraceCheckUtils]: 77: Hoare triple {15428#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:07:33,763 INFO L273 TraceCheckUtils]: 78: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:07:33,763 INFO L273 TraceCheckUtils]: 79: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:33,763 INFO L273 TraceCheckUtils]: 80: Hoare triple {15428#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:07:33,763 INFO L273 TraceCheckUtils]: 81: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:07:33,764 INFO L273 TraceCheckUtils]: 82: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:33,764 INFO L273 TraceCheckUtils]: 83: Hoare triple {15428#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:07:33,764 INFO L273 TraceCheckUtils]: 84: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:07:33,764 INFO L273 TraceCheckUtils]: 85: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:33,764 INFO L273 TraceCheckUtils]: 86: Hoare triple {15428#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:07:33,764 INFO L273 TraceCheckUtils]: 87: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:07:33,765 INFO L273 TraceCheckUtils]: 88: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:33,765 INFO L273 TraceCheckUtils]: 89: Hoare triple {15428#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:07:33,765 INFO L273 TraceCheckUtils]: 90: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:07:33,765 INFO L273 TraceCheckUtils]: 91: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:33,765 INFO L273 TraceCheckUtils]: 92: Hoare triple {15428#true} assume !(~i~0 < 100); {15428#true} is VALID [2018-11-14 17:07:33,766 INFO L273 TraceCheckUtils]: 93: Hoare triple {15428#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15428#true} is VALID [2018-11-14 17:07:33,766 INFO L273 TraceCheckUtils]: 94: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:33,766 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {15428#true} {15429#false} #73#return; {15429#false} is VALID [2018-11-14 17:07:33,766 INFO L273 TraceCheckUtils]: 96: Hoare triple {15429#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {15429#false} is VALID [2018-11-14 17:07:33,766 INFO L256 TraceCheckUtils]: 97: Hoare triple {15429#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {15428#true} is VALID [2018-11-14 17:07:33,766 INFO L273 TraceCheckUtils]: 98: Hoare triple {15428#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15428#true} is VALID [2018-11-14 17:07:33,766 INFO L273 TraceCheckUtils]: 99: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:33,766 INFO L273 TraceCheckUtils]: 100: Hoare triple {15428#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:07:33,767 INFO L273 TraceCheckUtils]: 101: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:07:33,767 INFO L273 TraceCheckUtils]: 102: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:33,767 INFO L273 TraceCheckUtils]: 103: Hoare triple {15428#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:07:33,767 INFO L273 TraceCheckUtils]: 104: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:07:33,767 INFO L273 TraceCheckUtils]: 105: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:33,767 INFO L273 TraceCheckUtils]: 106: Hoare triple {15428#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:07:33,767 INFO L273 TraceCheckUtils]: 107: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:07:33,767 INFO L273 TraceCheckUtils]: 108: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:33,767 INFO L273 TraceCheckUtils]: 109: Hoare triple {15428#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:07:33,768 INFO L273 TraceCheckUtils]: 110: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:07:33,768 INFO L273 TraceCheckUtils]: 111: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:33,768 INFO L273 TraceCheckUtils]: 112: Hoare triple {15428#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:07:33,768 INFO L273 TraceCheckUtils]: 113: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:07:33,768 INFO L273 TraceCheckUtils]: 114: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:33,768 INFO L273 TraceCheckUtils]: 115: Hoare triple {15428#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:07:33,768 INFO L273 TraceCheckUtils]: 116: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:07:33,768 INFO L273 TraceCheckUtils]: 117: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:33,768 INFO L273 TraceCheckUtils]: 118: Hoare triple {15428#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:07:33,769 INFO L273 TraceCheckUtils]: 119: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:07:33,769 INFO L273 TraceCheckUtils]: 120: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:33,769 INFO L273 TraceCheckUtils]: 121: Hoare triple {15428#true} assume !(~i~0 < 100); {15428#true} is VALID [2018-11-14 17:07:33,769 INFO L273 TraceCheckUtils]: 122: Hoare triple {15428#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15428#true} is VALID [2018-11-14 17:07:33,769 INFO L273 TraceCheckUtils]: 123: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:33,769 INFO L268 TraceCheckUtils]: 124: Hoare quadruple {15428#true} {15429#false} #75#return; {15429#false} is VALID [2018-11-14 17:07:33,769 INFO L273 TraceCheckUtils]: 125: Hoare triple {15429#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {15429#false} is VALID [2018-11-14 17:07:33,769 INFO L273 TraceCheckUtils]: 126: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:33,769 INFO L273 TraceCheckUtils]: 127: Hoare triple {15429#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:07:33,770 INFO L273 TraceCheckUtils]: 128: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:07:33,770 INFO L273 TraceCheckUtils]: 129: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:33,770 INFO L273 TraceCheckUtils]: 130: Hoare triple {15429#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:07:33,770 INFO L273 TraceCheckUtils]: 131: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:07:33,770 INFO L273 TraceCheckUtils]: 132: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:33,770 INFO L273 TraceCheckUtils]: 133: Hoare triple {15429#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:07:33,770 INFO L273 TraceCheckUtils]: 134: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:07:33,770 INFO L273 TraceCheckUtils]: 135: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:33,770 INFO L273 TraceCheckUtils]: 136: Hoare triple {15429#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:07:33,770 INFO L273 TraceCheckUtils]: 137: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:07:33,771 INFO L273 TraceCheckUtils]: 138: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:33,771 INFO L273 TraceCheckUtils]: 139: Hoare triple {15429#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:07:33,771 INFO L273 TraceCheckUtils]: 140: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:07:33,771 INFO L273 TraceCheckUtils]: 141: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:33,771 INFO L273 TraceCheckUtils]: 142: Hoare triple {15429#false} assume !(~i~2 < 99); {15429#false} is VALID [2018-11-14 17:07:33,771 INFO L273 TraceCheckUtils]: 143: Hoare triple {15429#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {15429#false} is VALID [2018-11-14 17:07:33,771 INFO L256 TraceCheckUtils]: 144: Hoare triple {15429#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {15428#true} is VALID [2018-11-14 17:07:33,771 INFO L273 TraceCheckUtils]: 145: Hoare triple {15428#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15428#true} is VALID [2018-11-14 17:07:33,771 INFO L273 TraceCheckUtils]: 146: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:33,772 INFO L273 TraceCheckUtils]: 147: Hoare triple {15428#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:07:33,772 INFO L273 TraceCheckUtils]: 148: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:07:33,772 INFO L273 TraceCheckUtils]: 149: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:33,772 INFO L273 TraceCheckUtils]: 150: Hoare triple {15428#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:07:33,772 INFO L273 TraceCheckUtils]: 151: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:07:33,772 INFO L273 TraceCheckUtils]: 152: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:33,772 INFO L273 TraceCheckUtils]: 153: Hoare triple {15428#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:07:33,772 INFO L273 TraceCheckUtils]: 154: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:07:33,772 INFO L273 TraceCheckUtils]: 155: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:33,773 INFO L273 TraceCheckUtils]: 156: Hoare triple {15428#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:07:33,773 INFO L273 TraceCheckUtils]: 157: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:07:33,773 INFO L273 TraceCheckUtils]: 158: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:33,773 INFO L273 TraceCheckUtils]: 159: Hoare triple {15428#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:07:33,773 INFO L273 TraceCheckUtils]: 160: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:07:33,773 INFO L273 TraceCheckUtils]: 161: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:33,773 INFO L273 TraceCheckUtils]: 162: Hoare triple {15428#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:07:33,773 INFO L273 TraceCheckUtils]: 163: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:07:33,773 INFO L273 TraceCheckUtils]: 164: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:33,773 INFO L273 TraceCheckUtils]: 165: Hoare triple {15428#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:07:33,774 INFO L273 TraceCheckUtils]: 166: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:07:33,774 INFO L273 TraceCheckUtils]: 167: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:33,774 INFO L273 TraceCheckUtils]: 168: Hoare triple {15428#true} assume !(~i~0 < 100); {15428#true} is VALID [2018-11-14 17:07:33,774 INFO L273 TraceCheckUtils]: 169: Hoare triple {15428#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15428#true} is VALID [2018-11-14 17:07:33,774 INFO L273 TraceCheckUtils]: 170: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:33,774 INFO L268 TraceCheckUtils]: 171: Hoare quadruple {15428#true} {15429#false} #77#return; {15429#false} is VALID [2018-11-14 17:07:33,774 INFO L273 TraceCheckUtils]: 172: Hoare triple {15429#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {15429#false} is VALID [2018-11-14 17:07:33,774 INFO L273 TraceCheckUtils]: 173: Hoare triple {15429#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {15429#false} is VALID [2018-11-14 17:07:33,774 INFO L273 TraceCheckUtils]: 174: Hoare triple {15429#false} assume !false; {15429#false} is VALID [2018-11-14 17:07:33,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2018-11-14 17:07:33,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:33,788 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:07:33,797 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:07:33,854 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:07:33,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:33,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:34,179 INFO L256 TraceCheckUtils]: 0: Hoare triple {15428#true} call ULTIMATE.init(); {15428#true} is VALID [2018-11-14 17:07:34,179 INFO L273 TraceCheckUtils]: 1: Hoare triple {15428#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15428#true} is VALID [2018-11-14 17:07:34,179 INFO L273 TraceCheckUtils]: 2: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:07:34,179 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15428#true} {15428#true} #69#return; {15428#true} is VALID [2018-11-14 17:07:34,180 INFO L256 TraceCheckUtils]: 4: Hoare triple {15428#true} call #t~ret13 := main(); {15428#true} is VALID [2018-11-14 17:07:34,180 INFO L273 TraceCheckUtils]: 5: Hoare triple {15428#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {15469#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:34,181 INFO L273 TraceCheckUtils]: 6: Hoare triple {15469#(<= main_~i~1 0)} assume true; {15469#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:34,181 INFO L273 TraceCheckUtils]: 7: Hoare triple {15469#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15469#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:34,182 INFO L273 TraceCheckUtils]: 8: Hoare triple {15469#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15431#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:34,183 INFO L273 TraceCheckUtils]: 9: Hoare triple {15431#(<= main_~i~1 1)} assume true; {15431#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:34,183 INFO L273 TraceCheckUtils]: 10: Hoare triple {15431#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15431#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:34,184 INFO L273 TraceCheckUtils]: 11: Hoare triple {15431#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15432#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:34,184 INFO L273 TraceCheckUtils]: 12: Hoare triple {15432#(<= main_~i~1 2)} assume true; {15432#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:34,185 INFO L273 TraceCheckUtils]: 13: Hoare triple {15432#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15432#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:34,186 INFO L273 TraceCheckUtils]: 14: Hoare triple {15432#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15433#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:34,186 INFO L273 TraceCheckUtils]: 15: Hoare triple {15433#(<= main_~i~1 3)} assume true; {15433#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:34,187 INFO L273 TraceCheckUtils]: 16: Hoare triple {15433#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15433#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:34,187 INFO L273 TraceCheckUtils]: 17: Hoare triple {15433#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15434#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:34,188 INFO L273 TraceCheckUtils]: 18: Hoare triple {15434#(<= main_~i~1 4)} assume true; {15434#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:34,188 INFO L273 TraceCheckUtils]: 19: Hoare triple {15434#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15434#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:34,189 INFO L273 TraceCheckUtils]: 20: Hoare triple {15434#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15435#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:34,190 INFO L273 TraceCheckUtils]: 21: Hoare triple {15435#(<= main_~i~1 5)} assume true; {15435#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:34,190 INFO L273 TraceCheckUtils]: 22: Hoare triple {15435#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15435#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:34,191 INFO L273 TraceCheckUtils]: 23: Hoare triple {15435#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15436#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:34,191 INFO L273 TraceCheckUtils]: 24: Hoare triple {15436#(<= main_~i~1 6)} assume true; {15436#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:34,192 INFO L273 TraceCheckUtils]: 25: Hoare triple {15436#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15436#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:34,193 INFO L273 TraceCheckUtils]: 26: Hoare triple {15436#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15437#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:34,193 INFO L273 TraceCheckUtils]: 27: Hoare triple {15437#(<= main_~i~1 7)} assume true; {15437#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:34,194 INFO L273 TraceCheckUtils]: 28: Hoare triple {15437#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15437#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:34,194 INFO L273 TraceCheckUtils]: 29: Hoare triple {15437#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15438#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:34,195 INFO L273 TraceCheckUtils]: 30: Hoare triple {15438#(<= main_~i~1 8)} assume true; {15438#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:34,195 INFO L273 TraceCheckUtils]: 31: Hoare triple {15438#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15438#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:34,196 INFO L273 TraceCheckUtils]: 32: Hoare triple {15438#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15439#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:34,197 INFO L273 TraceCheckUtils]: 33: Hoare triple {15439#(<= main_~i~1 9)} assume true; {15439#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:34,197 INFO L273 TraceCheckUtils]: 34: Hoare triple {15439#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15439#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:34,198 INFO L273 TraceCheckUtils]: 35: Hoare triple {15439#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15440#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:34,198 INFO L273 TraceCheckUtils]: 36: Hoare triple {15440#(<= main_~i~1 10)} assume true; {15440#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:34,199 INFO L273 TraceCheckUtils]: 37: Hoare triple {15440#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15440#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:34,199 INFO L273 TraceCheckUtils]: 38: Hoare triple {15440#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15441#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:34,200 INFO L273 TraceCheckUtils]: 39: Hoare triple {15441#(<= main_~i~1 11)} assume true; {15441#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:34,201 INFO L273 TraceCheckUtils]: 40: Hoare triple {15441#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15441#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:34,201 INFO L273 TraceCheckUtils]: 41: Hoare triple {15441#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15442#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:34,202 INFO L273 TraceCheckUtils]: 42: Hoare triple {15442#(<= main_~i~1 12)} assume true; {15442#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:34,202 INFO L273 TraceCheckUtils]: 43: Hoare triple {15442#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15442#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:34,203 INFO L273 TraceCheckUtils]: 44: Hoare triple {15442#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15443#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:34,203 INFO L273 TraceCheckUtils]: 45: Hoare triple {15443#(<= main_~i~1 13)} assume true; {15443#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:34,204 INFO L273 TraceCheckUtils]: 46: Hoare triple {15443#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15443#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:34,205 INFO L273 TraceCheckUtils]: 47: Hoare triple {15443#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15444#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:34,205 INFO L273 TraceCheckUtils]: 48: Hoare triple {15444#(<= main_~i~1 14)} assume true; {15444#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:34,206 INFO L273 TraceCheckUtils]: 49: Hoare triple {15444#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15444#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:34,206 INFO L273 TraceCheckUtils]: 50: Hoare triple {15444#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15445#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:34,207 INFO L273 TraceCheckUtils]: 51: Hoare triple {15445#(<= main_~i~1 15)} assume true; {15445#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:34,207 INFO L273 TraceCheckUtils]: 52: Hoare triple {15445#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15445#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:34,208 INFO L273 TraceCheckUtils]: 53: Hoare triple {15445#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15446#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:34,209 INFO L273 TraceCheckUtils]: 54: Hoare triple {15446#(<= main_~i~1 16)} assume true; {15446#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:34,209 INFO L273 TraceCheckUtils]: 55: Hoare triple {15446#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15446#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:34,210 INFO L273 TraceCheckUtils]: 56: Hoare triple {15446#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15447#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:34,210 INFO L273 TraceCheckUtils]: 57: Hoare triple {15447#(<= main_~i~1 17)} assume true; {15447#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:34,211 INFO L273 TraceCheckUtils]: 58: Hoare triple {15447#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15447#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:34,212 INFO L273 TraceCheckUtils]: 59: Hoare triple {15447#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15448#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:34,212 INFO L273 TraceCheckUtils]: 60: Hoare triple {15448#(<= main_~i~1 18)} assume true; {15448#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:34,213 INFO L273 TraceCheckUtils]: 61: Hoare triple {15448#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15448#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:34,234 INFO L273 TraceCheckUtils]: 62: Hoare triple {15448#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15449#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:34,248 INFO L273 TraceCheckUtils]: 63: Hoare triple {15449#(<= main_~i~1 19)} assume true; {15449#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:34,256 INFO L273 TraceCheckUtils]: 64: Hoare triple {15449#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15449#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:34,257 INFO L273 TraceCheckUtils]: 65: Hoare triple {15449#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15450#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:34,257 INFO L273 TraceCheckUtils]: 66: Hoare triple {15450#(<= main_~i~1 20)} assume true; {15450#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:34,258 INFO L273 TraceCheckUtils]: 67: Hoare triple {15450#(<= main_~i~1 20)} assume !(~i~1 < 100); {15429#false} is VALID [2018-11-14 17:07:34,258 INFO L256 TraceCheckUtils]: 68: Hoare triple {15429#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {15429#false} is VALID [2018-11-14 17:07:34,258 INFO L273 TraceCheckUtils]: 69: Hoare triple {15429#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15429#false} is VALID [2018-11-14 17:07:34,258 INFO L273 TraceCheckUtils]: 70: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,258 INFO L273 TraceCheckUtils]: 71: Hoare triple {15429#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:07:34,258 INFO L273 TraceCheckUtils]: 72: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:07:34,258 INFO L273 TraceCheckUtils]: 73: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,259 INFO L273 TraceCheckUtils]: 74: Hoare triple {15429#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:07:34,259 INFO L273 TraceCheckUtils]: 75: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:07:34,259 INFO L273 TraceCheckUtils]: 76: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,259 INFO L273 TraceCheckUtils]: 77: Hoare triple {15429#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:07:34,259 INFO L273 TraceCheckUtils]: 78: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:07:34,259 INFO L273 TraceCheckUtils]: 79: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,259 INFO L273 TraceCheckUtils]: 80: Hoare triple {15429#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:07:34,259 INFO L273 TraceCheckUtils]: 81: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:07:34,259 INFO L273 TraceCheckUtils]: 82: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,259 INFO L273 TraceCheckUtils]: 83: Hoare triple {15429#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:07:34,260 INFO L273 TraceCheckUtils]: 84: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:07:34,260 INFO L273 TraceCheckUtils]: 85: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,260 INFO L273 TraceCheckUtils]: 86: Hoare triple {15429#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:07:34,260 INFO L273 TraceCheckUtils]: 87: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:07:34,260 INFO L273 TraceCheckUtils]: 88: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,260 INFO L273 TraceCheckUtils]: 89: Hoare triple {15429#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:07:34,260 INFO L273 TraceCheckUtils]: 90: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:07:34,260 INFO L273 TraceCheckUtils]: 91: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,260 INFO L273 TraceCheckUtils]: 92: Hoare triple {15429#false} assume !(~i~0 < 100); {15429#false} is VALID [2018-11-14 17:07:34,261 INFO L273 TraceCheckUtils]: 93: Hoare triple {15429#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15429#false} is VALID [2018-11-14 17:07:34,261 INFO L273 TraceCheckUtils]: 94: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,261 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {15429#false} {15429#false} #73#return; {15429#false} is VALID [2018-11-14 17:07:34,261 INFO L273 TraceCheckUtils]: 96: Hoare triple {15429#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {15429#false} is VALID [2018-11-14 17:07:34,261 INFO L256 TraceCheckUtils]: 97: Hoare triple {15429#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {15429#false} is VALID [2018-11-14 17:07:34,261 INFO L273 TraceCheckUtils]: 98: Hoare triple {15429#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15429#false} is VALID [2018-11-14 17:07:34,261 INFO L273 TraceCheckUtils]: 99: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,261 INFO L273 TraceCheckUtils]: 100: Hoare triple {15429#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:07:34,261 INFO L273 TraceCheckUtils]: 101: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:07:34,261 INFO L273 TraceCheckUtils]: 102: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,262 INFO L273 TraceCheckUtils]: 103: Hoare triple {15429#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:07:34,262 INFO L273 TraceCheckUtils]: 104: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:07:34,262 INFO L273 TraceCheckUtils]: 105: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,262 INFO L273 TraceCheckUtils]: 106: Hoare triple {15429#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:07:34,262 INFO L273 TraceCheckUtils]: 107: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:07:34,262 INFO L273 TraceCheckUtils]: 108: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,262 INFO L273 TraceCheckUtils]: 109: Hoare triple {15429#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:07:34,262 INFO L273 TraceCheckUtils]: 110: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:07:34,262 INFO L273 TraceCheckUtils]: 111: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,263 INFO L273 TraceCheckUtils]: 112: Hoare triple {15429#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:07:34,263 INFO L273 TraceCheckUtils]: 113: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:07:34,263 INFO L273 TraceCheckUtils]: 114: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,263 INFO L273 TraceCheckUtils]: 115: Hoare triple {15429#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:07:34,263 INFO L273 TraceCheckUtils]: 116: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:07:34,263 INFO L273 TraceCheckUtils]: 117: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,263 INFO L273 TraceCheckUtils]: 118: Hoare triple {15429#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:07:34,263 INFO L273 TraceCheckUtils]: 119: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:07:34,263 INFO L273 TraceCheckUtils]: 120: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,264 INFO L273 TraceCheckUtils]: 121: Hoare triple {15429#false} assume !(~i~0 < 100); {15429#false} is VALID [2018-11-14 17:07:34,264 INFO L273 TraceCheckUtils]: 122: Hoare triple {15429#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15429#false} is VALID [2018-11-14 17:07:34,264 INFO L273 TraceCheckUtils]: 123: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,264 INFO L268 TraceCheckUtils]: 124: Hoare quadruple {15429#false} {15429#false} #75#return; {15429#false} is VALID [2018-11-14 17:07:34,264 INFO L273 TraceCheckUtils]: 125: Hoare triple {15429#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {15429#false} is VALID [2018-11-14 17:07:34,264 INFO L273 TraceCheckUtils]: 126: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,264 INFO L273 TraceCheckUtils]: 127: Hoare triple {15429#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:07:34,264 INFO L273 TraceCheckUtils]: 128: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:07:34,264 INFO L273 TraceCheckUtils]: 129: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,264 INFO L273 TraceCheckUtils]: 130: Hoare triple {15429#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:07:34,265 INFO L273 TraceCheckUtils]: 131: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:07:34,265 INFO L273 TraceCheckUtils]: 132: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,265 INFO L273 TraceCheckUtils]: 133: Hoare triple {15429#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:07:34,265 INFO L273 TraceCheckUtils]: 134: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:07:34,265 INFO L273 TraceCheckUtils]: 135: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,265 INFO L273 TraceCheckUtils]: 136: Hoare triple {15429#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:07:34,265 INFO L273 TraceCheckUtils]: 137: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:07:34,265 INFO L273 TraceCheckUtils]: 138: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,265 INFO L273 TraceCheckUtils]: 139: Hoare triple {15429#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:07:34,266 INFO L273 TraceCheckUtils]: 140: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:07:34,266 INFO L273 TraceCheckUtils]: 141: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,266 INFO L273 TraceCheckUtils]: 142: Hoare triple {15429#false} assume !(~i~2 < 99); {15429#false} is VALID [2018-11-14 17:07:34,266 INFO L273 TraceCheckUtils]: 143: Hoare triple {15429#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {15429#false} is VALID [2018-11-14 17:07:34,266 INFO L256 TraceCheckUtils]: 144: Hoare triple {15429#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {15429#false} is VALID [2018-11-14 17:07:34,266 INFO L273 TraceCheckUtils]: 145: Hoare triple {15429#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15429#false} is VALID [2018-11-14 17:07:34,266 INFO L273 TraceCheckUtils]: 146: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,266 INFO L273 TraceCheckUtils]: 147: Hoare triple {15429#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:07:34,266 INFO L273 TraceCheckUtils]: 148: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:07:34,266 INFO L273 TraceCheckUtils]: 149: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,267 INFO L273 TraceCheckUtils]: 150: Hoare triple {15429#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:07:34,267 INFO L273 TraceCheckUtils]: 151: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:07:34,267 INFO L273 TraceCheckUtils]: 152: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,267 INFO L273 TraceCheckUtils]: 153: Hoare triple {15429#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:07:34,267 INFO L273 TraceCheckUtils]: 154: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:07:34,267 INFO L273 TraceCheckUtils]: 155: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,267 INFO L273 TraceCheckUtils]: 156: Hoare triple {15429#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:07:34,267 INFO L273 TraceCheckUtils]: 157: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:07:34,267 INFO L273 TraceCheckUtils]: 158: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,267 INFO L273 TraceCheckUtils]: 159: Hoare triple {15429#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:07:34,268 INFO L273 TraceCheckUtils]: 160: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:07:34,268 INFO L273 TraceCheckUtils]: 161: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,268 INFO L273 TraceCheckUtils]: 162: Hoare triple {15429#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:07:34,268 INFO L273 TraceCheckUtils]: 163: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:07:34,268 INFO L273 TraceCheckUtils]: 164: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,268 INFO L273 TraceCheckUtils]: 165: Hoare triple {15429#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:07:34,268 INFO L273 TraceCheckUtils]: 166: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:07:34,268 INFO L273 TraceCheckUtils]: 167: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,268 INFO L273 TraceCheckUtils]: 168: Hoare triple {15429#false} assume !(~i~0 < 100); {15429#false} is VALID [2018-11-14 17:07:34,269 INFO L273 TraceCheckUtils]: 169: Hoare triple {15429#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15429#false} is VALID [2018-11-14 17:07:34,269 INFO L273 TraceCheckUtils]: 170: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:07:34,269 INFO L268 TraceCheckUtils]: 171: Hoare quadruple {15429#false} {15429#false} #77#return; {15429#false} is VALID [2018-11-14 17:07:34,269 INFO L273 TraceCheckUtils]: 172: Hoare triple {15429#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {15429#false} is VALID [2018-11-14 17:07:34,269 INFO L273 TraceCheckUtils]: 173: Hoare triple {15429#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {15429#false} is VALID [2018-11-14 17:07:34,269 INFO L273 TraceCheckUtils]: 174: Hoare triple {15429#false} assume !false; {15429#false} is VALID [2018-11-14 17:07:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2018-11-14 17:07:34,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:34,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-14 17:07:34,303 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2018-11-14 17:07:34,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:34,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 17:07:34,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:34,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 17:07:34,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 17:07:34,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 17:07:34,404 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand 24 states. [2018-11-14 17:07:35,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:35,245 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2018-11-14 17:07:35,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-14 17:07:35,245 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2018-11-14 17:07:35,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:35,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:07:35,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 120 transitions. [2018-11-14 17:07:35,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:07:35,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 120 transitions. [2018-11-14 17:07:35,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 120 transitions. [2018-11-14 17:07:35,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:35,361 INFO L225 Difference]: With dead ends: 180 [2018-11-14 17:07:35,361 INFO L226 Difference]: Without dead ends: 126 [2018-11-14 17:07:35,362 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 17:07:35,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-14 17:07:35,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-11-14 17:07:35,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:35,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 125 states. [2018-11-14 17:07:35,396 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 125 states. [2018-11-14 17:07:35,397 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 125 states. [2018-11-14 17:07:35,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:35,399 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-14 17:07:35,399 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-14 17:07:35,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:35,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:35,400 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 126 states. [2018-11-14 17:07:35,400 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 126 states. [2018-11-14 17:07:35,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:35,402 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-14 17:07:35,402 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-14 17:07:35,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:35,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:35,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:35,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:35,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-14 17:07:35,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-11-14 17:07:35,405 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 175 [2018-11-14 17:07:35,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:35,406 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-11-14 17:07:35,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 17:07:35,406 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-14 17:07:35,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-14 17:07:35,407 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:35,407 INFO L375 BasicCegarLoop]: trace histogram [24, 22, 21, 21, 21, 21, 6, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:07:35,407 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:35,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:35,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1950415411, now seen corresponding path program 21 times [2018-11-14 17:07:35,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:35,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:35,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:35,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:35,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:35,964 INFO L256 TraceCheckUtils]: 0: Hoare triple {16639#true} call ULTIMATE.init(); {16639#true} is VALID [2018-11-14 17:07:35,964 INFO L273 TraceCheckUtils]: 1: Hoare triple {16639#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16639#true} is VALID [2018-11-14 17:07:35,965 INFO L273 TraceCheckUtils]: 2: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:35,965 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16639#true} {16639#true} #69#return; {16639#true} is VALID [2018-11-14 17:07:35,965 INFO L256 TraceCheckUtils]: 4: Hoare triple {16639#true} call #t~ret13 := main(); {16639#true} is VALID [2018-11-14 17:07:35,965 INFO L273 TraceCheckUtils]: 5: Hoare triple {16639#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {16641#(= main_~i~1 0)} is VALID [2018-11-14 17:07:35,966 INFO L273 TraceCheckUtils]: 6: Hoare triple {16641#(= main_~i~1 0)} assume true; {16641#(= main_~i~1 0)} is VALID [2018-11-14 17:07:35,966 INFO L273 TraceCheckUtils]: 7: Hoare triple {16641#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16641#(= main_~i~1 0)} is VALID [2018-11-14 17:07:35,967 INFO L273 TraceCheckUtils]: 8: Hoare triple {16641#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16642#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:35,967 INFO L273 TraceCheckUtils]: 9: Hoare triple {16642#(<= main_~i~1 1)} assume true; {16642#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:35,967 INFO L273 TraceCheckUtils]: 10: Hoare triple {16642#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16642#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:35,968 INFO L273 TraceCheckUtils]: 11: Hoare triple {16642#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16643#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:35,968 INFO L273 TraceCheckUtils]: 12: Hoare triple {16643#(<= main_~i~1 2)} assume true; {16643#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:35,968 INFO L273 TraceCheckUtils]: 13: Hoare triple {16643#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16643#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:35,969 INFO L273 TraceCheckUtils]: 14: Hoare triple {16643#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16644#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:35,969 INFO L273 TraceCheckUtils]: 15: Hoare triple {16644#(<= main_~i~1 3)} assume true; {16644#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:35,970 INFO L273 TraceCheckUtils]: 16: Hoare triple {16644#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16644#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:35,970 INFO L273 TraceCheckUtils]: 17: Hoare triple {16644#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16645#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:35,971 INFO L273 TraceCheckUtils]: 18: Hoare triple {16645#(<= main_~i~1 4)} assume true; {16645#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:35,971 INFO L273 TraceCheckUtils]: 19: Hoare triple {16645#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16645#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:35,972 INFO L273 TraceCheckUtils]: 20: Hoare triple {16645#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16646#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:35,972 INFO L273 TraceCheckUtils]: 21: Hoare triple {16646#(<= main_~i~1 5)} assume true; {16646#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:35,973 INFO L273 TraceCheckUtils]: 22: Hoare triple {16646#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16646#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:35,974 INFO L273 TraceCheckUtils]: 23: Hoare triple {16646#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16647#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:35,974 INFO L273 TraceCheckUtils]: 24: Hoare triple {16647#(<= main_~i~1 6)} assume true; {16647#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:35,975 INFO L273 TraceCheckUtils]: 25: Hoare triple {16647#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16647#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:35,975 INFO L273 TraceCheckUtils]: 26: Hoare triple {16647#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16648#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:35,976 INFO L273 TraceCheckUtils]: 27: Hoare triple {16648#(<= main_~i~1 7)} assume true; {16648#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:35,976 INFO L273 TraceCheckUtils]: 28: Hoare triple {16648#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16648#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:35,977 INFO L273 TraceCheckUtils]: 29: Hoare triple {16648#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16649#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:35,977 INFO L273 TraceCheckUtils]: 30: Hoare triple {16649#(<= main_~i~1 8)} assume true; {16649#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:35,978 INFO L273 TraceCheckUtils]: 31: Hoare triple {16649#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16649#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:35,979 INFO L273 TraceCheckUtils]: 32: Hoare triple {16649#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16650#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:35,979 INFO L273 TraceCheckUtils]: 33: Hoare triple {16650#(<= main_~i~1 9)} assume true; {16650#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:35,980 INFO L273 TraceCheckUtils]: 34: Hoare triple {16650#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16650#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:35,980 INFO L273 TraceCheckUtils]: 35: Hoare triple {16650#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16651#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:35,981 INFO L273 TraceCheckUtils]: 36: Hoare triple {16651#(<= main_~i~1 10)} assume true; {16651#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:35,981 INFO L273 TraceCheckUtils]: 37: Hoare triple {16651#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16651#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:35,982 INFO L273 TraceCheckUtils]: 38: Hoare triple {16651#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16652#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:35,983 INFO L273 TraceCheckUtils]: 39: Hoare triple {16652#(<= main_~i~1 11)} assume true; {16652#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:35,983 INFO L273 TraceCheckUtils]: 40: Hoare triple {16652#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16652#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:35,984 INFO L273 TraceCheckUtils]: 41: Hoare triple {16652#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16653#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:35,984 INFO L273 TraceCheckUtils]: 42: Hoare triple {16653#(<= main_~i~1 12)} assume true; {16653#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:35,985 INFO L273 TraceCheckUtils]: 43: Hoare triple {16653#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16653#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:35,985 INFO L273 TraceCheckUtils]: 44: Hoare triple {16653#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16654#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:35,986 INFO L273 TraceCheckUtils]: 45: Hoare triple {16654#(<= main_~i~1 13)} assume true; {16654#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:35,986 INFO L273 TraceCheckUtils]: 46: Hoare triple {16654#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16654#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:35,987 INFO L273 TraceCheckUtils]: 47: Hoare triple {16654#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16655#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:35,988 INFO L273 TraceCheckUtils]: 48: Hoare triple {16655#(<= main_~i~1 14)} assume true; {16655#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:35,988 INFO L273 TraceCheckUtils]: 49: Hoare triple {16655#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16655#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:35,989 INFO L273 TraceCheckUtils]: 50: Hoare triple {16655#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16656#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:35,989 INFO L273 TraceCheckUtils]: 51: Hoare triple {16656#(<= main_~i~1 15)} assume true; {16656#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:35,990 INFO L273 TraceCheckUtils]: 52: Hoare triple {16656#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16656#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:35,991 INFO L273 TraceCheckUtils]: 53: Hoare triple {16656#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16657#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:35,991 INFO L273 TraceCheckUtils]: 54: Hoare triple {16657#(<= main_~i~1 16)} assume true; {16657#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:35,992 INFO L273 TraceCheckUtils]: 55: Hoare triple {16657#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16657#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:35,992 INFO L273 TraceCheckUtils]: 56: Hoare triple {16657#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16658#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:35,993 INFO L273 TraceCheckUtils]: 57: Hoare triple {16658#(<= main_~i~1 17)} assume true; {16658#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:35,993 INFO L273 TraceCheckUtils]: 58: Hoare triple {16658#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16658#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:35,994 INFO L273 TraceCheckUtils]: 59: Hoare triple {16658#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16659#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:35,994 INFO L273 TraceCheckUtils]: 60: Hoare triple {16659#(<= main_~i~1 18)} assume true; {16659#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:35,995 INFO L273 TraceCheckUtils]: 61: Hoare triple {16659#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16659#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:35,996 INFO L273 TraceCheckUtils]: 62: Hoare triple {16659#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16660#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:35,996 INFO L273 TraceCheckUtils]: 63: Hoare triple {16660#(<= main_~i~1 19)} assume true; {16660#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:35,997 INFO L273 TraceCheckUtils]: 64: Hoare triple {16660#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16660#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:35,997 INFO L273 TraceCheckUtils]: 65: Hoare triple {16660#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16661#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:35,998 INFO L273 TraceCheckUtils]: 66: Hoare triple {16661#(<= main_~i~1 20)} assume true; {16661#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:35,998 INFO L273 TraceCheckUtils]: 67: Hoare triple {16661#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16661#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:35,999 INFO L273 TraceCheckUtils]: 68: Hoare triple {16661#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16662#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:36,000 INFO L273 TraceCheckUtils]: 69: Hoare triple {16662#(<= main_~i~1 21)} assume true; {16662#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:36,000 INFO L273 TraceCheckUtils]: 70: Hoare triple {16662#(<= main_~i~1 21)} assume !(~i~1 < 100); {16640#false} is VALID [2018-11-14 17:07:36,000 INFO L256 TraceCheckUtils]: 71: Hoare triple {16640#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {16639#true} is VALID [2018-11-14 17:07:36,001 INFO L273 TraceCheckUtils]: 72: Hoare triple {16639#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16639#true} is VALID [2018-11-14 17:07:36,001 INFO L273 TraceCheckUtils]: 73: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,001 INFO L273 TraceCheckUtils]: 74: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,001 INFO L273 TraceCheckUtils]: 75: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,001 INFO L273 TraceCheckUtils]: 76: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,002 INFO L273 TraceCheckUtils]: 77: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,002 INFO L273 TraceCheckUtils]: 78: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,002 INFO L273 TraceCheckUtils]: 79: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,002 INFO L273 TraceCheckUtils]: 80: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,002 INFO L273 TraceCheckUtils]: 81: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,002 INFO L273 TraceCheckUtils]: 82: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,003 INFO L273 TraceCheckUtils]: 83: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,003 INFO L273 TraceCheckUtils]: 84: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,003 INFO L273 TraceCheckUtils]: 85: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,003 INFO L273 TraceCheckUtils]: 86: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,003 INFO L273 TraceCheckUtils]: 87: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,003 INFO L273 TraceCheckUtils]: 88: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,003 INFO L273 TraceCheckUtils]: 89: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,004 INFO L273 TraceCheckUtils]: 90: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,004 INFO L273 TraceCheckUtils]: 91: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,004 INFO L273 TraceCheckUtils]: 92: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,004 INFO L273 TraceCheckUtils]: 93: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,004 INFO L273 TraceCheckUtils]: 94: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,004 INFO L273 TraceCheckUtils]: 95: Hoare triple {16639#true} assume !(~i~0 < 100); {16639#true} is VALID [2018-11-14 17:07:36,004 INFO L273 TraceCheckUtils]: 96: Hoare triple {16639#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16639#true} is VALID [2018-11-14 17:07:36,004 INFO L273 TraceCheckUtils]: 97: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,004 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {16639#true} {16640#false} #73#return; {16640#false} is VALID [2018-11-14 17:07:36,005 INFO L273 TraceCheckUtils]: 99: Hoare triple {16640#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {16640#false} is VALID [2018-11-14 17:07:36,005 INFO L256 TraceCheckUtils]: 100: Hoare triple {16640#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {16639#true} is VALID [2018-11-14 17:07:36,005 INFO L273 TraceCheckUtils]: 101: Hoare triple {16639#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16639#true} is VALID [2018-11-14 17:07:36,005 INFO L273 TraceCheckUtils]: 102: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,005 INFO L273 TraceCheckUtils]: 103: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,005 INFO L273 TraceCheckUtils]: 104: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,005 INFO L273 TraceCheckUtils]: 105: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,005 INFO L273 TraceCheckUtils]: 106: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,005 INFO L273 TraceCheckUtils]: 107: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,005 INFO L273 TraceCheckUtils]: 108: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,006 INFO L273 TraceCheckUtils]: 109: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,006 INFO L273 TraceCheckUtils]: 110: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,006 INFO L273 TraceCheckUtils]: 111: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,006 INFO L273 TraceCheckUtils]: 112: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,006 INFO L273 TraceCheckUtils]: 113: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,006 INFO L273 TraceCheckUtils]: 114: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,006 INFO L273 TraceCheckUtils]: 115: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,006 INFO L273 TraceCheckUtils]: 116: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,006 INFO L273 TraceCheckUtils]: 117: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,007 INFO L273 TraceCheckUtils]: 118: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,007 INFO L273 TraceCheckUtils]: 119: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,007 INFO L273 TraceCheckUtils]: 120: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,007 INFO L273 TraceCheckUtils]: 121: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,007 INFO L273 TraceCheckUtils]: 122: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,007 INFO L273 TraceCheckUtils]: 123: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,007 INFO L273 TraceCheckUtils]: 124: Hoare triple {16639#true} assume !(~i~0 < 100); {16639#true} is VALID [2018-11-14 17:07:36,007 INFO L273 TraceCheckUtils]: 125: Hoare triple {16639#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16639#true} is VALID [2018-11-14 17:07:36,007 INFO L273 TraceCheckUtils]: 126: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,007 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {16639#true} {16640#false} #75#return; {16640#false} is VALID [2018-11-14 17:07:36,008 INFO L273 TraceCheckUtils]: 128: Hoare triple {16640#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {16640#false} is VALID [2018-11-14 17:07:36,008 INFO L273 TraceCheckUtils]: 129: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:07:36,008 INFO L273 TraceCheckUtils]: 130: Hoare triple {16640#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {16640#false} is VALID [2018-11-14 17:07:36,008 INFO L273 TraceCheckUtils]: 131: Hoare triple {16640#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {16640#false} is VALID [2018-11-14 17:07:36,008 INFO L273 TraceCheckUtils]: 132: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:07:36,008 INFO L273 TraceCheckUtils]: 133: Hoare triple {16640#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {16640#false} is VALID [2018-11-14 17:07:36,008 INFO L273 TraceCheckUtils]: 134: Hoare triple {16640#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {16640#false} is VALID [2018-11-14 17:07:36,008 INFO L273 TraceCheckUtils]: 135: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:07:36,008 INFO L273 TraceCheckUtils]: 136: Hoare triple {16640#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {16640#false} is VALID [2018-11-14 17:07:36,009 INFO L273 TraceCheckUtils]: 137: Hoare triple {16640#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {16640#false} is VALID [2018-11-14 17:07:36,009 INFO L273 TraceCheckUtils]: 138: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:07:36,009 INFO L273 TraceCheckUtils]: 139: Hoare triple {16640#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {16640#false} is VALID [2018-11-14 17:07:36,009 INFO L273 TraceCheckUtils]: 140: Hoare triple {16640#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {16640#false} is VALID [2018-11-14 17:07:36,009 INFO L273 TraceCheckUtils]: 141: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:07:36,009 INFO L273 TraceCheckUtils]: 142: Hoare triple {16640#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {16640#false} is VALID [2018-11-14 17:07:36,009 INFO L273 TraceCheckUtils]: 143: Hoare triple {16640#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {16640#false} is VALID [2018-11-14 17:07:36,010 INFO L273 TraceCheckUtils]: 144: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:07:36,010 INFO L273 TraceCheckUtils]: 145: Hoare triple {16640#false} assume !(~i~2 < 99); {16640#false} is VALID [2018-11-14 17:07:36,010 INFO L273 TraceCheckUtils]: 146: Hoare triple {16640#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {16640#false} is VALID [2018-11-14 17:07:36,010 INFO L256 TraceCheckUtils]: 147: Hoare triple {16640#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {16639#true} is VALID [2018-11-14 17:07:36,010 INFO L273 TraceCheckUtils]: 148: Hoare triple {16639#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16639#true} is VALID [2018-11-14 17:07:36,010 INFO L273 TraceCheckUtils]: 149: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,011 INFO L273 TraceCheckUtils]: 150: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,011 INFO L273 TraceCheckUtils]: 151: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,011 INFO L273 TraceCheckUtils]: 152: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,011 INFO L273 TraceCheckUtils]: 153: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,011 INFO L273 TraceCheckUtils]: 154: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,011 INFO L273 TraceCheckUtils]: 155: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,011 INFO L273 TraceCheckUtils]: 156: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,012 INFO L273 TraceCheckUtils]: 157: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,012 INFO L273 TraceCheckUtils]: 158: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,012 INFO L273 TraceCheckUtils]: 159: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,012 INFO L273 TraceCheckUtils]: 160: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,012 INFO L273 TraceCheckUtils]: 161: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,012 INFO L273 TraceCheckUtils]: 162: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,013 INFO L273 TraceCheckUtils]: 163: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,013 INFO L273 TraceCheckUtils]: 164: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,013 INFO L273 TraceCheckUtils]: 165: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,013 INFO L273 TraceCheckUtils]: 166: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,013 INFO L273 TraceCheckUtils]: 167: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,013 INFO L273 TraceCheckUtils]: 168: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,013 INFO L273 TraceCheckUtils]: 169: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,014 INFO L273 TraceCheckUtils]: 170: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,014 INFO L273 TraceCheckUtils]: 171: Hoare triple {16639#true} assume !(~i~0 < 100); {16639#true} is VALID [2018-11-14 17:07:36,014 INFO L273 TraceCheckUtils]: 172: Hoare triple {16639#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16639#true} is VALID [2018-11-14 17:07:36,014 INFO L273 TraceCheckUtils]: 173: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,014 INFO L268 TraceCheckUtils]: 174: Hoare quadruple {16639#true} {16640#false} #77#return; {16640#false} is VALID [2018-11-14 17:07:36,014 INFO L273 TraceCheckUtils]: 175: Hoare triple {16640#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {16640#false} is VALID [2018-11-14 17:07:36,014 INFO L273 TraceCheckUtils]: 176: Hoare triple {16640#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {16640#false} is VALID [2018-11-14 17:07:36,015 INFO L273 TraceCheckUtils]: 177: Hoare triple {16640#false} assume !false; {16640#false} is VALID [2018-11-14 17:07:36,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1486 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2018-11-14 17:07:36,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:36,033 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:07:36,043 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:07:36,167 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-14 17:07:36,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:36,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:36,425 INFO L256 TraceCheckUtils]: 0: Hoare triple {16639#true} call ULTIMATE.init(); {16639#true} is VALID [2018-11-14 17:07:36,426 INFO L273 TraceCheckUtils]: 1: Hoare triple {16639#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16639#true} is VALID [2018-11-14 17:07:36,426 INFO L273 TraceCheckUtils]: 2: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,426 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16639#true} {16639#true} #69#return; {16639#true} is VALID [2018-11-14 17:07:36,426 INFO L256 TraceCheckUtils]: 4: Hoare triple {16639#true} call #t~ret13 := main(); {16639#true} is VALID [2018-11-14 17:07:36,426 INFO L273 TraceCheckUtils]: 5: Hoare triple {16639#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {16639#true} is VALID [2018-11-14 17:07:36,426 INFO L273 TraceCheckUtils]: 6: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,427 INFO L273 TraceCheckUtils]: 7: Hoare triple {16639#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:07:36,427 INFO L273 TraceCheckUtils]: 8: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:07:36,427 INFO L273 TraceCheckUtils]: 9: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,427 INFO L273 TraceCheckUtils]: 10: Hoare triple {16639#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:07:36,427 INFO L273 TraceCheckUtils]: 11: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:07:36,428 INFO L273 TraceCheckUtils]: 12: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,428 INFO L273 TraceCheckUtils]: 13: Hoare triple {16639#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:07:36,428 INFO L273 TraceCheckUtils]: 14: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:07:36,428 INFO L273 TraceCheckUtils]: 15: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,428 INFO L273 TraceCheckUtils]: 16: Hoare triple {16639#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:07:36,428 INFO L273 TraceCheckUtils]: 17: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:07:36,428 INFO L273 TraceCheckUtils]: 18: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,428 INFO L273 TraceCheckUtils]: 19: Hoare triple {16639#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:07:36,429 INFO L273 TraceCheckUtils]: 20: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:07:36,429 INFO L273 TraceCheckUtils]: 21: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,429 INFO L273 TraceCheckUtils]: 22: Hoare triple {16639#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:07:36,429 INFO L273 TraceCheckUtils]: 23: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:07:36,429 INFO L273 TraceCheckUtils]: 24: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,429 INFO L273 TraceCheckUtils]: 25: Hoare triple {16639#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:07:36,429 INFO L273 TraceCheckUtils]: 26: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:07:36,429 INFO L273 TraceCheckUtils]: 27: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,429 INFO L273 TraceCheckUtils]: 28: Hoare triple {16639#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:07:36,430 INFO L273 TraceCheckUtils]: 29: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:07:36,430 INFO L273 TraceCheckUtils]: 30: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,430 INFO L273 TraceCheckUtils]: 31: Hoare triple {16639#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:07:36,430 INFO L273 TraceCheckUtils]: 32: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:07:36,430 INFO L273 TraceCheckUtils]: 33: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,430 INFO L273 TraceCheckUtils]: 34: Hoare triple {16639#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:07:36,430 INFO L273 TraceCheckUtils]: 35: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:07:36,430 INFO L273 TraceCheckUtils]: 36: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,430 INFO L273 TraceCheckUtils]: 37: Hoare triple {16639#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:07:36,430 INFO L273 TraceCheckUtils]: 38: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:07:36,431 INFO L273 TraceCheckUtils]: 39: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,431 INFO L273 TraceCheckUtils]: 40: Hoare triple {16639#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:07:36,431 INFO L273 TraceCheckUtils]: 41: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:07:36,431 INFO L273 TraceCheckUtils]: 42: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,431 INFO L273 TraceCheckUtils]: 43: Hoare triple {16639#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:07:36,431 INFO L273 TraceCheckUtils]: 44: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:07:36,431 INFO L273 TraceCheckUtils]: 45: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,431 INFO L273 TraceCheckUtils]: 46: Hoare triple {16639#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:07:36,431 INFO L273 TraceCheckUtils]: 47: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:07:36,431 INFO L273 TraceCheckUtils]: 48: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,432 INFO L273 TraceCheckUtils]: 49: Hoare triple {16639#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:07:36,432 INFO L273 TraceCheckUtils]: 50: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:07:36,432 INFO L273 TraceCheckUtils]: 51: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,432 INFO L273 TraceCheckUtils]: 52: Hoare triple {16639#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:07:36,432 INFO L273 TraceCheckUtils]: 53: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:07:36,432 INFO L273 TraceCheckUtils]: 54: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,432 INFO L273 TraceCheckUtils]: 55: Hoare triple {16639#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:07:36,432 INFO L273 TraceCheckUtils]: 56: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:07:36,432 INFO L273 TraceCheckUtils]: 57: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,433 INFO L273 TraceCheckUtils]: 58: Hoare triple {16639#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:07:36,433 INFO L273 TraceCheckUtils]: 59: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:07:36,433 INFO L273 TraceCheckUtils]: 60: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,433 INFO L273 TraceCheckUtils]: 61: Hoare triple {16639#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:07:36,433 INFO L273 TraceCheckUtils]: 62: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:07:36,433 INFO L273 TraceCheckUtils]: 63: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,433 INFO L273 TraceCheckUtils]: 64: Hoare triple {16639#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:07:36,433 INFO L273 TraceCheckUtils]: 65: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:07:36,433 INFO L273 TraceCheckUtils]: 66: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,433 INFO L273 TraceCheckUtils]: 67: Hoare triple {16639#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:07:36,434 INFO L273 TraceCheckUtils]: 68: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:07:36,434 INFO L273 TraceCheckUtils]: 69: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,434 INFO L273 TraceCheckUtils]: 70: Hoare triple {16639#true} assume !(~i~1 < 100); {16639#true} is VALID [2018-11-14 17:07:36,434 INFO L256 TraceCheckUtils]: 71: Hoare triple {16639#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {16639#true} is VALID [2018-11-14 17:07:36,434 INFO L273 TraceCheckUtils]: 72: Hoare triple {16639#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16639#true} is VALID [2018-11-14 17:07:36,434 INFO L273 TraceCheckUtils]: 73: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,434 INFO L273 TraceCheckUtils]: 74: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,434 INFO L273 TraceCheckUtils]: 75: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,434 INFO L273 TraceCheckUtils]: 76: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,435 INFO L273 TraceCheckUtils]: 77: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,435 INFO L273 TraceCheckUtils]: 78: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,435 INFO L273 TraceCheckUtils]: 79: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,435 INFO L273 TraceCheckUtils]: 80: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,435 INFO L273 TraceCheckUtils]: 81: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,435 INFO L273 TraceCheckUtils]: 82: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,435 INFO L273 TraceCheckUtils]: 83: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,435 INFO L273 TraceCheckUtils]: 84: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,435 INFO L273 TraceCheckUtils]: 85: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,435 INFO L273 TraceCheckUtils]: 86: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,436 INFO L273 TraceCheckUtils]: 87: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,436 INFO L273 TraceCheckUtils]: 88: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,436 INFO L273 TraceCheckUtils]: 89: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,436 INFO L273 TraceCheckUtils]: 90: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,436 INFO L273 TraceCheckUtils]: 91: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,436 INFO L273 TraceCheckUtils]: 92: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,436 INFO L273 TraceCheckUtils]: 93: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,436 INFO L273 TraceCheckUtils]: 94: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,436 INFO L273 TraceCheckUtils]: 95: Hoare triple {16639#true} assume !(~i~0 < 100); {16639#true} is VALID [2018-11-14 17:07:36,437 INFO L273 TraceCheckUtils]: 96: Hoare triple {16639#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16639#true} is VALID [2018-11-14 17:07:36,437 INFO L273 TraceCheckUtils]: 97: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,437 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {16639#true} {16639#true} #73#return; {16639#true} is VALID [2018-11-14 17:07:36,437 INFO L273 TraceCheckUtils]: 99: Hoare triple {16639#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {16639#true} is VALID [2018-11-14 17:07:36,437 INFO L256 TraceCheckUtils]: 100: Hoare triple {16639#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {16639#true} is VALID [2018-11-14 17:07:36,437 INFO L273 TraceCheckUtils]: 101: Hoare triple {16639#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16639#true} is VALID [2018-11-14 17:07:36,437 INFO L273 TraceCheckUtils]: 102: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,437 INFO L273 TraceCheckUtils]: 103: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,437 INFO L273 TraceCheckUtils]: 104: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,437 INFO L273 TraceCheckUtils]: 105: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,438 INFO L273 TraceCheckUtils]: 106: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,438 INFO L273 TraceCheckUtils]: 107: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,438 INFO L273 TraceCheckUtils]: 108: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,438 INFO L273 TraceCheckUtils]: 109: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,438 INFO L273 TraceCheckUtils]: 110: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,438 INFO L273 TraceCheckUtils]: 111: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,438 INFO L273 TraceCheckUtils]: 112: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,438 INFO L273 TraceCheckUtils]: 113: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,438 INFO L273 TraceCheckUtils]: 114: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,439 INFO L273 TraceCheckUtils]: 115: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,439 INFO L273 TraceCheckUtils]: 116: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,439 INFO L273 TraceCheckUtils]: 117: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,439 INFO L273 TraceCheckUtils]: 118: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,439 INFO L273 TraceCheckUtils]: 119: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,439 INFO L273 TraceCheckUtils]: 120: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,439 INFO L273 TraceCheckUtils]: 121: Hoare triple {16639#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:07:36,439 INFO L273 TraceCheckUtils]: 122: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:07:36,439 INFO L273 TraceCheckUtils]: 123: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,439 INFO L273 TraceCheckUtils]: 124: Hoare triple {16639#true} assume !(~i~0 < 100); {16639#true} is VALID [2018-11-14 17:07:36,440 INFO L273 TraceCheckUtils]: 125: Hoare triple {16639#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16639#true} is VALID [2018-11-14 17:07:36,440 INFO L273 TraceCheckUtils]: 126: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:07:36,440 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {16639#true} {16639#true} #75#return; {16639#true} is VALID [2018-11-14 17:07:36,441 INFO L273 TraceCheckUtils]: 128: Hoare triple {16639#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {17050#(<= main_~i~2 0)} is VALID [2018-11-14 17:07:36,441 INFO L273 TraceCheckUtils]: 129: Hoare triple {17050#(<= main_~i~2 0)} assume true; {17050#(<= main_~i~2 0)} is VALID [2018-11-14 17:07:36,441 INFO L273 TraceCheckUtils]: 130: Hoare triple {17050#(<= main_~i~2 0)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17050#(<= main_~i~2 0)} is VALID [2018-11-14 17:07:36,442 INFO L273 TraceCheckUtils]: 131: Hoare triple {17050#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17060#(<= main_~i~2 1)} is VALID [2018-11-14 17:07:36,442 INFO L273 TraceCheckUtils]: 132: Hoare triple {17060#(<= main_~i~2 1)} assume true; {17060#(<= main_~i~2 1)} is VALID [2018-11-14 17:07:36,442 INFO L273 TraceCheckUtils]: 133: Hoare triple {17060#(<= main_~i~2 1)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17060#(<= main_~i~2 1)} is VALID [2018-11-14 17:07:36,443 INFO L273 TraceCheckUtils]: 134: Hoare triple {17060#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17070#(<= main_~i~2 2)} is VALID [2018-11-14 17:07:36,443 INFO L273 TraceCheckUtils]: 135: Hoare triple {17070#(<= main_~i~2 2)} assume true; {17070#(<= main_~i~2 2)} is VALID [2018-11-14 17:07:36,443 INFO L273 TraceCheckUtils]: 136: Hoare triple {17070#(<= main_~i~2 2)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17070#(<= main_~i~2 2)} is VALID [2018-11-14 17:07:36,444 INFO L273 TraceCheckUtils]: 137: Hoare triple {17070#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17080#(<= main_~i~2 3)} is VALID [2018-11-14 17:07:36,444 INFO L273 TraceCheckUtils]: 138: Hoare triple {17080#(<= main_~i~2 3)} assume true; {17080#(<= main_~i~2 3)} is VALID [2018-11-14 17:07:36,445 INFO L273 TraceCheckUtils]: 139: Hoare triple {17080#(<= main_~i~2 3)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17080#(<= main_~i~2 3)} is VALID [2018-11-14 17:07:36,445 INFO L273 TraceCheckUtils]: 140: Hoare triple {17080#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17090#(<= main_~i~2 4)} is VALID [2018-11-14 17:07:36,446 INFO L273 TraceCheckUtils]: 141: Hoare triple {17090#(<= main_~i~2 4)} assume true; {17090#(<= main_~i~2 4)} is VALID [2018-11-14 17:07:36,446 INFO L273 TraceCheckUtils]: 142: Hoare triple {17090#(<= main_~i~2 4)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17090#(<= main_~i~2 4)} is VALID [2018-11-14 17:07:36,447 INFO L273 TraceCheckUtils]: 143: Hoare triple {17090#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17100#(<= main_~i~2 5)} is VALID [2018-11-14 17:07:36,447 INFO L273 TraceCheckUtils]: 144: Hoare triple {17100#(<= main_~i~2 5)} assume true; {17100#(<= main_~i~2 5)} is VALID [2018-11-14 17:07:36,448 INFO L273 TraceCheckUtils]: 145: Hoare triple {17100#(<= main_~i~2 5)} assume !(~i~2 < 99); {16640#false} is VALID [2018-11-14 17:07:36,448 INFO L273 TraceCheckUtils]: 146: Hoare triple {16640#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {16640#false} is VALID [2018-11-14 17:07:36,448 INFO L256 TraceCheckUtils]: 147: Hoare triple {16640#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {16640#false} is VALID [2018-11-14 17:07:36,449 INFO L273 TraceCheckUtils]: 148: Hoare triple {16640#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16640#false} is VALID [2018-11-14 17:07:36,449 INFO L273 TraceCheckUtils]: 149: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:07:36,449 INFO L273 TraceCheckUtils]: 150: Hoare triple {16640#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16640#false} is VALID [2018-11-14 17:07:36,449 INFO L273 TraceCheckUtils]: 151: Hoare triple {16640#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16640#false} is VALID [2018-11-14 17:07:36,449 INFO L273 TraceCheckUtils]: 152: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:07:36,449 INFO L273 TraceCheckUtils]: 153: Hoare triple {16640#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16640#false} is VALID [2018-11-14 17:07:36,450 INFO L273 TraceCheckUtils]: 154: Hoare triple {16640#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16640#false} is VALID [2018-11-14 17:07:36,450 INFO L273 TraceCheckUtils]: 155: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:07:36,450 INFO L273 TraceCheckUtils]: 156: Hoare triple {16640#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16640#false} is VALID [2018-11-14 17:07:36,450 INFO L273 TraceCheckUtils]: 157: Hoare triple {16640#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16640#false} is VALID [2018-11-14 17:07:36,450 INFO L273 TraceCheckUtils]: 158: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:07:36,450 INFO L273 TraceCheckUtils]: 159: Hoare triple {16640#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16640#false} is VALID [2018-11-14 17:07:36,451 INFO L273 TraceCheckUtils]: 160: Hoare triple {16640#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16640#false} is VALID [2018-11-14 17:07:36,451 INFO L273 TraceCheckUtils]: 161: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:07:36,451 INFO L273 TraceCheckUtils]: 162: Hoare triple {16640#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16640#false} is VALID [2018-11-14 17:07:36,451 INFO L273 TraceCheckUtils]: 163: Hoare triple {16640#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16640#false} is VALID [2018-11-14 17:07:36,451 INFO L273 TraceCheckUtils]: 164: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:07:36,451 INFO L273 TraceCheckUtils]: 165: Hoare triple {16640#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16640#false} is VALID [2018-11-14 17:07:36,451 INFO L273 TraceCheckUtils]: 166: Hoare triple {16640#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16640#false} is VALID [2018-11-14 17:07:36,451 INFO L273 TraceCheckUtils]: 167: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:07:36,452 INFO L273 TraceCheckUtils]: 168: Hoare triple {16640#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16640#false} is VALID [2018-11-14 17:07:36,452 INFO L273 TraceCheckUtils]: 169: Hoare triple {16640#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16640#false} is VALID [2018-11-14 17:07:36,452 INFO L273 TraceCheckUtils]: 170: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:07:36,452 INFO L273 TraceCheckUtils]: 171: Hoare triple {16640#false} assume !(~i~0 < 100); {16640#false} is VALID [2018-11-14 17:07:36,452 INFO L273 TraceCheckUtils]: 172: Hoare triple {16640#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16640#false} is VALID [2018-11-14 17:07:36,452 INFO L273 TraceCheckUtils]: 173: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:07:36,452 INFO L268 TraceCheckUtils]: 174: Hoare quadruple {16640#false} {16640#false} #77#return; {16640#false} is VALID [2018-11-14 17:07:36,452 INFO L273 TraceCheckUtils]: 175: Hoare triple {16640#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {16640#false} is VALID [2018-11-14 17:07:36,452 INFO L273 TraceCheckUtils]: 176: Hoare triple {16640#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {16640#false} is VALID [2018-11-14 17:07:36,453 INFO L273 TraceCheckUtils]: 177: Hoare triple {16640#false} assume !false; {16640#false} is VALID [2018-11-14 17:07:36,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1486 backedges. 362 proven. 40 refuted. 0 times theorem prover too weak. 1084 trivial. 0 not checked. [2018-11-14 17:07:36,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:36,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 30 [2018-11-14 17:07:36,486 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 178 [2018-11-14 17:07:36,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:36,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-14 17:07:36,605 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:36,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-14 17:07:36,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-14 17:07:36,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2018-11-14 17:07:36,606 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 30 states. [2018-11-14 17:07:38,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:38,351 INFO L93 Difference]: Finished difference Result 187 states and 196 transitions. [2018-11-14 17:07:38,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-14 17:07:38,351 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 178 [2018-11-14 17:07:38,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:38,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 17:07:38,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 142 transitions. [2018-11-14 17:07:38,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 17:07:38,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 142 transitions. [2018-11-14 17:07:38,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 142 transitions. [2018-11-14 17:07:38,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:38,483 INFO L225 Difference]: With dead ends: 187 [2018-11-14 17:07:38,484 INFO L226 Difference]: Without dead ends: 133 [2018-11-14 17:07:38,485 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2018-11-14 17:07:38,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-14 17:07:38,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-11-14 17:07:38,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:38,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 131 states. [2018-11-14 17:07:38,533 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 131 states. [2018-11-14 17:07:38,533 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 131 states. [2018-11-14 17:07:38,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:38,536 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-11-14 17:07:38,536 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-14 17:07:38,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:38,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:38,537 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 133 states. [2018-11-14 17:07:38,537 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 133 states. [2018-11-14 17:07:38,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:38,539 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-11-14 17:07:38,539 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-14 17:07:38,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:38,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:38,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:38,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:38,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-14 17:07:38,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2018-11-14 17:07:38,543 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 178 [2018-11-14 17:07:38,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:38,543 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2018-11-14 17:07:38,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-14 17:07:38,543 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2018-11-14 17:07:38,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-14 17:07:38,544 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:38,545 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 22, 22, 21, 21, 7, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:07:38,545 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:38,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:38,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1792938277, now seen corresponding path program 22 times [2018-11-14 17:07:38,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:38,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:38,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:38,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:38,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:39,079 INFO L256 TraceCheckUtils]: 0: Hoare triple {17896#true} call ULTIMATE.init(); {17896#true} is VALID [2018-11-14 17:07:39,080 INFO L273 TraceCheckUtils]: 1: Hoare triple {17896#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17896#true} is VALID [2018-11-14 17:07:39,080 INFO L273 TraceCheckUtils]: 2: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,080 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17896#true} {17896#true} #69#return; {17896#true} is VALID [2018-11-14 17:07:39,080 INFO L256 TraceCheckUtils]: 4: Hoare triple {17896#true} call #t~ret13 := main(); {17896#true} is VALID [2018-11-14 17:07:39,081 INFO L273 TraceCheckUtils]: 5: Hoare triple {17896#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {17898#(= main_~i~1 0)} is VALID [2018-11-14 17:07:39,081 INFO L273 TraceCheckUtils]: 6: Hoare triple {17898#(= main_~i~1 0)} assume true; {17898#(= main_~i~1 0)} is VALID [2018-11-14 17:07:39,082 INFO L273 TraceCheckUtils]: 7: Hoare triple {17898#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17898#(= main_~i~1 0)} is VALID [2018-11-14 17:07:39,083 INFO L273 TraceCheckUtils]: 8: Hoare triple {17898#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17899#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:39,083 INFO L273 TraceCheckUtils]: 9: Hoare triple {17899#(<= main_~i~1 1)} assume true; {17899#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:39,083 INFO L273 TraceCheckUtils]: 10: Hoare triple {17899#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17899#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:39,084 INFO L273 TraceCheckUtils]: 11: Hoare triple {17899#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17900#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:39,084 INFO L273 TraceCheckUtils]: 12: Hoare triple {17900#(<= main_~i~1 2)} assume true; {17900#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:39,084 INFO L273 TraceCheckUtils]: 13: Hoare triple {17900#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17900#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:39,085 INFO L273 TraceCheckUtils]: 14: Hoare triple {17900#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17901#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:39,085 INFO L273 TraceCheckUtils]: 15: Hoare triple {17901#(<= main_~i~1 3)} assume true; {17901#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:39,086 INFO L273 TraceCheckUtils]: 16: Hoare triple {17901#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17901#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:39,086 INFO L273 TraceCheckUtils]: 17: Hoare triple {17901#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17902#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:39,087 INFO L273 TraceCheckUtils]: 18: Hoare triple {17902#(<= main_~i~1 4)} assume true; {17902#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:39,087 INFO L273 TraceCheckUtils]: 19: Hoare triple {17902#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17902#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:39,088 INFO L273 TraceCheckUtils]: 20: Hoare triple {17902#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17903#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:39,088 INFO L273 TraceCheckUtils]: 21: Hoare triple {17903#(<= main_~i~1 5)} assume true; {17903#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:39,089 INFO L273 TraceCheckUtils]: 22: Hoare triple {17903#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17903#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:39,089 INFO L273 TraceCheckUtils]: 23: Hoare triple {17903#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17904#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:39,090 INFO L273 TraceCheckUtils]: 24: Hoare triple {17904#(<= main_~i~1 6)} assume true; {17904#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:39,090 INFO L273 TraceCheckUtils]: 25: Hoare triple {17904#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17904#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:39,091 INFO L273 TraceCheckUtils]: 26: Hoare triple {17904#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17905#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:39,092 INFO L273 TraceCheckUtils]: 27: Hoare triple {17905#(<= main_~i~1 7)} assume true; {17905#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:39,092 INFO L273 TraceCheckUtils]: 28: Hoare triple {17905#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17905#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:39,093 INFO L273 TraceCheckUtils]: 29: Hoare triple {17905#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17906#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:39,093 INFO L273 TraceCheckUtils]: 30: Hoare triple {17906#(<= main_~i~1 8)} assume true; {17906#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:39,094 INFO L273 TraceCheckUtils]: 31: Hoare triple {17906#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17906#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:39,094 INFO L273 TraceCheckUtils]: 32: Hoare triple {17906#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17907#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:39,095 INFO L273 TraceCheckUtils]: 33: Hoare triple {17907#(<= main_~i~1 9)} assume true; {17907#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:39,095 INFO L273 TraceCheckUtils]: 34: Hoare triple {17907#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17907#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:39,096 INFO L273 TraceCheckUtils]: 35: Hoare triple {17907#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17908#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:39,096 INFO L273 TraceCheckUtils]: 36: Hoare triple {17908#(<= main_~i~1 10)} assume true; {17908#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:39,097 INFO L273 TraceCheckUtils]: 37: Hoare triple {17908#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17908#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:39,098 INFO L273 TraceCheckUtils]: 38: Hoare triple {17908#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17909#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:39,098 INFO L273 TraceCheckUtils]: 39: Hoare triple {17909#(<= main_~i~1 11)} assume true; {17909#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:39,099 INFO L273 TraceCheckUtils]: 40: Hoare triple {17909#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17909#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:39,099 INFO L273 TraceCheckUtils]: 41: Hoare triple {17909#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17910#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:39,100 INFO L273 TraceCheckUtils]: 42: Hoare triple {17910#(<= main_~i~1 12)} assume true; {17910#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:39,100 INFO L273 TraceCheckUtils]: 43: Hoare triple {17910#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17910#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:39,101 INFO L273 TraceCheckUtils]: 44: Hoare triple {17910#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17911#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:39,101 INFO L273 TraceCheckUtils]: 45: Hoare triple {17911#(<= main_~i~1 13)} assume true; {17911#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:39,102 INFO L273 TraceCheckUtils]: 46: Hoare triple {17911#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17911#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:39,102 INFO L273 TraceCheckUtils]: 47: Hoare triple {17911#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17912#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:39,103 INFO L273 TraceCheckUtils]: 48: Hoare triple {17912#(<= main_~i~1 14)} assume true; {17912#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:39,103 INFO L273 TraceCheckUtils]: 49: Hoare triple {17912#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17912#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:39,104 INFO L273 TraceCheckUtils]: 50: Hoare triple {17912#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17913#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:39,105 INFO L273 TraceCheckUtils]: 51: Hoare triple {17913#(<= main_~i~1 15)} assume true; {17913#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:39,105 INFO L273 TraceCheckUtils]: 52: Hoare triple {17913#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17913#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:39,106 INFO L273 TraceCheckUtils]: 53: Hoare triple {17913#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17914#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:39,106 INFO L273 TraceCheckUtils]: 54: Hoare triple {17914#(<= main_~i~1 16)} assume true; {17914#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:39,107 INFO L273 TraceCheckUtils]: 55: Hoare triple {17914#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17914#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:39,107 INFO L273 TraceCheckUtils]: 56: Hoare triple {17914#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17915#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:39,108 INFO L273 TraceCheckUtils]: 57: Hoare triple {17915#(<= main_~i~1 17)} assume true; {17915#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:39,108 INFO L273 TraceCheckUtils]: 58: Hoare triple {17915#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17915#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:39,109 INFO L273 TraceCheckUtils]: 59: Hoare triple {17915#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17916#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:39,109 INFO L273 TraceCheckUtils]: 60: Hoare triple {17916#(<= main_~i~1 18)} assume true; {17916#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:39,110 INFO L273 TraceCheckUtils]: 61: Hoare triple {17916#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17916#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:39,111 INFO L273 TraceCheckUtils]: 62: Hoare triple {17916#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17917#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:39,111 INFO L273 TraceCheckUtils]: 63: Hoare triple {17917#(<= main_~i~1 19)} assume true; {17917#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:39,112 INFO L273 TraceCheckUtils]: 64: Hoare triple {17917#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17917#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:39,112 INFO L273 TraceCheckUtils]: 65: Hoare triple {17917#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17918#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:39,113 INFO L273 TraceCheckUtils]: 66: Hoare triple {17918#(<= main_~i~1 20)} assume true; {17918#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:39,113 INFO L273 TraceCheckUtils]: 67: Hoare triple {17918#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17918#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:39,114 INFO L273 TraceCheckUtils]: 68: Hoare triple {17918#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17919#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:39,114 INFO L273 TraceCheckUtils]: 69: Hoare triple {17919#(<= main_~i~1 21)} assume true; {17919#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:39,115 INFO L273 TraceCheckUtils]: 70: Hoare triple {17919#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17919#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:39,116 INFO L273 TraceCheckUtils]: 71: Hoare triple {17919#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17920#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:39,116 INFO L273 TraceCheckUtils]: 72: Hoare triple {17920#(<= main_~i~1 22)} assume true; {17920#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:39,117 INFO L273 TraceCheckUtils]: 73: Hoare triple {17920#(<= main_~i~1 22)} assume !(~i~1 < 100); {17897#false} is VALID [2018-11-14 17:07:39,117 INFO L256 TraceCheckUtils]: 74: Hoare triple {17897#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {17896#true} is VALID [2018-11-14 17:07:39,117 INFO L273 TraceCheckUtils]: 75: Hoare triple {17896#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17896#true} is VALID [2018-11-14 17:07:39,117 INFO L273 TraceCheckUtils]: 76: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,118 INFO L273 TraceCheckUtils]: 77: Hoare triple {17896#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:07:39,118 INFO L273 TraceCheckUtils]: 78: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:07:39,118 INFO L273 TraceCheckUtils]: 79: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,118 INFO L273 TraceCheckUtils]: 80: Hoare triple {17896#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:07:39,118 INFO L273 TraceCheckUtils]: 81: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:07:39,118 INFO L273 TraceCheckUtils]: 82: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,119 INFO L273 TraceCheckUtils]: 83: Hoare triple {17896#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:07:39,119 INFO L273 TraceCheckUtils]: 84: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:07:39,119 INFO L273 TraceCheckUtils]: 85: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,119 INFO L273 TraceCheckUtils]: 86: Hoare triple {17896#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:07:39,119 INFO L273 TraceCheckUtils]: 87: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:07:39,119 INFO L273 TraceCheckUtils]: 88: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,120 INFO L273 TraceCheckUtils]: 89: Hoare triple {17896#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:07:39,120 INFO L273 TraceCheckUtils]: 90: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:07:39,120 INFO L273 TraceCheckUtils]: 91: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,120 INFO L273 TraceCheckUtils]: 92: Hoare triple {17896#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:07:39,120 INFO L273 TraceCheckUtils]: 93: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:07:39,121 INFO L273 TraceCheckUtils]: 94: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,121 INFO L273 TraceCheckUtils]: 95: Hoare triple {17896#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:07:39,121 INFO L273 TraceCheckUtils]: 96: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:07:39,121 INFO L273 TraceCheckUtils]: 97: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,121 INFO L273 TraceCheckUtils]: 98: Hoare triple {17896#true} assume !(~i~0 < 100); {17896#true} is VALID [2018-11-14 17:07:39,121 INFO L273 TraceCheckUtils]: 99: Hoare triple {17896#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17896#true} is VALID [2018-11-14 17:07:39,122 INFO L273 TraceCheckUtils]: 100: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,122 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {17896#true} {17897#false} #73#return; {17897#false} is VALID [2018-11-14 17:07:39,122 INFO L273 TraceCheckUtils]: 102: Hoare triple {17897#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {17897#false} is VALID [2018-11-14 17:07:39,122 INFO L256 TraceCheckUtils]: 103: Hoare triple {17897#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {17896#true} is VALID [2018-11-14 17:07:39,122 INFO L273 TraceCheckUtils]: 104: Hoare triple {17896#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17896#true} is VALID [2018-11-14 17:07:39,122 INFO L273 TraceCheckUtils]: 105: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,122 INFO L273 TraceCheckUtils]: 106: Hoare triple {17896#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:07:39,123 INFO L273 TraceCheckUtils]: 107: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:07:39,123 INFO L273 TraceCheckUtils]: 108: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,123 INFO L273 TraceCheckUtils]: 109: Hoare triple {17896#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:07:39,123 INFO L273 TraceCheckUtils]: 110: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:07:39,123 INFO L273 TraceCheckUtils]: 111: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,123 INFO L273 TraceCheckUtils]: 112: Hoare triple {17896#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:07:39,123 INFO L273 TraceCheckUtils]: 113: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:07:39,123 INFO L273 TraceCheckUtils]: 114: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,123 INFO L273 TraceCheckUtils]: 115: Hoare triple {17896#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:07:39,123 INFO L273 TraceCheckUtils]: 116: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:07:39,124 INFO L273 TraceCheckUtils]: 117: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,124 INFO L273 TraceCheckUtils]: 118: Hoare triple {17896#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:07:39,124 INFO L273 TraceCheckUtils]: 119: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:07:39,124 INFO L273 TraceCheckUtils]: 120: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,124 INFO L273 TraceCheckUtils]: 121: Hoare triple {17896#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:07:39,124 INFO L273 TraceCheckUtils]: 122: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:07:39,124 INFO L273 TraceCheckUtils]: 123: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,124 INFO L273 TraceCheckUtils]: 124: Hoare triple {17896#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:07:39,124 INFO L273 TraceCheckUtils]: 125: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:07:39,125 INFO L273 TraceCheckUtils]: 126: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,125 INFO L273 TraceCheckUtils]: 127: Hoare triple {17896#true} assume !(~i~0 < 100); {17896#true} is VALID [2018-11-14 17:07:39,125 INFO L273 TraceCheckUtils]: 128: Hoare triple {17896#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17896#true} is VALID [2018-11-14 17:07:39,125 INFO L273 TraceCheckUtils]: 129: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,125 INFO L268 TraceCheckUtils]: 130: Hoare quadruple {17896#true} {17897#false} #75#return; {17897#false} is VALID [2018-11-14 17:07:39,125 INFO L273 TraceCheckUtils]: 131: Hoare triple {17897#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {17897#false} is VALID [2018-11-14 17:07:39,125 INFO L273 TraceCheckUtils]: 132: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,125 INFO L273 TraceCheckUtils]: 133: Hoare triple {17897#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 17:07:39,125 INFO L273 TraceCheckUtils]: 134: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 17:07:39,125 INFO L273 TraceCheckUtils]: 135: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,126 INFO L273 TraceCheckUtils]: 136: Hoare triple {17897#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 17:07:39,126 INFO L273 TraceCheckUtils]: 137: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 17:07:39,126 INFO L273 TraceCheckUtils]: 138: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,126 INFO L273 TraceCheckUtils]: 139: Hoare triple {17897#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 17:07:39,126 INFO L273 TraceCheckUtils]: 140: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 17:07:39,126 INFO L273 TraceCheckUtils]: 141: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,126 INFO L273 TraceCheckUtils]: 142: Hoare triple {17897#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 17:07:39,126 INFO L273 TraceCheckUtils]: 143: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 17:07:39,126 INFO L273 TraceCheckUtils]: 144: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,127 INFO L273 TraceCheckUtils]: 145: Hoare triple {17897#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 17:07:39,127 INFO L273 TraceCheckUtils]: 146: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 17:07:39,127 INFO L273 TraceCheckUtils]: 147: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,127 INFO L273 TraceCheckUtils]: 148: Hoare triple {17897#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 17:07:39,127 INFO L273 TraceCheckUtils]: 149: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 17:07:39,127 INFO L273 TraceCheckUtils]: 150: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,127 INFO L273 TraceCheckUtils]: 151: Hoare triple {17897#false} assume !(~i~2 < 99); {17897#false} is VALID [2018-11-14 17:07:39,127 INFO L273 TraceCheckUtils]: 152: Hoare triple {17897#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {17897#false} is VALID [2018-11-14 17:07:39,127 INFO L256 TraceCheckUtils]: 153: Hoare triple {17897#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {17896#true} is VALID [2018-11-14 17:07:39,127 INFO L273 TraceCheckUtils]: 154: Hoare triple {17896#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17896#true} is VALID [2018-11-14 17:07:39,128 INFO L273 TraceCheckUtils]: 155: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,128 INFO L273 TraceCheckUtils]: 156: Hoare triple {17896#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:07:39,128 INFO L273 TraceCheckUtils]: 157: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:07:39,128 INFO L273 TraceCheckUtils]: 158: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,128 INFO L273 TraceCheckUtils]: 159: Hoare triple {17896#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:07:39,128 INFO L273 TraceCheckUtils]: 160: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:07:39,128 INFO L273 TraceCheckUtils]: 161: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,128 INFO L273 TraceCheckUtils]: 162: Hoare triple {17896#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:07:39,128 INFO L273 TraceCheckUtils]: 163: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:07:39,128 INFO L273 TraceCheckUtils]: 164: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,129 INFO L273 TraceCheckUtils]: 165: Hoare triple {17896#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:07:39,129 INFO L273 TraceCheckUtils]: 166: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:07:39,129 INFO L273 TraceCheckUtils]: 167: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,129 INFO L273 TraceCheckUtils]: 168: Hoare triple {17896#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:07:39,129 INFO L273 TraceCheckUtils]: 169: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:07:39,129 INFO L273 TraceCheckUtils]: 170: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,129 INFO L273 TraceCheckUtils]: 171: Hoare triple {17896#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:07:39,129 INFO L273 TraceCheckUtils]: 172: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:07:39,129 INFO L273 TraceCheckUtils]: 173: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,130 INFO L273 TraceCheckUtils]: 174: Hoare triple {17896#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 17:07:39,130 INFO L273 TraceCheckUtils]: 175: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 17:07:39,130 INFO L273 TraceCheckUtils]: 176: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,130 INFO L273 TraceCheckUtils]: 177: Hoare triple {17896#true} assume !(~i~0 < 100); {17896#true} is VALID [2018-11-14 17:07:39,130 INFO L273 TraceCheckUtils]: 178: Hoare triple {17896#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17896#true} is VALID [2018-11-14 17:07:39,130 INFO L273 TraceCheckUtils]: 179: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,130 INFO L268 TraceCheckUtils]: 180: Hoare quadruple {17896#true} {17897#false} #77#return; {17897#false} is VALID [2018-11-14 17:07:39,130 INFO L273 TraceCheckUtils]: 181: Hoare triple {17897#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {17897#false} is VALID [2018-11-14 17:07:39,130 INFO L273 TraceCheckUtils]: 182: Hoare triple {17897#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {17897#false} is VALID [2018-11-14 17:07:39,130 INFO L273 TraceCheckUtils]: 183: Hoare triple {17897#false} assume !false; {17897#false} is VALID [2018-11-14 17:07:39,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2018-11-14 17:07:39,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:39,146 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:07:39,154 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:07:39,218 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:07:39,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:39,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:39,541 INFO L256 TraceCheckUtils]: 0: Hoare triple {17896#true} call ULTIMATE.init(); {17896#true} is VALID [2018-11-14 17:07:39,541 INFO L273 TraceCheckUtils]: 1: Hoare triple {17896#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17896#true} is VALID [2018-11-14 17:07:39,542 INFO L273 TraceCheckUtils]: 2: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 17:07:39,542 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17896#true} {17896#true} #69#return; {17896#true} is VALID [2018-11-14 17:07:39,542 INFO L256 TraceCheckUtils]: 4: Hoare triple {17896#true} call #t~ret13 := main(); {17896#true} is VALID [2018-11-14 17:07:39,542 INFO L273 TraceCheckUtils]: 5: Hoare triple {17896#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {17939#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:39,543 INFO L273 TraceCheckUtils]: 6: Hoare triple {17939#(<= main_~i~1 0)} assume true; {17939#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:39,543 INFO L273 TraceCheckUtils]: 7: Hoare triple {17939#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17939#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:39,543 INFO L273 TraceCheckUtils]: 8: Hoare triple {17939#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17899#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:39,544 INFO L273 TraceCheckUtils]: 9: Hoare triple {17899#(<= main_~i~1 1)} assume true; {17899#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:39,544 INFO L273 TraceCheckUtils]: 10: Hoare triple {17899#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17899#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:39,544 INFO L273 TraceCheckUtils]: 11: Hoare triple {17899#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17900#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:39,545 INFO L273 TraceCheckUtils]: 12: Hoare triple {17900#(<= main_~i~1 2)} assume true; {17900#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:39,545 INFO L273 TraceCheckUtils]: 13: Hoare triple {17900#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17900#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:39,546 INFO L273 TraceCheckUtils]: 14: Hoare triple {17900#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17901#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:39,546 INFO L273 TraceCheckUtils]: 15: Hoare triple {17901#(<= main_~i~1 3)} assume true; {17901#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:39,546 INFO L273 TraceCheckUtils]: 16: Hoare triple {17901#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17901#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:39,547 INFO L273 TraceCheckUtils]: 17: Hoare triple {17901#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17902#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:39,548 INFO L273 TraceCheckUtils]: 18: Hoare triple {17902#(<= main_~i~1 4)} assume true; {17902#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:39,548 INFO L273 TraceCheckUtils]: 19: Hoare triple {17902#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17902#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:39,549 INFO L273 TraceCheckUtils]: 20: Hoare triple {17902#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17903#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:39,549 INFO L273 TraceCheckUtils]: 21: Hoare triple {17903#(<= main_~i~1 5)} assume true; {17903#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:39,550 INFO L273 TraceCheckUtils]: 22: Hoare triple {17903#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17903#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:39,550 INFO L273 TraceCheckUtils]: 23: Hoare triple {17903#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17904#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:39,551 INFO L273 TraceCheckUtils]: 24: Hoare triple {17904#(<= main_~i~1 6)} assume true; {17904#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:39,552 INFO L273 TraceCheckUtils]: 25: Hoare triple {17904#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17904#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:39,552 INFO L273 TraceCheckUtils]: 26: Hoare triple {17904#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17905#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:39,553 INFO L273 TraceCheckUtils]: 27: Hoare triple {17905#(<= main_~i~1 7)} assume true; {17905#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:39,553 INFO L273 TraceCheckUtils]: 28: Hoare triple {17905#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17905#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:39,554 INFO L273 TraceCheckUtils]: 29: Hoare triple {17905#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17906#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:39,554 INFO L273 TraceCheckUtils]: 30: Hoare triple {17906#(<= main_~i~1 8)} assume true; {17906#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:39,555 INFO L273 TraceCheckUtils]: 31: Hoare triple {17906#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17906#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:39,556 INFO L273 TraceCheckUtils]: 32: Hoare triple {17906#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17907#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:39,556 INFO L273 TraceCheckUtils]: 33: Hoare triple {17907#(<= main_~i~1 9)} assume true; {17907#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:39,557 INFO L273 TraceCheckUtils]: 34: Hoare triple {17907#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17907#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:39,557 INFO L273 TraceCheckUtils]: 35: Hoare triple {17907#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17908#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:39,558 INFO L273 TraceCheckUtils]: 36: Hoare triple {17908#(<= main_~i~1 10)} assume true; {17908#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:39,558 INFO L273 TraceCheckUtils]: 37: Hoare triple {17908#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17908#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:39,559 INFO L273 TraceCheckUtils]: 38: Hoare triple {17908#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17909#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:39,560 INFO L273 TraceCheckUtils]: 39: Hoare triple {17909#(<= main_~i~1 11)} assume true; {17909#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:39,560 INFO L273 TraceCheckUtils]: 40: Hoare triple {17909#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17909#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:39,561 INFO L273 TraceCheckUtils]: 41: Hoare triple {17909#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17910#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:39,561 INFO L273 TraceCheckUtils]: 42: Hoare triple {17910#(<= main_~i~1 12)} assume true; {17910#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:39,562 INFO L273 TraceCheckUtils]: 43: Hoare triple {17910#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17910#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:39,563 INFO L273 TraceCheckUtils]: 44: Hoare triple {17910#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17911#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:39,563 INFO L273 TraceCheckUtils]: 45: Hoare triple {17911#(<= main_~i~1 13)} assume true; {17911#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:39,564 INFO L273 TraceCheckUtils]: 46: Hoare triple {17911#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17911#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:39,564 INFO L273 TraceCheckUtils]: 47: Hoare triple {17911#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17912#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:39,565 INFO L273 TraceCheckUtils]: 48: Hoare triple {17912#(<= main_~i~1 14)} assume true; {17912#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:39,565 INFO L273 TraceCheckUtils]: 49: Hoare triple {17912#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17912#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:39,566 INFO L273 TraceCheckUtils]: 50: Hoare triple {17912#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17913#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:39,567 INFO L273 TraceCheckUtils]: 51: Hoare triple {17913#(<= main_~i~1 15)} assume true; {17913#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:39,567 INFO L273 TraceCheckUtils]: 52: Hoare triple {17913#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17913#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:39,568 INFO L273 TraceCheckUtils]: 53: Hoare triple {17913#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17914#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:39,568 INFO L273 TraceCheckUtils]: 54: Hoare triple {17914#(<= main_~i~1 16)} assume true; {17914#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:39,569 INFO L273 TraceCheckUtils]: 55: Hoare triple {17914#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17914#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:39,570 INFO L273 TraceCheckUtils]: 56: Hoare triple {17914#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17915#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:39,570 INFO L273 TraceCheckUtils]: 57: Hoare triple {17915#(<= main_~i~1 17)} assume true; {17915#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:39,571 INFO L273 TraceCheckUtils]: 58: Hoare triple {17915#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17915#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:39,571 INFO L273 TraceCheckUtils]: 59: Hoare triple {17915#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17916#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:39,572 INFO L273 TraceCheckUtils]: 60: Hoare triple {17916#(<= main_~i~1 18)} assume true; {17916#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:39,572 INFO L273 TraceCheckUtils]: 61: Hoare triple {17916#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17916#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:39,573 INFO L273 TraceCheckUtils]: 62: Hoare triple {17916#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17917#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:39,574 INFO L273 TraceCheckUtils]: 63: Hoare triple {17917#(<= main_~i~1 19)} assume true; {17917#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:39,574 INFO L273 TraceCheckUtils]: 64: Hoare triple {17917#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17917#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:39,575 INFO L273 TraceCheckUtils]: 65: Hoare triple {17917#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17918#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:39,575 INFO L273 TraceCheckUtils]: 66: Hoare triple {17918#(<= main_~i~1 20)} assume true; {17918#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:39,576 INFO L273 TraceCheckUtils]: 67: Hoare triple {17918#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17918#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:39,576 INFO L273 TraceCheckUtils]: 68: Hoare triple {17918#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17919#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:39,577 INFO L273 TraceCheckUtils]: 69: Hoare triple {17919#(<= main_~i~1 21)} assume true; {17919#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:39,578 INFO L273 TraceCheckUtils]: 70: Hoare triple {17919#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17919#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:39,578 INFO L273 TraceCheckUtils]: 71: Hoare triple {17919#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17920#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:39,579 INFO L273 TraceCheckUtils]: 72: Hoare triple {17920#(<= main_~i~1 22)} assume true; {17920#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:39,579 INFO L273 TraceCheckUtils]: 73: Hoare triple {17920#(<= main_~i~1 22)} assume !(~i~1 < 100); {17897#false} is VALID [2018-11-14 17:07:39,580 INFO L256 TraceCheckUtils]: 74: Hoare triple {17897#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {17897#false} is VALID [2018-11-14 17:07:39,580 INFO L273 TraceCheckUtils]: 75: Hoare triple {17897#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17897#false} is VALID [2018-11-14 17:07:39,580 INFO L273 TraceCheckUtils]: 76: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,580 INFO L273 TraceCheckUtils]: 77: Hoare triple {17897#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:07:39,580 INFO L273 TraceCheckUtils]: 78: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:07:39,581 INFO L273 TraceCheckUtils]: 79: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,581 INFO L273 TraceCheckUtils]: 80: Hoare triple {17897#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:07:39,581 INFO L273 TraceCheckUtils]: 81: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:07:39,581 INFO L273 TraceCheckUtils]: 82: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,581 INFO L273 TraceCheckUtils]: 83: Hoare triple {17897#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:07:39,581 INFO L273 TraceCheckUtils]: 84: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:07:39,582 INFO L273 TraceCheckUtils]: 85: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,582 INFO L273 TraceCheckUtils]: 86: Hoare triple {17897#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:07:39,582 INFO L273 TraceCheckUtils]: 87: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:07:39,582 INFO L273 TraceCheckUtils]: 88: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,582 INFO L273 TraceCheckUtils]: 89: Hoare triple {17897#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:07:39,583 INFO L273 TraceCheckUtils]: 90: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:07:39,583 INFO L273 TraceCheckUtils]: 91: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,583 INFO L273 TraceCheckUtils]: 92: Hoare triple {17897#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:07:39,583 INFO L273 TraceCheckUtils]: 93: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:07:39,583 INFO L273 TraceCheckUtils]: 94: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,583 INFO L273 TraceCheckUtils]: 95: Hoare triple {17897#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:07:39,584 INFO L273 TraceCheckUtils]: 96: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:07:39,584 INFO L273 TraceCheckUtils]: 97: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,584 INFO L273 TraceCheckUtils]: 98: Hoare triple {17897#false} assume !(~i~0 < 100); {17897#false} is VALID [2018-11-14 17:07:39,584 INFO L273 TraceCheckUtils]: 99: Hoare triple {17897#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17897#false} is VALID [2018-11-14 17:07:39,584 INFO L273 TraceCheckUtils]: 100: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,584 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {17897#false} {17897#false} #73#return; {17897#false} is VALID [2018-11-14 17:07:39,585 INFO L273 TraceCheckUtils]: 102: Hoare triple {17897#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {17897#false} is VALID [2018-11-14 17:07:39,585 INFO L256 TraceCheckUtils]: 103: Hoare triple {17897#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {17897#false} is VALID [2018-11-14 17:07:39,585 INFO L273 TraceCheckUtils]: 104: Hoare triple {17897#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17897#false} is VALID [2018-11-14 17:07:39,585 INFO L273 TraceCheckUtils]: 105: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,585 INFO L273 TraceCheckUtils]: 106: Hoare triple {17897#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:07:39,585 INFO L273 TraceCheckUtils]: 107: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:07:39,585 INFO L273 TraceCheckUtils]: 108: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,586 INFO L273 TraceCheckUtils]: 109: Hoare triple {17897#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:07:39,586 INFO L273 TraceCheckUtils]: 110: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:07:39,586 INFO L273 TraceCheckUtils]: 111: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,586 INFO L273 TraceCheckUtils]: 112: Hoare triple {17897#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:07:39,586 INFO L273 TraceCheckUtils]: 113: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:07:39,586 INFO L273 TraceCheckUtils]: 114: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,586 INFO L273 TraceCheckUtils]: 115: Hoare triple {17897#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:07:39,586 INFO L273 TraceCheckUtils]: 116: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:07:39,586 INFO L273 TraceCheckUtils]: 117: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,586 INFO L273 TraceCheckUtils]: 118: Hoare triple {17897#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:07:39,587 INFO L273 TraceCheckUtils]: 119: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:07:39,587 INFO L273 TraceCheckUtils]: 120: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,587 INFO L273 TraceCheckUtils]: 121: Hoare triple {17897#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:07:39,587 INFO L273 TraceCheckUtils]: 122: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:07:39,587 INFO L273 TraceCheckUtils]: 123: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,587 INFO L273 TraceCheckUtils]: 124: Hoare triple {17897#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:07:39,587 INFO L273 TraceCheckUtils]: 125: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:07:39,587 INFO L273 TraceCheckUtils]: 126: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,587 INFO L273 TraceCheckUtils]: 127: Hoare triple {17897#false} assume !(~i~0 < 100); {17897#false} is VALID [2018-11-14 17:07:39,588 INFO L273 TraceCheckUtils]: 128: Hoare triple {17897#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17897#false} is VALID [2018-11-14 17:07:39,588 INFO L273 TraceCheckUtils]: 129: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,588 INFO L268 TraceCheckUtils]: 130: Hoare quadruple {17897#false} {17897#false} #75#return; {17897#false} is VALID [2018-11-14 17:07:39,588 INFO L273 TraceCheckUtils]: 131: Hoare triple {17897#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {17897#false} is VALID [2018-11-14 17:07:39,588 INFO L273 TraceCheckUtils]: 132: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,588 INFO L273 TraceCheckUtils]: 133: Hoare triple {17897#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 17:07:39,588 INFO L273 TraceCheckUtils]: 134: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 17:07:39,588 INFO L273 TraceCheckUtils]: 135: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,588 INFO L273 TraceCheckUtils]: 136: Hoare triple {17897#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 17:07:39,588 INFO L273 TraceCheckUtils]: 137: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 17:07:39,589 INFO L273 TraceCheckUtils]: 138: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,589 INFO L273 TraceCheckUtils]: 139: Hoare triple {17897#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 17:07:39,589 INFO L273 TraceCheckUtils]: 140: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 17:07:39,589 INFO L273 TraceCheckUtils]: 141: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,589 INFO L273 TraceCheckUtils]: 142: Hoare triple {17897#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 17:07:39,589 INFO L273 TraceCheckUtils]: 143: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 17:07:39,589 INFO L273 TraceCheckUtils]: 144: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,589 INFO L273 TraceCheckUtils]: 145: Hoare triple {17897#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 17:07:39,589 INFO L273 TraceCheckUtils]: 146: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 17:07:39,590 INFO L273 TraceCheckUtils]: 147: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,590 INFO L273 TraceCheckUtils]: 148: Hoare triple {17897#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 17:07:39,590 INFO L273 TraceCheckUtils]: 149: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 17:07:39,590 INFO L273 TraceCheckUtils]: 150: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,590 INFO L273 TraceCheckUtils]: 151: Hoare triple {17897#false} assume !(~i~2 < 99); {17897#false} is VALID [2018-11-14 17:07:39,590 INFO L273 TraceCheckUtils]: 152: Hoare triple {17897#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {17897#false} is VALID [2018-11-14 17:07:39,590 INFO L256 TraceCheckUtils]: 153: Hoare triple {17897#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {17897#false} is VALID [2018-11-14 17:07:39,590 INFO L273 TraceCheckUtils]: 154: Hoare triple {17897#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17897#false} is VALID [2018-11-14 17:07:39,590 INFO L273 TraceCheckUtils]: 155: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,590 INFO L273 TraceCheckUtils]: 156: Hoare triple {17897#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:07:39,591 INFO L273 TraceCheckUtils]: 157: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:07:39,591 INFO L273 TraceCheckUtils]: 158: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,591 INFO L273 TraceCheckUtils]: 159: Hoare triple {17897#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:07:39,591 INFO L273 TraceCheckUtils]: 160: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:07:39,591 INFO L273 TraceCheckUtils]: 161: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,591 INFO L273 TraceCheckUtils]: 162: Hoare triple {17897#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:07:39,591 INFO L273 TraceCheckUtils]: 163: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:07:39,591 INFO L273 TraceCheckUtils]: 164: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,591 INFO L273 TraceCheckUtils]: 165: Hoare triple {17897#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:07:39,592 INFO L273 TraceCheckUtils]: 166: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:07:39,592 INFO L273 TraceCheckUtils]: 167: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,592 INFO L273 TraceCheckUtils]: 168: Hoare triple {17897#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:07:39,592 INFO L273 TraceCheckUtils]: 169: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:07:39,592 INFO L273 TraceCheckUtils]: 170: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,592 INFO L273 TraceCheckUtils]: 171: Hoare triple {17897#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:07:39,592 INFO L273 TraceCheckUtils]: 172: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:07:39,592 INFO L273 TraceCheckUtils]: 173: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,592 INFO L273 TraceCheckUtils]: 174: Hoare triple {17897#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 17:07:39,592 INFO L273 TraceCheckUtils]: 175: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 17:07:39,593 INFO L273 TraceCheckUtils]: 176: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,593 INFO L273 TraceCheckUtils]: 177: Hoare triple {17897#false} assume !(~i~0 < 100); {17897#false} is VALID [2018-11-14 17:07:39,593 INFO L273 TraceCheckUtils]: 178: Hoare triple {17897#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17897#false} is VALID [2018-11-14 17:07:39,593 INFO L273 TraceCheckUtils]: 179: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 17:07:39,593 INFO L268 TraceCheckUtils]: 180: Hoare quadruple {17897#false} {17897#false} #77#return; {17897#false} is VALID [2018-11-14 17:07:39,593 INFO L273 TraceCheckUtils]: 181: Hoare triple {17897#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {17897#false} is VALID [2018-11-14 17:07:39,593 INFO L273 TraceCheckUtils]: 182: Hoare triple {17897#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {17897#false} is VALID [2018-11-14 17:07:39,593 INFO L273 TraceCheckUtils]: 183: Hoare triple {17897#false} assume !false; {17897#false} is VALID [2018-11-14 17:07:39,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2018-11-14 17:07:39,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:39,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-14 17:07:39,629 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 184 [2018-11-14 17:07:39,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:39,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 17:07:39,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:39,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 17:07:39,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 17:07:39,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-14 17:07:39,740 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 26 states. [2018-11-14 17:07:40,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:40,131 INFO L93 Difference]: Finished difference Result 192 states and 200 transitions. [2018-11-14 17:07:40,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 17:07:40,132 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 184 [2018-11-14 17:07:40,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:40,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:07:40,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 126 transitions. [2018-11-14 17:07:40,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:07:40,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 126 transitions. [2018-11-14 17:07:40,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 126 transitions. [2018-11-14 17:07:40,277 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:40,280 INFO L225 Difference]: With dead ends: 192 [2018-11-14 17:07:40,280 INFO L226 Difference]: Without dead ends: 135 [2018-11-14 17:07:40,281 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-14 17:07:40,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-14 17:07:40,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-11-14 17:07:40,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:40,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand 134 states. [2018-11-14 17:07:40,325 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 134 states. [2018-11-14 17:07:40,325 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 134 states. [2018-11-14 17:07:40,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:40,327 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2018-11-14 17:07:40,327 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-11-14 17:07:40,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:40,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:40,328 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 135 states. [2018-11-14 17:07:40,328 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 135 states. [2018-11-14 17:07:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:40,331 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2018-11-14 17:07:40,331 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-11-14 17:07:40,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:40,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:40,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:40,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:40,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-14 17:07:40,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 138 transitions. [2018-11-14 17:07:40,334 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 138 transitions. Word has length 184 [2018-11-14 17:07:40,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:40,335 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 138 transitions. [2018-11-14 17:07:40,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 17:07:40,335 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 138 transitions. [2018-11-14 17:07:40,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-14 17:07:40,336 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:40,337 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 21, 21, 7, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:07:40,337 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:40,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:40,337 INFO L82 PathProgramCache]: Analyzing trace with hash 644913055, now seen corresponding path program 23 times [2018-11-14 17:07:40,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:40,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:40,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:40,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:40,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:41,196 INFO L256 TraceCheckUtils]: 0: Hoare triple {19182#true} call ULTIMATE.init(); {19182#true} is VALID [2018-11-14 17:07:41,197 INFO L273 TraceCheckUtils]: 1: Hoare triple {19182#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19182#true} is VALID [2018-11-14 17:07:41,197 INFO L273 TraceCheckUtils]: 2: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:41,197 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19182#true} {19182#true} #69#return; {19182#true} is VALID [2018-11-14 17:07:41,197 INFO L256 TraceCheckUtils]: 4: Hoare triple {19182#true} call #t~ret13 := main(); {19182#true} is VALID [2018-11-14 17:07:41,198 INFO L273 TraceCheckUtils]: 5: Hoare triple {19182#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {19184#(= main_~i~1 0)} is VALID [2018-11-14 17:07:41,198 INFO L273 TraceCheckUtils]: 6: Hoare triple {19184#(= main_~i~1 0)} assume true; {19184#(= main_~i~1 0)} is VALID [2018-11-14 17:07:41,199 INFO L273 TraceCheckUtils]: 7: Hoare triple {19184#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19184#(= main_~i~1 0)} is VALID [2018-11-14 17:07:41,199 INFO L273 TraceCheckUtils]: 8: Hoare triple {19184#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19185#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:41,200 INFO L273 TraceCheckUtils]: 9: Hoare triple {19185#(<= main_~i~1 1)} assume true; {19185#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:41,200 INFO L273 TraceCheckUtils]: 10: Hoare triple {19185#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19185#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:41,200 INFO L273 TraceCheckUtils]: 11: Hoare triple {19185#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19186#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:41,201 INFO L273 TraceCheckUtils]: 12: Hoare triple {19186#(<= main_~i~1 2)} assume true; {19186#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:41,201 INFO L273 TraceCheckUtils]: 13: Hoare triple {19186#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19186#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:41,201 INFO L273 TraceCheckUtils]: 14: Hoare triple {19186#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19187#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:41,202 INFO L273 TraceCheckUtils]: 15: Hoare triple {19187#(<= main_~i~1 3)} assume true; {19187#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:41,202 INFO L273 TraceCheckUtils]: 16: Hoare triple {19187#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19187#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:41,203 INFO L273 TraceCheckUtils]: 17: Hoare triple {19187#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19188#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:41,204 INFO L273 TraceCheckUtils]: 18: Hoare triple {19188#(<= main_~i~1 4)} assume true; {19188#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:41,204 INFO L273 TraceCheckUtils]: 19: Hoare triple {19188#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19188#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:41,205 INFO L273 TraceCheckUtils]: 20: Hoare triple {19188#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19189#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:41,205 INFO L273 TraceCheckUtils]: 21: Hoare triple {19189#(<= main_~i~1 5)} assume true; {19189#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:41,214 INFO L273 TraceCheckUtils]: 22: Hoare triple {19189#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19189#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:41,214 INFO L273 TraceCheckUtils]: 23: Hoare triple {19189#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19190#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:41,215 INFO L273 TraceCheckUtils]: 24: Hoare triple {19190#(<= main_~i~1 6)} assume true; {19190#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:41,215 INFO L273 TraceCheckUtils]: 25: Hoare triple {19190#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19190#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:41,215 INFO L273 TraceCheckUtils]: 26: Hoare triple {19190#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19191#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:41,216 INFO L273 TraceCheckUtils]: 27: Hoare triple {19191#(<= main_~i~1 7)} assume true; {19191#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:41,216 INFO L273 TraceCheckUtils]: 28: Hoare triple {19191#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19191#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:41,217 INFO L273 TraceCheckUtils]: 29: Hoare triple {19191#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19192#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:41,217 INFO L273 TraceCheckUtils]: 30: Hoare triple {19192#(<= main_~i~1 8)} assume true; {19192#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:41,217 INFO L273 TraceCheckUtils]: 31: Hoare triple {19192#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19192#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:41,218 INFO L273 TraceCheckUtils]: 32: Hoare triple {19192#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19193#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:41,218 INFO L273 TraceCheckUtils]: 33: Hoare triple {19193#(<= main_~i~1 9)} assume true; {19193#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:41,219 INFO L273 TraceCheckUtils]: 34: Hoare triple {19193#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19193#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:41,220 INFO L273 TraceCheckUtils]: 35: Hoare triple {19193#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19194#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:41,220 INFO L273 TraceCheckUtils]: 36: Hoare triple {19194#(<= main_~i~1 10)} assume true; {19194#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:41,221 INFO L273 TraceCheckUtils]: 37: Hoare triple {19194#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19194#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:41,221 INFO L273 TraceCheckUtils]: 38: Hoare triple {19194#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19195#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:41,222 INFO L273 TraceCheckUtils]: 39: Hoare triple {19195#(<= main_~i~1 11)} assume true; {19195#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:41,222 INFO L273 TraceCheckUtils]: 40: Hoare triple {19195#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19195#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:41,223 INFO L273 TraceCheckUtils]: 41: Hoare triple {19195#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19196#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:41,224 INFO L273 TraceCheckUtils]: 42: Hoare triple {19196#(<= main_~i~1 12)} assume true; {19196#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:41,224 INFO L273 TraceCheckUtils]: 43: Hoare triple {19196#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19196#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:41,225 INFO L273 TraceCheckUtils]: 44: Hoare triple {19196#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19197#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:41,225 INFO L273 TraceCheckUtils]: 45: Hoare triple {19197#(<= main_~i~1 13)} assume true; {19197#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:41,226 INFO L273 TraceCheckUtils]: 46: Hoare triple {19197#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19197#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:41,227 INFO L273 TraceCheckUtils]: 47: Hoare triple {19197#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19198#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:41,227 INFO L273 TraceCheckUtils]: 48: Hoare triple {19198#(<= main_~i~1 14)} assume true; {19198#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:41,228 INFO L273 TraceCheckUtils]: 49: Hoare triple {19198#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19198#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:41,228 INFO L273 TraceCheckUtils]: 50: Hoare triple {19198#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19199#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:41,229 INFO L273 TraceCheckUtils]: 51: Hoare triple {19199#(<= main_~i~1 15)} assume true; {19199#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:41,229 INFO L273 TraceCheckUtils]: 52: Hoare triple {19199#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19199#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:41,230 INFO L273 TraceCheckUtils]: 53: Hoare triple {19199#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19200#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:41,230 INFO L273 TraceCheckUtils]: 54: Hoare triple {19200#(<= main_~i~1 16)} assume true; {19200#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:41,231 INFO L273 TraceCheckUtils]: 55: Hoare triple {19200#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19200#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:41,231 INFO L273 TraceCheckUtils]: 56: Hoare triple {19200#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19201#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:41,232 INFO L273 TraceCheckUtils]: 57: Hoare triple {19201#(<= main_~i~1 17)} assume true; {19201#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:41,232 INFO L273 TraceCheckUtils]: 58: Hoare triple {19201#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19201#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:41,233 INFO L273 TraceCheckUtils]: 59: Hoare triple {19201#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19202#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:41,234 INFO L273 TraceCheckUtils]: 60: Hoare triple {19202#(<= main_~i~1 18)} assume true; {19202#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:41,234 INFO L273 TraceCheckUtils]: 61: Hoare triple {19202#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19202#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:41,235 INFO L273 TraceCheckUtils]: 62: Hoare triple {19202#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19203#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:41,235 INFO L273 TraceCheckUtils]: 63: Hoare triple {19203#(<= main_~i~1 19)} assume true; {19203#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:41,236 INFO L273 TraceCheckUtils]: 64: Hoare triple {19203#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19203#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:41,236 INFO L273 TraceCheckUtils]: 65: Hoare triple {19203#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19204#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:41,237 INFO L273 TraceCheckUtils]: 66: Hoare triple {19204#(<= main_~i~1 20)} assume true; {19204#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:41,237 INFO L273 TraceCheckUtils]: 67: Hoare triple {19204#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19204#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:41,238 INFO L273 TraceCheckUtils]: 68: Hoare triple {19204#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19205#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:41,238 INFO L273 TraceCheckUtils]: 69: Hoare triple {19205#(<= main_~i~1 21)} assume true; {19205#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:41,239 INFO L273 TraceCheckUtils]: 70: Hoare triple {19205#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19205#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:41,240 INFO L273 TraceCheckUtils]: 71: Hoare triple {19205#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19206#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:41,240 INFO L273 TraceCheckUtils]: 72: Hoare triple {19206#(<= main_~i~1 22)} assume true; {19206#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:41,241 INFO L273 TraceCheckUtils]: 73: Hoare triple {19206#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19206#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:41,241 INFO L273 TraceCheckUtils]: 74: Hoare triple {19206#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19207#(<= main_~i~1 23)} is VALID [2018-11-14 17:07:41,242 INFO L273 TraceCheckUtils]: 75: Hoare triple {19207#(<= main_~i~1 23)} assume true; {19207#(<= main_~i~1 23)} is VALID [2018-11-14 17:07:41,242 INFO L273 TraceCheckUtils]: 76: Hoare triple {19207#(<= main_~i~1 23)} assume !(~i~1 < 100); {19183#false} is VALID [2018-11-14 17:07:41,243 INFO L256 TraceCheckUtils]: 77: Hoare triple {19183#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {19182#true} is VALID [2018-11-14 17:07:41,243 INFO L273 TraceCheckUtils]: 78: Hoare triple {19182#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19182#true} is VALID [2018-11-14 17:07:41,243 INFO L273 TraceCheckUtils]: 79: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:41,243 INFO L273 TraceCheckUtils]: 80: Hoare triple {19182#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:07:41,243 INFO L273 TraceCheckUtils]: 81: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:07:41,243 INFO L273 TraceCheckUtils]: 82: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:41,244 INFO L273 TraceCheckUtils]: 83: Hoare triple {19182#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:07:41,244 INFO L273 TraceCheckUtils]: 84: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:07:41,244 INFO L273 TraceCheckUtils]: 85: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:41,244 INFO L273 TraceCheckUtils]: 86: Hoare triple {19182#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:07:41,244 INFO L273 TraceCheckUtils]: 87: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:07:41,244 INFO L273 TraceCheckUtils]: 88: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:41,245 INFO L273 TraceCheckUtils]: 89: Hoare triple {19182#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:07:41,245 INFO L273 TraceCheckUtils]: 90: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:07:41,245 INFO L273 TraceCheckUtils]: 91: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:41,245 INFO L273 TraceCheckUtils]: 92: Hoare triple {19182#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:07:41,245 INFO L273 TraceCheckUtils]: 93: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:07:41,245 INFO L273 TraceCheckUtils]: 94: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:41,246 INFO L273 TraceCheckUtils]: 95: Hoare triple {19182#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:07:41,246 INFO L273 TraceCheckUtils]: 96: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:07:41,246 INFO L273 TraceCheckUtils]: 97: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:41,246 INFO L273 TraceCheckUtils]: 98: Hoare triple {19182#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:07:41,246 INFO L273 TraceCheckUtils]: 99: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:07:41,246 INFO L273 TraceCheckUtils]: 100: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:41,247 INFO L273 TraceCheckUtils]: 101: Hoare triple {19182#true} assume !(~i~0 < 100); {19182#true} is VALID [2018-11-14 17:07:41,247 INFO L273 TraceCheckUtils]: 102: Hoare triple {19182#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19182#true} is VALID [2018-11-14 17:07:41,247 INFO L273 TraceCheckUtils]: 103: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:41,247 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {19182#true} {19183#false} #73#return; {19183#false} is VALID [2018-11-14 17:07:41,247 INFO L273 TraceCheckUtils]: 105: Hoare triple {19183#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {19183#false} is VALID [2018-11-14 17:07:41,247 INFO L256 TraceCheckUtils]: 106: Hoare triple {19183#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {19182#true} is VALID [2018-11-14 17:07:41,248 INFO L273 TraceCheckUtils]: 107: Hoare triple {19182#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19182#true} is VALID [2018-11-14 17:07:41,248 INFO L273 TraceCheckUtils]: 108: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:41,248 INFO L273 TraceCheckUtils]: 109: Hoare triple {19182#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:07:41,248 INFO L273 TraceCheckUtils]: 110: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:07:41,248 INFO L273 TraceCheckUtils]: 111: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:41,248 INFO L273 TraceCheckUtils]: 112: Hoare triple {19182#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:07:41,248 INFO L273 TraceCheckUtils]: 113: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:07:41,249 INFO L273 TraceCheckUtils]: 114: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:41,249 INFO L273 TraceCheckUtils]: 115: Hoare triple {19182#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:07:41,249 INFO L273 TraceCheckUtils]: 116: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:07:41,249 INFO L273 TraceCheckUtils]: 117: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:41,249 INFO L273 TraceCheckUtils]: 118: Hoare triple {19182#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:07:41,249 INFO L273 TraceCheckUtils]: 119: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:07:41,249 INFO L273 TraceCheckUtils]: 120: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:41,249 INFO L273 TraceCheckUtils]: 121: Hoare triple {19182#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:07:41,249 INFO L273 TraceCheckUtils]: 122: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:07:41,250 INFO L273 TraceCheckUtils]: 123: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:41,250 INFO L273 TraceCheckUtils]: 124: Hoare triple {19182#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:07:41,250 INFO L273 TraceCheckUtils]: 125: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:07:41,250 INFO L273 TraceCheckUtils]: 126: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:41,250 INFO L273 TraceCheckUtils]: 127: Hoare triple {19182#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:07:41,250 INFO L273 TraceCheckUtils]: 128: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:07:41,250 INFO L273 TraceCheckUtils]: 129: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:41,250 INFO L273 TraceCheckUtils]: 130: Hoare triple {19182#true} assume !(~i~0 < 100); {19182#true} is VALID [2018-11-14 17:07:41,250 INFO L273 TraceCheckUtils]: 131: Hoare triple {19182#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19182#true} is VALID [2018-11-14 17:07:41,250 INFO L273 TraceCheckUtils]: 132: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:41,251 INFO L268 TraceCheckUtils]: 133: Hoare quadruple {19182#true} {19183#false} #75#return; {19183#false} is VALID [2018-11-14 17:07:41,251 INFO L273 TraceCheckUtils]: 134: Hoare triple {19183#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {19183#false} is VALID [2018-11-14 17:07:41,251 INFO L273 TraceCheckUtils]: 135: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:41,251 INFO L273 TraceCheckUtils]: 136: Hoare triple {19183#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 17:07:41,251 INFO L273 TraceCheckUtils]: 137: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 17:07:41,251 INFO L273 TraceCheckUtils]: 138: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:41,252 INFO L273 TraceCheckUtils]: 139: Hoare triple {19183#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 17:07:41,252 INFO L273 TraceCheckUtils]: 140: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 17:07:41,252 INFO L273 TraceCheckUtils]: 141: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:41,252 INFO L273 TraceCheckUtils]: 142: Hoare triple {19183#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 17:07:41,252 INFO L273 TraceCheckUtils]: 143: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 17:07:41,252 INFO L273 TraceCheckUtils]: 144: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:41,252 INFO L273 TraceCheckUtils]: 145: Hoare triple {19183#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 17:07:41,253 INFO L273 TraceCheckUtils]: 146: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 17:07:41,253 INFO L273 TraceCheckUtils]: 147: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:41,253 INFO L273 TraceCheckUtils]: 148: Hoare triple {19183#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 17:07:41,253 INFO L273 TraceCheckUtils]: 149: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 17:07:41,253 INFO L273 TraceCheckUtils]: 150: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:41,253 INFO L273 TraceCheckUtils]: 151: Hoare triple {19183#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 17:07:41,254 INFO L273 TraceCheckUtils]: 152: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 17:07:41,254 INFO L273 TraceCheckUtils]: 153: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:41,254 INFO L273 TraceCheckUtils]: 154: Hoare triple {19183#false} assume !(~i~2 < 99); {19183#false} is VALID [2018-11-14 17:07:41,254 INFO L273 TraceCheckUtils]: 155: Hoare triple {19183#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {19183#false} is VALID [2018-11-14 17:07:41,254 INFO L256 TraceCheckUtils]: 156: Hoare triple {19183#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {19182#true} is VALID [2018-11-14 17:07:41,254 INFO L273 TraceCheckUtils]: 157: Hoare triple {19182#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19182#true} is VALID [2018-11-14 17:07:41,255 INFO L273 TraceCheckUtils]: 158: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:41,255 INFO L273 TraceCheckUtils]: 159: Hoare triple {19182#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:07:41,255 INFO L273 TraceCheckUtils]: 160: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:07:41,255 INFO L273 TraceCheckUtils]: 161: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:41,255 INFO L273 TraceCheckUtils]: 162: Hoare triple {19182#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:07:41,255 INFO L273 TraceCheckUtils]: 163: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:07:41,256 INFO L273 TraceCheckUtils]: 164: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:41,256 INFO L273 TraceCheckUtils]: 165: Hoare triple {19182#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:07:41,256 INFO L273 TraceCheckUtils]: 166: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:07:41,256 INFO L273 TraceCheckUtils]: 167: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:41,256 INFO L273 TraceCheckUtils]: 168: Hoare triple {19182#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:07:41,256 INFO L273 TraceCheckUtils]: 169: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:07:41,257 INFO L273 TraceCheckUtils]: 170: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:41,257 INFO L273 TraceCheckUtils]: 171: Hoare triple {19182#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:07:41,257 INFO L273 TraceCheckUtils]: 172: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:07:41,257 INFO L273 TraceCheckUtils]: 173: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:41,257 INFO L273 TraceCheckUtils]: 174: Hoare triple {19182#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:07:41,257 INFO L273 TraceCheckUtils]: 175: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:07:41,258 INFO L273 TraceCheckUtils]: 176: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:41,258 INFO L273 TraceCheckUtils]: 177: Hoare triple {19182#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 17:07:41,258 INFO L273 TraceCheckUtils]: 178: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 17:07:41,258 INFO L273 TraceCheckUtils]: 179: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:41,258 INFO L273 TraceCheckUtils]: 180: Hoare triple {19182#true} assume !(~i~0 < 100); {19182#true} is VALID [2018-11-14 17:07:41,258 INFO L273 TraceCheckUtils]: 181: Hoare triple {19182#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19182#true} is VALID [2018-11-14 17:07:41,259 INFO L273 TraceCheckUtils]: 182: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:41,259 INFO L268 TraceCheckUtils]: 183: Hoare quadruple {19182#true} {19183#false} #77#return; {19183#false} is VALID [2018-11-14 17:07:41,259 INFO L273 TraceCheckUtils]: 184: Hoare triple {19183#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {19183#false} is VALID [2018-11-14 17:07:41,259 INFO L273 TraceCheckUtils]: 185: Hoare triple {19183#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {19183#false} is VALID [2018-11-14 17:07:41,259 INFO L273 TraceCheckUtils]: 186: Hoare triple {19183#false} assume !false; {19183#false} is VALID [2018-11-14 17:07:41,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1636 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2018-11-14 17:07:41,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:41,281 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:07:41,298 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:07:46,352 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2018-11-14 17:07:46,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:46,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:48,069 INFO L256 TraceCheckUtils]: 0: Hoare triple {19182#true} call ULTIMATE.init(); {19182#true} is VALID [2018-11-14 17:07:48,069 INFO L273 TraceCheckUtils]: 1: Hoare triple {19182#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19182#true} is VALID [2018-11-14 17:07:48,069 INFO L273 TraceCheckUtils]: 2: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:48,070 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19182#true} {19182#true} #69#return; {19182#true} is VALID [2018-11-14 17:07:48,070 INFO L256 TraceCheckUtils]: 4: Hoare triple {19182#true} call #t~ret13 := main(); {19182#true} is VALID [2018-11-14 17:07:48,070 INFO L273 TraceCheckUtils]: 5: Hoare triple {19182#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {19182#true} is VALID [2018-11-14 17:07:48,070 INFO L273 TraceCheckUtils]: 6: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:48,071 INFO L273 TraceCheckUtils]: 7: Hoare triple {19182#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:07:48,071 INFO L273 TraceCheckUtils]: 8: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:07:48,071 INFO L273 TraceCheckUtils]: 9: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:48,071 INFO L273 TraceCheckUtils]: 10: Hoare triple {19182#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:07:48,071 INFO L273 TraceCheckUtils]: 11: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:07:48,071 INFO L273 TraceCheckUtils]: 12: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:48,072 INFO L273 TraceCheckUtils]: 13: Hoare triple {19182#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:07:48,072 INFO L273 TraceCheckUtils]: 14: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:07:48,072 INFO L273 TraceCheckUtils]: 15: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:48,072 INFO L273 TraceCheckUtils]: 16: Hoare triple {19182#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:07:48,072 INFO L273 TraceCheckUtils]: 17: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:07:48,072 INFO L273 TraceCheckUtils]: 18: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:48,072 INFO L273 TraceCheckUtils]: 19: Hoare triple {19182#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:07:48,073 INFO L273 TraceCheckUtils]: 20: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:07:48,073 INFO L273 TraceCheckUtils]: 21: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:48,073 INFO L273 TraceCheckUtils]: 22: Hoare triple {19182#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:07:48,073 INFO L273 TraceCheckUtils]: 23: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:07:48,073 INFO L273 TraceCheckUtils]: 24: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:48,073 INFO L273 TraceCheckUtils]: 25: Hoare triple {19182#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:07:48,073 INFO L273 TraceCheckUtils]: 26: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:07:48,073 INFO L273 TraceCheckUtils]: 27: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:48,074 INFO L273 TraceCheckUtils]: 28: Hoare triple {19182#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:07:48,074 INFO L273 TraceCheckUtils]: 29: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:07:48,074 INFO L273 TraceCheckUtils]: 30: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:48,074 INFO L273 TraceCheckUtils]: 31: Hoare triple {19182#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:07:48,074 INFO L273 TraceCheckUtils]: 32: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:07:48,074 INFO L273 TraceCheckUtils]: 33: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:48,074 INFO L273 TraceCheckUtils]: 34: Hoare triple {19182#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:07:48,075 INFO L273 TraceCheckUtils]: 35: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:07:48,075 INFO L273 TraceCheckUtils]: 36: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:48,075 INFO L273 TraceCheckUtils]: 37: Hoare triple {19182#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:07:48,094 INFO L273 TraceCheckUtils]: 38: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:07:48,094 INFO L273 TraceCheckUtils]: 39: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:48,094 INFO L273 TraceCheckUtils]: 40: Hoare triple {19182#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:07:48,094 INFO L273 TraceCheckUtils]: 41: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:07:48,094 INFO L273 TraceCheckUtils]: 42: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:48,095 INFO L273 TraceCheckUtils]: 43: Hoare triple {19182#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:07:48,095 INFO L273 TraceCheckUtils]: 44: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:07:48,095 INFO L273 TraceCheckUtils]: 45: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:48,095 INFO L273 TraceCheckUtils]: 46: Hoare triple {19182#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:07:48,095 INFO L273 TraceCheckUtils]: 47: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:07:48,095 INFO L273 TraceCheckUtils]: 48: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:48,095 INFO L273 TraceCheckUtils]: 49: Hoare triple {19182#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:07:48,096 INFO L273 TraceCheckUtils]: 50: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:07:48,096 INFO L273 TraceCheckUtils]: 51: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:48,096 INFO L273 TraceCheckUtils]: 52: Hoare triple {19182#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:07:48,096 INFO L273 TraceCheckUtils]: 53: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:07:48,096 INFO L273 TraceCheckUtils]: 54: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:48,096 INFO L273 TraceCheckUtils]: 55: Hoare triple {19182#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:07:48,096 INFO L273 TraceCheckUtils]: 56: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:07:48,097 INFO L273 TraceCheckUtils]: 57: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:48,097 INFO L273 TraceCheckUtils]: 58: Hoare triple {19182#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:07:48,097 INFO L273 TraceCheckUtils]: 59: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:07:48,097 INFO L273 TraceCheckUtils]: 60: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:48,097 INFO L273 TraceCheckUtils]: 61: Hoare triple {19182#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:07:48,097 INFO L273 TraceCheckUtils]: 62: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:07:48,098 INFO L273 TraceCheckUtils]: 63: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:48,098 INFO L273 TraceCheckUtils]: 64: Hoare triple {19182#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:07:48,098 INFO L273 TraceCheckUtils]: 65: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:07:48,098 INFO L273 TraceCheckUtils]: 66: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:48,098 INFO L273 TraceCheckUtils]: 67: Hoare triple {19182#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:07:48,099 INFO L273 TraceCheckUtils]: 68: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:07:48,099 INFO L273 TraceCheckUtils]: 69: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:48,099 INFO L273 TraceCheckUtils]: 70: Hoare triple {19182#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:07:48,099 INFO L273 TraceCheckUtils]: 71: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:07:48,099 INFO L273 TraceCheckUtils]: 72: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:48,099 INFO L273 TraceCheckUtils]: 73: Hoare triple {19182#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 17:07:48,099 INFO L273 TraceCheckUtils]: 74: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 17:07:48,100 INFO L273 TraceCheckUtils]: 75: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 17:07:48,100 INFO L273 TraceCheckUtils]: 76: Hoare triple {19182#true} assume !(~i~1 < 100); {19182#true} is VALID [2018-11-14 17:07:48,100 INFO L256 TraceCheckUtils]: 77: Hoare triple {19182#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {19182#true} is VALID [2018-11-14 17:07:48,101 INFO L273 TraceCheckUtils]: 78: Hoare triple {19182#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19445#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:07:48,101 INFO L273 TraceCheckUtils]: 79: Hoare triple {19445#(<= bAnd_~i~0 1)} assume true; {19445#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:07:48,101 INFO L273 TraceCheckUtils]: 80: Hoare triple {19445#(<= bAnd_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19445#(<= bAnd_~i~0 1)} is VALID [2018-11-14 17:07:48,102 INFO L273 TraceCheckUtils]: 81: Hoare triple {19445#(<= bAnd_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19455#(<= bAnd_~i~0 2)} is VALID [2018-11-14 17:07:48,102 INFO L273 TraceCheckUtils]: 82: Hoare triple {19455#(<= bAnd_~i~0 2)} assume true; {19455#(<= bAnd_~i~0 2)} is VALID [2018-11-14 17:07:48,102 INFO L273 TraceCheckUtils]: 83: Hoare triple {19455#(<= bAnd_~i~0 2)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19455#(<= bAnd_~i~0 2)} is VALID [2018-11-14 17:07:48,103 INFO L273 TraceCheckUtils]: 84: Hoare triple {19455#(<= bAnd_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19465#(<= bAnd_~i~0 3)} is VALID [2018-11-14 17:07:48,103 INFO L273 TraceCheckUtils]: 85: Hoare triple {19465#(<= bAnd_~i~0 3)} assume true; {19465#(<= bAnd_~i~0 3)} is VALID [2018-11-14 17:07:48,103 INFO L273 TraceCheckUtils]: 86: Hoare triple {19465#(<= bAnd_~i~0 3)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19465#(<= bAnd_~i~0 3)} is VALID [2018-11-14 17:07:48,104 INFO L273 TraceCheckUtils]: 87: Hoare triple {19465#(<= bAnd_~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19475#(<= bAnd_~i~0 4)} is VALID [2018-11-14 17:07:48,105 INFO L273 TraceCheckUtils]: 88: Hoare triple {19475#(<= bAnd_~i~0 4)} assume true; {19475#(<= bAnd_~i~0 4)} is VALID [2018-11-14 17:07:48,105 INFO L273 TraceCheckUtils]: 89: Hoare triple {19475#(<= bAnd_~i~0 4)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19475#(<= bAnd_~i~0 4)} is VALID [2018-11-14 17:07:48,106 INFO L273 TraceCheckUtils]: 90: Hoare triple {19475#(<= bAnd_~i~0 4)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19485#(<= bAnd_~i~0 5)} is VALID [2018-11-14 17:07:48,106 INFO L273 TraceCheckUtils]: 91: Hoare triple {19485#(<= bAnd_~i~0 5)} assume true; {19485#(<= bAnd_~i~0 5)} is VALID [2018-11-14 17:07:48,107 INFO L273 TraceCheckUtils]: 92: Hoare triple {19485#(<= bAnd_~i~0 5)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19485#(<= bAnd_~i~0 5)} is VALID [2018-11-14 17:07:48,108 INFO L273 TraceCheckUtils]: 93: Hoare triple {19485#(<= bAnd_~i~0 5)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19495#(<= bAnd_~i~0 6)} is VALID [2018-11-14 17:07:48,108 INFO L273 TraceCheckUtils]: 94: Hoare triple {19495#(<= bAnd_~i~0 6)} assume true; {19495#(<= bAnd_~i~0 6)} is VALID [2018-11-14 17:07:48,109 INFO L273 TraceCheckUtils]: 95: Hoare triple {19495#(<= bAnd_~i~0 6)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19495#(<= bAnd_~i~0 6)} is VALID [2018-11-14 17:07:48,109 INFO L273 TraceCheckUtils]: 96: Hoare triple {19495#(<= bAnd_~i~0 6)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19505#(<= bAnd_~i~0 7)} is VALID [2018-11-14 17:07:48,110 INFO L273 TraceCheckUtils]: 97: Hoare triple {19505#(<= bAnd_~i~0 7)} assume true; {19505#(<= bAnd_~i~0 7)} is VALID [2018-11-14 17:07:48,110 INFO L273 TraceCheckUtils]: 98: Hoare triple {19505#(<= bAnd_~i~0 7)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19505#(<= bAnd_~i~0 7)} is VALID [2018-11-14 17:07:48,111 INFO L273 TraceCheckUtils]: 99: Hoare triple {19505#(<= bAnd_~i~0 7)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19515#(<= bAnd_~i~0 8)} is VALID [2018-11-14 17:07:48,111 INFO L273 TraceCheckUtils]: 100: Hoare triple {19515#(<= bAnd_~i~0 8)} assume true; {19515#(<= bAnd_~i~0 8)} is VALID [2018-11-14 17:07:48,112 INFO L273 TraceCheckUtils]: 101: Hoare triple {19515#(<= bAnd_~i~0 8)} assume !(~i~0 < 100); {19183#false} is VALID [2018-11-14 17:07:48,112 INFO L273 TraceCheckUtils]: 102: Hoare triple {19183#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19183#false} is VALID [2018-11-14 17:07:48,112 INFO L273 TraceCheckUtils]: 103: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:48,113 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {19183#false} {19182#true} #73#return; {19183#false} is VALID [2018-11-14 17:07:48,113 INFO L273 TraceCheckUtils]: 105: Hoare triple {19183#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {19183#false} is VALID [2018-11-14 17:07:48,113 INFO L256 TraceCheckUtils]: 106: Hoare triple {19183#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {19183#false} is VALID [2018-11-14 17:07:48,114 INFO L273 TraceCheckUtils]: 107: Hoare triple {19183#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19183#false} is VALID [2018-11-14 17:07:48,114 INFO L273 TraceCheckUtils]: 108: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:48,114 INFO L273 TraceCheckUtils]: 109: Hoare triple {19183#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 17:07:48,114 INFO L273 TraceCheckUtils]: 110: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 17:07:48,115 INFO L273 TraceCheckUtils]: 111: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:48,115 INFO L273 TraceCheckUtils]: 112: Hoare triple {19183#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 17:07:48,115 INFO L273 TraceCheckUtils]: 113: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 17:07:48,115 INFO L273 TraceCheckUtils]: 114: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:48,115 INFO L273 TraceCheckUtils]: 115: Hoare triple {19183#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 17:07:48,116 INFO L273 TraceCheckUtils]: 116: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 17:07:48,116 INFO L273 TraceCheckUtils]: 117: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:48,116 INFO L273 TraceCheckUtils]: 118: Hoare triple {19183#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 17:07:48,116 INFO L273 TraceCheckUtils]: 119: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 17:07:48,116 INFO L273 TraceCheckUtils]: 120: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:48,116 INFO L273 TraceCheckUtils]: 121: Hoare triple {19183#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 17:07:48,117 INFO L273 TraceCheckUtils]: 122: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 17:07:48,117 INFO L273 TraceCheckUtils]: 123: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:48,117 INFO L273 TraceCheckUtils]: 124: Hoare triple {19183#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 17:07:48,117 INFO L273 TraceCheckUtils]: 125: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 17:07:48,117 INFO L273 TraceCheckUtils]: 126: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:48,117 INFO L273 TraceCheckUtils]: 127: Hoare triple {19183#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 17:07:48,118 INFO L273 TraceCheckUtils]: 128: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 17:07:48,118 INFO L273 TraceCheckUtils]: 129: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:48,118 INFO L273 TraceCheckUtils]: 130: Hoare triple {19183#false} assume !(~i~0 < 100); {19183#false} is VALID [2018-11-14 17:07:48,118 INFO L273 TraceCheckUtils]: 131: Hoare triple {19183#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19183#false} is VALID [2018-11-14 17:07:48,118 INFO L273 TraceCheckUtils]: 132: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:48,118 INFO L268 TraceCheckUtils]: 133: Hoare quadruple {19183#false} {19183#false} #75#return; {19183#false} is VALID [2018-11-14 17:07:48,118 INFO L273 TraceCheckUtils]: 134: Hoare triple {19183#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {19183#false} is VALID [2018-11-14 17:07:48,119 INFO L273 TraceCheckUtils]: 135: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:48,119 INFO L273 TraceCheckUtils]: 136: Hoare triple {19183#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 17:07:48,119 INFO L273 TraceCheckUtils]: 137: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 17:07:48,119 INFO L273 TraceCheckUtils]: 138: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:48,119 INFO L273 TraceCheckUtils]: 139: Hoare triple {19183#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 17:07:48,119 INFO L273 TraceCheckUtils]: 140: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 17:07:48,119 INFO L273 TraceCheckUtils]: 141: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:48,120 INFO L273 TraceCheckUtils]: 142: Hoare triple {19183#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 17:07:48,120 INFO L273 TraceCheckUtils]: 143: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 17:07:48,120 INFO L273 TraceCheckUtils]: 144: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:48,120 INFO L273 TraceCheckUtils]: 145: Hoare triple {19183#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 17:07:48,120 INFO L273 TraceCheckUtils]: 146: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 17:07:48,120 INFO L273 TraceCheckUtils]: 147: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:48,120 INFO L273 TraceCheckUtils]: 148: Hoare triple {19183#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 17:07:48,121 INFO L273 TraceCheckUtils]: 149: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 17:07:48,121 INFO L273 TraceCheckUtils]: 150: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:48,121 INFO L273 TraceCheckUtils]: 151: Hoare triple {19183#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 17:07:48,121 INFO L273 TraceCheckUtils]: 152: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 17:07:48,121 INFO L273 TraceCheckUtils]: 153: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:48,121 INFO L273 TraceCheckUtils]: 154: Hoare triple {19183#false} assume !(~i~2 < 99); {19183#false} is VALID [2018-11-14 17:07:48,122 INFO L273 TraceCheckUtils]: 155: Hoare triple {19183#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {19183#false} is VALID [2018-11-14 17:07:48,122 INFO L256 TraceCheckUtils]: 156: Hoare triple {19183#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {19183#false} is VALID [2018-11-14 17:07:48,122 INFO L273 TraceCheckUtils]: 157: Hoare triple {19183#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19183#false} is VALID [2018-11-14 17:07:48,122 INFO L273 TraceCheckUtils]: 158: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:48,122 INFO L273 TraceCheckUtils]: 159: Hoare triple {19183#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 17:07:48,122 INFO L273 TraceCheckUtils]: 160: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 17:07:48,122 INFO L273 TraceCheckUtils]: 161: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:48,123 INFO L273 TraceCheckUtils]: 162: Hoare triple {19183#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 17:07:48,123 INFO L273 TraceCheckUtils]: 163: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 17:07:48,123 INFO L273 TraceCheckUtils]: 164: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:48,123 INFO L273 TraceCheckUtils]: 165: Hoare triple {19183#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 17:07:48,123 INFO L273 TraceCheckUtils]: 166: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 17:07:48,123 INFO L273 TraceCheckUtils]: 167: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:48,123 INFO L273 TraceCheckUtils]: 168: Hoare triple {19183#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 17:07:48,124 INFO L273 TraceCheckUtils]: 169: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 17:07:48,124 INFO L273 TraceCheckUtils]: 170: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:48,124 INFO L273 TraceCheckUtils]: 171: Hoare triple {19183#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 17:07:48,124 INFO L273 TraceCheckUtils]: 172: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 17:07:48,124 INFO L273 TraceCheckUtils]: 173: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:48,124 INFO L273 TraceCheckUtils]: 174: Hoare triple {19183#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 17:07:48,125 INFO L273 TraceCheckUtils]: 175: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 17:07:48,125 INFO L273 TraceCheckUtils]: 176: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:48,125 INFO L273 TraceCheckUtils]: 177: Hoare triple {19183#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 17:07:48,125 INFO L273 TraceCheckUtils]: 178: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 17:07:48,125 INFO L273 TraceCheckUtils]: 179: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:48,125 INFO L273 TraceCheckUtils]: 180: Hoare triple {19183#false} assume !(~i~0 < 100); {19183#false} is VALID [2018-11-14 17:07:48,125 INFO L273 TraceCheckUtils]: 181: Hoare triple {19183#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19183#false} is VALID [2018-11-14 17:07:48,126 INFO L273 TraceCheckUtils]: 182: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 17:07:48,126 INFO L268 TraceCheckUtils]: 183: Hoare quadruple {19183#false} {19183#false} #77#return; {19183#false} is VALID [2018-11-14 17:07:48,126 INFO L273 TraceCheckUtils]: 184: Hoare triple {19183#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {19183#false} is VALID [2018-11-14 17:07:48,126 INFO L273 TraceCheckUtils]: 185: Hoare triple {19183#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {19183#false} is VALID [2018-11-14 17:07:48,126 INFO L273 TraceCheckUtils]: 186: Hoare triple {19183#false} assume !false; {19183#false} is VALID [2018-11-14 17:07:48,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1636 backedges. 356 proven. 77 refuted. 0 times theorem prover too weak. 1203 trivial. 0 not checked. [2018-11-14 17:07:48,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:48,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10] total 34 [2018-11-14 17:07:48,168 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 187 [2018-11-14 17:07:48,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:48,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-14 17:07:48,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:48,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-14 17:07:48,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-14 17:07:48,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 17:07:48,536 INFO L87 Difference]: Start difference. First operand 134 states and 138 transitions. Second operand 34 states. [2018-11-14 17:07:49,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:49,546 INFO L93 Difference]: Finished difference Result 199 states and 211 transitions. [2018-11-14 17:07:49,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-14 17:07:49,547 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 187 [2018-11-14 17:07:49,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:49,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 17:07:49,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 157 transitions. [2018-11-14 17:07:49,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 17:07:49,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 157 transitions. [2018-11-14 17:07:49,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 157 transitions. [2018-11-14 17:07:49,722 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:49,725 INFO L225 Difference]: With dead ends: 199 [2018-11-14 17:07:49,726 INFO L226 Difference]: Without dead ends: 142 [2018-11-14 17:07:49,727 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 17:07:49,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-14 17:07:49,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-11-14 17:07:49,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:49,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 140 states. [2018-11-14 17:07:49,766 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 140 states. [2018-11-14 17:07:49,767 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 140 states. [2018-11-14 17:07:49,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:49,770 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2018-11-14 17:07:49,770 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 146 transitions. [2018-11-14 17:07:49,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:49,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:49,771 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 142 states. [2018-11-14 17:07:49,771 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 142 states. [2018-11-14 17:07:49,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:49,773 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2018-11-14 17:07:49,773 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 146 transitions. [2018-11-14 17:07:49,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:49,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:49,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:49,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:49,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-14 17:07:49,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2018-11-14 17:07:49,776 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 187 [2018-11-14 17:07:49,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:49,776 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2018-11-14 17:07:49,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-14 17:07:49,776 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2018-11-14 17:07:49,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-14 17:07:49,778 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:49,778 INFO L375 BasicCegarLoop]: trace histogram [27, 25, 24, 24, 24, 24, 7, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:07:49,778 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:49,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:49,778 INFO L82 PathProgramCache]: Analyzing trace with hash -895619949, now seen corresponding path program 24 times [2018-11-14 17:07:49,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:49,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:49,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:49,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:49,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:50,454 INFO L256 TraceCheckUtils]: 0: Hoare triple {20516#true} call ULTIMATE.init(); {20516#true} is VALID [2018-11-14 17:07:50,454 INFO L273 TraceCheckUtils]: 1: Hoare triple {20516#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20516#true} is VALID [2018-11-14 17:07:50,454 INFO L273 TraceCheckUtils]: 2: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,455 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20516#true} {20516#true} #69#return; {20516#true} is VALID [2018-11-14 17:07:50,455 INFO L256 TraceCheckUtils]: 4: Hoare triple {20516#true} call #t~ret13 := main(); {20516#true} is VALID [2018-11-14 17:07:50,457 INFO L273 TraceCheckUtils]: 5: Hoare triple {20516#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {20518#(= main_~i~1 0)} is VALID [2018-11-14 17:07:50,457 INFO L273 TraceCheckUtils]: 6: Hoare triple {20518#(= main_~i~1 0)} assume true; {20518#(= main_~i~1 0)} is VALID [2018-11-14 17:07:50,457 INFO L273 TraceCheckUtils]: 7: Hoare triple {20518#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20518#(= main_~i~1 0)} is VALID [2018-11-14 17:07:50,458 INFO L273 TraceCheckUtils]: 8: Hoare triple {20518#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20519#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:50,458 INFO L273 TraceCheckUtils]: 9: Hoare triple {20519#(<= main_~i~1 1)} assume true; {20519#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:50,458 INFO L273 TraceCheckUtils]: 10: Hoare triple {20519#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20519#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:50,459 INFO L273 TraceCheckUtils]: 11: Hoare triple {20519#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20520#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:50,459 INFO L273 TraceCheckUtils]: 12: Hoare triple {20520#(<= main_~i~1 2)} assume true; {20520#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:50,459 INFO L273 TraceCheckUtils]: 13: Hoare triple {20520#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20520#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:50,460 INFO L273 TraceCheckUtils]: 14: Hoare triple {20520#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20521#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:50,460 INFO L273 TraceCheckUtils]: 15: Hoare triple {20521#(<= main_~i~1 3)} assume true; {20521#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:50,460 INFO L273 TraceCheckUtils]: 16: Hoare triple {20521#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20521#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:50,461 INFO L273 TraceCheckUtils]: 17: Hoare triple {20521#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20522#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:50,462 INFO L273 TraceCheckUtils]: 18: Hoare triple {20522#(<= main_~i~1 4)} assume true; {20522#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:50,462 INFO L273 TraceCheckUtils]: 19: Hoare triple {20522#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20522#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:50,463 INFO L273 TraceCheckUtils]: 20: Hoare triple {20522#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20523#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:50,463 INFO L273 TraceCheckUtils]: 21: Hoare triple {20523#(<= main_~i~1 5)} assume true; {20523#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:50,464 INFO L273 TraceCheckUtils]: 22: Hoare triple {20523#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20523#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:50,465 INFO L273 TraceCheckUtils]: 23: Hoare triple {20523#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20524#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:50,465 INFO L273 TraceCheckUtils]: 24: Hoare triple {20524#(<= main_~i~1 6)} assume true; {20524#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:50,466 INFO L273 TraceCheckUtils]: 25: Hoare triple {20524#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20524#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:50,466 INFO L273 TraceCheckUtils]: 26: Hoare triple {20524#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20525#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:50,467 INFO L273 TraceCheckUtils]: 27: Hoare triple {20525#(<= main_~i~1 7)} assume true; {20525#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:50,467 INFO L273 TraceCheckUtils]: 28: Hoare triple {20525#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20525#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:50,468 INFO L273 TraceCheckUtils]: 29: Hoare triple {20525#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20526#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:50,469 INFO L273 TraceCheckUtils]: 30: Hoare triple {20526#(<= main_~i~1 8)} assume true; {20526#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:50,469 INFO L273 TraceCheckUtils]: 31: Hoare triple {20526#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20526#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:50,470 INFO L273 TraceCheckUtils]: 32: Hoare triple {20526#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20527#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:50,470 INFO L273 TraceCheckUtils]: 33: Hoare triple {20527#(<= main_~i~1 9)} assume true; {20527#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:50,471 INFO L273 TraceCheckUtils]: 34: Hoare triple {20527#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20527#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:50,471 INFO L273 TraceCheckUtils]: 35: Hoare triple {20527#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20528#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:50,472 INFO L273 TraceCheckUtils]: 36: Hoare triple {20528#(<= main_~i~1 10)} assume true; {20528#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:50,472 INFO L273 TraceCheckUtils]: 37: Hoare triple {20528#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20528#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:50,473 INFO L273 TraceCheckUtils]: 38: Hoare triple {20528#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20529#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:50,474 INFO L273 TraceCheckUtils]: 39: Hoare triple {20529#(<= main_~i~1 11)} assume true; {20529#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:50,474 INFO L273 TraceCheckUtils]: 40: Hoare triple {20529#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20529#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:50,475 INFO L273 TraceCheckUtils]: 41: Hoare triple {20529#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20530#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:50,475 INFO L273 TraceCheckUtils]: 42: Hoare triple {20530#(<= main_~i~1 12)} assume true; {20530#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:50,476 INFO L273 TraceCheckUtils]: 43: Hoare triple {20530#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20530#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:50,477 INFO L273 TraceCheckUtils]: 44: Hoare triple {20530#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20531#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:50,477 INFO L273 TraceCheckUtils]: 45: Hoare triple {20531#(<= main_~i~1 13)} assume true; {20531#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:50,478 INFO L273 TraceCheckUtils]: 46: Hoare triple {20531#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20531#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:50,478 INFO L273 TraceCheckUtils]: 47: Hoare triple {20531#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20532#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:50,479 INFO L273 TraceCheckUtils]: 48: Hoare triple {20532#(<= main_~i~1 14)} assume true; {20532#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:50,479 INFO L273 TraceCheckUtils]: 49: Hoare triple {20532#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20532#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:50,480 INFO L273 TraceCheckUtils]: 50: Hoare triple {20532#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20533#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:50,481 INFO L273 TraceCheckUtils]: 51: Hoare triple {20533#(<= main_~i~1 15)} assume true; {20533#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:50,481 INFO L273 TraceCheckUtils]: 52: Hoare triple {20533#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20533#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:50,482 INFO L273 TraceCheckUtils]: 53: Hoare triple {20533#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20534#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:50,482 INFO L273 TraceCheckUtils]: 54: Hoare triple {20534#(<= main_~i~1 16)} assume true; {20534#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:50,483 INFO L273 TraceCheckUtils]: 55: Hoare triple {20534#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20534#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:50,483 INFO L273 TraceCheckUtils]: 56: Hoare triple {20534#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20535#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:50,484 INFO L273 TraceCheckUtils]: 57: Hoare triple {20535#(<= main_~i~1 17)} assume true; {20535#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:50,484 INFO L273 TraceCheckUtils]: 58: Hoare triple {20535#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20535#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:50,485 INFO L273 TraceCheckUtils]: 59: Hoare triple {20535#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20536#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:50,486 INFO L273 TraceCheckUtils]: 60: Hoare triple {20536#(<= main_~i~1 18)} assume true; {20536#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:50,486 INFO L273 TraceCheckUtils]: 61: Hoare triple {20536#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20536#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:50,487 INFO L273 TraceCheckUtils]: 62: Hoare triple {20536#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20537#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:50,487 INFO L273 TraceCheckUtils]: 63: Hoare triple {20537#(<= main_~i~1 19)} assume true; {20537#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:50,488 INFO L273 TraceCheckUtils]: 64: Hoare triple {20537#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20537#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:50,489 INFO L273 TraceCheckUtils]: 65: Hoare triple {20537#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20538#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:50,489 INFO L273 TraceCheckUtils]: 66: Hoare triple {20538#(<= main_~i~1 20)} assume true; {20538#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:50,490 INFO L273 TraceCheckUtils]: 67: Hoare triple {20538#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20538#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:50,490 INFO L273 TraceCheckUtils]: 68: Hoare triple {20538#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20539#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:50,491 INFO L273 TraceCheckUtils]: 69: Hoare triple {20539#(<= main_~i~1 21)} assume true; {20539#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:50,491 INFO L273 TraceCheckUtils]: 70: Hoare triple {20539#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20539#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:50,492 INFO L273 TraceCheckUtils]: 71: Hoare triple {20539#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20540#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:50,493 INFO L273 TraceCheckUtils]: 72: Hoare triple {20540#(<= main_~i~1 22)} assume true; {20540#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:50,493 INFO L273 TraceCheckUtils]: 73: Hoare triple {20540#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20540#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:50,494 INFO L273 TraceCheckUtils]: 74: Hoare triple {20540#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20541#(<= main_~i~1 23)} is VALID [2018-11-14 17:07:50,494 INFO L273 TraceCheckUtils]: 75: Hoare triple {20541#(<= main_~i~1 23)} assume true; {20541#(<= main_~i~1 23)} is VALID [2018-11-14 17:07:50,495 INFO L273 TraceCheckUtils]: 76: Hoare triple {20541#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20541#(<= main_~i~1 23)} is VALID [2018-11-14 17:07:50,496 INFO L273 TraceCheckUtils]: 77: Hoare triple {20541#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20542#(<= main_~i~1 24)} is VALID [2018-11-14 17:07:50,496 INFO L273 TraceCheckUtils]: 78: Hoare triple {20542#(<= main_~i~1 24)} assume true; {20542#(<= main_~i~1 24)} is VALID [2018-11-14 17:07:50,497 INFO L273 TraceCheckUtils]: 79: Hoare triple {20542#(<= main_~i~1 24)} assume !(~i~1 < 100); {20517#false} is VALID [2018-11-14 17:07:50,497 INFO L256 TraceCheckUtils]: 80: Hoare triple {20517#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {20516#true} is VALID [2018-11-14 17:07:50,497 INFO L273 TraceCheckUtils]: 81: Hoare triple {20516#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20516#true} is VALID [2018-11-14 17:07:50,497 INFO L273 TraceCheckUtils]: 82: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,497 INFO L273 TraceCheckUtils]: 83: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:50,498 INFO L273 TraceCheckUtils]: 84: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:50,498 INFO L273 TraceCheckUtils]: 85: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,498 INFO L273 TraceCheckUtils]: 86: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:50,498 INFO L273 TraceCheckUtils]: 87: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:50,499 INFO L273 TraceCheckUtils]: 88: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,499 INFO L273 TraceCheckUtils]: 89: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:50,499 INFO L273 TraceCheckUtils]: 90: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:50,499 INFO L273 TraceCheckUtils]: 91: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,499 INFO L273 TraceCheckUtils]: 92: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:50,499 INFO L273 TraceCheckUtils]: 93: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:50,500 INFO L273 TraceCheckUtils]: 94: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,500 INFO L273 TraceCheckUtils]: 95: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:50,500 INFO L273 TraceCheckUtils]: 96: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:50,500 INFO L273 TraceCheckUtils]: 97: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,500 INFO L273 TraceCheckUtils]: 98: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:50,500 INFO L273 TraceCheckUtils]: 99: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:50,501 INFO L273 TraceCheckUtils]: 100: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,501 INFO L273 TraceCheckUtils]: 101: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:50,501 INFO L273 TraceCheckUtils]: 102: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:50,501 INFO L273 TraceCheckUtils]: 103: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,501 INFO L273 TraceCheckUtils]: 104: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:50,501 INFO L273 TraceCheckUtils]: 105: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:50,501 INFO L273 TraceCheckUtils]: 106: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,501 INFO L273 TraceCheckUtils]: 107: Hoare triple {20516#true} assume !(~i~0 < 100); {20516#true} is VALID [2018-11-14 17:07:50,501 INFO L273 TraceCheckUtils]: 108: Hoare triple {20516#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20516#true} is VALID [2018-11-14 17:07:50,502 INFO L273 TraceCheckUtils]: 109: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,502 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {20516#true} {20517#false} #73#return; {20517#false} is VALID [2018-11-14 17:07:50,502 INFO L273 TraceCheckUtils]: 111: Hoare triple {20517#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {20517#false} is VALID [2018-11-14 17:07:50,502 INFO L256 TraceCheckUtils]: 112: Hoare triple {20517#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {20516#true} is VALID [2018-11-14 17:07:50,502 INFO L273 TraceCheckUtils]: 113: Hoare triple {20516#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20516#true} is VALID [2018-11-14 17:07:50,502 INFO L273 TraceCheckUtils]: 114: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,502 INFO L273 TraceCheckUtils]: 115: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:50,502 INFO L273 TraceCheckUtils]: 116: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:50,502 INFO L273 TraceCheckUtils]: 117: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,502 INFO L273 TraceCheckUtils]: 118: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:50,503 INFO L273 TraceCheckUtils]: 119: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:50,503 INFO L273 TraceCheckUtils]: 120: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,503 INFO L273 TraceCheckUtils]: 121: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:50,503 INFO L273 TraceCheckUtils]: 122: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:50,503 INFO L273 TraceCheckUtils]: 123: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,503 INFO L273 TraceCheckUtils]: 124: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:50,503 INFO L273 TraceCheckUtils]: 125: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:50,503 INFO L273 TraceCheckUtils]: 126: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,503 INFO L273 TraceCheckUtils]: 127: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:50,504 INFO L273 TraceCheckUtils]: 128: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:50,504 INFO L273 TraceCheckUtils]: 129: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,504 INFO L273 TraceCheckUtils]: 130: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:50,504 INFO L273 TraceCheckUtils]: 131: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:50,504 INFO L273 TraceCheckUtils]: 132: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,504 INFO L273 TraceCheckUtils]: 133: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:50,504 INFO L273 TraceCheckUtils]: 134: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:50,504 INFO L273 TraceCheckUtils]: 135: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,504 INFO L273 TraceCheckUtils]: 136: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:50,504 INFO L273 TraceCheckUtils]: 137: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:50,505 INFO L273 TraceCheckUtils]: 138: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,505 INFO L273 TraceCheckUtils]: 139: Hoare triple {20516#true} assume !(~i~0 < 100); {20516#true} is VALID [2018-11-14 17:07:50,505 INFO L273 TraceCheckUtils]: 140: Hoare triple {20516#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20516#true} is VALID [2018-11-14 17:07:50,505 INFO L273 TraceCheckUtils]: 141: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,505 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {20516#true} {20517#false} #75#return; {20517#false} is VALID [2018-11-14 17:07:50,505 INFO L273 TraceCheckUtils]: 143: Hoare triple {20517#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {20517#false} is VALID [2018-11-14 17:07:50,505 INFO L273 TraceCheckUtils]: 144: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:07:50,505 INFO L273 TraceCheckUtils]: 145: Hoare triple {20517#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20517#false} is VALID [2018-11-14 17:07:50,505 INFO L273 TraceCheckUtils]: 146: Hoare triple {20517#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20517#false} is VALID [2018-11-14 17:07:50,505 INFO L273 TraceCheckUtils]: 147: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:07:50,506 INFO L273 TraceCheckUtils]: 148: Hoare triple {20517#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20517#false} is VALID [2018-11-14 17:07:50,506 INFO L273 TraceCheckUtils]: 149: Hoare triple {20517#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20517#false} is VALID [2018-11-14 17:07:50,506 INFO L273 TraceCheckUtils]: 150: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:07:50,506 INFO L273 TraceCheckUtils]: 151: Hoare triple {20517#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20517#false} is VALID [2018-11-14 17:07:50,506 INFO L273 TraceCheckUtils]: 152: Hoare triple {20517#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20517#false} is VALID [2018-11-14 17:07:50,506 INFO L273 TraceCheckUtils]: 153: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:07:50,506 INFO L273 TraceCheckUtils]: 154: Hoare triple {20517#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20517#false} is VALID [2018-11-14 17:07:50,506 INFO L273 TraceCheckUtils]: 155: Hoare triple {20517#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20517#false} is VALID [2018-11-14 17:07:50,506 INFO L273 TraceCheckUtils]: 156: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:07:50,506 INFO L273 TraceCheckUtils]: 157: Hoare triple {20517#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20517#false} is VALID [2018-11-14 17:07:50,507 INFO L273 TraceCheckUtils]: 158: Hoare triple {20517#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20517#false} is VALID [2018-11-14 17:07:50,507 INFO L273 TraceCheckUtils]: 159: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:07:50,507 INFO L273 TraceCheckUtils]: 160: Hoare triple {20517#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20517#false} is VALID [2018-11-14 17:07:50,507 INFO L273 TraceCheckUtils]: 161: Hoare triple {20517#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20517#false} is VALID [2018-11-14 17:07:50,507 INFO L273 TraceCheckUtils]: 162: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:07:50,507 INFO L273 TraceCheckUtils]: 163: Hoare triple {20517#false} assume !(~i~2 < 99); {20517#false} is VALID [2018-11-14 17:07:50,507 INFO L273 TraceCheckUtils]: 164: Hoare triple {20517#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {20517#false} is VALID [2018-11-14 17:07:50,507 INFO L256 TraceCheckUtils]: 165: Hoare triple {20517#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {20516#true} is VALID [2018-11-14 17:07:50,507 INFO L273 TraceCheckUtils]: 166: Hoare triple {20516#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20516#true} is VALID [2018-11-14 17:07:50,508 INFO L273 TraceCheckUtils]: 167: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,508 INFO L273 TraceCheckUtils]: 168: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:50,508 INFO L273 TraceCheckUtils]: 169: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:50,508 INFO L273 TraceCheckUtils]: 170: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,508 INFO L273 TraceCheckUtils]: 171: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:50,508 INFO L273 TraceCheckUtils]: 172: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:50,508 INFO L273 TraceCheckUtils]: 173: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,508 INFO L273 TraceCheckUtils]: 174: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:50,508 INFO L273 TraceCheckUtils]: 175: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:50,508 INFO L273 TraceCheckUtils]: 176: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,509 INFO L273 TraceCheckUtils]: 177: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:50,509 INFO L273 TraceCheckUtils]: 178: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:50,509 INFO L273 TraceCheckUtils]: 179: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,509 INFO L273 TraceCheckUtils]: 180: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:50,509 INFO L273 TraceCheckUtils]: 181: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:50,509 INFO L273 TraceCheckUtils]: 182: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,509 INFO L273 TraceCheckUtils]: 183: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:50,509 INFO L273 TraceCheckUtils]: 184: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:50,509 INFO L273 TraceCheckUtils]: 185: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,509 INFO L273 TraceCheckUtils]: 186: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:50,510 INFO L273 TraceCheckUtils]: 187: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:50,510 INFO L273 TraceCheckUtils]: 188: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,510 INFO L273 TraceCheckUtils]: 189: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:50,510 INFO L273 TraceCheckUtils]: 190: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:50,510 INFO L273 TraceCheckUtils]: 191: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,510 INFO L273 TraceCheckUtils]: 192: Hoare triple {20516#true} assume !(~i~0 < 100); {20516#true} is VALID [2018-11-14 17:07:50,510 INFO L273 TraceCheckUtils]: 193: Hoare triple {20516#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20516#true} is VALID [2018-11-14 17:07:50,510 INFO L273 TraceCheckUtils]: 194: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:50,510 INFO L268 TraceCheckUtils]: 195: Hoare quadruple {20516#true} {20517#false} #77#return; {20517#false} is VALID [2018-11-14 17:07:50,510 INFO L273 TraceCheckUtils]: 196: Hoare triple {20517#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {20517#false} is VALID [2018-11-14 17:07:50,511 INFO L273 TraceCheckUtils]: 197: Hoare triple {20517#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {20517#false} is VALID [2018-11-14 17:07:50,511 INFO L273 TraceCheckUtils]: 198: Hoare triple {20517#false} assume !false; {20517#false} is VALID [2018-11-14 17:07:50,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1923 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2018-11-14 17:07:50,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:50,531 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:07:50,540 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:07:51,449 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-11-14 17:07:51,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:51,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:51,756 INFO L256 TraceCheckUtils]: 0: Hoare triple {20516#true} call ULTIMATE.init(); {20516#true} is VALID [2018-11-14 17:07:51,756 INFO L273 TraceCheckUtils]: 1: Hoare triple {20516#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20516#true} is VALID [2018-11-14 17:07:51,756 INFO L273 TraceCheckUtils]: 2: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,756 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20516#true} {20516#true} #69#return; {20516#true} is VALID [2018-11-14 17:07:51,757 INFO L256 TraceCheckUtils]: 4: Hoare triple {20516#true} call #t~ret13 := main(); {20516#true} is VALID [2018-11-14 17:07:51,757 INFO L273 TraceCheckUtils]: 5: Hoare triple {20516#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {20516#true} is VALID [2018-11-14 17:07:51,757 INFO L273 TraceCheckUtils]: 6: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,757 INFO L273 TraceCheckUtils]: 7: Hoare triple {20516#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:07:51,757 INFO L273 TraceCheckUtils]: 8: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:07:51,758 INFO L273 TraceCheckUtils]: 9: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,758 INFO L273 TraceCheckUtils]: 10: Hoare triple {20516#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:07:51,758 INFO L273 TraceCheckUtils]: 11: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:07:51,758 INFO L273 TraceCheckUtils]: 12: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,758 INFO L273 TraceCheckUtils]: 13: Hoare triple {20516#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:07:51,758 INFO L273 TraceCheckUtils]: 14: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:07:51,758 INFO L273 TraceCheckUtils]: 15: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,758 INFO L273 TraceCheckUtils]: 16: Hoare triple {20516#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:07:51,759 INFO L273 TraceCheckUtils]: 17: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:07:51,759 INFO L273 TraceCheckUtils]: 18: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,759 INFO L273 TraceCheckUtils]: 19: Hoare triple {20516#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:07:51,759 INFO L273 TraceCheckUtils]: 20: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:07:51,759 INFO L273 TraceCheckUtils]: 21: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,759 INFO L273 TraceCheckUtils]: 22: Hoare triple {20516#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:07:51,759 INFO L273 TraceCheckUtils]: 23: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:07:51,759 INFO L273 TraceCheckUtils]: 24: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,759 INFO L273 TraceCheckUtils]: 25: Hoare triple {20516#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:07:51,760 INFO L273 TraceCheckUtils]: 26: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:07:51,760 INFO L273 TraceCheckUtils]: 27: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,760 INFO L273 TraceCheckUtils]: 28: Hoare triple {20516#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:07:51,760 INFO L273 TraceCheckUtils]: 29: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:07:51,760 INFO L273 TraceCheckUtils]: 30: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,760 INFO L273 TraceCheckUtils]: 31: Hoare triple {20516#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:07:51,760 INFO L273 TraceCheckUtils]: 32: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:07:51,760 INFO L273 TraceCheckUtils]: 33: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,760 INFO L273 TraceCheckUtils]: 34: Hoare triple {20516#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:07:51,760 INFO L273 TraceCheckUtils]: 35: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:07:51,761 INFO L273 TraceCheckUtils]: 36: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,761 INFO L273 TraceCheckUtils]: 37: Hoare triple {20516#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:07:51,761 INFO L273 TraceCheckUtils]: 38: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:07:51,761 INFO L273 TraceCheckUtils]: 39: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,761 INFO L273 TraceCheckUtils]: 40: Hoare triple {20516#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:07:51,761 INFO L273 TraceCheckUtils]: 41: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:07:51,761 INFO L273 TraceCheckUtils]: 42: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,761 INFO L273 TraceCheckUtils]: 43: Hoare triple {20516#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:07:51,761 INFO L273 TraceCheckUtils]: 44: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:07:51,761 INFO L273 TraceCheckUtils]: 45: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,762 INFO L273 TraceCheckUtils]: 46: Hoare triple {20516#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:07:51,762 INFO L273 TraceCheckUtils]: 47: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:07:51,762 INFO L273 TraceCheckUtils]: 48: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,762 INFO L273 TraceCheckUtils]: 49: Hoare triple {20516#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:07:51,762 INFO L273 TraceCheckUtils]: 50: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:07:51,762 INFO L273 TraceCheckUtils]: 51: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,762 INFO L273 TraceCheckUtils]: 52: Hoare triple {20516#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:07:51,762 INFO L273 TraceCheckUtils]: 53: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:07:51,762 INFO L273 TraceCheckUtils]: 54: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,762 INFO L273 TraceCheckUtils]: 55: Hoare triple {20516#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:07:51,763 INFO L273 TraceCheckUtils]: 56: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:07:51,763 INFO L273 TraceCheckUtils]: 57: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,763 INFO L273 TraceCheckUtils]: 58: Hoare triple {20516#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:07:51,763 INFO L273 TraceCheckUtils]: 59: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:07:51,763 INFO L273 TraceCheckUtils]: 60: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,763 INFO L273 TraceCheckUtils]: 61: Hoare triple {20516#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:07:51,763 INFO L273 TraceCheckUtils]: 62: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:07:51,763 INFO L273 TraceCheckUtils]: 63: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,763 INFO L273 TraceCheckUtils]: 64: Hoare triple {20516#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:07:51,763 INFO L273 TraceCheckUtils]: 65: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:07:51,764 INFO L273 TraceCheckUtils]: 66: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,764 INFO L273 TraceCheckUtils]: 67: Hoare triple {20516#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:07:51,764 INFO L273 TraceCheckUtils]: 68: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:07:51,764 INFO L273 TraceCheckUtils]: 69: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,764 INFO L273 TraceCheckUtils]: 70: Hoare triple {20516#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:07:51,764 INFO L273 TraceCheckUtils]: 71: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:07:51,764 INFO L273 TraceCheckUtils]: 72: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,764 INFO L273 TraceCheckUtils]: 73: Hoare triple {20516#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:07:51,764 INFO L273 TraceCheckUtils]: 74: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:07:51,765 INFO L273 TraceCheckUtils]: 75: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,765 INFO L273 TraceCheckUtils]: 76: Hoare triple {20516#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 17:07:51,765 INFO L273 TraceCheckUtils]: 77: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 17:07:51,765 INFO L273 TraceCheckUtils]: 78: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,765 INFO L273 TraceCheckUtils]: 79: Hoare triple {20516#true} assume !(~i~1 < 100); {20516#true} is VALID [2018-11-14 17:07:51,765 INFO L256 TraceCheckUtils]: 80: Hoare triple {20516#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {20516#true} is VALID [2018-11-14 17:07:51,765 INFO L273 TraceCheckUtils]: 81: Hoare triple {20516#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20516#true} is VALID [2018-11-14 17:07:51,765 INFO L273 TraceCheckUtils]: 82: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,765 INFO L273 TraceCheckUtils]: 83: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:51,765 INFO L273 TraceCheckUtils]: 84: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:51,766 INFO L273 TraceCheckUtils]: 85: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,766 INFO L273 TraceCheckUtils]: 86: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:51,766 INFO L273 TraceCheckUtils]: 87: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:51,766 INFO L273 TraceCheckUtils]: 88: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,766 INFO L273 TraceCheckUtils]: 89: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:51,766 INFO L273 TraceCheckUtils]: 90: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:51,766 INFO L273 TraceCheckUtils]: 91: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,766 INFO L273 TraceCheckUtils]: 92: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:51,766 INFO L273 TraceCheckUtils]: 93: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:51,766 INFO L273 TraceCheckUtils]: 94: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,767 INFO L273 TraceCheckUtils]: 95: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:51,767 INFO L273 TraceCheckUtils]: 96: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:51,767 INFO L273 TraceCheckUtils]: 97: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,767 INFO L273 TraceCheckUtils]: 98: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:51,767 INFO L273 TraceCheckUtils]: 99: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:51,767 INFO L273 TraceCheckUtils]: 100: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,767 INFO L273 TraceCheckUtils]: 101: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:51,767 INFO L273 TraceCheckUtils]: 102: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:51,767 INFO L273 TraceCheckUtils]: 103: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,767 INFO L273 TraceCheckUtils]: 104: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:51,768 INFO L273 TraceCheckUtils]: 105: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:51,768 INFO L273 TraceCheckUtils]: 106: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,768 INFO L273 TraceCheckUtils]: 107: Hoare triple {20516#true} assume !(~i~0 < 100); {20516#true} is VALID [2018-11-14 17:07:51,768 INFO L273 TraceCheckUtils]: 108: Hoare triple {20516#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20516#true} is VALID [2018-11-14 17:07:51,768 INFO L273 TraceCheckUtils]: 109: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,768 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {20516#true} {20516#true} #73#return; {20516#true} is VALID [2018-11-14 17:07:51,768 INFO L273 TraceCheckUtils]: 111: Hoare triple {20516#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {20516#true} is VALID [2018-11-14 17:07:51,768 INFO L256 TraceCheckUtils]: 112: Hoare triple {20516#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {20516#true} is VALID [2018-11-14 17:07:51,768 INFO L273 TraceCheckUtils]: 113: Hoare triple {20516#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20516#true} is VALID [2018-11-14 17:07:51,768 INFO L273 TraceCheckUtils]: 114: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,769 INFO L273 TraceCheckUtils]: 115: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:51,769 INFO L273 TraceCheckUtils]: 116: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:51,769 INFO L273 TraceCheckUtils]: 117: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,769 INFO L273 TraceCheckUtils]: 118: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:51,769 INFO L273 TraceCheckUtils]: 119: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:51,769 INFO L273 TraceCheckUtils]: 120: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,769 INFO L273 TraceCheckUtils]: 121: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:51,769 INFO L273 TraceCheckUtils]: 122: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:51,769 INFO L273 TraceCheckUtils]: 123: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,769 INFO L273 TraceCheckUtils]: 124: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:51,770 INFO L273 TraceCheckUtils]: 125: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:51,770 INFO L273 TraceCheckUtils]: 126: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,770 INFO L273 TraceCheckUtils]: 127: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:51,770 INFO L273 TraceCheckUtils]: 128: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:51,770 INFO L273 TraceCheckUtils]: 129: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,770 INFO L273 TraceCheckUtils]: 130: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:51,770 INFO L273 TraceCheckUtils]: 131: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:51,770 INFO L273 TraceCheckUtils]: 132: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,770 INFO L273 TraceCheckUtils]: 133: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:51,771 INFO L273 TraceCheckUtils]: 134: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:51,771 INFO L273 TraceCheckUtils]: 135: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,771 INFO L273 TraceCheckUtils]: 136: Hoare triple {20516#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 17:07:51,771 INFO L273 TraceCheckUtils]: 137: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 17:07:51,771 INFO L273 TraceCheckUtils]: 138: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,771 INFO L273 TraceCheckUtils]: 139: Hoare triple {20516#true} assume !(~i~0 < 100); {20516#true} is VALID [2018-11-14 17:07:51,771 INFO L273 TraceCheckUtils]: 140: Hoare triple {20516#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20516#true} is VALID [2018-11-14 17:07:51,771 INFO L273 TraceCheckUtils]: 141: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 17:07:51,771 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {20516#true} {20516#true} #75#return; {20516#true} is VALID [2018-11-14 17:07:51,772 INFO L273 TraceCheckUtils]: 143: Hoare triple {20516#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {20975#(<= main_~i~2 0)} is VALID [2018-11-14 17:07:51,772 INFO L273 TraceCheckUtils]: 144: Hoare triple {20975#(<= main_~i~2 0)} assume true; {20975#(<= main_~i~2 0)} is VALID [2018-11-14 17:07:51,772 INFO L273 TraceCheckUtils]: 145: Hoare triple {20975#(<= main_~i~2 0)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20975#(<= main_~i~2 0)} is VALID [2018-11-14 17:07:51,773 INFO L273 TraceCheckUtils]: 146: Hoare triple {20975#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20985#(<= main_~i~2 1)} is VALID [2018-11-14 17:07:51,773 INFO L273 TraceCheckUtils]: 147: Hoare triple {20985#(<= main_~i~2 1)} assume true; {20985#(<= main_~i~2 1)} is VALID [2018-11-14 17:07:51,773 INFO L273 TraceCheckUtils]: 148: Hoare triple {20985#(<= main_~i~2 1)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20985#(<= main_~i~2 1)} is VALID [2018-11-14 17:07:51,774 INFO L273 TraceCheckUtils]: 149: Hoare triple {20985#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20995#(<= main_~i~2 2)} is VALID [2018-11-14 17:07:51,774 INFO L273 TraceCheckUtils]: 150: Hoare triple {20995#(<= main_~i~2 2)} assume true; {20995#(<= main_~i~2 2)} is VALID [2018-11-14 17:07:51,774 INFO L273 TraceCheckUtils]: 151: Hoare triple {20995#(<= main_~i~2 2)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20995#(<= main_~i~2 2)} is VALID [2018-11-14 17:07:51,775 INFO L273 TraceCheckUtils]: 152: Hoare triple {20995#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21005#(<= main_~i~2 3)} is VALID [2018-11-14 17:07:51,775 INFO L273 TraceCheckUtils]: 153: Hoare triple {21005#(<= main_~i~2 3)} assume true; {21005#(<= main_~i~2 3)} is VALID [2018-11-14 17:07:51,776 INFO L273 TraceCheckUtils]: 154: Hoare triple {21005#(<= main_~i~2 3)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21005#(<= main_~i~2 3)} is VALID [2018-11-14 17:07:51,777 INFO L273 TraceCheckUtils]: 155: Hoare triple {21005#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21015#(<= main_~i~2 4)} is VALID [2018-11-14 17:07:51,777 INFO L273 TraceCheckUtils]: 156: Hoare triple {21015#(<= main_~i~2 4)} assume true; {21015#(<= main_~i~2 4)} is VALID [2018-11-14 17:07:51,778 INFO L273 TraceCheckUtils]: 157: Hoare triple {21015#(<= main_~i~2 4)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21015#(<= main_~i~2 4)} is VALID [2018-11-14 17:07:51,778 INFO L273 TraceCheckUtils]: 158: Hoare triple {21015#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21025#(<= main_~i~2 5)} is VALID [2018-11-14 17:07:51,779 INFO L273 TraceCheckUtils]: 159: Hoare triple {21025#(<= main_~i~2 5)} assume true; {21025#(<= main_~i~2 5)} is VALID [2018-11-14 17:07:51,779 INFO L273 TraceCheckUtils]: 160: Hoare triple {21025#(<= main_~i~2 5)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21025#(<= main_~i~2 5)} is VALID [2018-11-14 17:07:51,780 INFO L273 TraceCheckUtils]: 161: Hoare triple {21025#(<= main_~i~2 5)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21035#(<= main_~i~2 6)} is VALID [2018-11-14 17:07:51,780 INFO L273 TraceCheckUtils]: 162: Hoare triple {21035#(<= main_~i~2 6)} assume true; {21035#(<= main_~i~2 6)} is VALID [2018-11-14 17:07:51,781 INFO L273 TraceCheckUtils]: 163: Hoare triple {21035#(<= main_~i~2 6)} assume !(~i~2 < 99); {20517#false} is VALID [2018-11-14 17:07:51,781 INFO L273 TraceCheckUtils]: 164: Hoare triple {20517#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {20517#false} is VALID [2018-11-14 17:07:51,781 INFO L256 TraceCheckUtils]: 165: Hoare triple {20517#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {20517#false} is VALID [2018-11-14 17:07:51,782 INFO L273 TraceCheckUtils]: 166: Hoare triple {20517#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20517#false} is VALID [2018-11-14 17:07:51,782 INFO L273 TraceCheckUtils]: 167: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:07:51,782 INFO L273 TraceCheckUtils]: 168: Hoare triple {20517#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20517#false} is VALID [2018-11-14 17:07:51,782 INFO L273 TraceCheckUtils]: 169: Hoare triple {20517#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20517#false} is VALID [2018-11-14 17:07:51,782 INFO L273 TraceCheckUtils]: 170: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:07:51,783 INFO L273 TraceCheckUtils]: 171: Hoare triple {20517#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20517#false} is VALID [2018-11-14 17:07:51,783 INFO L273 TraceCheckUtils]: 172: Hoare triple {20517#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20517#false} is VALID [2018-11-14 17:07:51,783 INFO L273 TraceCheckUtils]: 173: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:07:51,783 INFO L273 TraceCheckUtils]: 174: Hoare triple {20517#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20517#false} is VALID [2018-11-14 17:07:51,783 INFO L273 TraceCheckUtils]: 175: Hoare triple {20517#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20517#false} is VALID [2018-11-14 17:07:51,783 INFO L273 TraceCheckUtils]: 176: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:07:51,784 INFO L273 TraceCheckUtils]: 177: Hoare triple {20517#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20517#false} is VALID [2018-11-14 17:07:51,784 INFO L273 TraceCheckUtils]: 178: Hoare triple {20517#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20517#false} is VALID [2018-11-14 17:07:51,784 INFO L273 TraceCheckUtils]: 179: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:07:51,784 INFO L273 TraceCheckUtils]: 180: Hoare triple {20517#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20517#false} is VALID [2018-11-14 17:07:51,784 INFO L273 TraceCheckUtils]: 181: Hoare triple {20517#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20517#false} is VALID [2018-11-14 17:07:51,784 INFO L273 TraceCheckUtils]: 182: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:07:51,784 INFO L273 TraceCheckUtils]: 183: Hoare triple {20517#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20517#false} is VALID [2018-11-14 17:07:51,784 INFO L273 TraceCheckUtils]: 184: Hoare triple {20517#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20517#false} is VALID [2018-11-14 17:07:51,785 INFO L273 TraceCheckUtils]: 185: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:07:51,785 INFO L273 TraceCheckUtils]: 186: Hoare triple {20517#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20517#false} is VALID [2018-11-14 17:07:51,785 INFO L273 TraceCheckUtils]: 187: Hoare triple {20517#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20517#false} is VALID [2018-11-14 17:07:51,785 INFO L273 TraceCheckUtils]: 188: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:07:51,785 INFO L273 TraceCheckUtils]: 189: Hoare triple {20517#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20517#false} is VALID [2018-11-14 17:07:51,785 INFO L273 TraceCheckUtils]: 190: Hoare triple {20517#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20517#false} is VALID [2018-11-14 17:07:51,785 INFO L273 TraceCheckUtils]: 191: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:07:51,785 INFO L273 TraceCheckUtils]: 192: Hoare triple {20517#false} assume !(~i~0 < 100); {20517#false} is VALID [2018-11-14 17:07:51,785 INFO L273 TraceCheckUtils]: 193: Hoare triple {20517#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20517#false} is VALID [2018-11-14 17:07:51,786 INFO L273 TraceCheckUtils]: 194: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 17:07:51,786 INFO L268 TraceCheckUtils]: 195: Hoare quadruple {20517#false} {20517#false} #77#return; {20517#false} is VALID [2018-11-14 17:07:51,786 INFO L273 TraceCheckUtils]: 196: Hoare triple {20517#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {20517#false} is VALID [2018-11-14 17:07:51,786 INFO L273 TraceCheckUtils]: 197: Hoare triple {20517#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {20517#false} is VALID [2018-11-14 17:07:51,786 INFO L273 TraceCheckUtils]: 198: Hoare triple {20517#false} assume !false; {20517#false} is VALID [2018-11-14 17:07:51,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1923 backedges. 460 proven. 57 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-11-14 17:07:51,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:51,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 9] total 34 [2018-11-14 17:07:51,823 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 199 [2018-11-14 17:07:51,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:51,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-14 17:07:51,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:51,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-14 17:07:51,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-14 17:07:51,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 17:07:51,976 INFO L87 Difference]: Start difference. First operand 140 states and 144 transitions. Second operand 34 states. [2018-11-14 17:07:52,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:52,930 INFO L93 Difference]: Finished difference Result 208 states and 217 transitions. [2018-11-14 17:07:52,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-14 17:07:52,931 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 199 [2018-11-14 17:07:52,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:52,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 17:07:52,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 154 transitions. [2018-11-14 17:07:52,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 17:07:52,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 154 transitions. [2018-11-14 17:07:52,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 154 transitions. [2018-11-14 17:07:53,069 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:53,073 INFO L225 Difference]: With dead ends: 208 [2018-11-14 17:07:53,073 INFO L226 Difference]: Without dead ends: 148 [2018-11-14 17:07:53,074 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 17:07:53,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-14 17:07:53,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-11-14 17:07:53,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:53,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 146 states. [2018-11-14 17:07:53,111 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 146 states. [2018-11-14 17:07:53,111 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 146 states. [2018-11-14 17:07:53,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:53,113 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-11-14 17:07:53,113 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2018-11-14 17:07:53,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:53,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:53,114 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 148 states. [2018-11-14 17:07:53,114 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 148 states. [2018-11-14 17:07:53,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:53,117 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-11-14 17:07:53,117 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2018-11-14 17:07:53,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:53,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:53,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:53,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:53,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-14 17:07:53,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 150 transitions. [2018-11-14 17:07:53,120 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 150 transitions. Word has length 199 [2018-11-14 17:07:53,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:53,121 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 150 transitions. [2018-11-14 17:07:53,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-14 17:07:53,121 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2018-11-14 17:07:53,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-14 17:07:53,122 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:53,122 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 25, 25, 24, 24, 8, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:07:53,123 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:53,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:53,123 INFO L82 PathProgramCache]: Analyzing trace with hash -442425137, now seen corresponding path program 25 times [2018-11-14 17:07:53,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:53,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:53,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:53,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:53,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:53,971 INFO L256 TraceCheckUtils]: 0: Hoare triple {21918#true} call ULTIMATE.init(); {21918#true} is VALID [2018-11-14 17:07:53,971 INFO L273 TraceCheckUtils]: 1: Hoare triple {21918#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21918#true} is VALID [2018-11-14 17:07:53,971 INFO L273 TraceCheckUtils]: 2: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:53,972 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21918#true} {21918#true} #69#return; {21918#true} is VALID [2018-11-14 17:07:53,972 INFO L256 TraceCheckUtils]: 4: Hoare triple {21918#true} call #t~ret13 := main(); {21918#true} is VALID [2018-11-14 17:07:53,972 INFO L273 TraceCheckUtils]: 5: Hoare triple {21918#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {21920#(= main_~i~1 0)} is VALID [2018-11-14 17:07:53,973 INFO L273 TraceCheckUtils]: 6: Hoare triple {21920#(= main_~i~1 0)} assume true; {21920#(= main_~i~1 0)} is VALID [2018-11-14 17:07:53,973 INFO L273 TraceCheckUtils]: 7: Hoare triple {21920#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21920#(= main_~i~1 0)} is VALID [2018-11-14 17:07:53,974 INFO L273 TraceCheckUtils]: 8: Hoare triple {21920#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21921#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:53,974 INFO L273 TraceCheckUtils]: 9: Hoare triple {21921#(<= main_~i~1 1)} assume true; {21921#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:53,974 INFO L273 TraceCheckUtils]: 10: Hoare triple {21921#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21921#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:53,975 INFO L273 TraceCheckUtils]: 11: Hoare triple {21921#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21922#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:53,975 INFO L273 TraceCheckUtils]: 12: Hoare triple {21922#(<= main_~i~1 2)} assume true; {21922#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:53,975 INFO L273 TraceCheckUtils]: 13: Hoare triple {21922#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21922#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:53,976 INFO L273 TraceCheckUtils]: 14: Hoare triple {21922#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21923#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:53,976 INFO L273 TraceCheckUtils]: 15: Hoare triple {21923#(<= main_~i~1 3)} assume true; {21923#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:53,976 INFO L273 TraceCheckUtils]: 16: Hoare triple {21923#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21923#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:53,977 INFO L273 TraceCheckUtils]: 17: Hoare triple {21923#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21924#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:53,978 INFO L273 TraceCheckUtils]: 18: Hoare triple {21924#(<= main_~i~1 4)} assume true; {21924#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:53,978 INFO L273 TraceCheckUtils]: 19: Hoare triple {21924#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21924#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:53,979 INFO L273 TraceCheckUtils]: 20: Hoare triple {21924#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21925#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:53,979 INFO L273 TraceCheckUtils]: 21: Hoare triple {21925#(<= main_~i~1 5)} assume true; {21925#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:53,980 INFO L273 TraceCheckUtils]: 22: Hoare triple {21925#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21925#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:53,980 INFO L273 TraceCheckUtils]: 23: Hoare triple {21925#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21926#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:53,981 INFO L273 TraceCheckUtils]: 24: Hoare triple {21926#(<= main_~i~1 6)} assume true; {21926#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:53,981 INFO L273 TraceCheckUtils]: 25: Hoare triple {21926#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21926#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:53,982 INFO L273 TraceCheckUtils]: 26: Hoare triple {21926#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21927#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:53,983 INFO L273 TraceCheckUtils]: 27: Hoare triple {21927#(<= main_~i~1 7)} assume true; {21927#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:53,983 INFO L273 TraceCheckUtils]: 28: Hoare triple {21927#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21927#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:53,984 INFO L273 TraceCheckUtils]: 29: Hoare triple {21927#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21928#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:53,984 INFO L273 TraceCheckUtils]: 30: Hoare triple {21928#(<= main_~i~1 8)} assume true; {21928#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:53,985 INFO L273 TraceCheckUtils]: 31: Hoare triple {21928#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21928#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:53,986 INFO L273 TraceCheckUtils]: 32: Hoare triple {21928#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21929#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:53,986 INFO L273 TraceCheckUtils]: 33: Hoare triple {21929#(<= main_~i~1 9)} assume true; {21929#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:53,987 INFO L273 TraceCheckUtils]: 34: Hoare triple {21929#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21929#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:53,987 INFO L273 TraceCheckUtils]: 35: Hoare triple {21929#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21930#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:53,988 INFO L273 TraceCheckUtils]: 36: Hoare triple {21930#(<= main_~i~1 10)} assume true; {21930#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:53,988 INFO L273 TraceCheckUtils]: 37: Hoare triple {21930#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21930#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:53,989 INFO L273 TraceCheckUtils]: 38: Hoare triple {21930#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21931#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:53,989 INFO L273 TraceCheckUtils]: 39: Hoare triple {21931#(<= main_~i~1 11)} assume true; {21931#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:53,990 INFO L273 TraceCheckUtils]: 40: Hoare triple {21931#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21931#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:53,990 INFO L273 TraceCheckUtils]: 41: Hoare triple {21931#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21932#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:53,991 INFO L273 TraceCheckUtils]: 42: Hoare triple {21932#(<= main_~i~1 12)} assume true; {21932#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:53,991 INFO L273 TraceCheckUtils]: 43: Hoare triple {21932#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21932#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:53,992 INFO L273 TraceCheckUtils]: 44: Hoare triple {21932#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21933#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:53,993 INFO L273 TraceCheckUtils]: 45: Hoare triple {21933#(<= main_~i~1 13)} assume true; {21933#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:53,993 INFO L273 TraceCheckUtils]: 46: Hoare triple {21933#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21933#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:53,994 INFO L273 TraceCheckUtils]: 47: Hoare triple {21933#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21934#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:53,994 INFO L273 TraceCheckUtils]: 48: Hoare triple {21934#(<= main_~i~1 14)} assume true; {21934#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:53,995 INFO L273 TraceCheckUtils]: 49: Hoare triple {21934#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21934#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:53,995 INFO L273 TraceCheckUtils]: 50: Hoare triple {21934#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21935#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:53,996 INFO L273 TraceCheckUtils]: 51: Hoare triple {21935#(<= main_~i~1 15)} assume true; {21935#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:53,996 INFO L273 TraceCheckUtils]: 52: Hoare triple {21935#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21935#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:53,997 INFO L273 TraceCheckUtils]: 53: Hoare triple {21935#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21936#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:53,997 INFO L273 TraceCheckUtils]: 54: Hoare triple {21936#(<= main_~i~1 16)} assume true; {21936#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:53,998 INFO L273 TraceCheckUtils]: 55: Hoare triple {21936#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21936#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:53,999 INFO L273 TraceCheckUtils]: 56: Hoare triple {21936#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21937#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:53,999 INFO L273 TraceCheckUtils]: 57: Hoare triple {21937#(<= main_~i~1 17)} assume true; {21937#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:53,999 INFO L273 TraceCheckUtils]: 58: Hoare triple {21937#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21937#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:54,000 INFO L273 TraceCheckUtils]: 59: Hoare triple {21937#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21938#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:54,001 INFO L273 TraceCheckUtils]: 60: Hoare triple {21938#(<= main_~i~1 18)} assume true; {21938#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:54,001 INFO L273 TraceCheckUtils]: 61: Hoare triple {21938#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21938#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:54,002 INFO L273 TraceCheckUtils]: 62: Hoare triple {21938#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21939#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:54,002 INFO L273 TraceCheckUtils]: 63: Hoare triple {21939#(<= main_~i~1 19)} assume true; {21939#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:54,003 INFO L273 TraceCheckUtils]: 64: Hoare triple {21939#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21939#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:54,003 INFO L273 TraceCheckUtils]: 65: Hoare triple {21939#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21940#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:54,004 INFO L273 TraceCheckUtils]: 66: Hoare triple {21940#(<= main_~i~1 20)} assume true; {21940#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:54,004 INFO L273 TraceCheckUtils]: 67: Hoare triple {21940#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21940#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:54,005 INFO L273 TraceCheckUtils]: 68: Hoare triple {21940#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21941#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:54,005 INFO L273 TraceCheckUtils]: 69: Hoare triple {21941#(<= main_~i~1 21)} assume true; {21941#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:54,006 INFO L273 TraceCheckUtils]: 70: Hoare triple {21941#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21941#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:54,007 INFO L273 TraceCheckUtils]: 71: Hoare triple {21941#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21942#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:54,007 INFO L273 TraceCheckUtils]: 72: Hoare triple {21942#(<= main_~i~1 22)} assume true; {21942#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:54,008 INFO L273 TraceCheckUtils]: 73: Hoare triple {21942#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21942#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:54,008 INFO L273 TraceCheckUtils]: 74: Hoare triple {21942#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21943#(<= main_~i~1 23)} is VALID [2018-11-14 17:07:54,009 INFO L273 TraceCheckUtils]: 75: Hoare triple {21943#(<= main_~i~1 23)} assume true; {21943#(<= main_~i~1 23)} is VALID [2018-11-14 17:07:54,009 INFO L273 TraceCheckUtils]: 76: Hoare triple {21943#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21943#(<= main_~i~1 23)} is VALID [2018-11-14 17:07:54,010 INFO L273 TraceCheckUtils]: 77: Hoare triple {21943#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21944#(<= main_~i~1 24)} is VALID [2018-11-14 17:07:54,010 INFO L273 TraceCheckUtils]: 78: Hoare triple {21944#(<= main_~i~1 24)} assume true; {21944#(<= main_~i~1 24)} is VALID [2018-11-14 17:07:54,011 INFO L273 TraceCheckUtils]: 79: Hoare triple {21944#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21944#(<= main_~i~1 24)} is VALID [2018-11-14 17:07:54,011 INFO L273 TraceCheckUtils]: 80: Hoare triple {21944#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21945#(<= main_~i~1 25)} is VALID [2018-11-14 17:07:54,012 INFO L273 TraceCheckUtils]: 81: Hoare triple {21945#(<= main_~i~1 25)} assume true; {21945#(<= main_~i~1 25)} is VALID [2018-11-14 17:07:54,013 INFO L273 TraceCheckUtils]: 82: Hoare triple {21945#(<= main_~i~1 25)} assume !(~i~1 < 100); {21919#false} is VALID [2018-11-14 17:07:54,013 INFO L256 TraceCheckUtils]: 83: Hoare triple {21919#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {21918#true} is VALID [2018-11-14 17:07:54,013 INFO L273 TraceCheckUtils]: 84: Hoare triple {21918#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21918#true} is VALID [2018-11-14 17:07:54,013 INFO L273 TraceCheckUtils]: 85: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,013 INFO L273 TraceCheckUtils]: 86: Hoare triple {21918#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:07:54,013 INFO L273 TraceCheckUtils]: 87: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:07:54,014 INFO L273 TraceCheckUtils]: 88: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,014 INFO L273 TraceCheckUtils]: 89: Hoare triple {21918#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:07:54,014 INFO L273 TraceCheckUtils]: 90: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:07:54,014 INFO L273 TraceCheckUtils]: 91: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,014 INFO L273 TraceCheckUtils]: 92: Hoare triple {21918#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:07:54,014 INFO L273 TraceCheckUtils]: 93: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:07:54,015 INFO L273 TraceCheckUtils]: 94: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,015 INFO L273 TraceCheckUtils]: 95: Hoare triple {21918#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:07:54,015 INFO L273 TraceCheckUtils]: 96: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:07:54,015 INFO L273 TraceCheckUtils]: 97: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,015 INFO L273 TraceCheckUtils]: 98: Hoare triple {21918#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:07:54,015 INFO L273 TraceCheckUtils]: 99: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:07:54,016 INFO L273 TraceCheckUtils]: 100: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,016 INFO L273 TraceCheckUtils]: 101: Hoare triple {21918#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:07:54,016 INFO L273 TraceCheckUtils]: 102: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:07:54,016 INFO L273 TraceCheckUtils]: 103: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,016 INFO L273 TraceCheckUtils]: 104: Hoare triple {21918#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:07:54,016 INFO L273 TraceCheckUtils]: 105: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:07:54,016 INFO L273 TraceCheckUtils]: 106: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,017 INFO L273 TraceCheckUtils]: 107: Hoare triple {21918#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:07:54,017 INFO L273 TraceCheckUtils]: 108: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:07:54,017 INFO L273 TraceCheckUtils]: 109: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,017 INFO L273 TraceCheckUtils]: 110: Hoare triple {21918#true} assume !(~i~0 < 100); {21918#true} is VALID [2018-11-14 17:07:54,017 INFO L273 TraceCheckUtils]: 111: Hoare triple {21918#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21918#true} is VALID [2018-11-14 17:07:54,017 INFO L273 TraceCheckUtils]: 112: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,017 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {21918#true} {21919#false} #73#return; {21919#false} is VALID [2018-11-14 17:07:54,017 INFO L273 TraceCheckUtils]: 114: Hoare triple {21919#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {21919#false} is VALID [2018-11-14 17:07:54,017 INFO L256 TraceCheckUtils]: 115: Hoare triple {21919#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {21918#true} is VALID [2018-11-14 17:07:54,018 INFO L273 TraceCheckUtils]: 116: Hoare triple {21918#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21918#true} is VALID [2018-11-14 17:07:54,018 INFO L273 TraceCheckUtils]: 117: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,018 INFO L273 TraceCheckUtils]: 118: Hoare triple {21918#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:07:54,018 INFO L273 TraceCheckUtils]: 119: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:07:54,018 INFO L273 TraceCheckUtils]: 120: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,018 INFO L273 TraceCheckUtils]: 121: Hoare triple {21918#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:07:54,018 INFO L273 TraceCheckUtils]: 122: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:07:54,018 INFO L273 TraceCheckUtils]: 123: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,018 INFO L273 TraceCheckUtils]: 124: Hoare triple {21918#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:07:54,018 INFO L273 TraceCheckUtils]: 125: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:07:54,019 INFO L273 TraceCheckUtils]: 126: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,019 INFO L273 TraceCheckUtils]: 127: Hoare triple {21918#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:07:54,019 INFO L273 TraceCheckUtils]: 128: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:07:54,019 INFO L273 TraceCheckUtils]: 129: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,019 INFO L273 TraceCheckUtils]: 130: Hoare triple {21918#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:07:54,019 INFO L273 TraceCheckUtils]: 131: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:07:54,019 INFO L273 TraceCheckUtils]: 132: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,019 INFO L273 TraceCheckUtils]: 133: Hoare triple {21918#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:07:54,019 INFO L273 TraceCheckUtils]: 134: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:07:54,019 INFO L273 TraceCheckUtils]: 135: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,020 INFO L273 TraceCheckUtils]: 136: Hoare triple {21918#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:07:54,020 INFO L273 TraceCheckUtils]: 137: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:07:54,020 INFO L273 TraceCheckUtils]: 138: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,020 INFO L273 TraceCheckUtils]: 139: Hoare triple {21918#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:07:54,020 INFO L273 TraceCheckUtils]: 140: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:07:54,020 INFO L273 TraceCheckUtils]: 141: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,020 INFO L273 TraceCheckUtils]: 142: Hoare triple {21918#true} assume !(~i~0 < 100); {21918#true} is VALID [2018-11-14 17:07:54,020 INFO L273 TraceCheckUtils]: 143: Hoare triple {21918#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21918#true} is VALID [2018-11-14 17:07:54,020 INFO L273 TraceCheckUtils]: 144: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,021 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {21918#true} {21919#false} #75#return; {21919#false} is VALID [2018-11-14 17:07:54,021 INFO L273 TraceCheckUtils]: 146: Hoare triple {21919#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {21919#false} is VALID [2018-11-14 17:07:54,021 INFO L273 TraceCheckUtils]: 147: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,021 INFO L273 TraceCheckUtils]: 148: Hoare triple {21919#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 17:07:54,021 INFO L273 TraceCheckUtils]: 149: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 17:07:54,021 INFO L273 TraceCheckUtils]: 150: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,021 INFO L273 TraceCheckUtils]: 151: Hoare triple {21919#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 17:07:54,021 INFO L273 TraceCheckUtils]: 152: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 17:07:54,021 INFO L273 TraceCheckUtils]: 153: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,021 INFO L273 TraceCheckUtils]: 154: Hoare triple {21919#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 17:07:54,022 INFO L273 TraceCheckUtils]: 155: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 17:07:54,022 INFO L273 TraceCheckUtils]: 156: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,022 INFO L273 TraceCheckUtils]: 157: Hoare triple {21919#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 17:07:54,022 INFO L273 TraceCheckUtils]: 158: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 17:07:54,022 INFO L273 TraceCheckUtils]: 159: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,022 INFO L273 TraceCheckUtils]: 160: Hoare triple {21919#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 17:07:54,022 INFO L273 TraceCheckUtils]: 161: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 17:07:54,022 INFO L273 TraceCheckUtils]: 162: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,022 INFO L273 TraceCheckUtils]: 163: Hoare triple {21919#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 17:07:54,022 INFO L273 TraceCheckUtils]: 164: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 17:07:54,023 INFO L273 TraceCheckUtils]: 165: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,023 INFO L273 TraceCheckUtils]: 166: Hoare triple {21919#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 17:07:54,023 INFO L273 TraceCheckUtils]: 167: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 17:07:54,023 INFO L273 TraceCheckUtils]: 168: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,023 INFO L273 TraceCheckUtils]: 169: Hoare triple {21919#false} assume !(~i~2 < 99); {21919#false} is VALID [2018-11-14 17:07:54,023 INFO L273 TraceCheckUtils]: 170: Hoare triple {21919#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {21919#false} is VALID [2018-11-14 17:07:54,023 INFO L256 TraceCheckUtils]: 171: Hoare triple {21919#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {21918#true} is VALID [2018-11-14 17:07:54,023 INFO L273 TraceCheckUtils]: 172: Hoare triple {21918#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21918#true} is VALID [2018-11-14 17:07:54,023 INFO L273 TraceCheckUtils]: 173: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,024 INFO L273 TraceCheckUtils]: 174: Hoare triple {21918#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:07:54,024 INFO L273 TraceCheckUtils]: 175: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:07:54,024 INFO L273 TraceCheckUtils]: 176: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,024 INFO L273 TraceCheckUtils]: 177: Hoare triple {21918#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:07:54,024 INFO L273 TraceCheckUtils]: 178: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:07:54,024 INFO L273 TraceCheckUtils]: 179: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,024 INFO L273 TraceCheckUtils]: 180: Hoare triple {21918#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:07:54,024 INFO L273 TraceCheckUtils]: 181: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:07:54,024 INFO L273 TraceCheckUtils]: 182: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,024 INFO L273 TraceCheckUtils]: 183: Hoare triple {21918#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:07:54,025 INFO L273 TraceCheckUtils]: 184: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:07:54,025 INFO L273 TraceCheckUtils]: 185: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,025 INFO L273 TraceCheckUtils]: 186: Hoare triple {21918#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:07:54,025 INFO L273 TraceCheckUtils]: 187: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:07:54,025 INFO L273 TraceCheckUtils]: 188: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,025 INFO L273 TraceCheckUtils]: 189: Hoare triple {21918#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:07:54,025 INFO L273 TraceCheckUtils]: 190: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:07:54,025 INFO L273 TraceCheckUtils]: 191: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,025 INFO L273 TraceCheckUtils]: 192: Hoare triple {21918#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:07:54,026 INFO L273 TraceCheckUtils]: 193: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:07:54,026 INFO L273 TraceCheckUtils]: 194: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,026 INFO L273 TraceCheckUtils]: 195: Hoare triple {21918#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 17:07:54,026 INFO L273 TraceCheckUtils]: 196: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 17:07:54,026 INFO L273 TraceCheckUtils]: 197: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,026 INFO L273 TraceCheckUtils]: 198: Hoare triple {21918#true} assume !(~i~0 < 100); {21918#true} is VALID [2018-11-14 17:07:54,026 INFO L273 TraceCheckUtils]: 199: Hoare triple {21918#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21918#true} is VALID [2018-11-14 17:07:54,026 INFO L273 TraceCheckUtils]: 200: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,026 INFO L268 TraceCheckUtils]: 201: Hoare quadruple {21918#true} {21919#false} #77#return; {21919#false} is VALID [2018-11-14 17:07:54,026 INFO L273 TraceCheckUtils]: 202: Hoare triple {21919#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {21919#false} is VALID [2018-11-14 17:07:54,027 INFO L273 TraceCheckUtils]: 203: Hoare triple {21919#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {21919#false} is VALID [2018-11-14 17:07:54,027 INFO L273 TraceCheckUtils]: 204: Hoare triple {21919#false} assume !false; {21919#false} is VALID [2018-11-14 17:07:54,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-11-14 17:07:54,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:54,046 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:07:54,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:07:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:54,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:54,657 INFO L256 TraceCheckUtils]: 0: Hoare triple {21918#true} call ULTIMATE.init(); {21918#true} is VALID [2018-11-14 17:07:54,657 INFO L273 TraceCheckUtils]: 1: Hoare triple {21918#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21918#true} is VALID [2018-11-14 17:07:54,657 INFO L273 TraceCheckUtils]: 2: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 17:07:54,657 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21918#true} {21918#true} #69#return; {21918#true} is VALID [2018-11-14 17:07:54,658 INFO L256 TraceCheckUtils]: 4: Hoare triple {21918#true} call #t~ret13 := main(); {21918#true} is VALID [2018-11-14 17:07:54,658 INFO L273 TraceCheckUtils]: 5: Hoare triple {21918#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {21964#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:54,659 INFO L273 TraceCheckUtils]: 6: Hoare triple {21964#(<= main_~i~1 0)} assume true; {21964#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:54,659 INFO L273 TraceCheckUtils]: 7: Hoare triple {21964#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21964#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:54,659 INFO L273 TraceCheckUtils]: 8: Hoare triple {21964#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21921#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:54,660 INFO L273 TraceCheckUtils]: 9: Hoare triple {21921#(<= main_~i~1 1)} assume true; {21921#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:54,660 INFO L273 TraceCheckUtils]: 10: Hoare triple {21921#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21921#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:54,660 INFO L273 TraceCheckUtils]: 11: Hoare triple {21921#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21922#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:54,661 INFO L273 TraceCheckUtils]: 12: Hoare triple {21922#(<= main_~i~1 2)} assume true; {21922#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:54,661 INFO L273 TraceCheckUtils]: 13: Hoare triple {21922#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21922#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:54,662 INFO L273 TraceCheckUtils]: 14: Hoare triple {21922#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21923#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:54,663 INFO L273 TraceCheckUtils]: 15: Hoare triple {21923#(<= main_~i~1 3)} assume true; {21923#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:54,663 INFO L273 TraceCheckUtils]: 16: Hoare triple {21923#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21923#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:54,664 INFO L273 TraceCheckUtils]: 17: Hoare triple {21923#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21924#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:54,664 INFO L273 TraceCheckUtils]: 18: Hoare triple {21924#(<= main_~i~1 4)} assume true; {21924#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:54,665 INFO L273 TraceCheckUtils]: 19: Hoare triple {21924#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21924#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:54,666 INFO L273 TraceCheckUtils]: 20: Hoare triple {21924#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21925#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:54,666 INFO L273 TraceCheckUtils]: 21: Hoare triple {21925#(<= main_~i~1 5)} assume true; {21925#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:54,666 INFO L273 TraceCheckUtils]: 22: Hoare triple {21925#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21925#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:54,667 INFO L273 TraceCheckUtils]: 23: Hoare triple {21925#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21926#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:54,668 INFO L273 TraceCheckUtils]: 24: Hoare triple {21926#(<= main_~i~1 6)} assume true; {21926#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:54,668 INFO L273 TraceCheckUtils]: 25: Hoare triple {21926#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21926#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:54,669 INFO L273 TraceCheckUtils]: 26: Hoare triple {21926#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21927#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:54,669 INFO L273 TraceCheckUtils]: 27: Hoare triple {21927#(<= main_~i~1 7)} assume true; {21927#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:54,670 INFO L273 TraceCheckUtils]: 28: Hoare triple {21927#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21927#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:54,671 INFO L273 TraceCheckUtils]: 29: Hoare triple {21927#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21928#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:54,671 INFO L273 TraceCheckUtils]: 30: Hoare triple {21928#(<= main_~i~1 8)} assume true; {21928#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:54,671 INFO L273 TraceCheckUtils]: 31: Hoare triple {21928#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21928#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:54,672 INFO L273 TraceCheckUtils]: 32: Hoare triple {21928#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21929#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:54,673 INFO L273 TraceCheckUtils]: 33: Hoare triple {21929#(<= main_~i~1 9)} assume true; {21929#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:54,673 INFO L273 TraceCheckUtils]: 34: Hoare triple {21929#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21929#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:54,674 INFO L273 TraceCheckUtils]: 35: Hoare triple {21929#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21930#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:54,674 INFO L273 TraceCheckUtils]: 36: Hoare triple {21930#(<= main_~i~1 10)} assume true; {21930#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:54,675 INFO L273 TraceCheckUtils]: 37: Hoare triple {21930#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21930#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:54,675 INFO L273 TraceCheckUtils]: 38: Hoare triple {21930#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21931#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:54,676 INFO L273 TraceCheckUtils]: 39: Hoare triple {21931#(<= main_~i~1 11)} assume true; {21931#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:54,676 INFO L273 TraceCheckUtils]: 40: Hoare triple {21931#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21931#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:54,677 INFO L273 TraceCheckUtils]: 41: Hoare triple {21931#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21932#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:54,678 INFO L273 TraceCheckUtils]: 42: Hoare triple {21932#(<= main_~i~1 12)} assume true; {21932#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:54,678 INFO L273 TraceCheckUtils]: 43: Hoare triple {21932#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21932#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:54,679 INFO L273 TraceCheckUtils]: 44: Hoare triple {21932#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21933#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:54,679 INFO L273 TraceCheckUtils]: 45: Hoare triple {21933#(<= main_~i~1 13)} assume true; {21933#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:54,680 INFO L273 TraceCheckUtils]: 46: Hoare triple {21933#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21933#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:54,680 INFO L273 TraceCheckUtils]: 47: Hoare triple {21933#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21934#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:54,681 INFO L273 TraceCheckUtils]: 48: Hoare triple {21934#(<= main_~i~1 14)} assume true; {21934#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:54,681 INFO L273 TraceCheckUtils]: 49: Hoare triple {21934#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21934#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:54,682 INFO L273 TraceCheckUtils]: 50: Hoare triple {21934#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21935#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:54,683 INFO L273 TraceCheckUtils]: 51: Hoare triple {21935#(<= main_~i~1 15)} assume true; {21935#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:54,683 INFO L273 TraceCheckUtils]: 52: Hoare triple {21935#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21935#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:54,684 INFO L273 TraceCheckUtils]: 53: Hoare triple {21935#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21936#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:54,684 INFO L273 TraceCheckUtils]: 54: Hoare triple {21936#(<= main_~i~1 16)} assume true; {21936#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:54,685 INFO L273 TraceCheckUtils]: 55: Hoare triple {21936#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21936#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:54,685 INFO L273 TraceCheckUtils]: 56: Hoare triple {21936#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21937#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:54,686 INFO L273 TraceCheckUtils]: 57: Hoare triple {21937#(<= main_~i~1 17)} assume true; {21937#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:54,686 INFO L273 TraceCheckUtils]: 58: Hoare triple {21937#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21937#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:54,687 INFO L273 TraceCheckUtils]: 59: Hoare triple {21937#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21938#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:54,687 INFO L273 TraceCheckUtils]: 60: Hoare triple {21938#(<= main_~i~1 18)} assume true; {21938#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:54,688 INFO L273 TraceCheckUtils]: 61: Hoare triple {21938#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21938#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:54,689 INFO L273 TraceCheckUtils]: 62: Hoare triple {21938#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21939#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:54,689 INFO L273 TraceCheckUtils]: 63: Hoare triple {21939#(<= main_~i~1 19)} assume true; {21939#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:54,690 INFO L273 TraceCheckUtils]: 64: Hoare triple {21939#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21939#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:54,690 INFO L273 TraceCheckUtils]: 65: Hoare triple {21939#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21940#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:54,691 INFO L273 TraceCheckUtils]: 66: Hoare triple {21940#(<= main_~i~1 20)} assume true; {21940#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:54,691 INFO L273 TraceCheckUtils]: 67: Hoare triple {21940#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21940#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:54,692 INFO L273 TraceCheckUtils]: 68: Hoare triple {21940#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21941#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:54,692 INFO L273 TraceCheckUtils]: 69: Hoare triple {21941#(<= main_~i~1 21)} assume true; {21941#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:54,693 INFO L273 TraceCheckUtils]: 70: Hoare triple {21941#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21941#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:54,694 INFO L273 TraceCheckUtils]: 71: Hoare triple {21941#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21942#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:54,694 INFO L273 TraceCheckUtils]: 72: Hoare triple {21942#(<= main_~i~1 22)} assume true; {21942#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:54,695 INFO L273 TraceCheckUtils]: 73: Hoare triple {21942#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21942#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:54,695 INFO L273 TraceCheckUtils]: 74: Hoare triple {21942#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21943#(<= main_~i~1 23)} is VALID [2018-11-14 17:07:54,696 INFO L273 TraceCheckUtils]: 75: Hoare triple {21943#(<= main_~i~1 23)} assume true; {21943#(<= main_~i~1 23)} is VALID [2018-11-14 17:07:54,696 INFO L273 TraceCheckUtils]: 76: Hoare triple {21943#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21943#(<= main_~i~1 23)} is VALID [2018-11-14 17:07:54,697 INFO L273 TraceCheckUtils]: 77: Hoare triple {21943#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21944#(<= main_~i~1 24)} is VALID [2018-11-14 17:07:54,698 INFO L273 TraceCheckUtils]: 78: Hoare triple {21944#(<= main_~i~1 24)} assume true; {21944#(<= main_~i~1 24)} is VALID [2018-11-14 17:07:54,698 INFO L273 TraceCheckUtils]: 79: Hoare triple {21944#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {21944#(<= main_~i~1 24)} is VALID [2018-11-14 17:07:54,699 INFO L273 TraceCheckUtils]: 80: Hoare triple {21944#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21945#(<= main_~i~1 25)} is VALID [2018-11-14 17:07:54,699 INFO L273 TraceCheckUtils]: 81: Hoare triple {21945#(<= main_~i~1 25)} assume true; {21945#(<= main_~i~1 25)} is VALID [2018-11-14 17:07:54,700 INFO L273 TraceCheckUtils]: 82: Hoare triple {21945#(<= main_~i~1 25)} assume !(~i~1 < 100); {21919#false} is VALID [2018-11-14 17:07:54,700 INFO L256 TraceCheckUtils]: 83: Hoare triple {21919#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {21919#false} is VALID [2018-11-14 17:07:54,700 INFO L273 TraceCheckUtils]: 84: Hoare triple {21919#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21919#false} is VALID [2018-11-14 17:07:54,701 INFO L273 TraceCheckUtils]: 85: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,701 INFO L273 TraceCheckUtils]: 86: Hoare triple {21919#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:07:54,701 INFO L273 TraceCheckUtils]: 87: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:07:54,701 INFO L273 TraceCheckUtils]: 88: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,701 INFO L273 TraceCheckUtils]: 89: Hoare triple {21919#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:07:54,701 INFO L273 TraceCheckUtils]: 90: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:07:54,702 INFO L273 TraceCheckUtils]: 91: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,702 INFO L273 TraceCheckUtils]: 92: Hoare triple {21919#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:07:54,702 INFO L273 TraceCheckUtils]: 93: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:07:54,702 INFO L273 TraceCheckUtils]: 94: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,702 INFO L273 TraceCheckUtils]: 95: Hoare triple {21919#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:07:54,702 INFO L273 TraceCheckUtils]: 96: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:07:54,703 INFO L273 TraceCheckUtils]: 97: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,703 INFO L273 TraceCheckUtils]: 98: Hoare triple {21919#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:07:54,703 INFO L273 TraceCheckUtils]: 99: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:07:54,703 INFO L273 TraceCheckUtils]: 100: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,703 INFO L273 TraceCheckUtils]: 101: Hoare triple {21919#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:07:54,703 INFO L273 TraceCheckUtils]: 102: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:07:54,704 INFO L273 TraceCheckUtils]: 103: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,704 INFO L273 TraceCheckUtils]: 104: Hoare triple {21919#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:07:54,704 INFO L273 TraceCheckUtils]: 105: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:07:54,704 INFO L273 TraceCheckUtils]: 106: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,704 INFO L273 TraceCheckUtils]: 107: Hoare triple {21919#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:07:54,704 INFO L273 TraceCheckUtils]: 108: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:07:54,705 INFO L273 TraceCheckUtils]: 109: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,705 INFO L273 TraceCheckUtils]: 110: Hoare triple {21919#false} assume !(~i~0 < 100); {21919#false} is VALID [2018-11-14 17:07:54,705 INFO L273 TraceCheckUtils]: 111: Hoare triple {21919#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21919#false} is VALID [2018-11-14 17:07:54,705 INFO L273 TraceCheckUtils]: 112: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,705 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {21919#false} {21919#false} #73#return; {21919#false} is VALID [2018-11-14 17:07:54,705 INFO L273 TraceCheckUtils]: 114: Hoare triple {21919#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {21919#false} is VALID [2018-11-14 17:07:54,705 INFO L256 TraceCheckUtils]: 115: Hoare triple {21919#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {21919#false} is VALID [2018-11-14 17:07:54,705 INFO L273 TraceCheckUtils]: 116: Hoare triple {21919#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21919#false} is VALID [2018-11-14 17:07:54,705 INFO L273 TraceCheckUtils]: 117: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,705 INFO L273 TraceCheckUtils]: 118: Hoare triple {21919#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:07:54,706 INFO L273 TraceCheckUtils]: 119: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:07:54,706 INFO L273 TraceCheckUtils]: 120: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,706 INFO L273 TraceCheckUtils]: 121: Hoare triple {21919#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:07:54,706 INFO L273 TraceCheckUtils]: 122: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:07:54,706 INFO L273 TraceCheckUtils]: 123: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,706 INFO L273 TraceCheckUtils]: 124: Hoare triple {21919#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:07:54,706 INFO L273 TraceCheckUtils]: 125: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:07:54,706 INFO L273 TraceCheckUtils]: 126: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,706 INFO L273 TraceCheckUtils]: 127: Hoare triple {21919#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:07:54,707 INFO L273 TraceCheckUtils]: 128: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:07:54,707 INFO L273 TraceCheckUtils]: 129: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,707 INFO L273 TraceCheckUtils]: 130: Hoare triple {21919#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:07:54,707 INFO L273 TraceCheckUtils]: 131: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:07:54,707 INFO L273 TraceCheckUtils]: 132: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,707 INFO L273 TraceCheckUtils]: 133: Hoare triple {21919#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:07:54,707 INFO L273 TraceCheckUtils]: 134: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:07:54,707 INFO L273 TraceCheckUtils]: 135: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,707 INFO L273 TraceCheckUtils]: 136: Hoare triple {21919#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:07:54,707 INFO L273 TraceCheckUtils]: 137: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:07:54,708 INFO L273 TraceCheckUtils]: 138: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,708 INFO L273 TraceCheckUtils]: 139: Hoare triple {21919#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:07:54,708 INFO L273 TraceCheckUtils]: 140: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:07:54,708 INFO L273 TraceCheckUtils]: 141: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,708 INFO L273 TraceCheckUtils]: 142: Hoare triple {21919#false} assume !(~i~0 < 100); {21919#false} is VALID [2018-11-14 17:07:54,708 INFO L273 TraceCheckUtils]: 143: Hoare triple {21919#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21919#false} is VALID [2018-11-14 17:07:54,708 INFO L273 TraceCheckUtils]: 144: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,708 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {21919#false} {21919#false} #75#return; {21919#false} is VALID [2018-11-14 17:07:54,708 INFO L273 TraceCheckUtils]: 146: Hoare triple {21919#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {21919#false} is VALID [2018-11-14 17:07:54,708 INFO L273 TraceCheckUtils]: 147: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,709 INFO L273 TraceCheckUtils]: 148: Hoare triple {21919#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 17:07:54,709 INFO L273 TraceCheckUtils]: 149: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 17:07:54,709 INFO L273 TraceCheckUtils]: 150: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,709 INFO L273 TraceCheckUtils]: 151: Hoare triple {21919#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 17:07:54,709 INFO L273 TraceCheckUtils]: 152: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 17:07:54,709 INFO L273 TraceCheckUtils]: 153: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,709 INFO L273 TraceCheckUtils]: 154: Hoare triple {21919#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 17:07:54,709 INFO L273 TraceCheckUtils]: 155: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 17:07:54,709 INFO L273 TraceCheckUtils]: 156: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,710 INFO L273 TraceCheckUtils]: 157: Hoare triple {21919#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 17:07:54,710 INFO L273 TraceCheckUtils]: 158: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 17:07:54,710 INFO L273 TraceCheckUtils]: 159: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,710 INFO L273 TraceCheckUtils]: 160: Hoare triple {21919#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 17:07:54,710 INFO L273 TraceCheckUtils]: 161: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 17:07:54,710 INFO L273 TraceCheckUtils]: 162: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,710 INFO L273 TraceCheckUtils]: 163: Hoare triple {21919#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 17:07:54,710 INFO L273 TraceCheckUtils]: 164: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 17:07:54,710 INFO L273 TraceCheckUtils]: 165: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,710 INFO L273 TraceCheckUtils]: 166: Hoare triple {21919#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 17:07:54,711 INFO L273 TraceCheckUtils]: 167: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 17:07:54,711 INFO L273 TraceCheckUtils]: 168: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,711 INFO L273 TraceCheckUtils]: 169: Hoare triple {21919#false} assume !(~i~2 < 99); {21919#false} is VALID [2018-11-14 17:07:54,711 INFO L273 TraceCheckUtils]: 170: Hoare triple {21919#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {21919#false} is VALID [2018-11-14 17:07:54,711 INFO L256 TraceCheckUtils]: 171: Hoare triple {21919#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {21919#false} is VALID [2018-11-14 17:07:54,711 INFO L273 TraceCheckUtils]: 172: Hoare triple {21919#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21919#false} is VALID [2018-11-14 17:07:54,711 INFO L273 TraceCheckUtils]: 173: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,711 INFO L273 TraceCheckUtils]: 174: Hoare triple {21919#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:07:54,711 INFO L273 TraceCheckUtils]: 175: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:07:54,711 INFO L273 TraceCheckUtils]: 176: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,712 INFO L273 TraceCheckUtils]: 177: Hoare triple {21919#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:07:54,712 INFO L273 TraceCheckUtils]: 178: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:07:54,712 INFO L273 TraceCheckUtils]: 179: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,712 INFO L273 TraceCheckUtils]: 180: Hoare triple {21919#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:07:54,712 INFO L273 TraceCheckUtils]: 181: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:07:54,712 INFO L273 TraceCheckUtils]: 182: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,712 INFO L273 TraceCheckUtils]: 183: Hoare triple {21919#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:07:54,712 INFO L273 TraceCheckUtils]: 184: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:07:54,712 INFO L273 TraceCheckUtils]: 185: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,712 INFO L273 TraceCheckUtils]: 186: Hoare triple {21919#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:07:54,713 INFO L273 TraceCheckUtils]: 187: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:07:54,713 INFO L273 TraceCheckUtils]: 188: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,713 INFO L273 TraceCheckUtils]: 189: Hoare triple {21919#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:07:54,713 INFO L273 TraceCheckUtils]: 190: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:07:54,713 INFO L273 TraceCheckUtils]: 191: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,713 INFO L273 TraceCheckUtils]: 192: Hoare triple {21919#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:07:54,713 INFO L273 TraceCheckUtils]: 193: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:07:54,713 INFO L273 TraceCheckUtils]: 194: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,713 INFO L273 TraceCheckUtils]: 195: Hoare triple {21919#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 17:07:54,713 INFO L273 TraceCheckUtils]: 196: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 17:07:54,714 INFO L273 TraceCheckUtils]: 197: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,714 INFO L273 TraceCheckUtils]: 198: Hoare triple {21919#false} assume !(~i~0 < 100); {21919#false} is VALID [2018-11-14 17:07:54,714 INFO L273 TraceCheckUtils]: 199: Hoare triple {21919#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21919#false} is VALID [2018-11-14 17:07:54,714 INFO L273 TraceCheckUtils]: 200: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 17:07:54,714 INFO L268 TraceCheckUtils]: 201: Hoare quadruple {21919#false} {21919#false} #77#return; {21919#false} is VALID [2018-11-14 17:07:54,714 INFO L273 TraceCheckUtils]: 202: Hoare triple {21919#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {21919#false} is VALID [2018-11-14 17:07:54,714 INFO L273 TraceCheckUtils]: 203: Hoare triple {21919#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {21919#false} is VALID [2018-11-14 17:07:54,714 INFO L273 TraceCheckUtils]: 204: Hoare triple {21919#false} assume !false; {21919#false} is VALID [2018-11-14 17:07:54,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-11-14 17:07:54,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:54,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-14 17:07:54,754 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 205 [2018-11-14 17:07:54,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:54,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-14 17:07:54,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:54,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-14 17:07:54,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-14 17:07:54,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-14 17:07:54,890 INFO L87 Difference]: Start difference. First operand 146 states and 150 transitions. Second operand 29 states. [2018-11-14 17:07:55,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:55,810 INFO L93 Difference]: Finished difference Result 213 states and 221 transitions. [2018-11-14 17:07:55,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-14 17:07:55,810 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 205 [2018-11-14 17:07:55,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:55,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 17:07:55,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 135 transitions. [2018-11-14 17:07:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 17:07:55,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 135 transitions. [2018-11-14 17:07:55,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 135 transitions. [2018-11-14 17:07:55,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:55,933 INFO L225 Difference]: With dead ends: 213 [2018-11-14 17:07:55,933 INFO L226 Difference]: Without dead ends: 150 [2018-11-14 17:07:55,934 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-14 17:07:55,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-14 17:07:56,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-11-14 17:07:56,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:56,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand 149 states. [2018-11-14 17:07:56,040 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 149 states. [2018-11-14 17:07:56,040 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 149 states. [2018-11-14 17:07:56,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:56,042 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2018-11-14 17:07:56,043 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2018-11-14 17:07:56,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:56,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:56,043 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 150 states. [2018-11-14 17:07:56,043 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 150 states. [2018-11-14 17:07:56,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:56,045 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2018-11-14 17:07:56,045 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2018-11-14 17:07:56,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:56,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:56,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:56,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:56,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-14 17:07:56,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 153 transitions. [2018-11-14 17:07:56,048 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 153 transitions. Word has length 205 [2018-11-14 17:07:56,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:56,048 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 153 transitions. [2018-11-14 17:07:56,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-14 17:07:56,048 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 153 transitions. [2018-11-14 17:07:56,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-11-14 17:07:56,049 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:56,049 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 24, 24, 8, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:07:56,050 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:56,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:56,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1799796075, now seen corresponding path program 26 times [2018-11-14 17:07:56,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:56,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:56,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:56,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:07:56,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:56,617 INFO L256 TraceCheckUtils]: 0: Hoare triple {23348#true} call ULTIMATE.init(); {23348#true} is VALID [2018-11-14 17:07:56,617 INFO L273 TraceCheckUtils]: 1: Hoare triple {23348#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23348#true} is VALID [2018-11-14 17:07:56,617 INFO L273 TraceCheckUtils]: 2: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,618 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23348#true} {23348#true} #69#return; {23348#true} is VALID [2018-11-14 17:07:56,618 INFO L256 TraceCheckUtils]: 4: Hoare triple {23348#true} call #t~ret13 := main(); {23348#true} is VALID [2018-11-14 17:07:56,618 INFO L273 TraceCheckUtils]: 5: Hoare triple {23348#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {23350#(= main_~i~1 0)} is VALID [2018-11-14 17:07:56,619 INFO L273 TraceCheckUtils]: 6: Hoare triple {23350#(= main_~i~1 0)} assume true; {23350#(= main_~i~1 0)} is VALID [2018-11-14 17:07:56,619 INFO L273 TraceCheckUtils]: 7: Hoare triple {23350#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23350#(= main_~i~1 0)} is VALID [2018-11-14 17:07:56,620 INFO L273 TraceCheckUtils]: 8: Hoare triple {23350#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23351#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:56,620 INFO L273 TraceCheckUtils]: 9: Hoare triple {23351#(<= main_~i~1 1)} assume true; {23351#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:56,620 INFO L273 TraceCheckUtils]: 10: Hoare triple {23351#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23351#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:56,621 INFO L273 TraceCheckUtils]: 11: Hoare triple {23351#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23352#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:56,621 INFO L273 TraceCheckUtils]: 12: Hoare triple {23352#(<= main_~i~1 2)} assume true; {23352#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:56,622 INFO L273 TraceCheckUtils]: 13: Hoare triple {23352#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23352#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:56,622 INFO L273 TraceCheckUtils]: 14: Hoare triple {23352#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23353#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:56,623 INFO L273 TraceCheckUtils]: 15: Hoare triple {23353#(<= main_~i~1 3)} assume true; {23353#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:56,623 INFO L273 TraceCheckUtils]: 16: Hoare triple {23353#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23353#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:56,624 INFO L273 TraceCheckUtils]: 17: Hoare triple {23353#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23354#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:56,624 INFO L273 TraceCheckUtils]: 18: Hoare triple {23354#(<= main_~i~1 4)} assume true; {23354#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:56,625 INFO L273 TraceCheckUtils]: 19: Hoare triple {23354#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23354#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:56,625 INFO L273 TraceCheckUtils]: 20: Hoare triple {23354#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23355#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:56,626 INFO L273 TraceCheckUtils]: 21: Hoare triple {23355#(<= main_~i~1 5)} assume true; {23355#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:56,626 INFO L273 TraceCheckUtils]: 22: Hoare triple {23355#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23355#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:56,627 INFO L273 TraceCheckUtils]: 23: Hoare triple {23355#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23356#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:56,628 INFO L273 TraceCheckUtils]: 24: Hoare triple {23356#(<= main_~i~1 6)} assume true; {23356#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:56,628 INFO L273 TraceCheckUtils]: 25: Hoare triple {23356#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23356#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:56,629 INFO L273 TraceCheckUtils]: 26: Hoare triple {23356#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23357#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:56,629 INFO L273 TraceCheckUtils]: 27: Hoare triple {23357#(<= main_~i~1 7)} assume true; {23357#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:56,630 INFO L273 TraceCheckUtils]: 28: Hoare triple {23357#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23357#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:56,630 INFO L273 TraceCheckUtils]: 29: Hoare triple {23357#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23358#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:56,631 INFO L273 TraceCheckUtils]: 30: Hoare triple {23358#(<= main_~i~1 8)} assume true; {23358#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:56,631 INFO L273 TraceCheckUtils]: 31: Hoare triple {23358#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23358#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:56,632 INFO L273 TraceCheckUtils]: 32: Hoare triple {23358#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23359#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:56,632 INFO L273 TraceCheckUtils]: 33: Hoare triple {23359#(<= main_~i~1 9)} assume true; {23359#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:56,633 INFO L273 TraceCheckUtils]: 34: Hoare triple {23359#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23359#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:56,634 INFO L273 TraceCheckUtils]: 35: Hoare triple {23359#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23360#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:56,634 INFO L273 TraceCheckUtils]: 36: Hoare triple {23360#(<= main_~i~1 10)} assume true; {23360#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:56,634 INFO L273 TraceCheckUtils]: 37: Hoare triple {23360#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23360#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:56,635 INFO L273 TraceCheckUtils]: 38: Hoare triple {23360#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23361#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:56,636 INFO L273 TraceCheckUtils]: 39: Hoare triple {23361#(<= main_~i~1 11)} assume true; {23361#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:56,636 INFO L273 TraceCheckUtils]: 40: Hoare triple {23361#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23361#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:56,637 INFO L273 TraceCheckUtils]: 41: Hoare triple {23361#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23362#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:56,637 INFO L273 TraceCheckUtils]: 42: Hoare triple {23362#(<= main_~i~1 12)} assume true; {23362#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:56,638 INFO L273 TraceCheckUtils]: 43: Hoare triple {23362#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23362#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:56,639 INFO L273 TraceCheckUtils]: 44: Hoare triple {23362#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23363#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:56,639 INFO L273 TraceCheckUtils]: 45: Hoare triple {23363#(<= main_~i~1 13)} assume true; {23363#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:56,640 INFO L273 TraceCheckUtils]: 46: Hoare triple {23363#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23363#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:56,640 INFO L273 TraceCheckUtils]: 47: Hoare triple {23363#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23364#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:56,641 INFO L273 TraceCheckUtils]: 48: Hoare triple {23364#(<= main_~i~1 14)} assume true; {23364#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:56,641 INFO L273 TraceCheckUtils]: 49: Hoare triple {23364#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23364#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:56,642 INFO L273 TraceCheckUtils]: 50: Hoare triple {23364#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23365#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:56,642 INFO L273 TraceCheckUtils]: 51: Hoare triple {23365#(<= main_~i~1 15)} assume true; {23365#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:56,643 INFO L273 TraceCheckUtils]: 52: Hoare triple {23365#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23365#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:56,644 INFO L273 TraceCheckUtils]: 53: Hoare triple {23365#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23366#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:56,644 INFO L273 TraceCheckUtils]: 54: Hoare triple {23366#(<= main_~i~1 16)} assume true; {23366#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:56,645 INFO L273 TraceCheckUtils]: 55: Hoare triple {23366#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23366#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:56,645 INFO L273 TraceCheckUtils]: 56: Hoare triple {23366#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23367#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:56,646 INFO L273 TraceCheckUtils]: 57: Hoare triple {23367#(<= main_~i~1 17)} assume true; {23367#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:56,646 INFO L273 TraceCheckUtils]: 58: Hoare triple {23367#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23367#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:56,647 INFO L273 TraceCheckUtils]: 59: Hoare triple {23367#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23368#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:56,647 INFO L273 TraceCheckUtils]: 60: Hoare triple {23368#(<= main_~i~1 18)} assume true; {23368#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:56,648 INFO L273 TraceCheckUtils]: 61: Hoare triple {23368#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23368#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:56,649 INFO L273 TraceCheckUtils]: 62: Hoare triple {23368#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23369#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:56,649 INFO L273 TraceCheckUtils]: 63: Hoare triple {23369#(<= main_~i~1 19)} assume true; {23369#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:56,650 INFO L273 TraceCheckUtils]: 64: Hoare triple {23369#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23369#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:56,650 INFO L273 TraceCheckUtils]: 65: Hoare triple {23369#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23370#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:56,651 INFO L273 TraceCheckUtils]: 66: Hoare triple {23370#(<= main_~i~1 20)} assume true; {23370#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:56,651 INFO L273 TraceCheckUtils]: 67: Hoare triple {23370#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23370#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:56,652 INFO L273 TraceCheckUtils]: 68: Hoare triple {23370#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23371#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:56,653 INFO L273 TraceCheckUtils]: 69: Hoare triple {23371#(<= main_~i~1 21)} assume true; {23371#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:56,653 INFO L273 TraceCheckUtils]: 70: Hoare triple {23371#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23371#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:56,654 INFO L273 TraceCheckUtils]: 71: Hoare triple {23371#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23372#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:56,654 INFO L273 TraceCheckUtils]: 72: Hoare triple {23372#(<= main_~i~1 22)} assume true; {23372#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:56,655 INFO L273 TraceCheckUtils]: 73: Hoare triple {23372#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23372#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:56,656 INFO L273 TraceCheckUtils]: 74: Hoare triple {23372#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23373#(<= main_~i~1 23)} is VALID [2018-11-14 17:07:56,656 INFO L273 TraceCheckUtils]: 75: Hoare triple {23373#(<= main_~i~1 23)} assume true; {23373#(<= main_~i~1 23)} is VALID [2018-11-14 17:07:56,657 INFO L273 TraceCheckUtils]: 76: Hoare triple {23373#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23373#(<= main_~i~1 23)} is VALID [2018-11-14 17:07:56,657 INFO L273 TraceCheckUtils]: 77: Hoare triple {23373#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23374#(<= main_~i~1 24)} is VALID [2018-11-14 17:07:56,658 INFO L273 TraceCheckUtils]: 78: Hoare triple {23374#(<= main_~i~1 24)} assume true; {23374#(<= main_~i~1 24)} is VALID [2018-11-14 17:07:56,658 INFO L273 TraceCheckUtils]: 79: Hoare triple {23374#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23374#(<= main_~i~1 24)} is VALID [2018-11-14 17:07:56,659 INFO L273 TraceCheckUtils]: 80: Hoare triple {23374#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23375#(<= main_~i~1 25)} is VALID [2018-11-14 17:07:56,660 INFO L273 TraceCheckUtils]: 81: Hoare triple {23375#(<= main_~i~1 25)} assume true; {23375#(<= main_~i~1 25)} is VALID [2018-11-14 17:07:56,660 INFO L273 TraceCheckUtils]: 82: Hoare triple {23375#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23375#(<= main_~i~1 25)} is VALID [2018-11-14 17:07:56,661 INFO L273 TraceCheckUtils]: 83: Hoare triple {23375#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23376#(<= main_~i~1 26)} is VALID [2018-11-14 17:07:56,661 INFO L273 TraceCheckUtils]: 84: Hoare triple {23376#(<= main_~i~1 26)} assume true; {23376#(<= main_~i~1 26)} is VALID [2018-11-14 17:07:56,662 INFO L273 TraceCheckUtils]: 85: Hoare triple {23376#(<= main_~i~1 26)} assume !(~i~1 < 100); {23349#false} is VALID [2018-11-14 17:07:56,662 INFO L256 TraceCheckUtils]: 86: Hoare triple {23349#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {23348#true} is VALID [2018-11-14 17:07:56,662 INFO L273 TraceCheckUtils]: 87: Hoare triple {23348#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23348#true} is VALID [2018-11-14 17:07:56,663 INFO L273 TraceCheckUtils]: 88: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,663 INFO L273 TraceCheckUtils]: 89: Hoare triple {23348#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:07:56,663 INFO L273 TraceCheckUtils]: 90: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:07:56,663 INFO L273 TraceCheckUtils]: 91: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,663 INFO L273 TraceCheckUtils]: 92: Hoare triple {23348#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:07:56,663 INFO L273 TraceCheckUtils]: 93: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:07:56,664 INFO L273 TraceCheckUtils]: 94: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,664 INFO L273 TraceCheckUtils]: 95: Hoare triple {23348#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:07:56,664 INFO L273 TraceCheckUtils]: 96: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:07:56,664 INFO L273 TraceCheckUtils]: 97: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,665 INFO L273 TraceCheckUtils]: 98: Hoare triple {23348#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:07:56,665 INFO L273 TraceCheckUtils]: 99: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:07:56,665 INFO L273 TraceCheckUtils]: 100: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,665 INFO L273 TraceCheckUtils]: 101: Hoare triple {23348#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:07:56,666 INFO L273 TraceCheckUtils]: 102: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:07:56,666 INFO L273 TraceCheckUtils]: 103: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,666 INFO L273 TraceCheckUtils]: 104: Hoare triple {23348#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:07:56,667 INFO L273 TraceCheckUtils]: 105: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:07:56,667 INFO L273 TraceCheckUtils]: 106: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,667 INFO L273 TraceCheckUtils]: 107: Hoare triple {23348#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:07:56,667 INFO L273 TraceCheckUtils]: 108: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:07:56,667 INFO L273 TraceCheckUtils]: 109: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,668 INFO L273 TraceCheckUtils]: 110: Hoare triple {23348#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:07:56,668 INFO L273 TraceCheckUtils]: 111: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:07:56,668 INFO L273 TraceCheckUtils]: 112: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,668 INFO L273 TraceCheckUtils]: 113: Hoare triple {23348#true} assume !(~i~0 < 100); {23348#true} is VALID [2018-11-14 17:07:56,668 INFO L273 TraceCheckUtils]: 114: Hoare triple {23348#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23348#true} is VALID [2018-11-14 17:07:56,668 INFO L273 TraceCheckUtils]: 115: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,669 INFO L268 TraceCheckUtils]: 116: Hoare quadruple {23348#true} {23349#false} #73#return; {23349#false} is VALID [2018-11-14 17:07:56,669 INFO L273 TraceCheckUtils]: 117: Hoare triple {23349#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {23349#false} is VALID [2018-11-14 17:07:56,669 INFO L256 TraceCheckUtils]: 118: Hoare triple {23349#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {23348#true} is VALID [2018-11-14 17:07:56,669 INFO L273 TraceCheckUtils]: 119: Hoare triple {23348#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23348#true} is VALID [2018-11-14 17:07:56,669 INFO L273 TraceCheckUtils]: 120: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,669 INFO L273 TraceCheckUtils]: 121: Hoare triple {23348#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:07:56,670 INFO L273 TraceCheckUtils]: 122: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:07:56,670 INFO L273 TraceCheckUtils]: 123: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,670 INFO L273 TraceCheckUtils]: 124: Hoare triple {23348#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:07:56,670 INFO L273 TraceCheckUtils]: 125: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:07:56,670 INFO L273 TraceCheckUtils]: 126: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,670 INFO L273 TraceCheckUtils]: 127: Hoare triple {23348#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:07:56,671 INFO L273 TraceCheckUtils]: 128: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:07:56,671 INFO L273 TraceCheckUtils]: 129: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,671 INFO L273 TraceCheckUtils]: 130: Hoare triple {23348#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:07:56,671 INFO L273 TraceCheckUtils]: 131: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:07:56,671 INFO L273 TraceCheckUtils]: 132: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,671 INFO L273 TraceCheckUtils]: 133: Hoare triple {23348#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:07:56,671 INFO L273 TraceCheckUtils]: 134: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:07:56,672 INFO L273 TraceCheckUtils]: 135: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,672 INFO L273 TraceCheckUtils]: 136: Hoare triple {23348#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:07:56,672 INFO L273 TraceCheckUtils]: 137: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:07:56,672 INFO L273 TraceCheckUtils]: 138: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,672 INFO L273 TraceCheckUtils]: 139: Hoare triple {23348#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:07:56,672 INFO L273 TraceCheckUtils]: 140: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:07:56,672 INFO L273 TraceCheckUtils]: 141: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,673 INFO L273 TraceCheckUtils]: 142: Hoare triple {23348#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:07:56,673 INFO L273 TraceCheckUtils]: 143: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:07:56,673 INFO L273 TraceCheckUtils]: 144: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,673 INFO L273 TraceCheckUtils]: 145: Hoare triple {23348#true} assume !(~i~0 < 100); {23348#true} is VALID [2018-11-14 17:07:56,673 INFO L273 TraceCheckUtils]: 146: Hoare triple {23348#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23348#true} is VALID [2018-11-14 17:07:56,673 INFO L273 TraceCheckUtils]: 147: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,674 INFO L268 TraceCheckUtils]: 148: Hoare quadruple {23348#true} {23349#false} #75#return; {23349#false} is VALID [2018-11-14 17:07:56,674 INFO L273 TraceCheckUtils]: 149: Hoare triple {23349#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {23349#false} is VALID [2018-11-14 17:07:56,674 INFO L273 TraceCheckUtils]: 150: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:56,674 INFO L273 TraceCheckUtils]: 151: Hoare triple {23349#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 17:07:56,674 INFO L273 TraceCheckUtils]: 152: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 17:07:56,674 INFO L273 TraceCheckUtils]: 153: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:56,674 INFO L273 TraceCheckUtils]: 154: Hoare triple {23349#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 17:07:56,675 INFO L273 TraceCheckUtils]: 155: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 17:07:56,675 INFO L273 TraceCheckUtils]: 156: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:56,675 INFO L273 TraceCheckUtils]: 157: Hoare triple {23349#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 17:07:56,675 INFO L273 TraceCheckUtils]: 158: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 17:07:56,675 INFO L273 TraceCheckUtils]: 159: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:56,675 INFO L273 TraceCheckUtils]: 160: Hoare triple {23349#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 17:07:56,675 INFO L273 TraceCheckUtils]: 161: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 17:07:56,676 INFO L273 TraceCheckUtils]: 162: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:56,676 INFO L273 TraceCheckUtils]: 163: Hoare triple {23349#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 17:07:56,676 INFO L273 TraceCheckUtils]: 164: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 17:07:56,676 INFO L273 TraceCheckUtils]: 165: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:56,676 INFO L273 TraceCheckUtils]: 166: Hoare triple {23349#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 17:07:56,676 INFO L273 TraceCheckUtils]: 167: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 17:07:56,677 INFO L273 TraceCheckUtils]: 168: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:56,677 INFO L273 TraceCheckUtils]: 169: Hoare triple {23349#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 17:07:56,677 INFO L273 TraceCheckUtils]: 170: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 17:07:56,677 INFO L273 TraceCheckUtils]: 171: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:56,677 INFO L273 TraceCheckUtils]: 172: Hoare triple {23349#false} assume !(~i~2 < 99); {23349#false} is VALID [2018-11-14 17:07:56,677 INFO L273 TraceCheckUtils]: 173: Hoare triple {23349#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {23349#false} is VALID [2018-11-14 17:07:56,677 INFO L256 TraceCheckUtils]: 174: Hoare triple {23349#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {23348#true} is VALID [2018-11-14 17:07:56,678 INFO L273 TraceCheckUtils]: 175: Hoare triple {23348#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23348#true} is VALID [2018-11-14 17:07:56,678 INFO L273 TraceCheckUtils]: 176: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,678 INFO L273 TraceCheckUtils]: 177: Hoare triple {23348#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:07:56,678 INFO L273 TraceCheckUtils]: 178: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:07:56,678 INFO L273 TraceCheckUtils]: 179: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,678 INFO L273 TraceCheckUtils]: 180: Hoare triple {23348#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:07:56,678 INFO L273 TraceCheckUtils]: 181: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:07:56,679 INFO L273 TraceCheckUtils]: 182: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,679 INFO L273 TraceCheckUtils]: 183: Hoare triple {23348#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:07:56,679 INFO L273 TraceCheckUtils]: 184: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:07:56,679 INFO L273 TraceCheckUtils]: 185: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,679 INFO L273 TraceCheckUtils]: 186: Hoare triple {23348#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:07:56,679 INFO L273 TraceCheckUtils]: 187: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:07:56,680 INFO L273 TraceCheckUtils]: 188: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,680 INFO L273 TraceCheckUtils]: 189: Hoare triple {23348#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:07:56,680 INFO L273 TraceCheckUtils]: 190: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:07:56,680 INFO L273 TraceCheckUtils]: 191: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,680 INFO L273 TraceCheckUtils]: 192: Hoare triple {23348#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:07:56,680 INFO L273 TraceCheckUtils]: 193: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:07:56,680 INFO L273 TraceCheckUtils]: 194: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,681 INFO L273 TraceCheckUtils]: 195: Hoare triple {23348#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:07:56,681 INFO L273 TraceCheckUtils]: 196: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:07:56,681 INFO L273 TraceCheckUtils]: 197: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,681 INFO L273 TraceCheckUtils]: 198: Hoare triple {23348#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 17:07:56,681 INFO L273 TraceCheckUtils]: 199: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 17:07:56,681 INFO L273 TraceCheckUtils]: 200: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,682 INFO L273 TraceCheckUtils]: 201: Hoare triple {23348#true} assume !(~i~0 < 100); {23348#true} is VALID [2018-11-14 17:07:56,682 INFO L273 TraceCheckUtils]: 202: Hoare triple {23348#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23348#true} is VALID [2018-11-14 17:07:56,682 INFO L273 TraceCheckUtils]: 203: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:56,682 INFO L268 TraceCheckUtils]: 204: Hoare quadruple {23348#true} {23349#false} #77#return; {23349#false} is VALID [2018-11-14 17:07:56,682 INFO L273 TraceCheckUtils]: 205: Hoare triple {23349#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {23349#false} is VALID [2018-11-14 17:07:56,682 INFO L273 TraceCheckUtils]: 206: Hoare triple {23349#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {23349#false} is VALID [2018-11-14 17:07:56,682 INFO L273 TraceCheckUtils]: 207: Hoare triple {23349#false} assume !false; {23349#false} is VALID [2018-11-14 17:07:56,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2094 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-11-14 17:07:56,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:56,709 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:07:56,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:07:56,794 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:07:56,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:56,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:57,134 INFO L256 TraceCheckUtils]: 0: Hoare triple {23348#true} call ULTIMATE.init(); {23348#true} is VALID [2018-11-14 17:07:57,134 INFO L273 TraceCheckUtils]: 1: Hoare triple {23348#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23348#true} is VALID [2018-11-14 17:07:57,134 INFO L273 TraceCheckUtils]: 2: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 17:07:57,135 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23348#true} {23348#true} #69#return; {23348#true} is VALID [2018-11-14 17:07:57,135 INFO L256 TraceCheckUtils]: 4: Hoare triple {23348#true} call #t~ret13 := main(); {23348#true} is VALID [2018-11-14 17:07:57,135 INFO L273 TraceCheckUtils]: 5: Hoare triple {23348#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {23395#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:57,136 INFO L273 TraceCheckUtils]: 6: Hoare triple {23395#(<= main_~i~1 0)} assume true; {23395#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:57,136 INFO L273 TraceCheckUtils]: 7: Hoare triple {23395#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23395#(<= main_~i~1 0)} is VALID [2018-11-14 17:07:57,137 INFO L273 TraceCheckUtils]: 8: Hoare triple {23395#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23351#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:57,137 INFO L273 TraceCheckUtils]: 9: Hoare triple {23351#(<= main_~i~1 1)} assume true; {23351#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:57,138 INFO L273 TraceCheckUtils]: 10: Hoare triple {23351#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23351#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:57,138 INFO L273 TraceCheckUtils]: 11: Hoare triple {23351#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23352#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:57,138 INFO L273 TraceCheckUtils]: 12: Hoare triple {23352#(<= main_~i~1 2)} assume true; {23352#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:57,139 INFO L273 TraceCheckUtils]: 13: Hoare triple {23352#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23352#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:57,139 INFO L273 TraceCheckUtils]: 14: Hoare triple {23352#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23353#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:57,140 INFO L273 TraceCheckUtils]: 15: Hoare triple {23353#(<= main_~i~1 3)} assume true; {23353#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:57,140 INFO L273 TraceCheckUtils]: 16: Hoare triple {23353#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23353#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:57,141 INFO L273 TraceCheckUtils]: 17: Hoare triple {23353#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23354#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:57,141 INFO L273 TraceCheckUtils]: 18: Hoare triple {23354#(<= main_~i~1 4)} assume true; {23354#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:57,142 INFO L273 TraceCheckUtils]: 19: Hoare triple {23354#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23354#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:57,142 INFO L273 TraceCheckUtils]: 20: Hoare triple {23354#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23355#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:57,143 INFO L273 TraceCheckUtils]: 21: Hoare triple {23355#(<= main_~i~1 5)} assume true; {23355#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:57,143 INFO L273 TraceCheckUtils]: 22: Hoare triple {23355#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23355#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:57,144 INFO L273 TraceCheckUtils]: 23: Hoare triple {23355#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23356#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:57,145 INFO L273 TraceCheckUtils]: 24: Hoare triple {23356#(<= main_~i~1 6)} assume true; {23356#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:57,145 INFO L273 TraceCheckUtils]: 25: Hoare triple {23356#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23356#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:57,146 INFO L273 TraceCheckUtils]: 26: Hoare triple {23356#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23357#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:57,146 INFO L273 TraceCheckUtils]: 27: Hoare triple {23357#(<= main_~i~1 7)} assume true; {23357#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:57,147 INFO L273 TraceCheckUtils]: 28: Hoare triple {23357#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23357#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:57,147 INFO L273 TraceCheckUtils]: 29: Hoare triple {23357#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23358#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:57,148 INFO L273 TraceCheckUtils]: 30: Hoare triple {23358#(<= main_~i~1 8)} assume true; {23358#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:57,148 INFO L273 TraceCheckUtils]: 31: Hoare triple {23358#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23358#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:57,149 INFO L273 TraceCheckUtils]: 32: Hoare triple {23358#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23359#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:57,150 INFO L273 TraceCheckUtils]: 33: Hoare triple {23359#(<= main_~i~1 9)} assume true; {23359#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:57,150 INFO L273 TraceCheckUtils]: 34: Hoare triple {23359#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23359#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:57,151 INFO L273 TraceCheckUtils]: 35: Hoare triple {23359#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23360#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:57,151 INFO L273 TraceCheckUtils]: 36: Hoare triple {23360#(<= main_~i~1 10)} assume true; {23360#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:57,152 INFO L273 TraceCheckUtils]: 37: Hoare triple {23360#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23360#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:57,152 INFO L273 TraceCheckUtils]: 38: Hoare triple {23360#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23361#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:57,153 INFO L273 TraceCheckUtils]: 39: Hoare triple {23361#(<= main_~i~1 11)} assume true; {23361#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:57,153 INFO L273 TraceCheckUtils]: 40: Hoare triple {23361#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23361#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:57,154 INFO L273 TraceCheckUtils]: 41: Hoare triple {23361#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23362#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:57,155 INFO L273 TraceCheckUtils]: 42: Hoare triple {23362#(<= main_~i~1 12)} assume true; {23362#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:57,155 INFO L273 TraceCheckUtils]: 43: Hoare triple {23362#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23362#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:57,156 INFO L273 TraceCheckUtils]: 44: Hoare triple {23362#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23363#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:57,156 INFO L273 TraceCheckUtils]: 45: Hoare triple {23363#(<= main_~i~1 13)} assume true; {23363#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:57,157 INFO L273 TraceCheckUtils]: 46: Hoare triple {23363#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23363#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:57,157 INFO L273 TraceCheckUtils]: 47: Hoare triple {23363#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23364#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:57,158 INFO L273 TraceCheckUtils]: 48: Hoare triple {23364#(<= main_~i~1 14)} assume true; {23364#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:57,158 INFO L273 TraceCheckUtils]: 49: Hoare triple {23364#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23364#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:57,159 INFO L273 TraceCheckUtils]: 50: Hoare triple {23364#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23365#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:57,160 INFO L273 TraceCheckUtils]: 51: Hoare triple {23365#(<= main_~i~1 15)} assume true; {23365#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:57,160 INFO L273 TraceCheckUtils]: 52: Hoare triple {23365#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23365#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:57,161 INFO L273 TraceCheckUtils]: 53: Hoare triple {23365#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23366#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:57,161 INFO L273 TraceCheckUtils]: 54: Hoare triple {23366#(<= main_~i~1 16)} assume true; {23366#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:57,162 INFO L273 TraceCheckUtils]: 55: Hoare triple {23366#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23366#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:57,162 INFO L273 TraceCheckUtils]: 56: Hoare triple {23366#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23367#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:57,163 INFO L273 TraceCheckUtils]: 57: Hoare triple {23367#(<= main_~i~1 17)} assume true; {23367#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:57,163 INFO L273 TraceCheckUtils]: 58: Hoare triple {23367#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23367#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:57,164 INFO L273 TraceCheckUtils]: 59: Hoare triple {23367#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23368#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:57,164 INFO L273 TraceCheckUtils]: 60: Hoare triple {23368#(<= main_~i~1 18)} assume true; {23368#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:57,165 INFO L273 TraceCheckUtils]: 61: Hoare triple {23368#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23368#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:57,165 INFO L273 TraceCheckUtils]: 62: Hoare triple {23368#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23369#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:57,166 INFO L273 TraceCheckUtils]: 63: Hoare triple {23369#(<= main_~i~1 19)} assume true; {23369#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:57,166 INFO L273 TraceCheckUtils]: 64: Hoare triple {23369#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23369#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:57,167 INFO L273 TraceCheckUtils]: 65: Hoare triple {23369#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23370#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:57,168 INFO L273 TraceCheckUtils]: 66: Hoare triple {23370#(<= main_~i~1 20)} assume true; {23370#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:57,168 INFO L273 TraceCheckUtils]: 67: Hoare triple {23370#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23370#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:57,169 INFO L273 TraceCheckUtils]: 68: Hoare triple {23370#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23371#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:57,169 INFO L273 TraceCheckUtils]: 69: Hoare triple {23371#(<= main_~i~1 21)} assume true; {23371#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:57,170 INFO L273 TraceCheckUtils]: 70: Hoare triple {23371#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23371#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:57,170 INFO L273 TraceCheckUtils]: 71: Hoare triple {23371#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23372#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:57,171 INFO L273 TraceCheckUtils]: 72: Hoare triple {23372#(<= main_~i~1 22)} assume true; {23372#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:57,171 INFO L273 TraceCheckUtils]: 73: Hoare triple {23372#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23372#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:57,172 INFO L273 TraceCheckUtils]: 74: Hoare triple {23372#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23373#(<= main_~i~1 23)} is VALID [2018-11-14 17:07:57,172 INFO L273 TraceCheckUtils]: 75: Hoare triple {23373#(<= main_~i~1 23)} assume true; {23373#(<= main_~i~1 23)} is VALID [2018-11-14 17:07:57,173 INFO L273 TraceCheckUtils]: 76: Hoare triple {23373#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23373#(<= main_~i~1 23)} is VALID [2018-11-14 17:07:57,174 INFO L273 TraceCheckUtils]: 77: Hoare triple {23373#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23374#(<= main_~i~1 24)} is VALID [2018-11-14 17:07:57,174 INFO L273 TraceCheckUtils]: 78: Hoare triple {23374#(<= main_~i~1 24)} assume true; {23374#(<= main_~i~1 24)} is VALID [2018-11-14 17:07:57,175 INFO L273 TraceCheckUtils]: 79: Hoare triple {23374#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23374#(<= main_~i~1 24)} is VALID [2018-11-14 17:07:57,175 INFO L273 TraceCheckUtils]: 80: Hoare triple {23374#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23375#(<= main_~i~1 25)} is VALID [2018-11-14 17:07:57,176 INFO L273 TraceCheckUtils]: 81: Hoare triple {23375#(<= main_~i~1 25)} assume true; {23375#(<= main_~i~1 25)} is VALID [2018-11-14 17:07:57,176 INFO L273 TraceCheckUtils]: 82: Hoare triple {23375#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23375#(<= main_~i~1 25)} is VALID [2018-11-14 17:07:57,177 INFO L273 TraceCheckUtils]: 83: Hoare triple {23375#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23376#(<= main_~i~1 26)} is VALID [2018-11-14 17:07:57,177 INFO L273 TraceCheckUtils]: 84: Hoare triple {23376#(<= main_~i~1 26)} assume true; {23376#(<= main_~i~1 26)} is VALID [2018-11-14 17:07:57,178 INFO L273 TraceCheckUtils]: 85: Hoare triple {23376#(<= main_~i~1 26)} assume !(~i~1 < 100); {23349#false} is VALID [2018-11-14 17:07:57,178 INFO L256 TraceCheckUtils]: 86: Hoare triple {23349#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {23349#false} is VALID [2018-11-14 17:07:57,178 INFO L273 TraceCheckUtils]: 87: Hoare triple {23349#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23349#false} is VALID [2018-11-14 17:07:57,178 INFO L273 TraceCheckUtils]: 88: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,179 INFO L273 TraceCheckUtils]: 89: Hoare triple {23349#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:07:57,179 INFO L273 TraceCheckUtils]: 90: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:07:57,179 INFO L273 TraceCheckUtils]: 91: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,179 INFO L273 TraceCheckUtils]: 92: Hoare triple {23349#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:07:57,179 INFO L273 TraceCheckUtils]: 93: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:07:57,180 INFO L273 TraceCheckUtils]: 94: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,180 INFO L273 TraceCheckUtils]: 95: Hoare triple {23349#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:07:57,180 INFO L273 TraceCheckUtils]: 96: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:07:57,180 INFO L273 TraceCheckUtils]: 97: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,180 INFO L273 TraceCheckUtils]: 98: Hoare triple {23349#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:07:57,180 INFO L273 TraceCheckUtils]: 99: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:07:57,181 INFO L273 TraceCheckUtils]: 100: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,181 INFO L273 TraceCheckUtils]: 101: Hoare triple {23349#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:07:57,181 INFO L273 TraceCheckUtils]: 102: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:07:57,181 INFO L273 TraceCheckUtils]: 103: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,181 INFO L273 TraceCheckUtils]: 104: Hoare triple {23349#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:07:57,181 INFO L273 TraceCheckUtils]: 105: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:07:57,181 INFO L273 TraceCheckUtils]: 106: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,182 INFO L273 TraceCheckUtils]: 107: Hoare triple {23349#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:07:57,182 INFO L273 TraceCheckUtils]: 108: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:07:57,182 INFO L273 TraceCheckUtils]: 109: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,182 INFO L273 TraceCheckUtils]: 110: Hoare triple {23349#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:07:57,182 INFO L273 TraceCheckUtils]: 111: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:07:57,182 INFO L273 TraceCheckUtils]: 112: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,182 INFO L273 TraceCheckUtils]: 113: Hoare triple {23349#false} assume !(~i~0 < 100); {23349#false} is VALID [2018-11-14 17:07:57,182 INFO L273 TraceCheckUtils]: 114: Hoare triple {23349#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23349#false} is VALID [2018-11-14 17:07:57,182 INFO L273 TraceCheckUtils]: 115: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,182 INFO L268 TraceCheckUtils]: 116: Hoare quadruple {23349#false} {23349#false} #73#return; {23349#false} is VALID [2018-11-14 17:07:57,183 INFO L273 TraceCheckUtils]: 117: Hoare triple {23349#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {23349#false} is VALID [2018-11-14 17:07:57,183 INFO L256 TraceCheckUtils]: 118: Hoare triple {23349#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {23349#false} is VALID [2018-11-14 17:07:57,183 INFO L273 TraceCheckUtils]: 119: Hoare triple {23349#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23349#false} is VALID [2018-11-14 17:07:57,183 INFO L273 TraceCheckUtils]: 120: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,183 INFO L273 TraceCheckUtils]: 121: Hoare triple {23349#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:07:57,183 INFO L273 TraceCheckUtils]: 122: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:07:57,183 INFO L273 TraceCheckUtils]: 123: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,183 INFO L273 TraceCheckUtils]: 124: Hoare triple {23349#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:07:57,183 INFO L273 TraceCheckUtils]: 125: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:07:57,184 INFO L273 TraceCheckUtils]: 126: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,184 INFO L273 TraceCheckUtils]: 127: Hoare triple {23349#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:07:57,184 INFO L273 TraceCheckUtils]: 128: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:07:57,184 INFO L273 TraceCheckUtils]: 129: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,184 INFO L273 TraceCheckUtils]: 130: Hoare triple {23349#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:07:57,184 INFO L273 TraceCheckUtils]: 131: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:07:57,184 INFO L273 TraceCheckUtils]: 132: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,184 INFO L273 TraceCheckUtils]: 133: Hoare triple {23349#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:07:57,184 INFO L273 TraceCheckUtils]: 134: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:07:57,184 INFO L273 TraceCheckUtils]: 135: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,185 INFO L273 TraceCheckUtils]: 136: Hoare triple {23349#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:07:57,185 INFO L273 TraceCheckUtils]: 137: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:07:57,185 INFO L273 TraceCheckUtils]: 138: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,185 INFO L273 TraceCheckUtils]: 139: Hoare triple {23349#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:07:57,185 INFO L273 TraceCheckUtils]: 140: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:07:57,185 INFO L273 TraceCheckUtils]: 141: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,185 INFO L273 TraceCheckUtils]: 142: Hoare triple {23349#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:07:57,185 INFO L273 TraceCheckUtils]: 143: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:07:57,185 INFO L273 TraceCheckUtils]: 144: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,185 INFO L273 TraceCheckUtils]: 145: Hoare triple {23349#false} assume !(~i~0 < 100); {23349#false} is VALID [2018-11-14 17:07:57,186 INFO L273 TraceCheckUtils]: 146: Hoare triple {23349#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23349#false} is VALID [2018-11-14 17:07:57,186 INFO L273 TraceCheckUtils]: 147: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,186 INFO L268 TraceCheckUtils]: 148: Hoare quadruple {23349#false} {23349#false} #75#return; {23349#false} is VALID [2018-11-14 17:07:57,186 INFO L273 TraceCheckUtils]: 149: Hoare triple {23349#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {23349#false} is VALID [2018-11-14 17:07:57,186 INFO L273 TraceCheckUtils]: 150: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,186 INFO L273 TraceCheckUtils]: 151: Hoare triple {23349#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 17:07:57,186 INFO L273 TraceCheckUtils]: 152: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 17:07:57,186 INFO L273 TraceCheckUtils]: 153: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,186 INFO L273 TraceCheckUtils]: 154: Hoare triple {23349#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 17:07:57,186 INFO L273 TraceCheckUtils]: 155: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 17:07:57,187 INFO L273 TraceCheckUtils]: 156: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,187 INFO L273 TraceCheckUtils]: 157: Hoare triple {23349#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 17:07:57,187 INFO L273 TraceCheckUtils]: 158: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 17:07:57,187 INFO L273 TraceCheckUtils]: 159: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,187 INFO L273 TraceCheckUtils]: 160: Hoare triple {23349#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 17:07:57,187 INFO L273 TraceCheckUtils]: 161: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 17:07:57,187 INFO L273 TraceCheckUtils]: 162: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,187 INFO L273 TraceCheckUtils]: 163: Hoare triple {23349#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 17:07:57,187 INFO L273 TraceCheckUtils]: 164: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 17:07:57,187 INFO L273 TraceCheckUtils]: 165: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,188 INFO L273 TraceCheckUtils]: 166: Hoare triple {23349#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 17:07:57,188 INFO L273 TraceCheckUtils]: 167: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 17:07:57,188 INFO L273 TraceCheckUtils]: 168: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,188 INFO L273 TraceCheckUtils]: 169: Hoare triple {23349#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 17:07:57,188 INFO L273 TraceCheckUtils]: 170: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 17:07:57,188 INFO L273 TraceCheckUtils]: 171: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,188 INFO L273 TraceCheckUtils]: 172: Hoare triple {23349#false} assume !(~i~2 < 99); {23349#false} is VALID [2018-11-14 17:07:57,188 INFO L273 TraceCheckUtils]: 173: Hoare triple {23349#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {23349#false} is VALID [2018-11-14 17:07:57,188 INFO L256 TraceCheckUtils]: 174: Hoare triple {23349#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {23349#false} is VALID [2018-11-14 17:07:57,189 INFO L273 TraceCheckUtils]: 175: Hoare triple {23349#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23349#false} is VALID [2018-11-14 17:07:57,189 INFO L273 TraceCheckUtils]: 176: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,189 INFO L273 TraceCheckUtils]: 177: Hoare triple {23349#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:07:57,189 INFO L273 TraceCheckUtils]: 178: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:07:57,189 INFO L273 TraceCheckUtils]: 179: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,189 INFO L273 TraceCheckUtils]: 180: Hoare triple {23349#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:07:57,189 INFO L273 TraceCheckUtils]: 181: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:07:57,189 INFO L273 TraceCheckUtils]: 182: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,189 INFO L273 TraceCheckUtils]: 183: Hoare triple {23349#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:07:57,189 INFO L273 TraceCheckUtils]: 184: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:07:57,190 INFO L273 TraceCheckUtils]: 185: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,190 INFO L273 TraceCheckUtils]: 186: Hoare triple {23349#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:07:57,190 INFO L273 TraceCheckUtils]: 187: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:07:57,190 INFO L273 TraceCheckUtils]: 188: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,190 INFO L273 TraceCheckUtils]: 189: Hoare triple {23349#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:07:57,190 INFO L273 TraceCheckUtils]: 190: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:07:57,190 INFO L273 TraceCheckUtils]: 191: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,190 INFO L273 TraceCheckUtils]: 192: Hoare triple {23349#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:07:57,190 INFO L273 TraceCheckUtils]: 193: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:07:57,190 INFO L273 TraceCheckUtils]: 194: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,191 INFO L273 TraceCheckUtils]: 195: Hoare triple {23349#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:07:57,191 INFO L273 TraceCheckUtils]: 196: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:07:57,191 INFO L273 TraceCheckUtils]: 197: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,191 INFO L273 TraceCheckUtils]: 198: Hoare triple {23349#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 17:07:57,191 INFO L273 TraceCheckUtils]: 199: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 17:07:57,191 INFO L273 TraceCheckUtils]: 200: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,191 INFO L273 TraceCheckUtils]: 201: Hoare triple {23349#false} assume !(~i~0 < 100); {23349#false} is VALID [2018-11-14 17:07:57,191 INFO L273 TraceCheckUtils]: 202: Hoare triple {23349#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23349#false} is VALID [2018-11-14 17:07:57,191 INFO L273 TraceCheckUtils]: 203: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 17:07:57,191 INFO L268 TraceCheckUtils]: 204: Hoare quadruple {23349#false} {23349#false} #77#return; {23349#false} is VALID [2018-11-14 17:07:57,192 INFO L273 TraceCheckUtils]: 205: Hoare triple {23349#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {23349#false} is VALID [2018-11-14 17:07:57,192 INFO L273 TraceCheckUtils]: 206: Hoare triple {23349#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {23349#false} is VALID [2018-11-14 17:07:57,192 INFO L273 TraceCheckUtils]: 207: Hoare triple {23349#false} assume !false; {23349#false} is VALID [2018-11-14 17:07:57,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2094 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-11-14 17:07:57,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:57,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-14 17:07:57,233 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 208 [2018-11-14 17:07:57,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:57,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-14 17:07:57,351 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:57,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-14 17:07:57,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-14 17:07:57,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-14 17:07:57,352 INFO L87 Difference]: Start difference. First operand 149 states and 153 transitions. Second operand 30 states. [2018-11-14 17:07:57,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:57,962 INFO L93 Difference]: Finished difference Result 216 states and 224 transitions. [2018-11-14 17:07:57,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-14 17:07:57,962 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 208 [2018-11-14 17:07:57,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:07:57,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 17:07:57,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 138 transitions. [2018-11-14 17:07:57,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 17:07:57,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 138 transitions. [2018-11-14 17:07:57,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 138 transitions. [2018-11-14 17:07:58,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:58,088 INFO L225 Difference]: With dead ends: 216 [2018-11-14 17:07:58,089 INFO L226 Difference]: Without dead ends: 153 [2018-11-14 17:07:58,089 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-14 17:07:58,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-14 17:07:58,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2018-11-14 17:07:58,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:07:58,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 152 states. [2018-11-14 17:07:58,130 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 152 states. [2018-11-14 17:07:58,130 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 152 states. [2018-11-14 17:07:58,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:58,133 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-11-14 17:07:58,133 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-14 17:07:58,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:58,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:58,133 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 153 states. [2018-11-14 17:07:58,133 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 153 states. [2018-11-14 17:07:58,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:07:58,136 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-11-14 17:07:58,136 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-14 17:07:58,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:07:58,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:07:58,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:07:58,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:07:58,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-14 17:07:58,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2018-11-14 17:07:58,138 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 208 [2018-11-14 17:07:58,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:07:58,138 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2018-11-14 17:07:58,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-14 17:07:58,139 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2018-11-14 17:07:58,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-14 17:07:58,139 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:07:58,140 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 24, 24, 8, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:07:58,140 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:07:58,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:07:58,140 INFO L82 PathProgramCache]: Analyzing trace with hash -2120318193, now seen corresponding path program 27 times [2018-11-14 17:07:58,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:07:58,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:07:58,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:58,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:07:58,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:07:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:58,820 INFO L256 TraceCheckUtils]: 0: Hoare triple {24802#true} call ULTIMATE.init(); {24802#true} is VALID [2018-11-14 17:07:58,820 INFO L273 TraceCheckUtils]: 1: Hoare triple {24802#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24802#true} is VALID [2018-11-14 17:07:58,820 INFO L273 TraceCheckUtils]: 2: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,820 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24802#true} {24802#true} #69#return; {24802#true} is VALID [2018-11-14 17:07:58,820 INFO L256 TraceCheckUtils]: 4: Hoare triple {24802#true} call #t~ret13 := main(); {24802#true} is VALID [2018-11-14 17:07:58,821 INFO L273 TraceCheckUtils]: 5: Hoare triple {24802#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {24804#(= main_~i~1 0)} is VALID [2018-11-14 17:07:58,821 INFO L273 TraceCheckUtils]: 6: Hoare triple {24804#(= main_~i~1 0)} assume true; {24804#(= main_~i~1 0)} is VALID [2018-11-14 17:07:58,822 INFO L273 TraceCheckUtils]: 7: Hoare triple {24804#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24804#(= main_~i~1 0)} is VALID [2018-11-14 17:07:58,822 INFO L273 TraceCheckUtils]: 8: Hoare triple {24804#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24805#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:58,822 INFO L273 TraceCheckUtils]: 9: Hoare triple {24805#(<= main_~i~1 1)} assume true; {24805#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:58,823 INFO L273 TraceCheckUtils]: 10: Hoare triple {24805#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24805#(<= main_~i~1 1)} is VALID [2018-11-14 17:07:58,823 INFO L273 TraceCheckUtils]: 11: Hoare triple {24805#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24806#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:58,824 INFO L273 TraceCheckUtils]: 12: Hoare triple {24806#(<= main_~i~1 2)} assume true; {24806#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:58,824 INFO L273 TraceCheckUtils]: 13: Hoare triple {24806#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24806#(<= main_~i~1 2)} is VALID [2018-11-14 17:07:58,824 INFO L273 TraceCheckUtils]: 14: Hoare triple {24806#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24807#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:58,825 INFO L273 TraceCheckUtils]: 15: Hoare triple {24807#(<= main_~i~1 3)} assume true; {24807#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:58,825 INFO L273 TraceCheckUtils]: 16: Hoare triple {24807#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24807#(<= main_~i~1 3)} is VALID [2018-11-14 17:07:58,826 INFO L273 TraceCheckUtils]: 17: Hoare triple {24807#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24808#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:58,827 INFO L273 TraceCheckUtils]: 18: Hoare triple {24808#(<= main_~i~1 4)} assume true; {24808#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:58,827 INFO L273 TraceCheckUtils]: 19: Hoare triple {24808#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24808#(<= main_~i~1 4)} is VALID [2018-11-14 17:07:58,828 INFO L273 TraceCheckUtils]: 20: Hoare triple {24808#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24809#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:58,828 INFO L273 TraceCheckUtils]: 21: Hoare triple {24809#(<= main_~i~1 5)} assume true; {24809#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:58,829 INFO L273 TraceCheckUtils]: 22: Hoare triple {24809#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24809#(<= main_~i~1 5)} is VALID [2018-11-14 17:07:58,830 INFO L273 TraceCheckUtils]: 23: Hoare triple {24809#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24810#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:58,830 INFO L273 TraceCheckUtils]: 24: Hoare triple {24810#(<= main_~i~1 6)} assume true; {24810#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:58,831 INFO L273 TraceCheckUtils]: 25: Hoare triple {24810#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24810#(<= main_~i~1 6)} is VALID [2018-11-14 17:07:58,831 INFO L273 TraceCheckUtils]: 26: Hoare triple {24810#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24811#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:58,832 INFO L273 TraceCheckUtils]: 27: Hoare triple {24811#(<= main_~i~1 7)} assume true; {24811#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:58,832 INFO L273 TraceCheckUtils]: 28: Hoare triple {24811#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24811#(<= main_~i~1 7)} is VALID [2018-11-14 17:07:58,833 INFO L273 TraceCheckUtils]: 29: Hoare triple {24811#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24812#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:58,833 INFO L273 TraceCheckUtils]: 30: Hoare triple {24812#(<= main_~i~1 8)} assume true; {24812#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:58,834 INFO L273 TraceCheckUtils]: 31: Hoare triple {24812#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24812#(<= main_~i~1 8)} is VALID [2018-11-14 17:07:58,835 INFO L273 TraceCheckUtils]: 32: Hoare triple {24812#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24813#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:58,835 INFO L273 TraceCheckUtils]: 33: Hoare triple {24813#(<= main_~i~1 9)} assume true; {24813#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:58,836 INFO L273 TraceCheckUtils]: 34: Hoare triple {24813#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24813#(<= main_~i~1 9)} is VALID [2018-11-14 17:07:58,836 INFO L273 TraceCheckUtils]: 35: Hoare triple {24813#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24814#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:58,837 INFO L273 TraceCheckUtils]: 36: Hoare triple {24814#(<= main_~i~1 10)} assume true; {24814#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:58,837 INFO L273 TraceCheckUtils]: 37: Hoare triple {24814#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24814#(<= main_~i~1 10)} is VALID [2018-11-14 17:07:58,838 INFO L273 TraceCheckUtils]: 38: Hoare triple {24814#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24815#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:58,839 INFO L273 TraceCheckUtils]: 39: Hoare triple {24815#(<= main_~i~1 11)} assume true; {24815#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:58,839 INFO L273 TraceCheckUtils]: 40: Hoare triple {24815#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24815#(<= main_~i~1 11)} is VALID [2018-11-14 17:07:58,840 INFO L273 TraceCheckUtils]: 41: Hoare triple {24815#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24816#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:58,840 INFO L273 TraceCheckUtils]: 42: Hoare triple {24816#(<= main_~i~1 12)} assume true; {24816#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:58,841 INFO L273 TraceCheckUtils]: 43: Hoare triple {24816#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24816#(<= main_~i~1 12)} is VALID [2018-11-14 17:07:58,842 INFO L273 TraceCheckUtils]: 44: Hoare triple {24816#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24817#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:58,842 INFO L273 TraceCheckUtils]: 45: Hoare triple {24817#(<= main_~i~1 13)} assume true; {24817#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:58,843 INFO L273 TraceCheckUtils]: 46: Hoare triple {24817#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24817#(<= main_~i~1 13)} is VALID [2018-11-14 17:07:58,844 INFO L273 TraceCheckUtils]: 47: Hoare triple {24817#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24818#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:58,844 INFO L273 TraceCheckUtils]: 48: Hoare triple {24818#(<= main_~i~1 14)} assume true; {24818#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:58,845 INFO L273 TraceCheckUtils]: 49: Hoare triple {24818#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24818#(<= main_~i~1 14)} is VALID [2018-11-14 17:07:58,845 INFO L273 TraceCheckUtils]: 50: Hoare triple {24818#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24819#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:58,846 INFO L273 TraceCheckUtils]: 51: Hoare triple {24819#(<= main_~i~1 15)} assume true; {24819#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:58,846 INFO L273 TraceCheckUtils]: 52: Hoare triple {24819#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24819#(<= main_~i~1 15)} is VALID [2018-11-14 17:07:58,847 INFO L273 TraceCheckUtils]: 53: Hoare triple {24819#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24820#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:58,848 INFO L273 TraceCheckUtils]: 54: Hoare triple {24820#(<= main_~i~1 16)} assume true; {24820#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:58,848 INFO L273 TraceCheckUtils]: 55: Hoare triple {24820#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24820#(<= main_~i~1 16)} is VALID [2018-11-14 17:07:58,849 INFO L273 TraceCheckUtils]: 56: Hoare triple {24820#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24821#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:58,849 INFO L273 TraceCheckUtils]: 57: Hoare triple {24821#(<= main_~i~1 17)} assume true; {24821#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:58,850 INFO L273 TraceCheckUtils]: 58: Hoare triple {24821#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24821#(<= main_~i~1 17)} is VALID [2018-11-14 17:07:58,851 INFO L273 TraceCheckUtils]: 59: Hoare triple {24821#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24822#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:58,851 INFO L273 TraceCheckUtils]: 60: Hoare triple {24822#(<= main_~i~1 18)} assume true; {24822#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:58,852 INFO L273 TraceCheckUtils]: 61: Hoare triple {24822#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24822#(<= main_~i~1 18)} is VALID [2018-11-14 17:07:58,852 INFO L273 TraceCheckUtils]: 62: Hoare triple {24822#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24823#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:58,853 INFO L273 TraceCheckUtils]: 63: Hoare triple {24823#(<= main_~i~1 19)} assume true; {24823#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:58,853 INFO L273 TraceCheckUtils]: 64: Hoare triple {24823#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24823#(<= main_~i~1 19)} is VALID [2018-11-14 17:07:58,854 INFO L273 TraceCheckUtils]: 65: Hoare triple {24823#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24824#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:58,855 INFO L273 TraceCheckUtils]: 66: Hoare triple {24824#(<= main_~i~1 20)} assume true; {24824#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:58,855 INFO L273 TraceCheckUtils]: 67: Hoare triple {24824#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24824#(<= main_~i~1 20)} is VALID [2018-11-14 17:07:58,856 INFO L273 TraceCheckUtils]: 68: Hoare triple {24824#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24825#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:58,856 INFO L273 TraceCheckUtils]: 69: Hoare triple {24825#(<= main_~i~1 21)} assume true; {24825#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:58,857 INFO L273 TraceCheckUtils]: 70: Hoare triple {24825#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24825#(<= main_~i~1 21)} is VALID [2018-11-14 17:07:58,858 INFO L273 TraceCheckUtils]: 71: Hoare triple {24825#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24826#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:58,858 INFO L273 TraceCheckUtils]: 72: Hoare triple {24826#(<= main_~i~1 22)} assume true; {24826#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:58,859 INFO L273 TraceCheckUtils]: 73: Hoare triple {24826#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24826#(<= main_~i~1 22)} is VALID [2018-11-14 17:07:58,859 INFO L273 TraceCheckUtils]: 74: Hoare triple {24826#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24827#(<= main_~i~1 23)} is VALID [2018-11-14 17:07:58,860 INFO L273 TraceCheckUtils]: 75: Hoare triple {24827#(<= main_~i~1 23)} assume true; {24827#(<= main_~i~1 23)} is VALID [2018-11-14 17:07:58,860 INFO L273 TraceCheckUtils]: 76: Hoare triple {24827#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24827#(<= main_~i~1 23)} is VALID [2018-11-14 17:07:58,861 INFO L273 TraceCheckUtils]: 77: Hoare triple {24827#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24828#(<= main_~i~1 24)} is VALID [2018-11-14 17:07:58,862 INFO L273 TraceCheckUtils]: 78: Hoare triple {24828#(<= main_~i~1 24)} assume true; {24828#(<= main_~i~1 24)} is VALID [2018-11-14 17:07:58,862 INFO L273 TraceCheckUtils]: 79: Hoare triple {24828#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24828#(<= main_~i~1 24)} is VALID [2018-11-14 17:07:58,863 INFO L273 TraceCheckUtils]: 80: Hoare triple {24828#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24829#(<= main_~i~1 25)} is VALID [2018-11-14 17:07:58,863 INFO L273 TraceCheckUtils]: 81: Hoare triple {24829#(<= main_~i~1 25)} assume true; {24829#(<= main_~i~1 25)} is VALID [2018-11-14 17:07:58,864 INFO L273 TraceCheckUtils]: 82: Hoare triple {24829#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24829#(<= main_~i~1 25)} is VALID [2018-11-14 17:07:58,864 INFO L273 TraceCheckUtils]: 83: Hoare triple {24829#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24830#(<= main_~i~1 26)} is VALID [2018-11-14 17:07:58,865 INFO L273 TraceCheckUtils]: 84: Hoare triple {24830#(<= main_~i~1 26)} assume true; {24830#(<= main_~i~1 26)} is VALID [2018-11-14 17:07:58,865 INFO L273 TraceCheckUtils]: 85: Hoare triple {24830#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24830#(<= main_~i~1 26)} is VALID [2018-11-14 17:07:58,866 INFO L273 TraceCheckUtils]: 86: Hoare triple {24830#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24831#(<= main_~i~1 27)} is VALID [2018-11-14 17:07:58,867 INFO L273 TraceCheckUtils]: 87: Hoare triple {24831#(<= main_~i~1 27)} assume true; {24831#(<= main_~i~1 27)} is VALID [2018-11-14 17:07:58,867 INFO L273 TraceCheckUtils]: 88: Hoare triple {24831#(<= main_~i~1 27)} assume !(~i~1 < 100); {24803#false} is VALID [2018-11-14 17:07:58,868 INFO L256 TraceCheckUtils]: 89: Hoare triple {24803#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {24802#true} is VALID [2018-11-14 17:07:58,868 INFO L273 TraceCheckUtils]: 90: Hoare triple {24802#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24802#true} is VALID [2018-11-14 17:07:58,868 INFO L273 TraceCheckUtils]: 91: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,868 INFO L273 TraceCheckUtils]: 92: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:58,868 INFO L273 TraceCheckUtils]: 93: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:58,868 INFO L273 TraceCheckUtils]: 94: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,869 INFO L273 TraceCheckUtils]: 95: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:58,869 INFO L273 TraceCheckUtils]: 96: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:58,869 INFO L273 TraceCheckUtils]: 97: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,869 INFO L273 TraceCheckUtils]: 98: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:58,869 INFO L273 TraceCheckUtils]: 99: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:58,870 INFO L273 TraceCheckUtils]: 100: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,870 INFO L273 TraceCheckUtils]: 101: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:58,870 INFO L273 TraceCheckUtils]: 102: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:58,870 INFO L273 TraceCheckUtils]: 103: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,870 INFO L273 TraceCheckUtils]: 104: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:58,870 INFO L273 TraceCheckUtils]: 105: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:58,871 INFO L273 TraceCheckUtils]: 106: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,871 INFO L273 TraceCheckUtils]: 107: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:58,871 INFO L273 TraceCheckUtils]: 108: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:58,871 INFO L273 TraceCheckUtils]: 109: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,871 INFO L273 TraceCheckUtils]: 110: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:58,871 INFO L273 TraceCheckUtils]: 111: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:58,872 INFO L273 TraceCheckUtils]: 112: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,872 INFO L273 TraceCheckUtils]: 113: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:58,872 INFO L273 TraceCheckUtils]: 114: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:58,872 INFO L273 TraceCheckUtils]: 115: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,872 INFO L273 TraceCheckUtils]: 116: Hoare triple {24802#true} assume !(~i~0 < 100); {24802#true} is VALID [2018-11-14 17:07:58,872 INFO L273 TraceCheckUtils]: 117: Hoare triple {24802#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24802#true} is VALID [2018-11-14 17:07:58,873 INFO L273 TraceCheckUtils]: 118: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,873 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {24802#true} {24803#false} #73#return; {24803#false} is VALID [2018-11-14 17:07:58,873 INFO L273 TraceCheckUtils]: 120: Hoare triple {24803#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {24803#false} is VALID [2018-11-14 17:07:58,873 INFO L256 TraceCheckUtils]: 121: Hoare triple {24803#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {24802#true} is VALID [2018-11-14 17:07:58,873 INFO L273 TraceCheckUtils]: 122: Hoare triple {24802#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24802#true} is VALID [2018-11-14 17:07:58,873 INFO L273 TraceCheckUtils]: 123: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,873 INFO L273 TraceCheckUtils]: 124: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:58,873 INFO L273 TraceCheckUtils]: 125: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:58,873 INFO L273 TraceCheckUtils]: 126: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,873 INFO L273 TraceCheckUtils]: 127: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:58,874 INFO L273 TraceCheckUtils]: 128: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:58,874 INFO L273 TraceCheckUtils]: 129: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,874 INFO L273 TraceCheckUtils]: 130: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:58,874 INFO L273 TraceCheckUtils]: 131: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:58,874 INFO L273 TraceCheckUtils]: 132: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,874 INFO L273 TraceCheckUtils]: 133: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:58,874 INFO L273 TraceCheckUtils]: 134: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:58,874 INFO L273 TraceCheckUtils]: 135: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,874 INFO L273 TraceCheckUtils]: 136: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:58,875 INFO L273 TraceCheckUtils]: 137: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:58,875 INFO L273 TraceCheckUtils]: 138: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,875 INFO L273 TraceCheckUtils]: 139: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:58,875 INFO L273 TraceCheckUtils]: 140: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:58,875 INFO L273 TraceCheckUtils]: 141: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,875 INFO L273 TraceCheckUtils]: 142: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:58,875 INFO L273 TraceCheckUtils]: 143: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:58,875 INFO L273 TraceCheckUtils]: 144: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,875 INFO L273 TraceCheckUtils]: 145: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:58,875 INFO L273 TraceCheckUtils]: 146: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:58,876 INFO L273 TraceCheckUtils]: 147: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,876 INFO L273 TraceCheckUtils]: 148: Hoare triple {24802#true} assume !(~i~0 < 100); {24802#true} is VALID [2018-11-14 17:07:58,876 INFO L273 TraceCheckUtils]: 149: Hoare triple {24802#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24802#true} is VALID [2018-11-14 17:07:58,876 INFO L273 TraceCheckUtils]: 150: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,876 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {24802#true} {24803#false} #75#return; {24803#false} is VALID [2018-11-14 17:07:58,876 INFO L273 TraceCheckUtils]: 152: Hoare triple {24803#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {24803#false} is VALID [2018-11-14 17:07:58,876 INFO L273 TraceCheckUtils]: 153: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:07:58,876 INFO L273 TraceCheckUtils]: 154: Hoare triple {24803#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {24803#false} is VALID [2018-11-14 17:07:58,876 INFO L273 TraceCheckUtils]: 155: Hoare triple {24803#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {24803#false} is VALID [2018-11-14 17:07:58,876 INFO L273 TraceCheckUtils]: 156: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:07:58,877 INFO L273 TraceCheckUtils]: 157: Hoare triple {24803#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {24803#false} is VALID [2018-11-14 17:07:58,877 INFO L273 TraceCheckUtils]: 158: Hoare triple {24803#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {24803#false} is VALID [2018-11-14 17:07:58,877 INFO L273 TraceCheckUtils]: 159: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:07:58,877 INFO L273 TraceCheckUtils]: 160: Hoare triple {24803#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {24803#false} is VALID [2018-11-14 17:07:58,877 INFO L273 TraceCheckUtils]: 161: Hoare triple {24803#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {24803#false} is VALID [2018-11-14 17:07:58,877 INFO L273 TraceCheckUtils]: 162: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:07:58,877 INFO L273 TraceCheckUtils]: 163: Hoare triple {24803#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {24803#false} is VALID [2018-11-14 17:07:58,877 INFO L273 TraceCheckUtils]: 164: Hoare triple {24803#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {24803#false} is VALID [2018-11-14 17:07:58,877 INFO L273 TraceCheckUtils]: 165: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:07:58,878 INFO L273 TraceCheckUtils]: 166: Hoare triple {24803#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {24803#false} is VALID [2018-11-14 17:07:58,878 INFO L273 TraceCheckUtils]: 167: Hoare triple {24803#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {24803#false} is VALID [2018-11-14 17:07:58,878 INFO L273 TraceCheckUtils]: 168: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:07:58,878 INFO L273 TraceCheckUtils]: 169: Hoare triple {24803#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {24803#false} is VALID [2018-11-14 17:07:58,878 INFO L273 TraceCheckUtils]: 170: Hoare triple {24803#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {24803#false} is VALID [2018-11-14 17:07:58,878 INFO L273 TraceCheckUtils]: 171: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:07:58,878 INFO L273 TraceCheckUtils]: 172: Hoare triple {24803#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {24803#false} is VALID [2018-11-14 17:07:58,878 INFO L273 TraceCheckUtils]: 173: Hoare triple {24803#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {24803#false} is VALID [2018-11-14 17:07:58,878 INFO L273 TraceCheckUtils]: 174: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:07:58,878 INFO L273 TraceCheckUtils]: 175: Hoare triple {24803#false} assume !(~i~2 < 99); {24803#false} is VALID [2018-11-14 17:07:58,879 INFO L273 TraceCheckUtils]: 176: Hoare triple {24803#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {24803#false} is VALID [2018-11-14 17:07:58,879 INFO L256 TraceCheckUtils]: 177: Hoare triple {24803#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {24802#true} is VALID [2018-11-14 17:07:58,879 INFO L273 TraceCheckUtils]: 178: Hoare triple {24802#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24802#true} is VALID [2018-11-14 17:07:58,879 INFO L273 TraceCheckUtils]: 179: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,879 INFO L273 TraceCheckUtils]: 180: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:58,879 INFO L273 TraceCheckUtils]: 181: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:58,879 INFO L273 TraceCheckUtils]: 182: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,879 INFO L273 TraceCheckUtils]: 183: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:58,879 INFO L273 TraceCheckUtils]: 184: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:58,879 INFO L273 TraceCheckUtils]: 185: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,880 INFO L273 TraceCheckUtils]: 186: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:58,880 INFO L273 TraceCheckUtils]: 187: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:58,880 INFO L273 TraceCheckUtils]: 188: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,880 INFO L273 TraceCheckUtils]: 189: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:58,880 INFO L273 TraceCheckUtils]: 190: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:58,880 INFO L273 TraceCheckUtils]: 191: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,880 INFO L273 TraceCheckUtils]: 192: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:58,880 INFO L273 TraceCheckUtils]: 193: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:58,880 INFO L273 TraceCheckUtils]: 194: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,880 INFO L273 TraceCheckUtils]: 195: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:58,881 INFO L273 TraceCheckUtils]: 196: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:58,881 INFO L273 TraceCheckUtils]: 197: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,881 INFO L273 TraceCheckUtils]: 198: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:58,881 INFO L273 TraceCheckUtils]: 199: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:58,881 INFO L273 TraceCheckUtils]: 200: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,881 INFO L273 TraceCheckUtils]: 201: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:58,881 INFO L273 TraceCheckUtils]: 202: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:58,881 INFO L273 TraceCheckUtils]: 203: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,881 INFO L273 TraceCheckUtils]: 204: Hoare triple {24802#true} assume !(~i~0 < 100); {24802#true} is VALID [2018-11-14 17:07:58,881 INFO L273 TraceCheckUtils]: 205: Hoare triple {24802#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24802#true} is VALID [2018-11-14 17:07:58,882 INFO L273 TraceCheckUtils]: 206: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:58,882 INFO L268 TraceCheckUtils]: 207: Hoare quadruple {24802#true} {24803#false} #77#return; {24803#false} is VALID [2018-11-14 17:07:58,882 INFO L273 TraceCheckUtils]: 208: Hoare triple {24803#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {24803#false} is VALID [2018-11-14 17:07:58,882 INFO L273 TraceCheckUtils]: 209: Hoare triple {24803#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {24803#false} is VALID [2018-11-14 17:07:58,882 INFO L273 TraceCheckUtils]: 210: Hoare triple {24803#false} assume !false; {24803#false} is VALID [2018-11-14 17:07:58,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2174 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-11-14 17:07:58,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:07:58,903 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:07:58,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:07:59,195 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-14 17:07:59,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:07:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:07:59,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:07:59,565 INFO L256 TraceCheckUtils]: 0: Hoare triple {24802#true} call ULTIMATE.init(); {24802#true} is VALID [2018-11-14 17:07:59,565 INFO L273 TraceCheckUtils]: 1: Hoare triple {24802#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24802#true} is VALID [2018-11-14 17:07:59,565 INFO L273 TraceCheckUtils]: 2: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,566 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24802#true} {24802#true} #69#return; {24802#true} is VALID [2018-11-14 17:07:59,566 INFO L256 TraceCheckUtils]: 4: Hoare triple {24802#true} call #t~ret13 := main(); {24802#true} is VALID [2018-11-14 17:07:59,566 INFO L273 TraceCheckUtils]: 5: Hoare triple {24802#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {24802#true} is VALID [2018-11-14 17:07:59,566 INFO L273 TraceCheckUtils]: 6: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,566 INFO L273 TraceCheckUtils]: 7: Hoare triple {24802#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:07:59,566 INFO L273 TraceCheckUtils]: 8: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:07:59,567 INFO L273 TraceCheckUtils]: 9: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,567 INFO L273 TraceCheckUtils]: 10: Hoare triple {24802#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:07:59,567 INFO L273 TraceCheckUtils]: 11: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:07:59,567 INFO L273 TraceCheckUtils]: 12: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,567 INFO L273 TraceCheckUtils]: 13: Hoare triple {24802#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:07:59,568 INFO L273 TraceCheckUtils]: 14: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:07:59,568 INFO L273 TraceCheckUtils]: 15: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,568 INFO L273 TraceCheckUtils]: 16: Hoare triple {24802#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:07:59,568 INFO L273 TraceCheckUtils]: 17: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:07:59,568 INFO L273 TraceCheckUtils]: 18: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,568 INFO L273 TraceCheckUtils]: 19: Hoare triple {24802#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:07:59,569 INFO L273 TraceCheckUtils]: 20: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:07:59,569 INFO L273 TraceCheckUtils]: 21: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,569 INFO L273 TraceCheckUtils]: 22: Hoare triple {24802#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:07:59,569 INFO L273 TraceCheckUtils]: 23: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:07:59,569 INFO L273 TraceCheckUtils]: 24: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,569 INFO L273 TraceCheckUtils]: 25: Hoare triple {24802#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:07:59,569 INFO L273 TraceCheckUtils]: 26: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:07:59,569 INFO L273 TraceCheckUtils]: 27: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,569 INFO L273 TraceCheckUtils]: 28: Hoare triple {24802#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:07:59,570 INFO L273 TraceCheckUtils]: 29: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:07:59,570 INFO L273 TraceCheckUtils]: 30: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,570 INFO L273 TraceCheckUtils]: 31: Hoare triple {24802#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:07:59,570 INFO L273 TraceCheckUtils]: 32: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:07:59,570 INFO L273 TraceCheckUtils]: 33: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,570 INFO L273 TraceCheckUtils]: 34: Hoare triple {24802#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:07:59,570 INFO L273 TraceCheckUtils]: 35: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:07:59,570 INFO L273 TraceCheckUtils]: 36: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,570 INFO L273 TraceCheckUtils]: 37: Hoare triple {24802#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:07:59,570 INFO L273 TraceCheckUtils]: 38: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:07:59,571 INFO L273 TraceCheckUtils]: 39: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,571 INFO L273 TraceCheckUtils]: 40: Hoare triple {24802#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:07:59,571 INFO L273 TraceCheckUtils]: 41: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:07:59,571 INFO L273 TraceCheckUtils]: 42: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,571 INFO L273 TraceCheckUtils]: 43: Hoare triple {24802#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:07:59,571 INFO L273 TraceCheckUtils]: 44: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:07:59,571 INFO L273 TraceCheckUtils]: 45: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,571 INFO L273 TraceCheckUtils]: 46: Hoare triple {24802#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:07:59,571 INFO L273 TraceCheckUtils]: 47: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:07:59,571 INFO L273 TraceCheckUtils]: 48: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,572 INFO L273 TraceCheckUtils]: 49: Hoare triple {24802#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:07:59,572 INFO L273 TraceCheckUtils]: 50: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:07:59,572 INFO L273 TraceCheckUtils]: 51: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,572 INFO L273 TraceCheckUtils]: 52: Hoare triple {24802#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:07:59,572 INFO L273 TraceCheckUtils]: 53: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:07:59,572 INFO L273 TraceCheckUtils]: 54: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,572 INFO L273 TraceCheckUtils]: 55: Hoare triple {24802#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:07:59,572 INFO L273 TraceCheckUtils]: 56: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:07:59,572 INFO L273 TraceCheckUtils]: 57: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,572 INFO L273 TraceCheckUtils]: 58: Hoare triple {24802#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:07:59,573 INFO L273 TraceCheckUtils]: 59: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:07:59,573 INFO L273 TraceCheckUtils]: 60: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,573 INFO L273 TraceCheckUtils]: 61: Hoare triple {24802#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:07:59,573 INFO L273 TraceCheckUtils]: 62: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:07:59,573 INFO L273 TraceCheckUtils]: 63: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,573 INFO L273 TraceCheckUtils]: 64: Hoare triple {24802#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:07:59,573 INFO L273 TraceCheckUtils]: 65: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:07:59,573 INFO L273 TraceCheckUtils]: 66: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,573 INFO L273 TraceCheckUtils]: 67: Hoare triple {24802#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:07:59,574 INFO L273 TraceCheckUtils]: 68: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:07:59,574 INFO L273 TraceCheckUtils]: 69: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,574 INFO L273 TraceCheckUtils]: 70: Hoare triple {24802#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:07:59,574 INFO L273 TraceCheckUtils]: 71: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:07:59,574 INFO L273 TraceCheckUtils]: 72: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,574 INFO L273 TraceCheckUtils]: 73: Hoare triple {24802#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:07:59,574 INFO L273 TraceCheckUtils]: 74: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:07:59,574 INFO L273 TraceCheckUtils]: 75: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,574 INFO L273 TraceCheckUtils]: 76: Hoare triple {24802#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:07:59,574 INFO L273 TraceCheckUtils]: 77: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:07:59,575 INFO L273 TraceCheckUtils]: 78: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,575 INFO L273 TraceCheckUtils]: 79: Hoare triple {24802#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:07:59,575 INFO L273 TraceCheckUtils]: 80: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:07:59,575 INFO L273 TraceCheckUtils]: 81: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,575 INFO L273 TraceCheckUtils]: 82: Hoare triple {24802#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:07:59,575 INFO L273 TraceCheckUtils]: 83: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:07:59,575 INFO L273 TraceCheckUtils]: 84: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,575 INFO L273 TraceCheckUtils]: 85: Hoare triple {24802#true} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 17:07:59,575 INFO L273 TraceCheckUtils]: 86: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 17:07:59,575 INFO L273 TraceCheckUtils]: 87: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,576 INFO L273 TraceCheckUtils]: 88: Hoare triple {24802#true} assume !(~i~1 < 100); {24802#true} is VALID [2018-11-14 17:07:59,576 INFO L256 TraceCheckUtils]: 89: Hoare triple {24802#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {24802#true} is VALID [2018-11-14 17:07:59,576 INFO L273 TraceCheckUtils]: 90: Hoare triple {24802#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24802#true} is VALID [2018-11-14 17:07:59,576 INFO L273 TraceCheckUtils]: 91: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,576 INFO L273 TraceCheckUtils]: 92: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:59,576 INFO L273 TraceCheckUtils]: 93: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:59,576 INFO L273 TraceCheckUtils]: 94: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,576 INFO L273 TraceCheckUtils]: 95: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:59,576 INFO L273 TraceCheckUtils]: 96: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:59,577 INFO L273 TraceCheckUtils]: 97: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,577 INFO L273 TraceCheckUtils]: 98: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:59,577 INFO L273 TraceCheckUtils]: 99: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:59,577 INFO L273 TraceCheckUtils]: 100: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,577 INFO L273 TraceCheckUtils]: 101: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:59,577 INFO L273 TraceCheckUtils]: 102: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:59,577 INFO L273 TraceCheckUtils]: 103: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,577 INFO L273 TraceCheckUtils]: 104: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:59,577 INFO L273 TraceCheckUtils]: 105: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:59,577 INFO L273 TraceCheckUtils]: 106: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,578 INFO L273 TraceCheckUtils]: 107: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:59,578 INFO L273 TraceCheckUtils]: 108: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:59,578 INFO L273 TraceCheckUtils]: 109: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,578 INFO L273 TraceCheckUtils]: 110: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:59,578 INFO L273 TraceCheckUtils]: 111: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:59,578 INFO L273 TraceCheckUtils]: 112: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,579 INFO L273 TraceCheckUtils]: 113: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:59,579 INFO L273 TraceCheckUtils]: 114: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:59,579 INFO L273 TraceCheckUtils]: 115: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,579 INFO L273 TraceCheckUtils]: 116: Hoare triple {24802#true} assume !(~i~0 < 100); {24802#true} is VALID [2018-11-14 17:07:59,579 INFO L273 TraceCheckUtils]: 117: Hoare triple {24802#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24802#true} is VALID [2018-11-14 17:07:59,579 INFO L273 TraceCheckUtils]: 118: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,579 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {24802#true} {24802#true} #73#return; {24802#true} is VALID [2018-11-14 17:07:59,579 INFO L273 TraceCheckUtils]: 120: Hoare triple {24802#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {24802#true} is VALID [2018-11-14 17:07:59,580 INFO L256 TraceCheckUtils]: 121: Hoare triple {24802#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {24802#true} is VALID [2018-11-14 17:07:59,580 INFO L273 TraceCheckUtils]: 122: Hoare triple {24802#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24802#true} is VALID [2018-11-14 17:07:59,580 INFO L273 TraceCheckUtils]: 123: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,580 INFO L273 TraceCheckUtils]: 124: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:59,580 INFO L273 TraceCheckUtils]: 125: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:59,580 INFO L273 TraceCheckUtils]: 126: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,580 INFO L273 TraceCheckUtils]: 127: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:59,580 INFO L273 TraceCheckUtils]: 128: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:59,580 INFO L273 TraceCheckUtils]: 129: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,581 INFO L273 TraceCheckUtils]: 130: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:59,581 INFO L273 TraceCheckUtils]: 131: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:59,581 INFO L273 TraceCheckUtils]: 132: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,581 INFO L273 TraceCheckUtils]: 133: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:59,581 INFO L273 TraceCheckUtils]: 134: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:59,581 INFO L273 TraceCheckUtils]: 135: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,581 INFO L273 TraceCheckUtils]: 136: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:59,581 INFO L273 TraceCheckUtils]: 137: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:59,581 INFO L273 TraceCheckUtils]: 138: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,581 INFO L273 TraceCheckUtils]: 139: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:59,582 INFO L273 TraceCheckUtils]: 140: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:59,582 INFO L273 TraceCheckUtils]: 141: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,582 INFO L273 TraceCheckUtils]: 142: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:59,582 INFO L273 TraceCheckUtils]: 143: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:59,582 INFO L273 TraceCheckUtils]: 144: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,582 INFO L273 TraceCheckUtils]: 145: Hoare triple {24802#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 17:07:59,582 INFO L273 TraceCheckUtils]: 146: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 17:07:59,582 INFO L273 TraceCheckUtils]: 147: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,582 INFO L273 TraceCheckUtils]: 148: Hoare triple {24802#true} assume !(~i~0 < 100); {24802#true} is VALID [2018-11-14 17:07:59,582 INFO L273 TraceCheckUtils]: 149: Hoare triple {24802#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24802#true} is VALID [2018-11-14 17:07:59,583 INFO L273 TraceCheckUtils]: 150: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 17:07:59,583 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {24802#true} {24802#true} #75#return; {24802#true} is VALID [2018-11-14 17:07:59,583 INFO L273 TraceCheckUtils]: 152: Hoare triple {24802#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {25291#(<= main_~i~2 0)} is VALID [2018-11-14 17:07:59,583 INFO L273 TraceCheckUtils]: 153: Hoare triple {25291#(<= main_~i~2 0)} assume true; {25291#(<= main_~i~2 0)} is VALID [2018-11-14 17:07:59,584 INFO L273 TraceCheckUtils]: 154: Hoare triple {25291#(<= main_~i~2 0)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25291#(<= main_~i~2 0)} is VALID [2018-11-14 17:07:59,584 INFO L273 TraceCheckUtils]: 155: Hoare triple {25291#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25301#(<= main_~i~2 1)} is VALID [2018-11-14 17:07:59,585 INFO L273 TraceCheckUtils]: 156: Hoare triple {25301#(<= main_~i~2 1)} assume true; {25301#(<= main_~i~2 1)} is VALID [2018-11-14 17:07:59,585 INFO L273 TraceCheckUtils]: 157: Hoare triple {25301#(<= main_~i~2 1)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25301#(<= main_~i~2 1)} is VALID [2018-11-14 17:07:59,585 INFO L273 TraceCheckUtils]: 158: Hoare triple {25301#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25311#(<= main_~i~2 2)} is VALID [2018-11-14 17:07:59,586 INFO L273 TraceCheckUtils]: 159: Hoare triple {25311#(<= main_~i~2 2)} assume true; {25311#(<= main_~i~2 2)} is VALID [2018-11-14 17:07:59,586 INFO L273 TraceCheckUtils]: 160: Hoare triple {25311#(<= main_~i~2 2)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25311#(<= main_~i~2 2)} is VALID [2018-11-14 17:07:59,586 INFO L273 TraceCheckUtils]: 161: Hoare triple {25311#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25321#(<= main_~i~2 3)} is VALID [2018-11-14 17:07:59,587 INFO L273 TraceCheckUtils]: 162: Hoare triple {25321#(<= main_~i~2 3)} assume true; {25321#(<= main_~i~2 3)} is VALID [2018-11-14 17:07:59,587 INFO L273 TraceCheckUtils]: 163: Hoare triple {25321#(<= main_~i~2 3)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25321#(<= main_~i~2 3)} is VALID [2018-11-14 17:07:59,588 INFO L273 TraceCheckUtils]: 164: Hoare triple {25321#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25331#(<= main_~i~2 4)} is VALID [2018-11-14 17:07:59,588 INFO L273 TraceCheckUtils]: 165: Hoare triple {25331#(<= main_~i~2 4)} assume true; {25331#(<= main_~i~2 4)} is VALID [2018-11-14 17:07:59,589 INFO L273 TraceCheckUtils]: 166: Hoare triple {25331#(<= main_~i~2 4)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25331#(<= main_~i~2 4)} is VALID [2018-11-14 17:07:59,589 INFO L273 TraceCheckUtils]: 167: Hoare triple {25331#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25341#(<= main_~i~2 5)} is VALID [2018-11-14 17:07:59,590 INFO L273 TraceCheckUtils]: 168: Hoare triple {25341#(<= main_~i~2 5)} assume true; {25341#(<= main_~i~2 5)} is VALID [2018-11-14 17:07:59,590 INFO L273 TraceCheckUtils]: 169: Hoare triple {25341#(<= main_~i~2 5)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25341#(<= main_~i~2 5)} is VALID [2018-11-14 17:07:59,591 INFO L273 TraceCheckUtils]: 170: Hoare triple {25341#(<= main_~i~2 5)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25351#(<= main_~i~2 6)} is VALID [2018-11-14 17:07:59,592 INFO L273 TraceCheckUtils]: 171: Hoare triple {25351#(<= main_~i~2 6)} assume true; {25351#(<= main_~i~2 6)} is VALID [2018-11-14 17:07:59,592 INFO L273 TraceCheckUtils]: 172: Hoare triple {25351#(<= main_~i~2 6)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25351#(<= main_~i~2 6)} is VALID [2018-11-14 17:07:59,593 INFO L273 TraceCheckUtils]: 173: Hoare triple {25351#(<= main_~i~2 6)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25361#(<= main_~i~2 7)} is VALID [2018-11-14 17:07:59,593 INFO L273 TraceCheckUtils]: 174: Hoare triple {25361#(<= main_~i~2 7)} assume true; {25361#(<= main_~i~2 7)} is VALID [2018-11-14 17:07:59,594 INFO L273 TraceCheckUtils]: 175: Hoare triple {25361#(<= main_~i~2 7)} assume !(~i~2 < 99); {24803#false} is VALID [2018-11-14 17:07:59,594 INFO L273 TraceCheckUtils]: 176: Hoare triple {24803#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {24803#false} is VALID [2018-11-14 17:07:59,594 INFO L256 TraceCheckUtils]: 177: Hoare triple {24803#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {24803#false} is VALID [2018-11-14 17:07:59,595 INFO L273 TraceCheckUtils]: 178: Hoare triple {24803#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24803#false} is VALID [2018-11-14 17:07:59,595 INFO L273 TraceCheckUtils]: 179: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:07:59,595 INFO L273 TraceCheckUtils]: 180: Hoare triple {24803#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24803#false} is VALID [2018-11-14 17:07:59,595 INFO L273 TraceCheckUtils]: 181: Hoare triple {24803#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24803#false} is VALID [2018-11-14 17:07:59,595 INFO L273 TraceCheckUtils]: 182: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:07:59,596 INFO L273 TraceCheckUtils]: 183: Hoare triple {24803#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24803#false} is VALID [2018-11-14 17:07:59,596 INFO L273 TraceCheckUtils]: 184: Hoare triple {24803#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24803#false} is VALID [2018-11-14 17:07:59,596 INFO L273 TraceCheckUtils]: 185: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:07:59,596 INFO L273 TraceCheckUtils]: 186: Hoare triple {24803#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24803#false} is VALID [2018-11-14 17:07:59,596 INFO L273 TraceCheckUtils]: 187: Hoare triple {24803#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24803#false} is VALID [2018-11-14 17:07:59,596 INFO L273 TraceCheckUtils]: 188: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:07:59,597 INFO L273 TraceCheckUtils]: 189: Hoare triple {24803#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24803#false} is VALID [2018-11-14 17:07:59,597 INFO L273 TraceCheckUtils]: 190: Hoare triple {24803#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24803#false} is VALID [2018-11-14 17:07:59,597 INFO L273 TraceCheckUtils]: 191: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:07:59,597 INFO L273 TraceCheckUtils]: 192: Hoare triple {24803#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24803#false} is VALID [2018-11-14 17:07:59,597 INFO L273 TraceCheckUtils]: 193: Hoare triple {24803#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24803#false} is VALID [2018-11-14 17:07:59,597 INFO L273 TraceCheckUtils]: 194: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:07:59,597 INFO L273 TraceCheckUtils]: 195: Hoare triple {24803#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24803#false} is VALID [2018-11-14 17:07:59,597 INFO L273 TraceCheckUtils]: 196: Hoare triple {24803#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24803#false} is VALID [2018-11-14 17:07:59,597 INFO L273 TraceCheckUtils]: 197: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:07:59,598 INFO L273 TraceCheckUtils]: 198: Hoare triple {24803#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24803#false} is VALID [2018-11-14 17:07:59,598 INFO L273 TraceCheckUtils]: 199: Hoare triple {24803#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24803#false} is VALID [2018-11-14 17:07:59,598 INFO L273 TraceCheckUtils]: 200: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:07:59,598 INFO L273 TraceCheckUtils]: 201: Hoare triple {24803#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24803#false} is VALID [2018-11-14 17:07:59,598 INFO L273 TraceCheckUtils]: 202: Hoare triple {24803#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24803#false} is VALID [2018-11-14 17:07:59,598 INFO L273 TraceCheckUtils]: 203: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:07:59,598 INFO L273 TraceCheckUtils]: 204: Hoare triple {24803#false} assume !(~i~0 < 100); {24803#false} is VALID [2018-11-14 17:07:59,598 INFO L273 TraceCheckUtils]: 205: Hoare triple {24803#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24803#false} is VALID [2018-11-14 17:07:59,598 INFO L273 TraceCheckUtils]: 206: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 17:07:59,598 INFO L268 TraceCheckUtils]: 207: Hoare quadruple {24803#false} {24803#false} #77#return; {24803#false} is VALID [2018-11-14 17:07:59,599 INFO L273 TraceCheckUtils]: 208: Hoare triple {24803#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {24803#false} is VALID [2018-11-14 17:07:59,599 INFO L273 TraceCheckUtils]: 209: Hoare triple {24803#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {24803#false} is VALID [2018-11-14 17:07:59,599 INFO L273 TraceCheckUtils]: 210: Hoare triple {24803#false} assume !false; {24803#false} is VALID [2018-11-14 17:07:59,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2174 backedges. 460 proven. 77 refuted. 0 times theorem prover too weak. 1637 trivial. 0 not checked. [2018-11-14 17:07:59,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:07:59,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10] total 38 [2018-11-14 17:07:59,637 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 211 [2018-11-14 17:07:59,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:07:59,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-14 17:07:59,840 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:07:59,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-14 17:07:59,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-14 17:07:59,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 17:07:59,842 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand 38 states. [2018-11-14 17:08:01,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:01,075 INFO L93 Difference]: Finished difference Result 223 states and 232 transitions. [2018-11-14 17:08:01,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-14 17:08:01,075 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 211 [2018-11-14 17:08:01,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:01,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 17:08:01,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2018-11-14 17:08:01,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 17:08:01,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2018-11-14 17:08:01,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 166 transitions. [2018-11-14 17:08:01,223 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:01,226 INFO L225 Difference]: With dead ends: 223 [2018-11-14 17:08:01,227 INFO L226 Difference]: Without dead ends: 160 [2018-11-14 17:08:01,227 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 17:08:01,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-14 17:08:01,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2018-11-14 17:08:01,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:01,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand 158 states. [2018-11-14 17:08:01,305 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 158 states. [2018-11-14 17:08:01,305 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 158 states. [2018-11-14 17:08:01,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:01,309 INFO L93 Difference]: Finished difference Result 160 states and 164 transitions. [2018-11-14 17:08:01,309 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 164 transitions. [2018-11-14 17:08:01,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:01,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:01,309 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 160 states. [2018-11-14 17:08:01,309 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 160 states. [2018-11-14 17:08:01,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:01,312 INFO L93 Difference]: Finished difference Result 160 states and 164 transitions. [2018-11-14 17:08:01,312 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 164 transitions. [2018-11-14 17:08:01,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:01,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:01,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:01,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:01,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-14 17:08:01,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 162 transitions. [2018-11-14 17:08:01,316 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 162 transitions. Word has length 211 [2018-11-14 17:08:01,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:01,316 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 162 transitions. [2018-11-14 17:08:01,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-14 17:08:01,316 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 162 transitions. [2018-11-14 17:08:01,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-14 17:08:01,317 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:01,317 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 27, 24, 24, 9, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:08:01,318 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:01,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:01,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1519582765, now seen corresponding path program 28 times [2018-11-14 17:08:01,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:01,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:01,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:01,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:08:01,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:02,060 INFO L256 TraceCheckUtils]: 0: Hoare triple {26304#true} call ULTIMATE.init(); {26304#true} is VALID [2018-11-14 17:08:02,060 INFO L273 TraceCheckUtils]: 1: Hoare triple {26304#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26304#true} is VALID [2018-11-14 17:08:02,060 INFO L273 TraceCheckUtils]: 2: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,060 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26304#true} {26304#true} #69#return; {26304#true} is VALID [2018-11-14 17:08:02,061 INFO L256 TraceCheckUtils]: 4: Hoare triple {26304#true} call #t~ret13 := main(); {26304#true} is VALID [2018-11-14 17:08:02,061 INFO L273 TraceCheckUtils]: 5: Hoare triple {26304#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {26306#(= main_~i~1 0)} is VALID [2018-11-14 17:08:02,062 INFO L273 TraceCheckUtils]: 6: Hoare triple {26306#(= main_~i~1 0)} assume true; {26306#(= main_~i~1 0)} is VALID [2018-11-14 17:08:02,062 INFO L273 TraceCheckUtils]: 7: Hoare triple {26306#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26306#(= main_~i~1 0)} is VALID [2018-11-14 17:08:02,063 INFO L273 TraceCheckUtils]: 8: Hoare triple {26306#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26307#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:02,063 INFO L273 TraceCheckUtils]: 9: Hoare triple {26307#(<= main_~i~1 1)} assume true; {26307#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:02,064 INFO L273 TraceCheckUtils]: 10: Hoare triple {26307#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26307#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:02,064 INFO L273 TraceCheckUtils]: 11: Hoare triple {26307#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26308#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:02,064 INFO L273 TraceCheckUtils]: 12: Hoare triple {26308#(<= main_~i~1 2)} assume true; {26308#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:02,065 INFO L273 TraceCheckUtils]: 13: Hoare triple {26308#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26308#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:02,065 INFO L273 TraceCheckUtils]: 14: Hoare triple {26308#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26309#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:02,066 INFO L273 TraceCheckUtils]: 15: Hoare triple {26309#(<= main_~i~1 3)} assume true; {26309#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:02,066 INFO L273 TraceCheckUtils]: 16: Hoare triple {26309#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26309#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:02,067 INFO L273 TraceCheckUtils]: 17: Hoare triple {26309#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26310#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:02,067 INFO L273 TraceCheckUtils]: 18: Hoare triple {26310#(<= main_~i~1 4)} assume true; {26310#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:02,068 INFO L273 TraceCheckUtils]: 19: Hoare triple {26310#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26310#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:02,068 INFO L273 TraceCheckUtils]: 20: Hoare triple {26310#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26311#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:02,069 INFO L273 TraceCheckUtils]: 21: Hoare triple {26311#(<= main_~i~1 5)} assume true; {26311#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:02,069 INFO L273 TraceCheckUtils]: 22: Hoare triple {26311#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26311#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:02,070 INFO L273 TraceCheckUtils]: 23: Hoare triple {26311#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26312#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:02,071 INFO L273 TraceCheckUtils]: 24: Hoare triple {26312#(<= main_~i~1 6)} assume true; {26312#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:02,071 INFO L273 TraceCheckUtils]: 25: Hoare triple {26312#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26312#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:02,072 INFO L273 TraceCheckUtils]: 26: Hoare triple {26312#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26313#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:02,072 INFO L273 TraceCheckUtils]: 27: Hoare triple {26313#(<= main_~i~1 7)} assume true; {26313#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:02,073 INFO L273 TraceCheckUtils]: 28: Hoare triple {26313#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26313#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:02,074 INFO L273 TraceCheckUtils]: 29: Hoare triple {26313#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26314#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:02,074 INFO L273 TraceCheckUtils]: 30: Hoare triple {26314#(<= main_~i~1 8)} assume true; {26314#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:02,075 INFO L273 TraceCheckUtils]: 31: Hoare triple {26314#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26314#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:02,075 INFO L273 TraceCheckUtils]: 32: Hoare triple {26314#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26315#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:02,076 INFO L273 TraceCheckUtils]: 33: Hoare triple {26315#(<= main_~i~1 9)} assume true; {26315#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:02,076 INFO L273 TraceCheckUtils]: 34: Hoare triple {26315#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26315#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:02,077 INFO L273 TraceCheckUtils]: 35: Hoare triple {26315#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26316#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:02,077 INFO L273 TraceCheckUtils]: 36: Hoare triple {26316#(<= main_~i~1 10)} assume true; {26316#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:02,078 INFO L273 TraceCheckUtils]: 37: Hoare triple {26316#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26316#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:02,079 INFO L273 TraceCheckUtils]: 38: Hoare triple {26316#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26317#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:02,079 INFO L273 TraceCheckUtils]: 39: Hoare triple {26317#(<= main_~i~1 11)} assume true; {26317#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:02,080 INFO L273 TraceCheckUtils]: 40: Hoare triple {26317#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26317#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:02,080 INFO L273 TraceCheckUtils]: 41: Hoare triple {26317#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26318#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:02,081 INFO L273 TraceCheckUtils]: 42: Hoare triple {26318#(<= main_~i~1 12)} assume true; {26318#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:02,081 INFO L273 TraceCheckUtils]: 43: Hoare triple {26318#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26318#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:02,082 INFO L273 TraceCheckUtils]: 44: Hoare triple {26318#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26319#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:02,083 INFO L273 TraceCheckUtils]: 45: Hoare triple {26319#(<= main_~i~1 13)} assume true; {26319#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:02,083 INFO L273 TraceCheckUtils]: 46: Hoare triple {26319#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26319#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:02,084 INFO L273 TraceCheckUtils]: 47: Hoare triple {26319#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26320#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:02,084 INFO L273 TraceCheckUtils]: 48: Hoare triple {26320#(<= main_~i~1 14)} assume true; {26320#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:02,085 INFO L273 TraceCheckUtils]: 49: Hoare triple {26320#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26320#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:02,086 INFO L273 TraceCheckUtils]: 50: Hoare triple {26320#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26321#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:02,086 INFO L273 TraceCheckUtils]: 51: Hoare triple {26321#(<= main_~i~1 15)} assume true; {26321#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:02,087 INFO L273 TraceCheckUtils]: 52: Hoare triple {26321#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26321#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:02,087 INFO L273 TraceCheckUtils]: 53: Hoare triple {26321#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26322#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:02,088 INFO L273 TraceCheckUtils]: 54: Hoare triple {26322#(<= main_~i~1 16)} assume true; {26322#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:02,088 INFO L273 TraceCheckUtils]: 55: Hoare triple {26322#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26322#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:02,089 INFO L273 TraceCheckUtils]: 56: Hoare triple {26322#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26323#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:02,089 INFO L273 TraceCheckUtils]: 57: Hoare triple {26323#(<= main_~i~1 17)} assume true; {26323#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:02,090 INFO L273 TraceCheckUtils]: 58: Hoare triple {26323#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26323#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:02,091 INFO L273 TraceCheckUtils]: 59: Hoare triple {26323#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26324#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:02,091 INFO L273 TraceCheckUtils]: 60: Hoare triple {26324#(<= main_~i~1 18)} assume true; {26324#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:02,092 INFO L273 TraceCheckUtils]: 61: Hoare triple {26324#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26324#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:02,092 INFO L273 TraceCheckUtils]: 62: Hoare triple {26324#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26325#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:02,093 INFO L273 TraceCheckUtils]: 63: Hoare triple {26325#(<= main_~i~1 19)} assume true; {26325#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:02,093 INFO L273 TraceCheckUtils]: 64: Hoare triple {26325#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26325#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:02,094 INFO L273 TraceCheckUtils]: 65: Hoare triple {26325#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26326#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:02,095 INFO L273 TraceCheckUtils]: 66: Hoare triple {26326#(<= main_~i~1 20)} assume true; {26326#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:02,095 INFO L273 TraceCheckUtils]: 67: Hoare triple {26326#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26326#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:02,096 INFO L273 TraceCheckUtils]: 68: Hoare triple {26326#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26327#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:02,096 INFO L273 TraceCheckUtils]: 69: Hoare triple {26327#(<= main_~i~1 21)} assume true; {26327#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:02,097 INFO L273 TraceCheckUtils]: 70: Hoare triple {26327#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26327#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:02,098 INFO L273 TraceCheckUtils]: 71: Hoare triple {26327#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26328#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:02,098 INFO L273 TraceCheckUtils]: 72: Hoare triple {26328#(<= main_~i~1 22)} assume true; {26328#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:02,099 INFO L273 TraceCheckUtils]: 73: Hoare triple {26328#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26328#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:02,099 INFO L273 TraceCheckUtils]: 74: Hoare triple {26328#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26329#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:02,100 INFO L273 TraceCheckUtils]: 75: Hoare triple {26329#(<= main_~i~1 23)} assume true; {26329#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:02,100 INFO L273 TraceCheckUtils]: 76: Hoare triple {26329#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26329#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:02,101 INFO L273 TraceCheckUtils]: 77: Hoare triple {26329#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26330#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:02,101 INFO L273 TraceCheckUtils]: 78: Hoare triple {26330#(<= main_~i~1 24)} assume true; {26330#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:02,102 INFO L273 TraceCheckUtils]: 79: Hoare triple {26330#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26330#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:02,103 INFO L273 TraceCheckUtils]: 80: Hoare triple {26330#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26331#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:02,103 INFO L273 TraceCheckUtils]: 81: Hoare triple {26331#(<= main_~i~1 25)} assume true; {26331#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:02,104 INFO L273 TraceCheckUtils]: 82: Hoare triple {26331#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26331#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:02,104 INFO L273 TraceCheckUtils]: 83: Hoare triple {26331#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26332#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:02,105 INFO L273 TraceCheckUtils]: 84: Hoare triple {26332#(<= main_~i~1 26)} assume true; {26332#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:02,105 INFO L273 TraceCheckUtils]: 85: Hoare triple {26332#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26332#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:02,106 INFO L273 TraceCheckUtils]: 86: Hoare triple {26332#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26333#(<= main_~i~1 27)} is VALID [2018-11-14 17:08:02,107 INFO L273 TraceCheckUtils]: 87: Hoare triple {26333#(<= main_~i~1 27)} assume true; {26333#(<= main_~i~1 27)} is VALID [2018-11-14 17:08:02,107 INFO L273 TraceCheckUtils]: 88: Hoare triple {26333#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26333#(<= main_~i~1 27)} is VALID [2018-11-14 17:08:02,108 INFO L273 TraceCheckUtils]: 89: Hoare triple {26333#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26334#(<= main_~i~1 28)} is VALID [2018-11-14 17:08:02,108 INFO L273 TraceCheckUtils]: 90: Hoare triple {26334#(<= main_~i~1 28)} assume true; {26334#(<= main_~i~1 28)} is VALID [2018-11-14 17:08:02,109 INFO L273 TraceCheckUtils]: 91: Hoare triple {26334#(<= main_~i~1 28)} assume !(~i~1 < 100); {26305#false} is VALID [2018-11-14 17:08:02,109 INFO L256 TraceCheckUtils]: 92: Hoare triple {26305#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {26304#true} is VALID [2018-11-14 17:08:02,109 INFO L273 TraceCheckUtils]: 93: Hoare triple {26304#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26304#true} is VALID [2018-11-14 17:08:02,109 INFO L273 TraceCheckUtils]: 94: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,110 INFO L273 TraceCheckUtils]: 95: Hoare triple {26304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:02,110 INFO L273 TraceCheckUtils]: 96: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:02,110 INFO L273 TraceCheckUtils]: 97: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,110 INFO L273 TraceCheckUtils]: 98: Hoare triple {26304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:02,110 INFO L273 TraceCheckUtils]: 99: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:02,111 INFO L273 TraceCheckUtils]: 100: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,111 INFO L273 TraceCheckUtils]: 101: Hoare triple {26304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:02,111 INFO L273 TraceCheckUtils]: 102: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:02,111 INFO L273 TraceCheckUtils]: 103: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,111 INFO L273 TraceCheckUtils]: 104: Hoare triple {26304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:02,111 INFO L273 TraceCheckUtils]: 105: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:02,112 INFO L273 TraceCheckUtils]: 106: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,112 INFO L273 TraceCheckUtils]: 107: Hoare triple {26304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:02,112 INFO L273 TraceCheckUtils]: 108: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:02,112 INFO L273 TraceCheckUtils]: 109: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,112 INFO L273 TraceCheckUtils]: 110: Hoare triple {26304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:02,112 INFO L273 TraceCheckUtils]: 111: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:02,112 INFO L273 TraceCheckUtils]: 112: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,112 INFO L273 TraceCheckUtils]: 113: Hoare triple {26304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:02,112 INFO L273 TraceCheckUtils]: 114: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:02,112 INFO L273 TraceCheckUtils]: 115: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,113 INFO L273 TraceCheckUtils]: 116: Hoare triple {26304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:02,113 INFO L273 TraceCheckUtils]: 117: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:02,113 INFO L273 TraceCheckUtils]: 118: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,113 INFO L273 TraceCheckUtils]: 119: Hoare triple {26304#true} assume !(~i~0 < 100); {26304#true} is VALID [2018-11-14 17:08:02,113 INFO L273 TraceCheckUtils]: 120: Hoare triple {26304#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26304#true} is VALID [2018-11-14 17:08:02,113 INFO L273 TraceCheckUtils]: 121: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,113 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {26304#true} {26305#false} #73#return; {26305#false} is VALID [2018-11-14 17:08:02,113 INFO L273 TraceCheckUtils]: 123: Hoare triple {26305#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {26305#false} is VALID [2018-11-14 17:08:02,113 INFO L256 TraceCheckUtils]: 124: Hoare triple {26305#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {26304#true} is VALID [2018-11-14 17:08:02,114 INFO L273 TraceCheckUtils]: 125: Hoare triple {26304#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26304#true} is VALID [2018-11-14 17:08:02,114 INFO L273 TraceCheckUtils]: 126: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,114 INFO L273 TraceCheckUtils]: 127: Hoare triple {26304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:02,114 INFO L273 TraceCheckUtils]: 128: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:02,114 INFO L273 TraceCheckUtils]: 129: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,114 INFO L273 TraceCheckUtils]: 130: Hoare triple {26304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:02,114 INFO L273 TraceCheckUtils]: 131: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:02,114 INFO L273 TraceCheckUtils]: 132: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,114 INFO L273 TraceCheckUtils]: 133: Hoare triple {26304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:02,114 INFO L273 TraceCheckUtils]: 134: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:02,115 INFO L273 TraceCheckUtils]: 135: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,115 INFO L273 TraceCheckUtils]: 136: Hoare triple {26304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:02,115 INFO L273 TraceCheckUtils]: 137: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:02,115 INFO L273 TraceCheckUtils]: 138: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,115 INFO L273 TraceCheckUtils]: 139: Hoare triple {26304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:02,115 INFO L273 TraceCheckUtils]: 140: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:02,115 INFO L273 TraceCheckUtils]: 141: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,115 INFO L273 TraceCheckUtils]: 142: Hoare triple {26304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:02,115 INFO L273 TraceCheckUtils]: 143: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:02,115 INFO L273 TraceCheckUtils]: 144: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,116 INFO L273 TraceCheckUtils]: 145: Hoare triple {26304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:02,116 INFO L273 TraceCheckUtils]: 146: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:02,116 INFO L273 TraceCheckUtils]: 147: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,116 INFO L273 TraceCheckUtils]: 148: Hoare triple {26304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:02,116 INFO L273 TraceCheckUtils]: 149: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:02,116 INFO L273 TraceCheckUtils]: 150: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,116 INFO L273 TraceCheckUtils]: 151: Hoare triple {26304#true} assume !(~i~0 < 100); {26304#true} is VALID [2018-11-14 17:08:02,116 INFO L273 TraceCheckUtils]: 152: Hoare triple {26304#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26304#true} is VALID [2018-11-14 17:08:02,116 INFO L273 TraceCheckUtils]: 153: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,116 INFO L268 TraceCheckUtils]: 154: Hoare quadruple {26304#true} {26305#false} #75#return; {26305#false} is VALID [2018-11-14 17:08:02,117 INFO L273 TraceCheckUtils]: 155: Hoare triple {26305#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {26305#false} is VALID [2018-11-14 17:08:02,117 INFO L273 TraceCheckUtils]: 156: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,117 INFO L273 TraceCheckUtils]: 157: Hoare triple {26305#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:02,117 INFO L273 TraceCheckUtils]: 158: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:02,117 INFO L273 TraceCheckUtils]: 159: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,117 INFO L273 TraceCheckUtils]: 160: Hoare triple {26305#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:02,117 INFO L273 TraceCheckUtils]: 161: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:02,117 INFO L273 TraceCheckUtils]: 162: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,117 INFO L273 TraceCheckUtils]: 163: Hoare triple {26305#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:02,117 INFO L273 TraceCheckUtils]: 164: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:02,118 INFO L273 TraceCheckUtils]: 165: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,118 INFO L273 TraceCheckUtils]: 166: Hoare triple {26305#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:02,118 INFO L273 TraceCheckUtils]: 167: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:02,118 INFO L273 TraceCheckUtils]: 168: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,118 INFO L273 TraceCheckUtils]: 169: Hoare triple {26305#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:02,118 INFO L273 TraceCheckUtils]: 170: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:02,118 INFO L273 TraceCheckUtils]: 171: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,118 INFO L273 TraceCheckUtils]: 172: Hoare triple {26305#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:02,118 INFO L273 TraceCheckUtils]: 173: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:02,119 INFO L273 TraceCheckUtils]: 174: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,119 INFO L273 TraceCheckUtils]: 175: Hoare triple {26305#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:02,119 INFO L273 TraceCheckUtils]: 176: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:02,119 INFO L273 TraceCheckUtils]: 177: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,119 INFO L273 TraceCheckUtils]: 178: Hoare triple {26305#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:02,119 INFO L273 TraceCheckUtils]: 179: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:02,119 INFO L273 TraceCheckUtils]: 180: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,119 INFO L273 TraceCheckUtils]: 181: Hoare triple {26305#false} assume !(~i~2 < 99); {26305#false} is VALID [2018-11-14 17:08:02,119 INFO L273 TraceCheckUtils]: 182: Hoare triple {26305#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {26305#false} is VALID [2018-11-14 17:08:02,119 INFO L256 TraceCheckUtils]: 183: Hoare triple {26305#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {26304#true} is VALID [2018-11-14 17:08:02,120 INFO L273 TraceCheckUtils]: 184: Hoare triple {26304#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26304#true} is VALID [2018-11-14 17:08:02,120 INFO L273 TraceCheckUtils]: 185: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,120 INFO L273 TraceCheckUtils]: 186: Hoare triple {26304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:02,120 INFO L273 TraceCheckUtils]: 187: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:02,120 INFO L273 TraceCheckUtils]: 188: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,120 INFO L273 TraceCheckUtils]: 189: Hoare triple {26304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:02,120 INFO L273 TraceCheckUtils]: 190: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:02,120 INFO L273 TraceCheckUtils]: 191: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,120 INFO L273 TraceCheckUtils]: 192: Hoare triple {26304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:02,120 INFO L273 TraceCheckUtils]: 193: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:02,121 INFO L273 TraceCheckUtils]: 194: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,121 INFO L273 TraceCheckUtils]: 195: Hoare triple {26304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:02,121 INFO L273 TraceCheckUtils]: 196: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:02,121 INFO L273 TraceCheckUtils]: 197: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,121 INFO L273 TraceCheckUtils]: 198: Hoare triple {26304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:02,121 INFO L273 TraceCheckUtils]: 199: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:02,121 INFO L273 TraceCheckUtils]: 200: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,121 INFO L273 TraceCheckUtils]: 201: Hoare triple {26304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:02,121 INFO L273 TraceCheckUtils]: 202: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:02,121 INFO L273 TraceCheckUtils]: 203: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,122 INFO L273 TraceCheckUtils]: 204: Hoare triple {26304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:02,122 INFO L273 TraceCheckUtils]: 205: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:02,122 INFO L273 TraceCheckUtils]: 206: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,122 INFO L273 TraceCheckUtils]: 207: Hoare triple {26304#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 17:08:02,122 INFO L273 TraceCheckUtils]: 208: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 17:08:02,122 INFO L273 TraceCheckUtils]: 209: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,122 INFO L273 TraceCheckUtils]: 210: Hoare triple {26304#true} assume !(~i~0 < 100); {26304#true} is VALID [2018-11-14 17:08:02,122 INFO L273 TraceCheckUtils]: 211: Hoare triple {26304#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26304#true} is VALID [2018-11-14 17:08:02,122 INFO L273 TraceCheckUtils]: 212: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,122 INFO L268 TraceCheckUtils]: 213: Hoare quadruple {26304#true} {26305#false} #77#return; {26305#false} is VALID [2018-11-14 17:08:02,123 INFO L273 TraceCheckUtils]: 214: Hoare triple {26305#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {26305#false} is VALID [2018-11-14 17:08:02,123 INFO L273 TraceCheckUtils]: 215: Hoare triple {26305#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {26305#false} is VALID [2018-11-14 17:08:02,123 INFO L273 TraceCheckUtils]: 216: Hoare triple {26305#false} assume !false; {26305#false} is VALID [2018-11-14 17:08:02,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2018-11-14 17:08:02,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:02,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:08:02,152 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:08:02,227 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:08:02,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:08:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:02,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:02,604 INFO L256 TraceCheckUtils]: 0: Hoare triple {26304#true} call ULTIMATE.init(); {26304#true} is VALID [2018-11-14 17:08:02,604 INFO L273 TraceCheckUtils]: 1: Hoare triple {26304#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26304#true} is VALID [2018-11-14 17:08:02,604 INFO L273 TraceCheckUtils]: 2: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 17:08:02,605 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26304#true} {26304#true} #69#return; {26304#true} is VALID [2018-11-14 17:08:02,605 INFO L256 TraceCheckUtils]: 4: Hoare triple {26304#true} call #t~ret13 := main(); {26304#true} is VALID [2018-11-14 17:08:02,606 INFO L273 TraceCheckUtils]: 5: Hoare triple {26304#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {26353#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:02,606 INFO L273 TraceCheckUtils]: 6: Hoare triple {26353#(<= main_~i~1 0)} assume true; {26353#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:02,606 INFO L273 TraceCheckUtils]: 7: Hoare triple {26353#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26353#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:02,607 INFO L273 TraceCheckUtils]: 8: Hoare triple {26353#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26307#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:02,607 INFO L273 TraceCheckUtils]: 9: Hoare triple {26307#(<= main_~i~1 1)} assume true; {26307#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:02,607 INFO L273 TraceCheckUtils]: 10: Hoare triple {26307#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26307#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:02,608 INFO L273 TraceCheckUtils]: 11: Hoare triple {26307#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26308#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:02,608 INFO L273 TraceCheckUtils]: 12: Hoare triple {26308#(<= main_~i~1 2)} assume true; {26308#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:02,608 INFO L273 TraceCheckUtils]: 13: Hoare triple {26308#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26308#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:02,609 INFO L273 TraceCheckUtils]: 14: Hoare triple {26308#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26309#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:02,609 INFO L273 TraceCheckUtils]: 15: Hoare triple {26309#(<= main_~i~1 3)} assume true; {26309#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:02,610 INFO L273 TraceCheckUtils]: 16: Hoare triple {26309#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26309#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:02,610 INFO L273 TraceCheckUtils]: 17: Hoare triple {26309#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26310#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:02,611 INFO L273 TraceCheckUtils]: 18: Hoare triple {26310#(<= main_~i~1 4)} assume true; {26310#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:02,611 INFO L273 TraceCheckUtils]: 19: Hoare triple {26310#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26310#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:02,612 INFO L273 TraceCheckUtils]: 20: Hoare triple {26310#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26311#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:02,613 INFO L273 TraceCheckUtils]: 21: Hoare triple {26311#(<= main_~i~1 5)} assume true; {26311#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:02,613 INFO L273 TraceCheckUtils]: 22: Hoare triple {26311#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26311#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:02,614 INFO L273 TraceCheckUtils]: 23: Hoare triple {26311#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26312#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:02,614 INFO L273 TraceCheckUtils]: 24: Hoare triple {26312#(<= main_~i~1 6)} assume true; {26312#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:02,615 INFO L273 TraceCheckUtils]: 25: Hoare triple {26312#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26312#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:02,616 INFO L273 TraceCheckUtils]: 26: Hoare triple {26312#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26313#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:02,616 INFO L273 TraceCheckUtils]: 27: Hoare triple {26313#(<= main_~i~1 7)} assume true; {26313#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:02,617 INFO L273 TraceCheckUtils]: 28: Hoare triple {26313#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26313#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:02,617 INFO L273 TraceCheckUtils]: 29: Hoare triple {26313#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26314#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:02,618 INFO L273 TraceCheckUtils]: 30: Hoare triple {26314#(<= main_~i~1 8)} assume true; {26314#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:02,618 INFO L273 TraceCheckUtils]: 31: Hoare triple {26314#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26314#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:02,619 INFO L273 TraceCheckUtils]: 32: Hoare triple {26314#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26315#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:02,620 INFO L273 TraceCheckUtils]: 33: Hoare triple {26315#(<= main_~i~1 9)} assume true; {26315#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:02,620 INFO L273 TraceCheckUtils]: 34: Hoare triple {26315#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26315#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:02,621 INFO L273 TraceCheckUtils]: 35: Hoare triple {26315#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26316#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:02,621 INFO L273 TraceCheckUtils]: 36: Hoare triple {26316#(<= main_~i~1 10)} assume true; {26316#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:02,622 INFO L273 TraceCheckUtils]: 37: Hoare triple {26316#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26316#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:02,622 INFO L273 TraceCheckUtils]: 38: Hoare triple {26316#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26317#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:02,623 INFO L273 TraceCheckUtils]: 39: Hoare triple {26317#(<= main_~i~1 11)} assume true; {26317#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:02,623 INFO L273 TraceCheckUtils]: 40: Hoare triple {26317#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26317#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:02,624 INFO L273 TraceCheckUtils]: 41: Hoare triple {26317#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26318#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:02,625 INFO L273 TraceCheckUtils]: 42: Hoare triple {26318#(<= main_~i~1 12)} assume true; {26318#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:02,625 INFO L273 TraceCheckUtils]: 43: Hoare triple {26318#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26318#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:02,626 INFO L273 TraceCheckUtils]: 44: Hoare triple {26318#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26319#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:02,626 INFO L273 TraceCheckUtils]: 45: Hoare triple {26319#(<= main_~i~1 13)} assume true; {26319#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:02,627 INFO L273 TraceCheckUtils]: 46: Hoare triple {26319#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26319#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:02,628 INFO L273 TraceCheckUtils]: 47: Hoare triple {26319#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26320#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:02,628 INFO L273 TraceCheckUtils]: 48: Hoare triple {26320#(<= main_~i~1 14)} assume true; {26320#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:02,629 INFO L273 TraceCheckUtils]: 49: Hoare triple {26320#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26320#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:02,629 INFO L273 TraceCheckUtils]: 50: Hoare triple {26320#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26321#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:02,630 INFO L273 TraceCheckUtils]: 51: Hoare triple {26321#(<= main_~i~1 15)} assume true; {26321#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:02,630 INFO L273 TraceCheckUtils]: 52: Hoare triple {26321#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26321#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:02,631 INFO L273 TraceCheckUtils]: 53: Hoare triple {26321#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26322#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:02,631 INFO L273 TraceCheckUtils]: 54: Hoare triple {26322#(<= main_~i~1 16)} assume true; {26322#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:02,632 INFO L273 TraceCheckUtils]: 55: Hoare triple {26322#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26322#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:02,633 INFO L273 TraceCheckUtils]: 56: Hoare triple {26322#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26323#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:02,633 INFO L273 TraceCheckUtils]: 57: Hoare triple {26323#(<= main_~i~1 17)} assume true; {26323#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:02,633 INFO L273 TraceCheckUtils]: 58: Hoare triple {26323#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26323#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:02,634 INFO L273 TraceCheckUtils]: 59: Hoare triple {26323#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26324#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:02,635 INFO L273 TraceCheckUtils]: 60: Hoare triple {26324#(<= main_~i~1 18)} assume true; {26324#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:02,635 INFO L273 TraceCheckUtils]: 61: Hoare triple {26324#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26324#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:02,636 INFO L273 TraceCheckUtils]: 62: Hoare triple {26324#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26325#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:02,636 INFO L273 TraceCheckUtils]: 63: Hoare triple {26325#(<= main_~i~1 19)} assume true; {26325#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:02,637 INFO L273 TraceCheckUtils]: 64: Hoare triple {26325#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26325#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:02,637 INFO L273 TraceCheckUtils]: 65: Hoare triple {26325#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26326#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:02,638 INFO L273 TraceCheckUtils]: 66: Hoare triple {26326#(<= main_~i~1 20)} assume true; {26326#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:02,638 INFO L273 TraceCheckUtils]: 67: Hoare triple {26326#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26326#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:02,639 INFO L273 TraceCheckUtils]: 68: Hoare triple {26326#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26327#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:02,639 INFO L273 TraceCheckUtils]: 69: Hoare triple {26327#(<= main_~i~1 21)} assume true; {26327#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:02,640 INFO L273 TraceCheckUtils]: 70: Hoare triple {26327#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26327#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:02,641 INFO L273 TraceCheckUtils]: 71: Hoare triple {26327#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26328#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:02,641 INFO L273 TraceCheckUtils]: 72: Hoare triple {26328#(<= main_~i~1 22)} assume true; {26328#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:02,642 INFO L273 TraceCheckUtils]: 73: Hoare triple {26328#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26328#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:02,642 INFO L273 TraceCheckUtils]: 74: Hoare triple {26328#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26329#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:02,643 INFO L273 TraceCheckUtils]: 75: Hoare triple {26329#(<= main_~i~1 23)} assume true; {26329#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:02,643 INFO L273 TraceCheckUtils]: 76: Hoare triple {26329#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26329#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:02,644 INFO L273 TraceCheckUtils]: 77: Hoare triple {26329#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26330#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:02,645 INFO L273 TraceCheckUtils]: 78: Hoare triple {26330#(<= main_~i~1 24)} assume true; {26330#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:02,645 INFO L273 TraceCheckUtils]: 79: Hoare triple {26330#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26330#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:02,646 INFO L273 TraceCheckUtils]: 80: Hoare triple {26330#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26331#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:02,646 INFO L273 TraceCheckUtils]: 81: Hoare triple {26331#(<= main_~i~1 25)} assume true; {26331#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:02,647 INFO L273 TraceCheckUtils]: 82: Hoare triple {26331#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26331#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:02,648 INFO L273 TraceCheckUtils]: 83: Hoare triple {26331#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26332#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:02,648 INFO L273 TraceCheckUtils]: 84: Hoare triple {26332#(<= main_~i~1 26)} assume true; {26332#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:02,649 INFO L273 TraceCheckUtils]: 85: Hoare triple {26332#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26332#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:02,649 INFO L273 TraceCheckUtils]: 86: Hoare triple {26332#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26333#(<= main_~i~1 27)} is VALID [2018-11-14 17:08:02,650 INFO L273 TraceCheckUtils]: 87: Hoare triple {26333#(<= main_~i~1 27)} assume true; {26333#(<= main_~i~1 27)} is VALID [2018-11-14 17:08:02,650 INFO L273 TraceCheckUtils]: 88: Hoare triple {26333#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26333#(<= main_~i~1 27)} is VALID [2018-11-14 17:08:02,651 INFO L273 TraceCheckUtils]: 89: Hoare triple {26333#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26334#(<= main_~i~1 28)} is VALID [2018-11-14 17:08:02,652 INFO L273 TraceCheckUtils]: 90: Hoare triple {26334#(<= main_~i~1 28)} assume true; {26334#(<= main_~i~1 28)} is VALID [2018-11-14 17:08:02,652 INFO L273 TraceCheckUtils]: 91: Hoare triple {26334#(<= main_~i~1 28)} assume !(~i~1 < 100); {26305#false} is VALID [2018-11-14 17:08:02,652 INFO L256 TraceCheckUtils]: 92: Hoare triple {26305#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {26305#false} is VALID [2018-11-14 17:08:02,653 INFO L273 TraceCheckUtils]: 93: Hoare triple {26305#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26305#false} is VALID [2018-11-14 17:08:02,653 INFO L273 TraceCheckUtils]: 94: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,653 INFO L273 TraceCheckUtils]: 95: Hoare triple {26305#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:02,653 INFO L273 TraceCheckUtils]: 96: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:02,653 INFO L273 TraceCheckUtils]: 97: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,653 INFO L273 TraceCheckUtils]: 98: Hoare triple {26305#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:02,654 INFO L273 TraceCheckUtils]: 99: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:02,654 INFO L273 TraceCheckUtils]: 100: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,654 INFO L273 TraceCheckUtils]: 101: Hoare triple {26305#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:02,654 INFO L273 TraceCheckUtils]: 102: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:02,654 INFO L273 TraceCheckUtils]: 103: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,654 INFO L273 TraceCheckUtils]: 104: Hoare triple {26305#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:02,655 INFO L273 TraceCheckUtils]: 105: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:02,655 INFO L273 TraceCheckUtils]: 106: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,655 INFO L273 TraceCheckUtils]: 107: Hoare triple {26305#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:02,655 INFO L273 TraceCheckUtils]: 108: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:02,655 INFO L273 TraceCheckUtils]: 109: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,655 INFO L273 TraceCheckUtils]: 110: Hoare triple {26305#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:02,656 INFO L273 TraceCheckUtils]: 111: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:02,656 INFO L273 TraceCheckUtils]: 112: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,656 INFO L273 TraceCheckUtils]: 113: Hoare triple {26305#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:02,656 INFO L273 TraceCheckUtils]: 114: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:02,656 INFO L273 TraceCheckUtils]: 115: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,656 INFO L273 TraceCheckUtils]: 116: Hoare triple {26305#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:02,657 INFO L273 TraceCheckUtils]: 117: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:02,657 INFO L273 TraceCheckUtils]: 118: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,657 INFO L273 TraceCheckUtils]: 119: Hoare triple {26305#false} assume !(~i~0 < 100); {26305#false} is VALID [2018-11-14 17:08:02,657 INFO L273 TraceCheckUtils]: 120: Hoare triple {26305#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26305#false} is VALID [2018-11-14 17:08:02,657 INFO L273 TraceCheckUtils]: 121: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,657 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {26305#false} {26305#false} #73#return; {26305#false} is VALID [2018-11-14 17:08:02,657 INFO L273 TraceCheckUtils]: 123: Hoare triple {26305#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {26305#false} is VALID [2018-11-14 17:08:02,657 INFO L256 TraceCheckUtils]: 124: Hoare triple {26305#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {26305#false} is VALID [2018-11-14 17:08:02,657 INFO L273 TraceCheckUtils]: 125: Hoare triple {26305#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26305#false} is VALID [2018-11-14 17:08:02,657 INFO L273 TraceCheckUtils]: 126: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,658 INFO L273 TraceCheckUtils]: 127: Hoare triple {26305#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:02,658 INFO L273 TraceCheckUtils]: 128: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:02,658 INFO L273 TraceCheckUtils]: 129: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,658 INFO L273 TraceCheckUtils]: 130: Hoare triple {26305#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:02,658 INFO L273 TraceCheckUtils]: 131: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:02,658 INFO L273 TraceCheckUtils]: 132: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,658 INFO L273 TraceCheckUtils]: 133: Hoare triple {26305#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:02,658 INFO L273 TraceCheckUtils]: 134: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:02,658 INFO L273 TraceCheckUtils]: 135: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,659 INFO L273 TraceCheckUtils]: 136: Hoare triple {26305#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:02,659 INFO L273 TraceCheckUtils]: 137: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:02,659 INFO L273 TraceCheckUtils]: 138: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,659 INFO L273 TraceCheckUtils]: 139: Hoare triple {26305#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:02,659 INFO L273 TraceCheckUtils]: 140: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:02,659 INFO L273 TraceCheckUtils]: 141: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,659 INFO L273 TraceCheckUtils]: 142: Hoare triple {26305#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:02,659 INFO L273 TraceCheckUtils]: 143: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:02,659 INFO L273 TraceCheckUtils]: 144: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,659 INFO L273 TraceCheckUtils]: 145: Hoare triple {26305#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:02,660 INFO L273 TraceCheckUtils]: 146: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:02,660 INFO L273 TraceCheckUtils]: 147: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,660 INFO L273 TraceCheckUtils]: 148: Hoare triple {26305#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:02,660 INFO L273 TraceCheckUtils]: 149: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:02,660 INFO L273 TraceCheckUtils]: 150: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,660 INFO L273 TraceCheckUtils]: 151: Hoare triple {26305#false} assume !(~i~0 < 100); {26305#false} is VALID [2018-11-14 17:08:02,660 INFO L273 TraceCheckUtils]: 152: Hoare triple {26305#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26305#false} is VALID [2018-11-14 17:08:02,660 INFO L273 TraceCheckUtils]: 153: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,660 INFO L268 TraceCheckUtils]: 154: Hoare quadruple {26305#false} {26305#false} #75#return; {26305#false} is VALID [2018-11-14 17:08:02,660 INFO L273 TraceCheckUtils]: 155: Hoare triple {26305#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {26305#false} is VALID [2018-11-14 17:08:02,661 INFO L273 TraceCheckUtils]: 156: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,661 INFO L273 TraceCheckUtils]: 157: Hoare triple {26305#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:02,661 INFO L273 TraceCheckUtils]: 158: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:02,661 INFO L273 TraceCheckUtils]: 159: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,661 INFO L273 TraceCheckUtils]: 160: Hoare triple {26305#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:02,661 INFO L273 TraceCheckUtils]: 161: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:02,661 INFO L273 TraceCheckUtils]: 162: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,661 INFO L273 TraceCheckUtils]: 163: Hoare triple {26305#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:02,661 INFO L273 TraceCheckUtils]: 164: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:02,661 INFO L273 TraceCheckUtils]: 165: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,662 INFO L273 TraceCheckUtils]: 166: Hoare triple {26305#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:02,662 INFO L273 TraceCheckUtils]: 167: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:02,662 INFO L273 TraceCheckUtils]: 168: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,662 INFO L273 TraceCheckUtils]: 169: Hoare triple {26305#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:02,662 INFO L273 TraceCheckUtils]: 170: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:02,662 INFO L273 TraceCheckUtils]: 171: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,662 INFO L273 TraceCheckUtils]: 172: Hoare triple {26305#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:02,662 INFO L273 TraceCheckUtils]: 173: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:02,662 INFO L273 TraceCheckUtils]: 174: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,662 INFO L273 TraceCheckUtils]: 175: Hoare triple {26305#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:02,663 INFO L273 TraceCheckUtils]: 176: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:02,663 INFO L273 TraceCheckUtils]: 177: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,663 INFO L273 TraceCheckUtils]: 178: Hoare triple {26305#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 17:08:02,663 INFO L273 TraceCheckUtils]: 179: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 17:08:02,663 INFO L273 TraceCheckUtils]: 180: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,663 INFO L273 TraceCheckUtils]: 181: Hoare triple {26305#false} assume !(~i~2 < 99); {26305#false} is VALID [2018-11-14 17:08:02,663 INFO L273 TraceCheckUtils]: 182: Hoare triple {26305#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {26305#false} is VALID [2018-11-14 17:08:02,663 INFO L256 TraceCheckUtils]: 183: Hoare triple {26305#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {26305#false} is VALID [2018-11-14 17:08:02,663 INFO L273 TraceCheckUtils]: 184: Hoare triple {26305#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26305#false} is VALID [2018-11-14 17:08:02,663 INFO L273 TraceCheckUtils]: 185: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,664 INFO L273 TraceCheckUtils]: 186: Hoare triple {26305#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:02,664 INFO L273 TraceCheckUtils]: 187: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:02,664 INFO L273 TraceCheckUtils]: 188: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,664 INFO L273 TraceCheckUtils]: 189: Hoare triple {26305#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:02,664 INFO L273 TraceCheckUtils]: 190: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:02,664 INFO L273 TraceCheckUtils]: 191: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,664 INFO L273 TraceCheckUtils]: 192: Hoare triple {26305#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:02,664 INFO L273 TraceCheckUtils]: 193: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:02,664 INFO L273 TraceCheckUtils]: 194: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,664 INFO L273 TraceCheckUtils]: 195: Hoare triple {26305#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:02,665 INFO L273 TraceCheckUtils]: 196: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:02,665 INFO L273 TraceCheckUtils]: 197: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,665 INFO L273 TraceCheckUtils]: 198: Hoare triple {26305#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:02,665 INFO L273 TraceCheckUtils]: 199: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:02,665 INFO L273 TraceCheckUtils]: 200: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,665 INFO L273 TraceCheckUtils]: 201: Hoare triple {26305#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:02,665 INFO L273 TraceCheckUtils]: 202: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:02,665 INFO L273 TraceCheckUtils]: 203: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,665 INFO L273 TraceCheckUtils]: 204: Hoare triple {26305#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:02,666 INFO L273 TraceCheckUtils]: 205: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:02,666 INFO L273 TraceCheckUtils]: 206: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,666 INFO L273 TraceCheckUtils]: 207: Hoare triple {26305#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 17:08:02,666 INFO L273 TraceCheckUtils]: 208: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 17:08:02,666 INFO L273 TraceCheckUtils]: 209: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,666 INFO L273 TraceCheckUtils]: 210: Hoare triple {26305#false} assume !(~i~0 < 100); {26305#false} is VALID [2018-11-14 17:08:02,666 INFO L273 TraceCheckUtils]: 211: Hoare triple {26305#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26305#false} is VALID [2018-11-14 17:08:02,666 INFO L273 TraceCheckUtils]: 212: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 17:08:02,666 INFO L268 TraceCheckUtils]: 213: Hoare quadruple {26305#false} {26305#false} #77#return; {26305#false} is VALID [2018-11-14 17:08:02,666 INFO L273 TraceCheckUtils]: 214: Hoare triple {26305#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {26305#false} is VALID [2018-11-14 17:08:02,667 INFO L273 TraceCheckUtils]: 215: Hoare triple {26305#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {26305#false} is VALID [2018-11-14 17:08:02,667 INFO L273 TraceCheckUtils]: 216: Hoare triple {26305#false} assume !false; {26305#false} is VALID [2018-11-14 17:08:02,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2018-11-14 17:08:02,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:02,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-14 17:08:02,710 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 217 [2018-11-14 17:08:02,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:02,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-14 17:08:02,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:02,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-14 17:08:02,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-14 17:08:02,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-14 17:08:02,849 INFO L87 Difference]: Start difference. First operand 158 states and 162 transitions. Second operand 32 states. [2018-11-14 17:08:04,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:04,093 INFO L93 Difference]: Finished difference Result 228 states and 236 transitions. [2018-11-14 17:08:04,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-14 17:08:04,093 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 217 [2018-11-14 17:08:04,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:04,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 17:08:04,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 144 transitions. [2018-11-14 17:08:04,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 17:08:04,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 144 transitions. [2018-11-14 17:08:04,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 144 transitions. [2018-11-14 17:08:04,226 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:04,229 INFO L225 Difference]: With dead ends: 228 [2018-11-14 17:08:04,230 INFO L226 Difference]: Without dead ends: 162 [2018-11-14 17:08:04,230 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-14 17:08:04,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-14 17:08:04,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-11-14 17:08:04,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:04,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand 161 states. [2018-11-14 17:08:04,562 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 161 states. [2018-11-14 17:08:04,562 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 161 states. [2018-11-14 17:08:04,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:04,565 INFO L93 Difference]: Finished difference Result 162 states and 166 transitions. [2018-11-14 17:08:04,566 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 166 transitions. [2018-11-14 17:08:04,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:04,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:04,566 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 162 states. [2018-11-14 17:08:04,566 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 162 states. [2018-11-14 17:08:04,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:04,569 INFO L93 Difference]: Finished difference Result 162 states and 166 transitions. [2018-11-14 17:08:04,569 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 166 transitions. [2018-11-14 17:08:04,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:04,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:04,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:04,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:04,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-14 17:08:04,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2018-11-14 17:08:04,573 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 217 [2018-11-14 17:08:04,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:04,573 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2018-11-14 17:08:04,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-14 17:08:04,574 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2018-11-14 17:08:04,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-14 17:08:04,575 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:04,575 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 27, 24, 24, 9, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:08:04,575 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:04,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:04,576 INFO L82 PathProgramCache]: Analyzing trace with hash -437865831, now seen corresponding path program 29 times [2018-11-14 17:08:04,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:04,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:04,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:04,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:08:04,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:05,938 INFO L256 TraceCheckUtils]: 0: Hoare triple {27833#true} call ULTIMATE.init(); {27833#true} is VALID [2018-11-14 17:08:05,938 INFO L273 TraceCheckUtils]: 1: Hoare triple {27833#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27833#true} is VALID [2018-11-14 17:08:05,938 INFO L273 TraceCheckUtils]: 2: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:05,938 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27833#true} {27833#true} #69#return; {27833#true} is VALID [2018-11-14 17:08:05,938 INFO L256 TraceCheckUtils]: 4: Hoare triple {27833#true} call #t~ret13 := main(); {27833#true} is VALID [2018-11-14 17:08:05,939 INFO L273 TraceCheckUtils]: 5: Hoare triple {27833#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {27835#(= main_~i~1 0)} is VALID [2018-11-14 17:08:05,939 INFO L273 TraceCheckUtils]: 6: Hoare triple {27835#(= main_~i~1 0)} assume true; {27835#(= main_~i~1 0)} is VALID [2018-11-14 17:08:05,940 INFO L273 TraceCheckUtils]: 7: Hoare triple {27835#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27835#(= main_~i~1 0)} is VALID [2018-11-14 17:08:05,941 INFO L273 TraceCheckUtils]: 8: Hoare triple {27835#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27836#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:05,941 INFO L273 TraceCheckUtils]: 9: Hoare triple {27836#(<= main_~i~1 1)} assume true; {27836#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:05,942 INFO L273 TraceCheckUtils]: 10: Hoare triple {27836#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27836#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:05,942 INFO L273 TraceCheckUtils]: 11: Hoare triple {27836#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27837#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:05,943 INFO L273 TraceCheckUtils]: 12: Hoare triple {27837#(<= main_~i~1 2)} assume true; {27837#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:05,943 INFO L273 TraceCheckUtils]: 13: Hoare triple {27837#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27837#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:05,944 INFO L273 TraceCheckUtils]: 14: Hoare triple {27837#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27838#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:05,945 INFO L273 TraceCheckUtils]: 15: Hoare triple {27838#(<= main_~i~1 3)} assume true; {27838#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:05,945 INFO L273 TraceCheckUtils]: 16: Hoare triple {27838#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27838#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:05,946 INFO L273 TraceCheckUtils]: 17: Hoare triple {27838#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27839#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:05,946 INFO L273 TraceCheckUtils]: 18: Hoare triple {27839#(<= main_~i~1 4)} assume true; {27839#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:05,947 INFO L273 TraceCheckUtils]: 19: Hoare triple {27839#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27839#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:05,948 INFO L273 TraceCheckUtils]: 20: Hoare triple {27839#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27840#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:05,948 INFO L273 TraceCheckUtils]: 21: Hoare triple {27840#(<= main_~i~1 5)} assume true; {27840#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:05,949 INFO L273 TraceCheckUtils]: 22: Hoare triple {27840#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27840#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:05,949 INFO L273 TraceCheckUtils]: 23: Hoare triple {27840#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27841#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:05,950 INFO L273 TraceCheckUtils]: 24: Hoare triple {27841#(<= main_~i~1 6)} assume true; {27841#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:05,950 INFO L273 TraceCheckUtils]: 25: Hoare triple {27841#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27841#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:05,951 INFO L273 TraceCheckUtils]: 26: Hoare triple {27841#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27842#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:05,952 INFO L273 TraceCheckUtils]: 27: Hoare triple {27842#(<= main_~i~1 7)} assume true; {27842#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:05,952 INFO L273 TraceCheckUtils]: 28: Hoare triple {27842#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27842#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:05,953 INFO L273 TraceCheckUtils]: 29: Hoare triple {27842#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27843#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:05,953 INFO L273 TraceCheckUtils]: 30: Hoare triple {27843#(<= main_~i~1 8)} assume true; {27843#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:05,954 INFO L273 TraceCheckUtils]: 31: Hoare triple {27843#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27843#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:05,954 INFO L273 TraceCheckUtils]: 32: Hoare triple {27843#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27844#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:05,955 INFO L273 TraceCheckUtils]: 33: Hoare triple {27844#(<= main_~i~1 9)} assume true; {27844#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:05,955 INFO L273 TraceCheckUtils]: 34: Hoare triple {27844#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27844#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:05,956 INFO L273 TraceCheckUtils]: 35: Hoare triple {27844#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27845#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:05,957 INFO L273 TraceCheckUtils]: 36: Hoare triple {27845#(<= main_~i~1 10)} assume true; {27845#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:05,957 INFO L273 TraceCheckUtils]: 37: Hoare triple {27845#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27845#(<= main_~i~1 10)} is VALID [2018-11-14 17:08:05,958 INFO L273 TraceCheckUtils]: 38: Hoare triple {27845#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27846#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:05,958 INFO L273 TraceCheckUtils]: 39: Hoare triple {27846#(<= main_~i~1 11)} assume true; {27846#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:05,959 INFO L273 TraceCheckUtils]: 40: Hoare triple {27846#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27846#(<= main_~i~1 11)} is VALID [2018-11-14 17:08:05,960 INFO L273 TraceCheckUtils]: 41: Hoare triple {27846#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27847#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:05,960 INFO L273 TraceCheckUtils]: 42: Hoare triple {27847#(<= main_~i~1 12)} assume true; {27847#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:05,961 INFO L273 TraceCheckUtils]: 43: Hoare triple {27847#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27847#(<= main_~i~1 12)} is VALID [2018-11-14 17:08:05,961 INFO L273 TraceCheckUtils]: 44: Hoare triple {27847#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27848#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:05,962 INFO L273 TraceCheckUtils]: 45: Hoare triple {27848#(<= main_~i~1 13)} assume true; {27848#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:05,962 INFO L273 TraceCheckUtils]: 46: Hoare triple {27848#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27848#(<= main_~i~1 13)} is VALID [2018-11-14 17:08:05,963 INFO L273 TraceCheckUtils]: 47: Hoare triple {27848#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27849#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:05,963 INFO L273 TraceCheckUtils]: 48: Hoare triple {27849#(<= main_~i~1 14)} assume true; {27849#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:05,964 INFO L273 TraceCheckUtils]: 49: Hoare triple {27849#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27849#(<= main_~i~1 14)} is VALID [2018-11-14 17:08:05,965 INFO L273 TraceCheckUtils]: 50: Hoare triple {27849#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27850#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:05,965 INFO L273 TraceCheckUtils]: 51: Hoare triple {27850#(<= main_~i~1 15)} assume true; {27850#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:05,966 INFO L273 TraceCheckUtils]: 52: Hoare triple {27850#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27850#(<= main_~i~1 15)} is VALID [2018-11-14 17:08:05,966 INFO L273 TraceCheckUtils]: 53: Hoare triple {27850#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27851#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:05,967 INFO L273 TraceCheckUtils]: 54: Hoare triple {27851#(<= main_~i~1 16)} assume true; {27851#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:05,967 INFO L273 TraceCheckUtils]: 55: Hoare triple {27851#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27851#(<= main_~i~1 16)} is VALID [2018-11-14 17:08:05,968 INFO L273 TraceCheckUtils]: 56: Hoare triple {27851#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27852#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:05,969 INFO L273 TraceCheckUtils]: 57: Hoare triple {27852#(<= main_~i~1 17)} assume true; {27852#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:05,969 INFO L273 TraceCheckUtils]: 58: Hoare triple {27852#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27852#(<= main_~i~1 17)} is VALID [2018-11-14 17:08:05,970 INFO L273 TraceCheckUtils]: 59: Hoare triple {27852#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27853#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:05,970 INFO L273 TraceCheckUtils]: 60: Hoare triple {27853#(<= main_~i~1 18)} assume true; {27853#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:05,971 INFO L273 TraceCheckUtils]: 61: Hoare triple {27853#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27853#(<= main_~i~1 18)} is VALID [2018-11-14 17:08:05,972 INFO L273 TraceCheckUtils]: 62: Hoare triple {27853#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27854#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:05,972 INFO L273 TraceCheckUtils]: 63: Hoare triple {27854#(<= main_~i~1 19)} assume true; {27854#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:05,973 INFO L273 TraceCheckUtils]: 64: Hoare triple {27854#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27854#(<= main_~i~1 19)} is VALID [2018-11-14 17:08:05,973 INFO L273 TraceCheckUtils]: 65: Hoare triple {27854#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27855#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:05,974 INFO L273 TraceCheckUtils]: 66: Hoare triple {27855#(<= main_~i~1 20)} assume true; {27855#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:05,974 INFO L273 TraceCheckUtils]: 67: Hoare triple {27855#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27855#(<= main_~i~1 20)} is VALID [2018-11-14 17:08:05,975 INFO L273 TraceCheckUtils]: 68: Hoare triple {27855#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27856#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:05,975 INFO L273 TraceCheckUtils]: 69: Hoare triple {27856#(<= main_~i~1 21)} assume true; {27856#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:05,976 INFO L273 TraceCheckUtils]: 70: Hoare triple {27856#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27856#(<= main_~i~1 21)} is VALID [2018-11-14 17:08:05,977 INFO L273 TraceCheckUtils]: 71: Hoare triple {27856#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27857#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:05,977 INFO L273 TraceCheckUtils]: 72: Hoare triple {27857#(<= main_~i~1 22)} assume true; {27857#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:05,978 INFO L273 TraceCheckUtils]: 73: Hoare triple {27857#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27857#(<= main_~i~1 22)} is VALID [2018-11-14 17:08:05,978 INFO L273 TraceCheckUtils]: 74: Hoare triple {27857#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27858#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:05,979 INFO L273 TraceCheckUtils]: 75: Hoare triple {27858#(<= main_~i~1 23)} assume true; {27858#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:05,979 INFO L273 TraceCheckUtils]: 76: Hoare triple {27858#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27858#(<= main_~i~1 23)} is VALID [2018-11-14 17:08:05,980 INFO L273 TraceCheckUtils]: 77: Hoare triple {27858#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27859#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:05,981 INFO L273 TraceCheckUtils]: 78: Hoare triple {27859#(<= main_~i~1 24)} assume true; {27859#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:05,981 INFO L273 TraceCheckUtils]: 79: Hoare triple {27859#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27859#(<= main_~i~1 24)} is VALID [2018-11-14 17:08:05,982 INFO L273 TraceCheckUtils]: 80: Hoare triple {27859#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27860#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:05,982 INFO L273 TraceCheckUtils]: 81: Hoare triple {27860#(<= main_~i~1 25)} assume true; {27860#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:05,983 INFO L273 TraceCheckUtils]: 82: Hoare triple {27860#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27860#(<= main_~i~1 25)} is VALID [2018-11-14 17:08:05,984 INFO L273 TraceCheckUtils]: 83: Hoare triple {27860#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27861#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:05,984 INFO L273 TraceCheckUtils]: 84: Hoare triple {27861#(<= main_~i~1 26)} assume true; {27861#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:05,985 INFO L273 TraceCheckUtils]: 85: Hoare triple {27861#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27861#(<= main_~i~1 26)} is VALID [2018-11-14 17:08:05,985 INFO L273 TraceCheckUtils]: 86: Hoare triple {27861#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27862#(<= main_~i~1 27)} is VALID [2018-11-14 17:08:05,986 INFO L273 TraceCheckUtils]: 87: Hoare triple {27862#(<= main_~i~1 27)} assume true; {27862#(<= main_~i~1 27)} is VALID [2018-11-14 17:08:05,986 INFO L273 TraceCheckUtils]: 88: Hoare triple {27862#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27862#(<= main_~i~1 27)} is VALID [2018-11-14 17:08:05,987 INFO L273 TraceCheckUtils]: 89: Hoare triple {27862#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27863#(<= main_~i~1 28)} is VALID [2018-11-14 17:08:05,987 INFO L273 TraceCheckUtils]: 90: Hoare triple {27863#(<= main_~i~1 28)} assume true; {27863#(<= main_~i~1 28)} is VALID [2018-11-14 17:08:05,988 INFO L273 TraceCheckUtils]: 91: Hoare triple {27863#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {27863#(<= main_~i~1 28)} is VALID [2018-11-14 17:08:05,989 INFO L273 TraceCheckUtils]: 92: Hoare triple {27863#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27864#(<= main_~i~1 29)} is VALID [2018-11-14 17:08:05,989 INFO L273 TraceCheckUtils]: 93: Hoare triple {27864#(<= main_~i~1 29)} assume true; {27864#(<= main_~i~1 29)} is VALID [2018-11-14 17:08:05,990 INFO L273 TraceCheckUtils]: 94: Hoare triple {27864#(<= main_~i~1 29)} assume !(~i~1 < 100); {27834#false} is VALID [2018-11-14 17:08:05,990 INFO L256 TraceCheckUtils]: 95: Hoare triple {27834#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {27833#true} is VALID [2018-11-14 17:08:05,990 INFO L273 TraceCheckUtils]: 96: Hoare triple {27833#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {27833#true} is VALID [2018-11-14 17:08:05,990 INFO L273 TraceCheckUtils]: 97: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:05,990 INFO L273 TraceCheckUtils]: 98: Hoare triple {27833#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:05,990 INFO L273 TraceCheckUtils]: 99: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:05,991 INFO L273 TraceCheckUtils]: 100: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:05,991 INFO L273 TraceCheckUtils]: 101: Hoare triple {27833#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:05,991 INFO L273 TraceCheckUtils]: 102: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:05,991 INFO L273 TraceCheckUtils]: 103: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:05,991 INFO L273 TraceCheckUtils]: 104: Hoare triple {27833#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:05,991 INFO L273 TraceCheckUtils]: 105: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:05,992 INFO L273 TraceCheckUtils]: 106: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:05,992 INFO L273 TraceCheckUtils]: 107: Hoare triple {27833#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:05,992 INFO L273 TraceCheckUtils]: 108: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:05,992 INFO L273 TraceCheckUtils]: 109: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:05,992 INFO L273 TraceCheckUtils]: 110: Hoare triple {27833#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:05,992 INFO L273 TraceCheckUtils]: 111: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:05,993 INFO L273 TraceCheckUtils]: 112: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:05,993 INFO L273 TraceCheckUtils]: 113: Hoare triple {27833#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:05,993 INFO L273 TraceCheckUtils]: 114: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:05,993 INFO L273 TraceCheckUtils]: 115: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:05,993 INFO L273 TraceCheckUtils]: 116: Hoare triple {27833#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:05,993 INFO L273 TraceCheckUtils]: 117: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:05,994 INFO L273 TraceCheckUtils]: 118: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:05,994 INFO L273 TraceCheckUtils]: 119: Hoare triple {27833#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:05,994 INFO L273 TraceCheckUtils]: 120: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:05,994 INFO L273 TraceCheckUtils]: 121: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:05,994 INFO L273 TraceCheckUtils]: 122: Hoare triple {27833#true} assume !(~i~0 < 100); {27833#true} is VALID [2018-11-14 17:08:05,994 INFO L273 TraceCheckUtils]: 123: Hoare triple {27833#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27833#true} is VALID [2018-11-14 17:08:05,995 INFO L273 TraceCheckUtils]: 124: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:05,995 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {27833#true} {27834#false} #73#return; {27834#false} is VALID [2018-11-14 17:08:05,995 INFO L273 TraceCheckUtils]: 126: Hoare triple {27834#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {27834#false} is VALID [2018-11-14 17:08:05,995 INFO L256 TraceCheckUtils]: 127: Hoare triple {27834#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {27833#true} is VALID [2018-11-14 17:08:05,995 INFO L273 TraceCheckUtils]: 128: Hoare triple {27833#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {27833#true} is VALID [2018-11-14 17:08:05,995 INFO L273 TraceCheckUtils]: 129: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:05,995 INFO L273 TraceCheckUtils]: 130: Hoare triple {27833#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:05,995 INFO L273 TraceCheckUtils]: 131: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:05,996 INFO L273 TraceCheckUtils]: 132: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:05,996 INFO L273 TraceCheckUtils]: 133: Hoare triple {27833#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:05,996 INFO L273 TraceCheckUtils]: 134: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:05,996 INFO L273 TraceCheckUtils]: 135: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:05,996 INFO L273 TraceCheckUtils]: 136: Hoare triple {27833#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:05,996 INFO L273 TraceCheckUtils]: 137: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:05,996 INFO L273 TraceCheckUtils]: 138: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:05,996 INFO L273 TraceCheckUtils]: 139: Hoare triple {27833#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:05,996 INFO L273 TraceCheckUtils]: 140: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:05,997 INFO L273 TraceCheckUtils]: 141: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:05,997 INFO L273 TraceCheckUtils]: 142: Hoare triple {27833#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:05,997 INFO L273 TraceCheckUtils]: 143: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:05,997 INFO L273 TraceCheckUtils]: 144: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:05,997 INFO L273 TraceCheckUtils]: 145: Hoare triple {27833#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:05,997 INFO L273 TraceCheckUtils]: 146: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:05,997 INFO L273 TraceCheckUtils]: 147: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:05,997 INFO L273 TraceCheckUtils]: 148: Hoare triple {27833#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:05,997 INFO L273 TraceCheckUtils]: 149: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:05,997 INFO L273 TraceCheckUtils]: 150: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:05,998 INFO L273 TraceCheckUtils]: 151: Hoare triple {27833#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:05,998 INFO L273 TraceCheckUtils]: 152: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:05,998 INFO L273 TraceCheckUtils]: 153: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:05,998 INFO L273 TraceCheckUtils]: 154: Hoare triple {27833#true} assume !(~i~0 < 100); {27833#true} is VALID [2018-11-14 17:08:05,998 INFO L273 TraceCheckUtils]: 155: Hoare triple {27833#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27833#true} is VALID [2018-11-14 17:08:05,998 INFO L273 TraceCheckUtils]: 156: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:05,998 INFO L268 TraceCheckUtils]: 157: Hoare quadruple {27833#true} {27834#false} #75#return; {27834#false} is VALID [2018-11-14 17:08:05,998 INFO L273 TraceCheckUtils]: 158: Hoare triple {27834#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {27834#false} is VALID [2018-11-14 17:08:05,998 INFO L273 TraceCheckUtils]: 159: Hoare triple {27834#false} assume true; {27834#false} is VALID [2018-11-14 17:08:05,998 INFO L273 TraceCheckUtils]: 160: Hoare triple {27834#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {27834#false} is VALID [2018-11-14 17:08:05,999 INFO L273 TraceCheckUtils]: 161: Hoare triple {27834#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {27834#false} is VALID [2018-11-14 17:08:05,999 INFO L273 TraceCheckUtils]: 162: Hoare triple {27834#false} assume true; {27834#false} is VALID [2018-11-14 17:08:05,999 INFO L273 TraceCheckUtils]: 163: Hoare triple {27834#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {27834#false} is VALID [2018-11-14 17:08:05,999 INFO L273 TraceCheckUtils]: 164: Hoare triple {27834#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {27834#false} is VALID [2018-11-14 17:08:05,999 INFO L273 TraceCheckUtils]: 165: Hoare triple {27834#false} assume true; {27834#false} is VALID [2018-11-14 17:08:05,999 INFO L273 TraceCheckUtils]: 166: Hoare triple {27834#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {27834#false} is VALID [2018-11-14 17:08:05,999 INFO L273 TraceCheckUtils]: 167: Hoare triple {27834#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {27834#false} is VALID [2018-11-14 17:08:05,999 INFO L273 TraceCheckUtils]: 168: Hoare triple {27834#false} assume true; {27834#false} is VALID [2018-11-14 17:08:05,999 INFO L273 TraceCheckUtils]: 169: Hoare triple {27834#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {27834#false} is VALID [2018-11-14 17:08:06,000 INFO L273 TraceCheckUtils]: 170: Hoare triple {27834#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {27834#false} is VALID [2018-11-14 17:08:06,000 INFO L273 TraceCheckUtils]: 171: Hoare triple {27834#false} assume true; {27834#false} is VALID [2018-11-14 17:08:06,000 INFO L273 TraceCheckUtils]: 172: Hoare triple {27834#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {27834#false} is VALID [2018-11-14 17:08:06,000 INFO L273 TraceCheckUtils]: 173: Hoare triple {27834#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {27834#false} is VALID [2018-11-14 17:08:06,000 INFO L273 TraceCheckUtils]: 174: Hoare triple {27834#false} assume true; {27834#false} is VALID [2018-11-14 17:08:06,000 INFO L273 TraceCheckUtils]: 175: Hoare triple {27834#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {27834#false} is VALID [2018-11-14 17:08:06,000 INFO L273 TraceCheckUtils]: 176: Hoare triple {27834#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {27834#false} is VALID [2018-11-14 17:08:06,000 INFO L273 TraceCheckUtils]: 177: Hoare triple {27834#false} assume true; {27834#false} is VALID [2018-11-14 17:08:06,000 INFO L273 TraceCheckUtils]: 178: Hoare triple {27834#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {27834#false} is VALID [2018-11-14 17:08:06,000 INFO L273 TraceCheckUtils]: 179: Hoare triple {27834#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {27834#false} is VALID [2018-11-14 17:08:06,001 INFO L273 TraceCheckUtils]: 180: Hoare triple {27834#false} assume true; {27834#false} is VALID [2018-11-14 17:08:06,001 INFO L273 TraceCheckUtils]: 181: Hoare triple {27834#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {27834#false} is VALID [2018-11-14 17:08:06,001 INFO L273 TraceCheckUtils]: 182: Hoare triple {27834#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {27834#false} is VALID [2018-11-14 17:08:06,001 INFO L273 TraceCheckUtils]: 183: Hoare triple {27834#false} assume true; {27834#false} is VALID [2018-11-14 17:08:06,001 INFO L273 TraceCheckUtils]: 184: Hoare triple {27834#false} assume !(~i~2 < 99); {27834#false} is VALID [2018-11-14 17:08:06,001 INFO L273 TraceCheckUtils]: 185: Hoare triple {27834#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 396, 4); {27834#false} is VALID [2018-11-14 17:08:06,001 INFO L256 TraceCheckUtils]: 186: Hoare triple {27834#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {27833#true} is VALID [2018-11-14 17:08:06,001 INFO L273 TraceCheckUtils]: 187: Hoare triple {27833#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {27833#true} is VALID [2018-11-14 17:08:06,001 INFO L273 TraceCheckUtils]: 188: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:06,001 INFO L273 TraceCheckUtils]: 189: Hoare triple {27833#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:06,002 INFO L273 TraceCheckUtils]: 190: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:06,002 INFO L273 TraceCheckUtils]: 191: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:06,002 INFO L273 TraceCheckUtils]: 192: Hoare triple {27833#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:06,002 INFO L273 TraceCheckUtils]: 193: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:06,002 INFO L273 TraceCheckUtils]: 194: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:06,002 INFO L273 TraceCheckUtils]: 195: Hoare triple {27833#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:06,002 INFO L273 TraceCheckUtils]: 196: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:06,002 INFO L273 TraceCheckUtils]: 197: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:06,002 INFO L273 TraceCheckUtils]: 198: Hoare triple {27833#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:06,002 INFO L273 TraceCheckUtils]: 199: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:06,003 INFO L273 TraceCheckUtils]: 200: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:06,003 INFO L273 TraceCheckUtils]: 201: Hoare triple {27833#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:06,003 INFO L273 TraceCheckUtils]: 202: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:06,003 INFO L273 TraceCheckUtils]: 203: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:06,003 INFO L273 TraceCheckUtils]: 204: Hoare triple {27833#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:06,003 INFO L273 TraceCheckUtils]: 205: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:06,003 INFO L273 TraceCheckUtils]: 206: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:06,003 INFO L273 TraceCheckUtils]: 207: Hoare triple {27833#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:06,003 INFO L273 TraceCheckUtils]: 208: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:06,003 INFO L273 TraceCheckUtils]: 209: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:06,004 INFO L273 TraceCheckUtils]: 210: Hoare triple {27833#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 17:08:06,004 INFO L273 TraceCheckUtils]: 211: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 17:08:06,004 INFO L273 TraceCheckUtils]: 212: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:06,004 INFO L273 TraceCheckUtils]: 213: Hoare triple {27833#true} assume !(~i~0 < 100); {27833#true} is VALID [2018-11-14 17:08:06,004 INFO L273 TraceCheckUtils]: 214: Hoare triple {27833#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27833#true} is VALID [2018-11-14 17:08:06,004 INFO L273 TraceCheckUtils]: 215: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 17:08:06,004 INFO L268 TraceCheckUtils]: 216: Hoare quadruple {27833#true} {27834#false} #77#return; {27834#false} is VALID [2018-11-14 17:08:06,004 INFO L273 TraceCheckUtils]: 217: Hoare triple {27834#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {27834#false} is VALID [2018-11-14 17:08:06,004 INFO L273 TraceCheckUtils]: 218: Hoare triple {27834#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {27834#false} is VALID [2018-11-14 17:08:06,005 INFO L273 TraceCheckUtils]: 219: Hoare triple {27834#false} assume !false; {27834#false} is VALID [2018-11-14 17:08:06,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2366 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2018-11-14 17:08:06,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:06,027 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:08:06,038 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1