java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/reducercommutativity/sep60_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:16:43,592 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:16:43,594 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:16:43,607 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:16:43,607 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:16:43,610 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:16:43,611 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:16:43,614 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:16:43,624 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:16:43,625 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:16:43,626 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:16:43,626 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:16:43,628 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:16:43,629 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:16:43,632 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:16:43,633 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:16:43,634 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:16:43,638 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:16:43,640 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:16:43,646 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:16:43,648 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:16:43,649 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:16:43,653 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:16:43,653 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:16:43,653 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:16:43,655 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:16:43,656 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:16:43,656 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:16:43,659 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:16:43,661 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:16:43,661 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:16:43,662 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:16:43,662 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:16:43,662 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:16:43,664 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:16:43,665 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:16:43,665 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:16:43,696 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:16:43,696 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:16:43,697 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:16:43,697 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:16:43,697 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:16:43,698 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:16:43,701 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:16:43,701 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:16:43,701 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:16:43,701 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:16:43,701 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:16:43,702 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:16:43,702 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:16:43,702 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:16:43,702 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:16:43,702 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:16:43,704 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:16:43,704 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:16:43,707 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:16:43,707 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:16:43,707 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:16:43,707 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:16:43,707 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:16:43,708 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:16:43,708 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:16:43,708 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:16:43,708 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:16:43,708 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:16:43,709 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:16:43,709 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:16:43,709 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:16:43,752 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:16:43,765 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:16:43,769 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:16:43,770 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:16:43,771 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:16:43,772 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sep60_true-unreach-call.i [2018-11-23 12:16:43,837 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f311f79a9/f7fe3fd242cc40028418e6eacf28103e/FLAGbc981b004 [2018-11-23 12:16:44,297 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:16:44,298 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sep60_true-unreach-call.i [2018-11-23 12:16:44,308 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f311f79a9/f7fe3fd242cc40028418e6eacf28103e/FLAGbc981b004 [2018-11-23 12:16:44,642 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f311f79a9/f7fe3fd242cc40028418e6eacf28103e [2018-11-23 12:16:44,652 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:16:44,654 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:16:44,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:16:44,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:16:44,659 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:16:44,661 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:16:44" (1/1) ... [2018-11-23 12:16:44,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34146027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:44, skipping insertion in model container [2018-11-23 12:16:44,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:16:44" (1/1) ... [2018-11-23 12:16:44,675 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:16:44,698 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:16:44,927 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:16:44,938 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:16:44,967 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:16:44,985 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:16:44,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:44 WrapperNode [2018-11-23 12:16:44,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:16:44,987 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:16:44,987 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:16:44,987 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:16:44,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:44" (1/1) ... [2018-11-23 12:16:45,008 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:44" (1/1) ... [2018-11-23 12:16:45,017 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:16:45,017 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:16:45,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:16:45,018 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:16:45,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:44" (1/1) ... [2018-11-23 12:16:45,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:44" (1/1) ... [2018-11-23 12:16:45,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:44" (1/1) ... [2018-11-23 12:16:45,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:44" (1/1) ... [2018-11-23 12:16:45,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:44" (1/1) ... [2018-11-23 12:16:45,052 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:44" (1/1) ... [2018-11-23 12:16:45,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:44" (1/1) ... [2018-11-23 12:16:45,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:16:45,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:16:45,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:16:45,059 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:16:45,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:16:45,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:16:45,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:16:45,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:16:45,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:16:45,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:16:45,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:16:45,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:16:45,197 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:16:45,197 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:16:45,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:16:45,197 INFO L130 BoogieDeclarations]: Found specification of procedure sep [2018-11-23 12:16:45,197 INFO L138 BoogieDeclarations]: Found implementation of procedure sep [2018-11-23 12:16:45,917 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:16:45,917 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:16:45,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:16:45 BoogieIcfgContainer [2018-11-23 12:16:45,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:16:45,919 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:16:45,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:16:45,923 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:16:45,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:16:44" (1/3) ... [2018-11-23 12:16:45,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b6bb01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:16:45, skipping insertion in model container [2018-11-23 12:16:45,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:44" (2/3) ... [2018-11-23 12:16:45,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b6bb01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:16:45, skipping insertion in model container [2018-11-23 12:16:45,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:16:45" (3/3) ... [2018-11-23 12:16:45,927 INFO L112 eAbstractionObserver]: Analyzing ICFG sep60_true-unreach-call.i [2018-11-23 12:16:45,937 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:16:45,945 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:16:45,962 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:16:45,996 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:16:45,997 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:16:45,997 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:16:45,997 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:16:45,997 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:16:45,997 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:16:45,998 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:16:45,998 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:16:45,998 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:16:46,016 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-23 12:16:46,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:16:46,024 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:46,025 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:46,028 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:46,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:46,035 INFO L82 PathProgramCache]: Analyzing trace with hash 794343521, now seen corresponding path program 1 times [2018-11-23 12:16:46,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:46,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:46,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:46,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:46,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:46,285 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-23 12:16:46,290 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35#true} is VALID [2018-11-23 12:16:46,291 INFO L273 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 12:16:46,292 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2018-11-23 12:16:46,292 INFO L256 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret14 := main(); {35#true} is VALID [2018-11-23 12:16:46,293 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {35#true} is VALID [2018-11-23 12:16:46,306 INFO L273 TraceCheckUtils]: 6: Hoare triple {35#true} assume !true; {36#false} is VALID [2018-11-23 12:16:46,306 INFO L256 TraceCheckUtils]: 7: Hoare triple {36#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {35#true} is VALID [2018-11-23 12:16:46,307 INFO L273 TraceCheckUtils]: 8: Hoare triple {35#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {35#true} is VALID [2018-11-23 12:16:46,307 INFO L273 TraceCheckUtils]: 9: Hoare triple {35#true} assume !true; {35#true} is VALID [2018-11-23 12:16:46,307 INFO L273 TraceCheckUtils]: 10: Hoare triple {35#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {35#true} is VALID [2018-11-23 12:16:46,308 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 12:16:46,308 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {35#true} {36#false} #75#return; {36#false} is VALID [2018-11-23 12:16:46,308 INFO L273 TraceCheckUtils]: 13: Hoare triple {36#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {36#false} is VALID [2018-11-23 12:16:46,309 INFO L256 TraceCheckUtils]: 14: Hoare triple {36#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {35#true} is VALID [2018-11-23 12:16:46,309 INFO L273 TraceCheckUtils]: 15: Hoare triple {35#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {35#true} is VALID [2018-11-23 12:16:46,310 INFO L273 TraceCheckUtils]: 16: Hoare triple {35#true} assume !true; {35#true} is VALID [2018-11-23 12:16:46,310 INFO L273 TraceCheckUtils]: 17: Hoare triple {35#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {35#true} is VALID [2018-11-23 12:16:46,310 INFO L273 TraceCheckUtils]: 18: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 12:16:46,311 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {35#true} {36#false} #77#return; {36#false} is VALID [2018-11-23 12:16:46,311 INFO L273 TraceCheckUtils]: 20: Hoare triple {36#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {36#false} is VALID [2018-11-23 12:16:46,311 INFO L273 TraceCheckUtils]: 21: Hoare triple {36#false} assume !true; {36#false} is VALID [2018-11-23 12:16:46,312 INFO L273 TraceCheckUtils]: 22: Hoare triple {36#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {36#false} is VALID [2018-11-23 12:16:46,312 INFO L256 TraceCheckUtils]: 23: Hoare triple {36#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {35#true} is VALID [2018-11-23 12:16:46,312 INFO L273 TraceCheckUtils]: 24: Hoare triple {35#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {35#true} is VALID [2018-11-23 12:16:46,313 INFO L273 TraceCheckUtils]: 25: Hoare triple {35#true} assume !true; {35#true} is VALID [2018-11-23 12:16:46,313 INFO L273 TraceCheckUtils]: 26: Hoare triple {35#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {35#true} is VALID [2018-11-23 12:16:46,313 INFO L273 TraceCheckUtils]: 27: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 12:16:46,314 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {35#true} {36#false} #79#return; {36#false} is VALID [2018-11-23 12:16:46,314 INFO L273 TraceCheckUtils]: 29: Hoare triple {36#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {36#false} is VALID [2018-11-23 12:16:46,315 INFO L273 TraceCheckUtils]: 30: Hoare triple {36#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {36#false} is VALID [2018-11-23 12:16:46,315 INFO L273 TraceCheckUtils]: 31: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-23 12:16:46,322 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:16:46,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:16:46,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:16:46,331 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:16:46,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:46,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:16:46,561 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:46,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:16:46,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:16:46,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:16:46,576 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-11-23 12:16:46,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:46,710 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2018-11-23 12:16:46,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:16:46,711 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:16:46,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:46,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:16:46,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2018-11-23 12:16:46,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:16:46,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2018-11-23 12:16:46,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 75 transitions. [2018-11-23 12:16:47,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:47,066 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:16:47,067 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:16:47,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:16:47,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:16:47,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 12:16:47,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:47,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 12:16:47,133 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:16:47,133 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:16:47,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:47,140 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-23 12:16:47,140 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2018-11-23 12:16:47,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:47,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:47,142 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:16:47,142 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:16:47,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:47,147 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-23 12:16:47,147 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2018-11-23 12:16:47,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:47,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:47,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:47,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:47,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:16:47,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-11-23 12:16:47,155 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 32 [2018-11-23 12:16:47,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:47,155 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-23 12:16:47,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:16:47,156 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2018-11-23 12:16:47,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:16:47,157 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:47,158 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:47,158 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:47,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:47,159 INFO L82 PathProgramCache]: Analyzing trace with hash 2140793590, now seen corresponding path program 1 times [2018-11-23 12:16:47,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:47,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:47,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:47,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:47,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:47,330 INFO L256 TraceCheckUtils]: 0: Hoare triple {204#true} call ULTIMATE.init(); {204#true} is VALID [2018-11-23 12:16:47,331 INFO L273 TraceCheckUtils]: 1: Hoare triple {204#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {204#true} is VALID [2018-11-23 12:16:47,331 INFO L273 TraceCheckUtils]: 2: Hoare triple {204#true} assume true; {204#true} is VALID [2018-11-23 12:16:47,331 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {204#true} {204#true} #71#return; {204#true} is VALID [2018-11-23 12:16:47,332 INFO L256 TraceCheckUtils]: 4: Hoare triple {204#true} call #t~ret14 := main(); {204#true} is VALID [2018-11-23 12:16:47,334 INFO L273 TraceCheckUtils]: 5: Hoare triple {204#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {206#(= main_~i~1 0)} is VALID [2018-11-23 12:16:47,334 INFO L273 TraceCheckUtils]: 6: Hoare triple {206#(= main_~i~1 0)} assume !(~i~1 < 60); {205#false} is VALID [2018-11-23 12:16:47,335 INFO L256 TraceCheckUtils]: 7: Hoare triple {205#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {204#true} is VALID [2018-11-23 12:16:47,335 INFO L273 TraceCheckUtils]: 8: Hoare triple {204#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {204#true} is VALID [2018-11-23 12:16:47,335 INFO L273 TraceCheckUtils]: 9: Hoare triple {204#true} assume !(~i~0 < 60); {204#true} is VALID [2018-11-23 12:16:47,336 INFO L273 TraceCheckUtils]: 10: Hoare triple {204#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {204#true} is VALID [2018-11-23 12:16:47,336 INFO L273 TraceCheckUtils]: 11: Hoare triple {204#true} assume true; {204#true} is VALID [2018-11-23 12:16:47,336 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {204#true} {205#false} #75#return; {205#false} is VALID [2018-11-23 12:16:47,336 INFO L273 TraceCheckUtils]: 13: Hoare triple {205#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {205#false} is VALID [2018-11-23 12:16:47,337 INFO L256 TraceCheckUtils]: 14: Hoare triple {205#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {204#true} is VALID [2018-11-23 12:16:47,337 INFO L273 TraceCheckUtils]: 15: Hoare triple {204#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {204#true} is VALID [2018-11-23 12:16:47,337 INFO L273 TraceCheckUtils]: 16: Hoare triple {204#true} assume !(~i~0 < 60); {204#true} is VALID [2018-11-23 12:16:47,338 INFO L273 TraceCheckUtils]: 17: Hoare triple {204#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {204#true} is VALID [2018-11-23 12:16:47,338 INFO L273 TraceCheckUtils]: 18: Hoare triple {204#true} assume true; {204#true} is VALID [2018-11-23 12:16:47,338 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {204#true} {205#false} #77#return; {205#false} is VALID [2018-11-23 12:16:47,339 INFO L273 TraceCheckUtils]: 20: Hoare triple {205#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {205#false} is VALID [2018-11-23 12:16:47,339 INFO L273 TraceCheckUtils]: 21: Hoare triple {205#false} assume !(~i~2 < 59); {205#false} is VALID [2018-11-23 12:16:47,339 INFO L273 TraceCheckUtils]: 22: Hoare triple {205#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {205#false} is VALID [2018-11-23 12:16:47,340 INFO L256 TraceCheckUtils]: 23: Hoare triple {205#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {204#true} is VALID [2018-11-23 12:16:47,340 INFO L273 TraceCheckUtils]: 24: Hoare triple {204#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {204#true} is VALID [2018-11-23 12:16:47,340 INFO L273 TraceCheckUtils]: 25: Hoare triple {204#true} assume !(~i~0 < 60); {204#true} is VALID [2018-11-23 12:16:47,341 INFO L273 TraceCheckUtils]: 26: Hoare triple {204#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {204#true} is VALID [2018-11-23 12:16:47,341 INFO L273 TraceCheckUtils]: 27: Hoare triple {204#true} assume true; {204#true} is VALID [2018-11-23 12:16:47,341 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {204#true} {205#false} #79#return; {205#false} is VALID [2018-11-23 12:16:47,342 INFO L273 TraceCheckUtils]: 29: Hoare triple {205#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {205#false} is VALID [2018-11-23 12:16:47,342 INFO L273 TraceCheckUtils]: 30: Hoare triple {205#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {205#false} is VALID [2018-11-23 12:16:47,342 INFO L273 TraceCheckUtils]: 31: Hoare triple {205#false} assume !false; {205#false} is VALID [2018-11-23 12:16:47,345 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:16:47,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:16:47,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:16:47,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:16:47,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:47,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:16:47,428 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:47,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:16:47,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:16:47,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:16:47,430 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 3 states. [2018-11-23 12:16:47,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:47,914 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-11-23 12:16:47,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:16:47,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:16:47,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:47,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:16:47,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-23 12:16:47,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:16:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-23 12:16:47,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2018-11-23 12:16:48,189 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:48,192 INFO L225 Difference]: With dead ends: 48 [2018-11-23 12:16:48,193 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:16:48,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:16:48,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:16:48,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 12:16:48,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:48,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 12:16:48,209 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 12:16:48,209 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 12:16:48,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:48,213 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 12:16:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:16:48,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:48,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:48,214 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 12:16:48,214 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 12:16:48,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:48,218 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 12:16:48,218 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:16:48,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:48,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:48,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:48,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:48,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:16:48,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-23 12:16:48,222 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 32 [2018-11-23 12:16:48,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:48,222 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 12:16:48,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:16:48,223 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 12:16:48,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:16:48,224 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:48,224 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:48,225 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:48,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:48,225 INFO L82 PathProgramCache]: Analyzing trace with hash 2099349144, now seen corresponding path program 1 times [2018-11-23 12:16:48,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:48,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:48,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:48,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:48,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:48,306 INFO L256 TraceCheckUtils]: 0: Hoare triple {373#true} call ULTIMATE.init(); {373#true} is VALID [2018-11-23 12:16:48,307 INFO L273 TraceCheckUtils]: 1: Hoare triple {373#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {373#true} is VALID [2018-11-23 12:16:48,307 INFO L273 TraceCheckUtils]: 2: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-23 12:16:48,307 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {373#true} {373#true} #71#return; {373#true} is VALID [2018-11-23 12:16:48,308 INFO L256 TraceCheckUtils]: 4: Hoare triple {373#true} call #t~ret14 := main(); {373#true} is VALID [2018-11-23 12:16:48,308 INFO L273 TraceCheckUtils]: 5: Hoare triple {373#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {373#true} is VALID [2018-11-23 12:16:48,308 INFO L273 TraceCheckUtils]: 6: Hoare triple {373#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {373#true} is VALID [2018-11-23 12:16:48,308 INFO L273 TraceCheckUtils]: 7: Hoare triple {373#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {373#true} is VALID [2018-11-23 12:16:48,309 INFO L273 TraceCheckUtils]: 8: Hoare triple {373#true} assume !(~i~1 < 60); {373#true} is VALID [2018-11-23 12:16:48,309 INFO L256 TraceCheckUtils]: 9: Hoare triple {373#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {373#true} is VALID [2018-11-23 12:16:48,310 INFO L273 TraceCheckUtils]: 10: Hoare triple {373#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {375#(= sep_~i~0 0)} is VALID [2018-11-23 12:16:48,313 INFO L273 TraceCheckUtils]: 11: Hoare triple {375#(= sep_~i~0 0)} assume !(~i~0 < 60); {374#false} is VALID [2018-11-23 12:16:48,313 INFO L273 TraceCheckUtils]: 12: Hoare triple {374#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {374#false} is VALID [2018-11-23 12:16:48,313 INFO L273 TraceCheckUtils]: 13: Hoare triple {374#false} assume true; {374#false} is VALID [2018-11-23 12:16:48,313 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {374#false} {373#true} #75#return; {374#false} is VALID [2018-11-23 12:16:48,314 INFO L273 TraceCheckUtils]: 15: Hoare triple {374#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {374#false} is VALID [2018-11-23 12:16:48,314 INFO L256 TraceCheckUtils]: 16: Hoare triple {374#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {373#true} is VALID [2018-11-23 12:16:48,314 INFO L273 TraceCheckUtils]: 17: Hoare triple {373#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {373#true} is VALID [2018-11-23 12:16:48,314 INFO L273 TraceCheckUtils]: 18: Hoare triple {373#true} assume !(~i~0 < 60); {373#true} is VALID [2018-11-23 12:16:48,315 INFO L273 TraceCheckUtils]: 19: Hoare triple {373#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {373#true} is VALID [2018-11-23 12:16:48,315 INFO L273 TraceCheckUtils]: 20: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-23 12:16:48,315 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {373#true} {374#false} #77#return; {374#false} is VALID [2018-11-23 12:16:48,316 INFO L273 TraceCheckUtils]: 22: Hoare triple {374#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {374#false} is VALID [2018-11-23 12:16:48,316 INFO L273 TraceCheckUtils]: 23: Hoare triple {374#false} assume !(~i~2 < 59); {374#false} is VALID [2018-11-23 12:16:48,316 INFO L273 TraceCheckUtils]: 24: Hoare triple {374#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {374#false} is VALID [2018-11-23 12:16:48,317 INFO L256 TraceCheckUtils]: 25: Hoare triple {374#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {373#true} is VALID [2018-11-23 12:16:48,317 INFO L273 TraceCheckUtils]: 26: Hoare triple {373#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {373#true} is VALID [2018-11-23 12:16:48,317 INFO L273 TraceCheckUtils]: 27: Hoare triple {373#true} assume !(~i~0 < 60); {373#true} is VALID [2018-11-23 12:16:48,318 INFO L273 TraceCheckUtils]: 28: Hoare triple {373#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {373#true} is VALID [2018-11-23 12:16:48,318 INFO L273 TraceCheckUtils]: 29: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-23 12:16:48,318 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {373#true} {374#false} #79#return; {374#false} is VALID [2018-11-23 12:16:48,319 INFO L273 TraceCheckUtils]: 31: Hoare triple {374#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {374#false} is VALID [2018-11-23 12:16:48,319 INFO L273 TraceCheckUtils]: 32: Hoare triple {374#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {374#false} is VALID [2018-11-23 12:16:48,319 INFO L273 TraceCheckUtils]: 33: Hoare triple {374#false} assume !false; {374#false} is VALID [2018-11-23 12:16:48,321 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 12:16:48,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:48,322 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:16:48,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:48,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:48,560 INFO L256 TraceCheckUtils]: 0: Hoare triple {373#true} call ULTIMATE.init(); {373#true} is VALID [2018-11-23 12:16:48,561 INFO L273 TraceCheckUtils]: 1: Hoare triple {373#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {373#true} is VALID [2018-11-23 12:16:48,561 INFO L273 TraceCheckUtils]: 2: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-23 12:16:48,561 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {373#true} {373#true} #71#return; {373#true} is VALID [2018-11-23 12:16:48,562 INFO L256 TraceCheckUtils]: 4: Hoare triple {373#true} call #t~ret14 := main(); {373#true} is VALID [2018-11-23 12:16:48,562 INFO L273 TraceCheckUtils]: 5: Hoare triple {373#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {373#true} is VALID [2018-11-23 12:16:48,562 INFO L273 TraceCheckUtils]: 6: Hoare triple {373#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {373#true} is VALID [2018-11-23 12:16:48,563 INFO L273 TraceCheckUtils]: 7: Hoare triple {373#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {373#true} is VALID [2018-11-23 12:16:48,563 INFO L273 TraceCheckUtils]: 8: Hoare triple {373#true} assume !(~i~1 < 60); {373#true} is VALID [2018-11-23 12:16:48,563 INFO L256 TraceCheckUtils]: 9: Hoare triple {373#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {373#true} is VALID [2018-11-23 12:16:48,567 INFO L273 TraceCheckUtils]: 10: Hoare triple {373#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {409#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:48,568 INFO L273 TraceCheckUtils]: 11: Hoare triple {409#(<= sep_~i~0 0)} assume !(~i~0 < 60); {374#false} is VALID [2018-11-23 12:16:48,569 INFO L273 TraceCheckUtils]: 12: Hoare triple {374#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {374#false} is VALID [2018-11-23 12:16:48,569 INFO L273 TraceCheckUtils]: 13: Hoare triple {374#false} assume true; {374#false} is VALID [2018-11-23 12:16:48,569 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {374#false} {373#true} #75#return; {374#false} is VALID [2018-11-23 12:16:48,569 INFO L273 TraceCheckUtils]: 15: Hoare triple {374#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {374#false} is VALID [2018-11-23 12:16:48,570 INFO L256 TraceCheckUtils]: 16: Hoare triple {374#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {374#false} is VALID [2018-11-23 12:16:48,570 INFO L273 TraceCheckUtils]: 17: Hoare triple {374#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {374#false} is VALID [2018-11-23 12:16:48,570 INFO L273 TraceCheckUtils]: 18: Hoare triple {374#false} assume !(~i~0 < 60); {374#false} is VALID [2018-11-23 12:16:48,570 INFO L273 TraceCheckUtils]: 19: Hoare triple {374#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {374#false} is VALID [2018-11-23 12:16:48,571 INFO L273 TraceCheckUtils]: 20: Hoare triple {374#false} assume true; {374#false} is VALID [2018-11-23 12:16:48,571 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {374#false} {374#false} #77#return; {374#false} is VALID [2018-11-23 12:16:48,571 INFO L273 TraceCheckUtils]: 22: Hoare triple {374#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {374#false} is VALID [2018-11-23 12:16:48,571 INFO L273 TraceCheckUtils]: 23: Hoare triple {374#false} assume !(~i~2 < 59); {374#false} is VALID [2018-11-23 12:16:48,572 INFO L273 TraceCheckUtils]: 24: Hoare triple {374#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {374#false} is VALID [2018-11-23 12:16:48,572 INFO L256 TraceCheckUtils]: 25: Hoare triple {374#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {374#false} is VALID [2018-11-23 12:16:48,572 INFO L273 TraceCheckUtils]: 26: Hoare triple {374#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {374#false} is VALID [2018-11-23 12:16:48,573 INFO L273 TraceCheckUtils]: 27: Hoare triple {374#false} assume !(~i~0 < 60); {374#false} is VALID [2018-11-23 12:16:48,573 INFO L273 TraceCheckUtils]: 28: Hoare triple {374#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {374#false} is VALID [2018-11-23 12:16:48,573 INFO L273 TraceCheckUtils]: 29: Hoare triple {374#false} assume true; {374#false} is VALID [2018-11-23 12:16:48,574 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {374#false} {374#false} #79#return; {374#false} is VALID [2018-11-23 12:16:48,574 INFO L273 TraceCheckUtils]: 31: Hoare triple {374#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {374#false} is VALID [2018-11-23 12:16:48,574 INFO L273 TraceCheckUtils]: 32: Hoare triple {374#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {374#false} is VALID [2018-11-23 12:16:48,574 INFO L273 TraceCheckUtils]: 33: Hoare triple {374#false} assume !false; {374#false} is VALID [2018-11-23 12:16:48,577 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:16:48,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:16:48,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-23 12:16:48,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:16:48,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:48,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:16:48,753 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:48,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:16:48,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:16:48,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:16:48,754 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 4 states. [2018-11-23 12:16:48,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:48,962 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2018-11-23 12:16:48,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:16:48,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:16:48,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:48,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:16:48,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-23 12:16:48,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:16:48,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-23 12:16:48,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2018-11-23 12:16:49,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:49,120 INFO L225 Difference]: With dead ends: 49 [2018-11-23 12:16:49,120 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:16:49,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:16:49,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:16:49,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-23 12:16:49,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:49,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 29 states. [2018-11-23 12:16:49,136 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 29 states. [2018-11-23 12:16:49,136 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 29 states. [2018-11-23 12:16:49,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:49,140 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2018-11-23 12:16:49,140 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2018-11-23 12:16:49,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:49,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:49,142 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 31 states. [2018-11-23 12:16:49,142 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 31 states. [2018-11-23 12:16:49,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:49,145 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2018-11-23 12:16:49,145 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2018-11-23 12:16:49,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:49,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:49,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:49,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:49,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:16:49,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-11-23 12:16:49,149 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 34 [2018-11-23 12:16:49,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:49,149 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-11-23 12:16:49,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:16:49,150 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:16:49,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 12:16:49,151 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:49,151 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:49,152 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:49,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:49,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1279819331, now seen corresponding path program 1 times [2018-11-23 12:16:49,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:49,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:49,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:49,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:49,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:49,265 INFO L256 TraceCheckUtils]: 0: Hoare triple {649#true} call ULTIMATE.init(); {649#true} is VALID [2018-11-23 12:16:49,265 INFO L273 TraceCheckUtils]: 1: Hoare triple {649#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {649#true} is VALID [2018-11-23 12:16:49,266 INFO L273 TraceCheckUtils]: 2: Hoare triple {649#true} assume true; {649#true} is VALID [2018-11-23 12:16:49,266 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {649#true} {649#true} #71#return; {649#true} is VALID [2018-11-23 12:16:49,266 INFO L256 TraceCheckUtils]: 4: Hoare triple {649#true} call #t~ret14 := main(); {649#true} is VALID [2018-11-23 12:16:49,266 INFO L273 TraceCheckUtils]: 5: Hoare triple {649#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {649#true} is VALID [2018-11-23 12:16:49,267 INFO L273 TraceCheckUtils]: 6: Hoare triple {649#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {649#true} is VALID [2018-11-23 12:16:49,267 INFO L273 TraceCheckUtils]: 7: Hoare triple {649#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {649#true} is VALID [2018-11-23 12:16:49,267 INFO L273 TraceCheckUtils]: 8: Hoare triple {649#true} assume !(~i~1 < 60); {649#true} is VALID [2018-11-23 12:16:49,267 INFO L256 TraceCheckUtils]: 9: Hoare triple {649#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {649#true} is VALID [2018-11-23 12:16:49,267 INFO L273 TraceCheckUtils]: 10: Hoare triple {649#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {649#true} is VALID [2018-11-23 12:16:49,268 INFO L273 TraceCheckUtils]: 11: Hoare triple {649#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {649#true} is VALID [2018-11-23 12:16:49,268 INFO L273 TraceCheckUtils]: 12: Hoare triple {649#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {649#true} is VALID [2018-11-23 12:16:49,268 INFO L273 TraceCheckUtils]: 13: Hoare triple {649#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {649#true} is VALID [2018-11-23 12:16:49,269 INFO L273 TraceCheckUtils]: 14: Hoare triple {649#true} assume !(~i~0 < 60); {649#true} is VALID [2018-11-23 12:16:49,269 INFO L273 TraceCheckUtils]: 15: Hoare triple {649#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {649#true} is VALID [2018-11-23 12:16:49,269 INFO L273 TraceCheckUtils]: 16: Hoare triple {649#true} assume true; {649#true} is VALID [2018-11-23 12:16:49,270 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {649#true} {649#true} #75#return; {649#true} is VALID [2018-11-23 12:16:49,270 INFO L273 TraceCheckUtils]: 18: Hoare triple {649#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {649#true} is VALID [2018-11-23 12:16:49,270 INFO L256 TraceCheckUtils]: 19: Hoare triple {649#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {649#true} is VALID [2018-11-23 12:16:49,271 INFO L273 TraceCheckUtils]: 20: Hoare triple {649#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {649#true} is VALID [2018-11-23 12:16:49,271 INFO L273 TraceCheckUtils]: 21: Hoare triple {649#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {649#true} is VALID [2018-11-23 12:16:49,271 INFO L273 TraceCheckUtils]: 22: Hoare triple {649#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {649#true} is VALID [2018-11-23 12:16:49,271 INFO L273 TraceCheckUtils]: 23: Hoare triple {649#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {649#true} is VALID [2018-11-23 12:16:49,272 INFO L273 TraceCheckUtils]: 24: Hoare triple {649#true} assume !(~i~0 < 60); {649#true} is VALID [2018-11-23 12:16:49,272 INFO L273 TraceCheckUtils]: 25: Hoare triple {649#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {649#true} is VALID [2018-11-23 12:16:49,272 INFO L273 TraceCheckUtils]: 26: Hoare triple {649#true} assume true; {649#true} is VALID [2018-11-23 12:16:49,273 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {649#true} {649#true} #77#return; {649#true} is VALID [2018-11-23 12:16:49,279 INFO L273 TraceCheckUtils]: 28: Hoare triple {649#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {651#(= main_~i~2 0)} is VALID [2018-11-23 12:16:49,280 INFO L273 TraceCheckUtils]: 29: Hoare triple {651#(= main_~i~2 0)} assume !(~i~2 < 59); {650#false} is VALID [2018-11-23 12:16:49,280 INFO L273 TraceCheckUtils]: 30: Hoare triple {650#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {650#false} is VALID [2018-11-23 12:16:49,280 INFO L256 TraceCheckUtils]: 31: Hoare triple {650#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {649#true} is VALID [2018-11-23 12:16:49,280 INFO L273 TraceCheckUtils]: 32: Hoare triple {649#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {649#true} is VALID [2018-11-23 12:16:49,281 INFO L273 TraceCheckUtils]: 33: Hoare triple {649#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {649#true} is VALID [2018-11-23 12:16:49,281 INFO L273 TraceCheckUtils]: 34: Hoare triple {649#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {649#true} is VALID [2018-11-23 12:16:49,281 INFO L273 TraceCheckUtils]: 35: Hoare triple {649#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {649#true} is VALID [2018-11-23 12:16:49,281 INFO L273 TraceCheckUtils]: 36: Hoare triple {649#true} assume !(~i~0 < 60); {649#true} is VALID [2018-11-23 12:16:49,282 INFO L273 TraceCheckUtils]: 37: Hoare triple {649#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {649#true} is VALID [2018-11-23 12:16:49,282 INFO L273 TraceCheckUtils]: 38: Hoare triple {649#true} assume true; {649#true} is VALID [2018-11-23 12:16:49,282 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {649#true} {650#false} #79#return; {650#false} is VALID [2018-11-23 12:16:49,283 INFO L273 TraceCheckUtils]: 40: Hoare triple {650#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {650#false} is VALID [2018-11-23 12:16:49,283 INFO L273 TraceCheckUtils]: 41: Hoare triple {650#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {650#false} is VALID [2018-11-23 12:16:49,283 INFO L273 TraceCheckUtils]: 42: Hoare triple {650#false} assume !false; {650#false} is VALID [2018-11-23 12:16:49,286 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 12:16:49,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:16:49,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:16:49,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-11-23 12:16:49,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:49,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:16:49,372 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:49,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:16:49,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:16:49,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:16:49,374 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 3 states. [2018-11-23 12:16:49,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:49,510 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-23 12:16:49,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:16:49,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-11-23 12:16:49,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:49,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:16:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2018-11-23 12:16:49,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:16:49,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2018-11-23 12:16:49,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 49 transitions. [2018-11-23 12:16:49,613 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:49,615 INFO L225 Difference]: With dead ends: 45 [2018-11-23 12:16:49,615 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:16:49,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:16:49,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:16:49,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-23 12:16:49,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:49,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2018-11-23 12:16:49,630 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2018-11-23 12:16:49,630 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2018-11-23 12:16:49,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:49,633 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 12:16:49,633 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 12:16:49,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:49,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:49,634 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2018-11-23 12:16:49,635 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2018-11-23 12:16:49,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:49,637 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 12:16:49,637 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 12:16:49,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:49,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:49,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:49,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:49,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:16:49,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 12:16:49,641 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 43 [2018-11-23 12:16:49,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:49,641 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 12:16:49,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:16:49,642 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 12:16:49,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 12:16:49,643 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:49,643 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:49,644 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:49,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:49,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1550635457, now seen corresponding path program 1 times [2018-11-23 12:16:49,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:49,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:49,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:49,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:49,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:49,759 INFO L256 TraceCheckUtils]: 0: Hoare triple {823#true} call ULTIMATE.init(); {823#true} is VALID [2018-11-23 12:16:49,760 INFO L273 TraceCheckUtils]: 1: Hoare triple {823#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {823#true} is VALID [2018-11-23 12:16:49,760 INFO L273 TraceCheckUtils]: 2: Hoare triple {823#true} assume true; {823#true} is VALID [2018-11-23 12:16:49,760 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {823#true} {823#true} #71#return; {823#true} is VALID [2018-11-23 12:16:49,761 INFO L256 TraceCheckUtils]: 4: Hoare triple {823#true} call #t~ret14 := main(); {823#true} is VALID [2018-11-23 12:16:49,761 INFO L273 TraceCheckUtils]: 5: Hoare triple {823#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {825#(= main_~i~1 0)} is VALID [2018-11-23 12:16:49,762 INFO L273 TraceCheckUtils]: 6: Hoare triple {825#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {825#(= main_~i~1 0)} is VALID [2018-11-23 12:16:49,763 INFO L273 TraceCheckUtils]: 7: Hoare triple {825#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {826#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:49,763 INFO L273 TraceCheckUtils]: 8: Hoare triple {826#(<= main_~i~1 1)} assume !(~i~1 < 60); {824#false} is VALID [2018-11-23 12:16:49,764 INFO L256 TraceCheckUtils]: 9: Hoare triple {824#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {823#true} is VALID [2018-11-23 12:16:49,764 INFO L273 TraceCheckUtils]: 10: Hoare triple {823#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {823#true} is VALID [2018-11-23 12:16:49,764 INFO L273 TraceCheckUtils]: 11: Hoare triple {823#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {823#true} is VALID [2018-11-23 12:16:49,765 INFO L273 TraceCheckUtils]: 12: Hoare triple {823#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {823#true} is VALID [2018-11-23 12:16:49,765 INFO L273 TraceCheckUtils]: 13: Hoare triple {823#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {823#true} is VALID [2018-11-23 12:16:49,766 INFO L273 TraceCheckUtils]: 14: Hoare triple {823#true} assume !(~i~0 < 60); {823#true} is VALID [2018-11-23 12:16:49,766 INFO L273 TraceCheckUtils]: 15: Hoare triple {823#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {823#true} is VALID [2018-11-23 12:16:49,766 INFO L273 TraceCheckUtils]: 16: Hoare triple {823#true} assume true; {823#true} is VALID [2018-11-23 12:16:49,766 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {823#true} {824#false} #75#return; {824#false} is VALID [2018-11-23 12:16:49,767 INFO L273 TraceCheckUtils]: 18: Hoare triple {824#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {824#false} is VALID [2018-11-23 12:16:49,767 INFO L256 TraceCheckUtils]: 19: Hoare triple {824#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {823#true} is VALID [2018-11-23 12:16:49,767 INFO L273 TraceCheckUtils]: 20: Hoare triple {823#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {823#true} is VALID [2018-11-23 12:16:49,767 INFO L273 TraceCheckUtils]: 21: Hoare triple {823#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {823#true} is VALID [2018-11-23 12:16:49,767 INFO L273 TraceCheckUtils]: 22: Hoare triple {823#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {823#true} is VALID [2018-11-23 12:16:49,768 INFO L273 TraceCheckUtils]: 23: Hoare triple {823#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {823#true} is VALID [2018-11-23 12:16:49,768 INFO L273 TraceCheckUtils]: 24: Hoare triple {823#true} assume !(~i~0 < 60); {823#true} is VALID [2018-11-23 12:16:49,768 INFO L273 TraceCheckUtils]: 25: Hoare triple {823#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {823#true} is VALID [2018-11-23 12:16:49,768 INFO L273 TraceCheckUtils]: 26: Hoare triple {823#true} assume true; {823#true} is VALID [2018-11-23 12:16:49,769 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {823#true} {824#false} #77#return; {824#false} is VALID [2018-11-23 12:16:49,769 INFO L273 TraceCheckUtils]: 28: Hoare triple {824#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {824#false} is VALID [2018-11-23 12:16:49,769 INFO L273 TraceCheckUtils]: 29: Hoare triple {824#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {824#false} is VALID [2018-11-23 12:16:49,770 INFO L273 TraceCheckUtils]: 30: Hoare triple {824#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {824#false} is VALID [2018-11-23 12:16:49,770 INFO L273 TraceCheckUtils]: 31: Hoare triple {824#false} assume !(~i~2 < 59); {824#false} is VALID [2018-11-23 12:16:49,770 INFO L273 TraceCheckUtils]: 32: Hoare triple {824#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {824#false} is VALID [2018-11-23 12:16:49,771 INFO L256 TraceCheckUtils]: 33: Hoare triple {824#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {823#true} is VALID [2018-11-23 12:16:49,771 INFO L273 TraceCheckUtils]: 34: Hoare triple {823#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {823#true} is VALID [2018-11-23 12:16:49,771 INFO L273 TraceCheckUtils]: 35: Hoare triple {823#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {823#true} is VALID [2018-11-23 12:16:49,771 INFO L273 TraceCheckUtils]: 36: Hoare triple {823#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {823#true} is VALID [2018-11-23 12:16:49,772 INFO L273 TraceCheckUtils]: 37: Hoare triple {823#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {823#true} is VALID [2018-11-23 12:16:49,772 INFO L273 TraceCheckUtils]: 38: Hoare triple {823#true} assume !(~i~0 < 60); {823#true} is VALID [2018-11-23 12:16:49,772 INFO L273 TraceCheckUtils]: 39: Hoare triple {823#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {823#true} is VALID [2018-11-23 12:16:49,773 INFO L273 TraceCheckUtils]: 40: Hoare triple {823#true} assume true; {823#true} is VALID [2018-11-23 12:16:49,773 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {823#true} {824#false} #79#return; {824#false} is VALID [2018-11-23 12:16:49,773 INFO L273 TraceCheckUtils]: 42: Hoare triple {824#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {824#false} is VALID [2018-11-23 12:16:49,774 INFO L273 TraceCheckUtils]: 43: Hoare triple {824#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {824#false} is VALID [2018-11-23 12:16:49,774 INFO L273 TraceCheckUtils]: 44: Hoare triple {824#false} assume !false; {824#false} is VALID [2018-11-23 12:16:49,777 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 12:16:49,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:49,777 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:16:49,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:49,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:50,138 INFO L256 TraceCheckUtils]: 0: Hoare triple {823#true} call ULTIMATE.init(); {823#true} is VALID [2018-11-23 12:16:50,139 INFO L273 TraceCheckUtils]: 1: Hoare triple {823#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {823#true} is VALID [2018-11-23 12:16:50,140 INFO L273 TraceCheckUtils]: 2: Hoare triple {823#true} assume true; {823#true} is VALID [2018-11-23 12:16:50,140 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {823#true} {823#true} #71#return; {823#true} is VALID [2018-11-23 12:16:50,140 INFO L256 TraceCheckUtils]: 4: Hoare triple {823#true} call #t~ret14 := main(); {823#true} is VALID [2018-11-23 12:16:50,142 INFO L273 TraceCheckUtils]: 5: Hoare triple {823#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {845#(<= main_~i~1 0)} is VALID [2018-11-23 12:16:50,143 INFO L273 TraceCheckUtils]: 6: Hoare triple {845#(<= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {845#(<= main_~i~1 0)} is VALID [2018-11-23 12:16:50,144 INFO L273 TraceCheckUtils]: 7: Hoare triple {845#(<= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {826#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:50,145 INFO L273 TraceCheckUtils]: 8: Hoare triple {826#(<= main_~i~1 1)} assume !(~i~1 < 60); {824#false} is VALID [2018-11-23 12:16:50,145 INFO L256 TraceCheckUtils]: 9: Hoare triple {824#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {824#false} is VALID [2018-11-23 12:16:50,145 INFO L273 TraceCheckUtils]: 10: Hoare triple {824#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {824#false} is VALID [2018-11-23 12:16:50,145 INFO L273 TraceCheckUtils]: 11: Hoare triple {824#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {824#false} is VALID [2018-11-23 12:16:50,146 INFO L273 TraceCheckUtils]: 12: Hoare triple {824#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {824#false} is VALID [2018-11-23 12:16:50,146 INFO L273 TraceCheckUtils]: 13: Hoare triple {824#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {824#false} is VALID [2018-11-23 12:16:50,146 INFO L273 TraceCheckUtils]: 14: Hoare triple {824#false} assume !(~i~0 < 60); {824#false} is VALID [2018-11-23 12:16:50,147 INFO L273 TraceCheckUtils]: 15: Hoare triple {824#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {824#false} is VALID [2018-11-23 12:16:50,147 INFO L273 TraceCheckUtils]: 16: Hoare triple {824#false} assume true; {824#false} is VALID [2018-11-23 12:16:50,148 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {824#false} {824#false} #75#return; {824#false} is VALID [2018-11-23 12:16:50,148 INFO L273 TraceCheckUtils]: 18: Hoare triple {824#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {824#false} is VALID [2018-11-23 12:16:50,148 INFO L256 TraceCheckUtils]: 19: Hoare triple {824#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {824#false} is VALID [2018-11-23 12:16:50,149 INFO L273 TraceCheckUtils]: 20: Hoare triple {824#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {824#false} is VALID [2018-11-23 12:16:50,149 INFO L273 TraceCheckUtils]: 21: Hoare triple {824#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {824#false} is VALID [2018-11-23 12:16:50,149 INFO L273 TraceCheckUtils]: 22: Hoare triple {824#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {824#false} is VALID [2018-11-23 12:16:50,149 INFO L273 TraceCheckUtils]: 23: Hoare triple {824#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {824#false} is VALID [2018-11-23 12:16:50,150 INFO L273 TraceCheckUtils]: 24: Hoare triple {824#false} assume !(~i~0 < 60); {824#false} is VALID [2018-11-23 12:16:50,150 INFO L273 TraceCheckUtils]: 25: Hoare triple {824#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {824#false} is VALID [2018-11-23 12:16:50,150 INFO L273 TraceCheckUtils]: 26: Hoare triple {824#false} assume true; {824#false} is VALID [2018-11-23 12:16:50,151 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {824#false} {824#false} #77#return; {824#false} is VALID [2018-11-23 12:16:50,151 INFO L273 TraceCheckUtils]: 28: Hoare triple {824#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {824#false} is VALID [2018-11-23 12:16:50,151 INFO L273 TraceCheckUtils]: 29: Hoare triple {824#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {824#false} is VALID [2018-11-23 12:16:50,151 INFO L273 TraceCheckUtils]: 30: Hoare triple {824#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {824#false} is VALID [2018-11-23 12:16:50,152 INFO L273 TraceCheckUtils]: 31: Hoare triple {824#false} assume !(~i~2 < 59); {824#false} is VALID [2018-11-23 12:16:50,152 INFO L273 TraceCheckUtils]: 32: Hoare triple {824#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {824#false} is VALID [2018-11-23 12:16:50,152 INFO L256 TraceCheckUtils]: 33: Hoare triple {824#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {824#false} is VALID [2018-11-23 12:16:50,153 INFO L273 TraceCheckUtils]: 34: Hoare triple {824#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {824#false} is VALID [2018-11-23 12:16:50,153 INFO L273 TraceCheckUtils]: 35: Hoare triple {824#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {824#false} is VALID [2018-11-23 12:16:50,153 INFO L273 TraceCheckUtils]: 36: Hoare triple {824#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {824#false} is VALID [2018-11-23 12:16:50,153 INFO L273 TraceCheckUtils]: 37: Hoare triple {824#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {824#false} is VALID [2018-11-23 12:16:50,154 INFO L273 TraceCheckUtils]: 38: Hoare triple {824#false} assume !(~i~0 < 60); {824#false} is VALID [2018-11-23 12:16:50,154 INFO L273 TraceCheckUtils]: 39: Hoare triple {824#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {824#false} is VALID [2018-11-23 12:16:50,154 INFO L273 TraceCheckUtils]: 40: Hoare triple {824#false} assume true; {824#false} is VALID [2018-11-23 12:16:50,155 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {824#false} {824#false} #79#return; {824#false} is VALID [2018-11-23 12:16:50,155 INFO L273 TraceCheckUtils]: 42: Hoare triple {824#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {824#false} is VALID [2018-11-23 12:16:50,155 INFO L273 TraceCheckUtils]: 43: Hoare triple {824#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {824#false} is VALID [2018-11-23 12:16:50,155 INFO L273 TraceCheckUtils]: 44: Hoare triple {824#false} assume !false; {824#false} is VALID [2018-11-23 12:16:50,158 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 12:16:50,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:50,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:16:50,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-23 12:16:50,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:50,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:16:50,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:50,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:16:50,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:16:50,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:16:50,286 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 5 states. [2018-11-23 12:16:50,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:50,493 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2018-11-23 12:16:50,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:16:50,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-23 12:16:50,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:50,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:16:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2018-11-23 12:16:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:16:50,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2018-11-23 12:16:50,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 60 transitions. [2018-11-23 12:16:50,636 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:50,638 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:16:50,639 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 12:16:50,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:16:50,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 12:16:50,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-23 12:16:50,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:50,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2018-11-23 12:16:50,655 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2018-11-23 12:16:50,655 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2018-11-23 12:16:50,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:50,658 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-23 12:16:50,658 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-23 12:16:50,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:50,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:50,659 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2018-11-23 12:16:50,660 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2018-11-23 12:16:50,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:50,662 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-23 12:16:50,662 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-23 12:16:50,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:50,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:50,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:50,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:16:50,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-23 12:16:50,665 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 45 [2018-11-23 12:16:50,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:50,666 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-23 12:16:50,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:16:50,666 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-23 12:16:50,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 12:16:50,667 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:50,667 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:50,668 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:50,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:50,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1356401117, now seen corresponding path program 2 times [2018-11-23 12:16:50,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:50,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:50,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:50,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:50,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:50,944 INFO L256 TraceCheckUtils]: 0: Hoare triple {1152#true} call ULTIMATE.init(); {1152#true} is VALID [2018-11-23 12:16:50,945 INFO L273 TraceCheckUtils]: 1: Hoare triple {1152#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1152#true} is VALID [2018-11-23 12:16:50,945 INFO L273 TraceCheckUtils]: 2: Hoare triple {1152#true} assume true; {1152#true} is VALID [2018-11-23 12:16:50,945 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1152#true} {1152#true} #71#return; {1152#true} is VALID [2018-11-23 12:16:50,946 INFO L256 TraceCheckUtils]: 4: Hoare triple {1152#true} call #t~ret14 := main(); {1152#true} is VALID [2018-11-23 12:16:50,950 INFO L273 TraceCheckUtils]: 5: Hoare triple {1152#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1154#(= main_~i~1 0)} is VALID [2018-11-23 12:16:50,950 INFO L273 TraceCheckUtils]: 6: Hoare triple {1154#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1154#(= main_~i~1 0)} is VALID [2018-11-23 12:16:50,955 INFO L273 TraceCheckUtils]: 7: Hoare triple {1154#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1155#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:50,955 INFO L273 TraceCheckUtils]: 8: Hoare triple {1155#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1155#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:50,956 INFO L273 TraceCheckUtils]: 9: Hoare triple {1155#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1156#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:50,957 INFO L273 TraceCheckUtils]: 10: Hoare triple {1156#(<= main_~i~1 2)} assume !(~i~1 < 60); {1153#false} is VALID [2018-11-23 12:16:50,957 INFO L256 TraceCheckUtils]: 11: Hoare triple {1153#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {1152#true} is VALID [2018-11-23 12:16:50,957 INFO L273 TraceCheckUtils]: 12: Hoare triple {1152#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1152#true} is VALID [2018-11-23 12:16:50,957 INFO L273 TraceCheckUtils]: 13: Hoare triple {1152#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1152#true} is VALID [2018-11-23 12:16:50,958 INFO L273 TraceCheckUtils]: 14: Hoare triple {1152#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1152#true} is VALID [2018-11-23 12:16:50,958 INFO L273 TraceCheckUtils]: 15: Hoare triple {1152#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1152#true} is VALID [2018-11-23 12:16:50,958 INFO L273 TraceCheckUtils]: 16: Hoare triple {1152#true} assume !(~i~0 < 60); {1152#true} is VALID [2018-11-23 12:16:50,958 INFO L273 TraceCheckUtils]: 17: Hoare triple {1152#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1152#true} is VALID [2018-11-23 12:16:50,959 INFO L273 TraceCheckUtils]: 18: Hoare triple {1152#true} assume true; {1152#true} is VALID [2018-11-23 12:16:50,959 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1152#true} {1153#false} #75#return; {1153#false} is VALID [2018-11-23 12:16:50,959 INFO L273 TraceCheckUtils]: 20: Hoare triple {1153#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1153#false} is VALID [2018-11-23 12:16:50,960 INFO L256 TraceCheckUtils]: 21: Hoare triple {1153#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {1152#true} is VALID [2018-11-23 12:16:50,960 INFO L273 TraceCheckUtils]: 22: Hoare triple {1152#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1152#true} is VALID [2018-11-23 12:16:50,960 INFO L273 TraceCheckUtils]: 23: Hoare triple {1152#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1152#true} is VALID [2018-11-23 12:16:50,960 INFO L273 TraceCheckUtils]: 24: Hoare triple {1152#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1152#true} is VALID [2018-11-23 12:16:50,961 INFO L273 TraceCheckUtils]: 25: Hoare triple {1152#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1152#true} is VALID [2018-11-23 12:16:50,961 INFO L273 TraceCheckUtils]: 26: Hoare triple {1152#true} assume !(~i~0 < 60); {1152#true} is VALID [2018-11-23 12:16:50,961 INFO L273 TraceCheckUtils]: 27: Hoare triple {1152#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1152#true} is VALID [2018-11-23 12:16:50,961 INFO L273 TraceCheckUtils]: 28: Hoare triple {1152#true} assume true; {1152#true} is VALID [2018-11-23 12:16:50,961 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1152#true} {1153#false} #77#return; {1153#false} is VALID [2018-11-23 12:16:50,962 INFO L273 TraceCheckUtils]: 30: Hoare triple {1153#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {1153#false} is VALID [2018-11-23 12:16:50,962 INFO L273 TraceCheckUtils]: 31: Hoare triple {1153#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {1153#false} is VALID [2018-11-23 12:16:50,962 INFO L273 TraceCheckUtils]: 32: Hoare triple {1153#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {1153#false} is VALID [2018-11-23 12:16:50,962 INFO L273 TraceCheckUtils]: 33: Hoare triple {1153#false} assume !(~i~2 < 59); {1153#false} is VALID [2018-11-23 12:16:50,963 INFO L273 TraceCheckUtils]: 34: Hoare triple {1153#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {1153#false} is VALID [2018-11-23 12:16:50,963 INFO L256 TraceCheckUtils]: 35: Hoare triple {1153#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {1152#true} is VALID [2018-11-23 12:16:50,963 INFO L273 TraceCheckUtils]: 36: Hoare triple {1152#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1152#true} is VALID [2018-11-23 12:16:50,963 INFO L273 TraceCheckUtils]: 37: Hoare triple {1152#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1152#true} is VALID [2018-11-23 12:16:50,964 INFO L273 TraceCheckUtils]: 38: Hoare triple {1152#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1152#true} is VALID [2018-11-23 12:16:50,964 INFO L273 TraceCheckUtils]: 39: Hoare triple {1152#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1152#true} is VALID [2018-11-23 12:16:50,964 INFO L273 TraceCheckUtils]: 40: Hoare triple {1152#true} assume !(~i~0 < 60); {1152#true} is VALID [2018-11-23 12:16:50,964 INFO L273 TraceCheckUtils]: 41: Hoare triple {1152#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1152#true} is VALID [2018-11-23 12:16:50,964 INFO L273 TraceCheckUtils]: 42: Hoare triple {1152#true} assume true; {1152#true} is VALID [2018-11-23 12:16:50,965 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {1152#true} {1153#false} #79#return; {1153#false} is VALID [2018-11-23 12:16:50,965 INFO L273 TraceCheckUtils]: 44: Hoare triple {1153#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {1153#false} is VALID [2018-11-23 12:16:50,965 INFO L273 TraceCheckUtils]: 45: Hoare triple {1153#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1153#false} is VALID [2018-11-23 12:16:50,966 INFO L273 TraceCheckUtils]: 46: Hoare triple {1153#false} assume !false; {1153#false} is VALID [2018-11-23 12:16:50,968 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 12:16:50,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:50,968 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:16:50,979 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:16:51,031 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:16:51,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:51,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:51,146 INFO L256 TraceCheckUtils]: 0: Hoare triple {1152#true} call ULTIMATE.init(); {1152#true} is VALID [2018-11-23 12:16:51,147 INFO L273 TraceCheckUtils]: 1: Hoare triple {1152#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1152#true} is VALID [2018-11-23 12:16:51,147 INFO L273 TraceCheckUtils]: 2: Hoare triple {1152#true} assume true; {1152#true} is VALID [2018-11-23 12:16:51,148 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1152#true} {1152#true} #71#return; {1152#true} is VALID [2018-11-23 12:16:51,148 INFO L256 TraceCheckUtils]: 4: Hoare triple {1152#true} call #t~ret14 := main(); {1152#true} is VALID [2018-11-23 12:16:51,149 INFO L273 TraceCheckUtils]: 5: Hoare triple {1152#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1175#(<= main_~i~1 0)} is VALID [2018-11-23 12:16:51,150 INFO L273 TraceCheckUtils]: 6: Hoare triple {1175#(<= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1175#(<= main_~i~1 0)} is VALID [2018-11-23 12:16:51,151 INFO L273 TraceCheckUtils]: 7: Hoare triple {1175#(<= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1155#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:51,151 INFO L273 TraceCheckUtils]: 8: Hoare triple {1155#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1155#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:51,152 INFO L273 TraceCheckUtils]: 9: Hoare triple {1155#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1156#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:51,153 INFO L273 TraceCheckUtils]: 10: Hoare triple {1156#(<= main_~i~1 2)} assume !(~i~1 < 60); {1153#false} is VALID [2018-11-23 12:16:51,153 INFO L256 TraceCheckUtils]: 11: Hoare triple {1153#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {1153#false} is VALID [2018-11-23 12:16:51,154 INFO L273 TraceCheckUtils]: 12: Hoare triple {1153#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1153#false} is VALID [2018-11-23 12:16:51,154 INFO L273 TraceCheckUtils]: 13: Hoare triple {1153#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1153#false} is VALID [2018-11-23 12:16:51,154 INFO L273 TraceCheckUtils]: 14: Hoare triple {1153#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1153#false} is VALID [2018-11-23 12:16:51,155 INFO L273 TraceCheckUtils]: 15: Hoare triple {1153#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1153#false} is VALID [2018-11-23 12:16:51,155 INFO L273 TraceCheckUtils]: 16: Hoare triple {1153#false} assume !(~i~0 < 60); {1153#false} is VALID [2018-11-23 12:16:51,155 INFO L273 TraceCheckUtils]: 17: Hoare triple {1153#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1153#false} is VALID [2018-11-23 12:16:51,156 INFO L273 TraceCheckUtils]: 18: Hoare triple {1153#false} assume true; {1153#false} is VALID [2018-11-23 12:16:51,156 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1153#false} {1153#false} #75#return; {1153#false} is VALID [2018-11-23 12:16:51,156 INFO L273 TraceCheckUtils]: 20: Hoare triple {1153#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1153#false} is VALID [2018-11-23 12:16:51,156 INFO L256 TraceCheckUtils]: 21: Hoare triple {1153#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {1153#false} is VALID [2018-11-23 12:16:51,157 INFO L273 TraceCheckUtils]: 22: Hoare triple {1153#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1153#false} is VALID [2018-11-23 12:16:51,157 INFO L273 TraceCheckUtils]: 23: Hoare triple {1153#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1153#false} is VALID [2018-11-23 12:16:51,157 INFO L273 TraceCheckUtils]: 24: Hoare triple {1153#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1153#false} is VALID [2018-11-23 12:16:51,157 INFO L273 TraceCheckUtils]: 25: Hoare triple {1153#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1153#false} is VALID [2018-11-23 12:16:51,158 INFO L273 TraceCheckUtils]: 26: Hoare triple {1153#false} assume !(~i~0 < 60); {1153#false} is VALID [2018-11-23 12:16:51,158 INFO L273 TraceCheckUtils]: 27: Hoare triple {1153#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1153#false} is VALID [2018-11-23 12:16:51,158 INFO L273 TraceCheckUtils]: 28: Hoare triple {1153#false} assume true; {1153#false} is VALID [2018-11-23 12:16:51,158 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1153#false} {1153#false} #77#return; {1153#false} is VALID [2018-11-23 12:16:51,159 INFO L273 TraceCheckUtils]: 30: Hoare triple {1153#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {1153#false} is VALID [2018-11-23 12:16:51,159 INFO L273 TraceCheckUtils]: 31: Hoare triple {1153#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {1153#false} is VALID [2018-11-23 12:16:51,159 INFO L273 TraceCheckUtils]: 32: Hoare triple {1153#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {1153#false} is VALID [2018-11-23 12:16:51,159 INFO L273 TraceCheckUtils]: 33: Hoare triple {1153#false} assume !(~i~2 < 59); {1153#false} is VALID [2018-11-23 12:16:51,159 INFO L273 TraceCheckUtils]: 34: Hoare triple {1153#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {1153#false} is VALID [2018-11-23 12:16:51,160 INFO L256 TraceCheckUtils]: 35: Hoare triple {1153#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {1153#false} is VALID [2018-11-23 12:16:51,160 INFO L273 TraceCheckUtils]: 36: Hoare triple {1153#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1153#false} is VALID [2018-11-23 12:16:51,160 INFO L273 TraceCheckUtils]: 37: Hoare triple {1153#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1153#false} is VALID [2018-11-23 12:16:51,160 INFO L273 TraceCheckUtils]: 38: Hoare triple {1153#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1153#false} is VALID [2018-11-23 12:16:51,160 INFO L273 TraceCheckUtils]: 39: Hoare triple {1153#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1153#false} is VALID [2018-11-23 12:16:51,161 INFO L273 TraceCheckUtils]: 40: Hoare triple {1153#false} assume !(~i~0 < 60); {1153#false} is VALID [2018-11-23 12:16:51,161 INFO L273 TraceCheckUtils]: 41: Hoare triple {1153#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1153#false} is VALID [2018-11-23 12:16:51,161 INFO L273 TraceCheckUtils]: 42: Hoare triple {1153#false} assume true; {1153#false} is VALID [2018-11-23 12:16:51,161 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {1153#false} {1153#false} #79#return; {1153#false} is VALID [2018-11-23 12:16:51,161 INFO L273 TraceCheckUtils]: 44: Hoare triple {1153#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {1153#false} is VALID [2018-11-23 12:16:51,161 INFO L273 TraceCheckUtils]: 45: Hoare triple {1153#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1153#false} is VALID [2018-11-23 12:16:51,162 INFO L273 TraceCheckUtils]: 46: Hoare triple {1153#false} assume !false; {1153#false} is VALID [2018-11-23 12:16:51,165 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 12:16:51,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:51,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:16:51,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-11-23 12:16:51,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:51,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:16:51,248 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:51,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:16:51,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:16:51,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:16:51,249 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 6 states. [2018-11-23 12:16:51,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:51,468 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-23 12:16:51,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:16:51,469 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-11-23 12:16:51,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:51,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:16:51,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2018-11-23 12:16:51,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:16:51,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2018-11-23 12:16:51,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2018-11-23 12:16:51,608 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:51,611 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:16:51,611 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 12:16:51,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:16:51,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 12:16:51,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-11-23 12:16:51,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:51,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2018-11-23 12:16:51,659 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2018-11-23 12:16:51,659 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2018-11-23 12:16:51,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:51,661 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-23 12:16:51,661 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-11-23 12:16:51,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:51,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:51,662 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2018-11-23 12:16:51,662 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2018-11-23 12:16:51,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:51,664 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-23 12:16:51,664 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-11-23 12:16:51,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:51,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:51,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:51,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:51,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:16:51,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-11-23 12:16:51,668 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 47 [2018-11-23 12:16:51,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:51,668 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-23 12:16:51,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:16:51,668 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 12:16:51,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 12:16:51,669 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:51,669 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:51,670 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:51,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:51,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1005160965, now seen corresponding path program 3 times [2018-11-23 12:16:51,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:51,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:51,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:51,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:51,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:51,825 INFO L256 TraceCheckUtils]: 0: Hoare triple {1498#true} call ULTIMATE.init(); {1498#true} is VALID [2018-11-23 12:16:51,826 INFO L273 TraceCheckUtils]: 1: Hoare triple {1498#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1498#true} is VALID [2018-11-23 12:16:51,827 INFO L273 TraceCheckUtils]: 2: Hoare triple {1498#true} assume true; {1498#true} is VALID [2018-11-23 12:16:51,827 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1498#true} {1498#true} #71#return; {1498#true} is VALID [2018-11-23 12:16:51,827 INFO L256 TraceCheckUtils]: 4: Hoare triple {1498#true} call #t~ret14 := main(); {1498#true} is VALID [2018-11-23 12:16:51,828 INFO L273 TraceCheckUtils]: 5: Hoare triple {1498#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1500#(= main_~i~1 0)} is VALID [2018-11-23 12:16:51,829 INFO L273 TraceCheckUtils]: 6: Hoare triple {1500#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1500#(= main_~i~1 0)} is VALID [2018-11-23 12:16:51,829 INFO L273 TraceCheckUtils]: 7: Hoare triple {1500#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1501#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:51,830 INFO L273 TraceCheckUtils]: 8: Hoare triple {1501#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1501#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:51,830 INFO L273 TraceCheckUtils]: 9: Hoare triple {1501#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1502#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:51,831 INFO L273 TraceCheckUtils]: 10: Hoare triple {1502#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1502#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:51,831 INFO L273 TraceCheckUtils]: 11: Hoare triple {1502#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1503#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:51,832 INFO L273 TraceCheckUtils]: 12: Hoare triple {1503#(<= main_~i~1 3)} assume !(~i~1 < 60); {1499#false} is VALID [2018-11-23 12:16:51,833 INFO L256 TraceCheckUtils]: 13: Hoare triple {1499#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {1498#true} is VALID [2018-11-23 12:16:51,833 INFO L273 TraceCheckUtils]: 14: Hoare triple {1498#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1498#true} is VALID [2018-11-23 12:16:51,833 INFO L273 TraceCheckUtils]: 15: Hoare triple {1498#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1498#true} is VALID [2018-11-23 12:16:51,833 INFO L273 TraceCheckUtils]: 16: Hoare triple {1498#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1498#true} is VALID [2018-11-23 12:16:51,834 INFO L273 TraceCheckUtils]: 17: Hoare triple {1498#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1498#true} is VALID [2018-11-23 12:16:51,834 INFO L273 TraceCheckUtils]: 18: Hoare triple {1498#true} assume !(~i~0 < 60); {1498#true} is VALID [2018-11-23 12:16:51,834 INFO L273 TraceCheckUtils]: 19: Hoare triple {1498#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1498#true} is VALID [2018-11-23 12:16:51,835 INFO L273 TraceCheckUtils]: 20: Hoare triple {1498#true} assume true; {1498#true} is VALID [2018-11-23 12:16:51,835 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1498#true} {1499#false} #75#return; {1499#false} is VALID [2018-11-23 12:16:51,835 INFO L273 TraceCheckUtils]: 22: Hoare triple {1499#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1499#false} is VALID [2018-11-23 12:16:51,836 INFO L256 TraceCheckUtils]: 23: Hoare triple {1499#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {1498#true} is VALID [2018-11-23 12:16:51,836 INFO L273 TraceCheckUtils]: 24: Hoare triple {1498#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1498#true} is VALID [2018-11-23 12:16:51,836 INFO L273 TraceCheckUtils]: 25: Hoare triple {1498#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1498#true} is VALID [2018-11-23 12:16:51,837 INFO L273 TraceCheckUtils]: 26: Hoare triple {1498#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1498#true} is VALID [2018-11-23 12:16:51,837 INFO L273 TraceCheckUtils]: 27: Hoare triple {1498#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1498#true} is VALID [2018-11-23 12:16:51,837 INFO L273 TraceCheckUtils]: 28: Hoare triple {1498#true} assume !(~i~0 < 60); {1498#true} is VALID [2018-11-23 12:16:51,837 INFO L273 TraceCheckUtils]: 29: Hoare triple {1498#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1498#true} is VALID [2018-11-23 12:16:51,838 INFO L273 TraceCheckUtils]: 30: Hoare triple {1498#true} assume true; {1498#true} is VALID [2018-11-23 12:16:51,838 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1498#true} {1499#false} #77#return; {1499#false} is VALID [2018-11-23 12:16:51,838 INFO L273 TraceCheckUtils]: 32: Hoare triple {1499#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {1499#false} is VALID [2018-11-23 12:16:51,838 INFO L273 TraceCheckUtils]: 33: Hoare triple {1499#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {1499#false} is VALID [2018-11-23 12:16:51,839 INFO L273 TraceCheckUtils]: 34: Hoare triple {1499#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {1499#false} is VALID [2018-11-23 12:16:51,839 INFO L273 TraceCheckUtils]: 35: Hoare triple {1499#false} assume !(~i~2 < 59); {1499#false} is VALID [2018-11-23 12:16:51,839 INFO L273 TraceCheckUtils]: 36: Hoare triple {1499#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {1499#false} is VALID [2018-11-23 12:16:51,839 INFO L256 TraceCheckUtils]: 37: Hoare triple {1499#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {1498#true} is VALID [2018-11-23 12:16:51,840 INFO L273 TraceCheckUtils]: 38: Hoare triple {1498#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1498#true} is VALID [2018-11-23 12:16:51,840 INFO L273 TraceCheckUtils]: 39: Hoare triple {1498#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1498#true} is VALID [2018-11-23 12:16:51,840 INFO L273 TraceCheckUtils]: 40: Hoare triple {1498#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1498#true} is VALID [2018-11-23 12:16:51,840 INFO L273 TraceCheckUtils]: 41: Hoare triple {1498#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1498#true} is VALID [2018-11-23 12:16:51,841 INFO L273 TraceCheckUtils]: 42: Hoare triple {1498#true} assume !(~i~0 < 60); {1498#true} is VALID [2018-11-23 12:16:51,841 INFO L273 TraceCheckUtils]: 43: Hoare triple {1498#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1498#true} is VALID [2018-11-23 12:16:51,841 INFO L273 TraceCheckUtils]: 44: Hoare triple {1498#true} assume true; {1498#true} is VALID [2018-11-23 12:16:51,841 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1498#true} {1499#false} #79#return; {1499#false} is VALID [2018-11-23 12:16:51,842 INFO L273 TraceCheckUtils]: 46: Hoare triple {1499#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {1499#false} is VALID [2018-11-23 12:16:51,842 INFO L273 TraceCheckUtils]: 47: Hoare triple {1499#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1499#false} is VALID [2018-11-23 12:16:51,842 INFO L273 TraceCheckUtils]: 48: Hoare triple {1499#false} assume !false; {1499#false} is VALID [2018-11-23 12:16:51,845 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 12:16:51,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:51,845 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:16:51,854 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:16:51,904 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:16:51,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:51,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:52,492 INFO L256 TraceCheckUtils]: 0: Hoare triple {1498#true} call ULTIMATE.init(); {1498#true} is VALID [2018-11-23 12:16:52,492 INFO L273 TraceCheckUtils]: 1: Hoare triple {1498#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1498#true} is VALID [2018-11-23 12:16:52,492 INFO L273 TraceCheckUtils]: 2: Hoare triple {1498#true} assume true; {1498#true} is VALID [2018-11-23 12:16:52,493 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1498#true} {1498#true} #71#return; {1498#true} is VALID [2018-11-23 12:16:52,493 INFO L256 TraceCheckUtils]: 4: Hoare triple {1498#true} call #t~ret14 := main(); {1498#true} is VALID [2018-11-23 12:16:52,493 INFO L273 TraceCheckUtils]: 5: Hoare triple {1498#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1498#true} is VALID [2018-11-23 12:16:52,494 INFO L273 TraceCheckUtils]: 6: Hoare triple {1498#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1498#true} is VALID [2018-11-23 12:16:52,494 INFO L273 TraceCheckUtils]: 7: Hoare triple {1498#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1498#true} is VALID [2018-11-23 12:16:52,494 INFO L273 TraceCheckUtils]: 8: Hoare triple {1498#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1498#true} is VALID [2018-11-23 12:16:52,494 INFO L273 TraceCheckUtils]: 9: Hoare triple {1498#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1498#true} is VALID [2018-11-23 12:16:52,495 INFO L273 TraceCheckUtils]: 10: Hoare triple {1498#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1498#true} is VALID [2018-11-23 12:16:52,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {1498#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1498#true} is VALID [2018-11-23 12:16:52,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {1498#true} assume !(~i~1 < 60); {1498#true} is VALID [2018-11-23 12:16:52,495 INFO L256 TraceCheckUtils]: 13: Hoare triple {1498#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {1498#true} is VALID [2018-11-23 12:16:52,495 INFO L273 TraceCheckUtils]: 14: Hoare triple {1498#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1498#true} is VALID [2018-11-23 12:16:52,495 INFO L273 TraceCheckUtils]: 15: Hoare triple {1498#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1498#true} is VALID [2018-11-23 12:16:52,496 INFO L273 TraceCheckUtils]: 16: Hoare triple {1498#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1498#true} is VALID [2018-11-23 12:16:52,496 INFO L273 TraceCheckUtils]: 17: Hoare triple {1498#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1498#true} is VALID [2018-11-23 12:16:52,496 INFO L273 TraceCheckUtils]: 18: Hoare triple {1498#true} assume !(~i~0 < 60); {1498#true} is VALID [2018-11-23 12:16:52,496 INFO L273 TraceCheckUtils]: 19: Hoare triple {1498#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1498#true} is VALID [2018-11-23 12:16:52,497 INFO L273 TraceCheckUtils]: 20: Hoare triple {1498#true} assume true; {1498#true} is VALID [2018-11-23 12:16:52,497 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1498#true} {1498#true} #75#return; {1498#true} is VALID [2018-11-23 12:16:52,497 INFO L273 TraceCheckUtils]: 22: Hoare triple {1498#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1498#true} is VALID [2018-11-23 12:16:52,497 INFO L256 TraceCheckUtils]: 23: Hoare triple {1498#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {1498#true} is VALID [2018-11-23 12:16:52,498 INFO L273 TraceCheckUtils]: 24: Hoare triple {1498#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1498#true} is VALID [2018-11-23 12:16:52,498 INFO L273 TraceCheckUtils]: 25: Hoare triple {1498#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1498#true} is VALID [2018-11-23 12:16:52,498 INFO L273 TraceCheckUtils]: 26: Hoare triple {1498#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1498#true} is VALID [2018-11-23 12:16:52,498 INFO L273 TraceCheckUtils]: 27: Hoare triple {1498#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1498#true} is VALID [2018-11-23 12:16:52,499 INFO L273 TraceCheckUtils]: 28: Hoare triple {1498#true} assume !(~i~0 < 60); {1498#true} is VALID [2018-11-23 12:16:52,499 INFO L273 TraceCheckUtils]: 29: Hoare triple {1498#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1498#true} is VALID [2018-11-23 12:16:52,499 INFO L273 TraceCheckUtils]: 30: Hoare triple {1498#true} assume true; {1498#true} is VALID [2018-11-23 12:16:52,499 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1498#true} {1498#true} #77#return; {1498#true} is VALID [2018-11-23 12:16:52,500 INFO L273 TraceCheckUtils]: 32: Hoare triple {1498#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {1498#true} is VALID [2018-11-23 12:16:52,500 INFO L273 TraceCheckUtils]: 33: Hoare triple {1498#true} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {1498#true} is VALID [2018-11-23 12:16:52,500 INFO L273 TraceCheckUtils]: 34: Hoare triple {1498#true} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {1498#true} is VALID [2018-11-23 12:16:52,500 INFO L273 TraceCheckUtils]: 35: Hoare triple {1498#true} assume !(~i~2 < 59); {1498#true} is VALID [2018-11-23 12:16:52,501 INFO L273 TraceCheckUtils]: 36: Hoare triple {1498#true} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {1498#true} is VALID [2018-11-23 12:16:52,501 INFO L256 TraceCheckUtils]: 37: Hoare triple {1498#true} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {1498#true} is VALID [2018-11-23 12:16:52,513 INFO L273 TraceCheckUtils]: 38: Hoare triple {1498#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1621#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:52,514 INFO L273 TraceCheckUtils]: 39: Hoare triple {1621#(<= sep_~i~0 0)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1621#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:52,514 INFO L273 TraceCheckUtils]: 40: Hoare triple {1621#(<= sep_~i~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1621#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:52,515 INFO L273 TraceCheckUtils]: 41: Hoare triple {1621#(<= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1631#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:52,516 INFO L273 TraceCheckUtils]: 42: Hoare triple {1631#(<= sep_~i~0 1)} assume !(~i~0 < 60); {1499#false} is VALID [2018-11-23 12:16:52,516 INFO L273 TraceCheckUtils]: 43: Hoare triple {1499#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1499#false} is VALID [2018-11-23 12:16:52,516 INFO L273 TraceCheckUtils]: 44: Hoare triple {1499#false} assume true; {1499#false} is VALID [2018-11-23 12:16:52,516 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1499#false} {1498#true} #79#return; {1499#false} is VALID [2018-11-23 12:16:52,517 INFO L273 TraceCheckUtils]: 46: Hoare triple {1499#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {1499#false} is VALID [2018-11-23 12:16:52,517 INFO L273 TraceCheckUtils]: 47: Hoare triple {1499#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1499#false} is VALID [2018-11-23 12:16:52,517 INFO L273 TraceCheckUtils]: 48: Hoare triple {1499#false} assume !false; {1499#false} is VALID [2018-11-23 12:16:52,519 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 12:16:52,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:52,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-23 12:16:52,538 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-23 12:16:52,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:52,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:16:52,649 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:52,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:16:52,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:16:52,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:16:52,650 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 8 states. [2018-11-23 12:16:53,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:53,127 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2018-11-23 12:16:53,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:16:53,127 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-23 12:16:53,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:53,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:16:53,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2018-11-23 12:16:53,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:16:53,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2018-11-23 12:16:53,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 76 transitions. [2018-11-23 12:16:53,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:53,286 INFO L225 Difference]: With dead ends: 63 [2018-11-23 12:16:53,286 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:16:53,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:16:53,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:16:53,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-11-23 12:16:53,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:53,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 39 states. [2018-11-23 12:16:53,363 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 39 states. [2018-11-23 12:16:53,364 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 39 states. [2018-11-23 12:16:53,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:53,367 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-23 12:16:53,367 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-23 12:16:53,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:53,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:53,368 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 42 states. [2018-11-23 12:16:53,368 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 42 states. [2018-11-23 12:16:53,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:53,371 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-23 12:16:53,371 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-23 12:16:53,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:53,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:53,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:53,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:53,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:16:53,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-11-23 12:16:53,374 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 49 [2018-11-23 12:16:53,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:53,375 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-11-23 12:16:53,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:16:53,375 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-11-23 12:16:53,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 12:16:53,376 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:53,376 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:53,376 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:53,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:53,377 INFO L82 PathProgramCache]: Analyzing trace with hash 742022364, now seen corresponding path program 4 times [2018-11-23 12:16:53,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:53,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:53,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:53,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:53,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:53,586 INFO L256 TraceCheckUtils]: 0: Hoare triple {1882#true} call ULTIMATE.init(); {1882#true} is VALID [2018-11-23 12:16:53,587 INFO L273 TraceCheckUtils]: 1: Hoare triple {1882#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1882#true} is VALID [2018-11-23 12:16:53,587 INFO L273 TraceCheckUtils]: 2: Hoare triple {1882#true} assume true; {1882#true} is VALID [2018-11-23 12:16:53,588 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1882#true} {1882#true} #71#return; {1882#true} is VALID [2018-11-23 12:16:53,588 INFO L256 TraceCheckUtils]: 4: Hoare triple {1882#true} call #t~ret14 := main(); {1882#true} is VALID [2018-11-23 12:16:53,589 INFO L273 TraceCheckUtils]: 5: Hoare triple {1882#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1884#(= main_~i~1 0)} is VALID [2018-11-23 12:16:53,589 INFO L273 TraceCheckUtils]: 6: Hoare triple {1884#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1884#(= main_~i~1 0)} is VALID [2018-11-23 12:16:53,590 INFO L273 TraceCheckUtils]: 7: Hoare triple {1884#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1885#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:53,591 INFO L273 TraceCheckUtils]: 8: Hoare triple {1885#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1885#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:53,592 INFO L273 TraceCheckUtils]: 9: Hoare triple {1885#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1886#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:53,592 INFO L273 TraceCheckUtils]: 10: Hoare triple {1886#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1886#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:53,593 INFO L273 TraceCheckUtils]: 11: Hoare triple {1886#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1887#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:53,594 INFO L273 TraceCheckUtils]: 12: Hoare triple {1887#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1887#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:53,595 INFO L273 TraceCheckUtils]: 13: Hoare triple {1887#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1888#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:53,596 INFO L273 TraceCheckUtils]: 14: Hoare triple {1888#(<= main_~i~1 4)} assume !(~i~1 < 60); {1883#false} is VALID [2018-11-23 12:16:53,596 INFO L256 TraceCheckUtils]: 15: Hoare triple {1883#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {1882#true} is VALID [2018-11-23 12:16:53,596 INFO L273 TraceCheckUtils]: 16: Hoare triple {1882#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1882#true} is VALID [2018-11-23 12:16:53,596 INFO L273 TraceCheckUtils]: 17: Hoare triple {1882#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1882#true} is VALID [2018-11-23 12:16:53,597 INFO L273 TraceCheckUtils]: 18: Hoare triple {1882#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1882#true} is VALID [2018-11-23 12:16:53,597 INFO L273 TraceCheckUtils]: 19: Hoare triple {1882#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1882#true} is VALID [2018-11-23 12:16:53,597 INFO L273 TraceCheckUtils]: 20: Hoare triple {1882#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1882#true} is VALID [2018-11-23 12:16:53,598 INFO L273 TraceCheckUtils]: 21: Hoare triple {1882#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1882#true} is VALID [2018-11-23 12:16:53,598 INFO L273 TraceCheckUtils]: 22: Hoare triple {1882#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1882#true} is VALID [2018-11-23 12:16:53,598 INFO L273 TraceCheckUtils]: 23: Hoare triple {1882#true} assume !(~i~0 < 60); {1882#true} is VALID [2018-11-23 12:16:53,598 INFO L273 TraceCheckUtils]: 24: Hoare triple {1882#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1882#true} is VALID [2018-11-23 12:16:53,599 INFO L273 TraceCheckUtils]: 25: Hoare triple {1882#true} assume true; {1882#true} is VALID [2018-11-23 12:16:53,599 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1882#true} {1883#false} #75#return; {1883#false} is VALID [2018-11-23 12:16:53,599 INFO L273 TraceCheckUtils]: 27: Hoare triple {1883#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1883#false} is VALID [2018-11-23 12:16:53,599 INFO L256 TraceCheckUtils]: 28: Hoare triple {1883#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {1882#true} is VALID [2018-11-23 12:16:53,599 INFO L273 TraceCheckUtils]: 29: Hoare triple {1882#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1882#true} is VALID [2018-11-23 12:16:53,599 INFO L273 TraceCheckUtils]: 30: Hoare triple {1882#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1882#true} is VALID [2018-11-23 12:16:53,600 INFO L273 TraceCheckUtils]: 31: Hoare triple {1882#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1882#true} is VALID [2018-11-23 12:16:53,600 INFO L273 TraceCheckUtils]: 32: Hoare triple {1882#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1882#true} is VALID [2018-11-23 12:16:53,600 INFO L273 TraceCheckUtils]: 33: Hoare triple {1882#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1882#true} is VALID [2018-11-23 12:16:53,600 INFO L273 TraceCheckUtils]: 34: Hoare triple {1882#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1882#true} is VALID [2018-11-23 12:16:53,600 INFO L273 TraceCheckUtils]: 35: Hoare triple {1882#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1882#true} is VALID [2018-11-23 12:16:53,600 INFO L273 TraceCheckUtils]: 36: Hoare triple {1882#true} assume !(~i~0 < 60); {1882#true} is VALID [2018-11-23 12:16:53,601 INFO L273 TraceCheckUtils]: 37: Hoare triple {1882#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1882#true} is VALID [2018-11-23 12:16:53,601 INFO L273 TraceCheckUtils]: 38: Hoare triple {1882#true} assume true; {1882#true} is VALID [2018-11-23 12:16:53,601 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1882#true} {1883#false} #77#return; {1883#false} is VALID [2018-11-23 12:16:53,601 INFO L273 TraceCheckUtils]: 40: Hoare triple {1883#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {1883#false} is VALID [2018-11-23 12:16:53,601 INFO L273 TraceCheckUtils]: 41: Hoare triple {1883#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {1883#false} is VALID [2018-11-23 12:16:53,602 INFO L273 TraceCheckUtils]: 42: Hoare triple {1883#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {1883#false} is VALID [2018-11-23 12:16:53,602 INFO L273 TraceCheckUtils]: 43: Hoare triple {1883#false} assume !(~i~2 < 59); {1883#false} is VALID [2018-11-23 12:16:53,602 INFO L273 TraceCheckUtils]: 44: Hoare triple {1883#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {1883#false} is VALID [2018-11-23 12:16:53,602 INFO L256 TraceCheckUtils]: 45: Hoare triple {1883#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {1882#true} is VALID [2018-11-23 12:16:53,602 INFO L273 TraceCheckUtils]: 46: Hoare triple {1882#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1882#true} is VALID [2018-11-23 12:16:53,602 INFO L273 TraceCheckUtils]: 47: Hoare triple {1882#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1882#true} is VALID [2018-11-23 12:16:53,603 INFO L273 TraceCheckUtils]: 48: Hoare triple {1882#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1882#true} is VALID [2018-11-23 12:16:53,603 INFO L273 TraceCheckUtils]: 49: Hoare triple {1882#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1882#true} is VALID [2018-11-23 12:16:53,603 INFO L273 TraceCheckUtils]: 50: Hoare triple {1882#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1882#true} is VALID [2018-11-23 12:16:53,603 INFO L273 TraceCheckUtils]: 51: Hoare triple {1882#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1882#true} is VALID [2018-11-23 12:16:53,603 INFO L273 TraceCheckUtils]: 52: Hoare triple {1882#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1882#true} is VALID [2018-11-23 12:16:53,604 INFO L273 TraceCheckUtils]: 53: Hoare triple {1882#true} assume !(~i~0 < 60); {1882#true} is VALID [2018-11-23 12:16:53,604 INFO L273 TraceCheckUtils]: 54: Hoare triple {1882#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1882#true} is VALID [2018-11-23 12:16:53,604 INFO L273 TraceCheckUtils]: 55: Hoare triple {1882#true} assume true; {1882#true} is VALID [2018-11-23 12:16:53,605 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {1882#true} {1883#false} #79#return; {1883#false} is VALID [2018-11-23 12:16:53,605 INFO L273 TraceCheckUtils]: 57: Hoare triple {1883#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {1883#false} is VALID [2018-11-23 12:16:53,605 INFO L273 TraceCheckUtils]: 58: Hoare triple {1883#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1883#false} is VALID [2018-11-23 12:16:53,605 INFO L273 TraceCheckUtils]: 59: Hoare triple {1883#false} assume !false; {1883#false} is VALID [2018-11-23 12:16:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-23 12:16:53,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:53,610 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:16:53,646 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:16:53,681 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:16:53,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:53,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:53,837 INFO L256 TraceCheckUtils]: 0: Hoare triple {1882#true} call ULTIMATE.init(); {1882#true} is VALID [2018-11-23 12:16:53,838 INFO L273 TraceCheckUtils]: 1: Hoare triple {1882#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1882#true} is VALID [2018-11-23 12:16:53,838 INFO L273 TraceCheckUtils]: 2: Hoare triple {1882#true} assume true; {1882#true} is VALID [2018-11-23 12:16:53,838 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1882#true} {1882#true} #71#return; {1882#true} is VALID [2018-11-23 12:16:53,839 INFO L256 TraceCheckUtils]: 4: Hoare triple {1882#true} call #t~ret14 := main(); {1882#true} is VALID [2018-11-23 12:16:53,840 INFO L273 TraceCheckUtils]: 5: Hoare triple {1882#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1907#(<= main_~i~1 0)} is VALID [2018-11-23 12:16:53,846 INFO L273 TraceCheckUtils]: 6: Hoare triple {1907#(<= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1907#(<= main_~i~1 0)} is VALID [2018-11-23 12:16:53,847 INFO L273 TraceCheckUtils]: 7: Hoare triple {1907#(<= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1885#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:53,852 INFO L273 TraceCheckUtils]: 8: Hoare triple {1885#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1885#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:53,852 INFO L273 TraceCheckUtils]: 9: Hoare triple {1885#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1886#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:53,853 INFO L273 TraceCheckUtils]: 10: Hoare triple {1886#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1886#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:53,853 INFO L273 TraceCheckUtils]: 11: Hoare triple {1886#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1887#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:53,853 INFO L273 TraceCheckUtils]: 12: Hoare triple {1887#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1887#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:53,854 INFO L273 TraceCheckUtils]: 13: Hoare triple {1887#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1888#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:53,854 INFO L273 TraceCheckUtils]: 14: Hoare triple {1888#(<= main_~i~1 4)} assume !(~i~1 < 60); {1883#false} is VALID [2018-11-23 12:16:53,855 INFO L256 TraceCheckUtils]: 15: Hoare triple {1883#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {1883#false} is VALID [2018-11-23 12:16:53,855 INFO L273 TraceCheckUtils]: 16: Hoare triple {1883#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1883#false} is VALID [2018-11-23 12:16:53,855 INFO L273 TraceCheckUtils]: 17: Hoare triple {1883#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1883#false} is VALID [2018-11-23 12:16:53,855 INFO L273 TraceCheckUtils]: 18: Hoare triple {1883#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1883#false} is VALID [2018-11-23 12:16:53,855 INFO L273 TraceCheckUtils]: 19: Hoare triple {1883#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1883#false} is VALID [2018-11-23 12:16:53,855 INFO L273 TraceCheckUtils]: 20: Hoare triple {1883#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1883#false} is VALID [2018-11-23 12:16:53,855 INFO L273 TraceCheckUtils]: 21: Hoare triple {1883#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1883#false} is VALID [2018-11-23 12:16:53,855 INFO L273 TraceCheckUtils]: 22: Hoare triple {1883#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1883#false} is VALID [2018-11-23 12:16:53,856 INFO L273 TraceCheckUtils]: 23: Hoare triple {1883#false} assume !(~i~0 < 60); {1883#false} is VALID [2018-11-23 12:16:53,856 INFO L273 TraceCheckUtils]: 24: Hoare triple {1883#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1883#false} is VALID [2018-11-23 12:16:53,856 INFO L273 TraceCheckUtils]: 25: Hoare triple {1883#false} assume true; {1883#false} is VALID [2018-11-23 12:16:53,856 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1883#false} {1883#false} #75#return; {1883#false} is VALID [2018-11-23 12:16:53,856 INFO L273 TraceCheckUtils]: 27: Hoare triple {1883#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1883#false} is VALID [2018-11-23 12:16:53,857 INFO L256 TraceCheckUtils]: 28: Hoare triple {1883#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {1883#false} is VALID [2018-11-23 12:16:53,857 INFO L273 TraceCheckUtils]: 29: Hoare triple {1883#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1883#false} is VALID [2018-11-23 12:16:53,857 INFO L273 TraceCheckUtils]: 30: Hoare triple {1883#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1883#false} is VALID [2018-11-23 12:16:53,857 INFO L273 TraceCheckUtils]: 31: Hoare triple {1883#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1883#false} is VALID [2018-11-23 12:16:53,858 INFO L273 TraceCheckUtils]: 32: Hoare triple {1883#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1883#false} is VALID [2018-11-23 12:16:53,858 INFO L273 TraceCheckUtils]: 33: Hoare triple {1883#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1883#false} is VALID [2018-11-23 12:16:53,858 INFO L273 TraceCheckUtils]: 34: Hoare triple {1883#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1883#false} is VALID [2018-11-23 12:16:53,858 INFO L273 TraceCheckUtils]: 35: Hoare triple {1883#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1883#false} is VALID [2018-11-23 12:16:53,858 INFO L273 TraceCheckUtils]: 36: Hoare triple {1883#false} assume !(~i~0 < 60); {1883#false} is VALID [2018-11-23 12:16:53,858 INFO L273 TraceCheckUtils]: 37: Hoare triple {1883#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1883#false} is VALID [2018-11-23 12:16:53,858 INFO L273 TraceCheckUtils]: 38: Hoare triple {1883#false} assume true; {1883#false} is VALID [2018-11-23 12:16:53,859 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1883#false} {1883#false} #77#return; {1883#false} is VALID [2018-11-23 12:16:53,859 INFO L273 TraceCheckUtils]: 40: Hoare triple {1883#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {1883#false} is VALID [2018-11-23 12:16:53,859 INFO L273 TraceCheckUtils]: 41: Hoare triple {1883#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {1883#false} is VALID [2018-11-23 12:16:53,859 INFO L273 TraceCheckUtils]: 42: Hoare triple {1883#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {1883#false} is VALID [2018-11-23 12:16:53,859 INFO L273 TraceCheckUtils]: 43: Hoare triple {1883#false} assume !(~i~2 < 59); {1883#false} is VALID [2018-11-23 12:16:53,859 INFO L273 TraceCheckUtils]: 44: Hoare triple {1883#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {1883#false} is VALID [2018-11-23 12:16:53,859 INFO L256 TraceCheckUtils]: 45: Hoare triple {1883#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {1883#false} is VALID [2018-11-23 12:16:53,860 INFO L273 TraceCheckUtils]: 46: Hoare triple {1883#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1883#false} is VALID [2018-11-23 12:16:53,860 INFO L273 TraceCheckUtils]: 47: Hoare triple {1883#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1883#false} is VALID [2018-11-23 12:16:53,860 INFO L273 TraceCheckUtils]: 48: Hoare triple {1883#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1883#false} is VALID [2018-11-23 12:16:53,860 INFO L273 TraceCheckUtils]: 49: Hoare triple {1883#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1883#false} is VALID [2018-11-23 12:16:53,860 INFO L273 TraceCheckUtils]: 50: Hoare triple {1883#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1883#false} is VALID [2018-11-23 12:16:53,860 INFO L273 TraceCheckUtils]: 51: Hoare triple {1883#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {1883#false} is VALID [2018-11-23 12:16:53,860 INFO L273 TraceCheckUtils]: 52: Hoare triple {1883#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1883#false} is VALID [2018-11-23 12:16:53,860 INFO L273 TraceCheckUtils]: 53: Hoare triple {1883#false} assume !(~i~0 < 60); {1883#false} is VALID [2018-11-23 12:16:53,861 INFO L273 TraceCheckUtils]: 54: Hoare triple {1883#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {1883#false} is VALID [2018-11-23 12:16:53,861 INFO L273 TraceCheckUtils]: 55: Hoare triple {1883#false} assume true; {1883#false} is VALID [2018-11-23 12:16:53,861 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {1883#false} {1883#false} #79#return; {1883#false} is VALID [2018-11-23 12:16:53,861 INFO L273 TraceCheckUtils]: 57: Hoare triple {1883#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {1883#false} is VALID [2018-11-23 12:16:53,861 INFO L273 TraceCheckUtils]: 58: Hoare triple {1883#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1883#false} is VALID [2018-11-23 12:16:53,861 INFO L273 TraceCheckUtils]: 59: Hoare triple {1883#false} assume !false; {1883#false} is VALID [2018-11-23 12:16:53,863 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-23 12:16:53,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:53,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:16:53,884 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-11-23 12:16:53,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:53,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:16:53,934 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:53,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:16:53,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:16:53,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:16:53,935 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 8 states. [2018-11-23 12:16:54,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:54,227 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-11-23 12:16:54,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:16:54,228 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-11-23 12:16:54,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:54,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:16:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2018-11-23 12:16:54,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:16:54,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2018-11-23 12:16:54,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 66 transitions. [2018-11-23 12:16:54,331 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-23 12:16:54,333 INFO L225 Difference]: With dead ends: 66 [2018-11-23 12:16:54,333 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:16:54,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:16:54,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:16:54,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-23 12:16:54,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:54,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2018-11-23 12:16:54,359 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2018-11-23 12:16:54,359 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2018-11-23 12:16:54,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:54,361 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-23 12:16:54,361 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 12:16:54,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:54,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:54,362 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2018-11-23 12:16:54,362 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2018-11-23 12:16:54,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:54,364 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-23 12:16:54,364 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-23 12:16:54,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:54,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:54,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:54,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:54,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:16:54,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-23 12:16:54,367 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 60 [2018-11-23 12:16:54,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:54,367 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-23 12:16:54,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:16:54,367 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-23 12:16:54,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 12:16:54,368 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:54,368 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:54,368 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:54,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:54,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1389751938, now seen corresponding path program 5 times [2018-11-23 12:16:54,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:54,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:54,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:54,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:54,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:54,677 INFO L256 TraceCheckUtils]: 0: Hoare triple {2307#true} call ULTIMATE.init(); {2307#true} is VALID [2018-11-23 12:16:54,678 INFO L273 TraceCheckUtils]: 1: Hoare triple {2307#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2307#true} is VALID [2018-11-23 12:16:54,678 INFO L273 TraceCheckUtils]: 2: Hoare triple {2307#true} assume true; {2307#true} is VALID [2018-11-23 12:16:54,678 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2307#true} {2307#true} #71#return; {2307#true} is VALID [2018-11-23 12:16:54,678 INFO L256 TraceCheckUtils]: 4: Hoare triple {2307#true} call #t~ret14 := main(); {2307#true} is VALID [2018-11-23 12:16:54,679 INFO L273 TraceCheckUtils]: 5: Hoare triple {2307#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2309#(= main_~i~1 0)} is VALID [2018-11-23 12:16:54,680 INFO L273 TraceCheckUtils]: 6: Hoare triple {2309#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2309#(= main_~i~1 0)} is VALID [2018-11-23 12:16:54,680 INFO L273 TraceCheckUtils]: 7: Hoare triple {2309#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2310#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:54,681 INFO L273 TraceCheckUtils]: 8: Hoare triple {2310#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2310#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:54,681 INFO L273 TraceCheckUtils]: 9: Hoare triple {2310#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2311#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:54,682 INFO L273 TraceCheckUtils]: 10: Hoare triple {2311#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2311#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:54,682 INFO L273 TraceCheckUtils]: 11: Hoare triple {2311#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2312#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:54,683 INFO L273 TraceCheckUtils]: 12: Hoare triple {2312#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2312#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:54,683 INFO L273 TraceCheckUtils]: 13: Hoare triple {2312#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2313#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:54,684 INFO L273 TraceCheckUtils]: 14: Hoare triple {2313#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2313#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:54,685 INFO L273 TraceCheckUtils]: 15: Hoare triple {2313#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2314#(<= main_~i~1 5)} is VALID [2018-11-23 12:16:54,685 INFO L273 TraceCheckUtils]: 16: Hoare triple {2314#(<= main_~i~1 5)} assume !(~i~1 < 60); {2308#false} is VALID [2018-11-23 12:16:54,686 INFO L256 TraceCheckUtils]: 17: Hoare triple {2308#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {2307#true} is VALID [2018-11-23 12:16:54,686 INFO L273 TraceCheckUtils]: 18: Hoare triple {2307#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2307#true} is VALID [2018-11-23 12:16:54,686 INFO L273 TraceCheckUtils]: 19: Hoare triple {2307#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2307#true} is VALID [2018-11-23 12:16:54,686 INFO L273 TraceCheckUtils]: 20: Hoare triple {2307#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2307#true} is VALID [2018-11-23 12:16:54,687 INFO L273 TraceCheckUtils]: 21: Hoare triple {2307#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2307#true} is VALID [2018-11-23 12:16:54,687 INFO L273 TraceCheckUtils]: 22: Hoare triple {2307#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2307#true} is VALID [2018-11-23 12:16:54,687 INFO L273 TraceCheckUtils]: 23: Hoare triple {2307#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2307#true} is VALID [2018-11-23 12:16:54,687 INFO L273 TraceCheckUtils]: 24: Hoare triple {2307#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2307#true} is VALID [2018-11-23 12:16:54,688 INFO L273 TraceCheckUtils]: 25: Hoare triple {2307#true} assume !(~i~0 < 60); {2307#true} is VALID [2018-11-23 12:16:54,688 INFO L273 TraceCheckUtils]: 26: Hoare triple {2307#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2307#true} is VALID [2018-11-23 12:16:54,688 INFO L273 TraceCheckUtils]: 27: Hoare triple {2307#true} assume true; {2307#true} is VALID [2018-11-23 12:16:54,688 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {2307#true} {2308#false} #75#return; {2308#false} is VALID [2018-11-23 12:16:54,688 INFO L273 TraceCheckUtils]: 29: Hoare triple {2308#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2308#false} is VALID [2018-11-23 12:16:54,689 INFO L256 TraceCheckUtils]: 30: Hoare triple {2308#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {2307#true} is VALID [2018-11-23 12:16:54,689 INFO L273 TraceCheckUtils]: 31: Hoare triple {2307#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2307#true} is VALID [2018-11-23 12:16:54,689 INFO L273 TraceCheckUtils]: 32: Hoare triple {2307#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2307#true} is VALID [2018-11-23 12:16:54,689 INFO L273 TraceCheckUtils]: 33: Hoare triple {2307#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2307#true} is VALID [2018-11-23 12:16:54,690 INFO L273 TraceCheckUtils]: 34: Hoare triple {2307#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2307#true} is VALID [2018-11-23 12:16:54,690 INFO L273 TraceCheckUtils]: 35: Hoare triple {2307#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2307#true} is VALID [2018-11-23 12:16:54,690 INFO L273 TraceCheckUtils]: 36: Hoare triple {2307#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2307#true} is VALID [2018-11-23 12:16:54,690 INFO L273 TraceCheckUtils]: 37: Hoare triple {2307#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2307#true} is VALID [2018-11-23 12:16:54,690 INFO L273 TraceCheckUtils]: 38: Hoare triple {2307#true} assume !(~i~0 < 60); {2307#true} is VALID [2018-11-23 12:16:54,691 INFO L273 TraceCheckUtils]: 39: Hoare triple {2307#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2307#true} is VALID [2018-11-23 12:16:54,691 INFO L273 TraceCheckUtils]: 40: Hoare triple {2307#true} assume true; {2307#true} is VALID [2018-11-23 12:16:54,691 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {2307#true} {2308#false} #77#return; {2308#false} is VALID [2018-11-23 12:16:54,691 INFO L273 TraceCheckUtils]: 42: Hoare triple {2308#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {2308#false} is VALID [2018-11-23 12:16:54,691 INFO L273 TraceCheckUtils]: 43: Hoare triple {2308#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {2308#false} is VALID [2018-11-23 12:16:54,691 INFO L273 TraceCheckUtils]: 44: Hoare triple {2308#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {2308#false} is VALID [2018-11-23 12:16:54,691 INFO L273 TraceCheckUtils]: 45: Hoare triple {2308#false} assume !(~i~2 < 59); {2308#false} is VALID [2018-11-23 12:16:54,691 INFO L273 TraceCheckUtils]: 46: Hoare triple {2308#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {2308#false} is VALID [2018-11-23 12:16:54,692 INFO L256 TraceCheckUtils]: 47: Hoare triple {2308#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {2307#true} is VALID [2018-11-23 12:16:54,692 INFO L273 TraceCheckUtils]: 48: Hoare triple {2307#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2307#true} is VALID [2018-11-23 12:16:54,692 INFO L273 TraceCheckUtils]: 49: Hoare triple {2307#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2307#true} is VALID [2018-11-23 12:16:54,692 INFO L273 TraceCheckUtils]: 50: Hoare triple {2307#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2307#true} is VALID [2018-11-23 12:16:54,692 INFO L273 TraceCheckUtils]: 51: Hoare triple {2307#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2307#true} is VALID [2018-11-23 12:16:54,692 INFO L273 TraceCheckUtils]: 52: Hoare triple {2307#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2307#true} is VALID [2018-11-23 12:16:54,692 INFO L273 TraceCheckUtils]: 53: Hoare triple {2307#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2307#true} is VALID [2018-11-23 12:16:54,693 INFO L273 TraceCheckUtils]: 54: Hoare triple {2307#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2307#true} is VALID [2018-11-23 12:16:54,693 INFO L273 TraceCheckUtils]: 55: Hoare triple {2307#true} assume !(~i~0 < 60); {2307#true} is VALID [2018-11-23 12:16:54,693 INFO L273 TraceCheckUtils]: 56: Hoare triple {2307#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2307#true} is VALID [2018-11-23 12:16:54,693 INFO L273 TraceCheckUtils]: 57: Hoare triple {2307#true} assume true; {2307#true} is VALID [2018-11-23 12:16:54,693 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {2307#true} {2308#false} #79#return; {2308#false} is VALID [2018-11-23 12:16:54,693 INFO L273 TraceCheckUtils]: 59: Hoare triple {2308#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {2308#false} is VALID [2018-11-23 12:16:54,693 INFO L273 TraceCheckUtils]: 60: Hoare triple {2308#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2308#false} is VALID [2018-11-23 12:16:54,694 INFO L273 TraceCheckUtils]: 61: Hoare triple {2308#false} assume !false; {2308#false} is VALID [2018-11-23 12:16:54,695 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-23 12:16:54,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:54,696 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:16:54,706 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:16:54,793 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-11-23 12:16:54,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:54,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:54,968 INFO L256 TraceCheckUtils]: 0: Hoare triple {2307#true} call ULTIMATE.init(); {2307#true} is VALID [2018-11-23 12:16:54,969 INFO L273 TraceCheckUtils]: 1: Hoare triple {2307#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2307#true} is VALID [2018-11-23 12:16:54,969 INFO L273 TraceCheckUtils]: 2: Hoare triple {2307#true} assume true; {2307#true} is VALID [2018-11-23 12:16:54,970 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2307#true} {2307#true} #71#return; {2307#true} is VALID [2018-11-23 12:16:54,970 INFO L256 TraceCheckUtils]: 4: Hoare triple {2307#true} call #t~ret14 := main(); {2307#true} is VALID [2018-11-23 12:16:54,970 INFO L273 TraceCheckUtils]: 5: Hoare triple {2307#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2307#true} is VALID [2018-11-23 12:16:54,971 INFO L273 TraceCheckUtils]: 6: Hoare triple {2307#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2307#true} is VALID [2018-11-23 12:16:54,971 INFO L273 TraceCheckUtils]: 7: Hoare triple {2307#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2307#true} is VALID [2018-11-23 12:16:54,971 INFO L273 TraceCheckUtils]: 8: Hoare triple {2307#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2307#true} is VALID [2018-11-23 12:16:54,971 INFO L273 TraceCheckUtils]: 9: Hoare triple {2307#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2307#true} is VALID [2018-11-23 12:16:54,972 INFO L273 TraceCheckUtils]: 10: Hoare triple {2307#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2307#true} is VALID [2018-11-23 12:16:54,972 INFO L273 TraceCheckUtils]: 11: Hoare triple {2307#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2307#true} is VALID [2018-11-23 12:16:54,972 INFO L273 TraceCheckUtils]: 12: Hoare triple {2307#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2307#true} is VALID [2018-11-23 12:16:54,972 INFO L273 TraceCheckUtils]: 13: Hoare triple {2307#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2307#true} is VALID [2018-11-23 12:16:54,973 INFO L273 TraceCheckUtils]: 14: Hoare triple {2307#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2307#true} is VALID [2018-11-23 12:16:54,973 INFO L273 TraceCheckUtils]: 15: Hoare triple {2307#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2307#true} is VALID [2018-11-23 12:16:54,973 INFO L273 TraceCheckUtils]: 16: Hoare triple {2307#true} assume !(~i~1 < 60); {2307#true} is VALID [2018-11-23 12:16:54,973 INFO L256 TraceCheckUtils]: 17: Hoare triple {2307#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {2307#true} is VALID [2018-11-23 12:16:54,988 INFO L273 TraceCheckUtils]: 18: Hoare triple {2307#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2372#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:54,999 INFO L273 TraceCheckUtils]: 19: Hoare triple {2372#(<= sep_~i~0 0)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2372#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:54,999 INFO L273 TraceCheckUtils]: 20: Hoare triple {2372#(<= sep_~i~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2372#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:55,000 INFO L273 TraceCheckUtils]: 21: Hoare triple {2372#(<= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2382#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:55,000 INFO L273 TraceCheckUtils]: 22: Hoare triple {2382#(<= sep_~i~0 1)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2382#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:55,001 INFO L273 TraceCheckUtils]: 23: Hoare triple {2382#(<= sep_~i~0 1)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2382#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:55,001 INFO L273 TraceCheckUtils]: 24: Hoare triple {2382#(<= sep_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2392#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:55,001 INFO L273 TraceCheckUtils]: 25: Hoare triple {2392#(<= sep_~i~0 2)} assume !(~i~0 < 60); {2308#false} is VALID [2018-11-23 12:16:55,002 INFO L273 TraceCheckUtils]: 26: Hoare triple {2308#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2308#false} is VALID [2018-11-23 12:16:55,002 INFO L273 TraceCheckUtils]: 27: Hoare triple {2308#false} assume true; {2308#false} is VALID [2018-11-23 12:16:55,002 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {2308#false} {2307#true} #75#return; {2308#false} is VALID [2018-11-23 12:16:55,002 INFO L273 TraceCheckUtils]: 29: Hoare triple {2308#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2308#false} is VALID [2018-11-23 12:16:55,002 INFO L256 TraceCheckUtils]: 30: Hoare triple {2308#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {2308#false} is VALID [2018-11-23 12:16:55,002 INFO L273 TraceCheckUtils]: 31: Hoare triple {2308#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2308#false} is VALID [2018-11-23 12:16:55,002 INFO L273 TraceCheckUtils]: 32: Hoare triple {2308#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2308#false} is VALID [2018-11-23 12:16:55,002 INFO L273 TraceCheckUtils]: 33: Hoare triple {2308#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2308#false} is VALID [2018-11-23 12:16:55,003 INFO L273 TraceCheckUtils]: 34: Hoare triple {2308#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2308#false} is VALID [2018-11-23 12:16:55,003 INFO L273 TraceCheckUtils]: 35: Hoare triple {2308#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2308#false} is VALID [2018-11-23 12:16:55,003 INFO L273 TraceCheckUtils]: 36: Hoare triple {2308#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2308#false} is VALID [2018-11-23 12:16:55,003 INFO L273 TraceCheckUtils]: 37: Hoare triple {2308#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2308#false} is VALID [2018-11-23 12:16:55,003 INFO L273 TraceCheckUtils]: 38: Hoare triple {2308#false} assume !(~i~0 < 60); {2308#false} is VALID [2018-11-23 12:16:55,003 INFO L273 TraceCheckUtils]: 39: Hoare triple {2308#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2308#false} is VALID [2018-11-23 12:16:55,003 INFO L273 TraceCheckUtils]: 40: Hoare triple {2308#false} assume true; {2308#false} is VALID [2018-11-23 12:16:55,003 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {2308#false} {2308#false} #77#return; {2308#false} is VALID [2018-11-23 12:16:55,004 INFO L273 TraceCheckUtils]: 42: Hoare triple {2308#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {2308#false} is VALID [2018-11-23 12:16:55,004 INFO L273 TraceCheckUtils]: 43: Hoare triple {2308#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {2308#false} is VALID [2018-11-23 12:16:55,004 INFO L273 TraceCheckUtils]: 44: Hoare triple {2308#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {2308#false} is VALID [2018-11-23 12:16:55,004 INFO L273 TraceCheckUtils]: 45: Hoare triple {2308#false} assume !(~i~2 < 59); {2308#false} is VALID [2018-11-23 12:16:55,004 INFO L273 TraceCheckUtils]: 46: Hoare triple {2308#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {2308#false} is VALID [2018-11-23 12:16:55,005 INFO L256 TraceCheckUtils]: 47: Hoare triple {2308#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {2308#false} is VALID [2018-11-23 12:16:55,005 INFO L273 TraceCheckUtils]: 48: Hoare triple {2308#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2308#false} is VALID [2018-11-23 12:16:55,005 INFO L273 TraceCheckUtils]: 49: Hoare triple {2308#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2308#false} is VALID [2018-11-23 12:16:55,005 INFO L273 TraceCheckUtils]: 50: Hoare triple {2308#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2308#false} is VALID [2018-11-23 12:16:55,005 INFO L273 TraceCheckUtils]: 51: Hoare triple {2308#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2308#false} is VALID [2018-11-23 12:16:55,006 INFO L273 TraceCheckUtils]: 52: Hoare triple {2308#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2308#false} is VALID [2018-11-23 12:16:55,006 INFO L273 TraceCheckUtils]: 53: Hoare triple {2308#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2308#false} is VALID [2018-11-23 12:16:55,006 INFO L273 TraceCheckUtils]: 54: Hoare triple {2308#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2308#false} is VALID [2018-11-23 12:16:55,006 INFO L273 TraceCheckUtils]: 55: Hoare triple {2308#false} assume !(~i~0 < 60); {2308#false} is VALID [2018-11-23 12:16:55,006 INFO L273 TraceCheckUtils]: 56: Hoare triple {2308#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2308#false} is VALID [2018-11-23 12:16:55,006 INFO L273 TraceCheckUtils]: 57: Hoare triple {2308#false} assume true; {2308#false} is VALID [2018-11-23 12:16:55,006 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {2308#false} {2308#false} #79#return; {2308#false} is VALID [2018-11-23 12:16:55,007 INFO L273 TraceCheckUtils]: 59: Hoare triple {2308#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {2308#false} is VALID [2018-11-23 12:16:55,007 INFO L273 TraceCheckUtils]: 60: Hoare triple {2308#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2308#false} is VALID [2018-11-23 12:16:55,007 INFO L273 TraceCheckUtils]: 61: Hoare triple {2308#false} assume !false; {2308#false} is VALID [2018-11-23 12:16:55,010 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 36 proven. 5 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-23 12:16:55,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:55,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-23 12:16:55,030 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-11-23 12:16:55,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:55,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:16:55,108 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:55,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:16:55,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:16:55,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:16:55,109 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 11 states. [2018-11-23 12:16:55,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:55,683 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2018-11-23 12:16:55,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:16:55,683 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-11-23 12:16:55,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:55,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:16:55,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2018-11-23 12:16:55,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:16:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2018-11-23 12:16:55,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 84 transitions. [2018-11-23 12:16:55,830 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-23 12:16:55,832 INFO L225 Difference]: With dead ends: 73 [2018-11-23 12:16:55,832 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:16:55,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:16:55,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:16:55,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-11-23 12:16:55,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:55,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 46 states. [2018-11-23 12:16:55,878 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 46 states. [2018-11-23 12:16:55,878 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 46 states. [2018-11-23 12:16:55,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:55,880 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-23 12:16:55,880 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-11-23 12:16:55,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:55,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:55,880 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 49 states. [2018-11-23 12:16:55,880 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 49 states. [2018-11-23 12:16:55,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:55,882 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-23 12:16:55,882 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-11-23 12:16:55,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:55,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:55,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:55,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:55,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:16:55,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-11-23 12:16:55,885 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 62 [2018-11-23 12:16:55,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:55,885 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-11-23 12:16:55,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:16:55,886 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-23 12:16:55,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 12:16:55,886 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:55,887 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:55,887 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:55,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:55,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1972208203, now seen corresponding path program 6 times [2018-11-23 12:16:55,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:55,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:55,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:55,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:55,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:56,129 INFO L256 TraceCheckUtils]: 0: Hoare triple {2771#true} call ULTIMATE.init(); {2771#true} is VALID [2018-11-23 12:16:56,130 INFO L273 TraceCheckUtils]: 1: Hoare triple {2771#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2771#true} is VALID [2018-11-23 12:16:56,130 INFO L273 TraceCheckUtils]: 2: Hoare triple {2771#true} assume true; {2771#true} is VALID [2018-11-23 12:16:56,130 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2771#true} {2771#true} #71#return; {2771#true} is VALID [2018-11-23 12:16:56,131 INFO L256 TraceCheckUtils]: 4: Hoare triple {2771#true} call #t~ret14 := main(); {2771#true} is VALID [2018-11-23 12:16:56,131 INFO L273 TraceCheckUtils]: 5: Hoare triple {2771#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2773#(= main_~i~1 0)} is VALID [2018-11-23 12:16:56,132 INFO L273 TraceCheckUtils]: 6: Hoare triple {2773#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2773#(= main_~i~1 0)} is VALID [2018-11-23 12:16:56,132 INFO L273 TraceCheckUtils]: 7: Hoare triple {2773#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2774#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:56,133 INFO L273 TraceCheckUtils]: 8: Hoare triple {2774#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2774#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:56,133 INFO L273 TraceCheckUtils]: 9: Hoare triple {2774#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2775#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:56,134 INFO L273 TraceCheckUtils]: 10: Hoare triple {2775#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2775#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:56,138 INFO L273 TraceCheckUtils]: 11: Hoare triple {2775#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2776#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:56,139 INFO L273 TraceCheckUtils]: 12: Hoare triple {2776#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2776#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:56,140 INFO L273 TraceCheckUtils]: 13: Hoare triple {2776#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2777#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:56,140 INFO L273 TraceCheckUtils]: 14: Hoare triple {2777#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2777#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:56,140 INFO L273 TraceCheckUtils]: 15: Hoare triple {2777#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2778#(<= main_~i~1 5)} is VALID [2018-11-23 12:16:56,141 INFO L273 TraceCheckUtils]: 16: Hoare triple {2778#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2778#(<= main_~i~1 5)} is VALID [2018-11-23 12:16:56,141 INFO L273 TraceCheckUtils]: 17: Hoare triple {2778#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2779#(<= main_~i~1 6)} is VALID [2018-11-23 12:16:56,142 INFO L273 TraceCheckUtils]: 18: Hoare triple {2779#(<= main_~i~1 6)} assume !(~i~1 < 60); {2772#false} is VALID [2018-11-23 12:16:56,142 INFO L256 TraceCheckUtils]: 19: Hoare triple {2772#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {2771#true} is VALID [2018-11-23 12:16:56,142 INFO L273 TraceCheckUtils]: 20: Hoare triple {2771#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2771#true} is VALID [2018-11-23 12:16:56,142 INFO L273 TraceCheckUtils]: 21: Hoare triple {2771#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2771#true} is VALID [2018-11-23 12:16:56,142 INFO L273 TraceCheckUtils]: 22: Hoare triple {2771#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2771#true} is VALID [2018-11-23 12:16:56,142 INFO L273 TraceCheckUtils]: 23: Hoare triple {2771#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2771#true} is VALID [2018-11-23 12:16:56,142 INFO L273 TraceCheckUtils]: 24: Hoare triple {2771#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2771#true} is VALID [2018-11-23 12:16:56,143 INFO L273 TraceCheckUtils]: 25: Hoare triple {2771#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2771#true} is VALID [2018-11-23 12:16:56,143 INFO L273 TraceCheckUtils]: 26: Hoare triple {2771#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2771#true} is VALID [2018-11-23 12:16:56,143 INFO L273 TraceCheckUtils]: 27: Hoare triple {2771#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2771#true} is VALID [2018-11-23 12:16:56,143 INFO L273 TraceCheckUtils]: 28: Hoare triple {2771#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2771#true} is VALID [2018-11-23 12:16:56,143 INFO L273 TraceCheckUtils]: 29: Hoare triple {2771#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2771#true} is VALID [2018-11-23 12:16:56,143 INFO L273 TraceCheckUtils]: 30: Hoare triple {2771#true} assume !(~i~0 < 60); {2771#true} is VALID [2018-11-23 12:16:56,143 INFO L273 TraceCheckUtils]: 31: Hoare triple {2771#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2771#true} is VALID [2018-11-23 12:16:56,143 INFO L273 TraceCheckUtils]: 32: Hoare triple {2771#true} assume true; {2771#true} is VALID [2018-11-23 12:16:56,144 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {2771#true} {2772#false} #75#return; {2772#false} is VALID [2018-11-23 12:16:56,144 INFO L273 TraceCheckUtils]: 34: Hoare triple {2772#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2772#false} is VALID [2018-11-23 12:16:56,144 INFO L256 TraceCheckUtils]: 35: Hoare triple {2772#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {2771#true} is VALID [2018-11-23 12:16:56,144 INFO L273 TraceCheckUtils]: 36: Hoare triple {2771#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2771#true} is VALID [2018-11-23 12:16:56,144 INFO L273 TraceCheckUtils]: 37: Hoare triple {2771#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2771#true} is VALID [2018-11-23 12:16:56,144 INFO L273 TraceCheckUtils]: 38: Hoare triple {2771#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2771#true} is VALID [2018-11-23 12:16:56,144 INFO L273 TraceCheckUtils]: 39: Hoare triple {2771#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2771#true} is VALID [2018-11-23 12:16:56,144 INFO L273 TraceCheckUtils]: 40: Hoare triple {2771#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2771#true} is VALID [2018-11-23 12:16:56,145 INFO L273 TraceCheckUtils]: 41: Hoare triple {2771#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2771#true} is VALID [2018-11-23 12:16:56,145 INFO L273 TraceCheckUtils]: 42: Hoare triple {2771#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2771#true} is VALID [2018-11-23 12:16:56,145 INFO L273 TraceCheckUtils]: 43: Hoare triple {2771#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2771#true} is VALID [2018-11-23 12:16:56,145 INFO L273 TraceCheckUtils]: 44: Hoare triple {2771#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2771#true} is VALID [2018-11-23 12:16:56,145 INFO L273 TraceCheckUtils]: 45: Hoare triple {2771#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2771#true} is VALID [2018-11-23 12:16:56,145 INFO L273 TraceCheckUtils]: 46: Hoare triple {2771#true} assume !(~i~0 < 60); {2771#true} is VALID [2018-11-23 12:16:56,145 INFO L273 TraceCheckUtils]: 47: Hoare triple {2771#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2771#true} is VALID [2018-11-23 12:16:56,146 INFO L273 TraceCheckUtils]: 48: Hoare triple {2771#true} assume true; {2771#true} is VALID [2018-11-23 12:16:56,146 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {2771#true} {2772#false} #77#return; {2772#false} is VALID [2018-11-23 12:16:56,146 INFO L273 TraceCheckUtils]: 50: Hoare triple {2772#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {2772#false} is VALID [2018-11-23 12:16:56,146 INFO L273 TraceCheckUtils]: 51: Hoare triple {2772#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {2772#false} is VALID [2018-11-23 12:16:56,146 INFO L273 TraceCheckUtils]: 52: Hoare triple {2772#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {2772#false} is VALID [2018-11-23 12:16:56,146 INFO L273 TraceCheckUtils]: 53: Hoare triple {2772#false} assume !(~i~2 < 59); {2772#false} is VALID [2018-11-23 12:16:56,146 INFO L273 TraceCheckUtils]: 54: Hoare triple {2772#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {2772#false} is VALID [2018-11-23 12:16:56,146 INFO L256 TraceCheckUtils]: 55: Hoare triple {2772#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {2771#true} is VALID [2018-11-23 12:16:56,147 INFO L273 TraceCheckUtils]: 56: Hoare triple {2771#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2771#true} is VALID [2018-11-23 12:16:56,147 INFO L273 TraceCheckUtils]: 57: Hoare triple {2771#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2771#true} is VALID [2018-11-23 12:16:56,147 INFO L273 TraceCheckUtils]: 58: Hoare triple {2771#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2771#true} is VALID [2018-11-23 12:16:56,147 INFO L273 TraceCheckUtils]: 59: Hoare triple {2771#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2771#true} is VALID [2018-11-23 12:16:56,147 INFO L273 TraceCheckUtils]: 60: Hoare triple {2771#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2771#true} is VALID [2018-11-23 12:16:56,147 INFO L273 TraceCheckUtils]: 61: Hoare triple {2771#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2771#true} is VALID [2018-11-23 12:16:56,147 INFO L273 TraceCheckUtils]: 62: Hoare triple {2771#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2771#true} is VALID [2018-11-23 12:16:56,147 INFO L273 TraceCheckUtils]: 63: Hoare triple {2771#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2771#true} is VALID [2018-11-23 12:16:56,148 INFO L273 TraceCheckUtils]: 64: Hoare triple {2771#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2771#true} is VALID [2018-11-23 12:16:56,148 INFO L273 TraceCheckUtils]: 65: Hoare triple {2771#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2771#true} is VALID [2018-11-23 12:16:56,148 INFO L273 TraceCheckUtils]: 66: Hoare triple {2771#true} assume !(~i~0 < 60); {2771#true} is VALID [2018-11-23 12:16:56,148 INFO L273 TraceCheckUtils]: 67: Hoare triple {2771#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2771#true} is VALID [2018-11-23 12:16:56,148 INFO L273 TraceCheckUtils]: 68: Hoare triple {2771#true} assume true; {2771#true} is VALID [2018-11-23 12:16:56,148 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {2771#true} {2772#false} #79#return; {2772#false} is VALID [2018-11-23 12:16:56,148 INFO L273 TraceCheckUtils]: 70: Hoare triple {2772#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {2772#false} is VALID [2018-11-23 12:16:56,148 INFO L273 TraceCheckUtils]: 71: Hoare triple {2772#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2772#false} is VALID [2018-11-23 12:16:56,149 INFO L273 TraceCheckUtils]: 72: Hoare triple {2772#false} assume !false; {2772#false} is VALID [2018-11-23 12:16:56,152 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-11-23 12:16:56,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:56,152 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:16:56,169 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:16:56,235 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 12:16:56,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:56,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:56,468 INFO L256 TraceCheckUtils]: 0: Hoare triple {2771#true} call ULTIMATE.init(); {2771#true} is VALID [2018-11-23 12:16:56,468 INFO L273 TraceCheckUtils]: 1: Hoare triple {2771#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2771#true} is VALID [2018-11-23 12:16:56,468 INFO L273 TraceCheckUtils]: 2: Hoare triple {2771#true} assume true; {2771#true} is VALID [2018-11-23 12:16:56,469 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2771#true} {2771#true} #71#return; {2771#true} is VALID [2018-11-23 12:16:56,469 INFO L256 TraceCheckUtils]: 4: Hoare triple {2771#true} call #t~ret14 := main(); {2771#true} is VALID [2018-11-23 12:16:56,469 INFO L273 TraceCheckUtils]: 5: Hoare triple {2771#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2771#true} is VALID [2018-11-23 12:16:56,469 INFO L273 TraceCheckUtils]: 6: Hoare triple {2771#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2771#true} is VALID [2018-11-23 12:16:56,470 INFO L273 TraceCheckUtils]: 7: Hoare triple {2771#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2771#true} is VALID [2018-11-23 12:16:56,470 INFO L273 TraceCheckUtils]: 8: Hoare triple {2771#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2771#true} is VALID [2018-11-23 12:16:56,470 INFO L273 TraceCheckUtils]: 9: Hoare triple {2771#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2771#true} is VALID [2018-11-23 12:16:56,470 INFO L273 TraceCheckUtils]: 10: Hoare triple {2771#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2771#true} is VALID [2018-11-23 12:16:56,470 INFO L273 TraceCheckUtils]: 11: Hoare triple {2771#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2771#true} is VALID [2018-11-23 12:16:56,471 INFO L273 TraceCheckUtils]: 12: Hoare triple {2771#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2771#true} is VALID [2018-11-23 12:16:56,471 INFO L273 TraceCheckUtils]: 13: Hoare triple {2771#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2771#true} is VALID [2018-11-23 12:16:56,471 INFO L273 TraceCheckUtils]: 14: Hoare triple {2771#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2771#true} is VALID [2018-11-23 12:16:56,471 INFO L273 TraceCheckUtils]: 15: Hoare triple {2771#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2771#true} is VALID [2018-11-23 12:16:56,471 INFO L273 TraceCheckUtils]: 16: Hoare triple {2771#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2771#true} is VALID [2018-11-23 12:16:56,472 INFO L273 TraceCheckUtils]: 17: Hoare triple {2771#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2771#true} is VALID [2018-11-23 12:16:56,472 INFO L273 TraceCheckUtils]: 18: Hoare triple {2771#true} assume !(~i~1 < 60); {2771#true} is VALID [2018-11-23 12:16:56,472 INFO L256 TraceCheckUtils]: 19: Hoare triple {2771#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {2771#true} is VALID [2018-11-23 12:16:56,472 INFO L273 TraceCheckUtils]: 20: Hoare triple {2771#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2771#true} is VALID [2018-11-23 12:16:56,472 INFO L273 TraceCheckUtils]: 21: Hoare triple {2771#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2771#true} is VALID [2018-11-23 12:16:56,472 INFO L273 TraceCheckUtils]: 22: Hoare triple {2771#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2771#true} is VALID [2018-11-23 12:16:56,473 INFO L273 TraceCheckUtils]: 23: Hoare triple {2771#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2771#true} is VALID [2018-11-23 12:16:56,473 INFO L273 TraceCheckUtils]: 24: Hoare triple {2771#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2771#true} is VALID [2018-11-23 12:16:56,473 INFO L273 TraceCheckUtils]: 25: Hoare triple {2771#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2771#true} is VALID [2018-11-23 12:16:56,473 INFO L273 TraceCheckUtils]: 26: Hoare triple {2771#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2771#true} is VALID [2018-11-23 12:16:56,473 INFO L273 TraceCheckUtils]: 27: Hoare triple {2771#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2771#true} is VALID [2018-11-23 12:16:56,474 INFO L273 TraceCheckUtils]: 28: Hoare triple {2771#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2771#true} is VALID [2018-11-23 12:16:56,474 INFO L273 TraceCheckUtils]: 29: Hoare triple {2771#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2771#true} is VALID [2018-11-23 12:16:56,474 INFO L273 TraceCheckUtils]: 30: Hoare triple {2771#true} assume !(~i~0 < 60); {2771#true} is VALID [2018-11-23 12:16:56,474 INFO L273 TraceCheckUtils]: 31: Hoare triple {2771#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2771#true} is VALID [2018-11-23 12:16:56,474 INFO L273 TraceCheckUtils]: 32: Hoare triple {2771#true} assume true; {2771#true} is VALID [2018-11-23 12:16:56,474 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {2771#true} {2771#true} #75#return; {2771#true} is VALID [2018-11-23 12:16:56,475 INFO L273 TraceCheckUtils]: 34: Hoare triple {2771#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2771#true} is VALID [2018-11-23 12:16:56,475 INFO L256 TraceCheckUtils]: 35: Hoare triple {2771#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {2771#true} is VALID [2018-11-23 12:16:56,475 INFO L273 TraceCheckUtils]: 36: Hoare triple {2771#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2771#true} is VALID [2018-11-23 12:16:56,475 INFO L273 TraceCheckUtils]: 37: Hoare triple {2771#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2771#true} is VALID [2018-11-23 12:16:56,475 INFO L273 TraceCheckUtils]: 38: Hoare triple {2771#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2771#true} is VALID [2018-11-23 12:16:56,476 INFO L273 TraceCheckUtils]: 39: Hoare triple {2771#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2771#true} is VALID [2018-11-23 12:16:56,476 INFO L273 TraceCheckUtils]: 40: Hoare triple {2771#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2771#true} is VALID [2018-11-23 12:16:56,476 INFO L273 TraceCheckUtils]: 41: Hoare triple {2771#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2771#true} is VALID [2018-11-23 12:16:56,476 INFO L273 TraceCheckUtils]: 42: Hoare triple {2771#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2771#true} is VALID [2018-11-23 12:16:56,476 INFO L273 TraceCheckUtils]: 43: Hoare triple {2771#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2771#true} is VALID [2018-11-23 12:16:56,477 INFO L273 TraceCheckUtils]: 44: Hoare triple {2771#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2771#true} is VALID [2018-11-23 12:16:56,477 INFO L273 TraceCheckUtils]: 45: Hoare triple {2771#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2771#true} is VALID [2018-11-23 12:16:56,477 INFO L273 TraceCheckUtils]: 46: Hoare triple {2771#true} assume !(~i~0 < 60); {2771#true} is VALID [2018-11-23 12:16:56,477 INFO L273 TraceCheckUtils]: 47: Hoare triple {2771#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2771#true} is VALID [2018-11-23 12:16:56,477 INFO L273 TraceCheckUtils]: 48: Hoare triple {2771#true} assume true; {2771#true} is VALID [2018-11-23 12:16:56,477 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {2771#true} {2771#true} #77#return; {2771#true} is VALID [2018-11-23 12:16:56,498 INFO L273 TraceCheckUtils]: 50: Hoare triple {2771#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {2933#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:56,512 INFO L273 TraceCheckUtils]: 51: Hoare triple {2933#(<= main_~i~2 0)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {2933#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:56,521 INFO L273 TraceCheckUtils]: 52: Hoare triple {2933#(<= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {2940#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:56,534 INFO L273 TraceCheckUtils]: 53: Hoare triple {2940#(<= main_~i~2 1)} assume !(~i~2 < 59); {2772#false} is VALID [2018-11-23 12:16:56,534 INFO L273 TraceCheckUtils]: 54: Hoare triple {2772#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {2772#false} is VALID [2018-11-23 12:16:56,534 INFO L256 TraceCheckUtils]: 55: Hoare triple {2772#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {2772#false} is VALID [2018-11-23 12:16:56,535 INFO L273 TraceCheckUtils]: 56: Hoare triple {2772#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2772#false} is VALID [2018-11-23 12:16:56,535 INFO L273 TraceCheckUtils]: 57: Hoare triple {2772#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2772#false} is VALID [2018-11-23 12:16:56,535 INFO L273 TraceCheckUtils]: 58: Hoare triple {2772#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2772#false} is VALID [2018-11-23 12:16:56,535 INFO L273 TraceCheckUtils]: 59: Hoare triple {2772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2772#false} is VALID [2018-11-23 12:16:56,535 INFO L273 TraceCheckUtils]: 60: Hoare triple {2772#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2772#false} is VALID [2018-11-23 12:16:56,535 INFO L273 TraceCheckUtils]: 61: Hoare triple {2772#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2772#false} is VALID [2018-11-23 12:16:56,536 INFO L273 TraceCheckUtils]: 62: Hoare triple {2772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2772#false} is VALID [2018-11-23 12:16:56,536 INFO L273 TraceCheckUtils]: 63: Hoare triple {2772#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2772#false} is VALID [2018-11-23 12:16:56,536 INFO L273 TraceCheckUtils]: 64: Hoare triple {2772#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2772#false} is VALID [2018-11-23 12:16:56,536 INFO L273 TraceCheckUtils]: 65: Hoare triple {2772#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2772#false} is VALID [2018-11-23 12:16:56,536 INFO L273 TraceCheckUtils]: 66: Hoare triple {2772#false} assume !(~i~0 < 60); {2772#false} is VALID [2018-11-23 12:16:56,536 INFO L273 TraceCheckUtils]: 67: Hoare triple {2772#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2772#false} is VALID [2018-11-23 12:16:56,537 INFO L273 TraceCheckUtils]: 68: Hoare triple {2772#false} assume true; {2772#false} is VALID [2018-11-23 12:16:56,537 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {2772#false} {2772#false} #79#return; {2772#false} is VALID [2018-11-23 12:16:56,537 INFO L273 TraceCheckUtils]: 70: Hoare triple {2772#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {2772#false} is VALID [2018-11-23 12:16:56,537 INFO L273 TraceCheckUtils]: 71: Hoare triple {2772#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2772#false} is VALID [2018-11-23 12:16:56,537 INFO L273 TraceCheckUtils]: 72: Hoare triple {2772#false} assume !false; {2772#false} is VALID [2018-11-23 12:16:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 76 proven. 1 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-23 12:16:56,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:56,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-11-23 12:16:56,562 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2018-11-23 12:16:56,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:56,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:16:56,653 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-23 12:16:56,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:16:56,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:16:56,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:16:56,654 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 11 states. [2018-11-23 12:16:57,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:57,138 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2018-11-23 12:16:57,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:16:57,138 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2018-11-23 12:16:57,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:57,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:16:57,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 75 transitions. [2018-11-23 12:16:57,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:16:57,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 75 transitions. [2018-11-23 12:16:57,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 75 transitions. [2018-11-23 12:16:57,240 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:57,242 INFO L225 Difference]: With dead ends: 79 [2018-11-23 12:16:57,242 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:16:57,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:16:57,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:16:57,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-11-23 12:16:57,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:57,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 50 states. [2018-11-23 12:16:57,275 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 50 states. [2018-11-23 12:16:57,275 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 50 states. [2018-11-23 12:16:57,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:57,277 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-11-23 12:16:57,277 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-23 12:16:57,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:57,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:57,278 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 52 states. [2018-11-23 12:16:57,278 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 52 states. [2018-11-23 12:16:57,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:57,279 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-11-23 12:16:57,280 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-23 12:16:57,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:57,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:57,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:57,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:57,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:16:57,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-11-23 12:16:57,282 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 73 [2018-11-23 12:16:57,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:57,282 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-11-23 12:16:57,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:16:57,283 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-11-23 12:16:57,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 12:16:57,283 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:57,284 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 7, 7, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:57,284 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:57,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:57,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1857138133, now seen corresponding path program 7 times [2018-11-23 12:16:57,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:57,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:57,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:57,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:57,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:57,500 INFO L256 TraceCheckUtils]: 0: Hoare triple {3289#true} call ULTIMATE.init(); {3289#true} is VALID [2018-11-23 12:16:57,500 INFO L273 TraceCheckUtils]: 1: Hoare triple {3289#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3289#true} is VALID [2018-11-23 12:16:57,500 INFO L273 TraceCheckUtils]: 2: Hoare triple {3289#true} assume true; {3289#true} is VALID [2018-11-23 12:16:57,500 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3289#true} {3289#true} #71#return; {3289#true} is VALID [2018-11-23 12:16:57,501 INFO L256 TraceCheckUtils]: 4: Hoare triple {3289#true} call #t~ret14 := main(); {3289#true} is VALID [2018-11-23 12:16:57,501 INFO L273 TraceCheckUtils]: 5: Hoare triple {3289#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3291#(= main_~i~1 0)} is VALID [2018-11-23 12:16:57,502 INFO L273 TraceCheckUtils]: 6: Hoare triple {3291#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3291#(= main_~i~1 0)} is VALID [2018-11-23 12:16:57,503 INFO L273 TraceCheckUtils]: 7: Hoare triple {3291#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3292#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:57,503 INFO L273 TraceCheckUtils]: 8: Hoare triple {3292#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3292#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:57,504 INFO L273 TraceCheckUtils]: 9: Hoare triple {3292#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3293#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:57,504 INFO L273 TraceCheckUtils]: 10: Hoare triple {3293#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3293#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:57,505 INFO L273 TraceCheckUtils]: 11: Hoare triple {3293#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3294#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:57,506 INFO L273 TraceCheckUtils]: 12: Hoare triple {3294#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3294#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:57,507 INFO L273 TraceCheckUtils]: 13: Hoare triple {3294#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3295#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:57,507 INFO L273 TraceCheckUtils]: 14: Hoare triple {3295#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3295#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:57,508 INFO L273 TraceCheckUtils]: 15: Hoare triple {3295#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3296#(<= main_~i~1 5)} is VALID [2018-11-23 12:16:57,508 INFO L273 TraceCheckUtils]: 16: Hoare triple {3296#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3296#(<= main_~i~1 5)} is VALID [2018-11-23 12:16:57,509 INFO L273 TraceCheckUtils]: 17: Hoare triple {3296#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3297#(<= main_~i~1 6)} is VALID [2018-11-23 12:16:57,510 INFO L273 TraceCheckUtils]: 18: Hoare triple {3297#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3297#(<= main_~i~1 6)} is VALID [2018-11-23 12:16:57,511 INFO L273 TraceCheckUtils]: 19: Hoare triple {3297#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3298#(<= main_~i~1 7)} is VALID [2018-11-23 12:16:57,511 INFO L273 TraceCheckUtils]: 20: Hoare triple {3298#(<= main_~i~1 7)} assume !(~i~1 < 60); {3290#false} is VALID [2018-11-23 12:16:57,511 INFO L256 TraceCheckUtils]: 21: Hoare triple {3290#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {3289#true} is VALID [2018-11-23 12:16:57,512 INFO L273 TraceCheckUtils]: 22: Hoare triple {3289#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3289#true} is VALID [2018-11-23 12:16:57,512 INFO L273 TraceCheckUtils]: 23: Hoare triple {3289#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3289#true} is VALID [2018-11-23 12:16:57,512 INFO L273 TraceCheckUtils]: 24: Hoare triple {3289#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3289#true} is VALID [2018-11-23 12:16:57,512 INFO L273 TraceCheckUtils]: 25: Hoare triple {3289#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3289#true} is VALID [2018-11-23 12:16:57,513 INFO L273 TraceCheckUtils]: 26: Hoare triple {3289#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3289#true} is VALID [2018-11-23 12:16:57,513 INFO L273 TraceCheckUtils]: 27: Hoare triple {3289#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3289#true} is VALID [2018-11-23 12:16:57,513 INFO L273 TraceCheckUtils]: 28: Hoare triple {3289#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3289#true} is VALID [2018-11-23 12:16:57,513 INFO L273 TraceCheckUtils]: 29: Hoare triple {3289#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3289#true} is VALID [2018-11-23 12:16:57,513 INFO L273 TraceCheckUtils]: 30: Hoare triple {3289#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3289#true} is VALID [2018-11-23 12:16:57,514 INFO L273 TraceCheckUtils]: 31: Hoare triple {3289#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3289#true} is VALID [2018-11-23 12:16:57,514 INFO L273 TraceCheckUtils]: 32: Hoare triple {3289#true} assume !(~i~0 < 60); {3289#true} is VALID [2018-11-23 12:16:57,514 INFO L273 TraceCheckUtils]: 33: Hoare triple {3289#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3289#true} is VALID [2018-11-23 12:16:57,514 INFO L273 TraceCheckUtils]: 34: Hoare triple {3289#true} assume true; {3289#true} is VALID [2018-11-23 12:16:57,514 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {3289#true} {3290#false} #75#return; {3290#false} is VALID [2018-11-23 12:16:57,515 INFO L273 TraceCheckUtils]: 36: Hoare triple {3290#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3290#false} is VALID [2018-11-23 12:16:57,515 INFO L256 TraceCheckUtils]: 37: Hoare triple {3290#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {3289#true} is VALID [2018-11-23 12:16:57,515 INFO L273 TraceCheckUtils]: 38: Hoare triple {3289#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3289#true} is VALID [2018-11-23 12:16:57,515 INFO L273 TraceCheckUtils]: 39: Hoare triple {3289#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3289#true} is VALID [2018-11-23 12:16:57,516 INFO L273 TraceCheckUtils]: 40: Hoare triple {3289#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3289#true} is VALID [2018-11-23 12:16:57,516 INFO L273 TraceCheckUtils]: 41: Hoare triple {3289#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3289#true} is VALID [2018-11-23 12:16:57,516 INFO L273 TraceCheckUtils]: 42: Hoare triple {3289#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3289#true} is VALID [2018-11-23 12:16:57,516 INFO L273 TraceCheckUtils]: 43: Hoare triple {3289#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3289#true} is VALID [2018-11-23 12:16:57,516 INFO L273 TraceCheckUtils]: 44: Hoare triple {3289#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3289#true} is VALID [2018-11-23 12:16:57,517 INFO L273 TraceCheckUtils]: 45: Hoare triple {3289#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3289#true} is VALID [2018-11-23 12:16:57,517 INFO L273 TraceCheckUtils]: 46: Hoare triple {3289#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3289#true} is VALID [2018-11-23 12:16:57,517 INFO L273 TraceCheckUtils]: 47: Hoare triple {3289#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3289#true} is VALID [2018-11-23 12:16:57,517 INFO L273 TraceCheckUtils]: 48: Hoare triple {3289#true} assume !(~i~0 < 60); {3289#true} is VALID [2018-11-23 12:16:57,517 INFO L273 TraceCheckUtils]: 49: Hoare triple {3289#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3289#true} is VALID [2018-11-23 12:16:57,517 INFO L273 TraceCheckUtils]: 50: Hoare triple {3289#true} assume true; {3289#true} is VALID [2018-11-23 12:16:57,517 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {3289#true} {3290#false} #77#return; {3290#false} is VALID [2018-11-23 12:16:57,517 INFO L273 TraceCheckUtils]: 52: Hoare triple {3290#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {3290#false} is VALID [2018-11-23 12:16:57,518 INFO L273 TraceCheckUtils]: 53: Hoare triple {3290#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3290#false} is VALID [2018-11-23 12:16:57,518 INFO L273 TraceCheckUtils]: 54: Hoare triple {3290#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3290#false} is VALID [2018-11-23 12:16:57,518 INFO L273 TraceCheckUtils]: 55: Hoare triple {3290#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3290#false} is VALID [2018-11-23 12:16:57,518 INFO L273 TraceCheckUtils]: 56: Hoare triple {3290#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3290#false} is VALID [2018-11-23 12:16:57,518 INFO L273 TraceCheckUtils]: 57: Hoare triple {3290#false} assume !(~i~2 < 59); {3290#false} is VALID [2018-11-23 12:16:57,518 INFO L273 TraceCheckUtils]: 58: Hoare triple {3290#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {3290#false} is VALID [2018-11-23 12:16:57,518 INFO L256 TraceCheckUtils]: 59: Hoare triple {3290#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {3289#true} is VALID [2018-11-23 12:16:57,518 INFO L273 TraceCheckUtils]: 60: Hoare triple {3289#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3289#true} is VALID [2018-11-23 12:16:57,519 INFO L273 TraceCheckUtils]: 61: Hoare triple {3289#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3289#true} is VALID [2018-11-23 12:16:57,519 INFO L273 TraceCheckUtils]: 62: Hoare triple {3289#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3289#true} is VALID [2018-11-23 12:16:57,519 INFO L273 TraceCheckUtils]: 63: Hoare triple {3289#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3289#true} is VALID [2018-11-23 12:16:57,519 INFO L273 TraceCheckUtils]: 64: Hoare triple {3289#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3289#true} is VALID [2018-11-23 12:16:57,519 INFO L273 TraceCheckUtils]: 65: Hoare triple {3289#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3289#true} is VALID [2018-11-23 12:16:57,519 INFO L273 TraceCheckUtils]: 66: Hoare triple {3289#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3289#true} is VALID [2018-11-23 12:16:57,519 INFO L273 TraceCheckUtils]: 67: Hoare triple {3289#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3289#true} is VALID [2018-11-23 12:16:57,519 INFO L273 TraceCheckUtils]: 68: Hoare triple {3289#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3289#true} is VALID [2018-11-23 12:16:57,520 INFO L273 TraceCheckUtils]: 69: Hoare triple {3289#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3289#true} is VALID [2018-11-23 12:16:57,520 INFO L273 TraceCheckUtils]: 70: Hoare triple {3289#true} assume !(~i~0 < 60); {3289#true} is VALID [2018-11-23 12:16:57,520 INFO L273 TraceCheckUtils]: 71: Hoare triple {3289#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3289#true} is VALID [2018-11-23 12:16:57,520 INFO L273 TraceCheckUtils]: 72: Hoare triple {3289#true} assume true; {3289#true} is VALID [2018-11-23 12:16:57,520 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {3289#true} {3290#false} #79#return; {3290#false} is VALID [2018-11-23 12:16:57,520 INFO L273 TraceCheckUtils]: 74: Hoare triple {3290#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {3290#false} is VALID [2018-11-23 12:16:57,520 INFO L273 TraceCheckUtils]: 75: Hoare triple {3290#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3290#false} is VALID [2018-11-23 12:16:57,520 INFO L273 TraceCheckUtils]: 76: Hoare triple {3290#false} assume !false; {3290#false} is VALID [2018-11-23 12:16:57,523 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-23 12:16:57,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:57,524 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:16:57,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:57,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:57,732 INFO L256 TraceCheckUtils]: 0: Hoare triple {3289#true} call ULTIMATE.init(); {3289#true} is VALID [2018-11-23 12:16:57,733 INFO L273 TraceCheckUtils]: 1: Hoare triple {3289#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3289#true} is VALID [2018-11-23 12:16:57,733 INFO L273 TraceCheckUtils]: 2: Hoare triple {3289#true} assume true; {3289#true} is VALID [2018-11-23 12:16:57,734 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3289#true} {3289#true} #71#return; {3289#true} is VALID [2018-11-23 12:16:57,734 INFO L256 TraceCheckUtils]: 4: Hoare triple {3289#true} call #t~ret14 := main(); {3289#true} is VALID [2018-11-23 12:16:57,735 INFO L273 TraceCheckUtils]: 5: Hoare triple {3289#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3317#(<= main_~i~1 0)} is VALID [2018-11-23 12:16:57,735 INFO L273 TraceCheckUtils]: 6: Hoare triple {3317#(<= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3317#(<= main_~i~1 0)} is VALID [2018-11-23 12:16:57,736 INFO L273 TraceCheckUtils]: 7: Hoare triple {3317#(<= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3292#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:57,736 INFO L273 TraceCheckUtils]: 8: Hoare triple {3292#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3292#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:57,737 INFO L273 TraceCheckUtils]: 9: Hoare triple {3292#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3293#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:57,738 INFO L273 TraceCheckUtils]: 10: Hoare triple {3293#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3293#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:57,739 INFO L273 TraceCheckUtils]: 11: Hoare triple {3293#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3294#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:57,740 INFO L273 TraceCheckUtils]: 12: Hoare triple {3294#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3294#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:57,740 INFO L273 TraceCheckUtils]: 13: Hoare triple {3294#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3295#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:57,741 INFO L273 TraceCheckUtils]: 14: Hoare triple {3295#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3295#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:57,742 INFO L273 TraceCheckUtils]: 15: Hoare triple {3295#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3296#(<= main_~i~1 5)} is VALID [2018-11-23 12:16:57,743 INFO L273 TraceCheckUtils]: 16: Hoare triple {3296#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3296#(<= main_~i~1 5)} is VALID [2018-11-23 12:16:57,744 INFO L273 TraceCheckUtils]: 17: Hoare triple {3296#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3297#(<= main_~i~1 6)} is VALID [2018-11-23 12:16:57,745 INFO L273 TraceCheckUtils]: 18: Hoare triple {3297#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3297#(<= main_~i~1 6)} is VALID [2018-11-23 12:16:57,745 INFO L273 TraceCheckUtils]: 19: Hoare triple {3297#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3298#(<= main_~i~1 7)} is VALID [2018-11-23 12:16:57,746 INFO L273 TraceCheckUtils]: 20: Hoare triple {3298#(<= main_~i~1 7)} assume !(~i~1 < 60); {3290#false} is VALID [2018-11-23 12:16:57,747 INFO L256 TraceCheckUtils]: 21: Hoare triple {3290#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {3290#false} is VALID [2018-11-23 12:16:57,747 INFO L273 TraceCheckUtils]: 22: Hoare triple {3290#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3290#false} is VALID [2018-11-23 12:16:57,747 INFO L273 TraceCheckUtils]: 23: Hoare triple {3290#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3290#false} is VALID [2018-11-23 12:16:57,747 INFO L273 TraceCheckUtils]: 24: Hoare triple {3290#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3290#false} is VALID [2018-11-23 12:16:57,748 INFO L273 TraceCheckUtils]: 25: Hoare triple {3290#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3290#false} is VALID [2018-11-23 12:16:57,748 INFO L273 TraceCheckUtils]: 26: Hoare triple {3290#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3290#false} is VALID [2018-11-23 12:16:57,748 INFO L273 TraceCheckUtils]: 27: Hoare triple {3290#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3290#false} is VALID [2018-11-23 12:16:57,749 INFO L273 TraceCheckUtils]: 28: Hoare triple {3290#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3290#false} is VALID [2018-11-23 12:16:57,749 INFO L273 TraceCheckUtils]: 29: Hoare triple {3290#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3290#false} is VALID [2018-11-23 12:16:57,749 INFO L273 TraceCheckUtils]: 30: Hoare triple {3290#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3290#false} is VALID [2018-11-23 12:16:57,749 INFO L273 TraceCheckUtils]: 31: Hoare triple {3290#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3290#false} is VALID [2018-11-23 12:16:57,750 INFO L273 TraceCheckUtils]: 32: Hoare triple {3290#false} assume !(~i~0 < 60); {3290#false} is VALID [2018-11-23 12:16:57,750 INFO L273 TraceCheckUtils]: 33: Hoare triple {3290#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3290#false} is VALID [2018-11-23 12:16:57,750 INFO L273 TraceCheckUtils]: 34: Hoare triple {3290#false} assume true; {3290#false} is VALID [2018-11-23 12:16:57,750 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {3290#false} {3290#false} #75#return; {3290#false} is VALID [2018-11-23 12:16:57,750 INFO L273 TraceCheckUtils]: 36: Hoare triple {3290#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3290#false} is VALID [2018-11-23 12:16:57,751 INFO L256 TraceCheckUtils]: 37: Hoare triple {3290#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {3290#false} is VALID [2018-11-23 12:16:57,751 INFO L273 TraceCheckUtils]: 38: Hoare triple {3290#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3290#false} is VALID [2018-11-23 12:16:57,751 INFO L273 TraceCheckUtils]: 39: Hoare triple {3290#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3290#false} is VALID [2018-11-23 12:16:57,751 INFO L273 TraceCheckUtils]: 40: Hoare triple {3290#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3290#false} is VALID [2018-11-23 12:16:57,751 INFO L273 TraceCheckUtils]: 41: Hoare triple {3290#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3290#false} is VALID [2018-11-23 12:16:57,751 INFO L273 TraceCheckUtils]: 42: Hoare triple {3290#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3290#false} is VALID [2018-11-23 12:16:57,752 INFO L273 TraceCheckUtils]: 43: Hoare triple {3290#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3290#false} is VALID [2018-11-23 12:16:57,752 INFO L273 TraceCheckUtils]: 44: Hoare triple {3290#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3290#false} is VALID [2018-11-23 12:16:57,752 INFO L273 TraceCheckUtils]: 45: Hoare triple {3290#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3290#false} is VALID [2018-11-23 12:16:57,752 INFO L273 TraceCheckUtils]: 46: Hoare triple {3290#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3290#false} is VALID [2018-11-23 12:16:57,752 INFO L273 TraceCheckUtils]: 47: Hoare triple {3290#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3290#false} is VALID [2018-11-23 12:16:57,752 INFO L273 TraceCheckUtils]: 48: Hoare triple {3290#false} assume !(~i~0 < 60); {3290#false} is VALID [2018-11-23 12:16:57,753 INFO L273 TraceCheckUtils]: 49: Hoare triple {3290#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3290#false} is VALID [2018-11-23 12:16:57,753 INFO L273 TraceCheckUtils]: 50: Hoare triple {3290#false} assume true; {3290#false} is VALID [2018-11-23 12:16:57,753 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {3290#false} {3290#false} #77#return; {3290#false} is VALID [2018-11-23 12:16:57,753 INFO L273 TraceCheckUtils]: 52: Hoare triple {3290#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {3290#false} is VALID [2018-11-23 12:16:57,753 INFO L273 TraceCheckUtils]: 53: Hoare triple {3290#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3290#false} is VALID [2018-11-23 12:16:57,753 INFO L273 TraceCheckUtils]: 54: Hoare triple {3290#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3290#false} is VALID [2018-11-23 12:16:57,754 INFO L273 TraceCheckUtils]: 55: Hoare triple {3290#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3290#false} is VALID [2018-11-23 12:16:57,754 INFO L273 TraceCheckUtils]: 56: Hoare triple {3290#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3290#false} is VALID [2018-11-23 12:16:57,754 INFO L273 TraceCheckUtils]: 57: Hoare triple {3290#false} assume !(~i~2 < 59); {3290#false} is VALID [2018-11-23 12:16:57,754 INFO L273 TraceCheckUtils]: 58: Hoare triple {3290#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {3290#false} is VALID [2018-11-23 12:16:57,754 INFO L256 TraceCheckUtils]: 59: Hoare triple {3290#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {3290#false} is VALID [2018-11-23 12:16:57,754 INFO L273 TraceCheckUtils]: 60: Hoare triple {3290#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3290#false} is VALID [2018-11-23 12:16:57,754 INFO L273 TraceCheckUtils]: 61: Hoare triple {3290#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3290#false} is VALID [2018-11-23 12:16:57,755 INFO L273 TraceCheckUtils]: 62: Hoare triple {3290#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3290#false} is VALID [2018-11-23 12:16:57,755 INFO L273 TraceCheckUtils]: 63: Hoare triple {3290#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3290#false} is VALID [2018-11-23 12:16:57,755 INFO L273 TraceCheckUtils]: 64: Hoare triple {3290#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3290#false} is VALID [2018-11-23 12:16:57,755 INFO L273 TraceCheckUtils]: 65: Hoare triple {3290#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3290#false} is VALID [2018-11-23 12:16:57,755 INFO L273 TraceCheckUtils]: 66: Hoare triple {3290#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3290#false} is VALID [2018-11-23 12:16:57,755 INFO L273 TraceCheckUtils]: 67: Hoare triple {3290#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3290#false} is VALID [2018-11-23 12:16:57,755 INFO L273 TraceCheckUtils]: 68: Hoare triple {3290#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3290#false} is VALID [2018-11-23 12:16:57,755 INFO L273 TraceCheckUtils]: 69: Hoare triple {3290#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3290#false} is VALID [2018-11-23 12:16:57,755 INFO L273 TraceCheckUtils]: 70: Hoare triple {3290#false} assume !(~i~0 < 60); {3290#false} is VALID [2018-11-23 12:16:57,756 INFO L273 TraceCheckUtils]: 71: Hoare triple {3290#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3290#false} is VALID [2018-11-23 12:16:57,756 INFO L273 TraceCheckUtils]: 72: Hoare triple {3290#false} assume true; {3290#false} is VALID [2018-11-23 12:16:57,756 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {3290#false} {3290#false} #79#return; {3290#false} is VALID [2018-11-23 12:16:57,756 INFO L273 TraceCheckUtils]: 74: Hoare triple {3290#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {3290#false} is VALID [2018-11-23 12:16:57,756 INFO L273 TraceCheckUtils]: 75: Hoare triple {3290#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3290#false} is VALID [2018-11-23 12:16:57,756 INFO L273 TraceCheckUtils]: 76: Hoare triple {3290#false} assume !false; {3290#false} is VALID [2018-11-23 12:16:57,759 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-23 12:16:57,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:57,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:16:57,783 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2018-11-23 12:16:57,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:57,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:16:57,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:57,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:16:57,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:16:57,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:16:57,843 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 11 states. [2018-11-23 12:16:58,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:58,071 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2018-11-23 12:16:58,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:16:58,071 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2018-11-23 12:16:58,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:58,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:16:58,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2018-11-23 12:16:58,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:16:58,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2018-11-23 12:16:58,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 72 transitions. [2018-11-23 12:16:58,202 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-23 12:16:58,203 INFO L225 Difference]: With dead ends: 82 [2018-11-23 12:16:58,203 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 12:16:58,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:16:58,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 12:16:58,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-11-23 12:16:58,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:58,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 52 states. [2018-11-23 12:16:58,317 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 52 states. [2018-11-23 12:16:58,317 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 52 states. [2018-11-23 12:16:58,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:58,319 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-11-23 12:16:58,319 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-11-23 12:16:58,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:58,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:58,320 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 53 states. [2018-11-23 12:16:58,320 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 53 states. [2018-11-23 12:16:58,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:58,323 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-11-23 12:16:58,323 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-11-23 12:16:58,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:58,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:58,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:58,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:58,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:16:58,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-11-23 12:16:58,325 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 77 [2018-11-23 12:16:58,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:58,326 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-11-23 12:16:58,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:16:58,326 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-23 12:16:58,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 12:16:58,327 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:58,327 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:58,328 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:58,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:58,328 INFO L82 PathProgramCache]: Analyzing trace with hash 15831411, now seen corresponding path program 8 times [2018-11-23 12:16:58,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:58,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:58,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:58,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:58,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:58,619 INFO L256 TraceCheckUtils]: 0: Hoare triple {3829#true} call ULTIMATE.init(); {3829#true} is VALID [2018-11-23 12:16:58,620 INFO L273 TraceCheckUtils]: 1: Hoare triple {3829#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3829#true} is VALID [2018-11-23 12:16:58,620 INFO L273 TraceCheckUtils]: 2: Hoare triple {3829#true} assume true; {3829#true} is VALID [2018-11-23 12:16:58,620 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3829#true} {3829#true} #71#return; {3829#true} is VALID [2018-11-23 12:16:58,620 INFO L256 TraceCheckUtils]: 4: Hoare triple {3829#true} call #t~ret14 := main(); {3829#true} is VALID [2018-11-23 12:16:58,621 INFO L273 TraceCheckUtils]: 5: Hoare triple {3829#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3831#(= main_~i~1 0)} is VALID [2018-11-23 12:16:58,621 INFO L273 TraceCheckUtils]: 6: Hoare triple {3831#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3831#(= main_~i~1 0)} is VALID [2018-11-23 12:16:58,622 INFO L273 TraceCheckUtils]: 7: Hoare triple {3831#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3832#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:58,623 INFO L273 TraceCheckUtils]: 8: Hoare triple {3832#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3832#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:58,624 INFO L273 TraceCheckUtils]: 9: Hoare triple {3832#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3833#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:58,624 INFO L273 TraceCheckUtils]: 10: Hoare triple {3833#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3833#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:58,625 INFO L273 TraceCheckUtils]: 11: Hoare triple {3833#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3834#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:58,626 INFO L273 TraceCheckUtils]: 12: Hoare triple {3834#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3834#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:58,626 INFO L273 TraceCheckUtils]: 13: Hoare triple {3834#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3835#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:58,627 INFO L273 TraceCheckUtils]: 14: Hoare triple {3835#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3835#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:58,628 INFO L273 TraceCheckUtils]: 15: Hoare triple {3835#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3836#(<= main_~i~1 5)} is VALID [2018-11-23 12:16:58,628 INFO L273 TraceCheckUtils]: 16: Hoare triple {3836#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3836#(<= main_~i~1 5)} is VALID [2018-11-23 12:16:58,629 INFO L273 TraceCheckUtils]: 17: Hoare triple {3836#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3837#(<= main_~i~1 6)} is VALID [2018-11-23 12:16:58,630 INFO L273 TraceCheckUtils]: 18: Hoare triple {3837#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3837#(<= main_~i~1 6)} is VALID [2018-11-23 12:16:58,630 INFO L273 TraceCheckUtils]: 19: Hoare triple {3837#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3838#(<= main_~i~1 7)} is VALID [2018-11-23 12:16:58,631 INFO L273 TraceCheckUtils]: 20: Hoare triple {3838#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3838#(<= main_~i~1 7)} is VALID [2018-11-23 12:16:58,632 INFO L273 TraceCheckUtils]: 21: Hoare triple {3838#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3839#(<= main_~i~1 8)} is VALID [2018-11-23 12:16:58,632 INFO L273 TraceCheckUtils]: 22: Hoare triple {3839#(<= main_~i~1 8)} assume !(~i~1 < 60); {3830#false} is VALID [2018-11-23 12:16:58,633 INFO L256 TraceCheckUtils]: 23: Hoare triple {3830#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {3829#true} is VALID [2018-11-23 12:16:58,633 INFO L273 TraceCheckUtils]: 24: Hoare triple {3829#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3829#true} is VALID [2018-11-23 12:16:58,633 INFO L273 TraceCheckUtils]: 25: Hoare triple {3829#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3829#true} is VALID [2018-11-23 12:16:58,633 INFO L273 TraceCheckUtils]: 26: Hoare triple {3829#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3829#true} is VALID [2018-11-23 12:16:58,634 INFO L273 TraceCheckUtils]: 27: Hoare triple {3829#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3829#true} is VALID [2018-11-23 12:16:58,634 INFO L273 TraceCheckUtils]: 28: Hoare triple {3829#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3829#true} is VALID [2018-11-23 12:16:58,634 INFO L273 TraceCheckUtils]: 29: Hoare triple {3829#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3829#true} is VALID [2018-11-23 12:16:58,634 INFO L273 TraceCheckUtils]: 30: Hoare triple {3829#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3829#true} is VALID [2018-11-23 12:16:58,634 INFO L273 TraceCheckUtils]: 31: Hoare triple {3829#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3829#true} is VALID [2018-11-23 12:16:58,635 INFO L273 TraceCheckUtils]: 32: Hoare triple {3829#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3829#true} is VALID [2018-11-23 12:16:58,635 INFO L273 TraceCheckUtils]: 33: Hoare triple {3829#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3829#true} is VALID [2018-11-23 12:16:58,635 INFO L273 TraceCheckUtils]: 34: Hoare triple {3829#true} assume !(~i~0 < 60); {3829#true} is VALID [2018-11-23 12:16:58,635 INFO L273 TraceCheckUtils]: 35: Hoare triple {3829#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3829#true} is VALID [2018-11-23 12:16:58,635 INFO L273 TraceCheckUtils]: 36: Hoare triple {3829#true} assume true; {3829#true} is VALID [2018-11-23 12:16:58,636 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {3829#true} {3830#false} #75#return; {3830#false} is VALID [2018-11-23 12:16:58,636 INFO L273 TraceCheckUtils]: 38: Hoare triple {3830#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3830#false} is VALID [2018-11-23 12:16:58,636 INFO L256 TraceCheckUtils]: 39: Hoare triple {3830#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {3829#true} is VALID [2018-11-23 12:16:58,636 INFO L273 TraceCheckUtils]: 40: Hoare triple {3829#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3829#true} is VALID [2018-11-23 12:16:58,636 INFO L273 TraceCheckUtils]: 41: Hoare triple {3829#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3829#true} is VALID [2018-11-23 12:16:58,637 INFO L273 TraceCheckUtils]: 42: Hoare triple {3829#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3829#true} is VALID [2018-11-23 12:16:58,637 INFO L273 TraceCheckUtils]: 43: Hoare triple {3829#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3829#true} is VALID [2018-11-23 12:16:58,637 INFO L273 TraceCheckUtils]: 44: Hoare triple {3829#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3829#true} is VALID [2018-11-23 12:16:58,637 INFO L273 TraceCheckUtils]: 45: Hoare triple {3829#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3829#true} is VALID [2018-11-23 12:16:58,638 INFO L273 TraceCheckUtils]: 46: Hoare triple {3829#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3829#true} is VALID [2018-11-23 12:16:58,638 INFO L273 TraceCheckUtils]: 47: Hoare triple {3829#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3829#true} is VALID [2018-11-23 12:16:58,638 INFO L273 TraceCheckUtils]: 48: Hoare triple {3829#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3829#true} is VALID [2018-11-23 12:16:58,638 INFO L273 TraceCheckUtils]: 49: Hoare triple {3829#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3829#true} is VALID [2018-11-23 12:16:58,638 INFO L273 TraceCheckUtils]: 50: Hoare triple {3829#true} assume !(~i~0 < 60); {3829#true} is VALID [2018-11-23 12:16:58,638 INFO L273 TraceCheckUtils]: 51: Hoare triple {3829#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3829#true} is VALID [2018-11-23 12:16:58,638 INFO L273 TraceCheckUtils]: 52: Hoare triple {3829#true} assume true; {3829#true} is VALID [2018-11-23 12:16:58,638 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {3829#true} {3830#false} #77#return; {3830#false} is VALID [2018-11-23 12:16:58,639 INFO L273 TraceCheckUtils]: 54: Hoare triple {3830#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {3830#false} is VALID [2018-11-23 12:16:58,639 INFO L273 TraceCheckUtils]: 55: Hoare triple {3830#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3830#false} is VALID [2018-11-23 12:16:58,639 INFO L273 TraceCheckUtils]: 56: Hoare triple {3830#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3830#false} is VALID [2018-11-23 12:16:58,639 INFO L273 TraceCheckUtils]: 57: Hoare triple {3830#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3830#false} is VALID [2018-11-23 12:16:58,639 INFO L273 TraceCheckUtils]: 58: Hoare triple {3830#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3830#false} is VALID [2018-11-23 12:16:58,639 INFO L273 TraceCheckUtils]: 59: Hoare triple {3830#false} assume !(~i~2 < 59); {3830#false} is VALID [2018-11-23 12:16:58,639 INFO L273 TraceCheckUtils]: 60: Hoare triple {3830#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {3830#false} is VALID [2018-11-23 12:16:58,639 INFO L256 TraceCheckUtils]: 61: Hoare triple {3830#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {3829#true} is VALID [2018-11-23 12:16:58,640 INFO L273 TraceCheckUtils]: 62: Hoare triple {3829#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3829#true} is VALID [2018-11-23 12:16:58,640 INFO L273 TraceCheckUtils]: 63: Hoare triple {3829#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3829#true} is VALID [2018-11-23 12:16:58,640 INFO L273 TraceCheckUtils]: 64: Hoare triple {3829#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3829#true} is VALID [2018-11-23 12:16:58,640 INFO L273 TraceCheckUtils]: 65: Hoare triple {3829#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3829#true} is VALID [2018-11-23 12:16:58,640 INFO L273 TraceCheckUtils]: 66: Hoare triple {3829#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3829#true} is VALID [2018-11-23 12:16:58,640 INFO L273 TraceCheckUtils]: 67: Hoare triple {3829#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3829#true} is VALID [2018-11-23 12:16:58,640 INFO L273 TraceCheckUtils]: 68: Hoare triple {3829#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3829#true} is VALID [2018-11-23 12:16:58,640 INFO L273 TraceCheckUtils]: 69: Hoare triple {3829#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3829#true} is VALID [2018-11-23 12:16:58,641 INFO L273 TraceCheckUtils]: 70: Hoare triple {3829#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3829#true} is VALID [2018-11-23 12:16:58,641 INFO L273 TraceCheckUtils]: 71: Hoare triple {3829#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3829#true} is VALID [2018-11-23 12:16:58,641 INFO L273 TraceCheckUtils]: 72: Hoare triple {3829#true} assume !(~i~0 < 60); {3829#true} is VALID [2018-11-23 12:16:58,641 INFO L273 TraceCheckUtils]: 73: Hoare triple {3829#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3829#true} is VALID [2018-11-23 12:16:58,641 INFO L273 TraceCheckUtils]: 74: Hoare triple {3829#true} assume true; {3829#true} is VALID [2018-11-23 12:16:58,641 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {3829#true} {3830#false} #79#return; {3830#false} is VALID [2018-11-23 12:16:58,641 INFO L273 TraceCheckUtils]: 76: Hoare triple {3830#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {3830#false} is VALID [2018-11-23 12:16:58,641 INFO L273 TraceCheckUtils]: 77: Hoare triple {3830#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3830#false} is VALID [2018-11-23 12:16:58,641 INFO L273 TraceCheckUtils]: 78: Hoare triple {3830#false} assume !false; {3830#false} is VALID [2018-11-23 12:16:58,644 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-23 12:16:58,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:58,645 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:16:58,654 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:16:58,698 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:16:58,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:58,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:58,844 INFO L256 TraceCheckUtils]: 0: Hoare triple {3829#true} call ULTIMATE.init(); {3829#true} is VALID [2018-11-23 12:16:58,844 INFO L273 TraceCheckUtils]: 1: Hoare triple {3829#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3829#true} is VALID [2018-11-23 12:16:58,845 INFO L273 TraceCheckUtils]: 2: Hoare triple {3829#true} assume true; {3829#true} is VALID [2018-11-23 12:16:58,845 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3829#true} {3829#true} #71#return; {3829#true} is VALID [2018-11-23 12:16:58,845 INFO L256 TraceCheckUtils]: 4: Hoare triple {3829#true} call #t~ret14 := main(); {3829#true} is VALID [2018-11-23 12:16:58,846 INFO L273 TraceCheckUtils]: 5: Hoare triple {3829#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3858#(<= main_~i~1 0)} is VALID [2018-11-23 12:16:58,847 INFO L273 TraceCheckUtils]: 6: Hoare triple {3858#(<= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3858#(<= main_~i~1 0)} is VALID [2018-11-23 12:16:58,847 INFO L273 TraceCheckUtils]: 7: Hoare triple {3858#(<= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3832#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:58,847 INFO L273 TraceCheckUtils]: 8: Hoare triple {3832#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3832#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:58,848 INFO L273 TraceCheckUtils]: 9: Hoare triple {3832#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3833#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:58,848 INFO L273 TraceCheckUtils]: 10: Hoare triple {3833#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3833#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:58,849 INFO L273 TraceCheckUtils]: 11: Hoare triple {3833#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3834#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:58,850 INFO L273 TraceCheckUtils]: 12: Hoare triple {3834#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3834#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:58,850 INFO L273 TraceCheckUtils]: 13: Hoare triple {3834#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3835#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:58,851 INFO L273 TraceCheckUtils]: 14: Hoare triple {3835#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3835#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:58,852 INFO L273 TraceCheckUtils]: 15: Hoare triple {3835#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3836#(<= main_~i~1 5)} is VALID [2018-11-23 12:16:58,853 INFO L273 TraceCheckUtils]: 16: Hoare triple {3836#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3836#(<= main_~i~1 5)} is VALID [2018-11-23 12:16:58,854 INFO L273 TraceCheckUtils]: 17: Hoare triple {3836#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3837#(<= main_~i~1 6)} is VALID [2018-11-23 12:16:58,854 INFO L273 TraceCheckUtils]: 18: Hoare triple {3837#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3837#(<= main_~i~1 6)} is VALID [2018-11-23 12:16:58,855 INFO L273 TraceCheckUtils]: 19: Hoare triple {3837#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3838#(<= main_~i~1 7)} is VALID [2018-11-23 12:16:58,856 INFO L273 TraceCheckUtils]: 20: Hoare triple {3838#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3838#(<= main_~i~1 7)} is VALID [2018-11-23 12:16:58,857 INFO L273 TraceCheckUtils]: 21: Hoare triple {3838#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3839#(<= main_~i~1 8)} is VALID [2018-11-23 12:16:58,857 INFO L273 TraceCheckUtils]: 22: Hoare triple {3839#(<= main_~i~1 8)} assume !(~i~1 < 60); {3830#false} is VALID [2018-11-23 12:16:58,858 INFO L256 TraceCheckUtils]: 23: Hoare triple {3830#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {3830#false} is VALID [2018-11-23 12:16:58,858 INFO L273 TraceCheckUtils]: 24: Hoare triple {3830#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3830#false} is VALID [2018-11-23 12:16:58,858 INFO L273 TraceCheckUtils]: 25: Hoare triple {3830#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3830#false} is VALID [2018-11-23 12:16:58,859 INFO L273 TraceCheckUtils]: 26: Hoare triple {3830#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3830#false} is VALID [2018-11-23 12:16:58,859 INFO L273 TraceCheckUtils]: 27: Hoare triple {3830#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3830#false} is VALID [2018-11-23 12:16:58,859 INFO L273 TraceCheckUtils]: 28: Hoare triple {3830#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3830#false} is VALID [2018-11-23 12:16:58,859 INFO L273 TraceCheckUtils]: 29: Hoare triple {3830#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3830#false} is VALID [2018-11-23 12:16:58,859 INFO L273 TraceCheckUtils]: 30: Hoare triple {3830#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3830#false} is VALID [2018-11-23 12:16:58,860 INFO L273 TraceCheckUtils]: 31: Hoare triple {3830#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3830#false} is VALID [2018-11-23 12:16:58,860 INFO L273 TraceCheckUtils]: 32: Hoare triple {3830#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3830#false} is VALID [2018-11-23 12:16:58,860 INFO L273 TraceCheckUtils]: 33: Hoare triple {3830#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3830#false} is VALID [2018-11-23 12:16:58,860 INFO L273 TraceCheckUtils]: 34: Hoare triple {3830#false} assume !(~i~0 < 60); {3830#false} is VALID [2018-11-23 12:16:58,860 INFO L273 TraceCheckUtils]: 35: Hoare triple {3830#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3830#false} is VALID [2018-11-23 12:16:58,860 INFO L273 TraceCheckUtils]: 36: Hoare triple {3830#false} assume true; {3830#false} is VALID [2018-11-23 12:16:58,861 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {3830#false} {3830#false} #75#return; {3830#false} is VALID [2018-11-23 12:16:58,861 INFO L273 TraceCheckUtils]: 38: Hoare triple {3830#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3830#false} is VALID [2018-11-23 12:16:58,861 INFO L256 TraceCheckUtils]: 39: Hoare triple {3830#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {3830#false} is VALID [2018-11-23 12:16:58,861 INFO L273 TraceCheckUtils]: 40: Hoare triple {3830#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3830#false} is VALID [2018-11-23 12:16:58,861 INFO L273 TraceCheckUtils]: 41: Hoare triple {3830#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3830#false} is VALID [2018-11-23 12:16:58,861 INFO L273 TraceCheckUtils]: 42: Hoare triple {3830#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3830#false} is VALID [2018-11-23 12:16:58,861 INFO L273 TraceCheckUtils]: 43: Hoare triple {3830#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3830#false} is VALID [2018-11-23 12:16:58,862 INFO L273 TraceCheckUtils]: 44: Hoare triple {3830#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3830#false} is VALID [2018-11-23 12:16:58,862 INFO L273 TraceCheckUtils]: 45: Hoare triple {3830#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3830#false} is VALID [2018-11-23 12:16:58,862 INFO L273 TraceCheckUtils]: 46: Hoare triple {3830#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3830#false} is VALID [2018-11-23 12:16:58,862 INFO L273 TraceCheckUtils]: 47: Hoare triple {3830#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3830#false} is VALID [2018-11-23 12:16:58,862 INFO L273 TraceCheckUtils]: 48: Hoare triple {3830#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3830#false} is VALID [2018-11-23 12:16:58,862 INFO L273 TraceCheckUtils]: 49: Hoare triple {3830#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3830#false} is VALID [2018-11-23 12:16:58,863 INFO L273 TraceCheckUtils]: 50: Hoare triple {3830#false} assume !(~i~0 < 60); {3830#false} is VALID [2018-11-23 12:16:58,863 INFO L273 TraceCheckUtils]: 51: Hoare triple {3830#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3830#false} is VALID [2018-11-23 12:16:58,863 INFO L273 TraceCheckUtils]: 52: Hoare triple {3830#false} assume true; {3830#false} is VALID [2018-11-23 12:16:58,863 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {3830#false} {3830#false} #77#return; {3830#false} is VALID [2018-11-23 12:16:58,863 INFO L273 TraceCheckUtils]: 54: Hoare triple {3830#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {3830#false} is VALID [2018-11-23 12:16:58,863 INFO L273 TraceCheckUtils]: 55: Hoare triple {3830#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3830#false} is VALID [2018-11-23 12:16:58,863 INFO L273 TraceCheckUtils]: 56: Hoare triple {3830#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3830#false} is VALID [2018-11-23 12:16:58,864 INFO L273 TraceCheckUtils]: 57: Hoare triple {3830#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3830#false} is VALID [2018-11-23 12:16:58,864 INFO L273 TraceCheckUtils]: 58: Hoare triple {3830#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3830#false} is VALID [2018-11-23 12:16:58,864 INFO L273 TraceCheckUtils]: 59: Hoare triple {3830#false} assume !(~i~2 < 59); {3830#false} is VALID [2018-11-23 12:16:58,864 INFO L273 TraceCheckUtils]: 60: Hoare triple {3830#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {3830#false} is VALID [2018-11-23 12:16:58,864 INFO L256 TraceCheckUtils]: 61: Hoare triple {3830#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {3830#false} is VALID [2018-11-23 12:16:58,864 INFO L273 TraceCheckUtils]: 62: Hoare triple {3830#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3830#false} is VALID [2018-11-23 12:16:58,865 INFO L273 TraceCheckUtils]: 63: Hoare triple {3830#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3830#false} is VALID [2018-11-23 12:16:58,865 INFO L273 TraceCheckUtils]: 64: Hoare triple {3830#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3830#false} is VALID [2018-11-23 12:16:58,865 INFO L273 TraceCheckUtils]: 65: Hoare triple {3830#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3830#false} is VALID [2018-11-23 12:16:58,865 INFO L273 TraceCheckUtils]: 66: Hoare triple {3830#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3830#false} is VALID [2018-11-23 12:16:58,865 INFO L273 TraceCheckUtils]: 67: Hoare triple {3830#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3830#false} is VALID [2018-11-23 12:16:58,865 INFO L273 TraceCheckUtils]: 68: Hoare triple {3830#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3830#false} is VALID [2018-11-23 12:16:58,866 INFO L273 TraceCheckUtils]: 69: Hoare triple {3830#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3830#false} is VALID [2018-11-23 12:16:58,866 INFO L273 TraceCheckUtils]: 70: Hoare triple {3830#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3830#false} is VALID [2018-11-23 12:16:58,866 INFO L273 TraceCheckUtils]: 71: Hoare triple {3830#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3830#false} is VALID [2018-11-23 12:16:58,866 INFO L273 TraceCheckUtils]: 72: Hoare triple {3830#false} assume !(~i~0 < 60); {3830#false} is VALID [2018-11-23 12:16:58,866 INFO L273 TraceCheckUtils]: 73: Hoare triple {3830#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3830#false} is VALID [2018-11-23 12:16:58,866 INFO L273 TraceCheckUtils]: 74: Hoare triple {3830#false} assume true; {3830#false} is VALID [2018-11-23 12:16:58,866 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {3830#false} {3830#false} #79#return; {3830#false} is VALID [2018-11-23 12:16:58,867 INFO L273 TraceCheckUtils]: 76: Hoare triple {3830#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {3830#false} is VALID [2018-11-23 12:16:58,867 INFO L273 TraceCheckUtils]: 77: Hoare triple {3830#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3830#false} is VALID [2018-11-23 12:16:58,867 INFO L273 TraceCheckUtils]: 78: Hoare triple {3830#false} assume !false; {3830#false} is VALID [2018-11-23 12:16:58,873 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-23 12:16:58,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:58,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:16:58,893 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 79 [2018-11-23 12:16:58,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:58,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:16:58,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:58,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:16:58,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:16:58,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:16:58,963 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 12 states. [2018-11-23 12:16:59,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:59,386 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2018-11-23 12:16:59,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:16:59,386 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 79 [2018-11-23 12:16:59,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:59,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:16:59,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 12:16:59,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:16:59,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 12:16:59,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 74 transitions. [2018-11-23 12:16:59,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:59,482 INFO L225 Difference]: With dead ends: 84 [2018-11-23 12:16:59,482 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 12:16:59,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:16:59,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 12:16:59,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-11-23 12:16:59,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:59,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 54 states. [2018-11-23 12:16:59,505 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 54 states. [2018-11-23 12:16:59,505 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 54 states. [2018-11-23 12:16:59,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:59,507 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-11-23 12:16:59,507 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-11-23 12:16:59,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:59,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:59,508 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 55 states. [2018-11-23 12:16:59,508 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 55 states. [2018-11-23 12:16:59,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:59,510 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-11-23 12:16:59,510 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-11-23 12:16:59,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:59,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:59,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:59,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:59,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:16:59,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-11-23 12:16:59,513 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 79 [2018-11-23 12:16:59,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:59,513 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-11-23 12:16:59,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:16:59,513 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-11-23 12:16:59,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 12:16:59,514 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:59,515 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:16:59,515 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:59,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:59,515 INFO L82 PathProgramCache]: Analyzing trace with hash 46597521, now seen corresponding path program 9 times [2018-11-23 12:16:59,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:59,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:59,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:59,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:59,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:59,741 INFO L256 TraceCheckUtils]: 0: Hoare triple {4386#true} call ULTIMATE.init(); {4386#true} is VALID [2018-11-23 12:16:59,741 INFO L273 TraceCheckUtils]: 1: Hoare triple {4386#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4386#true} is VALID [2018-11-23 12:16:59,742 INFO L273 TraceCheckUtils]: 2: Hoare triple {4386#true} assume true; {4386#true} is VALID [2018-11-23 12:16:59,742 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4386#true} {4386#true} #71#return; {4386#true} is VALID [2018-11-23 12:16:59,742 INFO L256 TraceCheckUtils]: 4: Hoare triple {4386#true} call #t~ret14 := main(); {4386#true} is VALID [2018-11-23 12:16:59,743 INFO L273 TraceCheckUtils]: 5: Hoare triple {4386#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4388#(= main_~i~1 0)} is VALID [2018-11-23 12:16:59,744 INFO L273 TraceCheckUtils]: 6: Hoare triple {4388#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4388#(= main_~i~1 0)} is VALID [2018-11-23 12:16:59,745 INFO L273 TraceCheckUtils]: 7: Hoare triple {4388#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4389#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:59,745 INFO L273 TraceCheckUtils]: 8: Hoare triple {4389#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4389#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:59,746 INFO L273 TraceCheckUtils]: 9: Hoare triple {4389#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4390#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:59,747 INFO L273 TraceCheckUtils]: 10: Hoare triple {4390#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4390#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:59,748 INFO L273 TraceCheckUtils]: 11: Hoare triple {4390#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4391#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:59,748 INFO L273 TraceCheckUtils]: 12: Hoare triple {4391#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4391#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:59,749 INFO L273 TraceCheckUtils]: 13: Hoare triple {4391#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4392#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:59,750 INFO L273 TraceCheckUtils]: 14: Hoare triple {4392#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4392#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:59,751 INFO L273 TraceCheckUtils]: 15: Hoare triple {4392#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4393#(<= main_~i~1 5)} is VALID [2018-11-23 12:16:59,751 INFO L273 TraceCheckUtils]: 16: Hoare triple {4393#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4393#(<= main_~i~1 5)} is VALID [2018-11-23 12:16:59,752 INFO L273 TraceCheckUtils]: 17: Hoare triple {4393#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4394#(<= main_~i~1 6)} is VALID [2018-11-23 12:16:59,753 INFO L273 TraceCheckUtils]: 18: Hoare triple {4394#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4394#(<= main_~i~1 6)} is VALID [2018-11-23 12:16:59,754 INFO L273 TraceCheckUtils]: 19: Hoare triple {4394#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4395#(<= main_~i~1 7)} is VALID [2018-11-23 12:16:59,754 INFO L273 TraceCheckUtils]: 20: Hoare triple {4395#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4395#(<= main_~i~1 7)} is VALID [2018-11-23 12:16:59,755 INFO L273 TraceCheckUtils]: 21: Hoare triple {4395#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4396#(<= main_~i~1 8)} is VALID [2018-11-23 12:16:59,756 INFO L273 TraceCheckUtils]: 22: Hoare triple {4396#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4396#(<= main_~i~1 8)} is VALID [2018-11-23 12:16:59,757 INFO L273 TraceCheckUtils]: 23: Hoare triple {4396#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4397#(<= main_~i~1 9)} is VALID [2018-11-23 12:16:59,757 INFO L273 TraceCheckUtils]: 24: Hoare triple {4397#(<= main_~i~1 9)} assume !(~i~1 < 60); {4387#false} is VALID [2018-11-23 12:16:59,758 INFO L256 TraceCheckUtils]: 25: Hoare triple {4387#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {4386#true} is VALID [2018-11-23 12:16:59,758 INFO L273 TraceCheckUtils]: 26: Hoare triple {4386#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {4386#true} is VALID [2018-11-23 12:16:59,758 INFO L273 TraceCheckUtils]: 27: Hoare triple {4386#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4386#true} is VALID [2018-11-23 12:16:59,759 INFO L273 TraceCheckUtils]: 28: Hoare triple {4386#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4386#true} is VALID [2018-11-23 12:16:59,759 INFO L273 TraceCheckUtils]: 29: Hoare triple {4386#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4386#true} is VALID [2018-11-23 12:16:59,759 INFO L273 TraceCheckUtils]: 30: Hoare triple {4386#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4386#true} is VALID [2018-11-23 12:16:59,759 INFO L273 TraceCheckUtils]: 31: Hoare triple {4386#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4386#true} is VALID [2018-11-23 12:16:59,760 INFO L273 TraceCheckUtils]: 32: Hoare triple {4386#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4386#true} is VALID [2018-11-23 12:16:59,760 INFO L273 TraceCheckUtils]: 33: Hoare triple {4386#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4386#true} is VALID [2018-11-23 12:16:59,760 INFO L273 TraceCheckUtils]: 34: Hoare triple {4386#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4386#true} is VALID [2018-11-23 12:16:59,760 INFO L273 TraceCheckUtils]: 35: Hoare triple {4386#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4386#true} is VALID [2018-11-23 12:16:59,761 INFO L273 TraceCheckUtils]: 36: Hoare triple {4386#true} assume !(~i~0 < 60); {4386#true} is VALID [2018-11-23 12:16:59,761 INFO L273 TraceCheckUtils]: 37: Hoare triple {4386#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4386#true} is VALID [2018-11-23 12:16:59,761 INFO L273 TraceCheckUtils]: 38: Hoare triple {4386#true} assume true; {4386#true} is VALID [2018-11-23 12:16:59,761 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {4386#true} {4387#false} #75#return; {4387#false} is VALID [2018-11-23 12:16:59,762 INFO L273 TraceCheckUtils]: 40: Hoare triple {4387#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4387#false} is VALID [2018-11-23 12:16:59,762 INFO L256 TraceCheckUtils]: 41: Hoare triple {4387#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {4386#true} is VALID [2018-11-23 12:16:59,762 INFO L273 TraceCheckUtils]: 42: Hoare triple {4386#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {4386#true} is VALID [2018-11-23 12:16:59,762 INFO L273 TraceCheckUtils]: 43: Hoare triple {4386#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4386#true} is VALID [2018-11-23 12:16:59,762 INFO L273 TraceCheckUtils]: 44: Hoare triple {4386#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4386#true} is VALID [2018-11-23 12:16:59,763 INFO L273 TraceCheckUtils]: 45: Hoare triple {4386#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4386#true} is VALID [2018-11-23 12:16:59,763 INFO L273 TraceCheckUtils]: 46: Hoare triple {4386#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4386#true} is VALID [2018-11-23 12:16:59,763 INFO L273 TraceCheckUtils]: 47: Hoare triple {4386#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4386#true} is VALID [2018-11-23 12:16:59,763 INFO L273 TraceCheckUtils]: 48: Hoare triple {4386#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4386#true} is VALID [2018-11-23 12:16:59,763 INFO L273 TraceCheckUtils]: 49: Hoare triple {4386#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4386#true} is VALID [2018-11-23 12:16:59,763 INFO L273 TraceCheckUtils]: 50: Hoare triple {4386#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4386#true} is VALID [2018-11-23 12:16:59,763 INFO L273 TraceCheckUtils]: 51: Hoare triple {4386#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4386#true} is VALID [2018-11-23 12:16:59,764 INFO L273 TraceCheckUtils]: 52: Hoare triple {4386#true} assume !(~i~0 < 60); {4386#true} is VALID [2018-11-23 12:16:59,764 INFO L273 TraceCheckUtils]: 53: Hoare triple {4386#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4386#true} is VALID [2018-11-23 12:16:59,764 INFO L273 TraceCheckUtils]: 54: Hoare triple {4386#true} assume true; {4386#true} is VALID [2018-11-23 12:16:59,764 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {4386#true} {4387#false} #77#return; {4387#false} is VALID [2018-11-23 12:16:59,764 INFO L273 TraceCheckUtils]: 56: Hoare triple {4387#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {4387#false} is VALID [2018-11-23 12:16:59,764 INFO L273 TraceCheckUtils]: 57: Hoare triple {4387#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4387#false} is VALID [2018-11-23 12:16:59,765 INFO L273 TraceCheckUtils]: 58: Hoare triple {4387#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {4387#false} is VALID [2018-11-23 12:16:59,765 INFO L273 TraceCheckUtils]: 59: Hoare triple {4387#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4387#false} is VALID [2018-11-23 12:16:59,765 INFO L273 TraceCheckUtils]: 60: Hoare triple {4387#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {4387#false} is VALID [2018-11-23 12:16:59,779 INFO L273 TraceCheckUtils]: 61: Hoare triple {4387#false} assume !(~i~2 < 59); {4387#false} is VALID [2018-11-23 12:16:59,779 INFO L273 TraceCheckUtils]: 62: Hoare triple {4387#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {4387#false} is VALID [2018-11-23 12:16:59,779 INFO L256 TraceCheckUtils]: 63: Hoare triple {4387#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {4386#true} is VALID [2018-11-23 12:16:59,780 INFO L273 TraceCheckUtils]: 64: Hoare triple {4386#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {4386#true} is VALID [2018-11-23 12:16:59,780 INFO L273 TraceCheckUtils]: 65: Hoare triple {4386#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4386#true} is VALID [2018-11-23 12:16:59,780 INFO L273 TraceCheckUtils]: 66: Hoare triple {4386#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4386#true} is VALID [2018-11-23 12:16:59,780 INFO L273 TraceCheckUtils]: 67: Hoare triple {4386#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4386#true} is VALID [2018-11-23 12:16:59,781 INFO L273 TraceCheckUtils]: 68: Hoare triple {4386#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4386#true} is VALID [2018-11-23 12:16:59,781 INFO L273 TraceCheckUtils]: 69: Hoare triple {4386#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4386#true} is VALID [2018-11-23 12:16:59,781 INFO L273 TraceCheckUtils]: 70: Hoare triple {4386#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4386#true} is VALID [2018-11-23 12:16:59,781 INFO L273 TraceCheckUtils]: 71: Hoare triple {4386#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4386#true} is VALID [2018-11-23 12:16:59,781 INFO L273 TraceCheckUtils]: 72: Hoare triple {4386#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4386#true} is VALID [2018-11-23 12:16:59,781 INFO L273 TraceCheckUtils]: 73: Hoare triple {4386#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4386#true} is VALID [2018-11-23 12:16:59,781 INFO L273 TraceCheckUtils]: 74: Hoare triple {4386#true} assume !(~i~0 < 60); {4386#true} is VALID [2018-11-23 12:16:59,782 INFO L273 TraceCheckUtils]: 75: Hoare triple {4386#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4386#true} is VALID [2018-11-23 12:16:59,782 INFO L273 TraceCheckUtils]: 76: Hoare triple {4386#true} assume true; {4386#true} is VALID [2018-11-23 12:16:59,783 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {4386#true} {4387#false} #79#return; {4387#false} is VALID [2018-11-23 12:16:59,783 INFO L273 TraceCheckUtils]: 78: Hoare triple {4387#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {4387#false} is VALID [2018-11-23 12:16:59,783 INFO L273 TraceCheckUtils]: 79: Hoare triple {4387#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4387#false} is VALID [2018-11-23 12:16:59,783 INFO L273 TraceCheckUtils]: 80: Hoare triple {4387#false} assume !false; {4387#false} is VALID [2018-11-23 12:16:59,786 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-23 12:16:59,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:59,786 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:16:59,794 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:16:59,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:16:59,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:59,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:59,976 INFO L256 TraceCheckUtils]: 0: Hoare triple {4386#true} call ULTIMATE.init(); {4386#true} is VALID [2018-11-23 12:16:59,976 INFO L273 TraceCheckUtils]: 1: Hoare triple {4386#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4386#true} is VALID [2018-11-23 12:16:59,976 INFO L273 TraceCheckUtils]: 2: Hoare triple {4386#true} assume true; {4386#true} is VALID [2018-11-23 12:16:59,977 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4386#true} {4386#true} #71#return; {4386#true} is VALID [2018-11-23 12:16:59,977 INFO L256 TraceCheckUtils]: 4: Hoare triple {4386#true} call #t~ret14 := main(); {4386#true} is VALID [2018-11-23 12:16:59,977 INFO L273 TraceCheckUtils]: 5: Hoare triple {4386#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4386#true} is VALID [2018-11-23 12:16:59,977 INFO L273 TraceCheckUtils]: 6: Hoare triple {4386#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4386#true} is VALID [2018-11-23 12:16:59,977 INFO L273 TraceCheckUtils]: 7: Hoare triple {4386#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4386#true} is VALID [2018-11-23 12:16:59,978 INFO L273 TraceCheckUtils]: 8: Hoare triple {4386#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4386#true} is VALID [2018-11-23 12:16:59,978 INFO L273 TraceCheckUtils]: 9: Hoare triple {4386#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4386#true} is VALID [2018-11-23 12:16:59,978 INFO L273 TraceCheckUtils]: 10: Hoare triple {4386#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4386#true} is VALID [2018-11-23 12:16:59,978 INFO L273 TraceCheckUtils]: 11: Hoare triple {4386#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4386#true} is VALID [2018-11-23 12:16:59,978 INFO L273 TraceCheckUtils]: 12: Hoare triple {4386#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4386#true} is VALID [2018-11-23 12:16:59,978 INFO L273 TraceCheckUtils]: 13: Hoare triple {4386#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4386#true} is VALID [2018-11-23 12:16:59,979 INFO L273 TraceCheckUtils]: 14: Hoare triple {4386#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4386#true} is VALID [2018-11-23 12:16:59,979 INFO L273 TraceCheckUtils]: 15: Hoare triple {4386#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4386#true} is VALID [2018-11-23 12:16:59,979 INFO L273 TraceCheckUtils]: 16: Hoare triple {4386#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4386#true} is VALID [2018-11-23 12:16:59,979 INFO L273 TraceCheckUtils]: 17: Hoare triple {4386#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4386#true} is VALID [2018-11-23 12:16:59,979 INFO L273 TraceCheckUtils]: 18: Hoare triple {4386#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4386#true} is VALID [2018-11-23 12:16:59,979 INFO L273 TraceCheckUtils]: 19: Hoare triple {4386#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4386#true} is VALID [2018-11-23 12:16:59,980 INFO L273 TraceCheckUtils]: 20: Hoare triple {4386#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4386#true} is VALID [2018-11-23 12:16:59,980 INFO L273 TraceCheckUtils]: 21: Hoare triple {4386#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4386#true} is VALID [2018-11-23 12:16:59,980 INFO L273 TraceCheckUtils]: 22: Hoare triple {4386#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4386#true} is VALID [2018-11-23 12:16:59,980 INFO L273 TraceCheckUtils]: 23: Hoare triple {4386#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4386#true} is VALID [2018-11-23 12:16:59,980 INFO L273 TraceCheckUtils]: 24: Hoare triple {4386#true} assume !(~i~1 < 60); {4386#true} is VALID [2018-11-23 12:16:59,981 INFO L256 TraceCheckUtils]: 25: Hoare triple {4386#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {4386#true} is VALID [2018-11-23 12:16:59,981 INFO L273 TraceCheckUtils]: 26: Hoare triple {4386#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {4386#true} is VALID [2018-11-23 12:16:59,981 INFO L273 TraceCheckUtils]: 27: Hoare triple {4386#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4386#true} is VALID [2018-11-23 12:16:59,981 INFO L273 TraceCheckUtils]: 28: Hoare triple {4386#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4386#true} is VALID [2018-11-23 12:16:59,981 INFO L273 TraceCheckUtils]: 29: Hoare triple {4386#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4386#true} is VALID [2018-11-23 12:16:59,981 INFO L273 TraceCheckUtils]: 30: Hoare triple {4386#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4386#true} is VALID [2018-11-23 12:16:59,982 INFO L273 TraceCheckUtils]: 31: Hoare triple {4386#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4386#true} is VALID [2018-11-23 12:16:59,982 INFO L273 TraceCheckUtils]: 32: Hoare triple {4386#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4386#true} is VALID [2018-11-23 12:16:59,982 INFO L273 TraceCheckUtils]: 33: Hoare triple {4386#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4386#true} is VALID [2018-11-23 12:16:59,982 INFO L273 TraceCheckUtils]: 34: Hoare triple {4386#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4386#true} is VALID [2018-11-23 12:16:59,982 INFO L273 TraceCheckUtils]: 35: Hoare triple {4386#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4386#true} is VALID [2018-11-23 12:16:59,982 INFO L273 TraceCheckUtils]: 36: Hoare triple {4386#true} assume !(~i~0 < 60); {4386#true} is VALID [2018-11-23 12:16:59,982 INFO L273 TraceCheckUtils]: 37: Hoare triple {4386#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4386#true} is VALID [2018-11-23 12:16:59,982 INFO L273 TraceCheckUtils]: 38: Hoare triple {4386#true} assume true; {4386#true} is VALID [2018-11-23 12:16:59,983 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {4386#true} {4386#true} #75#return; {4386#true} is VALID [2018-11-23 12:16:59,983 INFO L273 TraceCheckUtils]: 40: Hoare triple {4386#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4386#true} is VALID [2018-11-23 12:16:59,983 INFO L256 TraceCheckUtils]: 41: Hoare triple {4386#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {4386#true} is VALID [2018-11-23 12:16:59,983 INFO L273 TraceCheckUtils]: 42: Hoare triple {4386#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {4386#true} is VALID [2018-11-23 12:16:59,983 INFO L273 TraceCheckUtils]: 43: Hoare triple {4386#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4386#true} is VALID [2018-11-23 12:16:59,983 INFO L273 TraceCheckUtils]: 44: Hoare triple {4386#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4386#true} is VALID [2018-11-23 12:16:59,983 INFO L273 TraceCheckUtils]: 45: Hoare triple {4386#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4386#true} is VALID [2018-11-23 12:16:59,983 INFO L273 TraceCheckUtils]: 46: Hoare triple {4386#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4386#true} is VALID [2018-11-23 12:16:59,984 INFO L273 TraceCheckUtils]: 47: Hoare triple {4386#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4386#true} is VALID [2018-11-23 12:16:59,984 INFO L273 TraceCheckUtils]: 48: Hoare triple {4386#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4386#true} is VALID [2018-11-23 12:16:59,984 INFO L273 TraceCheckUtils]: 49: Hoare triple {4386#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4386#true} is VALID [2018-11-23 12:16:59,984 INFO L273 TraceCheckUtils]: 50: Hoare triple {4386#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4386#true} is VALID [2018-11-23 12:16:59,984 INFO L273 TraceCheckUtils]: 51: Hoare triple {4386#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4386#true} is VALID [2018-11-23 12:16:59,984 INFO L273 TraceCheckUtils]: 52: Hoare triple {4386#true} assume !(~i~0 < 60); {4386#true} is VALID [2018-11-23 12:16:59,984 INFO L273 TraceCheckUtils]: 53: Hoare triple {4386#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4386#true} is VALID [2018-11-23 12:16:59,984 INFO L273 TraceCheckUtils]: 54: Hoare triple {4386#true} assume true; {4386#true} is VALID [2018-11-23 12:16:59,984 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {4386#true} {4386#true} #77#return; {4386#true} is VALID [2018-11-23 12:16:59,985 INFO L273 TraceCheckUtils]: 56: Hoare triple {4386#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {4386#true} is VALID [2018-11-23 12:16:59,985 INFO L273 TraceCheckUtils]: 57: Hoare triple {4386#true} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4386#true} is VALID [2018-11-23 12:16:59,985 INFO L273 TraceCheckUtils]: 58: Hoare triple {4386#true} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {4386#true} is VALID [2018-11-23 12:16:59,985 INFO L273 TraceCheckUtils]: 59: Hoare triple {4386#true} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4386#true} is VALID [2018-11-23 12:16:59,985 INFO L273 TraceCheckUtils]: 60: Hoare triple {4386#true} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {4386#true} is VALID [2018-11-23 12:16:59,985 INFO L273 TraceCheckUtils]: 61: Hoare triple {4386#true} assume !(~i~2 < 59); {4386#true} is VALID [2018-11-23 12:16:59,985 INFO L273 TraceCheckUtils]: 62: Hoare triple {4386#true} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {4386#true} is VALID [2018-11-23 12:16:59,985 INFO L256 TraceCheckUtils]: 63: Hoare triple {4386#true} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {4386#true} is VALID [2018-11-23 12:16:59,986 INFO L273 TraceCheckUtils]: 64: Hoare triple {4386#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {4593#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:59,986 INFO L273 TraceCheckUtils]: 65: Hoare triple {4593#(<= sep_~i~0 0)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4593#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:59,987 INFO L273 TraceCheckUtils]: 66: Hoare triple {4593#(<= sep_~i~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4593#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:59,987 INFO L273 TraceCheckUtils]: 67: Hoare triple {4593#(<= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4603#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:59,987 INFO L273 TraceCheckUtils]: 68: Hoare triple {4603#(<= sep_~i~0 1)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4603#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:59,988 INFO L273 TraceCheckUtils]: 69: Hoare triple {4603#(<= sep_~i~0 1)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4603#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:59,988 INFO L273 TraceCheckUtils]: 70: Hoare triple {4603#(<= sep_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4613#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:59,989 INFO L273 TraceCheckUtils]: 71: Hoare triple {4613#(<= sep_~i~0 2)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4613#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:59,989 INFO L273 TraceCheckUtils]: 72: Hoare triple {4613#(<= sep_~i~0 2)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4613#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:59,989 INFO L273 TraceCheckUtils]: 73: Hoare triple {4613#(<= sep_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4623#(<= sep_~i~0 3)} is VALID [2018-11-23 12:16:59,990 INFO L273 TraceCheckUtils]: 74: Hoare triple {4623#(<= sep_~i~0 3)} assume !(~i~0 < 60); {4387#false} is VALID [2018-11-23 12:16:59,990 INFO L273 TraceCheckUtils]: 75: Hoare triple {4387#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4387#false} is VALID [2018-11-23 12:16:59,990 INFO L273 TraceCheckUtils]: 76: Hoare triple {4387#false} assume true; {4387#false} is VALID [2018-11-23 12:16:59,991 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {4387#false} {4386#true} #79#return; {4387#false} is VALID [2018-11-23 12:16:59,991 INFO L273 TraceCheckUtils]: 78: Hoare triple {4387#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {4387#false} is VALID [2018-11-23 12:16:59,991 INFO L273 TraceCheckUtils]: 79: Hoare triple {4387#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4387#false} is VALID [2018-11-23 12:16:59,991 INFO L273 TraceCheckUtils]: 80: Hoare triple {4387#false} assume !false; {4387#false} is VALID [2018-11-23 12:16:59,995 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 74 proven. 12 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-11-23 12:17:00,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:00,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 16 [2018-11-23 12:17:00,015 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 81 [2018-11-23 12:17:00,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:00,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:17:00,087 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:00,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:17:00,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:17:00,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:17:00,088 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 16 states. [2018-11-23 12:17:00,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:00,547 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2018-11-23 12:17:00,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:17:00,547 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 81 [2018-11-23 12:17:00,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:00,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:17:00,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 96 transitions. [2018-11-23 12:17:00,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:17:00,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 96 transitions. [2018-11-23 12:17:00,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 96 transitions. [2018-11-23 12:17:00,686 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:00,688 INFO L225 Difference]: With dead ends: 91 [2018-11-23 12:17:00,689 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 12:17:00,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:17:00,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 12:17:00,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2018-11-23 12:17:00,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:00,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 59 states. [2018-11-23 12:17:00,715 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 59 states. [2018-11-23 12:17:00,716 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 59 states. [2018-11-23 12:17:00,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:00,718 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-11-23 12:17:00,718 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2018-11-23 12:17:00,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:00,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:00,719 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 62 states. [2018-11-23 12:17:00,719 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 62 states. [2018-11-23 12:17:00,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:00,721 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-11-23 12:17:00,721 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2018-11-23 12:17:00,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:00,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:00,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:00,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:00,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:17:00,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2018-11-23 12:17:00,723 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 81 [2018-11-23 12:17:00,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:00,724 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2018-11-23 12:17:00,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:17:00,724 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2018-11-23 12:17:00,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-23 12:17:00,725 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:00,725 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 10, 10, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:17:00,725 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:00,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:00,725 INFO L82 PathProgramCache]: Analyzing trace with hash -313307898, now seen corresponding path program 10 times [2018-11-23 12:17:00,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:00,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:00,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:00,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:00,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:01,482 INFO L256 TraceCheckUtils]: 0: Hoare triple {4983#true} call ULTIMATE.init(); {4983#true} is VALID [2018-11-23 12:17:01,483 INFO L273 TraceCheckUtils]: 1: Hoare triple {4983#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4983#true} is VALID [2018-11-23 12:17:01,483 INFO L273 TraceCheckUtils]: 2: Hoare triple {4983#true} assume true; {4983#true} is VALID [2018-11-23 12:17:01,483 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4983#true} {4983#true} #71#return; {4983#true} is VALID [2018-11-23 12:17:01,484 INFO L256 TraceCheckUtils]: 4: Hoare triple {4983#true} call #t~ret14 := main(); {4983#true} is VALID [2018-11-23 12:17:01,484 INFO L273 TraceCheckUtils]: 5: Hoare triple {4983#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4985#(= main_~i~1 0)} is VALID [2018-11-23 12:17:01,484 INFO L273 TraceCheckUtils]: 6: Hoare triple {4985#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4985#(= main_~i~1 0)} is VALID [2018-11-23 12:17:01,485 INFO L273 TraceCheckUtils]: 7: Hoare triple {4985#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4986#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:01,485 INFO L273 TraceCheckUtils]: 8: Hoare triple {4986#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4986#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:01,486 INFO L273 TraceCheckUtils]: 9: Hoare triple {4986#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4987#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:01,486 INFO L273 TraceCheckUtils]: 10: Hoare triple {4987#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4987#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:01,487 INFO L273 TraceCheckUtils]: 11: Hoare triple {4987#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4988#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:01,487 INFO L273 TraceCheckUtils]: 12: Hoare triple {4988#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4988#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:01,487 INFO L273 TraceCheckUtils]: 13: Hoare triple {4988#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4989#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:01,488 INFO L273 TraceCheckUtils]: 14: Hoare triple {4989#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4989#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:01,489 INFO L273 TraceCheckUtils]: 15: Hoare triple {4989#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4990#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:01,489 INFO L273 TraceCheckUtils]: 16: Hoare triple {4990#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4990#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:01,490 INFO L273 TraceCheckUtils]: 17: Hoare triple {4990#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4991#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:01,491 INFO L273 TraceCheckUtils]: 18: Hoare triple {4991#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4991#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:01,491 INFO L273 TraceCheckUtils]: 19: Hoare triple {4991#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4992#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:01,492 INFO L273 TraceCheckUtils]: 20: Hoare triple {4992#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4992#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:01,493 INFO L273 TraceCheckUtils]: 21: Hoare triple {4992#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4993#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:01,493 INFO L273 TraceCheckUtils]: 22: Hoare triple {4993#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4993#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:01,512 INFO L273 TraceCheckUtils]: 23: Hoare triple {4993#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4994#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:01,514 INFO L273 TraceCheckUtils]: 24: Hoare triple {4994#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4994#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:01,514 INFO L273 TraceCheckUtils]: 25: Hoare triple {4994#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4995#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:01,515 INFO L273 TraceCheckUtils]: 26: Hoare triple {4995#(<= main_~i~1 10)} assume !(~i~1 < 60); {4984#false} is VALID [2018-11-23 12:17:01,515 INFO L256 TraceCheckUtils]: 27: Hoare triple {4984#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {4983#true} is VALID [2018-11-23 12:17:01,515 INFO L273 TraceCheckUtils]: 28: Hoare triple {4983#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {4983#true} is VALID [2018-11-23 12:17:01,515 INFO L273 TraceCheckUtils]: 29: Hoare triple {4983#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4983#true} is VALID [2018-11-23 12:17:01,515 INFO L273 TraceCheckUtils]: 30: Hoare triple {4983#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4983#true} is VALID [2018-11-23 12:17:01,515 INFO L273 TraceCheckUtils]: 31: Hoare triple {4983#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4983#true} is VALID [2018-11-23 12:17:01,516 INFO L273 TraceCheckUtils]: 32: Hoare triple {4983#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4983#true} is VALID [2018-11-23 12:17:01,516 INFO L273 TraceCheckUtils]: 33: Hoare triple {4983#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4983#true} is VALID [2018-11-23 12:17:01,516 INFO L273 TraceCheckUtils]: 34: Hoare triple {4983#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4983#true} is VALID [2018-11-23 12:17:01,516 INFO L273 TraceCheckUtils]: 35: Hoare triple {4983#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4983#true} is VALID [2018-11-23 12:17:01,516 INFO L273 TraceCheckUtils]: 36: Hoare triple {4983#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4983#true} is VALID [2018-11-23 12:17:01,516 INFO L273 TraceCheckUtils]: 37: Hoare triple {4983#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4983#true} is VALID [2018-11-23 12:17:01,516 INFO L273 TraceCheckUtils]: 38: Hoare triple {4983#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4983#true} is VALID [2018-11-23 12:17:01,516 INFO L273 TraceCheckUtils]: 39: Hoare triple {4983#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4983#true} is VALID [2018-11-23 12:17:01,517 INFO L273 TraceCheckUtils]: 40: Hoare triple {4983#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4983#true} is VALID [2018-11-23 12:17:01,517 INFO L273 TraceCheckUtils]: 41: Hoare triple {4983#true} assume !(~i~0 < 60); {4983#true} is VALID [2018-11-23 12:17:01,517 INFO L273 TraceCheckUtils]: 42: Hoare triple {4983#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4983#true} is VALID [2018-11-23 12:17:01,517 INFO L273 TraceCheckUtils]: 43: Hoare triple {4983#true} assume true; {4983#true} is VALID [2018-11-23 12:17:01,517 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {4983#true} {4984#false} #75#return; {4984#false} is VALID [2018-11-23 12:17:01,517 INFO L273 TraceCheckUtils]: 45: Hoare triple {4984#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4984#false} is VALID [2018-11-23 12:17:01,517 INFO L256 TraceCheckUtils]: 46: Hoare triple {4984#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {4983#true} is VALID [2018-11-23 12:17:01,517 INFO L273 TraceCheckUtils]: 47: Hoare triple {4983#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {4983#true} is VALID [2018-11-23 12:17:01,518 INFO L273 TraceCheckUtils]: 48: Hoare triple {4983#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4983#true} is VALID [2018-11-23 12:17:01,518 INFO L273 TraceCheckUtils]: 49: Hoare triple {4983#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4983#true} is VALID [2018-11-23 12:17:01,518 INFO L273 TraceCheckUtils]: 50: Hoare triple {4983#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4983#true} is VALID [2018-11-23 12:17:01,518 INFO L273 TraceCheckUtils]: 51: Hoare triple {4983#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4983#true} is VALID [2018-11-23 12:17:01,518 INFO L273 TraceCheckUtils]: 52: Hoare triple {4983#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4983#true} is VALID [2018-11-23 12:17:01,518 INFO L273 TraceCheckUtils]: 53: Hoare triple {4983#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4983#true} is VALID [2018-11-23 12:17:01,518 INFO L273 TraceCheckUtils]: 54: Hoare triple {4983#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4983#true} is VALID [2018-11-23 12:17:01,518 INFO L273 TraceCheckUtils]: 55: Hoare triple {4983#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4983#true} is VALID [2018-11-23 12:17:01,519 INFO L273 TraceCheckUtils]: 56: Hoare triple {4983#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4983#true} is VALID [2018-11-23 12:17:01,519 INFO L273 TraceCheckUtils]: 57: Hoare triple {4983#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4983#true} is VALID [2018-11-23 12:17:01,519 INFO L273 TraceCheckUtils]: 58: Hoare triple {4983#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4983#true} is VALID [2018-11-23 12:17:01,519 INFO L273 TraceCheckUtils]: 59: Hoare triple {4983#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4983#true} is VALID [2018-11-23 12:17:01,519 INFO L273 TraceCheckUtils]: 60: Hoare triple {4983#true} assume !(~i~0 < 60); {4983#true} is VALID [2018-11-23 12:17:01,519 INFO L273 TraceCheckUtils]: 61: Hoare triple {4983#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4983#true} is VALID [2018-11-23 12:17:01,519 INFO L273 TraceCheckUtils]: 62: Hoare triple {4983#true} assume true; {4983#true} is VALID [2018-11-23 12:17:01,519 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {4983#true} {4984#false} #77#return; {4984#false} is VALID [2018-11-23 12:17:01,519 INFO L273 TraceCheckUtils]: 64: Hoare triple {4984#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {4984#false} is VALID [2018-11-23 12:17:01,520 INFO L273 TraceCheckUtils]: 65: Hoare triple {4984#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4984#false} is VALID [2018-11-23 12:17:01,520 INFO L273 TraceCheckUtils]: 66: Hoare triple {4984#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {4984#false} is VALID [2018-11-23 12:17:01,520 INFO L273 TraceCheckUtils]: 67: Hoare triple {4984#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4984#false} is VALID [2018-11-23 12:17:01,520 INFO L273 TraceCheckUtils]: 68: Hoare triple {4984#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {4984#false} is VALID [2018-11-23 12:17:01,520 INFO L273 TraceCheckUtils]: 69: Hoare triple {4984#false} assume !(~i~2 < 59); {4984#false} is VALID [2018-11-23 12:17:01,520 INFO L273 TraceCheckUtils]: 70: Hoare triple {4984#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {4984#false} is VALID [2018-11-23 12:17:01,520 INFO L256 TraceCheckUtils]: 71: Hoare triple {4984#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {4983#true} is VALID [2018-11-23 12:17:01,520 INFO L273 TraceCheckUtils]: 72: Hoare triple {4983#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {4983#true} is VALID [2018-11-23 12:17:01,521 INFO L273 TraceCheckUtils]: 73: Hoare triple {4983#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4983#true} is VALID [2018-11-23 12:17:01,521 INFO L273 TraceCheckUtils]: 74: Hoare triple {4983#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4983#true} is VALID [2018-11-23 12:17:01,521 INFO L273 TraceCheckUtils]: 75: Hoare triple {4983#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4983#true} is VALID [2018-11-23 12:17:01,521 INFO L273 TraceCheckUtils]: 76: Hoare triple {4983#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4983#true} is VALID [2018-11-23 12:17:01,521 INFO L273 TraceCheckUtils]: 77: Hoare triple {4983#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4983#true} is VALID [2018-11-23 12:17:01,521 INFO L273 TraceCheckUtils]: 78: Hoare triple {4983#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4983#true} is VALID [2018-11-23 12:17:01,521 INFO L273 TraceCheckUtils]: 79: Hoare triple {4983#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4983#true} is VALID [2018-11-23 12:17:01,521 INFO L273 TraceCheckUtils]: 80: Hoare triple {4983#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4983#true} is VALID [2018-11-23 12:17:01,521 INFO L273 TraceCheckUtils]: 81: Hoare triple {4983#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4983#true} is VALID [2018-11-23 12:17:01,522 INFO L273 TraceCheckUtils]: 82: Hoare triple {4983#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4983#true} is VALID [2018-11-23 12:17:01,522 INFO L273 TraceCheckUtils]: 83: Hoare triple {4983#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4983#true} is VALID [2018-11-23 12:17:01,522 INFO L273 TraceCheckUtils]: 84: Hoare triple {4983#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4983#true} is VALID [2018-11-23 12:17:01,522 INFO L273 TraceCheckUtils]: 85: Hoare triple {4983#true} assume !(~i~0 < 60); {4983#true} is VALID [2018-11-23 12:17:01,522 INFO L273 TraceCheckUtils]: 86: Hoare triple {4983#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4983#true} is VALID [2018-11-23 12:17:01,522 INFO L273 TraceCheckUtils]: 87: Hoare triple {4983#true} assume true; {4983#true} is VALID [2018-11-23 12:17:01,522 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {4983#true} {4984#false} #79#return; {4984#false} is VALID [2018-11-23 12:17:01,522 INFO L273 TraceCheckUtils]: 89: Hoare triple {4984#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {4984#false} is VALID [2018-11-23 12:17:01,523 INFO L273 TraceCheckUtils]: 90: Hoare triple {4984#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4984#false} is VALID [2018-11-23 12:17:01,523 INFO L273 TraceCheckUtils]: 91: Hoare triple {4984#false} assume !false; {4984#false} is VALID [2018-11-23 12:17:01,526 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 12:17:01,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:01,527 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:17:01,535 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:17:01,587 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:17:01,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:01,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:01,737 INFO L256 TraceCheckUtils]: 0: Hoare triple {4983#true} call ULTIMATE.init(); {4983#true} is VALID [2018-11-23 12:17:01,738 INFO L273 TraceCheckUtils]: 1: Hoare triple {4983#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4983#true} is VALID [2018-11-23 12:17:01,738 INFO L273 TraceCheckUtils]: 2: Hoare triple {4983#true} assume true; {4983#true} is VALID [2018-11-23 12:17:01,738 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4983#true} {4983#true} #71#return; {4983#true} is VALID [2018-11-23 12:17:01,738 INFO L256 TraceCheckUtils]: 4: Hoare triple {4983#true} call #t~ret14 := main(); {4983#true} is VALID [2018-11-23 12:17:01,739 INFO L273 TraceCheckUtils]: 5: Hoare triple {4983#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5014#(<= main_~i~1 0)} is VALID [2018-11-23 12:17:01,740 INFO L273 TraceCheckUtils]: 6: Hoare triple {5014#(<= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5014#(<= main_~i~1 0)} is VALID [2018-11-23 12:17:01,740 INFO L273 TraceCheckUtils]: 7: Hoare triple {5014#(<= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4986#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:01,741 INFO L273 TraceCheckUtils]: 8: Hoare triple {4986#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4986#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:01,741 INFO L273 TraceCheckUtils]: 9: Hoare triple {4986#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4987#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:01,741 INFO L273 TraceCheckUtils]: 10: Hoare triple {4987#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4987#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:01,742 INFO L273 TraceCheckUtils]: 11: Hoare triple {4987#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4988#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:01,743 INFO L273 TraceCheckUtils]: 12: Hoare triple {4988#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4988#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:01,743 INFO L273 TraceCheckUtils]: 13: Hoare triple {4988#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4989#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:01,744 INFO L273 TraceCheckUtils]: 14: Hoare triple {4989#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4989#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:01,744 INFO L273 TraceCheckUtils]: 15: Hoare triple {4989#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4990#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:01,745 INFO L273 TraceCheckUtils]: 16: Hoare triple {4990#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4990#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:01,746 INFO L273 TraceCheckUtils]: 17: Hoare triple {4990#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4991#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:01,746 INFO L273 TraceCheckUtils]: 18: Hoare triple {4991#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4991#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:01,747 INFO L273 TraceCheckUtils]: 19: Hoare triple {4991#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4992#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:01,747 INFO L273 TraceCheckUtils]: 20: Hoare triple {4992#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4992#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:01,748 INFO L273 TraceCheckUtils]: 21: Hoare triple {4992#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4993#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:01,749 INFO L273 TraceCheckUtils]: 22: Hoare triple {4993#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4993#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:01,750 INFO L273 TraceCheckUtils]: 23: Hoare triple {4993#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4994#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:01,750 INFO L273 TraceCheckUtils]: 24: Hoare triple {4994#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4994#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:01,751 INFO L273 TraceCheckUtils]: 25: Hoare triple {4994#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4995#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:01,751 INFO L273 TraceCheckUtils]: 26: Hoare triple {4995#(<= main_~i~1 10)} assume !(~i~1 < 60); {4984#false} is VALID [2018-11-23 12:17:01,752 INFO L256 TraceCheckUtils]: 27: Hoare triple {4984#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {4984#false} is VALID [2018-11-23 12:17:01,752 INFO L273 TraceCheckUtils]: 28: Hoare triple {4984#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {4984#false} is VALID [2018-11-23 12:17:01,752 INFO L273 TraceCheckUtils]: 29: Hoare triple {4984#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4984#false} is VALID [2018-11-23 12:17:01,752 INFO L273 TraceCheckUtils]: 30: Hoare triple {4984#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4984#false} is VALID [2018-11-23 12:17:01,752 INFO L273 TraceCheckUtils]: 31: Hoare triple {4984#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4984#false} is VALID [2018-11-23 12:17:01,753 INFO L273 TraceCheckUtils]: 32: Hoare triple {4984#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4984#false} is VALID [2018-11-23 12:17:01,753 INFO L273 TraceCheckUtils]: 33: Hoare triple {4984#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4984#false} is VALID [2018-11-23 12:17:01,753 INFO L273 TraceCheckUtils]: 34: Hoare triple {4984#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4984#false} is VALID [2018-11-23 12:17:01,754 INFO L273 TraceCheckUtils]: 35: Hoare triple {4984#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4984#false} is VALID [2018-11-23 12:17:01,754 INFO L273 TraceCheckUtils]: 36: Hoare triple {4984#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4984#false} is VALID [2018-11-23 12:17:01,754 INFO L273 TraceCheckUtils]: 37: Hoare triple {4984#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4984#false} is VALID [2018-11-23 12:17:01,754 INFO L273 TraceCheckUtils]: 38: Hoare triple {4984#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4984#false} is VALID [2018-11-23 12:17:01,755 INFO L273 TraceCheckUtils]: 39: Hoare triple {4984#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4984#false} is VALID [2018-11-23 12:17:01,755 INFO L273 TraceCheckUtils]: 40: Hoare triple {4984#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4984#false} is VALID [2018-11-23 12:17:01,755 INFO L273 TraceCheckUtils]: 41: Hoare triple {4984#false} assume !(~i~0 < 60); {4984#false} is VALID [2018-11-23 12:17:01,755 INFO L273 TraceCheckUtils]: 42: Hoare triple {4984#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4984#false} is VALID [2018-11-23 12:17:01,756 INFO L273 TraceCheckUtils]: 43: Hoare triple {4984#false} assume true; {4984#false} is VALID [2018-11-23 12:17:01,756 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {4984#false} {4984#false} #75#return; {4984#false} is VALID [2018-11-23 12:17:01,756 INFO L273 TraceCheckUtils]: 45: Hoare triple {4984#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4984#false} is VALID [2018-11-23 12:17:01,756 INFO L256 TraceCheckUtils]: 46: Hoare triple {4984#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {4984#false} is VALID [2018-11-23 12:17:01,756 INFO L273 TraceCheckUtils]: 47: Hoare triple {4984#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {4984#false} is VALID [2018-11-23 12:17:01,757 INFO L273 TraceCheckUtils]: 48: Hoare triple {4984#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4984#false} is VALID [2018-11-23 12:17:01,757 INFO L273 TraceCheckUtils]: 49: Hoare triple {4984#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4984#false} is VALID [2018-11-23 12:17:01,757 INFO L273 TraceCheckUtils]: 50: Hoare triple {4984#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4984#false} is VALID [2018-11-23 12:17:01,757 INFO L273 TraceCheckUtils]: 51: Hoare triple {4984#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4984#false} is VALID [2018-11-23 12:17:01,757 INFO L273 TraceCheckUtils]: 52: Hoare triple {4984#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4984#false} is VALID [2018-11-23 12:17:01,757 INFO L273 TraceCheckUtils]: 53: Hoare triple {4984#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4984#false} is VALID [2018-11-23 12:17:01,757 INFO L273 TraceCheckUtils]: 54: Hoare triple {4984#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4984#false} is VALID [2018-11-23 12:17:01,757 INFO L273 TraceCheckUtils]: 55: Hoare triple {4984#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4984#false} is VALID [2018-11-23 12:17:01,758 INFO L273 TraceCheckUtils]: 56: Hoare triple {4984#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4984#false} is VALID [2018-11-23 12:17:01,758 INFO L273 TraceCheckUtils]: 57: Hoare triple {4984#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4984#false} is VALID [2018-11-23 12:17:01,758 INFO L273 TraceCheckUtils]: 58: Hoare triple {4984#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4984#false} is VALID [2018-11-23 12:17:01,758 INFO L273 TraceCheckUtils]: 59: Hoare triple {4984#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4984#false} is VALID [2018-11-23 12:17:01,758 INFO L273 TraceCheckUtils]: 60: Hoare triple {4984#false} assume !(~i~0 < 60); {4984#false} is VALID [2018-11-23 12:17:01,758 INFO L273 TraceCheckUtils]: 61: Hoare triple {4984#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4984#false} is VALID [2018-11-23 12:17:01,758 INFO L273 TraceCheckUtils]: 62: Hoare triple {4984#false} assume true; {4984#false} is VALID [2018-11-23 12:17:01,758 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {4984#false} {4984#false} #77#return; {4984#false} is VALID [2018-11-23 12:17:01,759 INFO L273 TraceCheckUtils]: 64: Hoare triple {4984#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {4984#false} is VALID [2018-11-23 12:17:01,759 INFO L273 TraceCheckUtils]: 65: Hoare triple {4984#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4984#false} is VALID [2018-11-23 12:17:01,759 INFO L273 TraceCheckUtils]: 66: Hoare triple {4984#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {4984#false} is VALID [2018-11-23 12:17:01,759 INFO L273 TraceCheckUtils]: 67: Hoare triple {4984#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4984#false} is VALID [2018-11-23 12:17:01,759 INFO L273 TraceCheckUtils]: 68: Hoare triple {4984#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {4984#false} is VALID [2018-11-23 12:17:01,759 INFO L273 TraceCheckUtils]: 69: Hoare triple {4984#false} assume !(~i~2 < 59); {4984#false} is VALID [2018-11-23 12:17:01,759 INFO L273 TraceCheckUtils]: 70: Hoare triple {4984#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {4984#false} is VALID [2018-11-23 12:17:01,759 INFO L256 TraceCheckUtils]: 71: Hoare triple {4984#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {4984#false} is VALID [2018-11-23 12:17:01,760 INFO L273 TraceCheckUtils]: 72: Hoare triple {4984#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {4984#false} is VALID [2018-11-23 12:17:01,760 INFO L273 TraceCheckUtils]: 73: Hoare triple {4984#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4984#false} is VALID [2018-11-23 12:17:01,760 INFO L273 TraceCheckUtils]: 74: Hoare triple {4984#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4984#false} is VALID [2018-11-23 12:17:01,760 INFO L273 TraceCheckUtils]: 75: Hoare triple {4984#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4984#false} is VALID [2018-11-23 12:17:01,760 INFO L273 TraceCheckUtils]: 76: Hoare triple {4984#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4984#false} is VALID [2018-11-23 12:17:01,760 INFO L273 TraceCheckUtils]: 77: Hoare triple {4984#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4984#false} is VALID [2018-11-23 12:17:01,760 INFO L273 TraceCheckUtils]: 78: Hoare triple {4984#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4984#false} is VALID [2018-11-23 12:17:01,761 INFO L273 TraceCheckUtils]: 79: Hoare triple {4984#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4984#false} is VALID [2018-11-23 12:17:01,761 INFO L273 TraceCheckUtils]: 80: Hoare triple {4984#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4984#false} is VALID [2018-11-23 12:17:01,761 INFO L273 TraceCheckUtils]: 81: Hoare triple {4984#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4984#false} is VALID [2018-11-23 12:17:01,761 INFO L273 TraceCheckUtils]: 82: Hoare triple {4984#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4984#false} is VALID [2018-11-23 12:17:01,761 INFO L273 TraceCheckUtils]: 83: Hoare triple {4984#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4984#false} is VALID [2018-11-23 12:17:01,761 INFO L273 TraceCheckUtils]: 84: Hoare triple {4984#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4984#false} is VALID [2018-11-23 12:17:01,761 INFO L273 TraceCheckUtils]: 85: Hoare triple {4984#false} assume !(~i~0 < 60); {4984#false} is VALID [2018-11-23 12:17:01,762 INFO L273 TraceCheckUtils]: 86: Hoare triple {4984#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4984#false} is VALID [2018-11-23 12:17:01,762 INFO L273 TraceCheckUtils]: 87: Hoare triple {4984#false} assume true; {4984#false} is VALID [2018-11-23 12:17:01,762 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {4984#false} {4984#false} #79#return; {4984#false} is VALID [2018-11-23 12:17:01,762 INFO L273 TraceCheckUtils]: 89: Hoare triple {4984#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {4984#false} is VALID [2018-11-23 12:17:01,762 INFO L273 TraceCheckUtils]: 90: Hoare triple {4984#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4984#false} is VALID [2018-11-23 12:17:01,762 INFO L273 TraceCheckUtils]: 91: Hoare triple {4984#false} assume !false; {4984#false} is VALID [2018-11-23 12:17:01,767 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 12:17:01,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:01,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 12:17:01,787 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 92 [2018-11-23 12:17:01,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:01,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:17:01,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:01,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:17:01,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:17:01,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:17:01,849 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand 14 states. [2018-11-23 12:17:02,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:02,047 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2018-11-23 12:17:02,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:17:02,047 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 92 [2018-11-23 12:17:02,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:02,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:17:02,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2018-11-23 12:17:02,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:17:02,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2018-11-23 12:17:02,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 78 transitions. [2018-11-23 12:17:02,670 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-23 12:17:02,672 INFO L225 Difference]: With dead ends: 94 [2018-11-23 12:17:02,672 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 12:17:02,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:17:02,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 12:17:02,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-11-23 12:17:02,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:02,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 61 states. [2018-11-23 12:17:02,699 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 61 states. [2018-11-23 12:17:02,699 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 61 states. [2018-11-23 12:17:02,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:02,702 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-23 12:17:02,702 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-11-23 12:17:02,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:02,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:02,703 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 62 states. [2018-11-23 12:17:02,703 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 62 states. [2018-11-23 12:17:02,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:02,705 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-23 12:17:02,705 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-11-23 12:17:02,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:02,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:02,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:02,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:02,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 12:17:02,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2018-11-23 12:17:02,708 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 92 [2018-11-23 12:17:02,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:02,708 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2018-11-23 12:17:02,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:17:02,708 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2018-11-23 12:17:02,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-23 12:17:02,709 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:02,710 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:17:02,710 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:02,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:02,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1157101992, now seen corresponding path program 11 times [2018-11-23 12:17:02,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:02,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:02,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:02,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:02,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:05,047 INFO L256 TraceCheckUtils]: 0: Hoare triple {5619#true} call ULTIMATE.init(); {5619#true} is VALID [2018-11-23 12:17:05,047 INFO L273 TraceCheckUtils]: 1: Hoare triple {5619#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5619#true} is VALID [2018-11-23 12:17:05,047 INFO L273 TraceCheckUtils]: 2: Hoare triple {5619#true} assume true; {5619#true} is VALID [2018-11-23 12:17:05,047 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5619#true} {5619#true} #71#return; {5619#true} is VALID [2018-11-23 12:17:05,048 INFO L256 TraceCheckUtils]: 4: Hoare triple {5619#true} call #t~ret14 := main(); {5619#true} is VALID [2018-11-23 12:17:05,048 INFO L273 TraceCheckUtils]: 5: Hoare triple {5619#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5621#(= main_~i~1 0)} is VALID [2018-11-23 12:17:05,049 INFO L273 TraceCheckUtils]: 6: Hoare triple {5621#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5621#(= main_~i~1 0)} is VALID [2018-11-23 12:17:05,050 INFO L273 TraceCheckUtils]: 7: Hoare triple {5621#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5622#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:05,050 INFO L273 TraceCheckUtils]: 8: Hoare triple {5622#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5622#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:05,050 INFO L273 TraceCheckUtils]: 9: Hoare triple {5622#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5623#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:05,051 INFO L273 TraceCheckUtils]: 10: Hoare triple {5623#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5623#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:05,051 INFO L273 TraceCheckUtils]: 11: Hoare triple {5623#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5624#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:05,052 INFO L273 TraceCheckUtils]: 12: Hoare triple {5624#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5624#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:05,052 INFO L273 TraceCheckUtils]: 13: Hoare triple {5624#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5625#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:05,053 INFO L273 TraceCheckUtils]: 14: Hoare triple {5625#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5625#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:05,053 INFO L273 TraceCheckUtils]: 15: Hoare triple {5625#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5626#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:05,054 INFO L273 TraceCheckUtils]: 16: Hoare triple {5626#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5626#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:05,055 INFO L273 TraceCheckUtils]: 17: Hoare triple {5626#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5627#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:05,055 INFO L273 TraceCheckUtils]: 18: Hoare triple {5627#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5627#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:05,056 INFO L273 TraceCheckUtils]: 19: Hoare triple {5627#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5628#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:05,057 INFO L273 TraceCheckUtils]: 20: Hoare triple {5628#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5628#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:05,057 INFO L273 TraceCheckUtils]: 21: Hoare triple {5628#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5629#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:05,058 INFO L273 TraceCheckUtils]: 22: Hoare triple {5629#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5629#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:05,059 INFO L273 TraceCheckUtils]: 23: Hoare triple {5629#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5630#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:05,059 INFO L273 TraceCheckUtils]: 24: Hoare triple {5630#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5630#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:05,060 INFO L273 TraceCheckUtils]: 25: Hoare triple {5630#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5631#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:05,061 INFO L273 TraceCheckUtils]: 26: Hoare triple {5631#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5631#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:05,061 INFO L273 TraceCheckUtils]: 27: Hoare triple {5631#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5632#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:05,062 INFO L273 TraceCheckUtils]: 28: Hoare triple {5632#(<= main_~i~1 11)} assume !(~i~1 < 60); {5620#false} is VALID [2018-11-23 12:17:05,062 INFO L256 TraceCheckUtils]: 29: Hoare triple {5620#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {5619#true} is VALID [2018-11-23 12:17:05,063 INFO L273 TraceCheckUtils]: 30: Hoare triple {5619#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {5619#true} is VALID [2018-11-23 12:17:05,063 INFO L273 TraceCheckUtils]: 31: Hoare triple {5619#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5619#true} is VALID [2018-11-23 12:17:05,063 INFO L273 TraceCheckUtils]: 32: Hoare triple {5619#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5619#true} is VALID [2018-11-23 12:17:05,064 INFO L273 TraceCheckUtils]: 33: Hoare triple {5619#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5619#true} is VALID [2018-11-23 12:17:05,064 INFO L273 TraceCheckUtils]: 34: Hoare triple {5619#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5619#true} is VALID [2018-11-23 12:17:05,064 INFO L273 TraceCheckUtils]: 35: Hoare triple {5619#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5619#true} is VALID [2018-11-23 12:17:05,064 INFO L273 TraceCheckUtils]: 36: Hoare triple {5619#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5619#true} is VALID [2018-11-23 12:17:05,065 INFO L273 TraceCheckUtils]: 37: Hoare triple {5619#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5619#true} is VALID [2018-11-23 12:17:05,065 INFO L273 TraceCheckUtils]: 38: Hoare triple {5619#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5619#true} is VALID [2018-11-23 12:17:05,065 INFO L273 TraceCheckUtils]: 39: Hoare triple {5619#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5619#true} is VALID [2018-11-23 12:17:05,065 INFO L273 TraceCheckUtils]: 40: Hoare triple {5619#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5619#true} is VALID [2018-11-23 12:17:05,065 INFO L273 TraceCheckUtils]: 41: Hoare triple {5619#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5619#true} is VALID [2018-11-23 12:17:05,066 INFO L273 TraceCheckUtils]: 42: Hoare triple {5619#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5619#true} is VALID [2018-11-23 12:17:05,066 INFO L273 TraceCheckUtils]: 43: Hoare triple {5619#true} assume !(~i~0 < 60); {5619#true} is VALID [2018-11-23 12:17:05,066 INFO L273 TraceCheckUtils]: 44: Hoare triple {5619#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5619#true} is VALID [2018-11-23 12:17:05,066 INFO L273 TraceCheckUtils]: 45: Hoare triple {5619#true} assume true; {5619#true} is VALID [2018-11-23 12:17:05,066 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5619#true} {5620#false} #75#return; {5620#false} is VALID [2018-11-23 12:17:05,066 INFO L273 TraceCheckUtils]: 47: Hoare triple {5620#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5620#false} is VALID [2018-11-23 12:17:05,067 INFO L256 TraceCheckUtils]: 48: Hoare triple {5620#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {5619#true} is VALID [2018-11-23 12:17:05,067 INFO L273 TraceCheckUtils]: 49: Hoare triple {5619#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {5619#true} is VALID [2018-11-23 12:17:05,067 INFO L273 TraceCheckUtils]: 50: Hoare triple {5619#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5619#true} is VALID [2018-11-23 12:17:05,067 INFO L273 TraceCheckUtils]: 51: Hoare triple {5619#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5619#true} is VALID [2018-11-23 12:17:05,067 INFO L273 TraceCheckUtils]: 52: Hoare triple {5619#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5619#true} is VALID [2018-11-23 12:17:05,067 INFO L273 TraceCheckUtils]: 53: Hoare triple {5619#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5619#true} is VALID [2018-11-23 12:17:05,067 INFO L273 TraceCheckUtils]: 54: Hoare triple {5619#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5619#true} is VALID [2018-11-23 12:17:05,067 INFO L273 TraceCheckUtils]: 55: Hoare triple {5619#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5619#true} is VALID [2018-11-23 12:17:05,067 INFO L273 TraceCheckUtils]: 56: Hoare triple {5619#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5619#true} is VALID [2018-11-23 12:17:05,068 INFO L273 TraceCheckUtils]: 57: Hoare triple {5619#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5619#true} is VALID [2018-11-23 12:17:05,068 INFO L273 TraceCheckUtils]: 58: Hoare triple {5619#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5619#true} is VALID [2018-11-23 12:17:05,068 INFO L273 TraceCheckUtils]: 59: Hoare triple {5619#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5619#true} is VALID [2018-11-23 12:17:05,068 INFO L273 TraceCheckUtils]: 60: Hoare triple {5619#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5619#true} is VALID [2018-11-23 12:17:05,068 INFO L273 TraceCheckUtils]: 61: Hoare triple {5619#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5619#true} is VALID [2018-11-23 12:17:05,068 INFO L273 TraceCheckUtils]: 62: Hoare triple {5619#true} assume !(~i~0 < 60); {5619#true} is VALID [2018-11-23 12:17:05,068 INFO L273 TraceCheckUtils]: 63: Hoare triple {5619#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5619#true} is VALID [2018-11-23 12:17:05,068 INFO L273 TraceCheckUtils]: 64: Hoare triple {5619#true} assume true; {5619#true} is VALID [2018-11-23 12:17:05,069 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {5619#true} {5620#false} #77#return; {5620#false} is VALID [2018-11-23 12:17:05,069 INFO L273 TraceCheckUtils]: 66: Hoare triple {5620#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {5620#false} is VALID [2018-11-23 12:17:05,069 INFO L273 TraceCheckUtils]: 67: Hoare triple {5620#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {5620#false} is VALID [2018-11-23 12:17:05,069 INFO L273 TraceCheckUtils]: 68: Hoare triple {5620#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {5620#false} is VALID [2018-11-23 12:17:05,069 INFO L273 TraceCheckUtils]: 69: Hoare triple {5620#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {5620#false} is VALID [2018-11-23 12:17:05,069 INFO L273 TraceCheckUtils]: 70: Hoare triple {5620#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {5620#false} is VALID [2018-11-23 12:17:05,069 INFO L273 TraceCheckUtils]: 71: Hoare triple {5620#false} assume !(~i~2 < 59); {5620#false} is VALID [2018-11-23 12:17:05,069 INFO L273 TraceCheckUtils]: 72: Hoare triple {5620#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {5620#false} is VALID [2018-11-23 12:17:05,070 INFO L256 TraceCheckUtils]: 73: Hoare triple {5620#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {5619#true} is VALID [2018-11-23 12:17:05,070 INFO L273 TraceCheckUtils]: 74: Hoare triple {5619#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {5619#true} is VALID [2018-11-23 12:17:05,070 INFO L273 TraceCheckUtils]: 75: Hoare triple {5619#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5619#true} is VALID [2018-11-23 12:17:05,070 INFO L273 TraceCheckUtils]: 76: Hoare triple {5619#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5619#true} is VALID [2018-11-23 12:17:05,070 INFO L273 TraceCheckUtils]: 77: Hoare triple {5619#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5619#true} is VALID [2018-11-23 12:17:05,070 INFO L273 TraceCheckUtils]: 78: Hoare triple {5619#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5619#true} is VALID [2018-11-23 12:17:05,070 INFO L273 TraceCheckUtils]: 79: Hoare triple {5619#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5619#true} is VALID [2018-11-23 12:17:05,070 INFO L273 TraceCheckUtils]: 80: Hoare triple {5619#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5619#true} is VALID [2018-11-23 12:17:05,071 INFO L273 TraceCheckUtils]: 81: Hoare triple {5619#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5619#true} is VALID [2018-11-23 12:17:05,071 INFO L273 TraceCheckUtils]: 82: Hoare triple {5619#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5619#true} is VALID [2018-11-23 12:17:05,071 INFO L273 TraceCheckUtils]: 83: Hoare triple {5619#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5619#true} is VALID [2018-11-23 12:17:05,071 INFO L273 TraceCheckUtils]: 84: Hoare triple {5619#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5619#true} is VALID [2018-11-23 12:17:05,071 INFO L273 TraceCheckUtils]: 85: Hoare triple {5619#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5619#true} is VALID [2018-11-23 12:17:05,071 INFO L273 TraceCheckUtils]: 86: Hoare triple {5619#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5619#true} is VALID [2018-11-23 12:17:05,071 INFO L273 TraceCheckUtils]: 87: Hoare triple {5619#true} assume !(~i~0 < 60); {5619#true} is VALID [2018-11-23 12:17:05,072 INFO L273 TraceCheckUtils]: 88: Hoare triple {5619#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5619#true} is VALID [2018-11-23 12:17:05,072 INFO L273 TraceCheckUtils]: 89: Hoare triple {5619#true} assume true; {5619#true} is VALID [2018-11-23 12:17:05,072 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {5619#true} {5620#false} #79#return; {5620#false} is VALID [2018-11-23 12:17:05,072 INFO L273 TraceCheckUtils]: 91: Hoare triple {5620#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {5620#false} is VALID [2018-11-23 12:17:05,072 INFO L273 TraceCheckUtils]: 92: Hoare triple {5620#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {5620#false} is VALID [2018-11-23 12:17:05,073 INFO L273 TraceCheckUtils]: 93: Hoare triple {5620#false} assume !false; {5620#false} is VALID [2018-11-23 12:17:05,078 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 12:17:05,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:05,078 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:17:05,094 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:17:05,256 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-23 12:17:05,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:05,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:05,411 INFO L256 TraceCheckUtils]: 0: Hoare triple {5619#true} call ULTIMATE.init(); {5619#true} is VALID [2018-11-23 12:17:05,412 INFO L273 TraceCheckUtils]: 1: Hoare triple {5619#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5619#true} is VALID [2018-11-23 12:17:05,412 INFO L273 TraceCheckUtils]: 2: Hoare triple {5619#true} assume true; {5619#true} is VALID [2018-11-23 12:17:05,412 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5619#true} {5619#true} #71#return; {5619#true} is VALID [2018-11-23 12:17:05,412 INFO L256 TraceCheckUtils]: 4: Hoare triple {5619#true} call #t~ret14 := main(); {5619#true} is VALID [2018-11-23 12:17:05,413 INFO L273 TraceCheckUtils]: 5: Hoare triple {5619#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5619#true} is VALID [2018-11-23 12:17:05,413 INFO L273 TraceCheckUtils]: 6: Hoare triple {5619#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5619#true} is VALID [2018-11-23 12:17:05,413 INFO L273 TraceCheckUtils]: 7: Hoare triple {5619#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5619#true} is VALID [2018-11-23 12:17:05,413 INFO L273 TraceCheckUtils]: 8: Hoare triple {5619#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5619#true} is VALID [2018-11-23 12:17:05,413 INFO L273 TraceCheckUtils]: 9: Hoare triple {5619#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5619#true} is VALID [2018-11-23 12:17:05,414 INFO L273 TraceCheckUtils]: 10: Hoare triple {5619#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5619#true} is VALID [2018-11-23 12:17:05,414 INFO L273 TraceCheckUtils]: 11: Hoare triple {5619#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5619#true} is VALID [2018-11-23 12:17:05,414 INFO L273 TraceCheckUtils]: 12: Hoare triple {5619#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5619#true} is VALID [2018-11-23 12:17:05,414 INFO L273 TraceCheckUtils]: 13: Hoare triple {5619#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5619#true} is VALID [2018-11-23 12:17:05,414 INFO L273 TraceCheckUtils]: 14: Hoare triple {5619#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5619#true} is VALID [2018-11-23 12:17:05,414 INFO L273 TraceCheckUtils]: 15: Hoare triple {5619#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5619#true} is VALID [2018-11-23 12:17:05,414 INFO L273 TraceCheckUtils]: 16: Hoare triple {5619#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5619#true} is VALID [2018-11-23 12:17:05,414 INFO L273 TraceCheckUtils]: 17: Hoare triple {5619#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5619#true} is VALID [2018-11-23 12:17:05,415 INFO L273 TraceCheckUtils]: 18: Hoare triple {5619#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5619#true} is VALID [2018-11-23 12:17:05,415 INFO L273 TraceCheckUtils]: 19: Hoare triple {5619#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5619#true} is VALID [2018-11-23 12:17:05,415 INFO L273 TraceCheckUtils]: 20: Hoare triple {5619#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5619#true} is VALID [2018-11-23 12:17:05,415 INFO L273 TraceCheckUtils]: 21: Hoare triple {5619#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5619#true} is VALID [2018-11-23 12:17:05,415 INFO L273 TraceCheckUtils]: 22: Hoare triple {5619#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5619#true} is VALID [2018-11-23 12:17:05,415 INFO L273 TraceCheckUtils]: 23: Hoare triple {5619#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5619#true} is VALID [2018-11-23 12:17:05,415 INFO L273 TraceCheckUtils]: 24: Hoare triple {5619#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5619#true} is VALID [2018-11-23 12:17:05,415 INFO L273 TraceCheckUtils]: 25: Hoare triple {5619#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5619#true} is VALID [2018-11-23 12:17:05,415 INFO L273 TraceCheckUtils]: 26: Hoare triple {5619#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5619#true} is VALID [2018-11-23 12:17:05,416 INFO L273 TraceCheckUtils]: 27: Hoare triple {5619#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5619#true} is VALID [2018-11-23 12:17:05,416 INFO L273 TraceCheckUtils]: 28: Hoare triple {5619#true} assume !(~i~1 < 60); {5619#true} is VALID [2018-11-23 12:17:05,416 INFO L256 TraceCheckUtils]: 29: Hoare triple {5619#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {5619#true} is VALID [2018-11-23 12:17:05,416 INFO L273 TraceCheckUtils]: 30: Hoare triple {5619#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {5726#(<= sep_~i~0 0)} is VALID [2018-11-23 12:17:05,417 INFO L273 TraceCheckUtils]: 31: Hoare triple {5726#(<= sep_~i~0 0)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5726#(<= sep_~i~0 0)} is VALID [2018-11-23 12:17:05,417 INFO L273 TraceCheckUtils]: 32: Hoare triple {5726#(<= sep_~i~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5726#(<= sep_~i~0 0)} is VALID [2018-11-23 12:17:05,417 INFO L273 TraceCheckUtils]: 33: Hoare triple {5726#(<= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5736#(<= sep_~i~0 1)} is VALID [2018-11-23 12:17:05,418 INFO L273 TraceCheckUtils]: 34: Hoare triple {5736#(<= sep_~i~0 1)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5736#(<= sep_~i~0 1)} is VALID [2018-11-23 12:17:05,418 INFO L273 TraceCheckUtils]: 35: Hoare triple {5736#(<= sep_~i~0 1)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5736#(<= sep_~i~0 1)} is VALID [2018-11-23 12:17:05,418 INFO L273 TraceCheckUtils]: 36: Hoare triple {5736#(<= sep_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5746#(<= sep_~i~0 2)} is VALID [2018-11-23 12:17:05,419 INFO L273 TraceCheckUtils]: 37: Hoare triple {5746#(<= sep_~i~0 2)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5746#(<= sep_~i~0 2)} is VALID [2018-11-23 12:17:05,419 INFO L273 TraceCheckUtils]: 38: Hoare triple {5746#(<= sep_~i~0 2)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5746#(<= sep_~i~0 2)} is VALID [2018-11-23 12:17:05,420 INFO L273 TraceCheckUtils]: 39: Hoare triple {5746#(<= sep_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5756#(<= sep_~i~0 3)} is VALID [2018-11-23 12:17:05,421 INFO L273 TraceCheckUtils]: 40: Hoare triple {5756#(<= sep_~i~0 3)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5756#(<= sep_~i~0 3)} is VALID [2018-11-23 12:17:05,421 INFO L273 TraceCheckUtils]: 41: Hoare triple {5756#(<= sep_~i~0 3)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5756#(<= sep_~i~0 3)} is VALID [2018-11-23 12:17:05,422 INFO L273 TraceCheckUtils]: 42: Hoare triple {5756#(<= sep_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5766#(<= sep_~i~0 4)} is VALID [2018-11-23 12:17:05,423 INFO L273 TraceCheckUtils]: 43: Hoare triple {5766#(<= sep_~i~0 4)} assume !(~i~0 < 60); {5620#false} is VALID [2018-11-23 12:17:05,423 INFO L273 TraceCheckUtils]: 44: Hoare triple {5620#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5620#false} is VALID [2018-11-23 12:17:05,423 INFO L273 TraceCheckUtils]: 45: Hoare triple {5620#false} assume true; {5620#false} is VALID [2018-11-23 12:17:05,423 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5620#false} {5619#true} #75#return; {5620#false} is VALID [2018-11-23 12:17:05,423 INFO L273 TraceCheckUtils]: 47: Hoare triple {5620#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5620#false} is VALID [2018-11-23 12:17:05,424 INFO L256 TraceCheckUtils]: 48: Hoare triple {5620#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {5620#false} is VALID [2018-11-23 12:17:05,424 INFO L273 TraceCheckUtils]: 49: Hoare triple {5620#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {5620#false} is VALID [2018-11-23 12:17:05,424 INFO L273 TraceCheckUtils]: 50: Hoare triple {5620#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5620#false} is VALID [2018-11-23 12:17:05,424 INFO L273 TraceCheckUtils]: 51: Hoare triple {5620#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5620#false} is VALID [2018-11-23 12:17:05,424 INFO L273 TraceCheckUtils]: 52: Hoare triple {5620#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5620#false} is VALID [2018-11-23 12:17:05,425 INFO L273 TraceCheckUtils]: 53: Hoare triple {5620#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5620#false} is VALID [2018-11-23 12:17:05,425 INFO L273 TraceCheckUtils]: 54: Hoare triple {5620#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5620#false} is VALID [2018-11-23 12:17:05,425 INFO L273 TraceCheckUtils]: 55: Hoare triple {5620#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5620#false} is VALID [2018-11-23 12:17:05,425 INFO L273 TraceCheckUtils]: 56: Hoare triple {5620#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5620#false} is VALID [2018-11-23 12:17:05,425 INFO L273 TraceCheckUtils]: 57: Hoare triple {5620#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5620#false} is VALID [2018-11-23 12:17:05,426 INFO L273 TraceCheckUtils]: 58: Hoare triple {5620#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5620#false} is VALID [2018-11-23 12:17:05,426 INFO L273 TraceCheckUtils]: 59: Hoare triple {5620#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5620#false} is VALID [2018-11-23 12:17:05,426 INFO L273 TraceCheckUtils]: 60: Hoare triple {5620#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5620#false} is VALID [2018-11-23 12:17:05,426 INFO L273 TraceCheckUtils]: 61: Hoare triple {5620#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5620#false} is VALID [2018-11-23 12:17:05,426 INFO L273 TraceCheckUtils]: 62: Hoare triple {5620#false} assume !(~i~0 < 60); {5620#false} is VALID [2018-11-23 12:17:05,427 INFO L273 TraceCheckUtils]: 63: Hoare triple {5620#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5620#false} is VALID [2018-11-23 12:17:05,427 INFO L273 TraceCheckUtils]: 64: Hoare triple {5620#false} assume true; {5620#false} is VALID [2018-11-23 12:17:05,427 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {5620#false} {5620#false} #77#return; {5620#false} is VALID [2018-11-23 12:17:05,427 INFO L273 TraceCheckUtils]: 66: Hoare triple {5620#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {5620#false} is VALID [2018-11-23 12:17:05,427 INFO L273 TraceCheckUtils]: 67: Hoare triple {5620#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {5620#false} is VALID [2018-11-23 12:17:05,428 INFO L273 TraceCheckUtils]: 68: Hoare triple {5620#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {5620#false} is VALID [2018-11-23 12:17:05,428 INFO L273 TraceCheckUtils]: 69: Hoare triple {5620#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {5620#false} is VALID [2018-11-23 12:17:05,428 INFO L273 TraceCheckUtils]: 70: Hoare triple {5620#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {5620#false} is VALID [2018-11-23 12:17:05,428 INFO L273 TraceCheckUtils]: 71: Hoare triple {5620#false} assume !(~i~2 < 59); {5620#false} is VALID [2018-11-23 12:17:05,428 INFO L273 TraceCheckUtils]: 72: Hoare triple {5620#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {5620#false} is VALID [2018-11-23 12:17:05,428 INFO L256 TraceCheckUtils]: 73: Hoare triple {5620#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {5620#false} is VALID [2018-11-23 12:17:05,428 INFO L273 TraceCheckUtils]: 74: Hoare triple {5620#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {5620#false} is VALID [2018-11-23 12:17:05,428 INFO L273 TraceCheckUtils]: 75: Hoare triple {5620#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5620#false} is VALID [2018-11-23 12:17:05,429 INFO L273 TraceCheckUtils]: 76: Hoare triple {5620#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5620#false} is VALID [2018-11-23 12:17:05,429 INFO L273 TraceCheckUtils]: 77: Hoare triple {5620#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5620#false} is VALID [2018-11-23 12:17:05,429 INFO L273 TraceCheckUtils]: 78: Hoare triple {5620#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5620#false} is VALID [2018-11-23 12:17:05,429 INFO L273 TraceCheckUtils]: 79: Hoare triple {5620#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5620#false} is VALID [2018-11-23 12:17:05,429 INFO L273 TraceCheckUtils]: 80: Hoare triple {5620#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5620#false} is VALID [2018-11-23 12:17:05,429 INFO L273 TraceCheckUtils]: 81: Hoare triple {5620#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5620#false} is VALID [2018-11-23 12:17:05,429 INFO L273 TraceCheckUtils]: 82: Hoare triple {5620#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5620#false} is VALID [2018-11-23 12:17:05,429 INFO L273 TraceCheckUtils]: 83: Hoare triple {5620#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5620#false} is VALID [2018-11-23 12:17:05,429 INFO L273 TraceCheckUtils]: 84: Hoare triple {5620#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5620#false} is VALID [2018-11-23 12:17:05,430 INFO L273 TraceCheckUtils]: 85: Hoare triple {5620#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5620#false} is VALID [2018-11-23 12:17:05,430 INFO L273 TraceCheckUtils]: 86: Hoare triple {5620#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5620#false} is VALID [2018-11-23 12:17:05,430 INFO L273 TraceCheckUtils]: 87: Hoare triple {5620#false} assume !(~i~0 < 60); {5620#false} is VALID [2018-11-23 12:17:05,430 INFO L273 TraceCheckUtils]: 88: Hoare triple {5620#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5620#false} is VALID [2018-11-23 12:17:05,430 INFO L273 TraceCheckUtils]: 89: Hoare triple {5620#false} assume true; {5620#false} is VALID [2018-11-23 12:17:05,430 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {5620#false} {5620#false} #79#return; {5620#false} is VALID [2018-11-23 12:17:05,430 INFO L273 TraceCheckUtils]: 91: Hoare triple {5620#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {5620#false} is VALID [2018-11-23 12:17:05,430 INFO L273 TraceCheckUtils]: 92: Hoare triple {5620#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {5620#false} is VALID [2018-11-23 12:17:05,431 INFO L273 TraceCheckUtils]: 93: Hoare triple {5620#false} assume !false; {5620#false} is VALID [2018-11-23 12:17:05,434 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 116 proven. 22 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-11-23 12:17:05,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:05,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2018-11-23 12:17:05,453 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 94 [2018-11-23 12:17:05,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:05,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:17:05,546 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:05,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:17:05,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:17:05,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:17:05,550 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand 19 states. [2018-11-23 12:17:05,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:05,864 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2018-11-23 12:17:05,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:17:05,864 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 94 [2018-11-23 12:17:05,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:05,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:17:05,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 104 transitions. [2018-11-23 12:17:05,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:17:05,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 104 transitions. [2018-11-23 12:17:05,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 104 transitions. [2018-11-23 12:17:06,323 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:06,325 INFO L225 Difference]: With dead ends: 101 [2018-11-23 12:17:06,325 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 12:17:06,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:17:06,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 12:17:06,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-11-23 12:17:06,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:06,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 66 states. [2018-11-23 12:17:06,480 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 66 states. [2018-11-23 12:17:06,481 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 66 states. [2018-11-23 12:17:06,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:06,483 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2018-11-23 12:17:06,483 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2018-11-23 12:17:06,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:06,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:06,484 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 69 states. [2018-11-23 12:17:06,484 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 69 states. [2018-11-23 12:17:06,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:06,486 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2018-11-23 12:17:06,486 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2018-11-23 12:17:06,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:06,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:06,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:06,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:06,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 12:17:06,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2018-11-23 12:17:06,489 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 94 [2018-11-23 12:17:06,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:06,489 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2018-11-23 12:17:06,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:17:06,489 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-11-23 12:17:06,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-23 12:17:06,490 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:06,491 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 12, 12, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:17:06,491 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:06,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:06,491 INFO L82 PathProgramCache]: Analyzing trace with hash -135209269, now seen corresponding path program 12 times [2018-11-23 12:17:06,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:06,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:06,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:06,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:06,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:07,153 INFO L256 TraceCheckUtils]: 0: Hoare triple {6296#true} call ULTIMATE.init(); {6296#true} is VALID [2018-11-23 12:17:07,154 INFO L273 TraceCheckUtils]: 1: Hoare triple {6296#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6296#true} is VALID [2018-11-23 12:17:07,154 INFO L273 TraceCheckUtils]: 2: Hoare triple {6296#true} assume true; {6296#true} is VALID [2018-11-23 12:17:07,154 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6296#true} {6296#true} #71#return; {6296#true} is VALID [2018-11-23 12:17:07,154 INFO L256 TraceCheckUtils]: 4: Hoare triple {6296#true} call #t~ret14 := main(); {6296#true} is VALID [2018-11-23 12:17:07,165 INFO L273 TraceCheckUtils]: 5: Hoare triple {6296#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {6298#(= main_~i~1 0)} is VALID [2018-11-23 12:17:07,165 INFO L273 TraceCheckUtils]: 6: Hoare triple {6298#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6298#(= main_~i~1 0)} is VALID [2018-11-23 12:17:07,166 INFO L273 TraceCheckUtils]: 7: Hoare triple {6298#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6299#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:07,166 INFO L273 TraceCheckUtils]: 8: Hoare triple {6299#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6299#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:07,166 INFO L273 TraceCheckUtils]: 9: Hoare triple {6299#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6300#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:07,167 INFO L273 TraceCheckUtils]: 10: Hoare triple {6300#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6300#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:07,167 INFO L273 TraceCheckUtils]: 11: Hoare triple {6300#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6301#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:07,168 INFO L273 TraceCheckUtils]: 12: Hoare triple {6301#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6301#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:07,168 INFO L273 TraceCheckUtils]: 13: Hoare triple {6301#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6302#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:07,169 INFO L273 TraceCheckUtils]: 14: Hoare triple {6302#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6302#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:07,169 INFO L273 TraceCheckUtils]: 15: Hoare triple {6302#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6303#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:07,170 INFO L273 TraceCheckUtils]: 16: Hoare triple {6303#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6303#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:07,171 INFO L273 TraceCheckUtils]: 17: Hoare triple {6303#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6304#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:07,171 INFO L273 TraceCheckUtils]: 18: Hoare triple {6304#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6304#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:07,172 INFO L273 TraceCheckUtils]: 19: Hoare triple {6304#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6305#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:07,172 INFO L273 TraceCheckUtils]: 20: Hoare triple {6305#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6305#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:07,173 INFO L273 TraceCheckUtils]: 21: Hoare triple {6305#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6306#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:07,174 INFO L273 TraceCheckUtils]: 22: Hoare triple {6306#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6306#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:07,174 INFO L273 TraceCheckUtils]: 23: Hoare triple {6306#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6307#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:07,175 INFO L273 TraceCheckUtils]: 24: Hoare triple {6307#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6307#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:07,175 INFO L273 TraceCheckUtils]: 25: Hoare triple {6307#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6308#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:07,176 INFO L273 TraceCheckUtils]: 26: Hoare triple {6308#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6308#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:07,177 INFO L273 TraceCheckUtils]: 27: Hoare triple {6308#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6309#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:07,177 INFO L273 TraceCheckUtils]: 28: Hoare triple {6309#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6309#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:07,178 INFO L273 TraceCheckUtils]: 29: Hoare triple {6309#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6310#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:07,179 INFO L273 TraceCheckUtils]: 30: Hoare triple {6310#(<= main_~i~1 12)} assume !(~i~1 < 60); {6297#false} is VALID [2018-11-23 12:17:07,179 INFO L256 TraceCheckUtils]: 31: Hoare triple {6297#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {6296#true} is VALID [2018-11-23 12:17:07,179 INFO L273 TraceCheckUtils]: 32: Hoare triple {6296#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {6296#true} is VALID [2018-11-23 12:17:07,179 INFO L273 TraceCheckUtils]: 33: Hoare triple {6296#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6296#true} is VALID [2018-11-23 12:17:07,179 INFO L273 TraceCheckUtils]: 34: Hoare triple {6296#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6296#true} is VALID [2018-11-23 12:17:07,180 INFO L273 TraceCheckUtils]: 35: Hoare triple {6296#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6296#true} is VALID [2018-11-23 12:17:07,180 INFO L273 TraceCheckUtils]: 36: Hoare triple {6296#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6296#true} is VALID [2018-11-23 12:17:07,180 INFO L273 TraceCheckUtils]: 37: Hoare triple {6296#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6296#true} is VALID [2018-11-23 12:17:07,180 INFO L273 TraceCheckUtils]: 38: Hoare triple {6296#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6296#true} is VALID [2018-11-23 12:17:07,180 INFO L273 TraceCheckUtils]: 39: Hoare triple {6296#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6296#true} is VALID [2018-11-23 12:17:07,181 INFO L273 TraceCheckUtils]: 40: Hoare triple {6296#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6296#true} is VALID [2018-11-23 12:17:07,181 INFO L273 TraceCheckUtils]: 41: Hoare triple {6296#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6296#true} is VALID [2018-11-23 12:17:07,181 INFO L273 TraceCheckUtils]: 42: Hoare triple {6296#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6296#true} is VALID [2018-11-23 12:17:07,181 INFO L273 TraceCheckUtils]: 43: Hoare triple {6296#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6296#true} is VALID [2018-11-23 12:17:07,181 INFO L273 TraceCheckUtils]: 44: Hoare triple {6296#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6296#true} is VALID [2018-11-23 12:17:07,181 INFO L273 TraceCheckUtils]: 45: Hoare triple {6296#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6296#true} is VALID [2018-11-23 12:17:07,182 INFO L273 TraceCheckUtils]: 46: Hoare triple {6296#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6296#true} is VALID [2018-11-23 12:17:07,182 INFO L273 TraceCheckUtils]: 47: Hoare triple {6296#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6296#true} is VALID [2018-11-23 12:17:07,182 INFO L273 TraceCheckUtils]: 48: Hoare triple {6296#true} assume !(~i~0 < 60); {6296#true} is VALID [2018-11-23 12:17:07,182 INFO L273 TraceCheckUtils]: 49: Hoare triple {6296#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6296#true} is VALID [2018-11-23 12:17:07,182 INFO L273 TraceCheckUtils]: 50: Hoare triple {6296#true} assume true; {6296#true} is VALID [2018-11-23 12:17:07,182 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {6296#true} {6297#false} #75#return; {6297#false} is VALID [2018-11-23 12:17:07,182 INFO L273 TraceCheckUtils]: 52: Hoare triple {6297#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {6297#false} is VALID [2018-11-23 12:17:07,183 INFO L256 TraceCheckUtils]: 53: Hoare triple {6297#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {6296#true} is VALID [2018-11-23 12:17:07,183 INFO L273 TraceCheckUtils]: 54: Hoare triple {6296#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {6296#true} is VALID [2018-11-23 12:17:07,183 INFO L273 TraceCheckUtils]: 55: Hoare triple {6296#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6296#true} is VALID [2018-11-23 12:17:07,183 INFO L273 TraceCheckUtils]: 56: Hoare triple {6296#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6296#true} is VALID [2018-11-23 12:17:07,183 INFO L273 TraceCheckUtils]: 57: Hoare triple {6296#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6296#true} is VALID [2018-11-23 12:17:07,183 INFO L273 TraceCheckUtils]: 58: Hoare triple {6296#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6296#true} is VALID [2018-11-23 12:17:07,183 INFO L273 TraceCheckUtils]: 59: Hoare triple {6296#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6296#true} is VALID [2018-11-23 12:17:07,183 INFO L273 TraceCheckUtils]: 60: Hoare triple {6296#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6296#true} is VALID [2018-11-23 12:17:07,184 INFO L273 TraceCheckUtils]: 61: Hoare triple {6296#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6296#true} is VALID [2018-11-23 12:17:07,184 INFO L273 TraceCheckUtils]: 62: Hoare triple {6296#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6296#true} is VALID [2018-11-23 12:17:07,184 INFO L273 TraceCheckUtils]: 63: Hoare triple {6296#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6296#true} is VALID [2018-11-23 12:17:07,184 INFO L273 TraceCheckUtils]: 64: Hoare triple {6296#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6296#true} is VALID [2018-11-23 12:17:07,184 INFO L273 TraceCheckUtils]: 65: Hoare triple {6296#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6296#true} is VALID [2018-11-23 12:17:07,184 INFO L273 TraceCheckUtils]: 66: Hoare triple {6296#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6296#true} is VALID [2018-11-23 12:17:07,184 INFO L273 TraceCheckUtils]: 67: Hoare triple {6296#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6296#true} is VALID [2018-11-23 12:17:07,184 INFO L273 TraceCheckUtils]: 68: Hoare triple {6296#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6296#true} is VALID [2018-11-23 12:17:07,184 INFO L273 TraceCheckUtils]: 69: Hoare triple {6296#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6296#true} is VALID [2018-11-23 12:17:07,185 INFO L273 TraceCheckUtils]: 70: Hoare triple {6296#true} assume !(~i~0 < 60); {6296#true} is VALID [2018-11-23 12:17:07,185 INFO L273 TraceCheckUtils]: 71: Hoare triple {6296#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6296#true} is VALID [2018-11-23 12:17:07,185 INFO L273 TraceCheckUtils]: 72: Hoare triple {6296#true} assume true; {6296#true} is VALID [2018-11-23 12:17:07,185 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {6296#true} {6297#false} #77#return; {6297#false} is VALID [2018-11-23 12:17:07,185 INFO L273 TraceCheckUtils]: 74: Hoare triple {6297#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {6297#false} is VALID [2018-11-23 12:17:07,185 INFO L273 TraceCheckUtils]: 75: Hoare triple {6297#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {6297#false} is VALID [2018-11-23 12:17:07,185 INFO L273 TraceCheckUtils]: 76: Hoare triple {6297#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {6297#false} is VALID [2018-11-23 12:17:07,185 INFO L273 TraceCheckUtils]: 77: Hoare triple {6297#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {6297#false} is VALID [2018-11-23 12:17:07,185 INFO L273 TraceCheckUtils]: 78: Hoare triple {6297#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {6297#false} is VALID [2018-11-23 12:17:07,186 INFO L273 TraceCheckUtils]: 79: Hoare triple {6297#false} assume !(~i~2 < 59); {6297#false} is VALID [2018-11-23 12:17:07,186 INFO L273 TraceCheckUtils]: 80: Hoare triple {6297#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {6297#false} is VALID [2018-11-23 12:17:07,186 INFO L256 TraceCheckUtils]: 81: Hoare triple {6297#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {6296#true} is VALID [2018-11-23 12:17:07,186 INFO L273 TraceCheckUtils]: 82: Hoare triple {6296#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {6296#true} is VALID [2018-11-23 12:17:07,186 INFO L273 TraceCheckUtils]: 83: Hoare triple {6296#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6296#true} is VALID [2018-11-23 12:17:07,186 INFO L273 TraceCheckUtils]: 84: Hoare triple {6296#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6296#true} is VALID [2018-11-23 12:17:07,186 INFO L273 TraceCheckUtils]: 85: Hoare triple {6296#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6296#true} is VALID [2018-11-23 12:17:07,186 INFO L273 TraceCheckUtils]: 86: Hoare triple {6296#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6296#true} is VALID [2018-11-23 12:17:07,187 INFO L273 TraceCheckUtils]: 87: Hoare triple {6296#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6296#true} is VALID [2018-11-23 12:17:07,187 INFO L273 TraceCheckUtils]: 88: Hoare triple {6296#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6296#true} is VALID [2018-11-23 12:17:07,187 INFO L273 TraceCheckUtils]: 89: Hoare triple {6296#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6296#true} is VALID [2018-11-23 12:17:07,187 INFO L273 TraceCheckUtils]: 90: Hoare triple {6296#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6296#true} is VALID [2018-11-23 12:17:07,187 INFO L273 TraceCheckUtils]: 91: Hoare triple {6296#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6296#true} is VALID [2018-11-23 12:17:07,187 INFO L273 TraceCheckUtils]: 92: Hoare triple {6296#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6296#true} is VALID [2018-11-23 12:17:07,187 INFO L273 TraceCheckUtils]: 93: Hoare triple {6296#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6296#true} is VALID [2018-11-23 12:17:07,187 INFO L273 TraceCheckUtils]: 94: Hoare triple {6296#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6296#true} is VALID [2018-11-23 12:17:07,187 INFO L273 TraceCheckUtils]: 95: Hoare triple {6296#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6296#true} is VALID [2018-11-23 12:17:07,188 INFO L273 TraceCheckUtils]: 96: Hoare triple {6296#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6296#true} is VALID [2018-11-23 12:17:07,188 INFO L273 TraceCheckUtils]: 97: Hoare triple {6296#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6296#true} is VALID [2018-11-23 12:17:07,188 INFO L273 TraceCheckUtils]: 98: Hoare triple {6296#true} assume !(~i~0 < 60); {6296#true} is VALID [2018-11-23 12:17:07,188 INFO L273 TraceCheckUtils]: 99: Hoare triple {6296#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6296#true} is VALID [2018-11-23 12:17:07,188 INFO L273 TraceCheckUtils]: 100: Hoare triple {6296#true} assume true; {6296#true} is VALID [2018-11-23 12:17:07,188 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {6296#true} {6297#false} #79#return; {6297#false} is VALID [2018-11-23 12:17:07,188 INFO L273 TraceCheckUtils]: 102: Hoare triple {6297#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {6297#false} is VALID [2018-11-23 12:17:07,188 INFO L273 TraceCheckUtils]: 103: Hoare triple {6297#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {6297#false} is VALID [2018-11-23 12:17:07,188 INFO L273 TraceCheckUtils]: 104: Hoare triple {6297#false} assume !false; {6297#false} is VALID [2018-11-23 12:17:07,193 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2018-11-23 12:17:07,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:07,193 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:17:07,204 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:17:07,278 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:17:07,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:07,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:07,566 INFO L256 TraceCheckUtils]: 0: Hoare triple {6296#true} call ULTIMATE.init(); {6296#true} is VALID [2018-11-23 12:17:07,566 INFO L273 TraceCheckUtils]: 1: Hoare triple {6296#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6296#true} is VALID [2018-11-23 12:17:07,566 INFO L273 TraceCheckUtils]: 2: Hoare triple {6296#true} assume true; {6296#true} is VALID [2018-11-23 12:17:07,566 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6296#true} {6296#true} #71#return; {6296#true} is VALID [2018-11-23 12:17:07,566 INFO L256 TraceCheckUtils]: 4: Hoare triple {6296#true} call #t~ret14 := main(); {6296#true} is VALID [2018-11-23 12:17:07,567 INFO L273 TraceCheckUtils]: 5: Hoare triple {6296#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {6296#true} is VALID [2018-11-23 12:17:07,567 INFO L273 TraceCheckUtils]: 6: Hoare triple {6296#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6296#true} is VALID [2018-11-23 12:17:07,567 INFO L273 TraceCheckUtils]: 7: Hoare triple {6296#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6296#true} is VALID [2018-11-23 12:17:07,567 INFO L273 TraceCheckUtils]: 8: Hoare triple {6296#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6296#true} is VALID [2018-11-23 12:17:07,567 INFO L273 TraceCheckUtils]: 9: Hoare triple {6296#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6296#true} is VALID [2018-11-23 12:17:07,567 INFO L273 TraceCheckUtils]: 10: Hoare triple {6296#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6296#true} is VALID [2018-11-23 12:17:07,567 INFO L273 TraceCheckUtils]: 11: Hoare triple {6296#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6296#true} is VALID [2018-11-23 12:17:07,567 INFO L273 TraceCheckUtils]: 12: Hoare triple {6296#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6296#true} is VALID [2018-11-23 12:17:07,567 INFO L273 TraceCheckUtils]: 13: Hoare triple {6296#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6296#true} is VALID [2018-11-23 12:17:07,568 INFO L273 TraceCheckUtils]: 14: Hoare triple {6296#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6296#true} is VALID [2018-11-23 12:17:07,568 INFO L273 TraceCheckUtils]: 15: Hoare triple {6296#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6296#true} is VALID [2018-11-23 12:17:07,568 INFO L273 TraceCheckUtils]: 16: Hoare triple {6296#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6296#true} is VALID [2018-11-23 12:17:07,568 INFO L273 TraceCheckUtils]: 17: Hoare triple {6296#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6296#true} is VALID [2018-11-23 12:17:07,568 INFO L273 TraceCheckUtils]: 18: Hoare triple {6296#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6296#true} is VALID [2018-11-23 12:17:07,568 INFO L273 TraceCheckUtils]: 19: Hoare triple {6296#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6296#true} is VALID [2018-11-23 12:17:07,568 INFO L273 TraceCheckUtils]: 20: Hoare triple {6296#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6296#true} is VALID [2018-11-23 12:17:07,568 INFO L273 TraceCheckUtils]: 21: Hoare triple {6296#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6296#true} is VALID [2018-11-23 12:17:07,569 INFO L273 TraceCheckUtils]: 22: Hoare triple {6296#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6296#true} is VALID [2018-11-23 12:17:07,569 INFO L273 TraceCheckUtils]: 23: Hoare triple {6296#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6296#true} is VALID [2018-11-23 12:17:07,569 INFO L273 TraceCheckUtils]: 24: Hoare triple {6296#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6296#true} is VALID [2018-11-23 12:17:07,569 INFO L273 TraceCheckUtils]: 25: Hoare triple {6296#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6296#true} is VALID [2018-11-23 12:17:07,569 INFO L273 TraceCheckUtils]: 26: Hoare triple {6296#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6296#true} is VALID [2018-11-23 12:17:07,569 INFO L273 TraceCheckUtils]: 27: Hoare triple {6296#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6296#true} is VALID [2018-11-23 12:17:07,569 INFO L273 TraceCheckUtils]: 28: Hoare triple {6296#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6296#true} is VALID [2018-11-23 12:17:07,569 INFO L273 TraceCheckUtils]: 29: Hoare triple {6296#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6296#true} is VALID [2018-11-23 12:17:07,569 INFO L273 TraceCheckUtils]: 30: Hoare triple {6296#true} assume !(~i~1 < 60); {6296#true} is VALID [2018-11-23 12:17:07,570 INFO L256 TraceCheckUtils]: 31: Hoare triple {6296#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {6296#true} is VALID [2018-11-23 12:17:07,570 INFO L273 TraceCheckUtils]: 32: Hoare triple {6296#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {6296#true} is VALID [2018-11-23 12:17:07,570 INFO L273 TraceCheckUtils]: 33: Hoare triple {6296#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6296#true} is VALID [2018-11-23 12:17:07,570 INFO L273 TraceCheckUtils]: 34: Hoare triple {6296#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6296#true} is VALID [2018-11-23 12:17:07,570 INFO L273 TraceCheckUtils]: 35: Hoare triple {6296#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6296#true} is VALID [2018-11-23 12:17:07,570 INFO L273 TraceCheckUtils]: 36: Hoare triple {6296#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6296#true} is VALID [2018-11-23 12:17:07,570 INFO L273 TraceCheckUtils]: 37: Hoare triple {6296#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6296#true} is VALID [2018-11-23 12:17:07,570 INFO L273 TraceCheckUtils]: 38: Hoare triple {6296#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6296#true} is VALID [2018-11-23 12:17:07,570 INFO L273 TraceCheckUtils]: 39: Hoare triple {6296#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6296#true} is VALID [2018-11-23 12:17:07,571 INFO L273 TraceCheckUtils]: 40: Hoare triple {6296#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6296#true} is VALID [2018-11-23 12:17:07,571 INFO L273 TraceCheckUtils]: 41: Hoare triple {6296#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6296#true} is VALID [2018-11-23 12:17:07,571 INFO L273 TraceCheckUtils]: 42: Hoare triple {6296#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6296#true} is VALID [2018-11-23 12:17:07,571 INFO L273 TraceCheckUtils]: 43: Hoare triple {6296#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6296#true} is VALID [2018-11-23 12:17:07,571 INFO L273 TraceCheckUtils]: 44: Hoare triple {6296#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6296#true} is VALID [2018-11-23 12:17:07,571 INFO L273 TraceCheckUtils]: 45: Hoare triple {6296#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6296#true} is VALID [2018-11-23 12:17:07,571 INFO L273 TraceCheckUtils]: 46: Hoare triple {6296#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6296#true} is VALID [2018-11-23 12:17:07,571 INFO L273 TraceCheckUtils]: 47: Hoare triple {6296#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6296#true} is VALID [2018-11-23 12:17:07,571 INFO L273 TraceCheckUtils]: 48: Hoare triple {6296#true} assume !(~i~0 < 60); {6296#true} is VALID [2018-11-23 12:17:07,572 INFO L273 TraceCheckUtils]: 49: Hoare triple {6296#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6296#true} is VALID [2018-11-23 12:17:07,572 INFO L273 TraceCheckUtils]: 50: Hoare triple {6296#true} assume true; {6296#true} is VALID [2018-11-23 12:17:07,572 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {6296#true} {6296#true} #75#return; {6296#true} is VALID [2018-11-23 12:17:07,572 INFO L273 TraceCheckUtils]: 52: Hoare triple {6296#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {6296#true} is VALID [2018-11-23 12:17:07,572 INFO L256 TraceCheckUtils]: 53: Hoare triple {6296#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {6296#true} is VALID [2018-11-23 12:17:07,572 INFO L273 TraceCheckUtils]: 54: Hoare triple {6296#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {6296#true} is VALID [2018-11-23 12:17:07,572 INFO L273 TraceCheckUtils]: 55: Hoare triple {6296#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6296#true} is VALID [2018-11-23 12:17:07,572 INFO L273 TraceCheckUtils]: 56: Hoare triple {6296#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6296#true} is VALID [2018-11-23 12:17:07,573 INFO L273 TraceCheckUtils]: 57: Hoare triple {6296#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6296#true} is VALID [2018-11-23 12:17:07,573 INFO L273 TraceCheckUtils]: 58: Hoare triple {6296#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6296#true} is VALID [2018-11-23 12:17:07,573 INFO L273 TraceCheckUtils]: 59: Hoare triple {6296#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6296#true} is VALID [2018-11-23 12:17:07,573 INFO L273 TraceCheckUtils]: 60: Hoare triple {6296#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6296#true} is VALID [2018-11-23 12:17:07,573 INFO L273 TraceCheckUtils]: 61: Hoare triple {6296#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6296#true} is VALID [2018-11-23 12:17:07,573 INFO L273 TraceCheckUtils]: 62: Hoare triple {6296#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6296#true} is VALID [2018-11-23 12:17:07,573 INFO L273 TraceCheckUtils]: 63: Hoare triple {6296#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6296#true} is VALID [2018-11-23 12:17:07,573 INFO L273 TraceCheckUtils]: 64: Hoare triple {6296#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6296#true} is VALID [2018-11-23 12:17:07,574 INFO L273 TraceCheckUtils]: 65: Hoare triple {6296#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6296#true} is VALID [2018-11-23 12:17:07,574 INFO L273 TraceCheckUtils]: 66: Hoare triple {6296#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6296#true} is VALID [2018-11-23 12:17:07,574 INFO L273 TraceCheckUtils]: 67: Hoare triple {6296#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6296#true} is VALID [2018-11-23 12:17:07,574 INFO L273 TraceCheckUtils]: 68: Hoare triple {6296#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6296#true} is VALID [2018-11-23 12:17:07,574 INFO L273 TraceCheckUtils]: 69: Hoare triple {6296#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6296#true} is VALID [2018-11-23 12:17:07,574 INFO L273 TraceCheckUtils]: 70: Hoare triple {6296#true} assume !(~i~0 < 60); {6296#true} is VALID [2018-11-23 12:17:07,574 INFO L273 TraceCheckUtils]: 71: Hoare triple {6296#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6296#true} is VALID [2018-11-23 12:17:07,574 INFO L273 TraceCheckUtils]: 72: Hoare triple {6296#true} assume true; {6296#true} is VALID [2018-11-23 12:17:07,574 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {6296#true} {6296#true} #77#return; {6296#true} is VALID [2018-11-23 12:17:07,575 INFO L273 TraceCheckUtils]: 74: Hoare triple {6296#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {6536#(<= main_~i~2 0)} is VALID [2018-11-23 12:17:07,575 INFO L273 TraceCheckUtils]: 75: Hoare triple {6536#(<= main_~i~2 0)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {6536#(<= main_~i~2 0)} is VALID [2018-11-23 12:17:07,577 INFO L273 TraceCheckUtils]: 76: Hoare triple {6536#(<= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {6543#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:07,577 INFO L273 TraceCheckUtils]: 77: Hoare triple {6543#(<= main_~i~2 1)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {6543#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:07,579 INFO L273 TraceCheckUtils]: 78: Hoare triple {6543#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {6550#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:07,579 INFO L273 TraceCheckUtils]: 79: Hoare triple {6550#(<= main_~i~2 2)} assume !(~i~2 < 59); {6297#false} is VALID [2018-11-23 12:17:07,580 INFO L273 TraceCheckUtils]: 80: Hoare triple {6297#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {6297#false} is VALID [2018-11-23 12:17:07,580 INFO L256 TraceCheckUtils]: 81: Hoare triple {6297#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {6297#false} is VALID [2018-11-23 12:17:07,580 INFO L273 TraceCheckUtils]: 82: Hoare triple {6297#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {6297#false} is VALID [2018-11-23 12:17:07,580 INFO L273 TraceCheckUtils]: 83: Hoare triple {6297#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6297#false} is VALID [2018-11-23 12:17:07,580 INFO L273 TraceCheckUtils]: 84: Hoare triple {6297#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6297#false} is VALID [2018-11-23 12:17:07,581 INFO L273 TraceCheckUtils]: 85: Hoare triple {6297#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6297#false} is VALID [2018-11-23 12:17:07,581 INFO L273 TraceCheckUtils]: 86: Hoare triple {6297#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6297#false} is VALID [2018-11-23 12:17:07,581 INFO L273 TraceCheckUtils]: 87: Hoare triple {6297#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6297#false} is VALID [2018-11-23 12:17:07,581 INFO L273 TraceCheckUtils]: 88: Hoare triple {6297#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6297#false} is VALID [2018-11-23 12:17:07,581 INFO L273 TraceCheckUtils]: 89: Hoare triple {6297#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6297#false} is VALID [2018-11-23 12:17:07,581 INFO L273 TraceCheckUtils]: 90: Hoare triple {6297#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6297#false} is VALID [2018-11-23 12:17:07,581 INFO L273 TraceCheckUtils]: 91: Hoare triple {6297#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6297#false} is VALID [2018-11-23 12:17:07,581 INFO L273 TraceCheckUtils]: 92: Hoare triple {6297#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6297#false} is VALID [2018-11-23 12:17:07,582 INFO L273 TraceCheckUtils]: 93: Hoare triple {6297#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6297#false} is VALID [2018-11-23 12:17:07,582 INFO L273 TraceCheckUtils]: 94: Hoare triple {6297#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6297#false} is VALID [2018-11-23 12:17:07,582 INFO L273 TraceCheckUtils]: 95: Hoare triple {6297#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6297#false} is VALID [2018-11-23 12:17:07,582 INFO L273 TraceCheckUtils]: 96: Hoare triple {6297#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6297#false} is VALID [2018-11-23 12:17:07,582 INFO L273 TraceCheckUtils]: 97: Hoare triple {6297#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6297#false} is VALID [2018-11-23 12:17:07,582 INFO L273 TraceCheckUtils]: 98: Hoare triple {6297#false} assume !(~i~0 < 60); {6297#false} is VALID [2018-11-23 12:17:07,582 INFO L273 TraceCheckUtils]: 99: Hoare triple {6297#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6297#false} is VALID [2018-11-23 12:17:07,582 INFO L273 TraceCheckUtils]: 100: Hoare triple {6297#false} assume true; {6297#false} is VALID [2018-11-23 12:17:07,582 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {6297#false} {6297#false} #79#return; {6297#false} is VALID [2018-11-23 12:17:07,583 INFO L273 TraceCheckUtils]: 102: Hoare triple {6297#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {6297#false} is VALID [2018-11-23 12:17:07,583 INFO L273 TraceCheckUtils]: 103: Hoare triple {6297#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {6297#false} is VALID [2018-11-23 12:17:07,583 INFO L273 TraceCheckUtils]: 104: Hoare triple {6297#false} assume !false; {6297#false} is VALID [2018-11-23 12:17:07,587 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 180 proven. 4 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2018-11-23 12:17:07,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:07,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2018-11-23 12:17:07,606 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 105 [2018-11-23 12:17:07,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:07,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:17:07,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:07,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:17:07,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:17:07,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:17:07,679 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 18 states. [2018-11-23 12:17:08,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:08,334 INFO L93 Difference]: Finished difference Result 107 states and 126 transitions. [2018-11-23 12:17:08,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:17:08,334 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 105 [2018-11-23 12:17:08,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:08,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:17:08,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 89 transitions. [2018-11-23 12:17:08,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:17:08,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 89 transitions. [2018-11-23 12:17:08,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 89 transitions. [2018-11-23 12:17:08,808 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:08,811 INFO L225 Difference]: With dead ends: 107 [2018-11-23 12:17:08,811 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 12:17:08,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:17:08,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 12:17:08,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-11-23 12:17:08,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:08,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 70 states. [2018-11-23 12:17:08,840 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 70 states. [2018-11-23 12:17:08,840 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 70 states. [2018-11-23 12:17:08,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:08,843 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-11-23 12:17:08,843 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-11-23 12:17:08,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:08,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:08,844 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 72 states. [2018-11-23 12:17:08,844 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 72 states. [2018-11-23 12:17:08,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:08,846 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-11-23 12:17:08,846 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-11-23 12:17:08,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:08,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:08,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:08,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:08,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 12:17:08,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2018-11-23 12:17:08,849 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 105 [2018-11-23 12:17:08,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:08,849 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2018-11-23 12:17:08,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:17:08,850 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2018-11-23 12:17:08,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-23 12:17:08,851 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:08,851 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 13, 13, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:17:08,852 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:08,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:08,852 INFO L82 PathProgramCache]: Analyzing trace with hash -929187861, now seen corresponding path program 13 times [2018-11-23 12:17:08,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:08,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:08,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:08,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:08,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:09,419 INFO L256 TraceCheckUtils]: 0: Hoare triple {7026#true} call ULTIMATE.init(); {7026#true} is VALID [2018-11-23 12:17:09,420 INFO L273 TraceCheckUtils]: 1: Hoare triple {7026#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7026#true} is VALID [2018-11-23 12:17:09,420 INFO L273 TraceCheckUtils]: 2: Hoare triple {7026#true} assume true; {7026#true} is VALID [2018-11-23 12:17:09,420 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7026#true} {7026#true} #71#return; {7026#true} is VALID [2018-11-23 12:17:09,421 INFO L256 TraceCheckUtils]: 4: Hoare triple {7026#true} call #t~ret14 := main(); {7026#true} is VALID [2018-11-23 12:17:09,421 INFO L273 TraceCheckUtils]: 5: Hoare triple {7026#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7028#(= main_~i~1 0)} is VALID [2018-11-23 12:17:09,422 INFO L273 TraceCheckUtils]: 6: Hoare triple {7028#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7028#(= main_~i~1 0)} is VALID [2018-11-23 12:17:09,423 INFO L273 TraceCheckUtils]: 7: Hoare triple {7028#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7029#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:09,423 INFO L273 TraceCheckUtils]: 8: Hoare triple {7029#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7029#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:09,423 INFO L273 TraceCheckUtils]: 9: Hoare triple {7029#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7030#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:09,424 INFO L273 TraceCheckUtils]: 10: Hoare triple {7030#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7030#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:09,424 INFO L273 TraceCheckUtils]: 11: Hoare triple {7030#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7031#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:09,425 INFO L273 TraceCheckUtils]: 12: Hoare triple {7031#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7031#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:09,425 INFO L273 TraceCheckUtils]: 13: Hoare triple {7031#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7032#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:09,426 INFO L273 TraceCheckUtils]: 14: Hoare triple {7032#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7032#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:09,427 INFO L273 TraceCheckUtils]: 15: Hoare triple {7032#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7033#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:09,427 INFO L273 TraceCheckUtils]: 16: Hoare triple {7033#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7033#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:09,428 INFO L273 TraceCheckUtils]: 17: Hoare triple {7033#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7034#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:09,429 INFO L273 TraceCheckUtils]: 18: Hoare triple {7034#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7034#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:09,429 INFO L273 TraceCheckUtils]: 19: Hoare triple {7034#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7035#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:09,430 INFO L273 TraceCheckUtils]: 20: Hoare triple {7035#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7035#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:09,431 INFO L273 TraceCheckUtils]: 21: Hoare triple {7035#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7036#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:09,431 INFO L273 TraceCheckUtils]: 22: Hoare triple {7036#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7036#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:09,432 INFO L273 TraceCheckUtils]: 23: Hoare triple {7036#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7037#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:09,433 INFO L273 TraceCheckUtils]: 24: Hoare triple {7037#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7037#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:09,434 INFO L273 TraceCheckUtils]: 25: Hoare triple {7037#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7038#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:09,434 INFO L273 TraceCheckUtils]: 26: Hoare triple {7038#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7038#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:09,451 INFO L273 TraceCheckUtils]: 27: Hoare triple {7038#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7039#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:09,458 INFO L273 TraceCheckUtils]: 28: Hoare triple {7039#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7039#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:09,458 INFO L273 TraceCheckUtils]: 29: Hoare triple {7039#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7040#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:09,459 INFO L273 TraceCheckUtils]: 30: Hoare triple {7040#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7040#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:09,459 INFO L273 TraceCheckUtils]: 31: Hoare triple {7040#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7041#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:09,460 INFO L273 TraceCheckUtils]: 32: Hoare triple {7041#(<= main_~i~1 13)} assume !(~i~1 < 60); {7027#false} is VALID [2018-11-23 12:17:09,460 INFO L256 TraceCheckUtils]: 33: Hoare triple {7027#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {7026#true} is VALID [2018-11-23 12:17:09,460 INFO L273 TraceCheckUtils]: 34: Hoare triple {7026#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {7026#true} is VALID [2018-11-23 12:17:09,460 INFO L273 TraceCheckUtils]: 35: Hoare triple {7026#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7026#true} is VALID [2018-11-23 12:17:09,460 INFO L273 TraceCheckUtils]: 36: Hoare triple {7026#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7026#true} is VALID [2018-11-23 12:17:09,461 INFO L273 TraceCheckUtils]: 37: Hoare triple {7026#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7026#true} is VALID [2018-11-23 12:17:09,461 INFO L273 TraceCheckUtils]: 38: Hoare triple {7026#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7026#true} is VALID [2018-11-23 12:17:09,461 INFO L273 TraceCheckUtils]: 39: Hoare triple {7026#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7026#true} is VALID [2018-11-23 12:17:09,461 INFO L273 TraceCheckUtils]: 40: Hoare triple {7026#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7026#true} is VALID [2018-11-23 12:17:09,461 INFO L273 TraceCheckUtils]: 41: Hoare triple {7026#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7026#true} is VALID [2018-11-23 12:17:09,461 INFO L273 TraceCheckUtils]: 42: Hoare triple {7026#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7026#true} is VALID [2018-11-23 12:17:09,461 INFO L273 TraceCheckUtils]: 43: Hoare triple {7026#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7026#true} is VALID [2018-11-23 12:17:09,462 INFO L273 TraceCheckUtils]: 44: Hoare triple {7026#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7026#true} is VALID [2018-11-23 12:17:09,462 INFO L273 TraceCheckUtils]: 45: Hoare triple {7026#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7026#true} is VALID [2018-11-23 12:17:09,462 INFO L273 TraceCheckUtils]: 46: Hoare triple {7026#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7026#true} is VALID [2018-11-23 12:17:09,462 INFO L273 TraceCheckUtils]: 47: Hoare triple {7026#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7026#true} is VALID [2018-11-23 12:17:09,462 INFO L273 TraceCheckUtils]: 48: Hoare triple {7026#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7026#true} is VALID [2018-11-23 12:17:09,462 INFO L273 TraceCheckUtils]: 49: Hoare triple {7026#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7026#true} is VALID [2018-11-23 12:17:09,462 INFO L273 TraceCheckUtils]: 50: Hoare triple {7026#true} assume !(~i~0 < 60); {7026#true} is VALID [2018-11-23 12:17:09,463 INFO L273 TraceCheckUtils]: 51: Hoare triple {7026#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7026#true} is VALID [2018-11-23 12:17:09,463 INFO L273 TraceCheckUtils]: 52: Hoare triple {7026#true} assume true; {7026#true} is VALID [2018-11-23 12:17:09,463 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {7026#true} {7027#false} #75#return; {7027#false} is VALID [2018-11-23 12:17:09,463 INFO L273 TraceCheckUtils]: 54: Hoare triple {7027#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {7027#false} is VALID [2018-11-23 12:17:09,463 INFO L256 TraceCheckUtils]: 55: Hoare triple {7027#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {7026#true} is VALID [2018-11-23 12:17:09,463 INFO L273 TraceCheckUtils]: 56: Hoare triple {7026#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {7026#true} is VALID [2018-11-23 12:17:09,463 INFO L273 TraceCheckUtils]: 57: Hoare triple {7026#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7026#true} is VALID [2018-11-23 12:17:09,464 INFO L273 TraceCheckUtils]: 58: Hoare triple {7026#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7026#true} is VALID [2018-11-23 12:17:09,464 INFO L273 TraceCheckUtils]: 59: Hoare triple {7026#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7026#true} is VALID [2018-11-23 12:17:09,464 INFO L273 TraceCheckUtils]: 60: Hoare triple {7026#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7026#true} is VALID [2018-11-23 12:17:09,464 INFO L273 TraceCheckUtils]: 61: Hoare triple {7026#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7026#true} is VALID [2018-11-23 12:17:09,464 INFO L273 TraceCheckUtils]: 62: Hoare triple {7026#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7026#true} is VALID [2018-11-23 12:17:09,464 INFO L273 TraceCheckUtils]: 63: Hoare triple {7026#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7026#true} is VALID [2018-11-23 12:17:09,465 INFO L273 TraceCheckUtils]: 64: Hoare triple {7026#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7026#true} is VALID [2018-11-23 12:17:09,465 INFO L273 TraceCheckUtils]: 65: Hoare triple {7026#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7026#true} is VALID [2018-11-23 12:17:09,465 INFO L273 TraceCheckUtils]: 66: Hoare triple {7026#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7026#true} is VALID [2018-11-23 12:17:09,465 INFO L273 TraceCheckUtils]: 67: Hoare triple {7026#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7026#true} is VALID [2018-11-23 12:17:09,465 INFO L273 TraceCheckUtils]: 68: Hoare triple {7026#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7026#true} is VALID [2018-11-23 12:17:09,465 INFO L273 TraceCheckUtils]: 69: Hoare triple {7026#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7026#true} is VALID [2018-11-23 12:17:09,465 INFO L273 TraceCheckUtils]: 70: Hoare triple {7026#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7026#true} is VALID [2018-11-23 12:17:09,466 INFO L273 TraceCheckUtils]: 71: Hoare triple {7026#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7026#true} is VALID [2018-11-23 12:17:09,466 INFO L273 TraceCheckUtils]: 72: Hoare triple {7026#true} assume !(~i~0 < 60); {7026#true} is VALID [2018-11-23 12:17:09,466 INFO L273 TraceCheckUtils]: 73: Hoare triple {7026#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7026#true} is VALID [2018-11-23 12:17:09,466 INFO L273 TraceCheckUtils]: 74: Hoare triple {7026#true} assume true; {7026#true} is VALID [2018-11-23 12:17:09,466 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {7026#true} {7027#false} #77#return; {7027#false} is VALID [2018-11-23 12:17:09,466 INFO L273 TraceCheckUtils]: 76: Hoare triple {7027#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {7027#false} is VALID [2018-11-23 12:17:09,466 INFO L273 TraceCheckUtils]: 77: Hoare triple {7027#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7027#false} is VALID [2018-11-23 12:17:09,467 INFO L273 TraceCheckUtils]: 78: Hoare triple {7027#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7027#false} is VALID [2018-11-23 12:17:09,467 INFO L273 TraceCheckUtils]: 79: Hoare triple {7027#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7027#false} is VALID [2018-11-23 12:17:09,467 INFO L273 TraceCheckUtils]: 80: Hoare triple {7027#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7027#false} is VALID [2018-11-23 12:17:09,467 INFO L273 TraceCheckUtils]: 81: Hoare triple {7027#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7027#false} is VALID [2018-11-23 12:17:09,467 INFO L273 TraceCheckUtils]: 82: Hoare triple {7027#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7027#false} is VALID [2018-11-23 12:17:09,467 INFO L273 TraceCheckUtils]: 83: Hoare triple {7027#false} assume !(~i~2 < 59); {7027#false} is VALID [2018-11-23 12:17:09,467 INFO L273 TraceCheckUtils]: 84: Hoare triple {7027#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {7027#false} is VALID [2018-11-23 12:17:09,468 INFO L256 TraceCheckUtils]: 85: Hoare triple {7027#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {7026#true} is VALID [2018-11-23 12:17:09,468 INFO L273 TraceCheckUtils]: 86: Hoare triple {7026#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {7026#true} is VALID [2018-11-23 12:17:09,468 INFO L273 TraceCheckUtils]: 87: Hoare triple {7026#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7026#true} is VALID [2018-11-23 12:17:09,468 INFO L273 TraceCheckUtils]: 88: Hoare triple {7026#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7026#true} is VALID [2018-11-23 12:17:09,468 INFO L273 TraceCheckUtils]: 89: Hoare triple {7026#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7026#true} is VALID [2018-11-23 12:17:09,468 INFO L273 TraceCheckUtils]: 90: Hoare triple {7026#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7026#true} is VALID [2018-11-23 12:17:09,469 INFO L273 TraceCheckUtils]: 91: Hoare triple {7026#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7026#true} is VALID [2018-11-23 12:17:09,469 INFO L273 TraceCheckUtils]: 92: Hoare triple {7026#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7026#true} is VALID [2018-11-23 12:17:09,469 INFO L273 TraceCheckUtils]: 93: Hoare triple {7026#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7026#true} is VALID [2018-11-23 12:17:09,469 INFO L273 TraceCheckUtils]: 94: Hoare triple {7026#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7026#true} is VALID [2018-11-23 12:17:09,469 INFO L273 TraceCheckUtils]: 95: Hoare triple {7026#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7026#true} is VALID [2018-11-23 12:17:09,469 INFO L273 TraceCheckUtils]: 96: Hoare triple {7026#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7026#true} is VALID [2018-11-23 12:17:09,469 INFO L273 TraceCheckUtils]: 97: Hoare triple {7026#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7026#true} is VALID [2018-11-23 12:17:09,470 INFO L273 TraceCheckUtils]: 98: Hoare triple {7026#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7026#true} is VALID [2018-11-23 12:17:09,470 INFO L273 TraceCheckUtils]: 99: Hoare triple {7026#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7026#true} is VALID [2018-11-23 12:17:09,470 INFO L273 TraceCheckUtils]: 100: Hoare triple {7026#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7026#true} is VALID [2018-11-23 12:17:09,470 INFO L273 TraceCheckUtils]: 101: Hoare triple {7026#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7026#true} is VALID [2018-11-23 12:17:09,470 INFO L273 TraceCheckUtils]: 102: Hoare triple {7026#true} assume !(~i~0 < 60); {7026#true} is VALID [2018-11-23 12:17:09,470 INFO L273 TraceCheckUtils]: 103: Hoare triple {7026#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7026#true} is VALID [2018-11-23 12:17:09,470 INFO L273 TraceCheckUtils]: 104: Hoare triple {7026#true} assume true; {7026#true} is VALID [2018-11-23 12:17:09,471 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {7026#true} {7027#false} #79#return; {7027#false} is VALID [2018-11-23 12:17:09,471 INFO L273 TraceCheckUtils]: 106: Hoare triple {7027#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {7027#false} is VALID [2018-11-23 12:17:09,471 INFO L273 TraceCheckUtils]: 107: Hoare triple {7027#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {7027#false} is VALID [2018-11-23 12:17:09,471 INFO L273 TraceCheckUtils]: 108: Hoare triple {7027#false} assume !false; {7027#false} is VALID [2018-11-23 12:17:09,482 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2018-11-23 12:17:09,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:09,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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:17:09,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:17:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:09,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:09,735 INFO L256 TraceCheckUtils]: 0: Hoare triple {7026#true} call ULTIMATE.init(); {7026#true} is VALID [2018-11-23 12:17:09,736 INFO L273 TraceCheckUtils]: 1: Hoare triple {7026#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7026#true} is VALID [2018-11-23 12:17:09,736 INFO L273 TraceCheckUtils]: 2: Hoare triple {7026#true} assume true; {7026#true} is VALID [2018-11-23 12:17:09,736 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7026#true} {7026#true} #71#return; {7026#true} is VALID [2018-11-23 12:17:09,736 INFO L256 TraceCheckUtils]: 4: Hoare triple {7026#true} call #t~ret14 := main(); {7026#true} is VALID [2018-11-23 12:17:09,737 INFO L273 TraceCheckUtils]: 5: Hoare triple {7026#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7060#(<= main_~i~1 0)} is VALID [2018-11-23 12:17:09,738 INFO L273 TraceCheckUtils]: 6: Hoare triple {7060#(<= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7060#(<= main_~i~1 0)} is VALID [2018-11-23 12:17:09,738 INFO L273 TraceCheckUtils]: 7: Hoare triple {7060#(<= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7029#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:09,739 INFO L273 TraceCheckUtils]: 8: Hoare triple {7029#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7029#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:09,739 INFO L273 TraceCheckUtils]: 9: Hoare triple {7029#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7030#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:09,739 INFO L273 TraceCheckUtils]: 10: Hoare triple {7030#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7030#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:09,740 INFO L273 TraceCheckUtils]: 11: Hoare triple {7030#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7031#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:09,740 INFO L273 TraceCheckUtils]: 12: Hoare triple {7031#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7031#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:09,741 INFO L273 TraceCheckUtils]: 13: Hoare triple {7031#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7032#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:09,741 INFO L273 TraceCheckUtils]: 14: Hoare triple {7032#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7032#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:09,742 INFO L273 TraceCheckUtils]: 15: Hoare triple {7032#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7033#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:09,742 INFO L273 TraceCheckUtils]: 16: Hoare triple {7033#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7033#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:09,743 INFO L273 TraceCheckUtils]: 17: Hoare triple {7033#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7034#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:09,743 INFO L273 TraceCheckUtils]: 18: Hoare triple {7034#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7034#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:09,744 INFO L273 TraceCheckUtils]: 19: Hoare triple {7034#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7035#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:09,745 INFO L273 TraceCheckUtils]: 20: Hoare triple {7035#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7035#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:09,745 INFO L273 TraceCheckUtils]: 21: Hoare triple {7035#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7036#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:09,746 INFO L273 TraceCheckUtils]: 22: Hoare triple {7036#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7036#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:09,746 INFO L273 TraceCheckUtils]: 23: Hoare triple {7036#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7037#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:09,747 INFO L273 TraceCheckUtils]: 24: Hoare triple {7037#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7037#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:09,748 INFO L273 TraceCheckUtils]: 25: Hoare triple {7037#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7038#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:09,748 INFO L273 TraceCheckUtils]: 26: Hoare triple {7038#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7038#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:09,749 INFO L273 TraceCheckUtils]: 27: Hoare triple {7038#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7039#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:09,749 INFO L273 TraceCheckUtils]: 28: Hoare triple {7039#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7039#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:09,750 INFO L273 TraceCheckUtils]: 29: Hoare triple {7039#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7040#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:09,751 INFO L273 TraceCheckUtils]: 30: Hoare triple {7040#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7040#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:09,751 INFO L273 TraceCheckUtils]: 31: Hoare triple {7040#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7041#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:09,752 INFO L273 TraceCheckUtils]: 32: Hoare triple {7041#(<= main_~i~1 13)} assume !(~i~1 < 60); {7027#false} is VALID [2018-11-23 12:17:09,752 INFO L256 TraceCheckUtils]: 33: Hoare triple {7027#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {7027#false} is VALID [2018-11-23 12:17:09,752 INFO L273 TraceCheckUtils]: 34: Hoare triple {7027#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {7027#false} is VALID [2018-11-23 12:17:09,752 INFO L273 TraceCheckUtils]: 35: Hoare triple {7027#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7027#false} is VALID [2018-11-23 12:17:09,753 INFO L273 TraceCheckUtils]: 36: Hoare triple {7027#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7027#false} is VALID [2018-11-23 12:17:09,753 INFO L273 TraceCheckUtils]: 37: Hoare triple {7027#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7027#false} is VALID [2018-11-23 12:17:09,753 INFO L273 TraceCheckUtils]: 38: Hoare triple {7027#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7027#false} is VALID [2018-11-23 12:17:09,753 INFO L273 TraceCheckUtils]: 39: Hoare triple {7027#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7027#false} is VALID [2018-11-23 12:17:09,753 INFO L273 TraceCheckUtils]: 40: Hoare triple {7027#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7027#false} is VALID [2018-11-23 12:17:09,754 INFO L273 TraceCheckUtils]: 41: Hoare triple {7027#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7027#false} is VALID [2018-11-23 12:17:09,754 INFO L273 TraceCheckUtils]: 42: Hoare triple {7027#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7027#false} is VALID [2018-11-23 12:17:09,754 INFO L273 TraceCheckUtils]: 43: Hoare triple {7027#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7027#false} is VALID [2018-11-23 12:17:09,754 INFO L273 TraceCheckUtils]: 44: Hoare triple {7027#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7027#false} is VALID [2018-11-23 12:17:09,754 INFO L273 TraceCheckUtils]: 45: Hoare triple {7027#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7027#false} is VALID [2018-11-23 12:17:09,755 INFO L273 TraceCheckUtils]: 46: Hoare triple {7027#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7027#false} is VALID [2018-11-23 12:17:09,755 INFO L273 TraceCheckUtils]: 47: Hoare triple {7027#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7027#false} is VALID [2018-11-23 12:17:09,755 INFO L273 TraceCheckUtils]: 48: Hoare triple {7027#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7027#false} is VALID [2018-11-23 12:17:09,755 INFO L273 TraceCheckUtils]: 49: Hoare triple {7027#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7027#false} is VALID [2018-11-23 12:17:09,755 INFO L273 TraceCheckUtils]: 50: Hoare triple {7027#false} assume !(~i~0 < 60); {7027#false} is VALID [2018-11-23 12:17:09,755 INFO L273 TraceCheckUtils]: 51: Hoare triple {7027#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7027#false} is VALID [2018-11-23 12:17:09,755 INFO L273 TraceCheckUtils]: 52: Hoare triple {7027#false} assume true; {7027#false} is VALID [2018-11-23 12:17:09,755 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {7027#false} {7027#false} #75#return; {7027#false} is VALID [2018-11-23 12:17:09,756 INFO L273 TraceCheckUtils]: 54: Hoare triple {7027#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {7027#false} is VALID [2018-11-23 12:17:09,756 INFO L256 TraceCheckUtils]: 55: Hoare triple {7027#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {7027#false} is VALID [2018-11-23 12:17:09,756 INFO L273 TraceCheckUtils]: 56: Hoare triple {7027#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {7027#false} is VALID [2018-11-23 12:17:09,756 INFO L273 TraceCheckUtils]: 57: Hoare triple {7027#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7027#false} is VALID [2018-11-23 12:17:09,756 INFO L273 TraceCheckUtils]: 58: Hoare triple {7027#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7027#false} is VALID [2018-11-23 12:17:09,756 INFO L273 TraceCheckUtils]: 59: Hoare triple {7027#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7027#false} is VALID [2018-11-23 12:17:09,756 INFO L273 TraceCheckUtils]: 60: Hoare triple {7027#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7027#false} is VALID [2018-11-23 12:17:09,756 INFO L273 TraceCheckUtils]: 61: Hoare triple {7027#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7027#false} is VALID [2018-11-23 12:17:09,756 INFO L273 TraceCheckUtils]: 62: Hoare triple {7027#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7027#false} is VALID [2018-11-23 12:17:09,757 INFO L273 TraceCheckUtils]: 63: Hoare triple {7027#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7027#false} is VALID [2018-11-23 12:17:09,757 INFO L273 TraceCheckUtils]: 64: Hoare triple {7027#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7027#false} is VALID [2018-11-23 12:17:09,757 INFO L273 TraceCheckUtils]: 65: Hoare triple {7027#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7027#false} is VALID [2018-11-23 12:17:09,757 INFO L273 TraceCheckUtils]: 66: Hoare triple {7027#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7027#false} is VALID [2018-11-23 12:17:09,757 INFO L273 TraceCheckUtils]: 67: Hoare triple {7027#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7027#false} is VALID [2018-11-23 12:17:09,757 INFO L273 TraceCheckUtils]: 68: Hoare triple {7027#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7027#false} is VALID [2018-11-23 12:17:09,757 INFO L273 TraceCheckUtils]: 69: Hoare triple {7027#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7027#false} is VALID [2018-11-23 12:17:09,757 INFO L273 TraceCheckUtils]: 70: Hoare triple {7027#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7027#false} is VALID [2018-11-23 12:17:09,757 INFO L273 TraceCheckUtils]: 71: Hoare triple {7027#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7027#false} is VALID [2018-11-23 12:17:09,758 INFO L273 TraceCheckUtils]: 72: Hoare triple {7027#false} assume !(~i~0 < 60); {7027#false} is VALID [2018-11-23 12:17:09,758 INFO L273 TraceCheckUtils]: 73: Hoare triple {7027#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7027#false} is VALID [2018-11-23 12:17:09,758 INFO L273 TraceCheckUtils]: 74: Hoare triple {7027#false} assume true; {7027#false} is VALID [2018-11-23 12:17:09,758 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {7027#false} {7027#false} #77#return; {7027#false} is VALID [2018-11-23 12:17:09,758 INFO L273 TraceCheckUtils]: 76: Hoare triple {7027#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {7027#false} is VALID [2018-11-23 12:17:09,758 INFO L273 TraceCheckUtils]: 77: Hoare triple {7027#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7027#false} is VALID [2018-11-23 12:17:09,758 INFO L273 TraceCheckUtils]: 78: Hoare triple {7027#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7027#false} is VALID [2018-11-23 12:17:09,758 INFO L273 TraceCheckUtils]: 79: Hoare triple {7027#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7027#false} is VALID [2018-11-23 12:17:09,758 INFO L273 TraceCheckUtils]: 80: Hoare triple {7027#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7027#false} is VALID [2018-11-23 12:17:09,759 INFO L273 TraceCheckUtils]: 81: Hoare triple {7027#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7027#false} is VALID [2018-11-23 12:17:09,759 INFO L273 TraceCheckUtils]: 82: Hoare triple {7027#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7027#false} is VALID [2018-11-23 12:17:09,759 INFO L273 TraceCheckUtils]: 83: Hoare triple {7027#false} assume !(~i~2 < 59); {7027#false} is VALID [2018-11-23 12:17:09,759 INFO L273 TraceCheckUtils]: 84: Hoare triple {7027#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {7027#false} is VALID [2018-11-23 12:17:09,759 INFO L256 TraceCheckUtils]: 85: Hoare triple {7027#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {7027#false} is VALID [2018-11-23 12:17:09,759 INFO L273 TraceCheckUtils]: 86: Hoare triple {7027#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {7027#false} is VALID [2018-11-23 12:17:09,759 INFO L273 TraceCheckUtils]: 87: Hoare triple {7027#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7027#false} is VALID [2018-11-23 12:17:09,759 INFO L273 TraceCheckUtils]: 88: Hoare triple {7027#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7027#false} is VALID [2018-11-23 12:17:09,760 INFO L273 TraceCheckUtils]: 89: Hoare triple {7027#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7027#false} is VALID [2018-11-23 12:17:09,760 INFO L273 TraceCheckUtils]: 90: Hoare triple {7027#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7027#false} is VALID [2018-11-23 12:17:09,760 INFO L273 TraceCheckUtils]: 91: Hoare triple {7027#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7027#false} is VALID [2018-11-23 12:17:09,760 INFO L273 TraceCheckUtils]: 92: Hoare triple {7027#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7027#false} is VALID [2018-11-23 12:17:09,760 INFO L273 TraceCheckUtils]: 93: Hoare triple {7027#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7027#false} is VALID [2018-11-23 12:17:09,760 INFO L273 TraceCheckUtils]: 94: Hoare triple {7027#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7027#false} is VALID [2018-11-23 12:17:09,760 INFO L273 TraceCheckUtils]: 95: Hoare triple {7027#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7027#false} is VALID [2018-11-23 12:17:09,760 INFO L273 TraceCheckUtils]: 96: Hoare triple {7027#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7027#false} is VALID [2018-11-23 12:17:09,760 INFO L273 TraceCheckUtils]: 97: Hoare triple {7027#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7027#false} is VALID [2018-11-23 12:17:09,761 INFO L273 TraceCheckUtils]: 98: Hoare triple {7027#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7027#false} is VALID [2018-11-23 12:17:09,761 INFO L273 TraceCheckUtils]: 99: Hoare triple {7027#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7027#false} is VALID [2018-11-23 12:17:09,761 INFO L273 TraceCheckUtils]: 100: Hoare triple {7027#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7027#false} is VALID [2018-11-23 12:17:09,761 INFO L273 TraceCheckUtils]: 101: Hoare triple {7027#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7027#false} is VALID [2018-11-23 12:17:09,761 INFO L273 TraceCheckUtils]: 102: Hoare triple {7027#false} assume !(~i~0 < 60); {7027#false} is VALID [2018-11-23 12:17:09,761 INFO L273 TraceCheckUtils]: 103: Hoare triple {7027#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7027#false} is VALID [2018-11-23 12:17:09,761 INFO L273 TraceCheckUtils]: 104: Hoare triple {7027#false} assume true; {7027#false} is VALID [2018-11-23 12:17:09,761 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {7027#false} {7027#false} #79#return; {7027#false} is VALID [2018-11-23 12:17:09,761 INFO L273 TraceCheckUtils]: 106: Hoare triple {7027#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {7027#false} is VALID [2018-11-23 12:17:09,762 INFO L273 TraceCheckUtils]: 107: Hoare triple {7027#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {7027#false} is VALID [2018-11-23 12:17:09,762 INFO L273 TraceCheckUtils]: 108: Hoare triple {7027#false} assume !false; {7027#false} is VALID [2018-11-23 12:17:09,767 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2018-11-23 12:17:09,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:09,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:17:09,786 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 109 [2018-11-23 12:17:09,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:09,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:17:09,887 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:09,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:17:09,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:17:09,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:17:09,888 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand 17 states. [2018-11-23 12:17:10,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:10,055 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2018-11-23 12:17:10,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:17:10,055 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 109 [2018-11-23 12:17:10,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:10,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:17:10,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 84 transitions. [2018-11-23 12:17:10,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:17:10,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 84 transitions. [2018-11-23 12:17:10,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 84 transitions. [2018-11-23 12:17:10,134 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-23 12:17:10,136 INFO L225 Difference]: With dead ends: 110 [2018-11-23 12:17:10,136 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 12:17:10,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:17:10,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 12:17:10,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-11-23 12:17:10,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:10,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 72 states. [2018-11-23 12:17:10,161 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 72 states. [2018-11-23 12:17:10,161 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 72 states. [2018-11-23 12:17:10,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:10,163 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-23 12:17:10,164 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2018-11-23 12:17:10,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:10,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:10,164 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 73 states. [2018-11-23 12:17:10,164 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 73 states. [2018-11-23 12:17:10,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:10,166 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-23 12:17:10,166 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2018-11-23 12:17:10,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:10,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:10,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:10,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:10,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 12:17:10,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-11-23 12:17:10,169 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 109 [2018-11-23 12:17:10,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:10,169 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-11-23 12:17:10,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:17:10,169 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-11-23 12:17:10,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-23 12:17:10,170 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:10,170 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:17:10,171 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:10,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:10,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1783127159, now seen corresponding path program 14 times [2018-11-23 12:17:10,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:10,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:10,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:10,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:17:10,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:10,543 INFO L256 TraceCheckUtils]: 0: Hoare triple {7777#true} call ULTIMATE.init(); {7777#true} is VALID [2018-11-23 12:17:10,544 INFO L273 TraceCheckUtils]: 1: Hoare triple {7777#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7777#true} is VALID [2018-11-23 12:17:10,544 INFO L273 TraceCheckUtils]: 2: Hoare triple {7777#true} assume true; {7777#true} is VALID [2018-11-23 12:17:10,544 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7777#true} {7777#true} #71#return; {7777#true} is VALID [2018-11-23 12:17:10,544 INFO L256 TraceCheckUtils]: 4: Hoare triple {7777#true} call #t~ret14 := main(); {7777#true} is VALID [2018-11-23 12:17:10,545 INFO L273 TraceCheckUtils]: 5: Hoare triple {7777#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7779#(= main_~i~1 0)} is VALID [2018-11-23 12:17:10,545 INFO L273 TraceCheckUtils]: 6: Hoare triple {7779#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7779#(= main_~i~1 0)} is VALID [2018-11-23 12:17:10,546 INFO L273 TraceCheckUtils]: 7: Hoare triple {7779#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7780#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:10,546 INFO L273 TraceCheckUtils]: 8: Hoare triple {7780#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7780#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:10,547 INFO L273 TraceCheckUtils]: 9: Hoare triple {7780#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7781#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:10,547 INFO L273 TraceCheckUtils]: 10: Hoare triple {7781#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7781#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:10,548 INFO L273 TraceCheckUtils]: 11: Hoare triple {7781#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7782#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:10,548 INFO L273 TraceCheckUtils]: 12: Hoare triple {7782#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7782#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:10,549 INFO L273 TraceCheckUtils]: 13: Hoare triple {7782#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7783#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:10,550 INFO L273 TraceCheckUtils]: 14: Hoare triple {7783#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7783#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:10,550 INFO L273 TraceCheckUtils]: 15: Hoare triple {7783#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7784#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:10,551 INFO L273 TraceCheckUtils]: 16: Hoare triple {7784#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7784#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:10,552 INFO L273 TraceCheckUtils]: 17: Hoare triple {7784#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7785#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:10,552 INFO L273 TraceCheckUtils]: 18: Hoare triple {7785#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7785#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:10,553 INFO L273 TraceCheckUtils]: 19: Hoare triple {7785#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7786#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:10,554 INFO L273 TraceCheckUtils]: 20: Hoare triple {7786#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7786#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:10,554 INFO L273 TraceCheckUtils]: 21: Hoare triple {7786#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7787#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:10,555 INFO L273 TraceCheckUtils]: 22: Hoare triple {7787#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7787#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:10,556 INFO L273 TraceCheckUtils]: 23: Hoare triple {7787#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7788#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:10,556 INFO L273 TraceCheckUtils]: 24: Hoare triple {7788#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7788#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:10,557 INFO L273 TraceCheckUtils]: 25: Hoare triple {7788#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7789#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:10,557 INFO L273 TraceCheckUtils]: 26: Hoare triple {7789#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7789#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:10,558 INFO L273 TraceCheckUtils]: 27: Hoare triple {7789#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7790#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:10,559 INFO L273 TraceCheckUtils]: 28: Hoare triple {7790#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7790#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:10,559 INFO L273 TraceCheckUtils]: 29: Hoare triple {7790#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7791#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:10,560 INFO L273 TraceCheckUtils]: 30: Hoare triple {7791#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7791#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:10,561 INFO L273 TraceCheckUtils]: 31: Hoare triple {7791#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7792#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:10,561 INFO L273 TraceCheckUtils]: 32: Hoare triple {7792#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7792#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:10,562 INFO L273 TraceCheckUtils]: 33: Hoare triple {7792#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7793#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:10,563 INFO L273 TraceCheckUtils]: 34: Hoare triple {7793#(<= main_~i~1 14)} assume !(~i~1 < 60); {7778#false} is VALID [2018-11-23 12:17:10,563 INFO L256 TraceCheckUtils]: 35: Hoare triple {7778#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {7777#true} is VALID [2018-11-23 12:17:10,563 INFO L273 TraceCheckUtils]: 36: Hoare triple {7777#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {7777#true} is VALID [2018-11-23 12:17:10,563 INFO L273 TraceCheckUtils]: 37: Hoare triple {7777#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7777#true} is VALID [2018-11-23 12:17:10,564 INFO L273 TraceCheckUtils]: 38: Hoare triple {7777#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7777#true} is VALID [2018-11-23 12:17:10,564 INFO L273 TraceCheckUtils]: 39: Hoare triple {7777#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7777#true} is VALID [2018-11-23 12:17:10,564 INFO L273 TraceCheckUtils]: 40: Hoare triple {7777#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7777#true} is VALID [2018-11-23 12:17:10,564 INFO L273 TraceCheckUtils]: 41: Hoare triple {7777#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7777#true} is VALID [2018-11-23 12:17:10,564 INFO L273 TraceCheckUtils]: 42: Hoare triple {7777#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7777#true} is VALID [2018-11-23 12:17:10,565 INFO L273 TraceCheckUtils]: 43: Hoare triple {7777#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7777#true} is VALID [2018-11-23 12:17:10,565 INFO L273 TraceCheckUtils]: 44: Hoare triple {7777#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7777#true} is VALID [2018-11-23 12:17:10,565 INFO L273 TraceCheckUtils]: 45: Hoare triple {7777#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7777#true} is VALID [2018-11-23 12:17:10,565 INFO L273 TraceCheckUtils]: 46: Hoare triple {7777#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7777#true} is VALID [2018-11-23 12:17:10,565 INFO L273 TraceCheckUtils]: 47: Hoare triple {7777#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7777#true} is VALID [2018-11-23 12:17:10,566 INFO L273 TraceCheckUtils]: 48: Hoare triple {7777#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7777#true} is VALID [2018-11-23 12:17:10,566 INFO L273 TraceCheckUtils]: 49: Hoare triple {7777#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7777#true} is VALID [2018-11-23 12:17:10,566 INFO L273 TraceCheckUtils]: 50: Hoare triple {7777#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7777#true} is VALID [2018-11-23 12:17:10,566 INFO L273 TraceCheckUtils]: 51: Hoare triple {7777#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7777#true} is VALID [2018-11-23 12:17:10,566 INFO L273 TraceCheckUtils]: 52: Hoare triple {7777#true} assume !(~i~0 < 60); {7777#true} is VALID [2018-11-23 12:17:10,567 INFO L273 TraceCheckUtils]: 53: Hoare triple {7777#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7777#true} is VALID [2018-11-23 12:17:10,567 INFO L273 TraceCheckUtils]: 54: Hoare triple {7777#true} assume true; {7777#true} is VALID [2018-11-23 12:17:10,567 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {7777#true} {7778#false} #75#return; {7778#false} is VALID [2018-11-23 12:17:10,567 INFO L273 TraceCheckUtils]: 56: Hoare triple {7778#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {7778#false} is VALID [2018-11-23 12:17:10,567 INFO L256 TraceCheckUtils]: 57: Hoare triple {7778#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {7777#true} is VALID [2018-11-23 12:17:10,567 INFO L273 TraceCheckUtils]: 58: Hoare triple {7777#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {7777#true} is VALID [2018-11-23 12:17:10,568 INFO L273 TraceCheckUtils]: 59: Hoare triple {7777#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7777#true} is VALID [2018-11-23 12:17:10,568 INFO L273 TraceCheckUtils]: 60: Hoare triple {7777#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7777#true} is VALID [2018-11-23 12:17:10,568 INFO L273 TraceCheckUtils]: 61: Hoare triple {7777#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7777#true} is VALID [2018-11-23 12:17:10,568 INFO L273 TraceCheckUtils]: 62: Hoare triple {7777#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7777#true} is VALID [2018-11-23 12:17:10,568 INFO L273 TraceCheckUtils]: 63: Hoare triple {7777#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7777#true} is VALID [2018-11-23 12:17:10,568 INFO L273 TraceCheckUtils]: 64: Hoare triple {7777#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7777#true} is VALID [2018-11-23 12:17:10,568 INFO L273 TraceCheckUtils]: 65: Hoare triple {7777#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7777#true} is VALID [2018-11-23 12:17:10,568 INFO L273 TraceCheckUtils]: 66: Hoare triple {7777#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7777#true} is VALID [2018-11-23 12:17:10,568 INFO L273 TraceCheckUtils]: 67: Hoare triple {7777#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7777#true} is VALID [2018-11-23 12:17:10,569 INFO L273 TraceCheckUtils]: 68: Hoare triple {7777#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7777#true} is VALID [2018-11-23 12:17:10,569 INFO L273 TraceCheckUtils]: 69: Hoare triple {7777#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7777#true} is VALID [2018-11-23 12:17:10,569 INFO L273 TraceCheckUtils]: 70: Hoare triple {7777#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7777#true} is VALID [2018-11-23 12:17:10,569 INFO L273 TraceCheckUtils]: 71: Hoare triple {7777#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7777#true} is VALID [2018-11-23 12:17:10,569 INFO L273 TraceCheckUtils]: 72: Hoare triple {7777#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7777#true} is VALID [2018-11-23 12:17:10,569 INFO L273 TraceCheckUtils]: 73: Hoare triple {7777#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7777#true} is VALID [2018-11-23 12:17:10,569 INFO L273 TraceCheckUtils]: 74: Hoare triple {7777#true} assume !(~i~0 < 60); {7777#true} is VALID [2018-11-23 12:17:10,569 INFO L273 TraceCheckUtils]: 75: Hoare triple {7777#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7777#true} is VALID [2018-11-23 12:17:10,570 INFO L273 TraceCheckUtils]: 76: Hoare triple {7777#true} assume true; {7777#true} is VALID [2018-11-23 12:17:10,570 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {7777#true} {7778#false} #77#return; {7778#false} is VALID [2018-11-23 12:17:10,570 INFO L273 TraceCheckUtils]: 78: Hoare triple {7778#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {7778#false} is VALID [2018-11-23 12:17:10,570 INFO L273 TraceCheckUtils]: 79: Hoare triple {7778#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7778#false} is VALID [2018-11-23 12:17:10,570 INFO L273 TraceCheckUtils]: 80: Hoare triple {7778#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7778#false} is VALID [2018-11-23 12:17:10,570 INFO L273 TraceCheckUtils]: 81: Hoare triple {7778#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7778#false} is VALID [2018-11-23 12:17:10,570 INFO L273 TraceCheckUtils]: 82: Hoare triple {7778#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7778#false} is VALID [2018-11-23 12:17:10,570 INFO L273 TraceCheckUtils]: 83: Hoare triple {7778#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7778#false} is VALID [2018-11-23 12:17:10,570 INFO L273 TraceCheckUtils]: 84: Hoare triple {7778#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7778#false} is VALID [2018-11-23 12:17:10,571 INFO L273 TraceCheckUtils]: 85: Hoare triple {7778#false} assume !(~i~2 < 59); {7778#false} is VALID [2018-11-23 12:17:10,571 INFO L273 TraceCheckUtils]: 86: Hoare triple {7778#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {7778#false} is VALID [2018-11-23 12:17:10,571 INFO L256 TraceCheckUtils]: 87: Hoare triple {7778#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {7777#true} is VALID [2018-11-23 12:17:10,571 INFO L273 TraceCheckUtils]: 88: Hoare triple {7777#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {7777#true} is VALID [2018-11-23 12:17:10,571 INFO L273 TraceCheckUtils]: 89: Hoare triple {7777#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7777#true} is VALID [2018-11-23 12:17:10,571 INFO L273 TraceCheckUtils]: 90: Hoare triple {7777#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7777#true} is VALID [2018-11-23 12:17:10,571 INFO L273 TraceCheckUtils]: 91: Hoare triple {7777#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7777#true} is VALID [2018-11-23 12:17:10,571 INFO L273 TraceCheckUtils]: 92: Hoare triple {7777#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7777#true} is VALID [2018-11-23 12:17:10,571 INFO L273 TraceCheckUtils]: 93: Hoare triple {7777#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7777#true} is VALID [2018-11-23 12:17:10,572 INFO L273 TraceCheckUtils]: 94: Hoare triple {7777#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7777#true} is VALID [2018-11-23 12:17:10,572 INFO L273 TraceCheckUtils]: 95: Hoare triple {7777#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7777#true} is VALID [2018-11-23 12:17:10,572 INFO L273 TraceCheckUtils]: 96: Hoare triple {7777#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7777#true} is VALID [2018-11-23 12:17:10,572 INFO L273 TraceCheckUtils]: 97: Hoare triple {7777#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7777#true} is VALID [2018-11-23 12:17:10,572 INFO L273 TraceCheckUtils]: 98: Hoare triple {7777#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7777#true} is VALID [2018-11-23 12:17:10,572 INFO L273 TraceCheckUtils]: 99: Hoare triple {7777#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7777#true} is VALID [2018-11-23 12:17:10,572 INFO L273 TraceCheckUtils]: 100: Hoare triple {7777#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7777#true} is VALID [2018-11-23 12:17:10,572 INFO L273 TraceCheckUtils]: 101: Hoare triple {7777#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7777#true} is VALID [2018-11-23 12:17:10,573 INFO L273 TraceCheckUtils]: 102: Hoare triple {7777#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7777#true} is VALID [2018-11-23 12:17:10,573 INFO L273 TraceCheckUtils]: 103: Hoare triple {7777#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7777#true} is VALID [2018-11-23 12:17:10,573 INFO L273 TraceCheckUtils]: 104: Hoare triple {7777#true} assume !(~i~0 < 60); {7777#true} is VALID [2018-11-23 12:17:10,573 INFO L273 TraceCheckUtils]: 105: Hoare triple {7777#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7777#true} is VALID [2018-11-23 12:17:10,573 INFO L273 TraceCheckUtils]: 106: Hoare triple {7777#true} assume true; {7777#true} is VALID [2018-11-23 12:17:10,573 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {7777#true} {7778#false} #79#return; {7778#false} is VALID [2018-11-23 12:17:10,573 INFO L273 TraceCheckUtils]: 108: Hoare triple {7778#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {7778#false} is VALID [2018-11-23 12:17:10,573 INFO L273 TraceCheckUtils]: 109: Hoare triple {7778#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {7778#false} is VALID [2018-11-23 12:17:10,573 INFO L273 TraceCheckUtils]: 110: Hoare triple {7778#false} assume !false; {7778#false} is VALID [2018-11-23 12:17:10,579 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2018-11-23 12:17:10,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:10,579 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:17:10,587 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:17:10,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:17:10,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:10,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:10,889 INFO L256 TraceCheckUtils]: 0: Hoare triple {7777#true} call ULTIMATE.init(); {7777#true} is VALID [2018-11-23 12:17:10,889 INFO L273 TraceCheckUtils]: 1: Hoare triple {7777#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7777#true} is VALID [2018-11-23 12:17:10,889 INFO L273 TraceCheckUtils]: 2: Hoare triple {7777#true} assume true; {7777#true} is VALID [2018-11-23 12:17:10,890 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7777#true} {7777#true} #71#return; {7777#true} is VALID [2018-11-23 12:17:10,890 INFO L256 TraceCheckUtils]: 4: Hoare triple {7777#true} call #t~ret14 := main(); {7777#true} is VALID [2018-11-23 12:17:10,891 INFO L273 TraceCheckUtils]: 5: Hoare triple {7777#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7812#(<= main_~i~1 0)} is VALID [2018-11-23 12:17:10,891 INFO L273 TraceCheckUtils]: 6: Hoare triple {7812#(<= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7812#(<= main_~i~1 0)} is VALID [2018-11-23 12:17:10,892 INFO L273 TraceCheckUtils]: 7: Hoare triple {7812#(<= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7780#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:10,892 INFO L273 TraceCheckUtils]: 8: Hoare triple {7780#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7780#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:10,892 INFO L273 TraceCheckUtils]: 9: Hoare triple {7780#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7781#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:10,893 INFO L273 TraceCheckUtils]: 10: Hoare triple {7781#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7781#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:10,893 INFO L273 TraceCheckUtils]: 11: Hoare triple {7781#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7782#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:10,894 INFO L273 TraceCheckUtils]: 12: Hoare triple {7782#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7782#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:10,895 INFO L273 TraceCheckUtils]: 13: Hoare triple {7782#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7783#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:10,895 INFO L273 TraceCheckUtils]: 14: Hoare triple {7783#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7783#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:10,896 INFO L273 TraceCheckUtils]: 15: Hoare triple {7783#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7784#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:10,897 INFO L273 TraceCheckUtils]: 16: Hoare triple {7784#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7784#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:10,897 INFO L273 TraceCheckUtils]: 17: Hoare triple {7784#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7785#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:10,898 INFO L273 TraceCheckUtils]: 18: Hoare triple {7785#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7785#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:10,899 INFO L273 TraceCheckUtils]: 19: Hoare triple {7785#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7786#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:10,899 INFO L273 TraceCheckUtils]: 20: Hoare triple {7786#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7786#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:10,900 INFO L273 TraceCheckUtils]: 21: Hoare triple {7786#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7787#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:10,901 INFO L273 TraceCheckUtils]: 22: Hoare triple {7787#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7787#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:10,901 INFO L273 TraceCheckUtils]: 23: Hoare triple {7787#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7788#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:10,902 INFO L273 TraceCheckUtils]: 24: Hoare triple {7788#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7788#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:10,903 INFO L273 TraceCheckUtils]: 25: Hoare triple {7788#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7789#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:10,903 INFO L273 TraceCheckUtils]: 26: Hoare triple {7789#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7789#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:10,904 INFO L273 TraceCheckUtils]: 27: Hoare triple {7789#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7790#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:10,904 INFO L273 TraceCheckUtils]: 28: Hoare triple {7790#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7790#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:10,905 INFO L273 TraceCheckUtils]: 29: Hoare triple {7790#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7791#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:10,906 INFO L273 TraceCheckUtils]: 30: Hoare triple {7791#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7791#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:10,906 INFO L273 TraceCheckUtils]: 31: Hoare triple {7791#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7792#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:10,907 INFO L273 TraceCheckUtils]: 32: Hoare triple {7792#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7792#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:10,908 INFO L273 TraceCheckUtils]: 33: Hoare triple {7792#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7793#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:10,908 INFO L273 TraceCheckUtils]: 34: Hoare triple {7793#(<= main_~i~1 14)} assume !(~i~1 < 60); {7778#false} is VALID [2018-11-23 12:17:10,909 INFO L256 TraceCheckUtils]: 35: Hoare triple {7778#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {7778#false} is VALID [2018-11-23 12:17:10,909 INFO L273 TraceCheckUtils]: 36: Hoare triple {7778#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {7778#false} is VALID [2018-11-23 12:17:10,909 INFO L273 TraceCheckUtils]: 37: Hoare triple {7778#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7778#false} is VALID [2018-11-23 12:17:10,909 INFO L273 TraceCheckUtils]: 38: Hoare triple {7778#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7778#false} is VALID [2018-11-23 12:17:10,910 INFO L273 TraceCheckUtils]: 39: Hoare triple {7778#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7778#false} is VALID [2018-11-23 12:17:10,910 INFO L273 TraceCheckUtils]: 40: Hoare triple {7778#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7778#false} is VALID [2018-11-23 12:17:10,910 INFO L273 TraceCheckUtils]: 41: Hoare triple {7778#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7778#false} is VALID [2018-11-23 12:17:10,910 INFO L273 TraceCheckUtils]: 42: Hoare triple {7778#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7778#false} is VALID [2018-11-23 12:17:10,910 INFO L273 TraceCheckUtils]: 43: Hoare triple {7778#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7778#false} is VALID [2018-11-23 12:17:10,911 INFO L273 TraceCheckUtils]: 44: Hoare triple {7778#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7778#false} is VALID [2018-11-23 12:17:10,911 INFO L273 TraceCheckUtils]: 45: Hoare triple {7778#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7778#false} is VALID [2018-11-23 12:17:10,911 INFO L273 TraceCheckUtils]: 46: Hoare triple {7778#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7778#false} is VALID [2018-11-23 12:17:10,911 INFO L273 TraceCheckUtils]: 47: Hoare triple {7778#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7778#false} is VALID [2018-11-23 12:17:10,911 INFO L273 TraceCheckUtils]: 48: Hoare triple {7778#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7778#false} is VALID [2018-11-23 12:17:10,912 INFO L273 TraceCheckUtils]: 49: Hoare triple {7778#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7778#false} is VALID [2018-11-23 12:17:10,912 INFO L273 TraceCheckUtils]: 50: Hoare triple {7778#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7778#false} is VALID [2018-11-23 12:17:10,912 INFO L273 TraceCheckUtils]: 51: Hoare triple {7778#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7778#false} is VALID [2018-11-23 12:17:10,912 INFO L273 TraceCheckUtils]: 52: Hoare triple {7778#false} assume !(~i~0 < 60); {7778#false} is VALID [2018-11-23 12:17:10,912 INFO L273 TraceCheckUtils]: 53: Hoare triple {7778#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7778#false} is VALID [2018-11-23 12:17:10,913 INFO L273 TraceCheckUtils]: 54: Hoare triple {7778#false} assume true; {7778#false} is VALID [2018-11-23 12:17:10,913 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {7778#false} {7778#false} #75#return; {7778#false} is VALID [2018-11-23 12:17:10,913 INFO L273 TraceCheckUtils]: 56: Hoare triple {7778#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {7778#false} is VALID [2018-11-23 12:17:10,913 INFO L256 TraceCheckUtils]: 57: Hoare triple {7778#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {7778#false} is VALID [2018-11-23 12:17:10,913 INFO L273 TraceCheckUtils]: 58: Hoare triple {7778#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {7778#false} is VALID [2018-11-23 12:17:10,913 INFO L273 TraceCheckUtils]: 59: Hoare triple {7778#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7778#false} is VALID [2018-11-23 12:17:10,913 INFO L273 TraceCheckUtils]: 60: Hoare triple {7778#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7778#false} is VALID [2018-11-23 12:17:10,914 INFO L273 TraceCheckUtils]: 61: Hoare triple {7778#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7778#false} is VALID [2018-11-23 12:17:10,914 INFO L273 TraceCheckUtils]: 62: Hoare triple {7778#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7778#false} is VALID [2018-11-23 12:17:10,914 INFO L273 TraceCheckUtils]: 63: Hoare triple {7778#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7778#false} is VALID [2018-11-23 12:17:10,914 INFO L273 TraceCheckUtils]: 64: Hoare triple {7778#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7778#false} is VALID [2018-11-23 12:17:10,914 INFO L273 TraceCheckUtils]: 65: Hoare triple {7778#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7778#false} is VALID [2018-11-23 12:17:10,914 INFO L273 TraceCheckUtils]: 66: Hoare triple {7778#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7778#false} is VALID [2018-11-23 12:17:10,914 INFO L273 TraceCheckUtils]: 67: Hoare triple {7778#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7778#false} is VALID [2018-11-23 12:17:10,914 INFO L273 TraceCheckUtils]: 68: Hoare triple {7778#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7778#false} is VALID [2018-11-23 12:17:10,914 INFO L273 TraceCheckUtils]: 69: Hoare triple {7778#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7778#false} is VALID [2018-11-23 12:17:10,915 INFO L273 TraceCheckUtils]: 70: Hoare triple {7778#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7778#false} is VALID [2018-11-23 12:17:10,915 INFO L273 TraceCheckUtils]: 71: Hoare triple {7778#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7778#false} is VALID [2018-11-23 12:17:10,915 INFO L273 TraceCheckUtils]: 72: Hoare triple {7778#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7778#false} is VALID [2018-11-23 12:17:10,915 INFO L273 TraceCheckUtils]: 73: Hoare triple {7778#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7778#false} is VALID [2018-11-23 12:17:10,915 INFO L273 TraceCheckUtils]: 74: Hoare triple {7778#false} assume !(~i~0 < 60); {7778#false} is VALID [2018-11-23 12:17:10,915 INFO L273 TraceCheckUtils]: 75: Hoare triple {7778#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7778#false} is VALID [2018-11-23 12:17:10,915 INFO L273 TraceCheckUtils]: 76: Hoare triple {7778#false} assume true; {7778#false} is VALID [2018-11-23 12:17:10,915 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {7778#false} {7778#false} #77#return; {7778#false} is VALID [2018-11-23 12:17:10,915 INFO L273 TraceCheckUtils]: 78: Hoare triple {7778#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {7778#false} is VALID [2018-11-23 12:17:10,916 INFO L273 TraceCheckUtils]: 79: Hoare triple {7778#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7778#false} is VALID [2018-11-23 12:17:10,916 INFO L273 TraceCheckUtils]: 80: Hoare triple {7778#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7778#false} is VALID [2018-11-23 12:17:10,916 INFO L273 TraceCheckUtils]: 81: Hoare triple {7778#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7778#false} is VALID [2018-11-23 12:17:10,916 INFO L273 TraceCheckUtils]: 82: Hoare triple {7778#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7778#false} is VALID [2018-11-23 12:17:10,916 INFO L273 TraceCheckUtils]: 83: Hoare triple {7778#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7778#false} is VALID [2018-11-23 12:17:10,916 INFO L273 TraceCheckUtils]: 84: Hoare triple {7778#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7778#false} is VALID [2018-11-23 12:17:10,916 INFO L273 TraceCheckUtils]: 85: Hoare triple {7778#false} assume !(~i~2 < 59); {7778#false} is VALID [2018-11-23 12:17:10,916 INFO L273 TraceCheckUtils]: 86: Hoare triple {7778#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {7778#false} is VALID [2018-11-23 12:17:10,917 INFO L256 TraceCheckUtils]: 87: Hoare triple {7778#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {7778#false} is VALID [2018-11-23 12:17:10,917 INFO L273 TraceCheckUtils]: 88: Hoare triple {7778#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {7778#false} is VALID [2018-11-23 12:17:10,917 INFO L273 TraceCheckUtils]: 89: Hoare triple {7778#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7778#false} is VALID [2018-11-23 12:17:10,917 INFO L273 TraceCheckUtils]: 90: Hoare triple {7778#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7778#false} is VALID [2018-11-23 12:17:10,917 INFO L273 TraceCheckUtils]: 91: Hoare triple {7778#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7778#false} is VALID [2018-11-23 12:17:10,917 INFO L273 TraceCheckUtils]: 92: Hoare triple {7778#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7778#false} is VALID [2018-11-23 12:17:10,917 INFO L273 TraceCheckUtils]: 93: Hoare triple {7778#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7778#false} is VALID [2018-11-23 12:17:10,917 INFO L273 TraceCheckUtils]: 94: Hoare triple {7778#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7778#false} is VALID [2018-11-23 12:17:10,917 INFO L273 TraceCheckUtils]: 95: Hoare triple {7778#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7778#false} is VALID [2018-11-23 12:17:10,918 INFO L273 TraceCheckUtils]: 96: Hoare triple {7778#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7778#false} is VALID [2018-11-23 12:17:10,918 INFO L273 TraceCheckUtils]: 97: Hoare triple {7778#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7778#false} is VALID [2018-11-23 12:17:10,918 INFO L273 TraceCheckUtils]: 98: Hoare triple {7778#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7778#false} is VALID [2018-11-23 12:17:10,918 INFO L273 TraceCheckUtils]: 99: Hoare triple {7778#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7778#false} is VALID [2018-11-23 12:17:10,918 INFO L273 TraceCheckUtils]: 100: Hoare triple {7778#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7778#false} is VALID [2018-11-23 12:17:10,918 INFO L273 TraceCheckUtils]: 101: Hoare triple {7778#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7778#false} is VALID [2018-11-23 12:17:10,919 INFO L273 TraceCheckUtils]: 102: Hoare triple {7778#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7778#false} is VALID [2018-11-23 12:17:10,919 INFO L273 TraceCheckUtils]: 103: Hoare triple {7778#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7778#false} is VALID [2018-11-23 12:17:10,919 INFO L273 TraceCheckUtils]: 104: Hoare triple {7778#false} assume !(~i~0 < 60); {7778#false} is VALID [2018-11-23 12:17:10,919 INFO L273 TraceCheckUtils]: 105: Hoare triple {7778#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7778#false} is VALID [2018-11-23 12:17:10,919 INFO L273 TraceCheckUtils]: 106: Hoare triple {7778#false} assume true; {7778#false} is VALID [2018-11-23 12:17:10,919 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {7778#false} {7778#false} #79#return; {7778#false} is VALID [2018-11-23 12:17:10,919 INFO L273 TraceCheckUtils]: 108: Hoare triple {7778#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {7778#false} is VALID [2018-11-23 12:17:10,919 INFO L273 TraceCheckUtils]: 109: Hoare triple {7778#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {7778#false} is VALID [2018-11-23 12:17:10,919 INFO L273 TraceCheckUtils]: 110: Hoare triple {7778#false} assume !false; {7778#false} is VALID [2018-11-23 12:17:10,925 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2018-11-23 12:17:10,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:10,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:17:10,945 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 111 [2018-11-23 12:17:10,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:10,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:17:11,015 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-23 12:17:11,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:17:11,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:17:11,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:17:11,016 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 18 states. [2018-11-23 12:17:11,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:11,495 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2018-11-23 12:17:11,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:17:11,495 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 111 [2018-11-23 12:17:11,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:11,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:17:11,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 12:17:11,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:17:11,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 12:17:11,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 86 transitions. [2018-11-23 12:17:11,598 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:11,600 INFO L225 Difference]: With dead ends: 112 [2018-11-23 12:17:11,600 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 12:17:11,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:17:11,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 12:17:11,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-11-23 12:17:11,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:11,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 74 states. [2018-11-23 12:17:11,629 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 74 states. [2018-11-23 12:17:11,629 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 74 states. [2018-11-23 12:17:11,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:11,632 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2018-11-23 12:17:11,632 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2018-11-23 12:17:11,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:11,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:11,632 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 75 states. [2018-11-23 12:17:11,633 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 75 states. [2018-11-23 12:17:11,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:11,634 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2018-11-23 12:17:11,634 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2018-11-23 12:17:11,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:11,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:11,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:11,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:11,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 12:17:11,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2018-11-23 12:17:11,637 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 111 [2018-11-23 12:17:11,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:11,637 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2018-11-23 12:17:11,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:17:11,638 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2018-11-23 12:17:11,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-23 12:17:11,639 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:11,639 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:17:11,639 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:11,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:11,640 INFO L82 PathProgramCache]: Analyzing trace with hash -2080039001, now seen corresponding path program 15 times [2018-11-23 12:17:11,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:11,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:11,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:11,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:11,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:12,054 INFO L256 TraceCheckUtils]: 0: Hoare triple {8545#true} call ULTIMATE.init(); {8545#true} is VALID [2018-11-23 12:17:12,054 INFO L273 TraceCheckUtils]: 1: Hoare triple {8545#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8545#true} is VALID [2018-11-23 12:17:12,054 INFO L273 TraceCheckUtils]: 2: Hoare triple {8545#true} assume true; {8545#true} is VALID [2018-11-23 12:17:12,054 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8545#true} {8545#true} #71#return; {8545#true} is VALID [2018-11-23 12:17:12,054 INFO L256 TraceCheckUtils]: 4: Hoare triple {8545#true} call #t~ret14 := main(); {8545#true} is VALID [2018-11-23 12:17:12,055 INFO L273 TraceCheckUtils]: 5: Hoare triple {8545#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {8547#(= main_~i~1 0)} is VALID [2018-11-23 12:17:12,055 INFO L273 TraceCheckUtils]: 6: Hoare triple {8547#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8547#(= main_~i~1 0)} is VALID [2018-11-23 12:17:12,056 INFO L273 TraceCheckUtils]: 7: Hoare triple {8547#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8548#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:12,056 INFO L273 TraceCheckUtils]: 8: Hoare triple {8548#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8548#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:12,057 INFO L273 TraceCheckUtils]: 9: Hoare triple {8548#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8549#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:12,057 INFO L273 TraceCheckUtils]: 10: Hoare triple {8549#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8549#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:12,057 INFO L273 TraceCheckUtils]: 11: Hoare triple {8549#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8550#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:12,058 INFO L273 TraceCheckUtils]: 12: Hoare triple {8550#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8550#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:12,058 INFO L273 TraceCheckUtils]: 13: Hoare triple {8550#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8551#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:12,059 INFO L273 TraceCheckUtils]: 14: Hoare triple {8551#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8551#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:12,059 INFO L273 TraceCheckUtils]: 15: Hoare triple {8551#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8552#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:12,060 INFO L273 TraceCheckUtils]: 16: Hoare triple {8552#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8552#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:12,061 INFO L273 TraceCheckUtils]: 17: Hoare triple {8552#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8553#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:12,061 INFO L273 TraceCheckUtils]: 18: Hoare triple {8553#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8553#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:12,062 INFO L273 TraceCheckUtils]: 19: Hoare triple {8553#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8554#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:12,063 INFO L273 TraceCheckUtils]: 20: Hoare triple {8554#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8554#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:12,063 INFO L273 TraceCheckUtils]: 21: Hoare triple {8554#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8555#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:12,064 INFO L273 TraceCheckUtils]: 22: Hoare triple {8555#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8555#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:12,065 INFO L273 TraceCheckUtils]: 23: Hoare triple {8555#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8556#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:12,065 INFO L273 TraceCheckUtils]: 24: Hoare triple {8556#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8556#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:12,066 INFO L273 TraceCheckUtils]: 25: Hoare triple {8556#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8557#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:12,067 INFO L273 TraceCheckUtils]: 26: Hoare triple {8557#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8557#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:12,067 INFO L273 TraceCheckUtils]: 27: Hoare triple {8557#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8558#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:12,068 INFO L273 TraceCheckUtils]: 28: Hoare triple {8558#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8558#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:12,069 INFO L273 TraceCheckUtils]: 29: Hoare triple {8558#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8559#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:12,069 INFO L273 TraceCheckUtils]: 30: Hoare triple {8559#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8559#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:12,070 INFO L273 TraceCheckUtils]: 31: Hoare triple {8559#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8560#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:12,070 INFO L273 TraceCheckUtils]: 32: Hoare triple {8560#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8560#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:12,071 INFO L273 TraceCheckUtils]: 33: Hoare triple {8560#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8561#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:12,072 INFO L273 TraceCheckUtils]: 34: Hoare triple {8561#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8561#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:12,072 INFO L273 TraceCheckUtils]: 35: Hoare triple {8561#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8562#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:12,073 INFO L273 TraceCheckUtils]: 36: Hoare triple {8562#(<= main_~i~1 15)} assume !(~i~1 < 60); {8546#false} is VALID [2018-11-23 12:17:12,073 INFO L256 TraceCheckUtils]: 37: Hoare triple {8546#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {8545#true} is VALID [2018-11-23 12:17:12,073 INFO L273 TraceCheckUtils]: 38: Hoare triple {8545#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {8545#true} is VALID [2018-11-23 12:17:12,074 INFO L273 TraceCheckUtils]: 39: Hoare triple {8545#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8545#true} is VALID [2018-11-23 12:17:12,074 INFO L273 TraceCheckUtils]: 40: Hoare triple {8545#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8545#true} is VALID [2018-11-23 12:17:12,074 INFO L273 TraceCheckUtils]: 41: Hoare triple {8545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8545#true} is VALID [2018-11-23 12:17:12,074 INFO L273 TraceCheckUtils]: 42: Hoare triple {8545#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8545#true} is VALID [2018-11-23 12:17:12,074 INFO L273 TraceCheckUtils]: 43: Hoare triple {8545#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8545#true} is VALID [2018-11-23 12:17:12,075 INFO L273 TraceCheckUtils]: 44: Hoare triple {8545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8545#true} is VALID [2018-11-23 12:17:12,075 INFO L273 TraceCheckUtils]: 45: Hoare triple {8545#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8545#true} is VALID [2018-11-23 12:17:12,075 INFO L273 TraceCheckUtils]: 46: Hoare triple {8545#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8545#true} is VALID [2018-11-23 12:17:12,075 INFO L273 TraceCheckUtils]: 47: Hoare triple {8545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8545#true} is VALID [2018-11-23 12:17:12,075 INFO L273 TraceCheckUtils]: 48: Hoare triple {8545#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8545#true} is VALID [2018-11-23 12:17:12,075 INFO L273 TraceCheckUtils]: 49: Hoare triple {8545#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8545#true} is VALID [2018-11-23 12:17:12,076 INFO L273 TraceCheckUtils]: 50: Hoare triple {8545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8545#true} is VALID [2018-11-23 12:17:12,076 INFO L273 TraceCheckUtils]: 51: Hoare triple {8545#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8545#true} is VALID [2018-11-23 12:17:12,076 INFO L273 TraceCheckUtils]: 52: Hoare triple {8545#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8545#true} is VALID [2018-11-23 12:17:12,076 INFO L273 TraceCheckUtils]: 53: Hoare triple {8545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8545#true} is VALID [2018-11-23 12:17:12,076 INFO L273 TraceCheckUtils]: 54: Hoare triple {8545#true} assume !(~i~0 < 60); {8545#true} is VALID [2018-11-23 12:17:12,076 INFO L273 TraceCheckUtils]: 55: Hoare triple {8545#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8545#true} is VALID [2018-11-23 12:17:12,076 INFO L273 TraceCheckUtils]: 56: Hoare triple {8545#true} assume true; {8545#true} is VALID [2018-11-23 12:17:12,076 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {8545#true} {8546#false} #75#return; {8546#false} is VALID [2018-11-23 12:17:12,076 INFO L273 TraceCheckUtils]: 58: Hoare triple {8546#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {8546#false} is VALID [2018-11-23 12:17:12,077 INFO L256 TraceCheckUtils]: 59: Hoare triple {8546#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {8545#true} is VALID [2018-11-23 12:17:12,077 INFO L273 TraceCheckUtils]: 60: Hoare triple {8545#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {8545#true} is VALID [2018-11-23 12:17:12,077 INFO L273 TraceCheckUtils]: 61: Hoare triple {8545#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8545#true} is VALID [2018-11-23 12:17:12,077 INFO L273 TraceCheckUtils]: 62: Hoare triple {8545#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8545#true} is VALID [2018-11-23 12:17:12,077 INFO L273 TraceCheckUtils]: 63: Hoare triple {8545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8545#true} is VALID [2018-11-23 12:17:12,077 INFO L273 TraceCheckUtils]: 64: Hoare triple {8545#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8545#true} is VALID [2018-11-23 12:17:12,077 INFO L273 TraceCheckUtils]: 65: Hoare triple {8545#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8545#true} is VALID [2018-11-23 12:17:12,077 INFO L273 TraceCheckUtils]: 66: Hoare triple {8545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8545#true} is VALID [2018-11-23 12:17:12,078 INFO L273 TraceCheckUtils]: 67: Hoare triple {8545#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8545#true} is VALID [2018-11-23 12:17:12,078 INFO L273 TraceCheckUtils]: 68: Hoare triple {8545#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8545#true} is VALID [2018-11-23 12:17:12,078 INFO L273 TraceCheckUtils]: 69: Hoare triple {8545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8545#true} is VALID [2018-11-23 12:17:12,078 INFO L273 TraceCheckUtils]: 70: Hoare triple {8545#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8545#true} is VALID [2018-11-23 12:17:12,078 INFO L273 TraceCheckUtils]: 71: Hoare triple {8545#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8545#true} is VALID [2018-11-23 12:17:12,078 INFO L273 TraceCheckUtils]: 72: Hoare triple {8545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8545#true} is VALID [2018-11-23 12:17:12,078 INFO L273 TraceCheckUtils]: 73: Hoare triple {8545#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8545#true} is VALID [2018-11-23 12:17:12,078 INFO L273 TraceCheckUtils]: 74: Hoare triple {8545#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8545#true} is VALID [2018-11-23 12:17:12,078 INFO L273 TraceCheckUtils]: 75: Hoare triple {8545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8545#true} is VALID [2018-11-23 12:17:12,079 INFO L273 TraceCheckUtils]: 76: Hoare triple {8545#true} assume !(~i~0 < 60); {8545#true} is VALID [2018-11-23 12:17:12,079 INFO L273 TraceCheckUtils]: 77: Hoare triple {8545#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8545#true} is VALID [2018-11-23 12:17:12,079 INFO L273 TraceCheckUtils]: 78: Hoare triple {8545#true} assume true; {8545#true} is VALID [2018-11-23 12:17:12,079 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {8545#true} {8546#false} #77#return; {8546#false} is VALID [2018-11-23 12:17:12,079 INFO L273 TraceCheckUtils]: 80: Hoare triple {8546#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {8546#false} is VALID [2018-11-23 12:17:12,079 INFO L273 TraceCheckUtils]: 81: Hoare triple {8546#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {8546#false} is VALID [2018-11-23 12:17:12,079 INFO L273 TraceCheckUtils]: 82: Hoare triple {8546#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {8546#false} is VALID [2018-11-23 12:17:12,079 INFO L273 TraceCheckUtils]: 83: Hoare triple {8546#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {8546#false} is VALID [2018-11-23 12:17:12,079 INFO L273 TraceCheckUtils]: 84: Hoare triple {8546#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {8546#false} is VALID [2018-11-23 12:17:12,080 INFO L273 TraceCheckUtils]: 85: Hoare triple {8546#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {8546#false} is VALID [2018-11-23 12:17:12,080 INFO L273 TraceCheckUtils]: 86: Hoare triple {8546#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {8546#false} is VALID [2018-11-23 12:17:12,080 INFO L273 TraceCheckUtils]: 87: Hoare triple {8546#false} assume !(~i~2 < 59); {8546#false} is VALID [2018-11-23 12:17:12,080 INFO L273 TraceCheckUtils]: 88: Hoare triple {8546#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {8546#false} is VALID [2018-11-23 12:17:12,080 INFO L256 TraceCheckUtils]: 89: Hoare triple {8546#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {8545#true} is VALID [2018-11-23 12:17:12,080 INFO L273 TraceCheckUtils]: 90: Hoare triple {8545#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {8545#true} is VALID [2018-11-23 12:17:12,081 INFO L273 TraceCheckUtils]: 91: Hoare triple {8545#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8545#true} is VALID [2018-11-23 12:17:12,081 INFO L273 TraceCheckUtils]: 92: Hoare triple {8545#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8545#true} is VALID [2018-11-23 12:17:12,081 INFO L273 TraceCheckUtils]: 93: Hoare triple {8545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8545#true} is VALID [2018-11-23 12:17:12,081 INFO L273 TraceCheckUtils]: 94: Hoare triple {8545#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8545#true} is VALID [2018-11-23 12:17:12,081 INFO L273 TraceCheckUtils]: 95: Hoare triple {8545#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8545#true} is VALID [2018-11-23 12:17:12,081 INFO L273 TraceCheckUtils]: 96: Hoare triple {8545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8545#true} is VALID [2018-11-23 12:17:12,082 INFO L273 TraceCheckUtils]: 97: Hoare triple {8545#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8545#true} is VALID [2018-11-23 12:17:12,082 INFO L273 TraceCheckUtils]: 98: Hoare triple {8545#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8545#true} is VALID [2018-11-23 12:17:12,082 INFO L273 TraceCheckUtils]: 99: Hoare triple {8545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8545#true} is VALID [2018-11-23 12:17:12,082 INFO L273 TraceCheckUtils]: 100: Hoare triple {8545#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8545#true} is VALID [2018-11-23 12:17:12,082 INFO L273 TraceCheckUtils]: 101: Hoare triple {8545#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8545#true} is VALID [2018-11-23 12:17:12,082 INFO L273 TraceCheckUtils]: 102: Hoare triple {8545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8545#true} is VALID [2018-11-23 12:17:12,082 INFO L273 TraceCheckUtils]: 103: Hoare triple {8545#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8545#true} is VALID [2018-11-23 12:17:12,082 INFO L273 TraceCheckUtils]: 104: Hoare triple {8545#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8545#true} is VALID [2018-11-23 12:17:12,083 INFO L273 TraceCheckUtils]: 105: Hoare triple {8545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8545#true} is VALID [2018-11-23 12:17:12,083 INFO L273 TraceCheckUtils]: 106: Hoare triple {8545#true} assume !(~i~0 < 60); {8545#true} is VALID [2018-11-23 12:17:12,083 INFO L273 TraceCheckUtils]: 107: Hoare triple {8545#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8545#true} is VALID [2018-11-23 12:17:12,083 INFO L273 TraceCheckUtils]: 108: Hoare triple {8545#true} assume true; {8545#true} is VALID [2018-11-23 12:17:12,083 INFO L268 TraceCheckUtils]: 109: Hoare quadruple {8545#true} {8546#false} #79#return; {8546#false} is VALID [2018-11-23 12:17:12,083 INFO L273 TraceCheckUtils]: 110: Hoare triple {8546#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {8546#false} is VALID [2018-11-23 12:17:12,083 INFO L273 TraceCheckUtils]: 111: Hoare triple {8546#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {8546#false} is VALID [2018-11-23 12:17:12,083 INFO L273 TraceCheckUtils]: 112: Hoare triple {8546#false} assume !false; {8546#false} is VALID [2018-11-23 12:17:12,089 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2018-11-23 12:17:12,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:12,089 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:17:12,098 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:17:12,143 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 12:17:12,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:12,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:12,302 INFO L256 TraceCheckUtils]: 0: Hoare triple {8545#true} call ULTIMATE.init(); {8545#true} is VALID [2018-11-23 12:17:12,302 INFO L273 TraceCheckUtils]: 1: Hoare triple {8545#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8545#true} is VALID [2018-11-23 12:17:12,302 INFO L273 TraceCheckUtils]: 2: Hoare triple {8545#true} assume true; {8545#true} is VALID [2018-11-23 12:17:12,303 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8545#true} {8545#true} #71#return; {8545#true} is VALID [2018-11-23 12:17:12,303 INFO L256 TraceCheckUtils]: 4: Hoare triple {8545#true} call #t~ret14 := main(); {8545#true} is VALID [2018-11-23 12:17:12,303 INFO L273 TraceCheckUtils]: 5: Hoare triple {8545#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {8545#true} is VALID [2018-11-23 12:17:12,303 INFO L273 TraceCheckUtils]: 6: Hoare triple {8545#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8545#true} is VALID [2018-11-23 12:17:12,303 INFO L273 TraceCheckUtils]: 7: Hoare triple {8545#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8545#true} is VALID [2018-11-23 12:17:12,304 INFO L273 TraceCheckUtils]: 8: Hoare triple {8545#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8545#true} is VALID [2018-11-23 12:17:12,304 INFO L273 TraceCheckUtils]: 9: Hoare triple {8545#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8545#true} is VALID [2018-11-23 12:17:12,304 INFO L273 TraceCheckUtils]: 10: Hoare triple {8545#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8545#true} is VALID [2018-11-23 12:17:12,304 INFO L273 TraceCheckUtils]: 11: Hoare triple {8545#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8545#true} is VALID [2018-11-23 12:17:12,304 INFO L273 TraceCheckUtils]: 12: Hoare triple {8545#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8545#true} is VALID [2018-11-23 12:17:12,304 INFO L273 TraceCheckUtils]: 13: Hoare triple {8545#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8545#true} is VALID [2018-11-23 12:17:12,304 INFO L273 TraceCheckUtils]: 14: Hoare triple {8545#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8545#true} is VALID [2018-11-23 12:17:12,304 INFO L273 TraceCheckUtils]: 15: Hoare triple {8545#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8545#true} is VALID [2018-11-23 12:17:12,305 INFO L273 TraceCheckUtils]: 16: Hoare triple {8545#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8545#true} is VALID [2018-11-23 12:17:12,305 INFO L273 TraceCheckUtils]: 17: Hoare triple {8545#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8545#true} is VALID [2018-11-23 12:17:12,305 INFO L273 TraceCheckUtils]: 18: Hoare triple {8545#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8545#true} is VALID [2018-11-23 12:17:12,305 INFO L273 TraceCheckUtils]: 19: Hoare triple {8545#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8545#true} is VALID [2018-11-23 12:17:12,305 INFO L273 TraceCheckUtils]: 20: Hoare triple {8545#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8545#true} is VALID [2018-11-23 12:17:12,305 INFO L273 TraceCheckUtils]: 21: Hoare triple {8545#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8545#true} is VALID [2018-11-23 12:17:12,305 INFO L273 TraceCheckUtils]: 22: Hoare triple {8545#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8545#true} is VALID [2018-11-23 12:17:12,305 INFO L273 TraceCheckUtils]: 23: Hoare triple {8545#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8545#true} is VALID [2018-11-23 12:17:12,305 INFO L273 TraceCheckUtils]: 24: Hoare triple {8545#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8545#true} is VALID [2018-11-23 12:17:12,306 INFO L273 TraceCheckUtils]: 25: Hoare triple {8545#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8545#true} is VALID [2018-11-23 12:17:12,306 INFO L273 TraceCheckUtils]: 26: Hoare triple {8545#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8545#true} is VALID [2018-11-23 12:17:12,306 INFO L273 TraceCheckUtils]: 27: Hoare triple {8545#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8545#true} is VALID [2018-11-23 12:17:12,306 INFO L273 TraceCheckUtils]: 28: Hoare triple {8545#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8545#true} is VALID [2018-11-23 12:17:12,306 INFO L273 TraceCheckUtils]: 29: Hoare triple {8545#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8545#true} is VALID [2018-11-23 12:17:12,306 INFO L273 TraceCheckUtils]: 30: Hoare triple {8545#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8545#true} is VALID [2018-11-23 12:17:12,306 INFO L273 TraceCheckUtils]: 31: Hoare triple {8545#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8545#true} is VALID [2018-11-23 12:17:12,306 INFO L273 TraceCheckUtils]: 32: Hoare triple {8545#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8545#true} is VALID [2018-11-23 12:17:12,307 INFO L273 TraceCheckUtils]: 33: Hoare triple {8545#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8545#true} is VALID [2018-11-23 12:17:12,307 INFO L273 TraceCheckUtils]: 34: Hoare triple {8545#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8545#true} is VALID [2018-11-23 12:17:12,307 INFO L273 TraceCheckUtils]: 35: Hoare triple {8545#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8545#true} is VALID [2018-11-23 12:17:12,307 INFO L273 TraceCheckUtils]: 36: Hoare triple {8545#true} assume !(~i~1 < 60); {8545#true} is VALID [2018-11-23 12:17:12,307 INFO L256 TraceCheckUtils]: 37: Hoare triple {8545#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {8545#true} is VALID [2018-11-23 12:17:12,307 INFO L273 TraceCheckUtils]: 38: Hoare triple {8545#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {8545#true} is VALID [2018-11-23 12:17:12,307 INFO L273 TraceCheckUtils]: 39: Hoare triple {8545#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8545#true} is VALID [2018-11-23 12:17:12,307 INFO L273 TraceCheckUtils]: 40: Hoare triple {8545#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8545#true} is VALID [2018-11-23 12:17:12,307 INFO L273 TraceCheckUtils]: 41: Hoare triple {8545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8545#true} is VALID [2018-11-23 12:17:12,308 INFO L273 TraceCheckUtils]: 42: Hoare triple {8545#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8545#true} is VALID [2018-11-23 12:17:12,308 INFO L273 TraceCheckUtils]: 43: Hoare triple {8545#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8545#true} is VALID [2018-11-23 12:17:12,308 INFO L273 TraceCheckUtils]: 44: Hoare triple {8545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8545#true} is VALID [2018-11-23 12:17:12,308 INFO L273 TraceCheckUtils]: 45: Hoare triple {8545#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8545#true} is VALID [2018-11-23 12:17:12,308 INFO L273 TraceCheckUtils]: 46: Hoare triple {8545#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8545#true} is VALID [2018-11-23 12:17:12,308 INFO L273 TraceCheckUtils]: 47: Hoare triple {8545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8545#true} is VALID [2018-11-23 12:17:12,308 INFO L273 TraceCheckUtils]: 48: Hoare triple {8545#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8545#true} is VALID [2018-11-23 12:17:12,308 INFO L273 TraceCheckUtils]: 49: Hoare triple {8545#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8545#true} is VALID [2018-11-23 12:17:12,308 INFO L273 TraceCheckUtils]: 50: Hoare triple {8545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8545#true} is VALID [2018-11-23 12:17:12,309 INFO L273 TraceCheckUtils]: 51: Hoare triple {8545#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8545#true} is VALID [2018-11-23 12:17:12,309 INFO L273 TraceCheckUtils]: 52: Hoare triple {8545#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8545#true} is VALID [2018-11-23 12:17:12,309 INFO L273 TraceCheckUtils]: 53: Hoare triple {8545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8545#true} is VALID [2018-11-23 12:17:12,309 INFO L273 TraceCheckUtils]: 54: Hoare triple {8545#true} assume !(~i~0 < 60); {8545#true} is VALID [2018-11-23 12:17:12,309 INFO L273 TraceCheckUtils]: 55: Hoare triple {8545#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8545#true} is VALID [2018-11-23 12:17:12,309 INFO L273 TraceCheckUtils]: 56: Hoare triple {8545#true} assume true; {8545#true} is VALID [2018-11-23 12:17:12,309 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {8545#true} {8545#true} #75#return; {8545#true} is VALID [2018-11-23 12:17:12,309 INFO L273 TraceCheckUtils]: 58: Hoare triple {8545#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {8545#true} is VALID [2018-11-23 12:17:12,310 INFO L256 TraceCheckUtils]: 59: Hoare triple {8545#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {8545#true} is VALID [2018-11-23 12:17:12,310 INFO L273 TraceCheckUtils]: 60: Hoare triple {8545#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {8545#true} is VALID [2018-11-23 12:17:12,310 INFO L273 TraceCheckUtils]: 61: Hoare triple {8545#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8545#true} is VALID [2018-11-23 12:17:12,310 INFO L273 TraceCheckUtils]: 62: Hoare triple {8545#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8545#true} is VALID [2018-11-23 12:17:12,310 INFO L273 TraceCheckUtils]: 63: Hoare triple {8545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8545#true} is VALID [2018-11-23 12:17:12,310 INFO L273 TraceCheckUtils]: 64: Hoare triple {8545#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8545#true} is VALID [2018-11-23 12:17:12,310 INFO L273 TraceCheckUtils]: 65: Hoare triple {8545#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8545#true} is VALID [2018-11-23 12:17:12,310 INFO L273 TraceCheckUtils]: 66: Hoare triple {8545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8545#true} is VALID [2018-11-23 12:17:12,310 INFO L273 TraceCheckUtils]: 67: Hoare triple {8545#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8545#true} is VALID [2018-11-23 12:17:12,311 INFO L273 TraceCheckUtils]: 68: Hoare triple {8545#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8545#true} is VALID [2018-11-23 12:17:12,311 INFO L273 TraceCheckUtils]: 69: Hoare triple {8545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8545#true} is VALID [2018-11-23 12:17:12,311 INFO L273 TraceCheckUtils]: 70: Hoare triple {8545#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8545#true} is VALID [2018-11-23 12:17:12,311 INFO L273 TraceCheckUtils]: 71: Hoare triple {8545#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8545#true} is VALID [2018-11-23 12:17:12,311 INFO L273 TraceCheckUtils]: 72: Hoare triple {8545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8545#true} is VALID [2018-11-23 12:17:12,311 INFO L273 TraceCheckUtils]: 73: Hoare triple {8545#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8545#true} is VALID [2018-11-23 12:17:12,311 INFO L273 TraceCheckUtils]: 74: Hoare triple {8545#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8545#true} is VALID [2018-11-23 12:17:12,311 INFO L273 TraceCheckUtils]: 75: Hoare triple {8545#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8545#true} is VALID [2018-11-23 12:17:12,311 INFO L273 TraceCheckUtils]: 76: Hoare triple {8545#true} assume !(~i~0 < 60); {8545#true} is VALID [2018-11-23 12:17:12,312 INFO L273 TraceCheckUtils]: 77: Hoare triple {8545#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8545#true} is VALID [2018-11-23 12:17:12,312 INFO L273 TraceCheckUtils]: 78: Hoare triple {8545#true} assume true; {8545#true} is VALID [2018-11-23 12:17:12,312 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {8545#true} {8545#true} #77#return; {8545#true} is VALID [2018-11-23 12:17:12,313 INFO L273 TraceCheckUtils]: 80: Hoare triple {8545#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {8806#(<= main_~i~2 0)} is VALID [2018-11-23 12:17:12,313 INFO L273 TraceCheckUtils]: 81: Hoare triple {8806#(<= main_~i~2 0)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {8806#(<= main_~i~2 0)} is VALID [2018-11-23 12:17:12,315 INFO L273 TraceCheckUtils]: 82: Hoare triple {8806#(<= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {8813#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:12,315 INFO L273 TraceCheckUtils]: 83: Hoare triple {8813#(<= main_~i~2 1)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {8813#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:12,315 INFO L273 TraceCheckUtils]: 84: Hoare triple {8813#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {8820#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:12,316 INFO L273 TraceCheckUtils]: 85: Hoare triple {8820#(<= main_~i~2 2)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {8820#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:12,317 INFO L273 TraceCheckUtils]: 86: Hoare triple {8820#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {8827#(<= main_~i~2 3)} is VALID [2018-11-23 12:17:12,317 INFO L273 TraceCheckUtils]: 87: Hoare triple {8827#(<= main_~i~2 3)} assume !(~i~2 < 59); {8546#false} is VALID [2018-11-23 12:17:12,317 INFO L273 TraceCheckUtils]: 88: Hoare triple {8546#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {8546#false} is VALID [2018-11-23 12:17:12,317 INFO L256 TraceCheckUtils]: 89: Hoare triple {8546#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {8546#false} is VALID [2018-11-23 12:17:12,317 INFO L273 TraceCheckUtils]: 90: Hoare triple {8546#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {8546#false} is VALID [2018-11-23 12:17:12,318 INFO L273 TraceCheckUtils]: 91: Hoare triple {8546#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8546#false} is VALID [2018-11-23 12:17:12,318 INFO L273 TraceCheckUtils]: 92: Hoare triple {8546#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8546#false} is VALID [2018-11-23 12:17:12,318 INFO L273 TraceCheckUtils]: 93: Hoare triple {8546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8546#false} is VALID [2018-11-23 12:17:12,318 INFO L273 TraceCheckUtils]: 94: Hoare triple {8546#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8546#false} is VALID [2018-11-23 12:17:12,318 INFO L273 TraceCheckUtils]: 95: Hoare triple {8546#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8546#false} is VALID [2018-11-23 12:17:12,318 INFO L273 TraceCheckUtils]: 96: Hoare triple {8546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8546#false} is VALID [2018-11-23 12:17:12,318 INFO L273 TraceCheckUtils]: 97: Hoare triple {8546#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8546#false} is VALID [2018-11-23 12:17:12,318 INFO L273 TraceCheckUtils]: 98: Hoare triple {8546#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8546#false} is VALID [2018-11-23 12:17:12,318 INFO L273 TraceCheckUtils]: 99: Hoare triple {8546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8546#false} is VALID [2018-11-23 12:17:12,319 INFO L273 TraceCheckUtils]: 100: Hoare triple {8546#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8546#false} is VALID [2018-11-23 12:17:12,319 INFO L273 TraceCheckUtils]: 101: Hoare triple {8546#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8546#false} is VALID [2018-11-23 12:17:12,319 INFO L273 TraceCheckUtils]: 102: Hoare triple {8546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8546#false} is VALID [2018-11-23 12:17:12,319 INFO L273 TraceCheckUtils]: 103: Hoare triple {8546#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8546#false} is VALID [2018-11-23 12:17:12,319 INFO L273 TraceCheckUtils]: 104: Hoare triple {8546#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8546#false} is VALID [2018-11-23 12:17:12,319 INFO L273 TraceCheckUtils]: 105: Hoare triple {8546#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8546#false} is VALID [2018-11-23 12:17:12,319 INFO L273 TraceCheckUtils]: 106: Hoare triple {8546#false} assume !(~i~0 < 60); {8546#false} is VALID [2018-11-23 12:17:12,319 INFO L273 TraceCheckUtils]: 107: Hoare triple {8546#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8546#false} is VALID [2018-11-23 12:17:12,320 INFO L273 TraceCheckUtils]: 108: Hoare triple {8546#false} assume true; {8546#false} is VALID [2018-11-23 12:17:12,320 INFO L268 TraceCheckUtils]: 109: Hoare quadruple {8546#false} {8546#false} #79#return; {8546#false} is VALID [2018-11-23 12:17:12,320 INFO L273 TraceCheckUtils]: 110: Hoare triple {8546#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {8546#false} is VALID [2018-11-23 12:17:12,320 INFO L273 TraceCheckUtils]: 111: Hoare triple {8546#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {8546#false} is VALID [2018-11-23 12:17:12,320 INFO L273 TraceCheckUtils]: 112: Hoare triple {8546#false} assume !false; {8546#false} is VALID [2018-11-23 12:17:12,325 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 180 proven. 9 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-23 12:17:12,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:12,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6] total 22 [2018-11-23 12:17:12,345 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 113 [2018-11-23 12:17:12,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:12,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 12:17:12,433 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-23 12:17:12,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:17:12,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:17:12,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:17:12,435 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand 22 states. [2018-11-23 12:17:13,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:13,147 INFO L93 Difference]: Finished difference Result 117 states and 136 transitions. [2018-11-23 12:17:13,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:17:13,147 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 113 [2018-11-23 12:17:13,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:13,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:17:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 97 transitions. [2018-11-23 12:17:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:17:13,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 97 transitions. [2018-11-23 12:17:13,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 97 transitions. [2018-11-23 12:17:13,369 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-23 12:17:13,371 INFO L225 Difference]: With dead ends: 117 [2018-11-23 12:17:13,371 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 12:17:13,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:17:13,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 12:17:13,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-11-23 12:17:13,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:13,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 78 states. [2018-11-23 12:17:13,508 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 78 states. [2018-11-23 12:17:13,508 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 78 states. [2018-11-23 12:17:13,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:13,510 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2018-11-23 12:17:13,510 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2018-11-23 12:17:13,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:13,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:13,511 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 80 states. [2018-11-23 12:17:13,511 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 80 states. [2018-11-23 12:17:13,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:13,513 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2018-11-23 12:17:13,513 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2018-11-23 12:17:13,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:13,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:13,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:13,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:13,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 12:17:13,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2018-11-23 12:17:13,516 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 113 [2018-11-23 12:17:13,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:13,516 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2018-11-23 12:17:13,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:17:13,516 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-11-23 12:17:13,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-23 12:17:13,517 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:13,517 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:17:13,518 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:13,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:13,518 INFO L82 PathProgramCache]: Analyzing trace with hash -901827641, now seen corresponding path program 16 times [2018-11-23 12:17:13,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:13,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:13,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:13,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:13,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:13,930 INFO L256 TraceCheckUtils]: 0: Hoare triple {9346#true} call ULTIMATE.init(); {9346#true} is VALID [2018-11-23 12:17:13,930 INFO L273 TraceCheckUtils]: 1: Hoare triple {9346#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9346#true} is VALID [2018-11-23 12:17:13,931 INFO L273 TraceCheckUtils]: 2: Hoare triple {9346#true} assume true; {9346#true} is VALID [2018-11-23 12:17:13,931 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9346#true} {9346#true} #71#return; {9346#true} is VALID [2018-11-23 12:17:13,931 INFO L256 TraceCheckUtils]: 4: Hoare triple {9346#true} call #t~ret14 := main(); {9346#true} is VALID [2018-11-23 12:17:13,932 INFO L273 TraceCheckUtils]: 5: Hoare triple {9346#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9348#(= main_~i~1 0)} is VALID [2018-11-23 12:17:13,932 INFO L273 TraceCheckUtils]: 6: Hoare triple {9348#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9348#(= main_~i~1 0)} is VALID [2018-11-23 12:17:13,933 INFO L273 TraceCheckUtils]: 7: Hoare triple {9348#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9349#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:13,933 INFO L273 TraceCheckUtils]: 8: Hoare triple {9349#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9349#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:13,934 INFO L273 TraceCheckUtils]: 9: Hoare triple {9349#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9350#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:13,934 INFO L273 TraceCheckUtils]: 10: Hoare triple {9350#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9350#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:13,934 INFO L273 TraceCheckUtils]: 11: Hoare triple {9350#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9351#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:13,935 INFO L273 TraceCheckUtils]: 12: Hoare triple {9351#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9351#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:13,936 INFO L273 TraceCheckUtils]: 13: Hoare triple {9351#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9352#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:13,936 INFO L273 TraceCheckUtils]: 14: Hoare triple {9352#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9352#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:13,937 INFO L273 TraceCheckUtils]: 15: Hoare triple {9352#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9353#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:13,937 INFO L273 TraceCheckUtils]: 16: Hoare triple {9353#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9353#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:13,938 INFO L273 TraceCheckUtils]: 17: Hoare triple {9353#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9354#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:13,939 INFO L273 TraceCheckUtils]: 18: Hoare triple {9354#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9354#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:13,939 INFO L273 TraceCheckUtils]: 19: Hoare triple {9354#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9355#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:13,940 INFO L273 TraceCheckUtils]: 20: Hoare triple {9355#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9355#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:13,941 INFO L273 TraceCheckUtils]: 21: Hoare triple {9355#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9356#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:13,941 INFO L273 TraceCheckUtils]: 22: Hoare triple {9356#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9356#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:13,942 INFO L273 TraceCheckUtils]: 23: Hoare triple {9356#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9357#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:13,943 INFO L273 TraceCheckUtils]: 24: Hoare triple {9357#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9357#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:13,943 INFO L273 TraceCheckUtils]: 25: Hoare triple {9357#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9358#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:13,944 INFO L273 TraceCheckUtils]: 26: Hoare triple {9358#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9358#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:13,945 INFO L273 TraceCheckUtils]: 27: Hoare triple {9358#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9359#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:13,945 INFO L273 TraceCheckUtils]: 28: Hoare triple {9359#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9359#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:13,946 INFO L273 TraceCheckUtils]: 29: Hoare triple {9359#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9360#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:13,946 INFO L273 TraceCheckUtils]: 30: Hoare triple {9360#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9360#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:13,947 INFO L273 TraceCheckUtils]: 31: Hoare triple {9360#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9361#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:13,948 INFO L273 TraceCheckUtils]: 32: Hoare triple {9361#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9361#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:13,949 INFO L273 TraceCheckUtils]: 33: Hoare triple {9361#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9362#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:13,949 INFO L273 TraceCheckUtils]: 34: Hoare triple {9362#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9362#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:13,950 INFO L273 TraceCheckUtils]: 35: Hoare triple {9362#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9363#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:13,950 INFO L273 TraceCheckUtils]: 36: Hoare triple {9363#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9363#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:13,951 INFO L273 TraceCheckUtils]: 37: Hoare triple {9363#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9364#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:13,952 INFO L273 TraceCheckUtils]: 38: Hoare triple {9364#(<= main_~i~1 16)} assume !(~i~1 < 60); {9347#false} is VALID [2018-11-23 12:17:13,952 INFO L256 TraceCheckUtils]: 39: Hoare triple {9347#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {9346#true} is VALID [2018-11-23 12:17:13,952 INFO L273 TraceCheckUtils]: 40: Hoare triple {9346#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {9346#true} is VALID [2018-11-23 12:17:13,952 INFO L273 TraceCheckUtils]: 41: Hoare triple {9346#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9346#true} is VALID [2018-11-23 12:17:13,953 INFO L273 TraceCheckUtils]: 42: Hoare triple {9346#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9346#true} is VALID [2018-11-23 12:17:13,953 INFO L273 TraceCheckUtils]: 43: Hoare triple {9346#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9346#true} is VALID [2018-11-23 12:17:13,953 INFO L273 TraceCheckUtils]: 44: Hoare triple {9346#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9346#true} is VALID [2018-11-23 12:17:13,953 INFO L273 TraceCheckUtils]: 45: Hoare triple {9346#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9346#true} is VALID [2018-11-23 12:17:13,953 INFO L273 TraceCheckUtils]: 46: Hoare triple {9346#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9346#true} is VALID [2018-11-23 12:17:13,954 INFO L273 TraceCheckUtils]: 47: Hoare triple {9346#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9346#true} is VALID [2018-11-23 12:17:13,954 INFO L273 TraceCheckUtils]: 48: Hoare triple {9346#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9346#true} is VALID [2018-11-23 12:17:13,954 INFO L273 TraceCheckUtils]: 49: Hoare triple {9346#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9346#true} is VALID [2018-11-23 12:17:13,954 INFO L273 TraceCheckUtils]: 50: Hoare triple {9346#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9346#true} is VALID [2018-11-23 12:17:13,954 INFO L273 TraceCheckUtils]: 51: Hoare triple {9346#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9346#true} is VALID [2018-11-23 12:17:13,955 INFO L273 TraceCheckUtils]: 52: Hoare triple {9346#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9346#true} is VALID [2018-11-23 12:17:13,955 INFO L273 TraceCheckUtils]: 53: Hoare triple {9346#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9346#true} is VALID [2018-11-23 12:17:13,955 INFO L273 TraceCheckUtils]: 54: Hoare triple {9346#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9346#true} is VALID [2018-11-23 12:17:13,955 INFO L273 TraceCheckUtils]: 55: Hoare triple {9346#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9346#true} is VALID [2018-11-23 12:17:13,955 INFO L273 TraceCheckUtils]: 56: Hoare triple {9346#true} assume !(~i~0 < 60); {9346#true} is VALID [2018-11-23 12:17:13,955 INFO L273 TraceCheckUtils]: 57: Hoare triple {9346#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9346#true} is VALID [2018-11-23 12:17:13,955 INFO L273 TraceCheckUtils]: 58: Hoare triple {9346#true} assume true; {9346#true} is VALID [2018-11-23 12:17:13,955 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {9346#true} {9347#false} #75#return; {9347#false} is VALID [2018-11-23 12:17:13,956 INFO L273 TraceCheckUtils]: 60: Hoare triple {9347#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {9347#false} is VALID [2018-11-23 12:17:13,956 INFO L256 TraceCheckUtils]: 61: Hoare triple {9347#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {9346#true} is VALID [2018-11-23 12:17:13,956 INFO L273 TraceCheckUtils]: 62: Hoare triple {9346#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {9346#true} is VALID [2018-11-23 12:17:13,956 INFO L273 TraceCheckUtils]: 63: Hoare triple {9346#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9346#true} is VALID [2018-11-23 12:17:13,956 INFO L273 TraceCheckUtils]: 64: Hoare triple {9346#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9346#true} is VALID [2018-11-23 12:17:13,956 INFO L273 TraceCheckUtils]: 65: Hoare triple {9346#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9346#true} is VALID [2018-11-23 12:17:13,957 INFO L273 TraceCheckUtils]: 66: Hoare triple {9346#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9346#true} is VALID [2018-11-23 12:17:13,957 INFO L273 TraceCheckUtils]: 67: Hoare triple {9346#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9346#true} is VALID [2018-11-23 12:17:13,957 INFO L273 TraceCheckUtils]: 68: Hoare triple {9346#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9346#true} is VALID [2018-11-23 12:17:13,957 INFO L273 TraceCheckUtils]: 69: Hoare triple {9346#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9346#true} is VALID [2018-11-23 12:17:13,957 INFO L273 TraceCheckUtils]: 70: Hoare triple {9346#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9346#true} is VALID [2018-11-23 12:17:13,958 INFO L273 TraceCheckUtils]: 71: Hoare triple {9346#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9346#true} is VALID [2018-11-23 12:17:13,958 INFO L273 TraceCheckUtils]: 72: Hoare triple {9346#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9346#true} is VALID [2018-11-23 12:17:13,958 INFO L273 TraceCheckUtils]: 73: Hoare triple {9346#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9346#true} is VALID [2018-11-23 12:17:13,958 INFO L273 TraceCheckUtils]: 74: Hoare triple {9346#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9346#true} is VALID [2018-11-23 12:17:13,958 INFO L273 TraceCheckUtils]: 75: Hoare triple {9346#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9346#true} is VALID [2018-11-23 12:17:13,958 INFO L273 TraceCheckUtils]: 76: Hoare triple {9346#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9346#true} is VALID [2018-11-23 12:17:13,959 INFO L273 TraceCheckUtils]: 77: Hoare triple {9346#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9346#true} is VALID [2018-11-23 12:17:13,959 INFO L273 TraceCheckUtils]: 78: Hoare triple {9346#true} assume !(~i~0 < 60); {9346#true} is VALID [2018-11-23 12:17:13,959 INFO L273 TraceCheckUtils]: 79: Hoare triple {9346#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9346#true} is VALID [2018-11-23 12:17:13,959 INFO L273 TraceCheckUtils]: 80: Hoare triple {9346#true} assume true; {9346#true} is VALID [2018-11-23 12:17:13,959 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {9346#true} {9347#false} #77#return; {9347#false} is VALID [2018-11-23 12:17:13,959 INFO L273 TraceCheckUtils]: 82: Hoare triple {9347#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {9347#false} is VALID [2018-11-23 12:17:13,960 INFO L273 TraceCheckUtils]: 83: Hoare triple {9347#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9347#false} is VALID [2018-11-23 12:17:13,960 INFO L273 TraceCheckUtils]: 84: Hoare triple {9347#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9347#false} is VALID [2018-11-23 12:17:13,960 INFO L273 TraceCheckUtils]: 85: Hoare triple {9347#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9347#false} is VALID [2018-11-23 12:17:13,960 INFO L273 TraceCheckUtils]: 86: Hoare triple {9347#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9347#false} is VALID [2018-11-23 12:17:13,960 INFO L273 TraceCheckUtils]: 87: Hoare triple {9347#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9347#false} is VALID [2018-11-23 12:17:13,960 INFO L273 TraceCheckUtils]: 88: Hoare triple {9347#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9347#false} is VALID [2018-11-23 12:17:13,961 INFO L273 TraceCheckUtils]: 89: Hoare triple {9347#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9347#false} is VALID [2018-11-23 12:17:13,961 INFO L273 TraceCheckUtils]: 90: Hoare triple {9347#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9347#false} is VALID [2018-11-23 12:17:13,961 INFO L273 TraceCheckUtils]: 91: Hoare triple {9347#false} assume !(~i~2 < 59); {9347#false} is VALID [2018-11-23 12:17:13,961 INFO L273 TraceCheckUtils]: 92: Hoare triple {9347#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {9347#false} is VALID [2018-11-23 12:17:13,961 INFO L256 TraceCheckUtils]: 93: Hoare triple {9347#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {9346#true} is VALID [2018-11-23 12:17:13,961 INFO L273 TraceCheckUtils]: 94: Hoare triple {9346#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {9346#true} is VALID [2018-11-23 12:17:13,962 INFO L273 TraceCheckUtils]: 95: Hoare triple {9346#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9346#true} is VALID [2018-11-23 12:17:13,962 INFO L273 TraceCheckUtils]: 96: Hoare triple {9346#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9346#true} is VALID [2018-11-23 12:17:13,962 INFO L273 TraceCheckUtils]: 97: Hoare triple {9346#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9346#true} is VALID [2018-11-23 12:17:13,962 INFO L273 TraceCheckUtils]: 98: Hoare triple {9346#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9346#true} is VALID [2018-11-23 12:17:13,962 INFO L273 TraceCheckUtils]: 99: Hoare triple {9346#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9346#true} is VALID [2018-11-23 12:17:13,962 INFO L273 TraceCheckUtils]: 100: Hoare triple {9346#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9346#true} is VALID [2018-11-23 12:17:13,963 INFO L273 TraceCheckUtils]: 101: Hoare triple {9346#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9346#true} is VALID [2018-11-23 12:17:13,963 INFO L273 TraceCheckUtils]: 102: Hoare triple {9346#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9346#true} is VALID [2018-11-23 12:17:13,963 INFO L273 TraceCheckUtils]: 103: Hoare triple {9346#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9346#true} is VALID [2018-11-23 12:17:13,963 INFO L273 TraceCheckUtils]: 104: Hoare triple {9346#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9346#true} is VALID [2018-11-23 12:17:13,963 INFO L273 TraceCheckUtils]: 105: Hoare triple {9346#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9346#true} is VALID [2018-11-23 12:17:13,963 INFO L273 TraceCheckUtils]: 106: Hoare triple {9346#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9346#true} is VALID [2018-11-23 12:17:13,964 INFO L273 TraceCheckUtils]: 107: Hoare triple {9346#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9346#true} is VALID [2018-11-23 12:17:13,964 INFO L273 TraceCheckUtils]: 108: Hoare triple {9346#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9346#true} is VALID [2018-11-23 12:17:13,964 INFO L273 TraceCheckUtils]: 109: Hoare triple {9346#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9346#true} is VALID [2018-11-23 12:17:13,964 INFO L273 TraceCheckUtils]: 110: Hoare triple {9346#true} assume !(~i~0 < 60); {9346#true} is VALID [2018-11-23 12:17:13,964 INFO L273 TraceCheckUtils]: 111: Hoare triple {9346#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9346#true} is VALID [2018-11-23 12:17:13,964 INFO L273 TraceCheckUtils]: 112: Hoare triple {9346#true} assume true; {9346#true} is VALID [2018-11-23 12:17:13,965 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {9346#true} {9347#false} #79#return; {9347#false} is VALID [2018-11-23 12:17:13,965 INFO L273 TraceCheckUtils]: 114: Hoare triple {9347#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {9347#false} is VALID [2018-11-23 12:17:13,965 INFO L273 TraceCheckUtils]: 115: Hoare triple {9347#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {9347#false} is VALID [2018-11-23 12:17:13,965 INFO L273 TraceCheckUtils]: 116: Hoare triple {9347#false} assume !false; {9347#false} is VALID [2018-11-23 12:17:13,973 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2018-11-23 12:17:13,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:13,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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:17:13,991 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:17:14,061 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:17:14,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:14,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:14,372 INFO L256 TraceCheckUtils]: 0: Hoare triple {9346#true} call ULTIMATE.init(); {9346#true} is VALID [2018-11-23 12:17:14,372 INFO L273 TraceCheckUtils]: 1: Hoare triple {9346#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9346#true} is VALID [2018-11-23 12:17:14,373 INFO L273 TraceCheckUtils]: 2: Hoare triple {9346#true} assume true; {9346#true} is VALID [2018-11-23 12:17:14,373 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9346#true} {9346#true} #71#return; {9346#true} is VALID [2018-11-23 12:17:14,373 INFO L256 TraceCheckUtils]: 4: Hoare triple {9346#true} call #t~ret14 := main(); {9346#true} is VALID [2018-11-23 12:17:14,374 INFO L273 TraceCheckUtils]: 5: Hoare triple {9346#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9383#(<= main_~i~1 0)} is VALID [2018-11-23 12:17:14,374 INFO L273 TraceCheckUtils]: 6: Hoare triple {9383#(<= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9383#(<= main_~i~1 0)} is VALID [2018-11-23 12:17:14,375 INFO L273 TraceCheckUtils]: 7: Hoare triple {9383#(<= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9349#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:14,375 INFO L273 TraceCheckUtils]: 8: Hoare triple {9349#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9349#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:14,376 INFO L273 TraceCheckUtils]: 9: Hoare triple {9349#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9350#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:14,376 INFO L273 TraceCheckUtils]: 10: Hoare triple {9350#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9350#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:14,377 INFO L273 TraceCheckUtils]: 11: Hoare triple {9350#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9351#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:14,377 INFO L273 TraceCheckUtils]: 12: Hoare triple {9351#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9351#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:14,377 INFO L273 TraceCheckUtils]: 13: Hoare triple {9351#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9352#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:14,378 INFO L273 TraceCheckUtils]: 14: Hoare triple {9352#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9352#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:14,379 INFO L273 TraceCheckUtils]: 15: Hoare triple {9352#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9353#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:14,379 INFO L273 TraceCheckUtils]: 16: Hoare triple {9353#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9353#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:14,380 INFO L273 TraceCheckUtils]: 17: Hoare triple {9353#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9354#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:14,380 INFO L273 TraceCheckUtils]: 18: Hoare triple {9354#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9354#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:14,381 INFO L273 TraceCheckUtils]: 19: Hoare triple {9354#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9355#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:14,382 INFO L273 TraceCheckUtils]: 20: Hoare triple {9355#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9355#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:14,382 INFO L273 TraceCheckUtils]: 21: Hoare triple {9355#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9356#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:14,383 INFO L273 TraceCheckUtils]: 22: Hoare triple {9356#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9356#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:14,384 INFO L273 TraceCheckUtils]: 23: Hoare triple {9356#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9357#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:14,384 INFO L273 TraceCheckUtils]: 24: Hoare triple {9357#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9357#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:14,385 INFO L273 TraceCheckUtils]: 25: Hoare triple {9357#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9358#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:14,385 INFO L273 TraceCheckUtils]: 26: Hoare triple {9358#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9358#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:14,386 INFO L273 TraceCheckUtils]: 27: Hoare triple {9358#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9359#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:14,387 INFO L273 TraceCheckUtils]: 28: Hoare triple {9359#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9359#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:14,388 INFO L273 TraceCheckUtils]: 29: Hoare triple {9359#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9360#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:14,388 INFO L273 TraceCheckUtils]: 30: Hoare triple {9360#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9360#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:14,389 INFO L273 TraceCheckUtils]: 31: Hoare triple {9360#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9361#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:14,389 INFO L273 TraceCheckUtils]: 32: Hoare triple {9361#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9361#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:14,390 INFO L273 TraceCheckUtils]: 33: Hoare triple {9361#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9362#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:14,391 INFO L273 TraceCheckUtils]: 34: Hoare triple {9362#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9362#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:14,391 INFO L273 TraceCheckUtils]: 35: Hoare triple {9362#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9363#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:14,392 INFO L273 TraceCheckUtils]: 36: Hoare triple {9363#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9363#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:14,393 INFO L273 TraceCheckUtils]: 37: Hoare triple {9363#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9364#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:14,393 INFO L273 TraceCheckUtils]: 38: Hoare triple {9364#(<= main_~i~1 16)} assume !(~i~1 < 60); {9347#false} is VALID [2018-11-23 12:17:14,394 INFO L256 TraceCheckUtils]: 39: Hoare triple {9347#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {9347#false} is VALID [2018-11-23 12:17:14,394 INFO L273 TraceCheckUtils]: 40: Hoare triple {9347#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {9347#false} is VALID [2018-11-23 12:17:14,394 INFO L273 TraceCheckUtils]: 41: Hoare triple {9347#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9347#false} is VALID [2018-11-23 12:17:14,394 INFO L273 TraceCheckUtils]: 42: Hoare triple {9347#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9347#false} is VALID [2018-11-23 12:17:14,394 INFO L273 TraceCheckUtils]: 43: Hoare triple {9347#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9347#false} is VALID [2018-11-23 12:17:14,395 INFO L273 TraceCheckUtils]: 44: Hoare triple {9347#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9347#false} is VALID [2018-11-23 12:17:14,395 INFO L273 TraceCheckUtils]: 45: Hoare triple {9347#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9347#false} is VALID [2018-11-23 12:17:14,395 INFO L273 TraceCheckUtils]: 46: Hoare triple {9347#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9347#false} is VALID [2018-11-23 12:17:14,395 INFO L273 TraceCheckUtils]: 47: Hoare triple {9347#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9347#false} is VALID [2018-11-23 12:17:14,395 INFO L273 TraceCheckUtils]: 48: Hoare triple {9347#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9347#false} is VALID [2018-11-23 12:17:14,396 INFO L273 TraceCheckUtils]: 49: Hoare triple {9347#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9347#false} is VALID [2018-11-23 12:17:14,396 INFO L273 TraceCheckUtils]: 50: Hoare triple {9347#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9347#false} is VALID [2018-11-23 12:17:14,396 INFO L273 TraceCheckUtils]: 51: Hoare triple {9347#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9347#false} is VALID [2018-11-23 12:17:14,396 INFO L273 TraceCheckUtils]: 52: Hoare triple {9347#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9347#false} is VALID [2018-11-23 12:17:14,396 INFO L273 TraceCheckUtils]: 53: Hoare triple {9347#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9347#false} is VALID [2018-11-23 12:17:14,397 INFO L273 TraceCheckUtils]: 54: Hoare triple {9347#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9347#false} is VALID [2018-11-23 12:17:14,397 INFO L273 TraceCheckUtils]: 55: Hoare triple {9347#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9347#false} is VALID [2018-11-23 12:17:14,397 INFO L273 TraceCheckUtils]: 56: Hoare triple {9347#false} assume !(~i~0 < 60); {9347#false} is VALID [2018-11-23 12:17:14,397 INFO L273 TraceCheckUtils]: 57: Hoare triple {9347#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9347#false} is VALID [2018-11-23 12:17:14,397 INFO L273 TraceCheckUtils]: 58: Hoare triple {9347#false} assume true; {9347#false} is VALID [2018-11-23 12:17:14,397 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {9347#false} {9347#false} #75#return; {9347#false} is VALID [2018-11-23 12:17:14,397 INFO L273 TraceCheckUtils]: 60: Hoare triple {9347#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {9347#false} is VALID [2018-11-23 12:17:14,397 INFO L256 TraceCheckUtils]: 61: Hoare triple {9347#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {9347#false} is VALID [2018-11-23 12:17:14,397 INFO L273 TraceCheckUtils]: 62: Hoare triple {9347#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {9347#false} is VALID [2018-11-23 12:17:14,398 INFO L273 TraceCheckUtils]: 63: Hoare triple {9347#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9347#false} is VALID [2018-11-23 12:17:14,398 INFO L273 TraceCheckUtils]: 64: Hoare triple {9347#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9347#false} is VALID [2018-11-23 12:17:14,398 INFO L273 TraceCheckUtils]: 65: Hoare triple {9347#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9347#false} is VALID [2018-11-23 12:17:14,398 INFO L273 TraceCheckUtils]: 66: Hoare triple {9347#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9347#false} is VALID [2018-11-23 12:17:14,398 INFO L273 TraceCheckUtils]: 67: Hoare triple {9347#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9347#false} is VALID [2018-11-23 12:17:14,398 INFO L273 TraceCheckUtils]: 68: Hoare triple {9347#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9347#false} is VALID [2018-11-23 12:17:14,398 INFO L273 TraceCheckUtils]: 69: Hoare triple {9347#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9347#false} is VALID [2018-11-23 12:17:14,398 INFO L273 TraceCheckUtils]: 70: Hoare triple {9347#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9347#false} is VALID [2018-11-23 12:17:14,398 INFO L273 TraceCheckUtils]: 71: Hoare triple {9347#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9347#false} is VALID [2018-11-23 12:17:14,399 INFO L273 TraceCheckUtils]: 72: Hoare triple {9347#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9347#false} is VALID [2018-11-23 12:17:14,399 INFO L273 TraceCheckUtils]: 73: Hoare triple {9347#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9347#false} is VALID [2018-11-23 12:17:14,399 INFO L273 TraceCheckUtils]: 74: Hoare triple {9347#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9347#false} is VALID [2018-11-23 12:17:14,399 INFO L273 TraceCheckUtils]: 75: Hoare triple {9347#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9347#false} is VALID [2018-11-23 12:17:14,399 INFO L273 TraceCheckUtils]: 76: Hoare triple {9347#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9347#false} is VALID [2018-11-23 12:17:14,399 INFO L273 TraceCheckUtils]: 77: Hoare triple {9347#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9347#false} is VALID [2018-11-23 12:17:14,400 INFO L273 TraceCheckUtils]: 78: Hoare triple {9347#false} assume !(~i~0 < 60); {9347#false} is VALID [2018-11-23 12:17:14,400 INFO L273 TraceCheckUtils]: 79: Hoare triple {9347#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9347#false} is VALID [2018-11-23 12:17:14,400 INFO L273 TraceCheckUtils]: 80: Hoare triple {9347#false} assume true; {9347#false} is VALID [2018-11-23 12:17:14,400 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {9347#false} {9347#false} #77#return; {9347#false} is VALID [2018-11-23 12:17:14,400 INFO L273 TraceCheckUtils]: 82: Hoare triple {9347#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {9347#false} is VALID [2018-11-23 12:17:14,400 INFO L273 TraceCheckUtils]: 83: Hoare triple {9347#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9347#false} is VALID [2018-11-23 12:17:14,401 INFO L273 TraceCheckUtils]: 84: Hoare triple {9347#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9347#false} is VALID [2018-11-23 12:17:14,401 INFO L273 TraceCheckUtils]: 85: Hoare triple {9347#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9347#false} is VALID [2018-11-23 12:17:14,401 INFO L273 TraceCheckUtils]: 86: Hoare triple {9347#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9347#false} is VALID [2018-11-23 12:17:14,401 INFO L273 TraceCheckUtils]: 87: Hoare triple {9347#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9347#false} is VALID [2018-11-23 12:17:14,401 INFO L273 TraceCheckUtils]: 88: Hoare triple {9347#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9347#false} is VALID [2018-11-23 12:17:14,401 INFO L273 TraceCheckUtils]: 89: Hoare triple {9347#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9347#false} is VALID [2018-11-23 12:17:14,402 INFO L273 TraceCheckUtils]: 90: Hoare triple {9347#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9347#false} is VALID [2018-11-23 12:17:14,402 INFO L273 TraceCheckUtils]: 91: Hoare triple {9347#false} assume !(~i~2 < 59); {9347#false} is VALID [2018-11-23 12:17:14,402 INFO L273 TraceCheckUtils]: 92: Hoare triple {9347#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {9347#false} is VALID [2018-11-23 12:17:14,402 INFO L256 TraceCheckUtils]: 93: Hoare triple {9347#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {9347#false} is VALID [2018-11-23 12:17:14,402 INFO L273 TraceCheckUtils]: 94: Hoare triple {9347#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {9347#false} is VALID [2018-11-23 12:17:14,402 INFO L273 TraceCheckUtils]: 95: Hoare triple {9347#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9347#false} is VALID [2018-11-23 12:17:14,403 INFO L273 TraceCheckUtils]: 96: Hoare triple {9347#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9347#false} is VALID [2018-11-23 12:17:14,403 INFO L273 TraceCheckUtils]: 97: Hoare triple {9347#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9347#false} is VALID [2018-11-23 12:17:14,403 INFO L273 TraceCheckUtils]: 98: Hoare triple {9347#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9347#false} is VALID [2018-11-23 12:17:14,403 INFO L273 TraceCheckUtils]: 99: Hoare triple {9347#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9347#false} is VALID [2018-11-23 12:17:14,403 INFO L273 TraceCheckUtils]: 100: Hoare triple {9347#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9347#false} is VALID [2018-11-23 12:17:14,403 INFO L273 TraceCheckUtils]: 101: Hoare triple {9347#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9347#false} is VALID [2018-11-23 12:17:14,404 INFO L273 TraceCheckUtils]: 102: Hoare triple {9347#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9347#false} is VALID [2018-11-23 12:17:14,404 INFO L273 TraceCheckUtils]: 103: Hoare triple {9347#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9347#false} is VALID [2018-11-23 12:17:14,404 INFO L273 TraceCheckUtils]: 104: Hoare triple {9347#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9347#false} is VALID [2018-11-23 12:17:14,404 INFO L273 TraceCheckUtils]: 105: Hoare triple {9347#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9347#false} is VALID [2018-11-23 12:17:14,404 INFO L273 TraceCheckUtils]: 106: Hoare triple {9347#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9347#false} is VALID [2018-11-23 12:17:14,404 INFO L273 TraceCheckUtils]: 107: Hoare triple {9347#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9347#false} is VALID [2018-11-23 12:17:14,404 INFO L273 TraceCheckUtils]: 108: Hoare triple {9347#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9347#false} is VALID [2018-11-23 12:17:14,405 INFO L273 TraceCheckUtils]: 109: Hoare triple {9347#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9347#false} is VALID [2018-11-23 12:17:14,405 INFO L273 TraceCheckUtils]: 110: Hoare triple {9347#false} assume !(~i~0 < 60); {9347#false} is VALID [2018-11-23 12:17:14,405 INFO L273 TraceCheckUtils]: 111: Hoare triple {9347#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9347#false} is VALID [2018-11-23 12:17:14,405 INFO L273 TraceCheckUtils]: 112: Hoare triple {9347#false} assume true; {9347#false} is VALID [2018-11-23 12:17:14,405 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {9347#false} {9347#false} #79#return; {9347#false} is VALID [2018-11-23 12:17:14,405 INFO L273 TraceCheckUtils]: 114: Hoare triple {9347#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {9347#false} is VALID [2018-11-23 12:17:14,406 INFO L273 TraceCheckUtils]: 115: Hoare triple {9347#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {9347#false} is VALID [2018-11-23 12:17:14,406 INFO L273 TraceCheckUtils]: 116: Hoare triple {9347#false} assume !false; {9347#false} is VALID [2018-11-23 12:17:14,419 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2018-11-23 12:17:14,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:14,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:17:14,440 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 117 [2018-11-23 12:17:14,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:14,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:17:14,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:14,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:17:14,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:17:14,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:17:14,542 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 20 states. [2018-11-23 12:17:15,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:15,738 INFO L93 Difference]: Finished difference Result 120 states and 138 transitions. [2018-11-23 12:17:15,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:17:15,738 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 117 [2018-11-23 12:17:15,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:15,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:17:15,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2018-11-23 12:17:15,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:17:15,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2018-11-23 12:17:15,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 90 transitions. [2018-11-23 12:17:15,924 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:15,926 INFO L225 Difference]: With dead ends: 120 [2018-11-23 12:17:15,926 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 12:17:15,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:17:15,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 12:17:15,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-11-23 12:17:15,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:15,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 80 states. [2018-11-23 12:17:15,958 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 80 states. [2018-11-23 12:17:15,958 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 80 states. [2018-11-23 12:17:15,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:15,960 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2018-11-23 12:17:15,960 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2018-11-23 12:17:15,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:15,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:15,961 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 81 states. [2018-11-23 12:17:15,961 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 81 states. [2018-11-23 12:17:15,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:15,962 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2018-11-23 12:17:15,962 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2018-11-23 12:17:15,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:15,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:15,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:15,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:15,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 12:17:15,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2018-11-23 12:17:15,964 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 117 [2018-11-23 12:17:15,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:15,964 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2018-11-23 12:17:15,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:17:15,964 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2018-11-23 12:17:15,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-23 12:17:15,965 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:15,965 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 15, 15, 15, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:17:15,965 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:15,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:15,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1032150683, now seen corresponding path program 17 times [2018-11-23 12:17:15,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:15,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:15,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:15,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:15,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:16,553 INFO L256 TraceCheckUtils]: 0: Hoare triple {10167#true} call ULTIMATE.init(); {10167#true} is VALID [2018-11-23 12:17:16,553 INFO L273 TraceCheckUtils]: 1: Hoare triple {10167#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10167#true} is VALID [2018-11-23 12:17:16,553 INFO L273 TraceCheckUtils]: 2: Hoare triple {10167#true} assume true; {10167#true} is VALID [2018-11-23 12:17:16,554 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10167#true} {10167#true} #71#return; {10167#true} is VALID [2018-11-23 12:17:16,554 INFO L256 TraceCheckUtils]: 4: Hoare triple {10167#true} call #t~ret14 := main(); {10167#true} is VALID [2018-11-23 12:17:16,554 INFO L273 TraceCheckUtils]: 5: Hoare triple {10167#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10169#(= main_~i~1 0)} is VALID [2018-11-23 12:17:16,554 INFO L273 TraceCheckUtils]: 6: Hoare triple {10169#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10169#(= main_~i~1 0)} is VALID [2018-11-23 12:17:16,555 INFO L273 TraceCheckUtils]: 7: Hoare triple {10169#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10170#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:16,555 INFO L273 TraceCheckUtils]: 8: Hoare triple {10170#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10170#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:16,556 INFO L273 TraceCheckUtils]: 9: Hoare triple {10170#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10171#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:16,556 INFO L273 TraceCheckUtils]: 10: Hoare triple {10171#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10171#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:16,557 INFO L273 TraceCheckUtils]: 11: Hoare triple {10171#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10172#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:16,558 INFO L273 TraceCheckUtils]: 12: Hoare triple {10172#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10172#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:16,558 INFO L273 TraceCheckUtils]: 13: Hoare triple {10172#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10173#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:16,559 INFO L273 TraceCheckUtils]: 14: Hoare triple {10173#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10173#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:16,560 INFO L273 TraceCheckUtils]: 15: Hoare triple {10173#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10174#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:16,560 INFO L273 TraceCheckUtils]: 16: Hoare triple {10174#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10174#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:16,561 INFO L273 TraceCheckUtils]: 17: Hoare triple {10174#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10175#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:16,562 INFO L273 TraceCheckUtils]: 18: Hoare triple {10175#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10175#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:16,562 INFO L273 TraceCheckUtils]: 19: Hoare triple {10175#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10176#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:16,563 INFO L273 TraceCheckUtils]: 20: Hoare triple {10176#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10176#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:16,564 INFO L273 TraceCheckUtils]: 21: Hoare triple {10176#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10177#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:16,564 INFO L273 TraceCheckUtils]: 22: Hoare triple {10177#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10177#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:16,565 INFO L273 TraceCheckUtils]: 23: Hoare triple {10177#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10178#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:16,565 INFO L273 TraceCheckUtils]: 24: Hoare triple {10178#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10178#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:16,566 INFO L273 TraceCheckUtils]: 25: Hoare triple {10178#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10179#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:16,567 INFO L273 TraceCheckUtils]: 26: Hoare triple {10179#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10179#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:16,567 INFO L273 TraceCheckUtils]: 27: Hoare triple {10179#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10180#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:16,568 INFO L273 TraceCheckUtils]: 28: Hoare triple {10180#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10180#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:16,569 INFO L273 TraceCheckUtils]: 29: Hoare triple {10180#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10181#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:16,569 INFO L273 TraceCheckUtils]: 30: Hoare triple {10181#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10181#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:16,570 INFO L273 TraceCheckUtils]: 31: Hoare triple {10181#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10182#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:16,571 INFO L273 TraceCheckUtils]: 32: Hoare triple {10182#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10182#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:16,571 INFO L273 TraceCheckUtils]: 33: Hoare triple {10182#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10183#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:16,572 INFO L273 TraceCheckUtils]: 34: Hoare triple {10183#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10183#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:16,573 INFO L273 TraceCheckUtils]: 35: Hoare triple {10183#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10184#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:16,573 INFO L273 TraceCheckUtils]: 36: Hoare triple {10184#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10184#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:16,574 INFO L273 TraceCheckUtils]: 37: Hoare triple {10184#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10185#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:16,574 INFO L273 TraceCheckUtils]: 38: Hoare triple {10185#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10185#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:16,575 INFO L273 TraceCheckUtils]: 39: Hoare triple {10185#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10186#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:16,576 INFO L273 TraceCheckUtils]: 40: Hoare triple {10186#(<= main_~i~1 17)} assume !(~i~1 < 60); {10168#false} is VALID [2018-11-23 12:17:16,576 INFO L256 TraceCheckUtils]: 41: Hoare triple {10168#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {10167#true} is VALID [2018-11-23 12:17:16,576 INFO L273 TraceCheckUtils]: 42: Hoare triple {10167#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {10167#true} is VALID [2018-11-23 12:17:16,577 INFO L273 TraceCheckUtils]: 43: Hoare triple {10167#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10167#true} is VALID [2018-11-23 12:17:16,577 INFO L273 TraceCheckUtils]: 44: Hoare triple {10167#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10167#true} is VALID [2018-11-23 12:17:16,577 INFO L273 TraceCheckUtils]: 45: Hoare triple {10167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10167#true} is VALID [2018-11-23 12:17:16,577 INFO L273 TraceCheckUtils]: 46: Hoare triple {10167#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10167#true} is VALID [2018-11-23 12:17:16,577 INFO L273 TraceCheckUtils]: 47: Hoare triple {10167#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10167#true} is VALID [2018-11-23 12:17:16,578 INFO L273 TraceCheckUtils]: 48: Hoare triple {10167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10167#true} is VALID [2018-11-23 12:17:16,578 INFO L273 TraceCheckUtils]: 49: Hoare triple {10167#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10167#true} is VALID [2018-11-23 12:17:16,578 INFO L273 TraceCheckUtils]: 50: Hoare triple {10167#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10167#true} is VALID [2018-11-23 12:17:16,578 INFO L273 TraceCheckUtils]: 51: Hoare triple {10167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10167#true} is VALID [2018-11-23 12:17:16,578 INFO L273 TraceCheckUtils]: 52: Hoare triple {10167#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10167#true} is VALID [2018-11-23 12:17:16,579 INFO L273 TraceCheckUtils]: 53: Hoare triple {10167#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10167#true} is VALID [2018-11-23 12:17:16,579 INFO L273 TraceCheckUtils]: 54: Hoare triple {10167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10167#true} is VALID [2018-11-23 12:17:16,579 INFO L273 TraceCheckUtils]: 55: Hoare triple {10167#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10167#true} is VALID [2018-11-23 12:17:16,579 INFO L273 TraceCheckUtils]: 56: Hoare triple {10167#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10167#true} is VALID [2018-11-23 12:17:16,579 INFO L273 TraceCheckUtils]: 57: Hoare triple {10167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10167#true} is VALID [2018-11-23 12:17:16,579 INFO L273 TraceCheckUtils]: 58: Hoare triple {10167#true} assume !(~i~0 < 60); {10167#true} is VALID [2018-11-23 12:17:16,579 INFO L273 TraceCheckUtils]: 59: Hoare triple {10167#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10167#true} is VALID [2018-11-23 12:17:16,579 INFO L273 TraceCheckUtils]: 60: Hoare triple {10167#true} assume true; {10167#true} is VALID [2018-11-23 12:17:16,580 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {10167#true} {10168#false} #75#return; {10168#false} is VALID [2018-11-23 12:17:16,580 INFO L273 TraceCheckUtils]: 62: Hoare triple {10168#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {10168#false} is VALID [2018-11-23 12:17:16,580 INFO L256 TraceCheckUtils]: 63: Hoare triple {10168#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {10167#true} is VALID [2018-11-23 12:17:16,580 INFO L273 TraceCheckUtils]: 64: Hoare triple {10167#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {10167#true} is VALID [2018-11-23 12:17:16,580 INFO L273 TraceCheckUtils]: 65: Hoare triple {10167#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10167#true} is VALID [2018-11-23 12:17:16,580 INFO L273 TraceCheckUtils]: 66: Hoare triple {10167#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10167#true} is VALID [2018-11-23 12:17:16,580 INFO L273 TraceCheckUtils]: 67: Hoare triple {10167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10167#true} is VALID [2018-11-23 12:17:16,580 INFO L273 TraceCheckUtils]: 68: Hoare triple {10167#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10167#true} is VALID [2018-11-23 12:17:16,581 INFO L273 TraceCheckUtils]: 69: Hoare triple {10167#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10167#true} is VALID [2018-11-23 12:17:16,581 INFO L273 TraceCheckUtils]: 70: Hoare triple {10167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10167#true} is VALID [2018-11-23 12:17:16,581 INFO L273 TraceCheckUtils]: 71: Hoare triple {10167#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10167#true} is VALID [2018-11-23 12:17:16,581 INFO L273 TraceCheckUtils]: 72: Hoare triple {10167#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10167#true} is VALID [2018-11-23 12:17:16,581 INFO L273 TraceCheckUtils]: 73: Hoare triple {10167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10167#true} is VALID [2018-11-23 12:17:16,581 INFO L273 TraceCheckUtils]: 74: Hoare triple {10167#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10167#true} is VALID [2018-11-23 12:17:16,581 INFO L273 TraceCheckUtils]: 75: Hoare triple {10167#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10167#true} is VALID [2018-11-23 12:17:16,581 INFO L273 TraceCheckUtils]: 76: Hoare triple {10167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10167#true} is VALID [2018-11-23 12:17:16,581 INFO L273 TraceCheckUtils]: 77: Hoare triple {10167#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10167#true} is VALID [2018-11-23 12:17:16,582 INFO L273 TraceCheckUtils]: 78: Hoare triple {10167#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10167#true} is VALID [2018-11-23 12:17:16,582 INFO L273 TraceCheckUtils]: 79: Hoare triple {10167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10167#true} is VALID [2018-11-23 12:17:16,582 INFO L273 TraceCheckUtils]: 80: Hoare triple {10167#true} assume !(~i~0 < 60); {10167#true} is VALID [2018-11-23 12:17:16,582 INFO L273 TraceCheckUtils]: 81: Hoare triple {10167#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10167#true} is VALID [2018-11-23 12:17:16,582 INFO L273 TraceCheckUtils]: 82: Hoare triple {10167#true} assume true; {10167#true} is VALID [2018-11-23 12:17:16,582 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {10167#true} {10168#false} #77#return; {10168#false} is VALID [2018-11-23 12:17:16,582 INFO L273 TraceCheckUtils]: 84: Hoare triple {10168#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {10168#false} is VALID [2018-11-23 12:17:16,582 INFO L273 TraceCheckUtils]: 85: Hoare triple {10168#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10168#false} is VALID [2018-11-23 12:17:16,583 INFO L273 TraceCheckUtils]: 86: Hoare triple {10168#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10168#false} is VALID [2018-11-23 12:17:16,583 INFO L273 TraceCheckUtils]: 87: Hoare triple {10168#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10168#false} is VALID [2018-11-23 12:17:16,583 INFO L273 TraceCheckUtils]: 88: Hoare triple {10168#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10168#false} is VALID [2018-11-23 12:17:16,583 INFO L273 TraceCheckUtils]: 89: Hoare triple {10168#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10168#false} is VALID [2018-11-23 12:17:16,583 INFO L273 TraceCheckUtils]: 90: Hoare triple {10168#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10168#false} is VALID [2018-11-23 12:17:16,583 INFO L273 TraceCheckUtils]: 91: Hoare triple {10168#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10168#false} is VALID [2018-11-23 12:17:16,583 INFO L273 TraceCheckUtils]: 92: Hoare triple {10168#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10168#false} is VALID [2018-11-23 12:17:16,583 INFO L273 TraceCheckUtils]: 93: Hoare triple {10168#false} assume !(~i~2 < 59); {10168#false} is VALID [2018-11-23 12:17:16,583 INFO L273 TraceCheckUtils]: 94: Hoare triple {10168#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {10168#false} is VALID [2018-11-23 12:17:16,584 INFO L256 TraceCheckUtils]: 95: Hoare triple {10168#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {10167#true} is VALID [2018-11-23 12:17:16,584 INFO L273 TraceCheckUtils]: 96: Hoare triple {10167#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {10167#true} is VALID [2018-11-23 12:17:16,584 INFO L273 TraceCheckUtils]: 97: Hoare triple {10167#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10167#true} is VALID [2018-11-23 12:17:16,584 INFO L273 TraceCheckUtils]: 98: Hoare triple {10167#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10167#true} is VALID [2018-11-23 12:17:16,584 INFO L273 TraceCheckUtils]: 99: Hoare triple {10167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10167#true} is VALID [2018-11-23 12:17:16,584 INFO L273 TraceCheckUtils]: 100: Hoare triple {10167#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10167#true} is VALID [2018-11-23 12:17:16,584 INFO L273 TraceCheckUtils]: 101: Hoare triple {10167#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10167#true} is VALID [2018-11-23 12:17:16,584 INFO L273 TraceCheckUtils]: 102: Hoare triple {10167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10167#true} is VALID [2018-11-23 12:17:16,585 INFO L273 TraceCheckUtils]: 103: Hoare triple {10167#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10167#true} is VALID [2018-11-23 12:17:16,585 INFO L273 TraceCheckUtils]: 104: Hoare triple {10167#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10167#true} is VALID [2018-11-23 12:17:16,585 INFO L273 TraceCheckUtils]: 105: Hoare triple {10167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10167#true} is VALID [2018-11-23 12:17:16,585 INFO L273 TraceCheckUtils]: 106: Hoare triple {10167#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10167#true} is VALID [2018-11-23 12:17:16,585 INFO L273 TraceCheckUtils]: 107: Hoare triple {10167#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10167#true} is VALID [2018-11-23 12:17:16,585 INFO L273 TraceCheckUtils]: 108: Hoare triple {10167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10167#true} is VALID [2018-11-23 12:17:16,585 INFO L273 TraceCheckUtils]: 109: Hoare triple {10167#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10167#true} is VALID [2018-11-23 12:17:16,585 INFO L273 TraceCheckUtils]: 110: Hoare triple {10167#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10167#true} is VALID [2018-11-23 12:17:16,585 INFO L273 TraceCheckUtils]: 111: Hoare triple {10167#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10167#true} is VALID [2018-11-23 12:17:16,586 INFO L273 TraceCheckUtils]: 112: Hoare triple {10167#true} assume !(~i~0 < 60); {10167#true} is VALID [2018-11-23 12:17:16,586 INFO L273 TraceCheckUtils]: 113: Hoare triple {10167#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10167#true} is VALID [2018-11-23 12:17:16,586 INFO L273 TraceCheckUtils]: 114: Hoare triple {10167#true} assume true; {10167#true} is VALID [2018-11-23 12:17:16,586 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {10167#true} {10168#false} #79#return; {10168#false} is VALID [2018-11-23 12:17:16,586 INFO L273 TraceCheckUtils]: 116: Hoare triple {10168#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {10168#false} is VALID [2018-11-23 12:17:16,586 INFO L273 TraceCheckUtils]: 117: Hoare triple {10168#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {10168#false} is VALID [2018-11-23 12:17:16,586 INFO L273 TraceCheckUtils]: 118: Hoare triple {10168#false} assume !false; {10168#false} is VALID [2018-11-23 12:17:16,592 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2018-11-23 12:17:16,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:16,593 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:17:16,603 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:17:17,678 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-11-23 12:17:17,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:17,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:17,922 INFO L256 TraceCheckUtils]: 0: Hoare triple {10167#true} call ULTIMATE.init(); {10167#true} is VALID [2018-11-23 12:17:17,922 INFO L273 TraceCheckUtils]: 1: Hoare triple {10167#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10167#true} is VALID [2018-11-23 12:17:17,923 INFO L273 TraceCheckUtils]: 2: Hoare triple {10167#true} assume true; {10167#true} is VALID [2018-11-23 12:17:17,923 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10167#true} {10167#true} #71#return; {10167#true} is VALID [2018-11-23 12:17:17,923 INFO L256 TraceCheckUtils]: 4: Hoare triple {10167#true} call #t~ret14 := main(); {10167#true} is VALID [2018-11-23 12:17:17,923 INFO L273 TraceCheckUtils]: 5: Hoare triple {10167#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10167#true} is VALID [2018-11-23 12:17:17,923 INFO L273 TraceCheckUtils]: 6: Hoare triple {10167#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10167#true} is VALID [2018-11-23 12:17:17,923 INFO L273 TraceCheckUtils]: 7: Hoare triple {10167#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10167#true} is VALID [2018-11-23 12:17:17,924 INFO L273 TraceCheckUtils]: 8: Hoare triple {10167#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10167#true} is VALID [2018-11-23 12:17:17,924 INFO L273 TraceCheckUtils]: 9: Hoare triple {10167#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10167#true} is VALID [2018-11-23 12:17:17,924 INFO L273 TraceCheckUtils]: 10: Hoare triple {10167#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10167#true} is VALID [2018-11-23 12:17:17,924 INFO L273 TraceCheckUtils]: 11: Hoare triple {10167#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10167#true} is VALID [2018-11-23 12:17:17,924 INFO L273 TraceCheckUtils]: 12: Hoare triple {10167#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10167#true} is VALID [2018-11-23 12:17:17,924 INFO L273 TraceCheckUtils]: 13: Hoare triple {10167#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10167#true} is VALID [2018-11-23 12:17:17,924 INFO L273 TraceCheckUtils]: 14: Hoare triple {10167#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10167#true} is VALID [2018-11-23 12:17:17,924 INFO L273 TraceCheckUtils]: 15: Hoare triple {10167#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10167#true} is VALID [2018-11-23 12:17:17,925 INFO L273 TraceCheckUtils]: 16: Hoare triple {10167#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10167#true} is VALID [2018-11-23 12:17:17,925 INFO L273 TraceCheckUtils]: 17: Hoare triple {10167#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10167#true} is VALID [2018-11-23 12:17:17,925 INFO L273 TraceCheckUtils]: 18: Hoare triple {10167#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10167#true} is VALID [2018-11-23 12:17:17,925 INFO L273 TraceCheckUtils]: 19: Hoare triple {10167#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10167#true} is VALID [2018-11-23 12:17:17,925 INFO L273 TraceCheckUtils]: 20: Hoare triple {10167#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10167#true} is VALID [2018-11-23 12:17:17,925 INFO L273 TraceCheckUtils]: 21: Hoare triple {10167#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10167#true} is VALID [2018-11-23 12:17:17,925 INFO L273 TraceCheckUtils]: 22: Hoare triple {10167#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10167#true} is VALID [2018-11-23 12:17:17,925 INFO L273 TraceCheckUtils]: 23: Hoare triple {10167#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10167#true} is VALID [2018-11-23 12:17:17,925 INFO L273 TraceCheckUtils]: 24: Hoare triple {10167#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10167#true} is VALID [2018-11-23 12:17:17,926 INFO L273 TraceCheckUtils]: 25: Hoare triple {10167#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10167#true} is VALID [2018-11-23 12:17:17,926 INFO L273 TraceCheckUtils]: 26: Hoare triple {10167#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10167#true} is VALID [2018-11-23 12:17:17,926 INFO L273 TraceCheckUtils]: 27: Hoare triple {10167#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10167#true} is VALID [2018-11-23 12:17:17,926 INFO L273 TraceCheckUtils]: 28: Hoare triple {10167#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10167#true} is VALID [2018-11-23 12:17:17,926 INFO L273 TraceCheckUtils]: 29: Hoare triple {10167#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10167#true} is VALID [2018-11-23 12:17:17,926 INFO L273 TraceCheckUtils]: 30: Hoare triple {10167#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10167#true} is VALID [2018-11-23 12:17:17,926 INFO L273 TraceCheckUtils]: 31: Hoare triple {10167#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10167#true} is VALID [2018-11-23 12:17:17,926 INFO L273 TraceCheckUtils]: 32: Hoare triple {10167#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10167#true} is VALID [2018-11-23 12:17:17,926 INFO L273 TraceCheckUtils]: 33: Hoare triple {10167#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10167#true} is VALID [2018-11-23 12:17:17,927 INFO L273 TraceCheckUtils]: 34: Hoare triple {10167#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10167#true} is VALID [2018-11-23 12:17:17,927 INFO L273 TraceCheckUtils]: 35: Hoare triple {10167#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10167#true} is VALID [2018-11-23 12:17:17,927 INFO L273 TraceCheckUtils]: 36: Hoare triple {10167#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10167#true} is VALID [2018-11-23 12:17:17,927 INFO L273 TraceCheckUtils]: 37: Hoare triple {10167#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10167#true} is VALID [2018-11-23 12:17:17,927 INFO L273 TraceCheckUtils]: 38: Hoare triple {10167#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10167#true} is VALID [2018-11-23 12:17:17,927 INFO L273 TraceCheckUtils]: 39: Hoare triple {10167#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10167#true} is VALID [2018-11-23 12:17:17,927 INFO L273 TraceCheckUtils]: 40: Hoare triple {10167#true} assume !(~i~1 < 60); {10167#true} is VALID [2018-11-23 12:17:17,927 INFO L256 TraceCheckUtils]: 41: Hoare triple {10167#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {10167#true} is VALID [2018-11-23 12:17:17,928 INFO L273 TraceCheckUtils]: 42: Hoare triple {10167#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {10316#(<= sep_~i~0 0)} is VALID [2018-11-23 12:17:17,928 INFO L273 TraceCheckUtils]: 43: Hoare triple {10316#(<= sep_~i~0 0)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10316#(<= sep_~i~0 0)} is VALID [2018-11-23 12:17:17,928 INFO L273 TraceCheckUtils]: 44: Hoare triple {10316#(<= sep_~i~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10316#(<= sep_~i~0 0)} is VALID [2018-11-23 12:17:17,929 INFO L273 TraceCheckUtils]: 45: Hoare triple {10316#(<= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10326#(<= sep_~i~0 1)} is VALID [2018-11-23 12:17:17,929 INFO L273 TraceCheckUtils]: 46: Hoare triple {10326#(<= sep_~i~0 1)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10326#(<= sep_~i~0 1)} is VALID [2018-11-23 12:17:17,930 INFO L273 TraceCheckUtils]: 47: Hoare triple {10326#(<= sep_~i~0 1)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10326#(<= sep_~i~0 1)} is VALID [2018-11-23 12:17:17,930 INFO L273 TraceCheckUtils]: 48: Hoare triple {10326#(<= sep_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10336#(<= sep_~i~0 2)} is VALID [2018-11-23 12:17:17,930 INFO L273 TraceCheckUtils]: 49: Hoare triple {10336#(<= sep_~i~0 2)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10336#(<= sep_~i~0 2)} is VALID [2018-11-23 12:17:17,931 INFO L273 TraceCheckUtils]: 50: Hoare triple {10336#(<= sep_~i~0 2)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10336#(<= sep_~i~0 2)} is VALID [2018-11-23 12:17:17,931 INFO L273 TraceCheckUtils]: 51: Hoare triple {10336#(<= sep_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10346#(<= sep_~i~0 3)} is VALID [2018-11-23 12:17:17,932 INFO L273 TraceCheckUtils]: 52: Hoare triple {10346#(<= sep_~i~0 3)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10346#(<= sep_~i~0 3)} is VALID [2018-11-23 12:17:17,932 INFO L273 TraceCheckUtils]: 53: Hoare triple {10346#(<= sep_~i~0 3)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10346#(<= sep_~i~0 3)} is VALID [2018-11-23 12:17:17,933 INFO L273 TraceCheckUtils]: 54: Hoare triple {10346#(<= sep_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10356#(<= sep_~i~0 4)} is VALID [2018-11-23 12:17:17,934 INFO L273 TraceCheckUtils]: 55: Hoare triple {10356#(<= sep_~i~0 4)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10356#(<= sep_~i~0 4)} is VALID [2018-11-23 12:17:17,934 INFO L273 TraceCheckUtils]: 56: Hoare triple {10356#(<= sep_~i~0 4)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10356#(<= sep_~i~0 4)} is VALID [2018-11-23 12:17:17,935 INFO L273 TraceCheckUtils]: 57: Hoare triple {10356#(<= sep_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10366#(<= sep_~i~0 5)} is VALID [2018-11-23 12:17:17,936 INFO L273 TraceCheckUtils]: 58: Hoare triple {10366#(<= sep_~i~0 5)} assume !(~i~0 < 60); {10168#false} is VALID [2018-11-23 12:17:17,936 INFO L273 TraceCheckUtils]: 59: Hoare triple {10168#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10168#false} is VALID [2018-11-23 12:17:17,936 INFO L273 TraceCheckUtils]: 60: Hoare triple {10168#false} assume true; {10168#false} is VALID [2018-11-23 12:17:17,936 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {10168#false} {10167#true} #75#return; {10168#false} is VALID [2018-11-23 12:17:17,936 INFO L273 TraceCheckUtils]: 62: Hoare triple {10168#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {10168#false} is VALID [2018-11-23 12:17:17,937 INFO L256 TraceCheckUtils]: 63: Hoare triple {10168#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {10168#false} is VALID [2018-11-23 12:17:17,937 INFO L273 TraceCheckUtils]: 64: Hoare triple {10168#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {10168#false} is VALID [2018-11-23 12:17:17,937 INFO L273 TraceCheckUtils]: 65: Hoare triple {10168#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10168#false} is VALID [2018-11-23 12:17:17,937 INFO L273 TraceCheckUtils]: 66: Hoare triple {10168#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10168#false} is VALID [2018-11-23 12:17:17,937 INFO L273 TraceCheckUtils]: 67: Hoare triple {10168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10168#false} is VALID [2018-11-23 12:17:17,938 INFO L273 TraceCheckUtils]: 68: Hoare triple {10168#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10168#false} is VALID [2018-11-23 12:17:17,938 INFO L273 TraceCheckUtils]: 69: Hoare triple {10168#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10168#false} is VALID [2018-11-23 12:17:17,938 INFO L273 TraceCheckUtils]: 70: Hoare triple {10168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10168#false} is VALID [2018-11-23 12:17:17,938 INFO L273 TraceCheckUtils]: 71: Hoare triple {10168#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10168#false} is VALID [2018-11-23 12:17:17,938 INFO L273 TraceCheckUtils]: 72: Hoare triple {10168#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10168#false} is VALID [2018-11-23 12:17:17,938 INFO L273 TraceCheckUtils]: 73: Hoare triple {10168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10168#false} is VALID [2018-11-23 12:17:17,939 INFO L273 TraceCheckUtils]: 74: Hoare triple {10168#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10168#false} is VALID [2018-11-23 12:17:17,939 INFO L273 TraceCheckUtils]: 75: Hoare triple {10168#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10168#false} is VALID [2018-11-23 12:17:17,939 INFO L273 TraceCheckUtils]: 76: Hoare triple {10168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10168#false} is VALID [2018-11-23 12:17:17,939 INFO L273 TraceCheckUtils]: 77: Hoare triple {10168#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10168#false} is VALID [2018-11-23 12:17:17,939 INFO L273 TraceCheckUtils]: 78: Hoare triple {10168#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10168#false} is VALID [2018-11-23 12:17:17,940 INFO L273 TraceCheckUtils]: 79: Hoare triple {10168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10168#false} is VALID [2018-11-23 12:17:17,940 INFO L273 TraceCheckUtils]: 80: Hoare triple {10168#false} assume !(~i~0 < 60); {10168#false} is VALID [2018-11-23 12:17:17,940 INFO L273 TraceCheckUtils]: 81: Hoare triple {10168#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10168#false} is VALID [2018-11-23 12:17:17,940 INFO L273 TraceCheckUtils]: 82: Hoare triple {10168#false} assume true; {10168#false} is VALID [2018-11-23 12:17:17,940 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {10168#false} {10168#false} #77#return; {10168#false} is VALID [2018-11-23 12:17:17,940 INFO L273 TraceCheckUtils]: 84: Hoare triple {10168#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {10168#false} is VALID [2018-11-23 12:17:17,941 INFO L273 TraceCheckUtils]: 85: Hoare triple {10168#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10168#false} is VALID [2018-11-23 12:17:17,941 INFO L273 TraceCheckUtils]: 86: Hoare triple {10168#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10168#false} is VALID [2018-11-23 12:17:17,941 INFO L273 TraceCheckUtils]: 87: Hoare triple {10168#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10168#false} is VALID [2018-11-23 12:17:17,941 INFO L273 TraceCheckUtils]: 88: Hoare triple {10168#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10168#false} is VALID [2018-11-23 12:17:17,941 INFO L273 TraceCheckUtils]: 89: Hoare triple {10168#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10168#false} is VALID [2018-11-23 12:17:17,941 INFO L273 TraceCheckUtils]: 90: Hoare triple {10168#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10168#false} is VALID [2018-11-23 12:17:17,941 INFO L273 TraceCheckUtils]: 91: Hoare triple {10168#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10168#false} is VALID [2018-11-23 12:17:17,941 INFO L273 TraceCheckUtils]: 92: Hoare triple {10168#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10168#false} is VALID [2018-11-23 12:17:17,942 INFO L273 TraceCheckUtils]: 93: Hoare triple {10168#false} assume !(~i~2 < 59); {10168#false} is VALID [2018-11-23 12:17:17,942 INFO L273 TraceCheckUtils]: 94: Hoare triple {10168#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {10168#false} is VALID [2018-11-23 12:17:17,942 INFO L256 TraceCheckUtils]: 95: Hoare triple {10168#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {10168#false} is VALID [2018-11-23 12:17:17,942 INFO L273 TraceCheckUtils]: 96: Hoare triple {10168#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {10168#false} is VALID [2018-11-23 12:17:17,942 INFO L273 TraceCheckUtils]: 97: Hoare triple {10168#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10168#false} is VALID [2018-11-23 12:17:17,942 INFO L273 TraceCheckUtils]: 98: Hoare triple {10168#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10168#false} is VALID [2018-11-23 12:17:17,942 INFO L273 TraceCheckUtils]: 99: Hoare triple {10168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10168#false} is VALID [2018-11-23 12:17:17,942 INFO L273 TraceCheckUtils]: 100: Hoare triple {10168#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10168#false} is VALID [2018-11-23 12:17:17,942 INFO L273 TraceCheckUtils]: 101: Hoare triple {10168#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10168#false} is VALID [2018-11-23 12:17:17,943 INFO L273 TraceCheckUtils]: 102: Hoare triple {10168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10168#false} is VALID [2018-11-23 12:17:17,943 INFO L273 TraceCheckUtils]: 103: Hoare triple {10168#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10168#false} is VALID [2018-11-23 12:17:17,943 INFO L273 TraceCheckUtils]: 104: Hoare triple {10168#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10168#false} is VALID [2018-11-23 12:17:17,943 INFO L273 TraceCheckUtils]: 105: Hoare triple {10168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10168#false} is VALID [2018-11-23 12:17:17,943 INFO L273 TraceCheckUtils]: 106: Hoare triple {10168#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10168#false} is VALID [2018-11-23 12:17:17,943 INFO L273 TraceCheckUtils]: 107: Hoare triple {10168#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10168#false} is VALID [2018-11-23 12:17:17,943 INFO L273 TraceCheckUtils]: 108: Hoare triple {10168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10168#false} is VALID [2018-11-23 12:17:17,943 INFO L273 TraceCheckUtils]: 109: Hoare triple {10168#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10168#false} is VALID [2018-11-23 12:17:17,944 INFO L273 TraceCheckUtils]: 110: Hoare triple {10168#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10168#false} is VALID [2018-11-23 12:17:17,944 INFO L273 TraceCheckUtils]: 111: Hoare triple {10168#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10168#false} is VALID [2018-11-23 12:17:17,944 INFO L273 TraceCheckUtils]: 112: Hoare triple {10168#false} assume !(~i~0 < 60); {10168#false} is VALID [2018-11-23 12:17:17,944 INFO L273 TraceCheckUtils]: 113: Hoare triple {10168#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10168#false} is VALID [2018-11-23 12:17:17,944 INFO L273 TraceCheckUtils]: 114: Hoare triple {10168#false} assume true; {10168#false} is VALID [2018-11-23 12:17:17,944 INFO L268 TraceCheckUtils]: 115: Hoare quadruple {10168#false} {10168#false} #79#return; {10168#false} is VALID [2018-11-23 12:17:17,944 INFO L273 TraceCheckUtils]: 116: Hoare triple {10168#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {10168#false} is VALID [2018-11-23 12:17:17,944 INFO L273 TraceCheckUtils]: 117: Hoare triple {10168#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {10168#false} is VALID [2018-11-23 12:17:17,944 INFO L273 TraceCheckUtils]: 118: Hoare triple {10168#false} assume !false; {10168#false} is VALID [2018-11-23 12:17:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 174 proven. 35 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2018-11-23 12:17:17,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:17,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8] total 26 [2018-11-23 12:17:17,971 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 119 [2018-11-23 12:17:17,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:17,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:17:18,065 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-23 12:17:18,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:17:18,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:17:18,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=433, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:17:18,066 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand 26 states. [2018-11-23 12:17:19,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:19,307 INFO L93 Difference]: Finished difference Result 127 states and 151 transitions. [2018-11-23 12:17:19,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:17:19,307 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 119 [2018-11-23 12:17:19,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:19,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:17:19,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 120 transitions. [2018-11-23 12:17:19,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:17:19,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 120 transitions. [2018-11-23 12:17:19,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 120 transitions. [2018-11-23 12:17:19,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:19,483 INFO L225 Difference]: With dead ends: 127 [2018-11-23 12:17:19,483 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 12:17:19,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=217, Invalid=433, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:17:19,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 12:17:19,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2018-11-23 12:17:19,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:19,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 85 states. [2018-11-23 12:17:19,510 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 85 states. [2018-11-23 12:17:19,510 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 85 states. [2018-11-23 12:17:19,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:19,513 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2018-11-23 12:17:19,514 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2018-11-23 12:17:19,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:19,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:19,514 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 88 states. [2018-11-23 12:17:19,514 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 88 states. [2018-11-23 12:17:19,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:19,516 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2018-11-23 12:17:19,516 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2018-11-23 12:17:19,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:19,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:19,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:19,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:19,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 12:17:19,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-11-23 12:17:19,523 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 119 [2018-11-23 12:17:19,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:19,523 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-11-23 12:17:19,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:17:19,523 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-11-23 12:17:19,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 12:17:19,524 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:19,524 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:17:19,526 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:19,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:19,526 INFO L82 PathProgramCache]: Analyzing trace with hash -576331982, now seen corresponding path program 18 times [2018-11-23 12:17:19,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:19,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:19,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:19,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:19,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:20,022 INFO L256 TraceCheckUtils]: 0: Hoare triple {11030#true} call ULTIMATE.init(); {11030#true} is VALID [2018-11-23 12:17:20,022 INFO L273 TraceCheckUtils]: 1: Hoare triple {11030#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11030#true} is VALID [2018-11-23 12:17:20,022 INFO L273 TraceCheckUtils]: 2: Hoare triple {11030#true} assume true; {11030#true} is VALID [2018-11-23 12:17:20,022 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11030#true} {11030#true} #71#return; {11030#true} is VALID [2018-11-23 12:17:20,023 INFO L256 TraceCheckUtils]: 4: Hoare triple {11030#true} call #t~ret14 := main(); {11030#true} is VALID [2018-11-23 12:17:20,023 INFO L273 TraceCheckUtils]: 5: Hoare triple {11030#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {11032#(= main_~i~1 0)} is VALID [2018-11-23 12:17:20,024 INFO L273 TraceCheckUtils]: 6: Hoare triple {11032#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11032#(= main_~i~1 0)} is VALID [2018-11-23 12:17:20,024 INFO L273 TraceCheckUtils]: 7: Hoare triple {11032#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11033#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:20,025 INFO L273 TraceCheckUtils]: 8: Hoare triple {11033#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11033#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:20,025 INFO L273 TraceCheckUtils]: 9: Hoare triple {11033#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11034#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:20,026 INFO L273 TraceCheckUtils]: 10: Hoare triple {11034#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11034#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:20,026 INFO L273 TraceCheckUtils]: 11: Hoare triple {11034#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11035#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:20,026 INFO L273 TraceCheckUtils]: 12: Hoare triple {11035#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11035#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:20,027 INFO L273 TraceCheckUtils]: 13: Hoare triple {11035#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11036#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:20,028 INFO L273 TraceCheckUtils]: 14: Hoare triple {11036#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11036#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:20,028 INFO L273 TraceCheckUtils]: 15: Hoare triple {11036#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11037#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:20,029 INFO L273 TraceCheckUtils]: 16: Hoare triple {11037#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11037#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:20,030 INFO L273 TraceCheckUtils]: 17: Hoare triple {11037#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11038#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:20,030 INFO L273 TraceCheckUtils]: 18: Hoare triple {11038#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11038#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:20,031 INFO L273 TraceCheckUtils]: 19: Hoare triple {11038#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11039#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:20,032 INFO L273 TraceCheckUtils]: 20: Hoare triple {11039#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11039#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:20,032 INFO L273 TraceCheckUtils]: 21: Hoare triple {11039#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11040#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:20,033 INFO L273 TraceCheckUtils]: 22: Hoare triple {11040#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11040#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:20,034 INFO L273 TraceCheckUtils]: 23: Hoare triple {11040#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11041#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:20,034 INFO L273 TraceCheckUtils]: 24: Hoare triple {11041#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11041#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:20,035 INFO L273 TraceCheckUtils]: 25: Hoare triple {11041#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11042#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:20,035 INFO L273 TraceCheckUtils]: 26: Hoare triple {11042#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11042#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:20,036 INFO L273 TraceCheckUtils]: 27: Hoare triple {11042#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11043#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:20,037 INFO L273 TraceCheckUtils]: 28: Hoare triple {11043#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11043#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:20,037 INFO L273 TraceCheckUtils]: 29: Hoare triple {11043#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11044#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:20,038 INFO L273 TraceCheckUtils]: 30: Hoare triple {11044#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11044#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:20,039 INFO L273 TraceCheckUtils]: 31: Hoare triple {11044#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11045#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:20,039 INFO L273 TraceCheckUtils]: 32: Hoare triple {11045#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11045#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:20,040 INFO L273 TraceCheckUtils]: 33: Hoare triple {11045#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11046#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:20,041 INFO L273 TraceCheckUtils]: 34: Hoare triple {11046#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11046#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:20,041 INFO L273 TraceCheckUtils]: 35: Hoare triple {11046#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11047#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:20,042 INFO L273 TraceCheckUtils]: 36: Hoare triple {11047#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11047#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:20,043 INFO L273 TraceCheckUtils]: 37: Hoare triple {11047#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11048#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:20,043 INFO L273 TraceCheckUtils]: 38: Hoare triple {11048#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11048#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:20,044 INFO L273 TraceCheckUtils]: 39: Hoare triple {11048#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11049#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:20,044 INFO L273 TraceCheckUtils]: 40: Hoare triple {11049#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11049#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:20,045 INFO L273 TraceCheckUtils]: 41: Hoare triple {11049#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11050#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:20,046 INFO L273 TraceCheckUtils]: 42: Hoare triple {11050#(<= main_~i~1 18)} assume !(~i~1 < 60); {11031#false} is VALID [2018-11-23 12:17:20,046 INFO L256 TraceCheckUtils]: 43: Hoare triple {11031#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {11030#true} is VALID [2018-11-23 12:17:20,046 INFO L273 TraceCheckUtils]: 44: Hoare triple {11030#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {11030#true} is VALID [2018-11-23 12:17:20,047 INFO L273 TraceCheckUtils]: 45: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,047 INFO L273 TraceCheckUtils]: 46: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,047 INFO L273 TraceCheckUtils]: 47: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,047 INFO L273 TraceCheckUtils]: 48: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,047 INFO L273 TraceCheckUtils]: 49: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,048 INFO L273 TraceCheckUtils]: 50: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,048 INFO L273 TraceCheckUtils]: 51: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,048 INFO L273 TraceCheckUtils]: 52: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,048 INFO L273 TraceCheckUtils]: 53: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,048 INFO L273 TraceCheckUtils]: 54: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,048 INFO L273 TraceCheckUtils]: 55: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,049 INFO L273 TraceCheckUtils]: 56: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,049 INFO L273 TraceCheckUtils]: 57: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,049 INFO L273 TraceCheckUtils]: 58: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,049 INFO L273 TraceCheckUtils]: 59: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,049 INFO L273 TraceCheckUtils]: 60: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,049 INFO L273 TraceCheckUtils]: 61: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,049 INFO L273 TraceCheckUtils]: 62: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,049 INFO L273 TraceCheckUtils]: 63: Hoare triple {11030#true} assume !(~i~0 < 60); {11030#true} is VALID [2018-11-23 12:17:20,049 INFO L273 TraceCheckUtils]: 64: Hoare triple {11030#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11030#true} is VALID [2018-11-23 12:17:20,050 INFO L273 TraceCheckUtils]: 65: Hoare triple {11030#true} assume true; {11030#true} is VALID [2018-11-23 12:17:20,050 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {11030#true} {11031#false} #75#return; {11031#false} is VALID [2018-11-23 12:17:20,050 INFO L273 TraceCheckUtils]: 67: Hoare triple {11031#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {11031#false} is VALID [2018-11-23 12:17:20,050 INFO L256 TraceCheckUtils]: 68: Hoare triple {11031#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {11030#true} is VALID [2018-11-23 12:17:20,050 INFO L273 TraceCheckUtils]: 69: Hoare triple {11030#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {11030#true} is VALID [2018-11-23 12:17:20,050 INFO L273 TraceCheckUtils]: 70: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,050 INFO L273 TraceCheckUtils]: 71: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,050 INFO L273 TraceCheckUtils]: 72: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,051 INFO L273 TraceCheckUtils]: 73: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,051 INFO L273 TraceCheckUtils]: 74: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,051 INFO L273 TraceCheckUtils]: 75: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,051 INFO L273 TraceCheckUtils]: 76: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,051 INFO L273 TraceCheckUtils]: 77: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,051 INFO L273 TraceCheckUtils]: 78: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,051 INFO L273 TraceCheckUtils]: 79: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,051 INFO L273 TraceCheckUtils]: 80: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,051 INFO L273 TraceCheckUtils]: 81: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,052 INFO L273 TraceCheckUtils]: 82: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,052 INFO L273 TraceCheckUtils]: 83: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,052 INFO L273 TraceCheckUtils]: 84: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,052 INFO L273 TraceCheckUtils]: 85: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,052 INFO L273 TraceCheckUtils]: 86: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,052 INFO L273 TraceCheckUtils]: 87: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,052 INFO L273 TraceCheckUtils]: 88: Hoare triple {11030#true} assume !(~i~0 < 60); {11030#true} is VALID [2018-11-23 12:17:20,052 INFO L273 TraceCheckUtils]: 89: Hoare triple {11030#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11030#true} is VALID [2018-11-23 12:17:20,052 INFO L273 TraceCheckUtils]: 90: Hoare triple {11030#true} assume true; {11030#true} is VALID [2018-11-23 12:17:20,053 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {11030#true} {11031#false} #77#return; {11031#false} is VALID [2018-11-23 12:17:20,053 INFO L273 TraceCheckUtils]: 92: Hoare triple {11031#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {11031#false} is VALID [2018-11-23 12:17:20,053 INFO L273 TraceCheckUtils]: 93: Hoare triple {11031#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11031#false} is VALID [2018-11-23 12:17:20,053 INFO L273 TraceCheckUtils]: 94: Hoare triple {11031#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11031#false} is VALID [2018-11-23 12:17:20,053 INFO L273 TraceCheckUtils]: 95: Hoare triple {11031#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11031#false} is VALID [2018-11-23 12:17:20,053 INFO L273 TraceCheckUtils]: 96: Hoare triple {11031#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11031#false} is VALID [2018-11-23 12:17:20,053 INFO L273 TraceCheckUtils]: 97: Hoare triple {11031#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11031#false} is VALID [2018-11-23 12:17:20,053 INFO L273 TraceCheckUtils]: 98: Hoare triple {11031#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11031#false} is VALID [2018-11-23 12:17:20,054 INFO L273 TraceCheckUtils]: 99: Hoare triple {11031#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11031#false} is VALID [2018-11-23 12:17:20,054 INFO L273 TraceCheckUtils]: 100: Hoare triple {11031#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11031#false} is VALID [2018-11-23 12:17:20,054 INFO L273 TraceCheckUtils]: 101: Hoare triple {11031#false} assume !(~i~2 < 59); {11031#false} is VALID [2018-11-23 12:17:20,054 INFO L273 TraceCheckUtils]: 102: Hoare triple {11031#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {11031#false} is VALID [2018-11-23 12:17:20,054 INFO L256 TraceCheckUtils]: 103: Hoare triple {11031#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {11030#true} is VALID [2018-11-23 12:17:20,054 INFO L273 TraceCheckUtils]: 104: Hoare triple {11030#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {11030#true} is VALID [2018-11-23 12:17:20,054 INFO L273 TraceCheckUtils]: 105: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,054 INFO L273 TraceCheckUtils]: 106: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,054 INFO L273 TraceCheckUtils]: 107: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,055 INFO L273 TraceCheckUtils]: 108: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,055 INFO L273 TraceCheckUtils]: 109: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,055 INFO L273 TraceCheckUtils]: 110: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,055 INFO L273 TraceCheckUtils]: 111: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,055 INFO L273 TraceCheckUtils]: 112: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,055 INFO L273 TraceCheckUtils]: 113: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,055 INFO L273 TraceCheckUtils]: 114: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,055 INFO L273 TraceCheckUtils]: 115: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,055 INFO L273 TraceCheckUtils]: 116: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,056 INFO L273 TraceCheckUtils]: 117: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,056 INFO L273 TraceCheckUtils]: 118: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,056 INFO L273 TraceCheckUtils]: 119: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,056 INFO L273 TraceCheckUtils]: 120: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,056 INFO L273 TraceCheckUtils]: 121: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,056 INFO L273 TraceCheckUtils]: 122: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,056 INFO L273 TraceCheckUtils]: 123: Hoare triple {11030#true} assume !(~i~0 < 60); {11030#true} is VALID [2018-11-23 12:17:20,056 INFO L273 TraceCheckUtils]: 124: Hoare triple {11030#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11030#true} is VALID [2018-11-23 12:17:20,057 INFO L273 TraceCheckUtils]: 125: Hoare triple {11030#true} assume true; {11030#true} is VALID [2018-11-23 12:17:20,057 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {11030#true} {11031#false} #79#return; {11031#false} is VALID [2018-11-23 12:17:20,057 INFO L273 TraceCheckUtils]: 127: Hoare triple {11031#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {11031#false} is VALID [2018-11-23 12:17:20,057 INFO L273 TraceCheckUtils]: 128: Hoare triple {11031#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {11031#false} is VALID [2018-11-23 12:17:20,057 INFO L273 TraceCheckUtils]: 129: Hoare triple {11031#false} assume !false; {11031#false} is VALID [2018-11-23 12:17:20,064 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-23 12:17:20,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:20,065 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:17:20,076 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:17:20,205 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-23 12:17:20,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:20,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:20,445 INFO L256 TraceCheckUtils]: 0: Hoare triple {11030#true} call ULTIMATE.init(); {11030#true} is VALID [2018-11-23 12:17:20,445 INFO L273 TraceCheckUtils]: 1: Hoare triple {11030#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11030#true} is VALID [2018-11-23 12:17:20,446 INFO L273 TraceCheckUtils]: 2: Hoare triple {11030#true} assume true; {11030#true} is VALID [2018-11-23 12:17:20,446 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11030#true} {11030#true} #71#return; {11030#true} is VALID [2018-11-23 12:17:20,446 INFO L256 TraceCheckUtils]: 4: Hoare triple {11030#true} call #t~ret14 := main(); {11030#true} is VALID [2018-11-23 12:17:20,446 INFO L273 TraceCheckUtils]: 5: Hoare triple {11030#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {11030#true} is VALID [2018-11-23 12:17:20,447 INFO L273 TraceCheckUtils]: 6: Hoare triple {11030#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11030#true} is VALID [2018-11-23 12:17:20,447 INFO L273 TraceCheckUtils]: 7: Hoare triple {11030#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11030#true} is VALID [2018-11-23 12:17:20,447 INFO L273 TraceCheckUtils]: 8: Hoare triple {11030#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11030#true} is VALID [2018-11-23 12:17:20,447 INFO L273 TraceCheckUtils]: 9: Hoare triple {11030#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11030#true} is VALID [2018-11-23 12:17:20,447 INFO L273 TraceCheckUtils]: 10: Hoare triple {11030#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11030#true} is VALID [2018-11-23 12:17:20,448 INFO L273 TraceCheckUtils]: 11: Hoare triple {11030#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11030#true} is VALID [2018-11-23 12:17:20,448 INFO L273 TraceCheckUtils]: 12: Hoare triple {11030#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11030#true} is VALID [2018-11-23 12:17:20,448 INFO L273 TraceCheckUtils]: 13: Hoare triple {11030#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11030#true} is VALID [2018-11-23 12:17:20,448 INFO L273 TraceCheckUtils]: 14: Hoare triple {11030#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11030#true} is VALID [2018-11-23 12:17:20,448 INFO L273 TraceCheckUtils]: 15: Hoare triple {11030#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11030#true} is VALID [2018-11-23 12:17:20,448 INFO L273 TraceCheckUtils]: 16: Hoare triple {11030#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11030#true} is VALID [2018-11-23 12:17:20,448 INFO L273 TraceCheckUtils]: 17: Hoare triple {11030#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11030#true} is VALID [2018-11-23 12:17:20,448 INFO L273 TraceCheckUtils]: 18: Hoare triple {11030#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11030#true} is VALID [2018-11-23 12:17:20,449 INFO L273 TraceCheckUtils]: 19: Hoare triple {11030#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11030#true} is VALID [2018-11-23 12:17:20,449 INFO L273 TraceCheckUtils]: 20: Hoare triple {11030#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11030#true} is VALID [2018-11-23 12:17:20,449 INFO L273 TraceCheckUtils]: 21: Hoare triple {11030#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11030#true} is VALID [2018-11-23 12:17:20,449 INFO L273 TraceCheckUtils]: 22: Hoare triple {11030#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11030#true} is VALID [2018-11-23 12:17:20,449 INFO L273 TraceCheckUtils]: 23: Hoare triple {11030#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11030#true} is VALID [2018-11-23 12:17:20,449 INFO L273 TraceCheckUtils]: 24: Hoare triple {11030#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11030#true} is VALID [2018-11-23 12:17:20,449 INFO L273 TraceCheckUtils]: 25: Hoare triple {11030#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11030#true} is VALID [2018-11-23 12:17:20,449 INFO L273 TraceCheckUtils]: 26: Hoare triple {11030#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11030#true} is VALID [2018-11-23 12:17:20,450 INFO L273 TraceCheckUtils]: 27: Hoare triple {11030#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11030#true} is VALID [2018-11-23 12:17:20,450 INFO L273 TraceCheckUtils]: 28: Hoare triple {11030#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11030#true} is VALID [2018-11-23 12:17:20,450 INFO L273 TraceCheckUtils]: 29: Hoare triple {11030#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11030#true} is VALID [2018-11-23 12:17:20,450 INFO L273 TraceCheckUtils]: 30: Hoare triple {11030#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11030#true} is VALID [2018-11-23 12:17:20,450 INFO L273 TraceCheckUtils]: 31: Hoare triple {11030#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11030#true} is VALID [2018-11-23 12:17:20,450 INFO L273 TraceCheckUtils]: 32: Hoare triple {11030#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11030#true} is VALID [2018-11-23 12:17:20,450 INFO L273 TraceCheckUtils]: 33: Hoare triple {11030#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11030#true} is VALID [2018-11-23 12:17:20,450 INFO L273 TraceCheckUtils]: 34: Hoare triple {11030#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11030#true} is VALID [2018-11-23 12:17:20,450 INFO L273 TraceCheckUtils]: 35: Hoare triple {11030#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11030#true} is VALID [2018-11-23 12:17:20,451 INFO L273 TraceCheckUtils]: 36: Hoare triple {11030#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11030#true} is VALID [2018-11-23 12:17:20,451 INFO L273 TraceCheckUtils]: 37: Hoare triple {11030#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11030#true} is VALID [2018-11-23 12:17:20,451 INFO L273 TraceCheckUtils]: 38: Hoare triple {11030#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11030#true} is VALID [2018-11-23 12:17:20,451 INFO L273 TraceCheckUtils]: 39: Hoare triple {11030#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11030#true} is VALID [2018-11-23 12:17:20,451 INFO L273 TraceCheckUtils]: 40: Hoare triple {11030#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11030#true} is VALID [2018-11-23 12:17:20,451 INFO L273 TraceCheckUtils]: 41: Hoare triple {11030#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11030#true} is VALID [2018-11-23 12:17:20,451 INFO L273 TraceCheckUtils]: 42: Hoare triple {11030#true} assume !(~i~1 < 60); {11030#true} is VALID [2018-11-23 12:17:20,451 INFO L256 TraceCheckUtils]: 43: Hoare triple {11030#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {11030#true} is VALID [2018-11-23 12:17:20,451 INFO L273 TraceCheckUtils]: 44: Hoare triple {11030#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {11030#true} is VALID [2018-11-23 12:17:20,452 INFO L273 TraceCheckUtils]: 45: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,452 INFO L273 TraceCheckUtils]: 46: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,452 INFO L273 TraceCheckUtils]: 47: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,452 INFO L273 TraceCheckUtils]: 48: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,452 INFO L273 TraceCheckUtils]: 49: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,452 INFO L273 TraceCheckUtils]: 50: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,452 INFO L273 TraceCheckUtils]: 51: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,452 INFO L273 TraceCheckUtils]: 52: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,452 INFO L273 TraceCheckUtils]: 53: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,453 INFO L273 TraceCheckUtils]: 54: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,453 INFO L273 TraceCheckUtils]: 55: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,453 INFO L273 TraceCheckUtils]: 56: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,453 INFO L273 TraceCheckUtils]: 57: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,453 INFO L273 TraceCheckUtils]: 58: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,453 INFO L273 TraceCheckUtils]: 59: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,453 INFO L273 TraceCheckUtils]: 60: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,453 INFO L273 TraceCheckUtils]: 61: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,454 INFO L273 TraceCheckUtils]: 62: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,454 INFO L273 TraceCheckUtils]: 63: Hoare triple {11030#true} assume !(~i~0 < 60); {11030#true} is VALID [2018-11-23 12:17:20,454 INFO L273 TraceCheckUtils]: 64: Hoare triple {11030#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11030#true} is VALID [2018-11-23 12:17:20,454 INFO L273 TraceCheckUtils]: 65: Hoare triple {11030#true} assume true; {11030#true} is VALID [2018-11-23 12:17:20,454 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {11030#true} {11030#true} #75#return; {11030#true} is VALID [2018-11-23 12:17:20,454 INFO L273 TraceCheckUtils]: 67: Hoare triple {11030#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {11030#true} is VALID [2018-11-23 12:17:20,454 INFO L256 TraceCheckUtils]: 68: Hoare triple {11030#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {11030#true} is VALID [2018-11-23 12:17:20,454 INFO L273 TraceCheckUtils]: 69: Hoare triple {11030#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {11030#true} is VALID [2018-11-23 12:17:20,454 INFO L273 TraceCheckUtils]: 70: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,455 INFO L273 TraceCheckUtils]: 71: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,455 INFO L273 TraceCheckUtils]: 72: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,455 INFO L273 TraceCheckUtils]: 73: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,455 INFO L273 TraceCheckUtils]: 74: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,455 INFO L273 TraceCheckUtils]: 75: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,455 INFO L273 TraceCheckUtils]: 76: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,455 INFO L273 TraceCheckUtils]: 77: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,455 INFO L273 TraceCheckUtils]: 78: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,456 INFO L273 TraceCheckUtils]: 79: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,456 INFO L273 TraceCheckUtils]: 80: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,456 INFO L273 TraceCheckUtils]: 81: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,456 INFO L273 TraceCheckUtils]: 82: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,456 INFO L273 TraceCheckUtils]: 83: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,456 INFO L273 TraceCheckUtils]: 84: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,456 INFO L273 TraceCheckUtils]: 85: Hoare triple {11030#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11030#true} is VALID [2018-11-23 12:17:20,456 INFO L273 TraceCheckUtils]: 86: Hoare triple {11030#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11030#true} is VALID [2018-11-23 12:17:20,456 INFO L273 TraceCheckUtils]: 87: Hoare triple {11030#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11030#true} is VALID [2018-11-23 12:17:20,457 INFO L273 TraceCheckUtils]: 88: Hoare triple {11030#true} assume !(~i~0 < 60); {11030#true} is VALID [2018-11-23 12:17:20,457 INFO L273 TraceCheckUtils]: 89: Hoare triple {11030#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11030#true} is VALID [2018-11-23 12:17:20,457 INFO L273 TraceCheckUtils]: 90: Hoare triple {11030#true} assume true; {11030#true} is VALID [2018-11-23 12:17:20,457 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {11030#true} {11030#true} #77#return; {11030#true} is VALID [2018-11-23 12:17:20,457 INFO L273 TraceCheckUtils]: 92: Hoare triple {11030#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {11330#(<= main_~i~2 0)} is VALID [2018-11-23 12:17:20,458 INFO L273 TraceCheckUtils]: 93: Hoare triple {11330#(<= main_~i~2 0)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11330#(<= main_~i~2 0)} is VALID [2018-11-23 12:17:20,458 INFO L273 TraceCheckUtils]: 94: Hoare triple {11330#(<= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11337#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:20,459 INFO L273 TraceCheckUtils]: 95: Hoare triple {11337#(<= main_~i~2 1)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11337#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:20,459 INFO L273 TraceCheckUtils]: 96: Hoare triple {11337#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11344#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:20,459 INFO L273 TraceCheckUtils]: 97: Hoare triple {11344#(<= main_~i~2 2)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11344#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:20,460 INFO L273 TraceCheckUtils]: 98: Hoare triple {11344#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11351#(<= main_~i~2 3)} is VALID [2018-11-23 12:17:20,460 INFO L273 TraceCheckUtils]: 99: Hoare triple {11351#(<= main_~i~2 3)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11351#(<= main_~i~2 3)} is VALID [2018-11-23 12:17:20,461 INFO L273 TraceCheckUtils]: 100: Hoare triple {11351#(<= main_~i~2 3)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11358#(<= main_~i~2 4)} is VALID [2018-11-23 12:17:20,462 INFO L273 TraceCheckUtils]: 101: Hoare triple {11358#(<= main_~i~2 4)} assume !(~i~2 < 59); {11031#false} is VALID [2018-11-23 12:17:20,462 INFO L273 TraceCheckUtils]: 102: Hoare triple {11031#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {11031#false} is VALID [2018-11-23 12:17:20,462 INFO L256 TraceCheckUtils]: 103: Hoare triple {11031#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {11031#false} is VALID [2018-11-23 12:17:20,462 INFO L273 TraceCheckUtils]: 104: Hoare triple {11031#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {11031#false} is VALID [2018-11-23 12:17:20,462 INFO L273 TraceCheckUtils]: 105: Hoare triple {11031#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11031#false} is VALID [2018-11-23 12:17:20,463 INFO L273 TraceCheckUtils]: 106: Hoare triple {11031#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11031#false} is VALID [2018-11-23 12:17:20,463 INFO L273 TraceCheckUtils]: 107: Hoare triple {11031#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11031#false} is VALID [2018-11-23 12:17:20,463 INFO L273 TraceCheckUtils]: 108: Hoare triple {11031#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11031#false} is VALID [2018-11-23 12:17:20,463 INFO L273 TraceCheckUtils]: 109: Hoare triple {11031#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11031#false} is VALID [2018-11-23 12:17:20,463 INFO L273 TraceCheckUtils]: 110: Hoare triple {11031#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11031#false} is VALID [2018-11-23 12:17:20,464 INFO L273 TraceCheckUtils]: 111: Hoare triple {11031#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11031#false} is VALID [2018-11-23 12:17:20,464 INFO L273 TraceCheckUtils]: 112: Hoare triple {11031#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11031#false} is VALID [2018-11-23 12:17:20,464 INFO L273 TraceCheckUtils]: 113: Hoare triple {11031#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11031#false} is VALID [2018-11-23 12:17:20,464 INFO L273 TraceCheckUtils]: 114: Hoare triple {11031#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11031#false} is VALID [2018-11-23 12:17:20,464 INFO L273 TraceCheckUtils]: 115: Hoare triple {11031#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11031#false} is VALID [2018-11-23 12:17:20,465 INFO L273 TraceCheckUtils]: 116: Hoare triple {11031#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11031#false} is VALID [2018-11-23 12:17:20,465 INFO L273 TraceCheckUtils]: 117: Hoare triple {11031#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11031#false} is VALID [2018-11-23 12:17:20,465 INFO L273 TraceCheckUtils]: 118: Hoare triple {11031#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11031#false} is VALID [2018-11-23 12:17:20,465 INFO L273 TraceCheckUtils]: 119: Hoare triple {11031#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11031#false} is VALID [2018-11-23 12:17:20,465 INFO L273 TraceCheckUtils]: 120: Hoare triple {11031#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11031#false} is VALID [2018-11-23 12:17:20,465 INFO L273 TraceCheckUtils]: 121: Hoare triple {11031#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11031#false} is VALID [2018-11-23 12:17:20,466 INFO L273 TraceCheckUtils]: 122: Hoare triple {11031#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11031#false} is VALID [2018-11-23 12:17:20,466 INFO L273 TraceCheckUtils]: 123: Hoare triple {11031#false} assume !(~i~0 < 60); {11031#false} is VALID [2018-11-23 12:17:20,466 INFO L273 TraceCheckUtils]: 124: Hoare triple {11031#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11031#false} is VALID [2018-11-23 12:17:20,466 INFO L273 TraceCheckUtils]: 125: Hoare triple {11031#false} assume true; {11031#false} is VALID [2018-11-23 12:17:20,466 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {11031#false} {11031#false} #79#return; {11031#false} is VALID [2018-11-23 12:17:20,466 INFO L273 TraceCheckUtils]: 127: Hoare triple {11031#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {11031#false} is VALID [2018-11-23 12:17:20,467 INFO L273 TraceCheckUtils]: 128: Hoare triple {11031#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {11031#false} is VALID [2018-11-23 12:17:20,467 INFO L273 TraceCheckUtils]: 129: Hoare triple {11031#false} assume !false; {11031#false} is VALID [2018-11-23 12:17:20,473 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 250 proven. 16 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2018-11-23 12:17:20,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:20,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7] total 26 [2018-11-23 12:17:20,492 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2018-11-23 12:17:20,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:20,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:17:20,603 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:20,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:17:20,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:17:20,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:17:20,605 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 26 states. [2018-11-23 12:17:21,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:21,249 INFO L93 Difference]: Finished difference Result 133 states and 154 transitions. [2018-11-23 12:17:21,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:17:21,249 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2018-11-23 12:17:21,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:21,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:17:21,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 105 transitions. [2018-11-23 12:17:21,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:17:21,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 105 transitions. [2018-11-23 12:17:21,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 105 transitions. [2018-11-23 12:17:21,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:21,356 INFO L225 Difference]: With dead ends: 133 [2018-11-23 12:17:21,356 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 12:17:21,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:17:21,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 12:17:21,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2018-11-23 12:17:21,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:21,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 89 states. [2018-11-23 12:17:21,388 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 89 states. [2018-11-23 12:17:21,388 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 89 states. [2018-11-23 12:17:21,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:21,390 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-11-23 12:17:21,390 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-11-23 12:17:21,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:21,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:21,391 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 91 states. [2018-11-23 12:17:21,391 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 91 states. [2018-11-23 12:17:21,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:21,393 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-11-23 12:17:21,393 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-11-23 12:17:21,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:21,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:21,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:21,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:21,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 12:17:21,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-11-23 12:17:21,396 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 130 [2018-11-23 12:17:21,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:21,396 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-11-23 12:17:21,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:17:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-11-23 12:17:21,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-23 12:17:21,397 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:21,397 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:17:21,398 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:21,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:21,398 INFO L82 PathProgramCache]: Analyzing trace with hash 2079637010, now seen corresponding path program 19 times [2018-11-23 12:17:21,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:21,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:21,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:21,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:21,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:21,860 INFO L256 TraceCheckUtils]: 0: Hoare triple {11947#true} call ULTIMATE.init(); {11947#true} is VALID [2018-11-23 12:17:21,860 INFO L273 TraceCheckUtils]: 1: Hoare triple {11947#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11947#true} is VALID [2018-11-23 12:17:21,860 INFO L273 TraceCheckUtils]: 2: Hoare triple {11947#true} assume true; {11947#true} is VALID [2018-11-23 12:17:21,860 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11947#true} {11947#true} #71#return; {11947#true} is VALID [2018-11-23 12:17:21,860 INFO L256 TraceCheckUtils]: 4: Hoare triple {11947#true} call #t~ret14 := main(); {11947#true} is VALID [2018-11-23 12:17:21,862 INFO L273 TraceCheckUtils]: 5: Hoare triple {11947#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {11949#(= main_~i~1 0)} is VALID [2018-11-23 12:17:21,862 INFO L273 TraceCheckUtils]: 6: Hoare triple {11949#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11949#(= main_~i~1 0)} is VALID [2018-11-23 12:17:21,863 INFO L273 TraceCheckUtils]: 7: Hoare triple {11949#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11950#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:21,863 INFO L273 TraceCheckUtils]: 8: Hoare triple {11950#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11950#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:21,864 INFO L273 TraceCheckUtils]: 9: Hoare triple {11950#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11951#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:21,864 INFO L273 TraceCheckUtils]: 10: Hoare triple {11951#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11951#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:21,864 INFO L273 TraceCheckUtils]: 11: Hoare triple {11951#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11952#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:21,865 INFO L273 TraceCheckUtils]: 12: Hoare triple {11952#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11952#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:21,866 INFO L273 TraceCheckUtils]: 13: Hoare triple {11952#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11953#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:21,866 INFO L273 TraceCheckUtils]: 14: Hoare triple {11953#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11953#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:21,867 INFO L273 TraceCheckUtils]: 15: Hoare triple {11953#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11954#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:21,867 INFO L273 TraceCheckUtils]: 16: Hoare triple {11954#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11954#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:21,868 INFO L273 TraceCheckUtils]: 17: Hoare triple {11954#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11955#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:21,868 INFO L273 TraceCheckUtils]: 18: Hoare triple {11955#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11955#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:21,869 INFO L273 TraceCheckUtils]: 19: Hoare triple {11955#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11956#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:21,870 INFO L273 TraceCheckUtils]: 20: Hoare triple {11956#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11956#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:21,870 INFO L273 TraceCheckUtils]: 21: Hoare triple {11956#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11957#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:21,871 INFO L273 TraceCheckUtils]: 22: Hoare triple {11957#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11957#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:21,872 INFO L273 TraceCheckUtils]: 23: Hoare triple {11957#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11958#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:21,872 INFO L273 TraceCheckUtils]: 24: Hoare triple {11958#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11958#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:21,873 INFO L273 TraceCheckUtils]: 25: Hoare triple {11958#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11959#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:21,873 INFO L273 TraceCheckUtils]: 26: Hoare triple {11959#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11959#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:21,874 INFO L273 TraceCheckUtils]: 27: Hoare triple {11959#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11960#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:21,874 INFO L273 TraceCheckUtils]: 28: Hoare triple {11960#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11960#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:21,875 INFO L273 TraceCheckUtils]: 29: Hoare triple {11960#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11961#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:21,876 INFO L273 TraceCheckUtils]: 30: Hoare triple {11961#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11961#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:21,876 INFO L273 TraceCheckUtils]: 31: Hoare triple {11961#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11962#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:21,877 INFO L273 TraceCheckUtils]: 32: Hoare triple {11962#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11962#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:21,878 INFO L273 TraceCheckUtils]: 33: Hoare triple {11962#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11963#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:21,878 INFO L273 TraceCheckUtils]: 34: Hoare triple {11963#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11963#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:21,879 INFO L273 TraceCheckUtils]: 35: Hoare triple {11963#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11964#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:21,879 INFO L273 TraceCheckUtils]: 36: Hoare triple {11964#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11964#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:21,880 INFO L273 TraceCheckUtils]: 37: Hoare triple {11964#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11965#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:21,880 INFO L273 TraceCheckUtils]: 38: Hoare triple {11965#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11965#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:21,881 INFO L273 TraceCheckUtils]: 39: Hoare triple {11965#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11966#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:21,882 INFO L273 TraceCheckUtils]: 40: Hoare triple {11966#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11966#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:21,882 INFO L273 TraceCheckUtils]: 41: Hoare triple {11966#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11967#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:21,883 INFO L273 TraceCheckUtils]: 42: Hoare triple {11967#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11967#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:21,883 INFO L273 TraceCheckUtils]: 43: Hoare triple {11967#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11968#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:21,884 INFO L273 TraceCheckUtils]: 44: Hoare triple {11968#(<= main_~i~1 19)} assume !(~i~1 < 60); {11948#false} is VALID [2018-11-23 12:17:21,884 INFO L256 TraceCheckUtils]: 45: Hoare triple {11948#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {11947#true} is VALID [2018-11-23 12:17:21,885 INFO L273 TraceCheckUtils]: 46: Hoare triple {11947#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {11947#true} is VALID [2018-11-23 12:17:21,885 INFO L273 TraceCheckUtils]: 47: Hoare triple {11947#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11947#true} is VALID [2018-11-23 12:17:21,885 INFO L273 TraceCheckUtils]: 48: Hoare triple {11947#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11947#true} is VALID [2018-11-23 12:17:21,885 INFO L273 TraceCheckUtils]: 49: Hoare triple {11947#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11947#true} is VALID [2018-11-23 12:17:21,885 INFO L273 TraceCheckUtils]: 50: Hoare triple {11947#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11947#true} is VALID [2018-11-23 12:17:21,885 INFO L273 TraceCheckUtils]: 51: Hoare triple {11947#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11947#true} is VALID [2018-11-23 12:17:21,886 INFO L273 TraceCheckUtils]: 52: Hoare triple {11947#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11947#true} is VALID [2018-11-23 12:17:21,886 INFO L273 TraceCheckUtils]: 53: Hoare triple {11947#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11947#true} is VALID [2018-11-23 12:17:21,886 INFO L273 TraceCheckUtils]: 54: Hoare triple {11947#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11947#true} is VALID [2018-11-23 12:17:21,886 INFO L273 TraceCheckUtils]: 55: Hoare triple {11947#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11947#true} is VALID [2018-11-23 12:17:21,886 INFO L273 TraceCheckUtils]: 56: Hoare triple {11947#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11947#true} is VALID [2018-11-23 12:17:21,887 INFO L273 TraceCheckUtils]: 57: Hoare triple {11947#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11947#true} is VALID [2018-11-23 12:17:21,887 INFO L273 TraceCheckUtils]: 58: Hoare triple {11947#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11947#true} is VALID [2018-11-23 12:17:21,887 INFO L273 TraceCheckUtils]: 59: Hoare triple {11947#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11947#true} is VALID [2018-11-23 12:17:21,887 INFO L273 TraceCheckUtils]: 60: Hoare triple {11947#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11947#true} is VALID [2018-11-23 12:17:21,887 INFO L273 TraceCheckUtils]: 61: Hoare triple {11947#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11947#true} is VALID [2018-11-23 12:17:21,887 INFO L273 TraceCheckUtils]: 62: Hoare triple {11947#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11947#true} is VALID [2018-11-23 12:17:21,888 INFO L273 TraceCheckUtils]: 63: Hoare triple {11947#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11947#true} is VALID [2018-11-23 12:17:21,888 INFO L273 TraceCheckUtils]: 64: Hoare triple {11947#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11947#true} is VALID [2018-11-23 12:17:21,888 INFO L273 TraceCheckUtils]: 65: Hoare triple {11947#true} assume !(~i~0 < 60); {11947#true} is VALID [2018-11-23 12:17:21,888 INFO L273 TraceCheckUtils]: 66: Hoare triple {11947#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11947#true} is VALID [2018-11-23 12:17:21,888 INFO L273 TraceCheckUtils]: 67: Hoare triple {11947#true} assume true; {11947#true} is VALID [2018-11-23 12:17:21,888 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {11947#true} {11948#false} #75#return; {11948#false} is VALID [2018-11-23 12:17:21,888 INFO L273 TraceCheckUtils]: 69: Hoare triple {11948#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {11948#false} is VALID [2018-11-23 12:17:21,889 INFO L256 TraceCheckUtils]: 70: Hoare triple {11948#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {11947#true} is VALID [2018-11-23 12:17:21,889 INFO L273 TraceCheckUtils]: 71: Hoare triple {11947#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {11947#true} is VALID [2018-11-23 12:17:21,889 INFO L273 TraceCheckUtils]: 72: Hoare triple {11947#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11947#true} is VALID [2018-11-23 12:17:21,889 INFO L273 TraceCheckUtils]: 73: Hoare triple {11947#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11947#true} is VALID [2018-11-23 12:17:21,889 INFO L273 TraceCheckUtils]: 74: Hoare triple {11947#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11947#true} is VALID [2018-11-23 12:17:21,889 INFO L273 TraceCheckUtils]: 75: Hoare triple {11947#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11947#true} is VALID [2018-11-23 12:17:21,889 INFO L273 TraceCheckUtils]: 76: Hoare triple {11947#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11947#true} is VALID [2018-11-23 12:17:21,889 INFO L273 TraceCheckUtils]: 77: Hoare triple {11947#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11947#true} is VALID [2018-11-23 12:17:21,889 INFO L273 TraceCheckUtils]: 78: Hoare triple {11947#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11947#true} is VALID [2018-11-23 12:17:21,890 INFO L273 TraceCheckUtils]: 79: Hoare triple {11947#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11947#true} is VALID [2018-11-23 12:17:21,890 INFO L273 TraceCheckUtils]: 80: Hoare triple {11947#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11947#true} is VALID [2018-11-23 12:17:21,890 INFO L273 TraceCheckUtils]: 81: Hoare triple {11947#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11947#true} is VALID [2018-11-23 12:17:21,890 INFO L273 TraceCheckUtils]: 82: Hoare triple {11947#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11947#true} is VALID [2018-11-23 12:17:21,890 INFO L273 TraceCheckUtils]: 83: Hoare triple {11947#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11947#true} is VALID [2018-11-23 12:17:21,890 INFO L273 TraceCheckUtils]: 84: Hoare triple {11947#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11947#true} is VALID [2018-11-23 12:17:21,890 INFO L273 TraceCheckUtils]: 85: Hoare triple {11947#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11947#true} is VALID [2018-11-23 12:17:21,890 INFO L273 TraceCheckUtils]: 86: Hoare triple {11947#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11947#true} is VALID [2018-11-23 12:17:21,890 INFO L273 TraceCheckUtils]: 87: Hoare triple {11947#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11947#true} is VALID [2018-11-23 12:17:21,891 INFO L273 TraceCheckUtils]: 88: Hoare triple {11947#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11947#true} is VALID [2018-11-23 12:17:21,891 INFO L273 TraceCheckUtils]: 89: Hoare triple {11947#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11947#true} is VALID [2018-11-23 12:17:21,891 INFO L273 TraceCheckUtils]: 90: Hoare triple {11947#true} assume !(~i~0 < 60); {11947#true} is VALID [2018-11-23 12:17:21,891 INFO L273 TraceCheckUtils]: 91: Hoare triple {11947#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11947#true} is VALID [2018-11-23 12:17:21,891 INFO L273 TraceCheckUtils]: 92: Hoare triple {11947#true} assume true; {11947#true} is VALID [2018-11-23 12:17:21,891 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {11947#true} {11948#false} #77#return; {11948#false} is VALID [2018-11-23 12:17:21,891 INFO L273 TraceCheckUtils]: 94: Hoare triple {11948#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {11948#false} is VALID [2018-11-23 12:17:21,891 INFO L273 TraceCheckUtils]: 95: Hoare triple {11948#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11948#false} is VALID [2018-11-23 12:17:21,891 INFO L273 TraceCheckUtils]: 96: Hoare triple {11948#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11948#false} is VALID [2018-11-23 12:17:21,892 INFO L273 TraceCheckUtils]: 97: Hoare triple {11948#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11948#false} is VALID [2018-11-23 12:17:21,892 INFO L273 TraceCheckUtils]: 98: Hoare triple {11948#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11948#false} is VALID [2018-11-23 12:17:21,892 INFO L273 TraceCheckUtils]: 99: Hoare triple {11948#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11948#false} is VALID [2018-11-23 12:17:21,892 INFO L273 TraceCheckUtils]: 100: Hoare triple {11948#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11948#false} is VALID [2018-11-23 12:17:21,892 INFO L273 TraceCheckUtils]: 101: Hoare triple {11948#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11948#false} is VALID [2018-11-23 12:17:21,892 INFO L273 TraceCheckUtils]: 102: Hoare triple {11948#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11948#false} is VALID [2018-11-23 12:17:21,892 INFO L273 TraceCheckUtils]: 103: Hoare triple {11948#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11948#false} is VALID [2018-11-23 12:17:21,892 INFO L273 TraceCheckUtils]: 104: Hoare triple {11948#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11948#false} is VALID [2018-11-23 12:17:21,892 INFO L273 TraceCheckUtils]: 105: Hoare triple {11948#false} assume !(~i~2 < 59); {11948#false} is VALID [2018-11-23 12:17:21,893 INFO L273 TraceCheckUtils]: 106: Hoare triple {11948#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {11948#false} is VALID [2018-11-23 12:17:21,893 INFO L256 TraceCheckUtils]: 107: Hoare triple {11948#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {11947#true} is VALID [2018-11-23 12:17:21,893 INFO L273 TraceCheckUtils]: 108: Hoare triple {11947#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {11947#true} is VALID [2018-11-23 12:17:21,893 INFO L273 TraceCheckUtils]: 109: Hoare triple {11947#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11947#true} is VALID [2018-11-23 12:17:21,893 INFO L273 TraceCheckUtils]: 110: Hoare triple {11947#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11947#true} is VALID [2018-11-23 12:17:21,893 INFO L273 TraceCheckUtils]: 111: Hoare triple {11947#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11947#true} is VALID [2018-11-23 12:17:21,893 INFO L273 TraceCheckUtils]: 112: Hoare triple {11947#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11947#true} is VALID [2018-11-23 12:17:21,893 INFO L273 TraceCheckUtils]: 113: Hoare triple {11947#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11947#true} is VALID [2018-11-23 12:17:21,894 INFO L273 TraceCheckUtils]: 114: Hoare triple {11947#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11947#true} is VALID [2018-11-23 12:17:21,894 INFO L273 TraceCheckUtils]: 115: Hoare triple {11947#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11947#true} is VALID [2018-11-23 12:17:21,894 INFO L273 TraceCheckUtils]: 116: Hoare triple {11947#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11947#true} is VALID [2018-11-23 12:17:21,894 INFO L273 TraceCheckUtils]: 117: Hoare triple {11947#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11947#true} is VALID [2018-11-23 12:17:21,894 INFO L273 TraceCheckUtils]: 118: Hoare triple {11947#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11947#true} is VALID [2018-11-23 12:17:21,894 INFO L273 TraceCheckUtils]: 119: Hoare triple {11947#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11947#true} is VALID [2018-11-23 12:17:21,894 INFO L273 TraceCheckUtils]: 120: Hoare triple {11947#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11947#true} is VALID [2018-11-23 12:17:21,894 INFO L273 TraceCheckUtils]: 121: Hoare triple {11947#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11947#true} is VALID [2018-11-23 12:17:21,894 INFO L273 TraceCheckUtils]: 122: Hoare triple {11947#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11947#true} is VALID [2018-11-23 12:17:21,895 INFO L273 TraceCheckUtils]: 123: Hoare triple {11947#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11947#true} is VALID [2018-11-23 12:17:21,895 INFO L273 TraceCheckUtils]: 124: Hoare triple {11947#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11947#true} is VALID [2018-11-23 12:17:21,895 INFO L273 TraceCheckUtils]: 125: Hoare triple {11947#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11947#true} is VALID [2018-11-23 12:17:21,895 INFO L273 TraceCheckUtils]: 126: Hoare triple {11947#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11947#true} is VALID [2018-11-23 12:17:21,895 INFO L273 TraceCheckUtils]: 127: Hoare triple {11947#true} assume !(~i~0 < 60); {11947#true} is VALID [2018-11-23 12:17:21,895 INFO L273 TraceCheckUtils]: 128: Hoare triple {11947#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11947#true} is VALID [2018-11-23 12:17:21,895 INFO L273 TraceCheckUtils]: 129: Hoare triple {11947#true} assume true; {11947#true} is VALID [2018-11-23 12:17:21,895 INFO L268 TraceCheckUtils]: 130: Hoare quadruple {11947#true} {11948#false} #79#return; {11948#false} is VALID [2018-11-23 12:17:21,895 INFO L273 TraceCheckUtils]: 131: Hoare triple {11948#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {11948#false} is VALID [2018-11-23 12:17:21,896 INFO L273 TraceCheckUtils]: 132: Hoare triple {11948#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {11948#false} is VALID [2018-11-23 12:17:21,896 INFO L273 TraceCheckUtils]: 133: Hoare triple {11948#false} assume !false; {11948#false} is VALID [2018-11-23 12:17:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2018-11-23 12:17:21,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:21,904 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:17:21,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:17:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:22,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:22,291 INFO L256 TraceCheckUtils]: 0: Hoare triple {11947#true} call ULTIMATE.init(); {11947#true} is VALID [2018-11-23 12:17:22,291 INFO L273 TraceCheckUtils]: 1: Hoare triple {11947#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11947#true} is VALID [2018-11-23 12:17:22,292 INFO L273 TraceCheckUtils]: 2: Hoare triple {11947#true} assume true; {11947#true} is VALID [2018-11-23 12:17:22,292 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11947#true} {11947#true} #71#return; {11947#true} is VALID [2018-11-23 12:17:22,292 INFO L256 TraceCheckUtils]: 4: Hoare triple {11947#true} call #t~ret14 := main(); {11947#true} is VALID [2018-11-23 12:17:22,293 INFO L273 TraceCheckUtils]: 5: Hoare triple {11947#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {11987#(<= main_~i~1 0)} is VALID [2018-11-23 12:17:22,294 INFO L273 TraceCheckUtils]: 6: Hoare triple {11987#(<= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11987#(<= main_~i~1 0)} is VALID [2018-11-23 12:17:22,294 INFO L273 TraceCheckUtils]: 7: Hoare triple {11987#(<= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11950#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:22,295 INFO L273 TraceCheckUtils]: 8: Hoare triple {11950#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11950#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:22,295 INFO L273 TraceCheckUtils]: 9: Hoare triple {11950#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11951#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:22,295 INFO L273 TraceCheckUtils]: 10: Hoare triple {11951#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11951#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:22,296 INFO L273 TraceCheckUtils]: 11: Hoare triple {11951#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11952#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:22,297 INFO L273 TraceCheckUtils]: 12: Hoare triple {11952#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11952#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:22,298 INFO L273 TraceCheckUtils]: 13: Hoare triple {11952#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11953#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:22,298 INFO L273 TraceCheckUtils]: 14: Hoare triple {11953#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11953#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:22,299 INFO L273 TraceCheckUtils]: 15: Hoare triple {11953#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11954#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:22,300 INFO L273 TraceCheckUtils]: 16: Hoare triple {11954#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11954#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:22,301 INFO L273 TraceCheckUtils]: 17: Hoare triple {11954#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11955#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:22,301 INFO L273 TraceCheckUtils]: 18: Hoare triple {11955#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11955#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:22,302 INFO L273 TraceCheckUtils]: 19: Hoare triple {11955#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11956#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:22,303 INFO L273 TraceCheckUtils]: 20: Hoare triple {11956#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11956#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:22,304 INFO L273 TraceCheckUtils]: 21: Hoare triple {11956#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11957#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:22,304 INFO L273 TraceCheckUtils]: 22: Hoare triple {11957#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11957#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:22,305 INFO L273 TraceCheckUtils]: 23: Hoare triple {11957#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11958#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:22,306 INFO L273 TraceCheckUtils]: 24: Hoare triple {11958#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11958#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:22,307 INFO L273 TraceCheckUtils]: 25: Hoare triple {11958#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11959#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:22,307 INFO L273 TraceCheckUtils]: 26: Hoare triple {11959#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11959#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:22,308 INFO L273 TraceCheckUtils]: 27: Hoare triple {11959#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11960#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:22,309 INFO L273 TraceCheckUtils]: 28: Hoare triple {11960#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11960#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:22,310 INFO L273 TraceCheckUtils]: 29: Hoare triple {11960#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11961#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:22,310 INFO L273 TraceCheckUtils]: 30: Hoare triple {11961#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11961#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:22,311 INFO L273 TraceCheckUtils]: 31: Hoare triple {11961#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11962#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:22,331 INFO L273 TraceCheckUtils]: 32: Hoare triple {11962#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11962#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:22,340 INFO L273 TraceCheckUtils]: 33: Hoare triple {11962#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11963#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:22,352 INFO L273 TraceCheckUtils]: 34: Hoare triple {11963#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11963#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:22,367 INFO L273 TraceCheckUtils]: 35: Hoare triple {11963#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11964#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:22,376 INFO L273 TraceCheckUtils]: 36: Hoare triple {11964#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11964#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:22,385 INFO L273 TraceCheckUtils]: 37: Hoare triple {11964#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11965#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:22,399 INFO L273 TraceCheckUtils]: 38: Hoare triple {11965#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11965#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:22,408 INFO L273 TraceCheckUtils]: 39: Hoare triple {11965#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11966#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:22,420 INFO L273 TraceCheckUtils]: 40: Hoare triple {11966#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11966#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:22,434 INFO L273 TraceCheckUtils]: 41: Hoare triple {11966#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11967#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:22,444 INFO L273 TraceCheckUtils]: 42: Hoare triple {11967#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11967#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:22,455 INFO L273 TraceCheckUtils]: 43: Hoare triple {11967#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11968#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:22,471 INFO L273 TraceCheckUtils]: 44: Hoare triple {11968#(<= main_~i~1 19)} assume !(~i~1 < 60); {11948#false} is VALID [2018-11-23 12:17:22,471 INFO L256 TraceCheckUtils]: 45: Hoare triple {11948#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {11948#false} is VALID [2018-11-23 12:17:22,471 INFO L273 TraceCheckUtils]: 46: Hoare triple {11948#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {11948#false} is VALID [2018-11-23 12:17:22,472 INFO L273 TraceCheckUtils]: 47: Hoare triple {11948#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11948#false} is VALID [2018-11-23 12:17:22,472 INFO L273 TraceCheckUtils]: 48: Hoare triple {11948#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11948#false} is VALID [2018-11-23 12:17:22,472 INFO L273 TraceCheckUtils]: 49: Hoare triple {11948#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11948#false} is VALID [2018-11-23 12:17:22,472 INFO L273 TraceCheckUtils]: 50: Hoare triple {11948#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11948#false} is VALID [2018-11-23 12:17:22,472 INFO L273 TraceCheckUtils]: 51: Hoare triple {11948#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11948#false} is VALID [2018-11-23 12:17:22,473 INFO L273 TraceCheckUtils]: 52: Hoare triple {11948#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11948#false} is VALID [2018-11-23 12:17:22,473 INFO L273 TraceCheckUtils]: 53: Hoare triple {11948#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11948#false} is VALID [2018-11-23 12:17:22,473 INFO L273 TraceCheckUtils]: 54: Hoare triple {11948#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11948#false} is VALID [2018-11-23 12:17:22,473 INFO L273 TraceCheckUtils]: 55: Hoare triple {11948#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11948#false} is VALID [2018-11-23 12:17:22,474 INFO L273 TraceCheckUtils]: 56: Hoare triple {11948#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11948#false} is VALID [2018-11-23 12:17:22,474 INFO L273 TraceCheckUtils]: 57: Hoare triple {11948#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11948#false} is VALID [2018-11-23 12:17:22,474 INFO L273 TraceCheckUtils]: 58: Hoare triple {11948#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11948#false} is VALID [2018-11-23 12:17:22,474 INFO L273 TraceCheckUtils]: 59: Hoare triple {11948#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11948#false} is VALID [2018-11-23 12:17:22,475 INFO L273 TraceCheckUtils]: 60: Hoare triple {11948#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11948#false} is VALID [2018-11-23 12:17:22,475 INFO L273 TraceCheckUtils]: 61: Hoare triple {11948#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11948#false} is VALID [2018-11-23 12:17:22,475 INFO L273 TraceCheckUtils]: 62: Hoare triple {11948#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11948#false} is VALID [2018-11-23 12:17:22,475 INFO L273 TraceCheckUtils]: 63: Hoare triple {11948#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11948#false} is VALID [2018-11-23 12:17:22,476 INFO L273 TraceCheckUtils]: 64: Hoare triple {11948#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11948#false} is VALID [2018-11-23 12:17:22,476 INFO L273 TraceCheckUtils]: 65: Hoare triple {11948#false} assume !(~i~0 < 60); {11948#false} is VALID [2018-11-23 12:17:22,476 INFO L273 TraceCheckUtils]: 66: Hoare triple {11948#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11948#false} is VALID [2018-11-23 12:17:22,476 INFO L273 TraceCheckUtils]: 67: Hoare triple {11948#false} assume true; {11948#false} is VALID [2018-11-23 12:17:22,477 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {11948#false} {11948#false} #75#return; {11948#false} is VALID [2018-11-23 12:17:22,477 INFO L273 TraceCheckUtils]: 69: Hoare triple {11948#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {11948#false} is VALID [2018-11-23 12:17:22,477 INFO L256 TraceCheckUtils]: 70: Hoare triple {11948#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {11948#false} is VALID [2018-11-23 12:17:22,477 INFO L273 TraceCheckUtils]: 71: Hoare triple {11948#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {11948#false} is VALID [2018-11-23 12:17:22,477 INFO L273 TraceCheckUtils]: 72: Hoare triple {11948#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11948#false} is VALID [2018-11-23 12:17:22,478 INFO L273 TraceCheckUtils]: 73: Hoare triple {11948#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11948#false} is VALID [2018-11-23 12:17:22,478 INFO L273 TraceCheckUtils]: 74: Hoare triple {11948#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11948#false} is VALID [2018-11-23 12:17:22,478 INFO L273 TraceCheckUtils]: 75: Hoare triple {11948#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11948#false} is VALID [2018-11-23 12:17:22,478 INFO L273 TraceCheckUtils]: 76: Hoare triple {11948#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11948#false} is VALID [2018-11-23 12:17:22,479 INFO L273 TraceCheckUtils]: 77: Hoare triple {11948#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11948#false} is VALID [2018-11-23 12:17:22,479 INFO L273 TraceCheckUtils]: 78: Hoare triple {11948#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11948#false} is VALID [2018-11-23 12:17:22,479 INFO L273 TraceCheckUtils]: 79: Hoare triple {11948#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11948#false} is VALID [2018-11-23 12:17:22,479 INFO L273 TraceCheckUtils]: 80: Hoare triple {11948#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11948#false} is VALID [2018-11-23 12:17:22,479 INFO L273 TraceCheckUtils]: 81: Hoare triple {11948#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11948#false} is VALID [2018-11-23 12:17:22,480 INFO L273 TraceCheckUtils]: 82: Hoare triple {11948#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11948#false} is VALID [2018-11-23 12:17:22,480 INFO L273 TraceCheckUtils]: 83: Hoare triple {11948#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11948#false} is VALID [2018-11-23 12:17:22,480 INFO L273 TraceCheckUtils]: 84: Hoare triple {11948#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11948#false} is VALID [2018-11-23 12:17:22,480 INFO L273 TraceCheckUtils]: 85: Hoare triple {11948#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11948#false} is VALID [2018-11-23 12:17:22,480 INFO L273 TraceCheckUtils]: 86: Hoare triple {11948#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11948#false} is VALID [2018-11-23 12:17:22,481 INFO L273 TraceCheckUtils]: 87: Hoare triple {11948#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11948#false} is VALID [2018-11-23 12:17:22,481 INFO L273 TraceCheckUtils]: 88: Hoare triple {11948#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11948#false} is VALID [2018-11-23 12:17:22,481 INFO L273 TraceCheckUtils]: 89: Hoare triple {11948#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11948#false} is VALID [2018-11-23 12:17:22,481 INFO L273 TraceCheckUtils]: 90: Hoare triple {11948#false} assume !(~i~0 < 60); {11948#false} is VALID [2018-11-23 12:17:22,481 INFO L273 TraceCheckUtils]: 91: Hoare triple {11948#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11948#false} is VALID [2018-11-23 12:17:22,482 INFO L273 TraceCheckUtils]: 92: Hoare triple {11948#false} assume true; {11948#false} is VALID [2018-11-23 12:17:22,482 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {11948#false} {11948#false} #77#return; {11948#false} is VALID [2018-11-23 12:17:22,482 INFO L273 TraceCheckUtils]: 94: Hoare triple {11948#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {11948#false} is VALID [2018-11-23 12:17:22,482 INFO L273 TraceCheckUtils]: 95: Hoare triple {11948#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11948#false} is VALID [2018-11-23 12:17:22,482 INFO L273 TraceCheckUtils]: 96: Hoare triple {11948#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11948#false} is VALID [2018-11-23 12:17:22,483 INFO L273 TraceCheckUtils]: 97: Hoare triple {11948#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11948#false} is VALID [2018-11-23 12:17:22,483 INFO L273 TraceCheckUtils]: 98: Hoare triple {11948#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11948#false} is VALID [2018-11-23 12:17:22,483 INFO L273 TraceCheckUtils]: 99: Hoare triple {11948#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11948#false} is VALID [2018-11-23 12:17:22,483 INFO L273 TraceCheckUtils]: 100: Hoare triple {11948#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11948#false} is VALID [2018-11-23 12:17:22,483 INFO L273 TraceCheckUtils]: 101: Hoare triple {11948#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11948#false} is VALID [2018-11-23 12:17:22,484 INFO L273 TraceCheckUtils]: 102: Hoare triple {11948#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11948#false} is VALID [2018-11-23 12:17:22,484 INFO L273 TraceCheckUtils]: 103: Hoare triple {11948#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11948#false} is VALID [2018-11-23 12:17:22,484 INFO L273 TraceCheckUtils]: 104: Hoare triple {11948#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11948#false} is VALID [2018-11-23 12:17:22,484 INFO L273 TraceCheckUtils]: 105: Hoare triple {11948#false} assume !(~i~2 < 59); {11948#false} is VALID [2018-11-23 12:17:22,484 INFO L273 TraceCheckUtils]: 106: Hoare triple {11948#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {11948#false} is VALID [2018-11-23 12:17:22,485 INFO L256 TraceCheckUtils]: 107: Hoare triple {11948#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {11948#false} is VALID [2018-11-23 12:17:22,485 INFO L273 TraceCheckUtils]: 108: Hoare triple {11948#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {11948#false} is VALID [2018-11-23 12:17:22,485 INFO L273 TraceCheckUtils]: 109: Hoare triple {11948#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11948#false} is VALID [2018-11-23 12:17:22,485 INFO L273 TraceCheckUtils]: 110: Hoare triple {11948#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11948#false} is VALID [2018-11-23 12:17:22,485 INFO L273 TraceCheckUtils]: 111: Hoare triple {11948#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11948#false} is VALID [2018-11-23 12:17:22,486 INFO L273 TraceCheckUtils]: 112: Hoare triple {11948#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11948#false} is VALID [2018-11-23 12:17:22,486 INFO L273 TraceCheckUtils]: 113: Hoare triple {11948#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11948#false} is VALID [2018-11-23 12:17:22,486 INFO L273 TraceCheckUtils]: 114: Hoare triple {11948#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11948#false} is VALID [2018-11-23 12:17:22,486 INFO L273 TraceCheckUtils]: 115: Hoare triple {11948#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11948#false} is VALID [2018-11-23 12:17:22,486 INFO L273 TraceCheckUtils]: 116: Hoare triple {11948#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11948#false} is VALID [2018-11-23 12:17:22,487 INFO L273 TraceCheckUtils]: 117: Hoare triple {11948#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11948#false} is VALID [2018-11-23 12:17:22,487 INFO L273 TraceCheckUtils]: 118: Hoare triple {11948#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11948#false} is VALID [2018-11-23 12:17:22,487 INFO L273 TraceCheckUtils]: 119: Hoare triple {11948#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11948#false} is VALID [2018-11-23 12:17:22,487 INFO L273 TraceCheckUtils]: 120: Hoare triple {11948#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11948#false} is VALID [2018-11-23 12:17:22,487 INFO L273 TraceCheckUtils]: 121: Hoare triple {11948#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11948#false} is VALID [2018-11-23 12:17:22,488 INFO L273 TraceCheckUtils]: 122: Hoare triple {11948#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11948#false} is VALID [2018-11-23 12:17:22,488 INFO L273 TraceCheckUtils]: 123: Hoare triple {11948#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11948#false} is VALID [2018-11-23 12:17:22,488 INFO L273 TraceCheckUtils]: 124: Hoare triple {11948#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11948#false} is VALID [2018-11-23 12:17:22,488 INFO L273 TraceCheckUtils]: 125: Hoare triple {11948#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11948#false} is VALID [2018-11-23 12:17:22,488 INFO L273 TraceCheckUtils]: 126: Hoare triple {11948#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11948#false} is VALID [2018-11-23 12:17:22,489 INFO L273 TraceCheckUtils]: 127: Hoare triple {11948#false} assume !(~i~0 < 60); {11948#false} is VALID [2018-11-23 12:17:22,489 INFO L273 TraceCheckUtils]: 128: Hoare triple {11948#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11948#false} is VALID [2018-11-23 12:17:22,489 INFO L273 TraceCheckUtils]: 129: Hoare triple {11948#false} assume true; {11948#false} is VALID [2018-11-23 12:17:22,489 INFO L268 TraceCheckUtils]: 130: Hoare quadruple {11948#false} {11948#false} #79#return; {11948#false} is VALID [2018-11-23 12:17:22,489 INFO L273 TraceCheckUtils]: 131: Hoare triple {11948#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {11948#false} is VALID [2018-11-23 12:17:22,490 INFO L273 TraceCheckUtils]: 132: Hoare triple {11948#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {11948#false} is VALID [2018-11-23 12:17:22,490 INFO L273 TraceCheckUtils]: 133: Hoare triple {11948#false} assume !false; {11948#false} is VALID [2018-11-23 12:17:22,512 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2018-11-23 12:17:22,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:22,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 12:17:22,543 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 134 [2018-11-23 12:17:22,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:22,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:17:22,740 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:22,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:17:22,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:17:22,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:17:22,742 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 23 states. [2018-11-23 12:17:22,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:22,979 INFO L93 Difference]: Finished difference Result 136 states and 156 transitions. [2018-11-23 12:17:22,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:17:22,979 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 134 [2018-11-23 12:17:22,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:22,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:17:22,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 96 transitions. [2018-11-23 12:17:22,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:17:22,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 96 transitions. [2018-11-23 12:17:22,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 96 transitions. [2018-11-23 12:17:23,066 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:23,069 INFO L225 Difference]: With dead ends: 136 [2018-11-23 12:17:23,069 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 12:17:23,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:17:23,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 12:17:23,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-11-23 12:17:23,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:23,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 91 states. [2018-11-23 12:17:23,113 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 91 states. [2018-11-23 12:17:23,113 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 91 states. [2018-11-23 12:17:23,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:23,114 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-11-23 12:17:23,114 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2018-11-23 12:17:23,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:23,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:23,115 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 92 states. [2018-11-23 12:17:23,115 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 92 states. [2018-11-23 12:17:23,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:23,117 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-11-23 12:17:23,117 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2018-11-23 12:17:23,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:23,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:23,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:23,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:23,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 12:17:23,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2018-11-23 12:17:23,120 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 134 [2018-11-23 12:17:23,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:23,120 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2018-11-23 12:17:23,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:17:23,120 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-11-23 12:17:23,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-23 12:17:23,121 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:23,121 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 18, 18, 18, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:17:23,122 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:23,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:23,122 INFO L82 PathProgramCache]: Analyzing trace with hash 275415092, now seen corresponding path program 20 times [2018-11-23 12:17:23,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:23,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:23,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:23,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:17:23,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:24,007 INFO L256 TraceCheckUtils]: 0: Hoare triple {12883#true} call ULTIMATE.init(); {12883#true} is VALID [2018-11-23 12:17:24,007 INFO L273 TraceCheckUtils]: 1: Hoare triple {12883#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12883#true} is VALID [2018-11-23 12:17:24,008 INFO L273 TraceCheckUtils]: 2: Hoare triple {12883#true} assume true; {12883#true} is VALID [2018-11-23 12:17:24,008 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12883#true} {12883#true} #71#return; {12883#true} is VALID [2018-11-23 12:17:24,008 INFO L256 TraceCheckUtils]: 4: Hoare triple {12883#true} call #t~ret14 := main(); {12883#true} is VALID [2018-11-23 12:17:24,009 INFO L273 TraceCheckUtils]: 5: Hoare triple {12883#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {12885#(= main_~i~1 0)} is VALID [2018-11-23 12:17:24,009 INFO L273 TraceCheckUtils]: 6: Hoare triple {12885#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12885#(= main_~i~1 0)} is VALID [2018-11-23 12:17:24,010 INFO L273 TraceCheckUtils]: 7: Hoare triple {12885#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12886#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:24,010 INFO L273 TraceCheckUtils]: 8: Hoare triple {12886#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12886#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:24,011 INFO L273 TraceCheckUtils]: 9: Hoare triple {12886#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12887#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:24,011 INFO L273 TraceCheckUtils]: 10: Hoare triple {12887#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12887#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:24,011 INFO L273 TraceCheckUtils]: 11: Hoare triple {12887#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12888#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:24,012 INFO L273 TraceCheckUtils]: 12: Hoare triple {12888#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12888#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:24,012 INFO L273 TraceCheckUtils]: 13: Hoare triple {12888#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12889#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:24,013 INFO L273 TraceCheckUtils]: 14: Hoare triple {12889#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12889#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:24,013 INFO L273 TraceCheckUtils]: 15: Hoare triple {12889#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12890#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:24,014 INFO L273 TraceCheckUtils]: 16: Hoare triple {12890#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12890#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:24,015 INFO L273 TraceCheckUtils]: 17: Hoare triple {12890#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12891#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:24,015 INFO L273 TraceCheckUtils]: 18: Hoare triple {12891#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12891#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:24,019 INFO L273 TraceCheckUtils]: 19: Hoare triple {12891#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12892#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:24,020 INFO L273 TraceCheckUtils]: 20: Hoare triple {12892#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12892#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:24,020 INFO L273 TraceCheckUtils]: 21: Hoare triple {12892#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12893#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:24,020 INFO L273 TraceCheckUtils]: 22: Hoare triple {12893#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12893#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:24,021 INFO L273 TraceCheckUtils]: 23: Hoare triple {12893#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12894#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:24,021 INFO L273 TraceCheckUtils]: 24: Hoare triple {12894#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12894#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:24,022 INFO L273 TraceCheckUtils]: 25: Hoare triple {12894#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12895#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:24,022 INFO L273 TraceCheckUtils]: 26: Hoare triple {12895#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12895#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:24,023 INFO L273 TraceCheckUtils]: 27: Hoare triple {12895#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12896#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:24,023 INFO L273 TraceCheckUtils]: 28: Hoare triple {12896#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12896#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:24,024 INFO L273 TraceCheckUtils]: 29: Hoare triple {12896#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12897#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:24,025 INFO L273 TraceCheckUtils]: 30: Hoare triple {12897#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12897#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:24,025 INFO L273 TraceCheckUtils]: 31: Hoare triple {12897#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12898#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:24,026 INFO L273 TraceCheckUtils]: 32: Hoare triple {12898#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12898#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:24,026 INFO L273 TraceCheckUtils]: 33: Hoare triple {12898#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12899#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:24,027 INFO L273 TraceCheckUtils]: 34: Hoare triple {12899#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12899#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:24,029 INFO L273 TraceCheckUtils]: 35: Hoare triple {12899#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12900#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:24,029 INFO L273 TraceCheckUtils]: 36: Hoare triple {12900#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12900#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:24,030 INFO L273 TraceCheckUtils]: 37: Hoare triple {12900#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12901#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:24,030 INFO L273 TraceCheckUtils]: 38: Hoare triple {12901#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12901#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:24,031 INFO L273 TraceCheckUtils]: 39: Hoare triple {12901#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12902#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:24,031 INFO L273 TraceCheckUtils]: 40: Hoare triple {12902#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12902#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:24,031 INFO L273 TraceCheckUtils]: 41: Hoare triple {12902#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12903#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:24,032 INFO L273 TraceCheckUtils]: 42: Hoare triple {12903#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12903#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:24,032 INFO L273 TraceCheckUtils]: 43: Hoare triple {12903#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12904#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:24,033 INFO L273 TraceCheckUtils]: 44: Hoare triple {12904#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12904#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:24,034 INFO L273 TraceCheckUtils]: 45: Hoare triple {12904#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12905#(<= main_~i~1 20)} is VALID [2018-11-23 12:17:24,034 INFO L273 TraceCheckUtils]: 46: Hoare triple {12905#(<= main_~i~1 20)} assume !(~i~1 < 60); {12884#false} is VALID [2018-11-23 12:17:24,035 INFO L256 TraceCheckUtils]: 47: Hoare triple {12884#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {12883#true} is VALID [2018-11-23 12:17:24,035 INFO L273 TraceCheckUtils]: 48: Hoare triple {12883#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {12883#true} is VALID [2018-11-23 12:17:24,035 INFO L273 TraceCheckUtils]: 49: Hoare triple {12883#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12883#true} is VALID [2018-11-23 12:17:24,035 INFO L273 TraceCheckUtils]: 50: Hoare triple {12883#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12883#true} is VALID [2018-11-23 12:17:24,035 INFO L273 TraceCheckUtils]: 51: Hoare triple {12883#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12883#true} is VALID [2018-11-23 12:17:24,036 INFO L273 TraceCheckUtils]: 52: Hoare triple {12883#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12883#true} is VALID [2018-11-23 12:17:24,036 INFO L273 TraceCheckUtils]: 53: Hoare triple {12883#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12883#true} is VALID [2018-11-23 12:17:24,036 INFO L273 TraceCheckUtils]: 54: Hoare triple {12883#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12883#true} is VALID [2018-11-23 12:17:24,036 INFO L273 TraceCheckUtils]: 55: Hoare triple {12883#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12883#true} is VALID [2018-11-23 12:17:24,037 INFO L273 TraceCheckUtils]: 56: Hoare triple {12883#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12883#true} is VALID [2018-11-23 12:17:24,037 INFO L273 TraceCheckUtils]: 57: Hoare triple {12883#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12883#true} is VALID [2018-11-23 12:17:24,037 INFO L273 TraceCheckUtils]: 58: Hoare triple {12883#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12883#true} is VALID [2018-11-23 12:17:24,037 INFO L273 TraceCheckUtils]: 59: Hoare triple {12883#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12883#true} is VALID [2018-11-23 12:17:24,038 INFO L273 TraceCheckUtils]: 60: Hoare triple {12883#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12883#true} is VALID [2018-11-23 12:17:24,038 INFO L273 TraceCheckUtils]: 61: Hoare triple {12883#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12883#true} is VALID [2018-11-23 12:17:24,038 INFO L273 TraceCheckUtils]: 62: Hoare triple {12883#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12883#true} is VALID [2018-11-23 12:17:24,038 INFO L273 TraceCheckUtils]: 63: Hoare triple {12883#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12883#true} is VALID [2018-11-23 12:17:24,038 INFO L273 TraceCheckUtils]: 64: Hoare triple {12883#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12883#true} is VALID [2018-11-23 12:17:24,038 INFO L273 TraceCheckUtils]: 65: Hoare triple {12883#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12883#true} is VALID [2018-11-23 12:17:24,039 INFO L273 TraceCheckUtils]: 66: Hoare triple {12883#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12883#true} is VALID [2018-11-23 12:17:24,039 INFO L273 TraceCheckUtils]: 67: Hoare triple {12883#true} assume !(~i~0 < 60); {12883#true} is VALID [2018-11-23 12:17:24,039 INFO L273 TraceCheckUtils]: 68: Hoare triple {12883#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12883#true} is VALID [2018-11-23 12:17:24,039 INFO L273 TraceCheckUtils]: 69: Hoare triple {12883#true} assume true; {12883#true} is VALID [2018-11-23 12:17:24,039 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {12883#true} {12884#false} #75#return; {12884#false} is VALID [2018-11-23 12:17:24,039 INFO L273 TraceCheckUtils]: 71: Hoare triple {12884#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {12884#false} is VALID [2018-11-23 12:17:24,040 INFO L256 TraceCheckUtils]: 72: Hoare triple {12884#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {12883#true} is VALID [2018-11-23 12:17:24,040 INFO L273 TraceCheckUtils]: 73: Hoare triple {12883#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {12883#true} is VALID [2018-11-23 12:17:24,040 INFO L273 TraceCheckUtils]: 74: Hoare triple {12883#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12883#true} is VALID [2018-11-23 12:17:24,040 INFO L273 TraceCheckUtils]: 75: Hoare triple {12883#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12883#true} is VALID [2018-11-23 12:17:24,040 INFO L273 TraceCheckUtils]: 76: Hoare triple {12883#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12883#true} is VALID [2018-11-23 12:17:24,040 INFO L273 TraceCheckUtils]: 77: Hoare triple {12883#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12883#true} is VALID [2018-11-23 12:17:24,041 INFO L273 TraceCheckUtils]: 78: Hoare triple {12883#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12883#true} is VALID [2018-11-23 12:17:24,041 INFO L273 TraceCheckUtils]: 79: Hoare triple {12883#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12883#true} is VALID [2018-11-23 12:17:24,041 INFO L273 TraceCheckUtils]: 80: Hoare triple {12883#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12883#true} is VALID [2018-11-23 12:17:24,041 INFO L273 TraceCheckUtils]: 81: Hoare triple {12883#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12883#true} is VALID [2018-11-23 12:17:24,041 INFO L273 TraceCheckUtils]: 82: Hoare triple {12883#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12883#true} is VALID [2018-11-23 12:17:24,041 INFO L273 TraceCheckUtils]: 83: Hoare triple {12883#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12883#true} is VALID [2018-11-23 12:17:24,041 INFO L273 TraceCheckUtils]: 84: Hoare triple {12883#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12883#true} is VALID [2018-11-23 12:17:24,042 INFO L273 TraceCheckUtils]: 85: Hoare triple {12883#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12883#true} is VALID [2018-11-23 12:17:24,042 INFO L273 TraceCheckUtils]: 86: Hoare triple {12883#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12883#true} is VALID [2018-11-23 12:17:24,042 INFO L273 TraceCheckUtils]: 87: Hoare triple {12883#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12883#true} is VALID [2018-11-23 12:17:24,042 INFO L273 TraceCheckUtils]: 88: Hoare triple {12883#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12883#true} is VALID [2018-11-23 12:17:24,042 INFO L273 TraceCheckUtils]: 89: Hoare triple {12883#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12883#true} is VALID [2018-11-23 12:17:24,042 INFO L273 TraceCheckUtils]: 90: Hoare triple {12883#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12883#true} is VALID [2018-11-23 12:17:24,042 INFO L273 TraceCheckUtils]: 91: Hoare triple {12883#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12883#true} is VALID [2018-11-23 12:17:24,042 INFO L273 TraceCheckUtils]: 92: Hoare triple {12883#true} assume !(~i~0 < 60); {12883#true} is VALID [2018-11-23 12:17:24,043 INFO L273 TraceCheckUtils]: 93: Hoare triple {12883#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12883#true} is VALID [2018-11-23 12:17:24,043 INFO L273 TraceCheckUtils]: 94: Hoare triple {12883#true} assume true; {12883#true} is VALID [2018-11-23 12:17:24,043 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {12883#true} {12884#false} #77#return; {12884#false} is VALID [2018-11-23 12:17:24,043 INFO L273 TraceCheckUtils]: 96: Hoare triple {12884#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {12884#false} is VALID [2018-11-23 12:17:24,043 INFO L273 TraceCheckUtils]: 97: Hoare triple {12884#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12884#false} is VALID [2018-11-23 12:17:24,043 INFO L273 TraceCheckUtils]: 98: Hoare triple {12884#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12884#false} is VALID [2018-11-23 12:17:24,043 INFO L273 TraceCheckUtils]: 99: Hoare triple {12884#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12884#false} is VALID [2018-11-23 12:17:24,043 INFO L273 TraceCheckUtils]: 100: Hoare triple {12884#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12884#false} is VALID [2018-11-23 12:17:24,044 INFO L273 TraceCheckUtils]: 101: Hoare triple {12884#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12884#false} is VALID [2018-11-23 12:17:24,044 INFO L273 TraceCheckUtils]: 102: Hoare triple {12884#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12884#false} is VALID [2018-11-23 12:17:24,044 INFO L273 TraceCheckUtils]: 103: Hoare triple {12884#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12884#false} is VALID [2018-11-23 12:17:24,044 INFO L273 TraceCheckUtils]: 104: Hoare triple {12884#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12884#false} is VALID [2018-11-23 12:17:24,044 INFO L273 TraceCheckUtils]: 105: Hoare triple {12884#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12884#false} is VALID [2018-11-23 12:17:24,044 INFO L273 TraceCheckUtils]: 106: Hoare triple {12884#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12884#false} is VALID [2018-11-23 12:17:24,044 INFO L273 TraceCheckUtils]: 107: Hoare triple {12884#false} assume !(~i~2 < 59); {12884#false} is VALID [2018-11-23 12:17:24,044 INFO L273 TraceCheckUtils]: 108: Hoare triple {12884#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {12884#false} is VALID [2018-11-23 12:17:24,044 INFO L256 TraceCheckUtils]: 109: Hoare triple {12884#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {12883#true} is VALID [2018-11-23 12:17:24,044 INFO L273 TraceCheckUtils]: 110: Hoare triple {12883#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {12883#true} is VALID [2018-11-23 12:17:24,045 INFO L273 TraceCheckUtils]: 111: Hoare triple {12883#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12883#true} is VALID [2018-11-23 12:17:24,045 INFO L273 TraceCheckUtils]: 112: Hoare triple {12883#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12883#true} is VALID [2018-11-23 12:17:24,045 INFO L273 TraceCheckUtils]: 113: Hoare triple {12883#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12883#true} is VALID [2018-11-23 12:17:24,045 INFO L273 TraceCheckUtils]: 114: Hoare triple {12883#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12883#true} is VALID [2018-11-23 12:17:24,045 INFO L273 TraceCheckUtils]: 115: Hoare triple {12883#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12883#true} is VALID [2018-11-23 12:17:24,045 INFO L273 TraceCheckUtils]: 116: Hoare triple {12883#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12883#true} is VALID [2018-11-23 12:17:24,046 INFO L273 TraceCheckUtils]: 117: Hoare triple {12883#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12883#true} is VALID [2018-11-23 12:17:24,046 INFO L273 TraceCheckUtils]: 118: Hoare triple {12883#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12883#true} is VALID [2018-11-23 12:17:24,046 INFO L273 TraceCheckUtils]: 119: Hoare triple {12883#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12883#true} is VALID [2018-11-23 12:17:24,046 INFO L273 TraceCheckUtils]: 120: Hoare triple {12883#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12883#true} is VALID [2018-11-23 12:17:24,046 INFO L273 TraceCheckUtils]: 121: Hoare triple {12883#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12883#true} is VALID [2018-11-23 12:17:24,046 INFO L273 TraceCheckUtils]: 122: Hoare triple {12883#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12883#true} is VALID [2018-11-23 12:17:24,047 INFO L273 TraceCheckUtils]: 123: Hoare triple {12883#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12883#true} is VALID [2018-11-23 12:17:24,047 INFO L273 TraceCheckUtils]: 124: Hoare triple {12883#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12883#true} is VALID [2018-11-23 12:17:24,047 INFO L273 TraceCheckUtils]: 125: Hoare triple {12883#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12883#true} is VALID [2018-11-23 12:17:24,047 INFO L273 TraceCheckUtils]: 126: Hoare triple {12883#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12883#true} is VALID [2018-11-23 12:17:24,047 INFO L273 TraceCheckUtils]: 127: Hoare triple {12883#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12883#true} is VALID [2018-11-23 12:17:24,047 INFO L273 TraceCheckUtils]: 128: Hoare triple {12883#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12883#true} is VALID [2018-11-23 12:17:24,048 INFO L273 TraceCheckUtils]: 129: Hoare triple {12883#true} assume !(~i~0 < 60); {12883#true} is VALID [2018-11-23 12:17:24,048 INFO L273 TraceCheckUtils]: 130: Hoare triple {12883#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12883#true} is VALID [2018-11-23 12:17:24,048 INFO L273 TraceCheckUtils]: 131: Hoare triple {12883#true} assume true; {12883#true} is VALID [2018-11-23 12:17:24,048 INFO L268 TraceCheckUtils]: 132: Hoare quadruple {12883#true} {12884#false} #79#return; {12884#false} is VALID [2018-11-23 12:17:24,048 INFO L273 TraceCheckUtils]: 133: Hoare triple {12884#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {12884#false} is VALID [2018-11-23 12:17:24,048 INFO L273 TraceCheckUtils]: 134: Hoare triple {12884#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {12884#false} is VALID [2018-11-23 12:17:24,049 INFO L273 TraceCheckUtils]: 135: Hoare triple {12884#false} assume !false; {12884#false} is VALID [2018-11-23 12:17:24,059 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2018-11-23 12:17:24,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:24,059 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:17:24,074 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:17:24,144 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:17:24,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:24,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:24,383 INFO L256 TraceCheckUtils]: 0: Hoare triple {12883#true} call ULTIMATE.init(); {12883#true} is VALID [2018-11-23 12:17:24,383 INFO L273 TraceCheckUtils]: 1: Hoare triple {12883#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12883#true} is VALID [2018-11-23 12:17:24,384 INFO L273 TraceCheckUtils]: 2: Hoare triple {12883#true} assume true; {12883#true} is VALID [2018-11-23 12:17:24,384 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12883#true} {12883#true} #71#return; {12883#true} is VALID [2018-11-23 12:17:24,384 INFO L256 TraceCheckUtils]: 4: Hoare triple {12883#true} call #t~ret14 := main(); {12883#true} is VALID [2018-11-23 12:17:24,385 INFO L273 TraceCheckUtils]: 5: Hoare triple {12883#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {12924#(<= main_~i~1 0)} is VALID [2018-11-23 12:17:24,385 INFO L273 TraceCheckUtils]: 6: Hoare triple {12924#(<= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12924#(<= main_~i~1 0)} is VALID [2018-11-23 12:17:24,386 INFO L273 TraceCheckUtils]: 7: Hoare triple {12924#(<= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12886#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:24,386 INFO L273 TraceCheckUtils]: 8: Hoare triple {12886#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12886#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:24,387 INFO L273 TraceCheckUtils]: 9: Hoare triple {12886#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12887#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:24,387 INFO L273 TraceCheckUtils]: 10: Hoare triple {12887#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12887#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:24,387 INFO L273 TraceCheckUtils]: 11: Hoare triple {12887#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12888#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:24,388 INFO L273 TraceCheckUtils]: 12: Hoare triple {12888#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12888#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:24,389 INFO L273 TraceCheckUtils]: 13: Hoare triple {12888#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12889#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:24,389 INFO L273 TraceCheckUtils]: 14: Hoare triple {12889#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12889#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:24,390 INFO L273 TraceCheckUtils]: 15: Hoare triple {12889#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12890#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:24,390 INFO L273 TraceCheckUtils]: 16: Hoare triple {12890#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12890#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:24,391 INFO L273 TraceCheckUtils]: 17: Hoare triple {12890#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12891#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:24,391 INFO L273 TraceCheckUtils]: 18: Hoare triple {12891#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12891#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:24,392 INFO L273 TraceCheckUtils]: 19: Hoare triple {12891#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12892#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:24,393 INFO L273 TraceCheckUtils]: 20: Hoare triple {12892#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12892#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:24,393 INFO L273 TraceCheckUtils]: 21: Hoare triple {12892#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12893#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:24,394 INFO L273 TraceCheckUtils]: 22: Hoare triple {12893#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12893#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:24,394 INFO L273 TraceCheckUtils]: 23: Hoare triple {12893#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12894#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:24,395 INFO L273 TraceCheckUtils]: 24: Hoare triple {12894#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12894#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:24,396 INFO L273 TraceCheckUtils]: 25: Hoare triple {12894#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12895#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:24,396 INFO L273 TraceCheckUtils]: 26: Hoare triple {12895#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12895#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:24,397 INFO L273 TraceCheckUtils]: 27: Hoare triple {12895#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12896#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:24,397 INFO L273 TraceCheckUtils]: 28: Hoare triple {12896#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12896#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:24,398 INFO L273 TraceCheckUtils]: 29: Hoare triple {12896#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12897#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:24,398 INFO L273 TraceCheckUtils]: 30: Hoare triple {12897#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12897#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:24,399 INFO L273 TraceCheckUtils]: 31: Hoare triple {12897#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12898#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:24,400 INFO L273 TraceCheckUtils]: 32: Hoare triple {12898#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12898#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:24,400 INFO L273 TraceCheckUtils]: 33: Hoare triple {12898#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12899#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:24,401 INFO L273 TraceCheckUtils]: 34: Hoare triple {12899#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12899#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:24,402 INFO L273 TraceCheckUtils]: 35: Hoare triple {12899#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12900#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:24,402 INFO L273 TraceCheckUtils]: 36: Hoare triple {12900#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12900#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:24,403 INFO L273 TraceCheckUtils]: 37: Hoare triple {12900#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12901#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:24,403 INFO L273 TraceCheckUtils]: 38: Hoare triple {12901#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12901#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:24,404 INFO L273 TraceCheckUtils]: 39: Hoare triple {12901#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12902#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:24,404 INFO L273 TraceCheckUtils]: 40: Hoare triple {12902#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12902#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:24,405 INFO L273 TraceCheckUtils]: 41: Hoare triple {12902#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12903#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:24,406 INFO L273 TraceCheckUtils]: 42: Hoare triple {12903#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12903#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:24,406 INFO L273 TraceCheckUtils]: 43: Hoare triple {12903#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12904#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:24,411 INFO L273 TraceCheckUtils]: 44: Hoare triple {12904#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12904#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:24,412 INFO L273 TraceCheckUtils]: 45: Hoare triple {12904#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12905#(<= main_~i~1 20)} is VALID [2018-11-23 12:17:24,412 INFO L273 TraceCheckUtils]: 46: Hoare triple {12905#(<= main_~i~1 20)} assume !(~i~1 < 60); {12884#false} is VALID [2018-11-23 12:17:24,412 INFO L256 TraceCheckUtils]: 47: Hoare triple {12884#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {12884#false} is VALID [2018-11-23 12:17:24,413 INFO L273 TraceCheckUtils]: 48: Hoare triple {12884#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {12884#false} is VALID [2018-11-23 12:17:24,413 INFO L273 TraceCheckUtils]: 49: Hoare triple {12884#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12884#false} is VALID [2018-11-23 12:17:24,413 INFO L273 TraceCheckUtils]: 50: Hoare triple {12884#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12884#false} is VALID [2018-11-23 12:17:24,413 INFO L273 TraceCheckUtils]: 51: Hoare triple {12884#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12884#false} is VALID [2018-11-23 12:17:24,413 INFO L273 TraceCheckUtils]: 52: Hoare triple {12884#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12884#false} is VALID [2018-11-23 12:17:24,413 INFO L273 TraceCheckUtils]: 53: Hoare triple {12884#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12884#false} is VALID [2018-11-23 12:17:24,413 INFO L273 TraceCheckUtils]: 54: Hoare triple {12884#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12884#false} is VALID [2018-11-23 12:17:24,413 INFO L273 TraceCheckUtils]: 55: Hoare triple {12884#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12884#false} is VALID [2018-11-23 12:17:24,413 INFO L273 TraceCheckUtils]: 56: Hoare triple {12884#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12884#false} is VALID [2018-11-23 12:17:24,414 INFO L273 TraceCheckUtils]: 57: Hoare triple {12884#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12884#false} is VALID [2018-11-23 12:17:24,414 INFO L273 TraceCheckUtils]: 58: Hoare triple {12884#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12884#false} is VALID [2018-11-23 12:17:24,414 INFO L273 TraceCheckUtils]: 59: Hoare triple {12884#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12884#false} is VALID [2018-11-23 12:17:24,414 INFO L273 TraceCheckUtils]: 60: Hoare triple {12884#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12884#false} is VALID [2018-11-23 12:17:24,414 INFO L273 TraceCheckUtils]: 61: Hoare triple {12884#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12884#false} is VALID [2018-11-23 12:17:24,414 INFO L273 TraceCheckUtils]: 62: Hoare triple {12884#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12884#false} is VALID [2018-11-23 12:17:24,414 INFO L273 TraceCheckUtils]: 63: Hoare triple {12884#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12884#false} is VALID [2018-11-23 12:17:24,414 INFO L273 TraceCheckUtils]: 64: Hoare triple {12884#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12884#false} is VALID [2018-11-23 12:17:24,414 INFO L273 TraceCheckUtils]: 65: Hoare triple {12884#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12884#false} is VALID [2018-11-23 12:17:24,415 INFO L273 TraceCheckUtils]: 66: Hoare triple {12884#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12884#false} is VALID [2018-11-23 12:17:24,415 INFO L273 TraceCheckUtils]: 67: Hoare triple {12884#false} assume !(~i~0 < 60); {12884#false} is VALID [2018-11-23 12:17:24,415 INFO L273 TraceCheckUtils]: 68: Hoare triple {12884#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12884#false} is VALID [2018-11-23 12:17:24,415 INFO L273 TraceCheckUtils]: 69: Hoare triple {12884#false} assume true; {12884#false} is VALID [2018-11-23 12:17:24,415 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {12884#false} {12884#false} #75#return; {12884#false} is VALID [2018-11-23 12:17:24,415 INFO L273 TraceCheckUtils]: 71: Hoare triple {12884#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {12884#false} is VALID [2018-11-23 12:17:24,415 INFO L256 TraceCheckUtils]: 72: Hoare triple {12884#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {12884#false} is VALID [2018-11-23 12:17:24,415 INFO L273 TraceCheckUtils]: 73: Hoare triple {12884#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {12884#false} is VALID [2018-11-23 12:17:24,415 INFO L273 TraceCheckUtils]: 74: Hoare triple {12884#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12884#false} is VALID [2018-11-23 12:17:24,416 INFO L273 TraceCheckUtils]: 75: Hoare triple {12884#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12884#false} is VALID [2018-11-23 12:17:24,416 INFO L273 TraceCheckUtils]: 76: Hoare triple {12884#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12884#false} is VALID [2018-11-23 12:17:24,416 INFO L273 TraceCheckUtils]: 77: Hoare triple {12884#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12884#false} is VALID [2018-11-23 12:17:24,416 INFO L273 TraceCheckUtils]: 78: Hoare triple {12884#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12884#false} is VALID [2018-11-23 12:17:24,416 INFO L273 TraceCheckUtils]: 79: Hoare triple {12884#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12884#false} is VALID [2018-11-23 12:17:24,416 INFO L273 TraceCheckUtils]: 80: Hoare triple {12884#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12884#false} is VALID [2018-11-23 12:17:24,416 INFO L273 TraceCheckUtils]: 81: Hoare triple {12884#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12884#false} is VALID [2018-11-23 12:17:24,416 INFO L273 TraceCheckUtils]: 82: Hoare triple {12884#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12884#false} is VALID [2018-11-23 12:17:24,416 INFO L273 TraceCheckUtils]: 83: Hoare triple {12884#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12884#false} is VALID [2018-11-23 12:17:24,417 INFO L273 TraceCheckUtils]: 84: Hoare triple {12884#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12884#false} is VALID [2018-11-23 12:17:24,417 INFO L273 TraceCheckUtils]: 85: Hoare triple {12884#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12884#false} is VALID [2018-11-23 12:17:24,417 INFO L273 TraceCheckUtils]: 86: Hoare triple {12884#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12884#false} is VALID [2018-11-23 12:17:24,417 INFO L273 TraceCheckUtils]: 87: Hoare triple {12884#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12884#false} is VALID [2018-11-23 12:17:24,417 INFO L273 TraceCheckUtils]: 88: Hoare triple {12884#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12884#false} is VALID [2018-11-23 12:17:24,417 INFO L273 TraceCheckUtils]: 89: Hoare triple {12884#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12884#false} is VALID [2018-11-23 12:17:24,417 INFO L273 TraceCheckUtils]: 90: Hoare triple {12884#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12884#false} is VALID [2018-11-23 12:17:24,417 INFO L273 TraceCheckUtils]: 91: Hoare triple {12884#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12884#false} is VALID [2018-11-23 12:17:24,417 INFO L273 TraceCheckUtils]: 92: Hoare triple {12884#false} assume !(~i~0 < 60); {12884#false} is VALID [2018-11-23 12:17:24,418 INFO L273 TraceCheckUtils]: 93: Hoare triple {12884#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12884#false} is VALID [2018-11-23 12:17:24,418 INFO L273 TraceCheckUtils]: 94: Hoare triple {12884#false} assume true; {12884#false} is VALID [2018-11-23 12:17:24,418 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {12884#false} {12884#false} #77#return; {12884#false} is VALID [2018-11-23 12:17:24,418 INFO L273 TraceCheckUtils]: 96: Hoare triple {12884#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {12884#false} is VALID [2018-11-23 12:17:24,418 INFO L273 TraceCheckUtils]: 97: Hoare triple {12884#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12884#false} is VALID [2018-11-23 12:17:24,418 INFO L273 TraceCheckUtils]: 98: Hoare triple {12884#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12884#false} is VALID [2018-11-23 12:17:24,418 INFO L273 TraceCheckUtils]: 99: Hoare triple {12884#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12884#false} is VALID [2018-11-23 12:17:24,418 INFO L273 TraceCheckUtils]: 100: Hoare triple {12884#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12884#false} is VALID [2018-11-23 12:17:24,418 INFO L273 TraceCheckUtils]: 101: Hoare triple {12884#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12884#false} is VALID [2018-11-23 12:17:24,419 INFO L273 TraceCheckUtils]: 102: Hoare triple {12884#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12884#false} is VALID [2018-11-23 12:17:24,419 INFO L273 TraceCheckUtils]: 103: Hoare triple {12884#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12884#false} is VALID [2018-11-23 12:17:24,419 INFO L273 TraceCheckUtils]: 104: Hoare triple {12884#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12884#false} is VALID [2018-11-23 12:17:24,419 INFO L273 TraceCheckUtils]: 105: Hoare triple {12884#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12884#false} is VALID [2018-11-23 12:17:24,419 INFO L273 TraceCheckUtils]: 106: Hoare triple {12884#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12884#false} is VALID [2018-11-23 12:17:24,419 INFO L273 TraceCheckUtils]: 107: Hoare triple {12884#false} assume !(~i~2 < 59); {12884#false} is VALID [2018-11-23 12:17:24,419 INFO L273 TraceCheckUtils]: 108: Hoare triple {12884#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {12884#false} is VALID [2018-11-23 12:17:24,419 INFO L256 TraceCheckUtils]: 109: Hoare triple {12884#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {12884#false} is VALID [2018-11-23 12:17:24,419 INFO L273 TraceCheckUtils]: 110: Hoare triple {12884#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {12884#false} is VALID [2018-11-23 12:17:24,420 INFO L273 TraceCheckUtils]: 111: Hoare triple {12884#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12884#false} is VALID [2018-11-23 12:17:24,420 INFO L273 TraceCheckUtils]: 112: Hoare triple {12884#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12884#false} is VALID [2018-11-23 12:17:24,420 INFO L273 TraceCheckUtils]: 113: Hoare triple {12884#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12884#false} is VALID [2018-11-23 12:17:24,420 INFO L273 TraceCheckUtils]: 114: Hoare triple {12884#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12884#false} is VALID [2018-11-23 12:17:24,420 INFO L273 TraceCheckUtils]: 115: Hoare triple {12884#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12884#false} is VALID [2018-11-23 12:17:24,420 INFO L273 TraceCheckUtils]: 116: Hoare triple {12884#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12884#false} is VALID [2018-11-23 12:17:24,420 INFO L273 TraceCheckUtils]: 117: Hoare triple {12884#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12884#false} is VALID [2018-11-23 12:17:24,420 INFO L273 TraceCheckUtils]: 118: Hoare triple {12884#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12884#false} is VALID [2018-11-23 12:17:24,420 INFO L273 TraceCheckUtils]: 119: Hoare triple {12884#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12884#false} is VALID [2018-11-23 12:17:24,421 INFO L273 TraceCheckUtils]: 120: Hoare triple {12884#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12884#false} is VALID [2018-11-23 12:17:24,421 INFO L273 TraceCheckUtils]: 121: Hoare triple {12884#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12884#false} is VALID [2018-11-23 12:17:24,421 INFO L273 TraceCheckUtils]: 122: Hoare triple {12884#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12884#false} is VALID [2018-11-23 12:17:24,421 INFO L273 TraceCheckUtils]: 123: Hoare triple {12884#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12884#false} is VALID [2018-11-23 12:17:24,421 INFO L273 TraceCheckUtils]: 124: Hoare triple {12884#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12884#false} is VALID [2018-11-23 12:17:24,421 INFO L273 TraceCheckUtils]: 125: Hoare triple {12884#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12884#false} is VALID [2018-11-23 12:17:24,421 INFO L273 TraceCheckUtils]: 126: Hoare triple {12884#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12884#false} is VALID [2018-11-23 12:17:24,421 INFO L273 TraceCheckUtils]: 127: Hoare triple {12884#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12884#false} is VALID [2018-11-23 12:17:24,422 INFO L273 TraceCheckUtils]: 128: Hoare triple {12884#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12884#false} is VALID [2018-11-23 12:17:24,422 INFO L273 TraceCheckUtils]: 129: Hoare triple {12884#false} assume !(~i~0 < 60); {12884#false} is VALID [2018-11-23 12:17:24,422 INFO L273 TraceCheckUtils]: 130: Hoare triple {12884#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12884#false} is VALID [2018-11-23 12:17:24,422 INFO L273 TraceCheckUtils]: 131: Hoare triple {12884#false} assume true; {12884#false} is VALID [2018-11-23 12:17:24,422 INFO L268 TraceCheckUtils]: 132: Hoare quadruple {12884#false} {12884#false} #79#return; {12884#false} is VALID [2018-11-23 12:17:24,422 INFO L273 TraceCheckUtils]: 133: Hoare triple {12884#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {12884#false} is VALID [2018-11-23 12:17:24,423 INFO L273 TraceCheckUtils]: 134: Hoare triple {12884#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {12884#false} is VALID [2018-11-23 12:17:24,423 INFO L273 TraceCheckUtils]: 135: Hoare triple {12884#false} assume !false; {12884#false} is VALID [2018-11-23 12:17:24,433 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2018-11-23 12:17:24,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:24,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 12:17:24,452 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 136 [2018-11-23 12:17:24,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:24,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:17:24,647 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-23 12:17:24,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:17:24,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:17:24,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:17:24,648 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 24 states. [2018-11-23 12:17:25,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:25,042 INFO L93 Difference]: Finished difference Result 138 states and 158 transitions. [2018-11-23 12:17:25,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:17:25,043 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 136 [2018-11-23 12:17:25,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:25,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:17:25,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 98 transitions. [2018-11-23 12:17:25,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:17:25,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 98 transitions. [2018-11-23 12:17:25,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 98 transitions. [2018-11-23 12:17:25,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:25,136 INFO L225 Difference]: With dead ends: 138 [2018-11-23 12:17:25,136 INFO L226 Difference]: Without dead ends: 94 [2018-11-23 12:17:25,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:17:25,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-23 12:17:25,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-11-23 12:17:25,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:25,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 93 states. [2018-11-23 12:17:25,173 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 93 states. [2018-11-23 12:17:25,173 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 93 states. [2018-11-23 12:17:25,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:25,175 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2018-11-23 12:17:25,175 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2018-11-23 12:17:25,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:25,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:25,176 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 94 states. [2018-11-23 12:17:25,176 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 94 states. [2018-11-23 12:17:25,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:25,178 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2018-11-23 12:17:25,178 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2018-11-23 12:17:25,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:25,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:25,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:25,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:25,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 12:17:25,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-11-23 12:17:25,180 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 136 [2018-11-23 12:17:25,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:25,180 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-11-23 12:17:25,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:17:25,180 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-11-23 12:17:25,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-23 12:17:25,181 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:25,181 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 18, 18, 18, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:17:25,181 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:25,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:25,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1584939478, now seen corresponding path program 21 times [2018-11-23 12:17:25,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:25,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:25,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:25,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:25,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:25,718 INFO L256 TraceCheckUtils]: 0: Hoare triple {13836#true} call ULTIMATE.init(); {13836#true} is VALID [2018-11-23 12:17:25,718 INFO L273 TraceCheckUtils]: 1: Hoare triple {13836#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13836#true} is VALID [2018-11-23 12:17:25,718 INFO L273 TraceCheckUtils]: 2: Hoare triple {13836#true} assume true; {13836#true} is VALID [2018-11-23 12:17:25,718 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13836#true} {13836#true} #71#return; {13836#true} is VALID [2018-11-23 12:17:25,719 INFO L256 TraceCheckUtils]: 4: Hoare triple {13836#true} call #t~ret14 := main(); {13836#true} is VALID [2018-11-23 12:17:25,719 INFO L273 TraceCheckUtils]: 5: Hoare triple {13836#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {13838#(= main_~i~1 0)} is VALID [2018-11-23 12:17:25,720 INFO L273 TraceCheckUtils]: 6: Hoare triple {13838#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13838#(= main_~i~1 0)} is VALID [2018-11-23 12:17:25,720 INFO L273 TraceCheckUtils]: 7: Hoare triple {13838#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13839#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:25,721 INFO L273 TraceCheckUtils]: 8: Hoare triple {13839#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13839#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:25,721 INFO L273 TraceCheckUtils]: 9: Hoare triple {13839#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13840#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:25,722 INFO L273 TraceCheckUtils]: 10: Hoare triple {13840#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13840#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:25,722 INFO L273 TraceCheckUtils]: 11: Hoare triple {13840#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13841#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:25,722 INFO L273 TraceCheckUtils]: 12: Hoare triple {13841#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13841#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:25,723 INFO L273 TraceCheckUtils]: 13: Hoare triple {13841#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13842#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:25,723 INFO L273 TraceCheckUtils]: 14: Hoare triple {13842#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13842#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:25,724 INFO L273 TraceCheckUtils]: 15: Hoare triple {13842#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13843#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:25,724 INFO L273 TraceCheckUtils]: 16: Hoare triple {13843#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13843#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:25,725 INFO L273 TraceCheckUtils]: 17: Hoare triple {13843#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13844#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:25,725 INFO L273 TraceCheckUtils]: 18: Hoare triple {13844#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13844#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:25,726 INFO L273 TraceCheckUtils]: 19: Hoare triple {13844#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13845#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:25,726 INFO L273 TraceCheckUtils]: 20: Hoare triple {13845#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13845#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:25,727 INFO L273 TraceCheckUtils]: 21: Hoare triple {13845#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13846#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:25,728 INFO L273 TraceCheckUtils]: 22: Hoare triple {13846#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13846#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:25,728 INFO L273 TraceCheckUtils]: 23: Hoare triple {13846#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13847#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:25,729 INFO L273 TraceCheckUtils]: 24: Hoare triple {13847#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13847#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:25,730 INFO L273 TraceCheckUtils]: 25: Hoare triple {13847#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13848#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:25,730 INFO L273 TraceCheckUtils]: 26: Hoare triple {13848#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13848#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:25,731 INFO L273 TraceCheckUtils]: 27: Hoare triple {13848#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13849#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:25,731 INFO L273 TraceCheckUtils]: 28: Hoare triple {13849#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13849#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:25,732 INFO L273 TraceCheckUtils]: 29: Hoare triple {13849#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13850#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:25,733 INFO L273 TraceCheckUtils]: 30: Hoare triple {13850#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13850#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:25,733 INFO L273 TraceCheckUtils]: 31: Hoare triple {13850#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13851#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:25,734 INFO L273 TraceCheckUtils]: 32: Hoare triple {13851#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13851#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:25,735 INFO L273 TraceCheckUtils]: 33: Hoare triple {13851#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13852#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:25,735 INFO L273 TraceCheckUtils]: 34: Hoare triple {13852#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13852#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:25,736 INFO L273 TraceCheckUtils]: 35: Hoare triple {13852#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13853#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:25,736 INFO L273 TraceCheckUtils]: 36: Hoare triple {13853#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13853#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:25,737 INFO L273 TraceCheckUtils]: 37: Hoare triple {13853#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13854#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:25,738 INFO L273 TraceCheckUtils]: 38: Hoare triple {13854#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13854#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:25,738 INFO L273 TraceCheckUtils]: 39: Hoare triple {13854#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13855#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:25,739 INFO L273 TraceCheckUtils]: 40: Hoare triple {13855#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13855#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:25,740 INFO L273 TraceCheckUtils]: 41: Hoare triple {13855#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13856#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:25,740 INFO L273 TraceCheckUtils]: 42: Hoare triple {13856#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13856#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:25,741 INFO L273 TraceCheckUtils]: 43: Hoare triple {13856#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13857#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:25,741 INFO L273 TraceCheckUtils]: 44: Hoare triple {13857#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13857#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:25,742 INFO L273 TraceCheckUtils]: 45: Hoare triple {13857#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13858#(<= main_~i~1 20)} is VALID [2018-11-23 12:17:25,743 INFO L273 TraceCheckUtils]: 46: Hoare triple {13858#(<= main_~i~1 20)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13858#(<= main_~i~1 20)} is VALID [2018-11-23 12:17:25,743 INFO L273 TraceCheckUtils]: 47: Hoare triple {13858#(<= main_~i~1 20)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13859#(<= main_~i~1 21)} is VALID [2018-11-23 12:17:25,744 INFO L273 TraceCheckUtils]: 48: Hoare triple {13859#(<= main_~i~1 21)} assume !(~i~1 < 60); {13837#false} is VALID [2018-11-23 12:17:25,744 INFO L256 TraceCheckUtils]: 49: Hoare triple {13837#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {13836#true} is VALID [2018-11-23 12:17:25,744 INFO L273 TraceCheckUtils]: 50: Hoare triple {13836#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {13836#true} is VALID [2018-11-23 12:17:25,745 INFO L273 TraceCheckUtils]: 51: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:25,745 INFO L273 TraceCheckUtils]: 52: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:25,745 INFO L273 TraceCheckUtils]: 53: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:25,745 INFO L273 TraceCheckUtils]: 54: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:25,745 INFO L273 TraceCheckUtils]: 55: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:25,746 INFO L273 TraceCheckUtils]: 56: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:25,746 INFO L273 TraceCheckUtils]: 57: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:25,746 INFO L273 TraceCheckUtils]: 58: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:25,746 INFO L273 TraceCheckUtils]: 59: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:25,746 INFO L273 TraceCheckUtils]: 60: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:25,747 INFO L273 TraceCheckUtils]: 61: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:25,747 INFO L273 TraceCheckUtils]: 62: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:25,747 INFO L273 TraceCheckUtils]: 63: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:25,747 INFO L273 TraceCheckUtils]: 64: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:25,747 INFO L273 TraceCheckUtils]: 65: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:25,747 INFO L273 TraceCheckUtils]: 66: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:25,748 INFO L273 TraceCheckUtils]: 67: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:25,748 INFO L273 TraceCheckUtils]: 68: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:25,748 INFO L273 TraceCheckUtils]: 69: Hoare triple {13836#true} assume !(~i~0 < 60); {13836#true} is VALID [2018-11-23 12:17:25,748 INFO L273 TraceCheckUtils]: 70: Hoare triple {13836#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {13836#true} is VALID [2018-11-23 12:17:25,748 INFO L273 TraceCheckUtils]: 71: Hoare triple {13836#true} assume true; {13836#true} is VALID [2018-11-23 12:17:25,749 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {13836#true} {13837#false} #75#return; {13837#false} is VALID [2018-11-23 12:17:25,749 INFO L273 TraceCheckUtils]: 73: Hoare triple {13837#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {13837#false} is VALID [2018-11-23 12:17:25,749 INFO L256 TraceCheckUtils]: 74: Hoare triple {13837#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {13836#true} is VALID [2018-11-23 12:17:25,749 INFO L273 TraceCheckUtils]: 75: Hoare triple {13836#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {13836#true} is VALID [2018-11-23 12:17:25,749 INFO L273 TraceCheckUtils]: 76: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:25,749 INFO L273 TraceCheckUtils]: 77: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:25,749 INFO L273 TraceCheckUtils]: 78: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:25,750 INFO L273 TraceCheckUtils]: 79: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:25,750 INFO L273 TraceCheckUtils]: 80: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:25,750 INFO L273 TraceCheckUtils]: 81: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:25,750 INFO L273 TraceCheckUtils]: 82: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:25,750 INFO L273 TraceCheckUtils]: 83: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:25,750 INFO L273 TraceCheckUtils]: 84: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:25,750 INFO L273 TraceCheckUtils]: 85: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:25,750 INFO L273 TraceCheckUtils]: 86: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:25,750 INFO L273 TraceCheckUtils]: 87: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:25,751 INFO L273 TraceCheckUtils]: 88: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:25,751 INFO L273 TraceCheckUtils]: 89: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:25,751 INFO L273 TraceCheckUtils]: 90: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:25,751 INFO L273 TraceCheckUtils]: 91: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:25,751 INFO L273 TraceCheckUtils]: 92: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:25,751 INFO L273 TraceCheckUtils]: 93: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:25,751 INFO L273 TraceCheckUtils]: 94: Hoare triple {13836#true} assume !(~i~0 < 60); {13836#true} is VALID [2018-11-23 12:17:25,751 INFO L273 TraceCheckUtils]: 95: Hoare triple {13836#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {13836#true} is VALID [2018-11-23 12:17:25,751 INFO L273 TraceCheckUtils]: 96: Hoare triple {13836#true} assume true; {13836#true} is VALID [2018-11-23 12:17:25,752 INFO L268 TraceCheckUtils]: 97: Hoare quadruple {13836#true} {13837#false} #77#return; {13837#false} is VALID [2018-11-23 12:17:25,752 INFO L273 TraceCheckUtils]: 98: Hoare triple {13837#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {13837#false} is VALID [2018-11-23 12:17:25,752 INFO L273 TraceCheckUtils]: 99: Hoare triple {13837#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13837#false} is VALID [2018-11-23 12:17:25,752 INFO L273 TraceCheckUtils]: 100: Hoare triple {13837#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13837#false} is VALID [2018-11-23 12:17:25,752 INFO L273 TraceCheckUtils]: 101: Hoare triple {13837#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13837#false} is VALID [2018-11-23 12:17:25,752 INFO L273 TraceCheckUtils]: 102: Hoare triple {13837#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13837#false} is VALID [2018-11-23 12:17:25,752 INFO L273 TraceCheckUtils]: 103: Hoare triple {13837#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13837#false} is VALID [2018-11-23 12:17:25,752 INFO L273 TraceCheckUtils]: 104: Hoare triple {13837#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13837#false} is VALID [2018-11-23 12:17:25,752 INFO L273 TraceCheckUtils]: 105: Hoare triple {13837#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13837#false} is VALID [2018-11-23 12:17:25,753 INFO L273 TraceCheckUtils]: 106: Hoare triple {13837#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13837#false} is VALID [2018-11-23 12:17:25,753 INFO L273 TraceCheckUtils]: 107: Hoare triple {13837#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13837#false} is VALID [2018-11-23 12:17:25,753 INFO L273 TraceCheckUtils]: 108: Hoare triple {13837#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13837#false} is VALID [2018-11-23 12:17:25,753 INFO L273 TraceCheckUtils]: 109: Hoare triple {13837#false} assume !(~i~2 < 59); {13837#false} is VALID [2018-11-23 12:17:25,753 INFO L273 TraceCheckUtils]: 110: Hoare triple {13837#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {13837#false} is VALID [2018-11-23 12:17:25,753 INFO L256 TraceCheckUtils]: 111: Hoare triple {13837#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {13836#true} is VALID [2018-11-23 12:17:25,753 INFO L273 TraceCheckUtils]: 112: Hoare triple {13836#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {13836#true} is VALID [2018-11-23 12:17:25,753 INFO L273 TraceCheckUtils]: 113: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:25,753 INFO L273 TraceCheckUtils]: 114: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:25,754 INFO L273 TraceCheckUtils]: 115: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:25,754 INFO L273 TraceCheckUtils]: 116: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:25,754 INFO L273 TraceCheckUtils]: 117: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:25,754 INFO L273 TraceCheckUtils]: 118: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:25,754 INFO L273 TraceCheckUtils]: 119: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:25,754 INFO L273 TraceCheckUtils]: 120: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:25,754 INFO L273 TraceCheckUtils]: 121: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:25,754 INFO L273 TraceCheckUtils]: 122: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:25,755 INFO L273 TraceCheckUtils]: 123: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:25,755 INFO L273 TraceCheckUtils]: 124: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:25,755 INFO L273 TraceCheckUtils]: 125: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:25,755 INFO L273 TraceCheckUtils]: 126: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:25,755 INFO L273 TraceCheckUtils]: 127: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:25,755 INFO L273 TraceCheckUtils]: 128: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:25,755 INFO L273 TraceCheckUtils]: 129: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:25,755 INFO L273 TraceCheckUtils]: 130: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:25,755 INFO L273 TraceCheckUtils]: 131: Hoare triple {13836#true} assume !(~i~0 < 60); {13836#true} is VALID [2018-11-23 12:17:25,756 INFO L273 TraceCheckUtils]: 132: Hoare triple {13836#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {13836#true} is VALID [2018-11-23 12:17:25,756 INFO L273 TraceCheckUtils]: 133: Hoare triple {13836#true} assume true; {13836#true} is VALID [2018-11-23 12:17:25,756 INFO L268 TraceCheckUtils]: 134: Hoare quadruple {13836#true} {13837#false} #79#return; {13837#false} is VALID [2018-11-23 12:17:25,756 INFO L273 TraceCheckUtils]: 135: Hoare triple {13837#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {13837#false} is VALID [2018-11-23 12:17:25,756 INFO L273 TraceCheckUtils]: 136: Hoare triple {13837#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {13837#false} is VALID [2018-11-23 12:17:25,756 INFO L273 TraceCheckUtils]: 137: Hoare triple {13837#false} assume !false; {13837#false} is VALID [2018-11-23 12:17:25,764 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2018-11-23 12:17:25,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:25,765 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:17:25,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:17:25,900 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 12:17:25,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:25,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:26,206 INFO L256 TraceCheckUtils]: 0: Hoare triple {13836#true} call ULTIMATE.init(); {13836#true} is VALID [2018-11-23 12:17:26,207 INFO L273 TraceCheckUtils]: 1: Hoare triple {13836#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13836#true} is VALID [2018-11-23 12:17:26,207 INFO L273 TraceCheckUtils]: 2: Hoare triple {13836#true} assume true; {13836#true} is VALID [2018-11-23 12:17:26,207 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13836#true} {13836#true} #71#return; {13836#true} is VALID [2018-11-23 12:17:26,207 INFO L256 TraceCheckUtils]: 4: Hoare triple {13836#true} call #t~ret14 := main(); {13836#true} is VALID [2018-11-23 12:17:26,207 INFO L273 TraceCheckUtils]: 5: Hoare triple {13836#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {13836#true} is VALID [2018-11-23 12:17:26,208 INFO L273 TraceCheckUtils]: 6: Hoare triple {13836#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13836#true} is VALID [2018-11-23 12:17:26,208 INFO L273 TraceCheckUtils]: 7: Hoare triple {13836#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13836#true} is VALID [2018-11-23 12:17:26,208 INFO L273 TraceCheckUtils]: 8: Hoare triple {13836#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13836#true} is VALID [2018-11-23 12:17:26,208 INFO L273 TraceCheckUtils]: 9: Hoare triple {13836#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13836#true} is VALID [2018-11-23 12:17:26,208 INFO L273 TraceCheckUtils]: 10: Hoare triple {13836#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13836#true} is VALID [2018-11-23 12:17:26,208 INFO L273 TraceCheckUtils]: 11: Hoare triple {13836#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13836#true} is VALID [2018-11-23 12:17:26,209 INFO L273 TraceCheckUtils]: 12: Hoare triple {13836#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13836#true} is VALID [2018-11-23 12:17:26,209 INFO L273 TraceCheckUtils]: 13: Hoare triple {13836#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13836#true} is VALID [2018-11-23 12:17:26,209 INFO L273 TraceCheckUtils]: 14: Hoare triple {13836#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13836#true} is VALID [2018-11-23 12:17:26,209 INFO L273 TraceCheckUtils]: 15: Hoare triple {13836#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13836#true} is VALID [2018-11-23 12:17:26,209 INFO L273 TraceCheckUtils]: 16: Hoare triple {13836#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13836#true} is VALID [2018-11-23 12:17:26,210 INFO L273 TraceCheckUtils]: 17: Hoare triple {13836#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13836#true} is VALID [2018-11-23 12:17:26,210 INFO L273 TraceCheckUtils]: 18: Hoare triple {13836#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13836#true} is VALID [2018-11-23 12:17:26,210 INFO L273 TraceCheckUtils]: 19: Hoare triple {13836#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13836#true} is VALID [2018-11-23 12:17:26,210 INFO L273 TraceCheckUtils]: 20: Hoare triple {13836#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13836#true} is VALID [2018-11-23 12:17:26,210 INFO L273 TraceCheckUtils]: 21: Hoare triple {13836#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13836#true} is VALID [2018-11-23 12:17:26,210 INFO L273 TraceCheckUtils]: 22: Hoare triple {13836#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13836#true} is VALID [2018-11-23 12:17:26,210 INFO L273 TraceCheckUtils]: 23: Hoare triple {13836#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13836#true} is VALID [2018-11-23 12:17:26,210 INFO L273 TraceCheckUtils]: 24: Hoare triple {13836#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13836#true} is VALID [2018-11-23 12:17:26,211 INFO L273 TraceCheckUtils]: 25: Hoare triple {13836#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13836#true} is VALID [2018-11-23 12:17:26,211 INFO L273 TraceCheckUtils]: 26: Hoare triple {13836#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13836#true} is VALID [2018-11-23 12:17:26,211 INFO L273 TraceCheckUtils]: 27: Hoare triple {13836#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13836#true} is VALID [2018-11-23 12:17:26,211 INFO L273 TraceCheckUtils]: 28: Hoare triple {13836#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13836#true} is VALID [2018-11-23 12:17:26,211 INFO L273 TraceCheckUtils]: 29: Hoare triple {13836#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13836#true} is VALID [2018-11-23 12:17:26,211 INFO L273 TraceCheckUtils]: 30: Hoare triple {13836#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13836#true} is VALID [2018-11-23 12:17:26,211 INFO L273 TraceCheckUtils]: 31: Hoare triple {13836#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13836#true} is VALID [2018-11-23 12:17:26,211 INFO L273 TraceCheckUtils]: 32: Hoare triple {13836#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13836#true} is VALID [2018-11-23 12:17:26,211 INFO L273 TraceCheckUtils]: 33: Hoare triple {13836#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13836#true} is VALID [2018-11-23 12:17:26,212 INFO L273 TraceCheckUtils]: 34: Hoare triple {13836#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13836#true} is VALID [2018-11-23 12:17:26,212 INFO L273 TraceCheckUtils]: 35: Hoare triple {13836#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13836#true} is VALID [2018-11-23 12:17:26,212 INFO L273 TraceCheckUtils]: 36: Hoare triple {13836#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13836#true} is VALID [2018-11-23 12:17:26,212 INFO L273 TraceCheckUtils]: 37: Hoare triple {13836#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13836#true} is VALID [2018-11-23 12:17:26,212 INFO L273 TraceCheckUtils]: 38: Hoare triple {13836#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13836#true} is VALID [2018-11-23 12:17:26,212 INFO L273 TraceCheckUtils]: 39: Hoare triple {13836#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13836#true} is VALID [2018-11-23 12:17:26,212 INFO L273 TraceCheckUtils]: 40: Hoare triple {13836#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13836#true} is VALID [2018-11-23 12:17:26,212 INFO L273 TraceCheckUtils]: 41: Hoare triple {13836#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13836#true} is VALID [2018-11-23 12:17:26,212 INFO L273 TraceCheckUtils]: 42: Hoare triple {13836#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13836#true} is VALID [2018-11-23 12:17:26,213 INFO L273 TraceCheckUtils]: 43: Hoare triple {13836#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13836#true} is VALID [2018-11-23 12:17:26,213 INFO L273 TraceCheckUtils]: 44: Hoare triple {13836#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13836#true} is VALID [2018-11-23 12:17:26,213 INFO L273 TraceCheckUtils]: 45: Hoare triple {13836#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13836#true} is VALID [2018-11-23 12:17:26,213 INFO L273 TraceCheckUtils]: 46: Hoare triple {13836#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13836#true} is VALID [2018-11-23 12:17:26,213 INFO L273 TraceCheckUtils]: 47: Hoare triple {13836#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13836#true} is VALID [2018-11-23 12:17:26,213 INFO L273 TraceCheckUtils]: 48: Hoare triple {13836#true} assume !(~i~1 < 60); {13836#true} is VALID [2018-11-23 12:17:26,213 INFO L256 TraceCheckUtils]: 49: Hoare triple {13836#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {13836#true} is VALID [2018-11-23 12:17:26,213 INFO L273 TraceCheckUtils]: 50: Hoare triple {13836#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {13836#true} is VALID [2018-11-23 12:17:26,213 INFO L273 TraceCheckUtils]: 51: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:26,213 INFO L273 TraceCheckUtils]: 52: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:26,214 INFO L273 TraceCheckUtils]: 53: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:26,214 INFO L273 TraceCheckUtils]: 54: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:26,214 INFO L273 TraceCheckUtils]: 55: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:26,214 INFO L273 TraceCheckUtils]: 56: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:26,214 INFO L273 TraceCheckUtils]: 57: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:26,214 INFO L273 TraceCheckUtils]: 58: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:26,214 INFO L273 TraceCheckUtils]: 59: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:26,214 INFO L273 TraceCheckUtils]: 60: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:26,214 INFO L273 TraceCheckUtils]: 61: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:26,215 INFO L273 TraceCheckUtils]: 62: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:26,215 INFO L273 TraceCheckUtils]: 63: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:26,215 INFO L273 TraceCheckUtils]: 64: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:26,215 INFO L273 TraceCheckUtils]: 65: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:26,215 INFO L273 TraceCheckUtils]: 66: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:26,215 INFO L273 TraceCheckUtils]: 67: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:26,215 INFO L273 TraceCheckUtils]: 68: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:26,215 INFO L273 TraceCheckUtils]: 69: Hoare triple {13836#true} assume !(~i~0 < 60); {13836#true} is VALID [2018-11-23 12:17:26,215 INFO L273 TraceCheckUtils]: 70: Hoare triple {13836#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {13836#true} is VALID [2018-11-23 12:17:26,216 INFO L273 TraceCheckUtils]: 71: Hoare triple {13836#true} assume true; {13836#true} is VALID [2018-11-23 12:17:26,216 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {13836#true} {13836#true} #75#return; {13836#true} is VALID [2018-11-23 12:17:26,216 INFO L273 TraceCheckUtils]: 73: Hoare triple {13836#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {13836#true} is VALID [2018-11-23 12:17:26,216 INFO L256 TraceCheckUtils]: 74: Hoare triple {13836#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {13836#true} is VALID [2018-11-23 12:17:26,216 INFO L273 TraceCheckUtils]: 75: Hoare triple {13836#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {13836#true} is VALID [2018-11-23 12:17:26,216 INFO L273 TraceCheckUtils]: 76: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:26,216 INFO L273 TraceCheckUtils]: 77: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:26,216 INFO L273 TraceCheckUtils]: 78: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:26,216 INFO L273 TraceCheckUtils]: 79: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:26,217 INFO L273 TraceCheckUtils]: 80: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:26,217 INFO L273 TraceCheckUtils]: 81: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:26,217 INFO L273 TraceCheckUtils]: 82: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:26,217 INFO L273 TraceCheckUtils]: 83: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:26,217 INFO L273 TraceCheckUtils]: 84: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:26,217 INFO L273 TraceCheckUtils]: 85: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:26,217 INFO L273 TraceCheckUtils]: 86: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:26,217 INFO L273 TraceCheckUtils]: 87: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:26,217 INFO L273 TraceCheckUtils]: 88: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:26,218 INFO L273 TraceCheckUtils]: 89: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:26,218 INFO L273 TraceCheckUtils]: 90: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:26,218 INFO L273 TraceCheckUtils]: 91: Hoare triple {13836#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13836#true} is VALID [2018-11-23 12:17:26,218 INFO L273 TraceCheckUtils]: 92: Hoare triple {13836#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {13836#true} is VALID [2018-11-23 12:17:26,218 INFO L273 TraceCheckUtils]: 93: Hoare triple {13836#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13836#true} is VALID [2018-11-23 12:17:26,218 INFO L273 TraceCheckUtils]: 94: Hoare triple {13836#true} assume !(~i~0 < 60); {13836#true} is VALID [2018-11-23 12:17:26,218 INFO L273 TraceCheckUtils]: 95: Hoare triple {13836#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {13836#true} is VALID [2018-11-23 12:17:26,218 INFO L273 TraceCheckUtils]: 96: Hoare triple {13836#true} assume true; {13836#true} is VALID [2018-11-23 12:17:26,218 INFO L268 TraceCheckUtils]: 97: Hoare quadruple {13836#true} {13836#true} #77#return; {13836#true} is VALID [2018-11-23 12:17:26,219 INFO L273 TraceCheckUtils]: 98: Hoare triple {13836#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {13836#true} is VALID [2018-11-23 12:17:26,219 INFO L273 TraceCheckUtils]: 99: Hoare triple {13836#true} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13836#true} is VALID [2018-11-23 12:17:26,219 INFO L273 TraceCheckUtils]: 100: Hoare triple {13836#true} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13836#true} is VALID [2018-11-23 12:17:26,219 INFO L273 TraceCheckUtils]: 101: Hoare triple {13836#true} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13836#true} is VALID [2018-11-23 12:17:26,219 INFO L273 TraceCheckUtils]: 102: Hoare triple {13836#true} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13836#true} is VALID [2018-11-23 12:17:26,219 INFO L273 TraceCheckUtils]: 103: Hoare triple {13836#true} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13836#true} is VALID [2018-11-23 12:17:26,219 INFO L273 TraceCheckUtils]: 104: Hoare triple {13836#true} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13836#true} is VALID [2018-11-23 12:17:26,219 INFO L273 TraceCheckUtils]: 105: Hoare triple {13836#true} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13836#true} is VALID [2018-11-23 12:17:26,219 INFO L273 TraceCheckUtils]: 106: Hoare triple {13836#true} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13836#true} is VALID [2018-11-23 12:17:26,219 INFO L273 TraceCheckUtils]: 107: Hoare triple {13836#true} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13836#true} is VALID [2018-11-23 12:17:26,220 INFO L273 TraceCheckUtils]: 108: Hoare triple {13836#true} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13836#true} is VALID [2018-11-23 12:17:26,220 INFO L273 TraceCheckUtils]: 109: Hoare triple {13836#true} assume !(~i~2 < 59); {13836#true} is VALID [2018-11-23 12:17:26,220 INFO L273 TraceCheckUtils]: 110: Hoare triple {13836#true} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {13836#true} is VALID [2018-11-23 12:17:26,220 INFO L256 TraceCheckUtils]: 111: Hoare triple {13836#true} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {13836#true} is VALID [2018-11-23 12:17:26,220 INFO L273 TraceCheckUtils]: 112: Hoare triple {13836#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {14199#(<= sep_~i~0 0)} is VALID [2018-11-23 12:17:26,221 INFO L273 TraceCheckUtils]: 113: Hoare triple {14199#(<= sep_~i~0 0)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14199#(<= sep_~i~0 0)} is VALID [2018-11-23 12:17:26,221 INFO L273 TraceCheckUtils]: 114: Hoare triple {14199#(<= sep_~i~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14199#(<= sep_~i~0 0)} is VALID [2018-11-23 12:17:26,221 INFO L273 TraceCheckUtils]: 115: Hoare triple {14199#(<= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14209#(<= sep_~i~0 1)} is VALID [2018-11-23 12:17:26,222 INFO L273 TraceCheckUtils]: 116: Hoare triple {14209#(<= sep_~i~0 1)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14209#(<= sep_~i~0 1)} is VALID [2018-11-23 12:17:26,222 INFO L273 TraceCheckUtils]: 117: Hoare triple {14209#(<= sep_~i~0 1)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14209#(<= sep_~i~0 1)} is VALID [2018-11-23 12:17:26,222 INFO L273 TraceCheckUtils]: 118: Hoare triple {14209#(<= sep_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14219#(<= sep_~i~0 2)} is VALID [2018-11-23 12:17:26,223 INFO L273 TraceCheckUtils]: 119: Hoare triple {14219#(<= sep_~i~0 2)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14219#(<= sep_~i~0 2)} is VALID [2018-11-23 12:17:26,223 INFO L273 TraceCheckUtils]: 120: Hoare triple {14219#(<= sep_~i~0 2)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14219#(<= sep_~i~0 2)} is VALID [2018-11-23 12:17:26,223 INFO L273 TraceCheckUtils]: 121: Hoare triple {14219#(<= sep_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14229#(<= sep_~i~0 3)} is VALID [2018-11-23 12:17:26,224 INFO L273 TraceCheckUtils]: 122: Hoare triple {14229#(<= sep_~i~0 3)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14229#(<= sep_~i~0 3)} is VALID [2018-11-23 12:17:26,224 INFO L273 TraceCheckUtils]: 123: Hoare triple {14229#(<= sep_~i~0 3)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14229#(<= sep_~i~0 3)} is VALID [2018-11-23 12:17:26,225 INFO L273 TraceCheckUtils]: 124: Hoare triple {14229#(<= sep_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14239#(<= sep_~i~0 4)} is VALID [2018-11-23 12:17:26,225 INFO L273 TraceCheckUtils]: 125: Hoare triple {14239#(<= sep_~i~0 4)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14239#(<= sep_~i~0 4)} is VALID [2018-11-23 12:17:26,225 INFO L273 TraceCheckUtils]: 126: Hoare triple {14239#(<= sep_~i~0 4)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14239#(<= sep_~i~0 4)} is VALID [2018-11-23 12:17:26,226 INFO L273 TraceCheckUtils]: 127: Hoare triple {14239#(<= sep_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14249#(<= sep_~i~0 5)} is VALID [2018-11-23 12:17:26,227 INFO L273 TraceCheckUtils]: 128: Hoare triple {14249#(<= sep_~i~0 5)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14249#(<= sep_~i~0 5)} is VALID [2018-11-23 12:17:26,227 INFO L273 TraceCheckUtils]: 129: Hoare triple {14249#(<= sep_~i~0 5)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14249#(<= sep_~i~0 5)} is VALID [2018-11-23 12:17:26,228 INFO L273 TraceCheckUtils]: 130: Hoare triple {14249#(<= sep_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14259#(<= sep_~i~0 6)} is VALID [2018-11-23 12:17:26,228 INFO L273 TraceCheckUtils]: 131: Hoare triple {14259#(<= sep_~i~0 6)} assume !(~i~0 < 60); {13837#false} is VALID [2018-11-23 12:17:26,229 INFO L273 TraceCheckUtils]: 132: Hoare triple {13837#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {13837#false} is VALID [2018-11-23 12:17:26,229 INFO L273 TraceCheckUtils]: 133: Hoare triple {13837#false} assume true; {13837#false} is VALID [2018-11-23 12:17:26,229 INFO L268 TraceCheckUtils]: 134: Hoare quadruple {13837#false} {13836#true} #79#return; {13837#false} is VALID [2018-11-23 12:17:26,229 INFO L273 TraceCheckUtils]: 135: Hoare triple {13837#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {13837#false} is VALID [2018-11-23 12:17:26,229 INFO L273 TraceCheckUtils]: 136: Hoare triple {13837#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {13837#false} is VALID [2018-11-23 12:17:26,230 INFO L273 TraceCheckUtils]: 137: Hoare triple {13837#false} assume !false; {13837#false} is VALID [2018-11-23 12:17:26,239 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 248 proven. 51 refuted. 0 times theorem prover too weak. 695 trivial. 0 not checked. [2018-11-23 12:17:26,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:26,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 9] total 31 [2018-11-23 12:17:26,258 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 138 [2018-11-23 12:17:26,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:26,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 12:17:26,373 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:26,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 12:17:26,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 12:17:26,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=619, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:17:26,374 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 31 states. [2018-11-23 12:17:27,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:27,341 INFO L93 Difference]: Finished difference Result 145 states and 171 transitions. [2018-11-23 12:17:27,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 12:17:27,342 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 138 [2018-11-23 12:17:27,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:27,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:17:27,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 132 transitions. [2018-11-23 12:17:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:17:27,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 132 transitions. [2018-11-23 12:17:27,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 132 transitions. [2018-11-23 12:17:27,492 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:27,494 INFO L225 Difference]: With dead ends: 145 [2018-11-23 12:17:27,495 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 12:17:27,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=311, Invalid=619, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:17:27,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 12:17:27,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2018-11-23 12:17:27,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:27,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 98 states. [2018-11-23 12:17:27,540 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 98 states. [2018-11-23 12:17:27,540 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 98 states. [2018-11-23 12:17:27,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:27,543 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2018-11-23 12:17:27,543 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2018-11-23 12:17:27,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:27,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:27,544 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 101 states. [2018-11-23 12:17:27,544 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 101 states. [2018-11-23 12:17:27,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:27,546 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2018-11-23 12:17:27,546 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2018-11-23 12:17:27,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:27,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:27,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:27,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:27,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-23 12:17:27,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2018-11-23 12:17:27,549 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 138 [2018-11-23 12:17:27,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:27,549 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2018-11-23 12:17:27,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 12:17:27,549 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2018-11-23 12:17:27,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-23 12:17:27,550 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:27,550 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:17:27,550 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:27,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:27,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1061708125, now seen corresponding path program 22 times [2018-11-23 12:17:27,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:27,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:27,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:27,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:27,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:28,055 INFO L256 TraceCheckUtils]: 0: Hoare triple {14832#true} call ULTIMATE.init(); {14832#true} is VALID [2018-11-23 12:17:28,056 INFO L273 TraceCheckUtils]: 1: Hoare triple {14832#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14832#true} is VALID [2018-11-23 12:17:28,056 INFO L273 TraceCheckUtils]: 2: Hoare triple {14832#true} assume true; {14832#true} is VALID [2018-11-23 12:17:28,056 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14832#true} {14832#true} #71#return; {14832#true} is VALID [2018-11-23 12:17:28,056 INFO L256 TraceCheckUtils]: 4: Hoare triple {14832#true} call #t~ret14 := main(); {14832#true} is VALID [2018-11-23 12:17:28,057 INFO L273 TraceCheckUtils]: 5: Hoare triple {14832#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {14834#(= main_~i~1 0)} is VALID [2018-11-23 12:17:28,057 INFO L273 TraceCheckUtils]: 6: Hoare triple {14834#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14834#(= main_~i~1 0)} is VALID [2018-11-23 12:17:28,058 INFO L273 TraceCheckUtils]: 7: Hoare triple {14834#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14835#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:28,058 INFO L273 TraceCheckUtils]: 8: Hoare triple {14835#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14835#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:28,059 INFO L273 TraceCheckUtils]: 9: Hoare triple {14835#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14836#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:28,059 INFO L273 TraceCheckUtils]: 10: Hoare triple {14836#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14836#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:28,059 INFO L273 TraceCheckUtils]: 11: Hoare triple {14836#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14837#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:28,060 INFO L273 TraceCheckUtils]: 12: Hoare triple {14837#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14837#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:28,061 INFO L273 TraceCheckUtils]: 13: Hoare triple {14837#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14838#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:28,061 INFO L273 TraceCheckUtils]: 14: Hoare triple {14838#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14838#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:28,062 INFO L273 TraceCheckUtils]: 15: Hoare triple {14838#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14839#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:28,062 INFO L273 TraceCheckUtils]: 16: Hoare triple {14839#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14839#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:28,063 INFO L273 TraceCheckUtils]: 17: Hoare triple {14839#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14840#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:28,063 INFO L273 TraceCheckUtils]: 18: Hoare triple {14840#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14840#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:28,064 INFO L273 TraceCheckUtils]: 19: Hoare triple {14840#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14841#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:28,065 INFO L273 TraceCheckUtils]: 20: Hoare triple {14841#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14841#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:28,065 INFO L273 TraceCheckUtils]: 21: Hoare triple {14841#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14842#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:28,066 INFO L273 TraceCheckUtils]: 22: Hoare triple {14842#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14842#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:28,067 INFO L273 TraceCheckUtils]: 23: Hoare triple {14842#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14843#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:28,067 INFO L273 TraceCheckUtils]: 24: Hoare triple {14843#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14843#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:28,068 INFO L273 TraceCheckUtils]: 25: Hoare triple {14843#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14844#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:28,068 INFO L273 TraceCheckUtils]: 26: Hoare triple {14844#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14844#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:28,069 INFO L273 TraceCheckUtils]: 27: Hoare triple {14844#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14845#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:28,069 INFO L273 TraceCheckUtils]: 28: Hoare triple {14845#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14845#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:28,070 INFO L273 TraceCheckUtils]: 29: Hoare triple {14845#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14846#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:28,071 INFO L273 TraceCheckUtils]: 30: Hoare triple {14846#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14846#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:28,071 INFO L273 TraceCheckUtils]: 31: Hoare triple {14846#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14847#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:28,072 INFO L273 TraceCheckUtils]: 32: Hoare triple {14847#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14847#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:28,073 INFO L273 TraceCheckUtils]: 33: Hoare triple {14847#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14848#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:28,073 INFO L273 TraceCheckUtils]: 34: Hoare triple {14848#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14848#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:28,074 INFO L273 TraceCheckUtils]: 35: Hoare triple {14848#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14849#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:28,074 INFO L273 TraceCheckUtils]: 36: Hoare triple {14849#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14849#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:28,075 INFO L273 TraceCheckUtils]: 37: Hoare triple {14849#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14850#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:28,076 INFO L273 TraceCheckUtils]: 38: Hoare triple {14850#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14850#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:28,076 INFO L273 TraceCheckUtils]: 39: Hoare triple {14850#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14851#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:28,077 INFO L273 TraceCheckUtils]: 40: Hoare triple {14851#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14851#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:28,078 INFO L273 TraceCheckUtils]: 41: Hoare triple {14851#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14852#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:28,078 INFO L273 TraceCheckUtils]: 42: Hoare triple {14852#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14852#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:28,079 INFO L273 TraceCheckUtils]: 43: Hoare triple {14852#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14853#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:28,079 INFO L273 TraceCheckUtils]: 44: Hoare triple {14853#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14853#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:28,080 INFO L273 TraceCheckUtils]: 45: Hoare triple {14853#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14854#(<= main_~i~1 20)} is VALID [2018-11-23 12:17:28,081 INFO L273 TraceCheckUtils]: 46: Hoare triple {14854#(<= main_~i~1 20)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14854#(<= main_~i~1 20)} is VALID [2018-11-23 12:17:28,081 INFO L273 TraceCheckUtils]: 47: Hoare triple {14854#(<= main_~i~1 20)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14855#(<= main_~i~1 21)} is VALID [2018-11-23 12:17:28,082 INFO L273 TraceCheckUtils]: 48: Hoare triple {14855#(<= main_~i~1 21)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14855#(<= main_~i~1 21)} is VALID [2018-11-23 12:17:28,083 INFO L273 TraceCheckUtils]: 49: Hoare triple {14855#(<= main_~i~1 21)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14856#(<= main_~i~1 22)} is VALID [2018-11-23 12:17:28,083 INFO L273 TraceCheckUtils]: 50: Hoare triple {14856#(<= main_~i~1 22)} assume !(~i~1 < 60); {14833#false} is VALID [2018-11-23 12:17:28,084 INFO L256 TraceCheckUtils]: 51: Hoare triple {14833#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {14832#true} is VALID [2018-11-23 12:17:28,084 INFO L273 TraceCheckUtils]: 52: Hoare triple {14832#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {14832#true} is VALID [2018-11-23 12:17:28,084 INFO L273 TraceCheckUtils]: 53: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:28,084 INFO L273 TraceCheckUtils]: 54: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:28,084 INFO L273 TraceCheckUtils]: 55: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:28,085 INFO L273 TraceCheckUtils]: 56: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:28,085 INFO L273 TraceCheckUtils]: 57: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:28,085 INFO L273 TraceCheckUtils]: 58: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:28,085 INFO L273 TraceCheckUtils]: 59: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:28,085 INFO L273 TraceCheckUtils]: 60: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:28,086 INFO L273 TraceCheckUtils]: 61: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:28,086 INFO L273 TraceCheckUtils]: 62: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:28,086 INFO L273 TraceCheckUtils]: 63: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:28,086 INFO L273 TraceCheckUtils]: 64: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:28,086 INFO L273 TraceCheckUtils]: 65: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:28,087 INFO L273 TraceCheckUtils]: 66: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:28,087 INFO L273 TraceCheckUtils]: 67: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:28,087 INFO L273 TraceCheckUtils]: 68: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:28,087 INFO L273 TraceCheckUtils]: 69: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:28,087 INFO L273 TraceCheckUtils]: 70: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:28,087 INFO L273 TraceCheckUtils]: 71: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:28,088 INFO L273 TraceCheckUtils]: 72: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:28,088 INFO L273 TraceCheckUtils]: 73: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:28,088 INFO L273 TraceCheckUtils]: 74: Hoare triple {14832#true} assume !(~i~0 < 60); {14832#true} is VALID [2018-11-23 12:17:28,088 INFO L273 TraceCheckUtils]: 75: Hoare triple {14832#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {14832#true} is VALID [2018-11-23 12:17:28,088 INFO L273 TraceCheckUtils]: 76: Hoare triple {14832#true} assume true; {14832#true} is VALID [2018-11-23 12:17:28,088 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {14832#true} {14833#false} #75#return; {14833#false} is VALID [2018-11-23 12:17:28,088 INFO L273 TraceCheckUtils]: 78: Hoare triple {14833#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {14833#false} is VALID [2018-11-23 12:17:28,088 INFO L256 TraceCheckUtils]: 79: Hoare triple {14833#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {14832#true} is VALID [2018-11-23 12:17:28,088 INFO L273 TraceCheckUtils]: 80: Hoare triple {14832#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {14832#true} is VALID [2018-11-23 12:17:28,089 INFO L273 TraceCheckUtils]: 81: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:28,089 INFO L273 TraceCheckUtils]: 82: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:28,089 INFO L273 TraceCheckUtils]: 83: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:28,089 INFO L273 TraceCheckUtils]: 84: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:28,089 INFO L273 TraceCheckUtils]: 85: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:28,089 INFO L273 TraceCheckUtils]: 86: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:28,089 INFO L273 TraceCheckUtils]: 87: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:28,089 INFO L273 TraceCheckUtils]: 88: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:28,089 INFO L273 TraceCheckUtils]: 89: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:28,090 INFO L273 TraceCheckUtils]: 90: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:28,090 INFO L273 TraceCheckUtils]: 91: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:28,090 INFO L273 TraceCheckUtils]: 92: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:28,090 INFO L273 TraceCheckUtils]: 93: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:28,090 INFO L273 TraceCheckUtils]: 94: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:28,090 INFO L273 TraceCheckUtils]: 95: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:28,090 INFO L273 TraceCheckUtils]: 96: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:28,090 INFO L273 TraceCheckUtils]: 97: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:28,090 INFO L273 TraceCheckUtils]: 98: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:28,091 INFO L273 TraceCheckUtils]: 99: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:28,091 INFO L273 TraceCheckUtils]: 100: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:28,091 INFO L273 TraceCheckUtils]: 101: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:28,091 INFO L273 TraceCheckUtils]: 102: Hoare triple {14832#true} assume !(~i~0 < 60); {14832#true} is VALID [2018-11-23 12:17:28,091 INFO L273 TraceCheckUtils]: 103: Hoare triple {14832#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {14832#true} is VALID [2018-11-23 12:17:28,091 INFO L273 TraceCheckUtils]: 104: Hoare triple {14832#true} assume true; {14832#true} is VALID [2018-11-23 12:17:28,091 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {14832#true} {14833#false} #77#return; {14833#false} is VALID [2018-11-23 12:17:28,091 INFO L273 TraceCheckUtils]: 106: Hoare triple {14833#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {14833#false} is VALID [2018-11-23 12:17:28,091 INFO L273 TraceCheckUtils]: 107: Hoare triple {14833#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {14833#false} is VALID [2018-11-23 12:17:28,091 INFO L273 TraceCheckUtils]: 108: Hoare triple {14833#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {14833#false} is VALID [2018-11-23 12:17:28,092 INFO L273 TraceCheckUtils]: 109: Hoare triple {14833#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {14833#false} is VALID [2018-11-23 12:17:28,092 INFO L273 TraceCheckUtils]: 110: Hoare triple {14833#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {14833#false} is VALID [2018-11-23 12:17:28,092 INFO L273 TraceCheckUtils]: 111: Hoare triple {14833#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {14833#false} is VALID [2018-11-23 12:17:28,092 INFO L273 TraceCheckUtils]: 112: Hoare triple {14833#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {14833#false} is VALID [2018-11-23 12:17:28,092 INFO L273 TraceCheckUtils]: 113: Hoare triple {14833#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {14833#false} is VALID [2018-11-23 12:17:28,092 INFO L273 TraceCheckUtils]: 114: Hoare triple {14833#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {14833#false} is VALID [2018-11-23 12:17:28,092 INFO L273 TraceCheckUtils]: 115: Hoare triple {14833#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {14833#false} is VALID [2018-11-23 12:17:28,092 INFO L273 TraceCheckUtils]: 116: Hoare triple {14833#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {14833#false} is VALID [2018-11-23 12:17:28,092 INFO L273 TraceCheckUtils]: 117: Hoare triple {14833#false} assume !(~i~2 < 59); {14833#false} is VALID [2018-11-23 12:17:28,093 INFO L273 TraceCheckUtils]: 118: Hoare triple {14833#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {14833#false} is VALID [2018-11-23 12:17:28,093 INFO L256 TraceCheckUtils]: 119: Hoare triple {14833#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {14832#true} is VALID [2018-11-23 12:17:28,093 INFO L273 TraceCheckUtils]: 120: Hoare triple {14832#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {14832#true} is VALID [2018-11-23 12:17:28,093 INFO L273 TraceCheckUtils]: 121: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:28,093 INFO L273 TraceCheckUtils]: 122: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:28,093 INFO L273 TraceCheckUtils]: 123: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:28,093 INFO L273 TraceCheckUtils]: 124: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:28,093 INFO L273 TraceCheckUtils]: 125: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:28,093 INFO L273 TraceCheckUtils]: 126: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:28,094 INFO L273 TraceCheckUtils]: 127: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:28,094 INFO L273 TraceCheckUtils]: 128: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:28,094 INFO L273 TraceCheckUtils]: 129: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:28,094 INFO L273 TraceCheckUtils]: 130: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:28,094 INFO L273 TraceCheckUtils]: 131: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:28,094 INFO L273 TraceCheckUtils]: 132: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:28,094 INFO L273 TraceCheckUtils]: 133: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:28,094 INFO L273 TraceCheckUtils]: 134: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:28,094 INFO L273 TraceCheckUtils]: 135: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:28,095 INFO L273 TraceCheckUtils]: 136: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:28,095 INFO L273 TraceCheckUtils]: 137: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:28,095 INFO L273 TraceCheckUtils]: 138: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:28,095 INFO L273 TraceCheckUtils]: 139: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:28,095 INFO L273 TraceCheckUtils]: 140: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:28,095 INFO L273 TraceCheckUtils]: 141: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:28,095 INFO L273 TraceCheckUtils]: 142: Hoare triple {14832#true} assume !(~i~0 < 60); {14832#true} is VALID [2018-11-23 12:17:28,095 INFO L273 TraceCheckUtils]: 143: Hoare triple {14832#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {14832#true} is VALID [2018-11-23 12:17:28,095 INFO L273 TraceCheckUtils]: 144: Hoare triple {14832#true} assume true; {14832#true} is VALID [2018-11-23 12:17:28,096 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {14832#true} {14833#false} #79#return; {14833#false} is VALID [2018-11-23 12:17:28,096 INFO L273 TraceCheckUtils]: 146: Hoare triple {14833#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {14833#false} is VALID [2018-11-23 12:17:28,096 INFO L273 TraceCheckUtils]: 147: Hoare triple {14833#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {14833#false} is VALID [2018-11-23 12:17:28,096 INFO L273 TraceCheckUtils]: 148: Hoare triple {14833#false} assume !false; {14833#false} is VALID [2018-11-23 12:17:28,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1217 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 733 trivial. 0 not checked. [2018-11-23 12:17:28,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:28,106 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:17:28,114 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:17:28,192 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:17:28,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:28,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:29,836 INFO L256 TraceCheckUtils]: 0: Hoare triple {14832#true} call ULTIMATE.init(); {14832#true} is VALID [2018-11-23 12:17:29,837 INFO L273 TraceCheckUtils]: 1: Hoare triple {14832#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14832#true} is VALID [2018-11-23 12:17:29,837 INFO L273 TraceCheckUtils]: 2: Hoare triple {14832#true} assume true; {14832#true} is VALID [2018-11-23 12:17:29,837 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14832#true} {14832#true} #71#return; {14832#true} is VALID [2018-11-23 12:17:29,837 INFO L256 TraceCheckUtils]: 4: Hoare triple {14832#true} call #t~ret14 := main(); {14832#true} is VALID [2018-11-23 12:17:29,837 INFO L273 TraceCheckUtils]: 5: Hoare triple {14832#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {14832#true} is VALID [2018-11-23 12:17:29,838 INFO L273 TraceCheckUtils]: 6: Hoare triple {14832#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14832#true} is VALID [2018-11-23 12:17:29,838 INFO L273 TraceCheckUtils]: 7: Hoare triple {14832#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14832#true} is VALID [2018-11-23 12:17:29,838 INFO L273 TraceCheckUtils]: 8: Hoare triple {14832#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14832#true} is VALID [2018-11-23 12:17:29,838 INFO L273 TraceCheckUtils]: 9: Hoare triple {14832#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14832#true} is VALID [2018-11-23 12:17:29,838 INFO L273 TraceCheckUtils]: 10: Hoare triple {14832#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14832#true} is VALID [2018-11-23 12:17:29,839 INFO L273 TraceCheckUtils]: 11: Hoare triple {14832#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14832#true} is VALID [2018-11-23 12:17:29,839 INFO L273 TraceCheckUtils]: 12: Hoare triple {14832#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14832#true} is VALID [2018-11-23 12:17:29,839 INFO L273 TraceCheckUtils]: 13: Hoare triple {14832#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14832#true} is VALID [2018-11-23 12:17:29,839 INFO L273 TraceCheckUtils]: 14: Hoare triple {14832#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14832#true} is VALID [2018-11-23 12:17:29,839 INFO L273 TraceCheckUtils]: 15: Hoare triple {14832#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14832#true} is VALID [2018-11-23 12:17:29,839 INFO L273 TraceCheckUtils]: 16: Hoare triple {14832#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14832#true} is VALID [2018-11-23 12:17:29,839 INFO L273 TraceCheckUtils]: 17: Hoare triple {14832#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14832#true} is VALID [2018-11-23 12:17:29,839 INFO L273 TraceCheckUtils]: 18: Hoare triple {14832#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14832#true} is VALID [2018-11-23 12:17:29,839 INFO L273 TraceCheckUtils]: 19: Hoare triple {14832#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14832#true} is VALID [2018-11-23 12:17:29,840 INFO L273 TraceCheckUtils]: 20: Hoare triple {14832#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14832#true} is VALID [2018-11-23 12:17:29,840 INFO L273 TraceCheckUtils]: 21: Hoare triple {14832#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14832#true} is VALID [2018-11-23 12:17:29,840 INFO L273 TraceCheckUtils]: 22: Hoare triple {14832#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14832#true} is VALID [2018-11-23 12:17:29,840 INFO L273 TraceCheckUtils]: 23: Hoare triple {14832#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14832#true} is VALID [2018-11-23 12:17:29,840 INFO L273 TraceCheckUtils]: 24: Hoare triple {14832#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14832#true} is VALID [2018-11-23 12:17:29,840 INFO L273 TraceCheckUtils]: 25: Hoare triple {14832#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14832#true} is VALID [2018-11-23 12:17:29,840 INFO L273 TraceCheckUtils]: 26: Hoare triple {14832#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14832#true} is VALID [2018-11-23 12:17:29,840 INFO L273 TraceCheckUtils]: 27: Hoare triple {14832#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14832#true} is VALID [2018-11-23 12:17:29,840 INFO L273 TraceCheckUtils]: 28: Hoare triple {14832#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14832#true} is VALID [2018-11-23 12:17:29,841 INFO L273 TraceCheckUtils]: 29: Hoare triple {14832#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14832#true} is VALID [2018-11-23 12:17:29,841 INFO L273 TraceCheckUtils]: 30: Hoare triple {14832#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14832#true} is VALID [2018-11-23 12:17:29,841 INFO L273 TraceCheckUtils]: 31: Hoare triple {14832#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14832#true} is VALID [2018-11-23 12:17:29,841 INFO L273 TraceCheckUtils]: 32: Hoare triple {14832#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14832#true} is VALID [2018-11-23 12:17:29,841 INFO L273 TraceCheckUtils]: 33: Hoare triple {14832#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14832#true} is VALID [2018-11-23 12:17:29,841 INFO L273 TraceCheckUtils]: 34: Hoare triple {14832#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14832#true} is VALID [2018-11-23 12:17:29,841 INFO L273 TraceCheckUtils]: 35: Hoare triple {14832#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14832#true} is VALID [2018-11-23 12:17:29,841 INFO L273 TraceCheckUtils]: 36: Hoare triple {14832#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14832#true} is VALID [2018-11-23 12:17:29,841 INFO L273 TraceCheckUtils]: 37: Hoare triple {14832#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14832#true} is VALID [2018-11-23 12:17:29,842 INFO L273 TraceCheckUtils]: 38: Hoare triple {14832#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14832#true} is VALID [2018-11-23 12:17:29,842 INFO L273 TraceCheckUtils]: 39: Hoare triple {14832#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14832#true} is VALID [2018-11-23 12:17:29,842 INFO L273 TraceCheckUtils]: 40: Hoare triple {14832#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14832#true} is VALID [2018-11-23 12:17:29,842 INFO L273 TraceCheckUtils]: 41: Hoare triple {14832#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14832#true} is VALID [2018-11-23 12:17:29,842 INFO L273 TraceCheckUtils]: 42: Hoare triple {14832#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14832#true} is VALID [2018-11-23 12:17:29,842 INFO L273 TraceCheckUtils]: 43: Hoare triple {14832#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14832#true} is VALID [2018-11-23 12:17:29,842 INFO L273 TraceCheckUtils]: 44: Hoare triple {14832#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14832#true} is VALID [2018-11-23 12:17:29,842 INFO L273 TraceCheckUtils]: 45: Hoare triple {14832#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14832#true} is VALID [2018-11-23 12:17:29,842 INFO L273 TraceCheckUtils]: 46: Hoare triple {14832#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14832#true} is VALID [2018-11-23 12:17:29,843 INFO L273 TraceCheckUtils]: 47: Hoare triple {14832#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14832#true} is VALID [2018-11-23 12:17:29,843 INFO L273 TraceCheckUtils]: 48: Hoare triple {14832#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {14832#true} is VALID [2018-11-23 12:17:29,843 INFO L273 TraceCheckUtils]: 49: Hoare triple {14832#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14832#true} is VALID [2018-11-23 12:17:29,843 INFO L273 TraceCheckUtils]: 50: Hoare triple {14832#true} assume !(~i~1 < 60); {14832#true} is VALID [2018-11-23 12:17:29,843 INFO L256 TraceCheckUtils]: 51: Hoare triple {14832#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {14832#true} is VALID [2018-11-23 12:17:29,843 INFO L273 TraceCheckUtils]: 52: Hoare triple {14832#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {14832#true} is VALID [2018-11-23 12:17:29,843 INFO L273 TraceCheckUtils]: 53: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:29,843 INFO L273 TraceCheckUtils]: 54: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:29,843 INFO L273 TraceCheckUtils]: 55: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:29,843 INFO L273 TraceCheckUtils]: 56: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:29,844 INFO L273 TraceCheckUtils]: 57: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:29,844 INFO L273 TraceCheckUtils]: 58: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:29,844 INFO L273 TraceCheckUtils]: 59: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:29,844 INFO L273 TraceCheckUtils]: 60: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:29,844 INFO L273 TraceCheckUtils]: 61: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:29,844 INFO L273 TraceCheckUtils]: 62: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:29,844 INFO L273 TraceCheckUtils]: 63: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:29,844 INFO L273 TraceCheckUtils]: 64: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:29,844 INFO L273 TraceCheckUtils]: 65: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:29,845 INFO L273 TraceCheckUtils]: 66: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:29,845 INFO L273 TraceCheckUtils]: 67: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:29,845 INFO L273 TraceCheckUtils]: 68: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:29,845 INFO L273 TraceCheckUtils]: 69: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:29,845 INFO L273 TraceCheckUtils]: 70: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:29,845 INFO L273 TraceCheckUtils]: 71: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:29,845 INFO L273 TraceCheckUtils]: 72: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:29,845 INFO L273 TraceCheckUtils]: 73: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:29,845 INFO L273 TraceCheckUtils]: 74: Hoare triple {14832#true} assume !(~i~0 < 60); {14832#true} is VALID [2018-11-23 12:17:29,846 INFO L273 TraceCheckUtils]: 75: Hoare triple {14832#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {14832#true} is VALID [2018-11-23 12:17:29,846 INFO L273 TraceCheckUtils]: 76: Hoare triple {14832#true} assume true; {14832#true} is VALID [2018-11-23 12:17:29,846 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {14832#true} {14832#true} #75#return; {14832#true} is VALID [2018-11-23 12:17:29,846 INFO L273 TraceCheckUtils]: 78: Hoare triple {14832#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {14832#true} is VALID [2018-11-23 12:17:29,846 INFO L256 TraceCheckUtils]: 79: Hoare triple {14832#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {14832#true} is VALID [2018-11-23 12:17:29,846 INFO L273 TraceCheckUtils]: 80: Hoare triple {14832#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {14832#true} is VALID [2018-11-23 12:17:29,846 INFO L273 TraceCheckUtils]: 81: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:29,846 INFO L273 TraceCheckUtils]: 82: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:29,846 INFO L273 TraceCheckUtils]: 83: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:29,847 INFO L273 TraceCheckUtils]: 84: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:29,847 INFO L273 TraceCheckUtils]: 85: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:29,847 INFO L273 TraceCheckUtils]: 86: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:29,847 INFO L273 TraceCheckUtils]: 87: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:29,847 INFO L273 TraceCheckUtils]: 88: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:29,847 INFO L273 TraceCheckUtils]: 89: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:29,847 INFO L273 TraceCheckUtils]: 90: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:29,847 INFO L273 TraceCheckUtils]: 91: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:29,847 INFO L273 TraceCheckUtils]: 92: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:29,848 INFO L273 TraceCheckUtils]: 93: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:29,848 INFO L273 TraceCheckUtils]: 94: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:29,848 INFO L273 TraceCheckUtils]: 95: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:29,848 INFO L273 TraceCheckUtils]: 96: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:29,848 INFO L273 TraceCheckUtils]: 97: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:29,848 INFO L273 TraceCheckUtils]: 98: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:29,848 INFO L273 TraceCheckUtils]: 99: Hoare triple {14832#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14832#true} is VALID [2018-11-23 12:17:29,848 INFO L273 TraceCheckUtils]: 100: Hoare triple {14832#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {14832#true} is VALID [2018-11-23 12:17:29,848 INFO L273 TraceCheckUtils]: 101: Hoare triple {14832#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14832#true} is VALID [2018-11-23 12:17:29,848 INFO L273 TraceCheckUtils]: 102: Hoare triple {14832#true} assume !(~i~0 < 60); {14832#true} is VALID [2018-11-23 12:17:29,849 INFO L273 TraceCheckUtils]: 103: Hoare triple {14832#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {14832#true} is VALID [2018-11-23 12:17:29,849 INFO L273 TraceCheckUtils]: 104: Hoare triple {14832#true} assume true; {14832#true} is VALID [2018-11-23 12:17:29,849 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {14832#true} {14832#true} #77#return; {14832#true} is VALID [2018-11-23 12:17:29,849 INFO L273 TraceCheckUtils]: 106: Hoare triple {14832#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {14832#true} is VALID [2018-11-23 12:17:29,849 INFO L273 TraceCheckUtils]: 107: Hoare triple {14832#true} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {14832#true} is VALID [2018-11-23 12:17:29,849 INFO L273 TraceCheckUtils]: 108: Hoare triple {14832#true} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {14832#true} is VALID [2018-11-23 12:17:29,849 INFO L273 TraceCheckUtils]: 109: Hoare triple {14832#true} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {14832#true} is VALID [2018-11-23 12:17:29,849 INFO L273 TraceCheckUtils]: 110: Hoare triple {14832#true} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {14832#true} is VALID [2018-11-23 12:17:29,849 INFO L273 TraceCheckUtils]: 111: Hoare triple {14832#true} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {14832#true} is VALID [2018-11-23 12:17:29,850 INFO L273 TraceCheckUtils]: 112: Hoare triple {14832#true} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {14832#true} is VALID [2018-11-23 12:17:29,850 INFO L273 TraceCheckUtils]: 113: Hoare triple {14832#true} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {14832#true} is VALID [2018-11-23 12:17:29,850 INFO L273 TraceCheckUtils]: 114: Hoare triple {14832#true} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {14832#true} is VALID [2018-11-23 12:17:29,850 INFO L273 TraceCheckUtils]: 115: Hoare triple {14832#true} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {14832#true} is VALID [2018-11-23 12:17:29,850 INFO L273 TraceCheckUtils]: 116: Hoare triple {14832#true} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {14832#true} is VALID [2018-11-23 12:17:29,850 INFO L273 TraceCheckUtils]: 117: Hoare triple {14832#true} assume !(~i~2 < 59); {14832#true} is VALID [2018-11-23 12:17:29,850 INFO L273 TraceCheckUtils]: 118: Hoare triple {14832#true} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {14832#true} is VALID [2018-11-23 12:17:29,850 INFO L256 TraceCheckUtils]: 119: Hoare triple {14832#true} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {14832#true} is VALID [2018-11-23 12:17:29,851 INFO L273 TraceCheckUtils]: 120: Hoare triple {14832#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {15220#(<= sep_~i~0 0)} is VALID [2018-11-23 12:17:29,851 INFO L273 TraceCheckUtils]: 121: Hoare triple {15220#(<= sep_~i~0 0)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15220#(<= sep_~i~0 0)} is VALID [2018-11-23 12:17:29,851 INFO L273 TraceCheckUtils]: 122: Hoare triple {15220#(<= sep_~i~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15220#(<= sep_~i~0 0)} is VALID [2018-11-23 12:17:29,852 INFO L273 TraceCheckUtils]: 123: Hoare triple {15220#(<= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15230#(<= sep_~i~0 1)} is VALID [2018-11-23 12:17:29,853 INFO L273 TraceCheckUtils]: 124: Hoare triple {15230#(<= sep_~i~0 1)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15230#(<= sep_~i~0 1)} is VALID [2018-11-23 12:17:29,853 INFO L273 TraceCheckUtils]: 125: Hoare triple {15230#(<= sep_~i~0 1)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15230#(<= sep_~i~0 1)} is VALID [2018-11-23 12:17:29,853 INFO L273 TraceCheckUtils]: 126: Hoare triple {15230#(<= sep_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15240#(<= sep_~i~0 2)} is VALID [2018-11-23 12:17:29,854 INFO L273 TraceCheckUtils]: 127: Hoare triple {15240#(<= sep_~i~0 2)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15240#(<= sep_~i~0 2)} is VALID [2018-11-23 12:17:29,854 INFO L273 TraceCheckUtils]: 128: Hoare triple {15240#(<= sep_~i~0 2)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15240#(<= sep_~i~0 2)} is VALID [2018-11-23 12:17:29,855 INFO L273 TraceCheckUtils]: 129: Hoare triple {15240#(<= sep_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15250#(<= sep_~i~0 3)} is VALID [2018-11-23 12:17:29,855 INFO L273 TraceCheckUtils]: 130: Hoare triple {15250#(<= sep_~i~0 3)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15250#(<= sep_~i~0 3)} is VALID [2018-11-23 12:17:29,855 INFO L273 TraceCheckUtils]: 131: Hoare triple {15250#(<= sep_~i~0 3)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15250#(<= sep_~i~0 3)} is VALID [2018-11-23 12:17:29,856 INFO L273 TraceCheckUtils]: 132: Hoare triple {15250#(<= sep_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15260#(<= sep_~i~0 4)} is VALID [2018-11-23 12:17:29,857 INFO L273 TraceCheckUtils]: 133: Hoare triple {15260#(<= sep_~i~0 4)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15260#(<= sep_~i~0 4)} is VALID [2018-11-23 12:17:29,857 INFO L273 TraceCheckUtils]: 134: Hoare triple {15260#(<= sep_~i~0 4)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15260#(<= sep_~i~0 4)} is VALID [2018-11-23 12:17:29,858 INFO L273 TraceCheckUtils]: 135: Hoare triple {15260#(<= sep_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15270#(<= sep_~i~0 5)} is VALID [2018-11-23 12:17:29,858 INFO L273 TraceCheckUtils]: 136: Hoare triple {15270#(<= sep_~i~0 5)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15270#(<= sep_~i~0 5)} is VALID [2018-11-23 12:17:29,859 INFO L273 TraceCheckUtils]: 137: Hoare triple {15270#(<= sep_~i~0 5)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15270#(<= sep_~i~0 5)} is VALID [2018-11-23 12:17:29,859 INFO L273 TraceCheckUtils]: 138: Hoare triple {15270#(<= sep_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15280#(<= sep_~i~0 6)} is VALID [2018-11-23 12:17:29,860 INFO L273 TraceCheckUtils]: 139: Hoare triple {15280#(<= sep_~i~0 6)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15280#(<= sep_~i~0 6)} is VALID [2018-11-23 12:17:29,860 INFO L273 TraceCheckUtils]: 140: Hoare triple {15280#(<= sep_~i~0 6)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15280#(<= sep_~i~0 6)} is VALID [2018-11-23 12:17:29,861 INFO L273 TraceCheckUtils]: 141: Hoare triple {15280#(<= sep_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15290#(<= sep_~i~0 7)} is VALID [2018-11-23 12:17:29,862 INFO L273 TraceCheckUtils]: 142: Hoare triple {15290#(<= sep_~i~0 7)} assume !(~i~0 < 60); {14833#false} is VALID [2018-11-23 12:17:29,862 INFO L273 TraceCheckUtils]: 143: Hoare triple {14833#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {14833#false} is VALID [2018-11-23 12:17:29,862 INFO L273 TraceCheckUtils]: 144: Hoare triple {14833#false} assume true; {14833#false} is VALID [2018-11-23 12:17:29,862 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {14833#false} {14832#true} #79#return; {14833#false} is VALID [2018-11-23 12:17:29,862 INFO L273 TraceCheckUtils]: 146: Hoare triple {14833#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {14833#false} is VALID [2018-11-23 12:17:29,862 INFO L273 TraceCheckUtils]: 147: Hoare triple {14833#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {14833#false} is VALID [2018-11-23 12:17:29,863 INFO L273 TraceCheckUtils]: 148: Hoare triple {14833#false} assume !false; {14833#false} is VALID [2018-11-23 12:17:29,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1217 backedges. 330 proven. 70 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked. [2018-11-23 12:17:29,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:29,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 10] total 33 [2018-11-23 12:17:29,892 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 149 [2018-11-23 12:17:29,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:29,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 12:17:29,999 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-23 12:17:29,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 12:17:29,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 12:17:30,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=712, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:17:30,000 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 33 states. [2018-11-23 12:17:30,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:30,664 INFO L93 Difference]: Finished difference Result 153 states and 181 transitions. [2018-11-23 12:17:30,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 12:17:30,664 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 149 [2018-11-23 12:17:30,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:30,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:17:30,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 138 transitions. [2018-11-23 12:17:30,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:17:30,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 138 transitions. [2018-11-23 12:17:30,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 138 transitions. [2018-11-23 12:17:30,807 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-23 12:17:30,809 INFO L225 Difference]: With dead ends: 153 [2018-11-23 12:17:30,810 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 12:17:30,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=344, Invalid=712, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:17:30,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 12:17:30,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2018-11-23 12:17:30,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:30,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 103 states. [2018-11-23 12:17:30,845 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 103 states. [2018-11-23 12:17:30,845 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 103 states. [2018-11-23 12:17:30,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:30,848 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2018-11-23 12:17:30,848 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2018-11-23 12:17:30,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:30,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:30,849 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 106 states. [2018-11-23 12:17:30,849 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 106 states. [2018-11-23 12:17:30,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:30,851 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2018-11-23 12:17:30,851 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2018-11-23 12:17:30,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:30,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:30,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:30,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:30,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-23 12:17:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2018-11-23 12:17:30,854 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 149 [2018-11-23 12:17:30,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:30,854 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2018-11-23 12:17:30,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 12:17:30,855 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2018-11-23 12:17:30,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-23 12:17:30,856 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:30,856 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:17:30,856 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:30,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:30,856 INFO L82 PathProgramCache]: Analyzing trace with hash 789597626, now seen corresponding path program 23 times [2018-11-23 12:17:30,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:30,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:30,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:30,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:30,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:32,533 INFO L256 TraceCheckUtils]: 0: Hoare triple {15891#true} call ULTIMATE.init(); {15891#true} is VALID [2018-11-23 12:17:32,533 INFO L273 TraceCheckUtils]: 1: Hoare triple {15891#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15891#true} is VALID [2018-11-23 12:17:32,533 INFO L273 TraceCheckUtils]: 2: Hoare triple {15891#true} assume true; {15891#true} is VALID [2018-11-23 12:17:32,533 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15891#true} {15891#true} #71#return; {15891#true} is VALID [2018-11-23 12:17:32,533 INFO L256 TraceCheckUtils]: 4: Hoare triple {15891#true} call #t~ret14 := main(); {15891#true} is VALID [2018-11-23 12:17:32,534 INFO L273 TraceCheckUtils]: 5: Hoare triple {15891#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {15893#(= main_~i~1 0)} is VALID [2018-11-23 12:17:32,534 INFO L273 TraceCheckUtils]: 6: Hoare triple {15893#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15893#(= main_~i~1 0)} is VALID [2018-11-23 12:17:32,535 INFO L273 TraceCheckUtils]: 7: Hoare triple {15893#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15894#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:32,535 INFO L273 TraceCheckUtils]: 8: Hoare triple {15894#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15894#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:32,536 INFO L273 TraceCheckUtils]: 9: Hoare triple {15894#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15895#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:32,536 INFO L273 TraceCheckUtils]: 10: Hoare triple {15895#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15895#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:32,537 INFO L273 TraceCheckUtils]: 11: Hoare triple {15895#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15896#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:32,537 INFO L273 TraceCheckUtils]: 12: Hoare triple {15896#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15896#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:32,537 INFO L273 TraceCheckUtils]: 13: Hoare triple {15896#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15897#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:32,538 INFO L273 TraceCheckUtils]: 14: Hoare triple {15897#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15897#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:32,538 INFO L273 TraceCheckUtils]: 15: Hoare triple {15897#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15898#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:32,539 INFO L273 TraceCheckUtils]: 16: Hoare triple {15898#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15898#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:32,539 INFO L273 TraceCheckUtils]: 17: Hoare triple {15898#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15899#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:32,540 INFO L273 TraceCheckUtils]: 18: Hoare triple {15899#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15899#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:32,540 INFO L273 TraceCheckUtils]: 19: Hoare triple {15899#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15900#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:32,541 INFO L273 TraceCheckUtils]: 20: Hoare triple {15900#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15900#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:32,542 INFO L273 TraceCheckUtils]: 21: Hoare triple {15900#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15901#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:32,542 INFO L273 TraceCheckUtils]: 22: Hoare triple {15901#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15901#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:32,543 INFO L273 TraceCheckUtils]: 23: Hoare triple {15901#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15902#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:32,543 INFO L273 TraceCheckUtils]: 24: Hoare triple {15902#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15902#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:32,544 INFO L273 TraceCheckUtils]: 25: Hoare triple {15902#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15903#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:32,545 INFO L273 TraceCheckUtils]: 26: Hoare triple {15903#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15903#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:32,545 INFO L273 TraceCheckUtils]: 27: Hoare triple {15903#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15904#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:32,546 INFO L273 TraceCheckUtils]: 28: Hoare triple {15904#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15904#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:32,546 INFO L273 TraceCheckUtils]: 29: Hoare triple {15904#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15905#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:32,547 INFO L273 TraceCheckUtils]: 30: Hoare triple {15905#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15905#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:32,548 INFO L273 TraceCheckUtils]: 31: Hoare triple {15905#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15906#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:32,548 INFO L273 TraceCheckUtils]: 32: Hoare triple {15906#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15906#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:32,549 INFO L273 TraceCheckUtils]: 33: Hoare triple {15906#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15907#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:32,549 INFO L273 TraceCheckUtils]: 34: Hoare triple {15907#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15907#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:32,550 INFO L273 TraceCheckUtils]: 35: Hoare triple {15907#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15908#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:32,550 INFO L273 TraceCheckUtils]: 36: Hoare triple {15908#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15908#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:32,551 INFO L273 TraceCheckUtils]: 37: Hoare triple {15908#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15909#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:32,552 INFO L273 TraceCheckUtils]: 38: Hoare triple {15909#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15909#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:32,552 INFO L273 TraceCheckUtils]: 39: Hoare triple {15909#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15910#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:32,553 INFO L273 TraceCheckUtils]: 40: Hoare triple {15910#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15910#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:32,553 INFO L273 TraceCheckUtils]: 41: Hoare triple {15910#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15911#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:32,554 INFO L273 TraceCheckUtils]: 42: Hoare triple {15911#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15911#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:32,555 INFO L273 TraceCheckUtils]: 43: Hoare triple {15911#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15912#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:32,555 INFO L273 TraceCheckUtils]: 44: Hoare triple {15912#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15912#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:32,556 INFO L273 TraceCheckUtils]: 45: Hoare triple {15912#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15913#(<= main_~i~1 20)} is VALID [2018-11-23 12:17:32,556 INFO L273 TraceCheckUtils]: 46: Hoare triple {15913#(<= main_~i~1 20)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15913#(<= main_~i~1 20)} is VALID [2018-11-23 12:17:32,557 INFO L273 TraceCheckUtils]: 47: Hoare triple {15913#(<= main_~i~1 20)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15914#(<= main_~i~1 21)} is VALID [2018-11-23 12:17:32,557 INFO L273 TraceCheckUtils]: 48: Hoare triple {15914#(<= main_~i~1 21)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15914#(<= main_~i~1 21)} is VALID [2018-11-23 12:17:32,558 INFO L273 TraceCheckUtils]: 49: Hoare triple {15914#(<= main_~i~1 21)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15915#(<= main_~i~1 22)} is VALID [2018-11-23 12:17:32,559 INFO L273 TraceCheckUtils]: 50: Hoare triple {15915#(<= main_~i~1 22)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15915#(<= main_~i~1 22)} is VALID [2018-11-23 12:17:32,559 INFO L273 TraceCheckUtils]: 51: Hoare triple {15915#(<= main_~i~1 22)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15916#(<= main_~i~1 23)} is VALID [2018-11-23 12:17:32,560 INFO L273 TraceCheckUtils]: 52: Hoare triple {15916#(<= main_~i~1 23)} assume !(~i~1 < 60); {15892#false} is VALID [2018-11-23 12:17:32,560 INFO L256 TraceCheckUtils]: 53: Hoare triple {15892#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {15891#true} is VALID [2018-11-23 12:17:32,560 INFO L273 TraceCheckUtils]: 54: Hoare triple {15891#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {15891#true} is VALID [2018-11-23 12:17:32,561 INFO L273 TraceCheckUtils]: 55: Hoare triple {15891#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15891#true} is VALID [2018-11-23 12:17:32,561 INFO L273 TraceCheckUtils]: 56: Hoare triple {15891#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15891#true} is VALID [2018-11-23 12:17:32,561 INFO L273 TraceCheckUtils]: 57: Hoare triple {15891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15891#true} is VALID [2018-11-23 12:17:32,561 INFO L273 TraceCheckUtils]: 58: Hoare triple {15891#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15891#true} is VALID [2018-11-23 12:17:32,561 INFO L273 TraceCheckUtils]: 59: Hoare triple {15891#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15891#true} is VALID [2018-11-23 12:17:32,561 INFO L273 TraceCheckUtils]: 60: Hoare triple {15891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15891#true} is VALID [2018-11-23 12:17:32,562 INFO L273 TraceCheckUtils]: 61: Hoare triple {15891#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15891#true} is VALID [2018-11-23 12:17:32,562 INFO L273 TraceCheckUtils]: 62: Hoare triple {15891#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15891#true} is VALID [2018-11-23 12:17:32,562 INFO L273 TraceCheckUtils]: 63: Hoare triple {15891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15891#true} is VALID [2018-11-23 12:17:32,562 INFO L273 TraceCheckUtils]: 64: Hoare triple {15891#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15891#true} is VALID [2018-11-23 12:17:32,562 INFO L273 TraceCheckUtils]: 65: Hoare triple {15891#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15891#true} is VALID [2018-11-23 12:17:32,563 INFO L273 TraceCheckUtils]: 66: Hoare triple {15891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15891#true} is VALID [2018-11-23 12:17:32,563 INFO L273 TraceCheckUtils]: 67: Hoare triple {15891#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15891#true} is VALID [2018-11-23 12:17:32,563 INFO L273 TraceCheckUtils]: 68: Hoare triple {15891#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15891#true} is VALID [2018-11-23 12:17:32,563 INFO L273 TraceCheckUtils]: 69: Hoare triple {15891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15891#true} is VALID [2018-11-23 12:17:32,563 INFO L273 TraceCheckUtils]: 70: Hoare triple {15891#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15891#true} is VALID [2018-11-23 12:17:32,563 INFO L273 TraceCheckUtils]: 71: Hoare triple {15891#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15891#true} is VALID [2018-11-23 12:17:32,564 INFO L273 TraceCheckUtils]: 72: Hoare triple {15891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15891#true} is VALID [2018-11-23 12:17:32,564 INFO L273 TraceCheckUtils]: 73: Hoare triple {15891#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15891#true} is VALID [2018-11-23 12:17:32,564 INFO L273 TraceCheckUtils]: 74: Hoare triple {15891#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15891#true} is VALID [2018-11-23 12:17:32,564 INFO L273 TraceCheckUtils]: 75: Hoare triple {15891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15891#true} is VALID [2018-11-23 12:17:32,564 INFO L273 TraceCheckUtils]: 76: Hoare triple {15891#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15891#true} is VALID [2018-11-23 12:17:32,564 INFO L273 TraceCheckUtils]: 77: Hoare triple {15891#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15891#true} is VALID [2018-11-23 12:17:32,564 INFO L273 TraceCheckUtils]: 78: Hoare triple {15891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15891#true} is VALID [2018-11-23 12:17:32,564 INFO L273 TraceCheckUtils]: 79: Hoare triple {15891#true} assume !(~i~0 < 60); {15891#true} is VALID [2018-11-23 12:17:32,565 INFO L273 TraceCheckUtils]: 80: Hoare triple {15891#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {15891#true} is VALID [2018-11-23 12:17:32,565 INFO L273 TraceCheckUtils]: 81: Hoare triple {15891#true} assume true; {15891#true} is VALID [2018-11-23 12:17:32,565 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {15891#true} {15892#false} #75#return; {15892#false} is VALID [2018-11-23 12:17:32,565 INFO L273 TraceCheckUtils]: 83: Hoare triple {15892#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {15892#false} is VALID [2018-11-23 12:17:32,565 INFO L256 TraceCheckUtils]: 84: Hoare triple {15892#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {15891#true} is VALID [2018-11-23 12:17:32,565 INFO L273 TraceCheckUtils]: 85: Hoare triple {15891#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {15891#true} is VALID [2018-11-23 12:17:32,565 INFO L273 TraceCheckUtils]: 86: Hoare triple {15891#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15891#true} is VALID [2018-11-23 12:17:32,565 INFO L273 TraceCheckUtils]: 87: Hoare triple {15891#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15891#true} is VALID [2018-11-23 12:17:32,566 INFO L273 TraceCheckUtils]: 88: Hoare triple {15891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15891#true} is VALID [2018-11-23 12:17:32,566 INFO L273 TraceCheckUtils]: 89: Hoare triple {15891#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15891#true} is VALID [2018-11-23 12:17:32,566 INFO L273 TraceCheckUtils]: 90: Hoare triple {15891#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15891#true} is VALID [2018-11-23 12:17:32,566 INFO L273 TraceCheckUtils]: 91: Hoare triple {15891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15891#true} is VALID [2018-11-23 12:17:32,566 INFO L273 TraceCheckUtils]: 92: Hoare triple {15891#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15891#true} is VALID [2018-11-23 12:17:32,566 INFO L273 TraceCheckUtils]: 93: Hoare triple {15891#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15891#true} is VALID [2018-11-23 12:17:32,567 INFO L273 TraceCheckUtils]: 94: Hoare triple {15891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15891#true} is VALID [2018-11-23 12:17:32,567 INFO L273 TraceCheckUtils]: 95: Hoare triple {15891#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15891#true} is VALID [2018-11-23 12:17:32,567 INFO L273 TraceCheckUtils]: 96: Hoare triple {15891#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15891#true} is VALID [2018-11-23 12:17:32,567 INFO L273 TraceCheckUtils]: 97: Hoare triple {15891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15891#true} is VALID [2018-11-23 12:17:32,567 INFO L273 TraceCheckUtils]: 98: Hoare triple {15891#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15891#true} is VALID [2018-11-23 12:17:32,567 INFO L273 TraceCheckUtils]: 99: Hoare triple {15891#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15891#true} is VALID [2018-11-23 12:17:32,567 INFO L273 TraceCheckUtils]: 100: Hoare triple {15891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15891#true} is VALID [2018-11-23 12:17:32,568 INFO L273 TraceCheckUtils]: 101: Hoare triple {15891#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15891#true} is VALID [2018-11-23 12:17:32,568 INFO L273 TraceCheckUtils]: 102: Hoare triple {15891#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15891#true} is VALID [2018-11-23 12:17:32,568 INFO L273 TraceCheckUtils]: 103: Hoare triple {15891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15891#true} is VALID [2018-11-23 12:17:32,568 INFO L273 TraceCheckUtils]: 104: Hoare triple {15891#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15891#true} is VALID [2018-11-23 12:17:32,568 INFO L273 TraceCheckUtils]: 105: Hoare triple {15891#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15891#true} is VALID [2018-11-23 12:17:32,568 INFO L273 TraceCheckUtils]: 106: Hoare triple {15891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15891#true} is VALID [2018-11-23 12:17:32,568 INFO L273 TraceCheckUtils]: 107: Hoare triple {15891#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15891#true} is VALID [2018-11-23 12:17:32,569 INFO L273 TraceCheckUtils]: 108: Hoare triple {15891#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15891#true} is VALID [2018-11-23 12:17:32,569 INFO L273 TraceCheckUtils]: 109: Hoare triple {15891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15891#true} is VALID [2018-11-23 12:17:32,569 INFO L273 TraceCheckUtils]: 110: Hoare triple {15891#true} assume !(~i~0 < 60); {15891#true} is VALID [2018-11-23 12:17:32,569 INFO L273 TraceCheckUtils]: 111: Hoare triple {15891#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {15891#true} is VALID [2018-11-23 12:17:32,569 INFO L273 TraceCheckUtils]: 112: Hoare triple {15891#true} assume true; {15891#true} is VALID [2018-11-23 12:17:32,569 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {15891#true} {15892#false} #77#return; {15892#false} is VALID [2018-11-23 12:17:32,569 INFO L273 TraceCheckUtils]: 114: Hoare triple {15892#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {15892#false} is VALID [2018-11-23 12:17:32,569 INFO L273 TraceCheckUtils]: 115: Hoare triple {15892#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {15892#false} is VALID [2018-11-23 12:17:32,569 INFO L273 TraceCheckUtils]: 116: Hoare triple {15892#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {15892#false} is VALID [2018-11-23 12:17:32,570 INFO L273 TraceCheckUtils]: 117: Hoare triple {15892#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {15892#false} is VALID [2018-11-23 12:17:32,570 INFO L273 TraceCheckUtils]: 118: Hoare triple {15892#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {15892#false} is VALID [2018-11-23 12:17:32,570 INFO L273 TraceCheckUtils]: 119: Hoare triple {15892#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {15892#false} is VALID [2018-11-23 12:17:32,570 INFO L273 TraceCheckUtils]: 120: Hoare triple {15892#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {15892#false} is VALID [2018-11-23 12:17:32,570 INFO L273 TraceCheckUtils]: 121: Hoare triple {15892#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {15892#false} is VALID [2018-11-23 12:17:32,570 INFO L273 TraceCheckUtils]: 122: Hoare triple {15892#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {15892#false} is VALID [2018-11-23 12:17:32,570 INFO L273 TraceCheckUtils]: 123: Hoare triple {15892#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {15892#false} is VALID [2018-11-23 12:17:32,570 INFO L273 TraceCheckUtils]: 124: Hoare triple {15892#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {15892#false} is VALID [2018-11-23 12:17:32,570 INFO L273 TraceCheckUtils]: 125: Hoare triple {15892#false} assume !(~i~2 < 59); {15892#false} is VALID [2018-11-23 12:17:32,571 INFO L273 TraceCheckUtils]: 126: Hoare triple {15892#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {15892#false} is VALID [2018-11-23 12:17:32,571 INFO L256 TraceCheckUtils]: 127: Hoare triple {15892#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {15891#true} is VALID [2018-11-23 12:17:32,571 INFO L273 TraceCheckUtils]: 128: Hoare triple {15891#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {15891#true} is VALID [2018-11-23 12:17:32,571 INFO L273 TraceCheckUtils]: 129: Hoare triple {15891#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15891#true} is VALID [2018-11-23 12:17:32,571 INFO L273 TraceCheckUtils]: 130: Hoare triple {15891#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15891#true} is VALID [2018-11-23 12:17:32,571 INFO L273 TraceCheckUtils]: 131: Hoare triple {15891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15891#true} is VALID [2018-11-23 12:17:32,571 INFO L273 TraceCheckUtils]: 132: Hoare triple {15891#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15891#true} is VALID [2018-11-23 12:17:32,571 INFO L273 TraceCheckUtils]: 133: Hoare triple {15891#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15891#true} is VALID [2018-11-23 12:17:32,571 INFO L273 TraceCheckUtils]: 134: Hoare triple {15891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15891#true} is VALID [2018-11-23 12:17:32,572 INFO L273 TraceCheckUtils]: 135: Hoare triple {15891#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15891#true} is VALID [2018-11-23 12:17:32,572 INFO L273 TraceCheckUtils]: 136: Hoare triple {15891#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15891#true} is VALID [2018-11-23 12:17:32,572 INFO L273 TraceCheckUtils]: 137: Hoare triple {15891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15891#true} is VALID [2018-11-23 12:17:32,572 INFO L273 TraceCheckUtils]: 138: Hoare triple {15891#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15891#true} is VALID [2018-11-23 12:17:32,572 INFO L273 TraceCheckUtils]: 139: Hoare triple {15891#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15891#true} is VALID [2018-11-23 12:17:32,572 INFO L273 TraceCheckUtils]: 140: Hoare triple {15891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15891#true} is VALID [2018-11-23 12:17:32,572 INFO L273 TraceCheckUtils]: 141: Hoare triple {15891#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15891#true} is VALID [2018-11-23 12:17:32,573 INFO L273 TraceCheckUtils]: 142: Hoare triple {15891#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15891#true} is VALID [2018-11-23 12:17:32,573 INFO L273 TraceCheckUtils]: 143: Hoare triple {15891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15891#true} is VALID [2018-11-23 12:17:32,573 INFO L273 TraceCheckUtils]: 144: Hoare triple {15891#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15891#true} is VALID [2018-11-23 12:17:32,573 INFO L273 TraceCheckUtils]: 145: Hoare triple {15891#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15891#true} is VALID [2018-11-23 12:17:32,573 INFO L273 TraceCheckUtils]: 146: Hoare triple {15891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15891#true} is VALID [2018-11-23 12:17:32,573 INFO L273 TraceCheckUtils]: 147: Hoare triple {15891#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15891#true} is VALID [2018-11-23 12:17:32,573 INFO L273 TraceCheckUtils]: 148: Hoare triple {15891#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15891#true} is VALID [2018-11-23 12:17:32,573 INFO L273 TraceCheckUtils]: 149: Hoare triple {15891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15891#true} is VALID [2018-11-23 12:17:32,573 INFO L273 TraceCheckUtils]: 150: Hoare triple {15891#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15891#true} is VALID [2018-11-23 12:17:32,573 INFO L273 TraceCheckUtils]: 151: Hoare triple {15891#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15891#true} is VALID [2018-11-23 12:17:32,574 INFO L273 TraceCheckUtils]: 152: Hoare triple {15891#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15891#true} is VALID [2018-11-23 12:17:32,574 INFO L273 TraceCheckUtils]: 153: Hoare triple {15891#true} assume !(~i~0 < 60); {15891#true} is VALID [2018-11-23 12:17:32,574 INFO L273 TraceCheckUtils]: 154: Hoare triple {15891#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {15891#true} is VALID [2018-11-23 12:17:32,574 INFO L273 TraceCheckUtils]: 155: Hoare triple {15891#true} assume true; {15891#true} is VALID [2018-11-23 12:17:32,574 INFO L268 TraceCheckUtils]: 156: Hoare quadruple {15891#true} {15892#false} #79#return; {15892#false} is VALID [2018-11-23 12:17:32,574 INFO L273 TraceCheckUtils]: 157: Hoare triple {15892#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {15892#false} is VALID [2018-11-23 12:17:32,574 INFO L273 TraceCheckUtils]: 158: Hoare triple {15892#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {15892#false} is VALID [2018-11-23 12:17:32,574 INFO L273 TraceCheckUtils]: 159: Hoare triple {15892#false} assume !false; {15892#false} is VALID [2018-11-23 12:17:32,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1469 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2018-11-23 12:17:32,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:32,585 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:17:32,595 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:17:35,466 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2018-11-23 12:17:35,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:35,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:35,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:36,503 INFO L256 TraceCheckUtils]: 0: Hoare triple {15891#true} call ULTIMATE.init(); {15891#true} is VALID [2018-11-23 12:17:36,504 INFO L273 TraceCheckUtils]: 1: Hoare triple {15891#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15891#true} is VALID [2018-11-23 12:17:36,504 INFO L273 TraceCheckUtils]: 2: Hoare triple {15891#true} assume true; {15891#true} is VALID [2018-11-23 12:17:36,504 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15891#true} {15891#true} #71#return; {15891#true} is VALID [2018-11-23 12:17:36,504 INFO L256 TraceCheckUtils]: 4: Hoare triple {15891#true} call #t~ret14 := main(); {15891#true} is VALID [2018-11-23 12:17:36,505 INFO L273 TraceCheckUtils]: 5: Hoare triple {15891#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {15891#true} is VALID [2018-11-23 12:17:36,505 INFO L273 TraceCheckUtils]: 6: Hoare triple {15891#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15891#true} is VALID [2018-11-23 12:17:36,505 INFO L273 TraceCheckUtils]: 7: Hoare triple {15891#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15891#true} is VALID [2018-11-23 12:17:36,505 INFO L273 TraceCheckUtils]: 8: Hoare triple {15891#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15891#true} is VALID [2018-11-23 12:17:36,505 INFO L273 TraceCheckUtils]: 9: Hoare triple {15891#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15891#true} is VALID [2018-11-23 12:17:36,505 INFO L273 TraceCheckUtils]: 10: Hoare triple {15891#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15891#true} is VALID [2018-11-23 12:17:36,506 INFO L273 TraceCheckUtils]: 11: Hoare triple {15891#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15891#true} is VALID [2018-11-23 12:17:36,506 INFO L273 TraceCheckUtils]: 12: Hoare triple {15891#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15891#true} is VALID [2018-11-23 12:17:36,506 INFO L273 TraceCheckUtils]: 13: Hoare triple {15891#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15891#true} is VALID [2018-11-23 12:17:36,506 INFO L273 TraceCheckUtils]: 14: Hoare triple {15891#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15891#true} is VALID [2018-11-23 12:17:36,506 INFO L273 TraceCheckUtils]: 15: Hoare triple {15891#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15891#true} is VALID [2018-11-23 12:17:36,506 INFO L273 TraceCheckUtils]: 16: Hoare triple {15891#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15891#true} is VALID [2018-11-23 12:17:36,506 INFO L273 TraceCheckUtils]: 17: Hoare triple {15891#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15891#true} is VALID [2018-11-23 12:17:36,506 INFO L273 TraceCheckUtils]: 18: Hoare triple {15891#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15891#true} is VALID [2018-11-23 12:17:36,506 INFO L273 TraceCheckUtils]: 19: Hoare triple {15891#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15891#true} is VALID [2018-11-23 12:17:36,506 INFO L273 TraceCheckUtils]: 20: Hoare triple {15891#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15891#true} is VALID [2018-11-23 12:17:36,507 INFO L273 TraceCheckUtils]: 21: Hoare triple {15891#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15891#true} is VALID [2018-11-23 12:17:36,507 INFO L273 TraceCheckUtils]: 22: Hoare triple {15891#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15891#true} is VALID [2018-11-23 12:17:36,507 INFO L273 TraceCheckUtils]: 23: Hoare triple {15891#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15891#true} is VALID [2018-11-23 12:17:36,507 INFO L273 TraceCheckUtils]: 24: Hoare triple {15891#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15891#true} is VALID [2018-11-23 12:17:36,507 INFO L273 TraceCheckUtils]: 25: Hoare triple {15891#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15891#true} is VALID [2018-11-23 12:17:36,507 INFO L273 TraceCheckUtils]: 26: Hoare triple {15891#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15891#true} is VALID [2018-11-23 12:17:36,507 INFO L273 TraceCheckUtils]: 27: Hoare triple {15891#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15891#true} is VALID [2018-11-23 12:17:36,507 INFO L273 TraceCheckUtils]: 28: Hoare triple {15891#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15891#true} is VALID [2018-11-23 12:17:36,507 INFO L273 TraceCheckUtils]: 29: Hoare triple {15891#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15891#true} is VALID [2018-11-23 12:17:36,508 INFO L273 TraceCheckUtils]: 30: Hoare triple {15891#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15891#true} is VALID [2018-11-23 12:17:36,508 INFO L273 TraceCheckUtils]: 31: Hoare triple {15891#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15891#true} is VALID [2018-11-23 12:17:36,508 INFO L273 TraceCheckUtils]: 32: Hoare triple {15891#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15891#true} is VALID [2018-11-23 12:17:36,508 INFO L273 TraceCheckUtils]: 33: Hoare triple {15891#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15891#true} is VALID [2018-11-23 12:17:36,508 INFO L273 TraceCheckUtils]: 34: Hoare triple {15891#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15891#true} is VALID [2018-11-23 12:17:36,508 INFO L273 TraceCheckUtils]: 35: Hoare triple {15891#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15891#true} is VALID [2018-11-23 12:17:36,508 INFO L273 TraceCheckUtils]: 36: Hoare triple {15891#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15891#true} is VALID [2018-11-23 12:17:36,508 INFO L273 TraceCheckUtils]: 37: Hoare triple {15891#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15891#true} is VALID [2018-11-23 12:17:36,508 INFO L273 TraceCheckUtils]: 38: Hoare triple {15891#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15891#true} is VALID [2018-11-23 12:17:36,509 INFO L273 TraceCheckUtils]: 39: Hoare triple {15891#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15891#true} is VALID [2018-11-23 12:17:36,509 INFO L273 TraceCheckUtils]: 40: Hoare triple {15891#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15891#true} is VALID [2018-11-23 12:17:36,509 INFO L273 TraceCheckUtils]: 41: Hoare triple {15891#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15891#true} is VALID [2018-11-23 12:17:36,509 INFO L273 TraceCheckUtils]: 42: Hoare triple {15891#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15891#true} is VALID [2018-11-23 12:17:36,509 INFO L273 TraceCheckUtils]: 43: Hoare triple {15891#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15891#true} is VALID [2018-11-23 12:17:36,509 INFO L273 TraceCheckUtils]: 44: Hoare triple {15891#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15891#true} is VALID [2018-11-23 12:17:36,509 INFO L273 TraceCheckUtils]: 45: Hoare triple {15891#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15891#true} is VALID [2018-11-23 12:17:36,509 INFO L273 TraceCheckUtils]: 46: Hoare triple {15891#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15891#true} is VALID [2018-11-23 12:17:36,509 INFO L273 TraceCheckUtils]: 47: Hoare triple {15891#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15891#true} is VALID [2018-11-23 12:17:36,510 INFO L273 TraceCheckUtils]: 48: Hoare triple {15891#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15891#true} is VALID [2018-11-23 12:17:36,510 INFO L273 TraceCheckUtils]: 49: Hoare triple {15891#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15891#true} is VALID [2018-11-23 12:17:36,510 INFO L273 TraceCheckUtils]: 50: Hoare triple {15891#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {15891#true} is VALID [2018-11-23 12:17:36,510 INFO L273 TraceCheckUtils]: 51: Hoare triple {15891#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15891#true} is VALID [2018-11-23 12:17:36,510 INFO L273 TraceCheckUtils]: 52: Hoare triple {15891#true} assume !(~i~1 < 60); {15891#true} is VALID [2018-11-23 12:17:36,510 INFO L256 TraceCheckUtils]: 53: Hoare triple {15891#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {15891#true} is VALID [2018-11-23 12:17:36,511 INFO L273 TraceCheckUtils]: 54: Hoare triple {15891#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {16082#(<= sep_~i~0 0)} is VALID [2018-11-23 12:17:36,511 INFO L273 TraceCheckUtils]: 55: Hoare triple {16082#(<= sep_~i~0 0)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {16082#(<= sep_~i~0 0)} is VALID [2018-11-23 12:17:36,511 INFO L273 TraceCheckUtils]: 56: Hoare triple {16082#(<= sep_~i~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {16082#(<= sep_~i~0 0)} is VALID [2018-11-23 12:17:36,512 INFO L273 TraceCheckUtils]: 57: Hoare triple {16082#(<= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16092#(<= sep_~i~0 1)} is VALID [2018-11-23 12:17:36,512 INFO L273 TraceCheckUtils]: 58: Hoare triple {16092#(<= sep_~i~0 1)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {16092#(<= sep_~i~0 1)} is VALID [2018-11-23 12:17:36,512 INFO L273 TraceCheckUtils]: 59: Hoare triple {16092#(<= sep_~i~0 1)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {16092#(<= sep_~i~0 1)} is VALID [2018-11-23 12:17:36,513 INFO L273 TraceCheckUtils]: 60: Hoare triple {16092#(<= sep_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16102#(<= sep_~i~0 2)} is VALID [2018-11-23 12:17:36,514 INFO L273 TraceCheckUtils]: 61: Hoare triple {16102#(<= sep_~i~0 2)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {16102#(<= sep_~i~0 2)} is VALID [2018-11-23 12:17:36,514 INFO L273 TraceCheckUtils]: 62: Hoare triple {16102#(<= sep_~i~0 2)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {16102#(<= sep_~i~0 2)} is VALID [2018-11-23 12:17:36,515 INFO L273 TraceCheckUtils]: 63: Hoare triple {16102#(<= sep_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16112#(<= sep_~i~0 3)} is VALID [2018-11-23 12:17:36,515 INFO L273 TraceCheckUtils]: 64: Hoare triple {16112#(<= sep_~i~0 3)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {16112#(<= sep_~i~0 3)} is VALID [2018-11-23 12:17:36,532 INFO L273 TraceCheckUtils]: 65: Hoare triple {16112#(<= sep_~i~0 3)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {16112#(<= sep_~i~0 3)} is VALID [2018-11-23 12:17:36,546 INFO L273 TraceCheckUtils]: 66: Hoare triple {16112#(<= sep_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16122#(<= sep_~i~0 4)} is VALID [2018-11-23 12:17:36,553 INFO L273 TraceCheckUtils]: 67: Hoare triple {16122#(<= sep_~i~0 4)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {16122#(<= sep_~i~0 4)} is VALID [2018-11-23 12:17:36,553 INFO L273 TraceCheckUtils]: 68: Hoare triple {16122#(<= sep_~i~0 4)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {16122#(<= sep_~i~0 4)} is VALID [2018-11-23 12:17:36,554 INFO L273 TraceCheckUtils]: 69: Hoare triple {16122#(<= sep_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16132#(<= sep_~i~0 5)} is VALID [2018-11-23 12:17:36,554 INFO L273 TraceCheckUtils]: 70: Hoare triple {16132#(<= sep_~i~0 5)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {16132#(<= sep_~i~0 5)} is VALID [2018-11-23 12:17:36,555 INFO L273 TraceCheckUtils]: 71: Hoare triple {16132#(<= sep_~i~0 5)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {16132#(<= sep_~i~0 5)} is VALID [2018-11-23 12:17:36,555 INFO L273 TraceCheckUtils]: 72: Hoare triple {16132#(<= sep_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16142#(<= sep_~i~0 6)} is VALID [2018-11-23 12:17:36,555 INFO L273 TraceCheckUtils]: 73: Hoare triple {16142#(<= sep_~i~0 6)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {16142#(<= sep_~i~0 6)} is VALID [2018-11-23 12:17:36,556 INFO L273 TraceCheckUtils]: 74: Hoare triple {16142#(<= sep_~i~0 6)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {16142#(<= sep_~i~0 6)} is VALID [2018-11-23 12:17:36,556 INFO L273 TraceCheckUtils]: 75: Hoare triple {16142#(<= sep_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16152#(<= sep_~i~0 7)} is VALID [2018-11-23 12:17:36,556 INFO L273 TraceCheckUtils]: 76: Hoare triple {16152#(<= sep_~i~0 7)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {16152#(<= sep_~i~0 7)} is VALID [2018-11-23 12:17:36,557 INFO L273 TraceCheckUtils]: 77: Hoare triple {16152#(<= sep_~i~0 7)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {16152#(<= sep_~i~0 7)} is VALID [2018-11-23 12:17:36,557 INFO L273 TraceCheckUtils]: 78: Hoare triple {16152#(<= sep_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {16162#(<= sep_~i~0 8)} is VALID [2018-11-23 12:17:36,558 INFO L273 TraceCheckUtils]: 79: Hoare triple {16162#(<= sep_~i~0 8)} assume !(~i~0 < 60); {15892#false} is VALID [2018-11-23 12:17:36,558 INFO L273 TraceCheckUtils]: 80: Hoare triple {15892#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {15892#false} is VALID [2018-11-23 12:17:36,559 INFO L273 TraceCheckUtils]: 81: Hoare triple {15892#false} assume true; {15892#false} is VALID [2018-11-23 12:17:36,559 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {15892#false} {15891#true} #75#return; {15892#false} is VALID [2018-11-23 12:17:36,559 INFO L273 TraceCheckUtils]: 83: Hoare triple {15892#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {15892#false} is VALID [2018-11-23 12:17:36,559 INFO L256 TraceCheckUtils]: 84: Hoare triple {15892#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {15892#false} is VALID [2018-11-23 12:17:36,559 INFO L273 TraceCheckUtils]: 85: Hoare triple {15892#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {15892#false} is VALID [2018-11-23 12:17:36,559 INFO L273 TraceCheckUtils]: 86: Hoare triple {15892#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15892#false} is VALID [2018-11-23 12:17:36,560 INFO L273 TraceCheckUtils]: 87: Hoare triple {15892#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15892#false} is VALID [2018-11-23 12:17:36,560 INFO L273 TraceCheckUtils]: 88: Hoare triple {15892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15892#false} is VALID [2018-11-23 12:17:36,560 INFO L273 TraceCheckUtils]: 89: Hoare triple {15892#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15892#false} is VALID [2018-11-23 12:17:36,560 INFO L273 TraceCheckUtils]: 90: Hoare triple {15892#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15892#false} is VALID [2018-11-23 12:17:36,560 INFO L273 TraceCheckUtils]: 91: Hoare triple {15892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15892#false} is VALID [2018-11-23 12:17:36,561 INFO L273 TraceCheckUtils]: 92: Hoare triple {15892#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15892#false} is VALID [2018-11-23 12:17:36,561 INFO L273 TraceCheckUtils]: 93: Hoare triple {15892#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15892#false} is VALID [2018-11-23 12:17:36,561 INFO L273 TraceCheckUtils]: 94: Hoare triple {15892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15892#false} is VALID [2018-11-23 12:17:36,561 INFO L273 TraceCheckUtils]: 95: Hoare triple {15892#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15892#false} is VALID [2018-11-23 12:17:36,561 INFO L273 TraceCheckUtils]: 96: Hoare triple {15892#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15892#false} is VALID [2018-11-23 12:17:36,561 INFO L273 TraceCheckUtils]: 97: Hoare triple {15892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15892#false} is VALID [2018-11-23 12:17:36,562 INFO L273 TraceCheckUtils]: 98: Hoare triple {15892#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15892#false} is VALID [2018-11-23 12:17:36,562 INFO L273 TraceCheckUtils]: 99: Hoare triple {15892#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15892#false} is VALID [2018-11-23 12:17:36,562 INFO L273 TraceCheckUtils]: 100: Hoare triple {15892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15892#false} is VALID [2018-11-23 12:17:36,562 INFO L273 TraceCheckUtils]: 101: Hoare triple {15892#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15892#false} is VALID [2018-11-23 12:17:36,562 INFO L273 TraceCheckUtils]: 102: Hoare triple {15892#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15892#false} is VALID [2018-11-23 12:17:36,562 INFO L273 TraceCheckUtils]: 103: Hoare triple {15892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15892#false} is VALID [2018-11-23 12:17:36,562 INFO L273 TraceCheckUtils]: 104: Hoare triple {15892#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15892#false} is VALID [2018-11-23 12:17:36,562 INFO L273 TraceCheckUtils]: 105: Hoare triple {15892#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15892#false} is VALID [2018-11-23 12:17:36,562 INFO L273 TraceCheckUtils]: 106: Hoare triple {15892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15892#false} is VALID [2018-11-23 12:17:36,563 INFO L273 TraceCheckUtils]: 107: Hoare triple {15892#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15892#false} is VALID [2018-11-23 12:17:36,563 INFO L273 TraceCheckUtils]: 108: Hoare triple {15892#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15892#false} is VALID [2018-11-23 12:17:36,563 INFO L273 TraceCheckUtils]: 109: Hoare triple {15892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15892#false} is VALID [2018-11-23 12:17:36,563 INFO L273 TraceCheckUtils]: 110: Hoare triple {15892#false} assume !(~i~0 < 60); {15892#false} is VALID [2018-11-23 12:17:36,563 INFO L273 TraceCheckUtils]: 111: Hoare triple {15892#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {15892#false} is VALID [2018-11-23 12:17:36,563 INFO L273 TraceCheckUtils]: 112: Hoare triple {15892#false} assume true; {15892#false} is VALID [2018-11-23 12:17:36,563 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {15892#false} {15892#false} #77#return; {15892#false} is VALID [2018-11-23 12:17:36,563 INFO L273 TraceCheckUtils]: 114: Hoare triple {15892#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {15892#false} is VALID [2018-11-23 12:17:36,563 INFO L273 TraceCheckUtils]: 115: Hoare triple {15892#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {15892#false} is VALID [2018-11-23 12:17:36,564 INFO L273 TraceCheckUtils]: 116: Hoare triple {15892#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {15892#false} is VALID [2018-11-23 12:17:36,564 INFO L273 TraceCheckUtils]: 117: Hoare triple {15892#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {15892#false} is VALID [2018-11-23 12:17:36,564 INFO L273 TraceCheckUtils]: 118: Hoare triple {15892#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {15892#false} is VALID [2018-11-23 12:17:36,564 INFO L273 TraceCheckUtils]: 119: Hoare triple {15892#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {15892#false} is VALID [2018-11-23 12:17:36,564 INFO L273 TraceCheckUtils]: 120: Hoare triple {15892#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {15892#false} is VALID [2018-11-23 12:17:36,564 INFO L273 TraceCheckUtils]: 121: Hoare triple {15892#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {15892#false} is VALID [2018-11-23 12:17:36,564 INFO L273 TraceCheckUtils]: 122: Hoare triple {15892#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {15892#false} is VALID [2018-11-23 12:17:36,564 INFO L273 TraceCheckUtils]: 123: Hoare triple {15892#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {15892#false} is VALID [2018-11-23 12:17:36,564 INFO L273 TraceCheckUtils]: 124: Hoare triple {15892#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {15892#false} is VALID [2018-11-23 12:17:36,564 INFO L273 TraceCheckUtils]: 125: Hoare triple {15892#false} assume !(~i~2 < 59); {15892#false} is VALID [2018-11-23 12:17:36,565 INFO L273 TraceCheckUtils]: 126: Hoare triple {15892#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {15892#false} is VALID [2018-11-23 12:17:36,565 INFO L256 TraceCheckUtils]: 127: Hoare triple {15892#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {15892#false} is VALID [2018-11-23 12:17:36,565 INFO L273 TraceCheckUtils]: 128: Hoare triple {15892#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {15892#false} is VALID [2018-11-23 12:17:36,565 INFO L273 TraceCheckUtils]: 129: Hoare triple {15892#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15892#false} is VALID [2018-11-23 12:17:36,565 INFO L273 TraceCheckUtils]: 130: Hoare triple {15892#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15892#false} is VALID [2018-11-23 12:17:36,565 INFO L273 TraceCheckUtils]: 131: Hoare triple {15892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15892#false} is VALID [2018-11-23 12:17:36,565 INFO L273 TraceCheckUtils]: 132: Hoare triple {15892#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15892#false} is VALID [2018-11-23 12:17:36,565 INFO L273 TraceCheckUtils]: 133: Hoare triple {15892#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15892#false} is VALID [2018-11-23 12:17:36,565 INFO L273 TraceCheckUtils]: 134: Hoare triple {15892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15892#false} is VALID [2018-11-23 12:17:36,566 INFO L273 TraceCheckUtils]: 135: Hoare triple {15892#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15892#false} is VALID [2018-11-23 12:17:36,566 INFO L273 TraceCheckUtils]: 136: Hoare triple {15892#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15892#false} is VALID [2018-11-23 12:17:36,566 INFO L273 TraceCheckUtils]: 137: Hoare triple {15892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15892#false} is VALID [2018-11-23 12:17:36,566 INFO L273 TraceCheckUtils]: 138: Hoare triple {15892#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15892#false} is VALID [2018-11-23 12:17:36,566 INFO L273 TraceCheckUtils]: 139: Hoare triple {15892#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15892#false} is VALID [2018-11-23 12:17:36,566 INFO L273 TraceCheckUtils]: 140: Hoare triple {15892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15892#false} is VALID [2018-11-23 12:17:36,566 INFO L273 TraceCheckUtils]: 141: Hoare triple {15892#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15892#false} is VALID [2018-11-23 12:17:36,566 INFO L273 TraceCheckUtils]: 142: Hoare triple {15892#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15892#false} is VALID [2018-11-23 12:17:36,566 INFO L273 TraceCheckUtils]: 143: Hoare triple {15892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15892#false} is VALID [2018-11-23 12:17:36,567 INFO L273 TraceCheckUtils]: 144: Hoare triple {15892#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15892#false} is VALID [2018-11-23 12:17:36,567 INFO L273 TraceCheckUtils]: 145: Hoare triple {15892#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15892#false} is VALID [2018-11-23 12:17:36,567 INFO L273 TraceCheckUtils]: 146: Hoare triple {15892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15892#false} is VALID [2018-11-23 12:17:36,567 INFO L273 TraceCheckUtils]: 147: Hoare triple {15892#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15892#false} is VALID [2018-11-23 12:17:36,567 INFO L273 TraceCheckUtils]: 148: Hoare triple {15892#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15892#false} is VALID [2018-11-23 12:17:36,567 INFO L273 TraceCheckUtils]: 149: Hoare triple {15892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15892#false} is VALID [2018-11-23 12:17:36,567 INFO L273 TraceCheckUtils]: 150: Hoare triple {15892#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {15892#false} is VALID [2018-11-23 12:17:36,567 INFO L273 TraceCheckUtils]: 151: Hoare triple {15892#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {15892#false} is VALID [2018-11-23 12:17:36,567 INFO L273 TraceCheckUtils]: 152: Hoare triple {15892#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15892#false} is VALID [2018-11-23 12:17:36,567 INFO L273 TraceCheckUtils]: 153: Hoare triple {15892#false} assume !(~i~0 < 60); {15892#false} is VALID [2018-11-23 12:17:36,568 INFO L273 TraceCheckUtils]: 154: Hoare triple {15892#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {15892#false} is VALID [2018-11-23 12:17:36,568 INFO L273 TraceCheckUtils]: 155: Hoare triple {15892#false} assume true; {15892#false} is VALID [2018-11-23 12:17:36,568 INFO L268 TraceCheckUtils]: 156: Hoare quadruple {15892#false} {15892#false} #79#return; {15892#false} is VALID [2018-11-23 12:17:36,568 INFO L273 TraceCheckUtils]: 157: Hoare triple {15892#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {15892#false} is VALID [2018-11-23 12:17:36,568 INFO L273 TraceCheckUtils]: 158: Hoare triple {15892#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {15892#false} is VALID [2018-11-23 12:17:36,568 INFO L273 TraceCheckUtils]: 159: Hoare triple {15892#false} assume !false; {15892#false} is VALID [2018-11-23 12:17:36,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1469 backedges. 420 proven. 92 refuted. 0 times theorem prover too weak. 957 trivial. 0 not checked. [2018-11-23 12:17:36,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:36,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 11] total 35 [2018-11-23 12:17:36,600 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 160 [2018-11-23 12:17:36,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:36,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:17:36,817 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:36,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:17:36,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:17:36,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=811, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:17:36,818 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 35 states. [2018-11-23 12:17:38,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:38,648 INFO L93 Difference]: Finished difference Result 161 states and 191 transitions. [2018-11-23 12:17:38,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:17:38,648 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 160 [2018-11-23 12:17:38,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:17:38,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 144 transitions. [2018-11-23 12:17:38,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:17:38,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 144 transitions. [2018-11-23 12:17:38,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 144 transitions. [2018-11-23 12:17:38,796 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-23 12:17:38,799 INFO L225 Difference]: With dead ends: 161 [2018-11-23 12:17:38,799 INFO L226 Difference]: Without dead ends: 111 [2018-11-23 12:17:38,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=379, Invalid=811, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:17:38,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-23 12:17:38,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2018-11-23 12:17:38,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:38,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 108 states. [2018-11-23 12:17:38,853 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 108 states. [2018-11-23 12:17:38,853 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 108 states. [2018-11-23 12:17:38,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:38,856 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2018-11-23 12:17:38,856 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2018-11-23 12:17:38,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:38,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:38,857 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 111 states. [2018-11-23 12:17:38,857 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 111 states. [2018-11-23 12:17:38,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:38,858 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2018-11-23 12:17:38,858 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2018-11-23 12:17:38,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:38,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:38,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:38,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:38,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-23 12:17:38,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2018-11-23 12:17:38,862 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 160 [2018-11-23 12:17:38,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:38,862 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2018-11-23 12:17:38,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:17:38,862 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2018-11-23 12:17:38,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-23 12:17:38,863 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:38,863 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 24, 24, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:17:38,864 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:38,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:38,864 INFO L82 PathProgramCache]: Analyzing trace with hash -617570183, now seen corresponding path program 24 times [2018-11-23 12:17:38,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:38,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:38,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:38,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:38,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:39,896 INFO L256 TraceCheckUtils]: 0: Hoare triple {17013#true} call ULTIMATE.init(); {17013#true} is VALID [2018-11-23 12:17:39,896 INFO L273 TraceCheckUtils]: 1: Hoare triple {17013#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17013#true} is VALID [2018-11-23 12:17:39,897 INFO L273 TraceCheckUtils]: 2: Hoare triple {17013#true} assume true; {17013#true} is VALID [2018-11-23 12:17:39,897 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17013#true} {17013#true} #71#return; {17013#true} is VALID [2018-11-23 12:17:39,897 INFO L256 TraceCheckUtils]: 4: Hoare triple {17013#true} call #t~ret14 := main(); {17013#true} is VALID [2018-11-23 12:17:39,898 INFO L273 TraceCheckUtils]: 5: Hoare triple {17013#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {17015#(= main_~i~1 0)} is VALID [2018-11-23 12:17:39,898 INFO L273 TraceCheckUtils]: 6: Hoare triple {17015#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17015#(= main_~i~1 0)} is VALID [2018-11-23 12:17:39,899 INFO L273 TraceCheckUtils]: 7: Hoare triple {17015#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17016#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:39,899 INFO L273 TraceCheckUtils]: 8: Hoare triple {17016#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17016#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:39,900 INFO L273 TraceCheckUtils]: 9: Hoare triple {17016#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17017#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:39,900 INFO L273 TraceCheckUtils]: 10: Hoare triple {17017#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17017#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:39,901 INFO L273 TraceCheckUtils]: 11: Hoare triple {17017#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17018#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:39,901 INFO L273 TraceCheckUtils]: 12: Hoare triple {17018#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17018#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:39,902 INFO L273 TraceCheckUtils]: 13: Hoare triple {17018#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17019#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:39,902 INFO L273 TraceCheckUtils]: 14: Hoare triple {17019#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17019#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:39,903 INFO L273 TraceCheckUtils]: 15: Hoare triple {17019#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17020#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:39,903 INFO L273 TraceCheckUtils]: 16: Hoare triple {17020#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17020#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:39,904 INFO L273 TraceCheckUtils]: 17: Hoare triple {17020#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17021#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:39,905 INFO L273 TraceCheckUtils]: 18: Hoare triple {17021#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17021#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:39,905 INFO L273 TraceCheckUtils]: 19: Hoare triple {17021#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17022#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:39,906 INFO L273 TraceCheckUtils]: 20: Hoare triple {17022#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17022#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:39,907 INFO L273 TraceCheckUtils]: 21: Hoare triple {17022#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17023#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:39,907 INFO L273 TraceCheckUtils]: 22: Hoare triple {17023#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17023#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:39,908 INFO L273 TraceCheckUtils]: 23: Hoare triple {17023#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17024#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:39,909 INFO L273 TraceCheckUtils]: 24: Hoare triple {17024#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17024#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:39,909 INFO L273 TraceCheckUtils]: 25: Hoare triple {17024#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17025#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:39,910 INFO L273 TraceCheckUtils]: 26: Hoare triple {17025#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17025#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:39,910 INFO L273 TraceCheckUtils]: 27: Hoare triple {17025#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17026#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:39,911 INFO L273 TraceCheckUtils]: 28: Hoare triple {17026#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17026#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:39,912 INFO L273 TraceCheckUtils]: 29: Hoare triple {17026#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17027#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:39,912 INFO L273 TraceCheckUtils]: 30: Hoare triple {17027#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17027#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:39,913 INFO L273 TraceCheckUtils]: 31: Hoare triple {17027#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17028#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:39,914 INFO L273 TraceCheckUtils]: 32: Hoare triple {17028#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17028#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:39,914 INFO L273 TraceCheckUtils]: 33: Hoare triple {17028#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17029#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:39,915 INFO L273 TraceCheckUtils]: 34: Hoare triple {17029#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17029#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:39,916 INFO L273 TraceCheckUtils]: 35: Hoare triple {17029#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17030#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:39,916 INFO L273 TraceCheckUtils]: 36: Hoare triple {17030#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17030#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:39,917 INFO L273 TraceCheckUtils]: 37: Hoare triple {17030#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17031#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:39,917 INFO L273 TraceCheckUtils]: 38: Hoare triple {17031#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17031#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:39,918 INFO L273 TraceCheckUtils]: 39: Hoare triple {17031#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17032#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:39,919 INFO L273 TraceCheckUtils]: 40: Hoare triple {17032#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17032#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:39,919 INFO L273 TraceCheckUtils]: 41: Hoare triple {17032#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17033#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:39,920 INFO L273 TraceCheckUtils]: 42: Hoare triple {17033#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17033#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:39,921 INFO L273 TraceCheckUtils]: 43: Hoare triple {17033#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17034#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:39,921 INFO L273 TraceCheckUtils]: 44: Hoare triple {17034#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17034#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:39,922 INFO L273 TraceCheckUtils]: 45: Hoare triple {17034#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17035#(<= main_~i~1 20)} is VALID [2018-11-23 12:17:39,922 INFO L273 TraceCheckUtils]: 46: Hoare triple {17035#(<= main_~i~1 20)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17035#(<= main_~i~1 20)} is VALID [2018-11-23 12:17:39,923 INFO L273 TraceCheckUtils]: 47: Hoare triple {17035#(<= main_~i~1 20)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17036#(<= main_~i~1 21)} is VALID [2018-11-23 12:17:39,924 INFO L273 TraceCheckUtils]: 48: Hoare triple {17036#(<= main_~i~1 21)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17036#(<= main_~i~1 21)} is VALID [2018-11-23 12:17:39,924 INFO L273 TraceCheckUtils]: 49: Hoare triple {17036#(<= main_~i~1 21)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17037#(<= main_~i~1 22)} is VALID [2018-11-23 12:17:39,925 INFO L273 TraceCheckUtils]: 50: Hoare triple {17037#(<= main_~i~1 22)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17037#(<= main_~i~1 22)} is VALID [2018-11-23 12:17:39,926 INFO L273 TraceCheckUtils]: 51: Hoare triple {17037#(<= main_~i~1 22)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17038#(<= main_~i~1 23)} is VALID [2018-11-23 12:17:39,926 INFO L273 TraceCheckUtils]: 52: Hoare triple {17038#(<= main_~i~1 23)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17038#(<= main_~i~1 23)} is VALID [2018-11-23 12:17:39,927 INFO L273 TraceCheckUtils]: 53: Hoare triple {17038#(<= main_~i~1 23)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17039#(<= main_~i~1 24)} is VALID [2018-11-23 12:17:39,928 INFO L273 TraceCheckUtils]: 54: Hoare triple {17039#(<= main_~i~1 24)} assume !(~i~1 < 60); {17014#false} is VALID [2018-11-23 12:17:39,928 INFO L256 TraceCheckUtils]: 55: Hoare triple {17014#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {17013#true} is VALID [2018-11-23 12:17:39,928 INFO L273 TraceCheckUtils]: 56: Hoare triple {17013#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {17013#true} is VALID [2018-11-23 12:17:39,928 INFO L273 TraceCheckUtils]: 57: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:39,928 INFO L273 TraceCheckUtils]: 58: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:39,929 INFO L273 TraceCheckUtils]: 59: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:39,929 INFO L273 TraceCheckUtils]: 60: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:39,929 INFO L273 TraceCheckUtils]: 61: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:39,929 INFO L273 TraceCheckUtils]: 62: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:39,929 INFO L273 TraceCheckUtils]: 63: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:39,929 INFO L273 TraceCheckUtils]: 64: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:39,930 INFO L273 TraceCheckUtils]: 65: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:39,930 INFO L273 TraceCheckUtils]: 66: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:39,930 INFO L273 TraceCheckUtils]: 67: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:39,930 INFO L273 TraceCheckUtils]: 68: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:39,930 INFO L273 TraceCheckUtils]: 69: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:39,931 INFO L273 TraceCheckUtils]: 70: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:39,931 INFO L273 TraceCheckUtils]: 71: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:39,931 INFO L273 TraceCheckUtils]: 72: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:39,931 INFO L273 TraceCheckUtils]: 73: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:39,931 INFO L273 TraceCheckUtils]: 74: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:39,932 INFO L273 TraceCheckUtils]: 75: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:39,932 INFO L273 TraceCheckUtils]: 76: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:39,932 INFO L273 TraceCheckUtils]: 77: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:39,932 INFO L273 TraceCheckUtils]: 78: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:39,932 INFO L273 TraceCheckUtils]: 79: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:39,932 INFO L273 TraceCheckUtils]: 80: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:39,933 INFO L273 TraceCheckUtils]: 81: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:39,933 INFO L273 TraceCheckUtils]: 82: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:39,933 INFO L273 TraceCheckUtils]: 83: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:39,933 INFO L273 TraceCheckUtils]: 84: Hoare triple {17013#true} assume !(~i~0 < 60); {17013#true} is VALID [2018-11-23 12:17:39,933 INFO L273 TraceCheckUtils]: 85: Hoare triple {17013#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {17013#true} is VALID [2018-11-23 12:17:39,933 INFO L273 TraceCheckUtils]: 86: Hoare triple {17013#true} assume true; {17013#true} is VALID [2018-11-23 12:17:39,933 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {17013#true} {17014#false} #75#return; {17014#false} is VALID [2018-11-23 12:17:39,933 INFO L273 TraceCheckUtils]: 88: Hoare triple {17014#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {17014#false} is VALID [2018-11-23 12:17:39,934 INFO L256 TraceCheckUtils]: 89: Hoare triple {17014#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {17013#true} is VALID [2018-11-23 12:17:39,934 INFO L273 TraceCheckUtils]: 90: Hoare triple {17013#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {17013#true} is VALID [2018-11-23 12:17:39,934 INFO L273 TraceCheckUtils]: 91: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:39,934 INFO L273 TraceCheckUtils]: 92: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:39,934 INFO L273 TraceCheckUtils]: 93: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:39,934 INFO L273 TraceCheckUtils]: 94: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:39,934 INFO L273 TraceCheckUtils]: 95: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:39,934 INFO L273 TraceCheckUtils]: 96: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:39,934 INFO L273 TraceCheckUtils]: 97: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:39,935 INFO L273 TraceCheckUtils]: 98: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:39,935 INFO L273 TraceCheckUtils]: 99: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:39,935 INFO L273 TraceCheckUtils]: 100: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:39,935 INFO L273 TraceCheckUtils]: 101: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:39,935 INFO L273 TraceCheckUtils]: 102: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:39,935 INFO L273 TraceCheckUtils]: 103: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:39,935 INFO L273 TraceCheckUtils]: 104: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:39,935 INFO L273 TraceCheckUtils]: 105: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:39,935 INFO L273 TraceCheckUtils]: 106: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:39,936 INFO L273 TraceCheckUtils]: 107: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:39,936 INFO L273 TraceCheckUtils]: 108: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:39,936 INFO L273 TraceCheckUtils]: 109: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:39,936 INFO L273 TraceCheckUtils]: 110: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:39,936 INFO L273 TraceCheckUtils]: 111: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:39,936 INFO L273 TraceCheckUtils]: 112: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:39,936 INFO L273 TraceCheckUtils]: 113: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:39,936 INFO L273 TraceCheckUtils]: 114: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:39,936 INFO L273 TraceCheckUtils]: 115: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:39,937 INFO L273 TraceCheckUtils]: 116: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:39,937 INFO L273 TraceCheckUtils]: 117: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:39,937 INFO L273 TraceCheckUtils]: 118: Hoare triple {17013#true} assume !(~i~0 < 60); {17013#true} is VALID [2018-11-23 12:17:39,937 INFO L273 TraceCheckUtils]: 119: Hoare triple {17013#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {17013#true} is VALID [2018-11-23 12:17:39,937 INFO L273 TraceCheckUtils]: 120: Hoare triple {17013#true} assume true; {17013#true} is VALID [2018-11-23 12:17:39,937 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {17013#true} {17014#false} #77#return; {17014#false} is VALID [2018-11-23 12:17:39,937 INFO L273 TraceCheckUtils]: 122: Hoare triple {17014#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {17014#false} is VALID [2018-11-23 12:17:39,937 INFO L273 TraceCheckUtils]: 123: Hoare triple {17014#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {17014#false} is VALID [2018-11-23 12:17:39,937 INFO L273 TraceCheckUtils]: 124: Hoare triple {17014#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {17014#false} is VALID [2018-11-23 12:17:39,937 INFO L273 TraceCheckUtils]: 125: Hoare triple {17014#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {17014#false} is VALID [2018-11-23 12:17:39,938 INFO L273 TraceCheckUtils]: 126: Hoare triple {17014#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {17014#false} is VALID [2018-11-23 12:17:39,938 INFO L273 TraceCheckUtils]: 127: Hoare triple {17014#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {17014#false} is VALID [2018-11-23 12:17:39,938 INFO L273 TraceCheckUtils]: 128: Hoare triple {17014#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {17014#false} is VALID [2018-11-23 12:17:39,938 INFO L273 TraceCheckUtils]: 129: Hoare triple {17014#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {17014#false} is VALID [2018-11-23 12:17:39,938 INFO L273 TraceCheckUtils]: 130: Hoare triple {17014#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {17014#false} is VALID [2018-11-23 12:17:39,938 INFO L273 TraceCheckUtils]: 131: Hoare triple {17014#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {17014#false} is VALID [2018-11-23 12:17:39,938 INFO L273 TraceCheckUtils]: 132: Hoare triple {17014#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {17014#false} is VALID [2018-11-23 12:17:39,938 INFO L273 TraceCheckUtils]: 133: Hoare triple {17014#false} assume !(~i~2 < 59); {17014#false} is VALID [2018-11-23 12:17:39,938 INFO L273 TraceCheckUtils]: 134: Hoare triple {17014#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {17014#false} is VALID [2018-11-23 12:17:39,939 INFO L256 TraceCheckUtils]: 135: Hoare triple {17014#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {17013#true} is VALID [2018-11-23 12:17:39,939 INFO L273 TraceCheckUtils]: 136: Hoare triple {17013#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {17013#true} is VALID [2018-11-23 12:17:39,939 INFO L273 TraceCheckUtils]: 137: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:39,939 INFO L273 TraceCheckUtils]: 138: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:39,939 INFO L273 TraceCheckUtils]: 139: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:39,939 INFO L273 TraceCheckUtils]: 140: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:39,939 INFO L273 TraceCheckUtils]: 141: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:39,939 INFO L273 TraceCheckUtils]: 142: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:39,939 INFO L273 TraceCheckUtils]: 143: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:39,940 INFO L273 TraceCheckUtils]: 144: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:39,940 INFO L273 TraceCheckUtils]: 145: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:39,940 INFO L273 TraceCheckUtils]: 146: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:39,940 INFO L273 TraceCheckUtils]: 147: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:39,940 INFO L273 TraceCheckUtils]: 148: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:39,940 INFO L273 TraceCheckUtils]: 149: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:39,940 INFO L273 TraceCheckUtils]: 150: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:39,940 INFO L273 TraceCheckUtils]: 151: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:39,940 INFO L273 TraceCheckUtils]: 152: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:39,940 INFO L273 TraceCheckUtils]: 153: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:39,941 INFO L273 TraceCheckUtils]: 154: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:39,941 INFO L273 TraceCheckUtils]: 155: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:39,941 INFO L273 TraceCheckUtils]: 156: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:39,941 INFO L273 TraceCheckUtils]: 157: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:39,941 INFO L273 TraceCheckUtils]: 158: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:39,941 INFO L273 TraceCheckUtils]: 159: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:39,941 INFO L273 TraceCheckUtils]: 160: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:39,941 INFO L273 TraceCheckUtils]: 161: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:39,941 INFO L273 TraceCheckUtils]: 162: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:39,942 INFO L273 TraceCheckUtils]: 163: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:39,942 INFO L273 TraceCheckUtils]: 164: Hoare triple {17013#true} assume !(~i~0 < 60); {17013#true} is VALID [2018-11-23 12:17:39,942 INFO L273 TraceCheckUtils]: 165: Hoare triple {17013#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {17013#true} is VALID [2018-11-23 12:17:39,942 INFO L273 TraceCheckUtils]: 166: Hoare triple {17013#true} assume true; {17013#true} is VALID [2018-11-23 12:17:39,942 INFO L268 TraceCheckUtils]: 167: Hoare quadruple {17013#true} {17014#false} #79#return; {17014#false} is VALID [2018-11-23 12:17:39,942 INFO L273 TraceCheckUtils]: 168: Hoare triple {17014#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {17014#false} is VALID [2018-11-23 12:17:39,942 INFO L273 TraceCheckUtils]: 169: Hoare triple {17014#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {17014#false} is VALID [2018-11-23 12:17:39,942 INFO L273 TraceCheckUtils]: 170: Hoare triple {17014#false} assume !false; {17014#false} is VALID [2018-11-23 12:17:39,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1750 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 1174 trivial. 0 not checked. [2018-11-23 12:17:39,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:39,955 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:17:39,964 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:17:40,527 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 12:17:40,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:40,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:40,789 INFO L256 TraceCheckUtils]: 0: Hoare triple {17013#true} call ULTIMATE.init(); {17013#true} is VALID [2018-11-23 12:17:40,789 INFO L273 TraceCheckUtils]: 1: Hoare triple {17013#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17013#true} is VALID [2018-11-23 12:17:40,789 INFO L273 TraceCheckUtils]: 2: Hoare triple {17013#true} assume true; {17013#true} is VALID [2018-11-23 12:17:40,789 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17013#true} {17013#true} #71#return; {17013#true} is VALID [2018-11-23 12:17:40,789 INFO L256 TraceCheckUtils]: 4: Hoare triple {17013#true} call #t~ret14 := main(); {17013#true} is VALID [2018-11-23 12:17:40,790 INFO L273 TraceCheckUtils]: 5: Hoare triple {17013#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {17013#true} is VALID [2018-11-23 12:17:40,790 INFO L273 TraceCheckUtils]: 6: Hoare triple {17013#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17013#true} is VALID [2018-11-23 12:17:40,790 INFO L273 TraceCheckUtils]: 7: Hoare triple {17013#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17013#true} is VALID [2018-11-23 12:17:40,790 INFO L273 TraceCheckUtils]: 8: Hoare triple {17013#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17013#true} is VALID [2018-11-23 12:17:40,790 INFO L273 TraceCheckUtils]: 9: Hoare triple {17013#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17013#true} is VALID [2018-11-23 12:17:40,791 INFO L273 TraceCheckUtils]: 10: Hoare triple {17013#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17013#true} is VALID [2018-11-23 12:17:40,791 INFO L273 TraceCheckUtils]: 11: Hoare triple {17013#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17013#true} is VALID [2018-11-23 12:17:40,791 INFO L273 TraceCheckUtils]: 12: Hoare triple {17013#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17013#true} is VALID [2018-11-23 12:17:40,791 INFO L273 TraceCheckUtils]: 13: Hoare triple {17013#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17013#true} is VALID [2018-11-23 12:17:40,791 INFO L273 TraceCheckUtils]: 14: Hoare triple {17013#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17013#true} is VALID [2018-11-23 12:17:40,791 INFO L273 TraceCheckUtils]: 15: Hoare triple {17013#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17013#true} is VALID [2018-11-23 12:17:40,791 INFO L273 TraceCheckUtils]: 16: Hoare triple {17013#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17013#true} is VALID [2018-11-23 12:17:40,791 INFO L273 TraceCheckUtils]: 17: Hoare triple {17013#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17013#true} is VALID [2018-11-23 12:17:40,791 INFO L273 TraceCheckUtils]: 18: Hoare triple {17013#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17013#true} is VALID [2018-11-23 12:17:40,792 INFO L273 TraceCheckUtils]: 19: Hoare triple {17013#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17013#true} is VALID [2018-11-23 12:17:40,792 INFO L273 TraceCheckUtils]: 20: Hoare triple {17013#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17013#true} is VALID [2018-11-23 12:17:40,792 INFO L273 TraceCheckUtils]: 21: Hoare triple {17013#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17013#true} is VALID [2018-11-23 12:17:40,792 INFO L273 TraceCheckUtils]: 22: Hoare triple {17013#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17013#true} is VALID [2018-11-23 12:17:40,792 INFO L273 TraceCheckUtils]: 23: Hoare triple {17013#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17013#true} is VALID [2018-11-23 12:17:40,792 INFO L273 TraceCheckUtils]: 24: Hoare triple {17013#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17013#true} is VALID [2018-11-23 12:17:40,792 INFO L273 TraceCheckUtils]: 25: Hoare triple {17013#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17013#true} is VALID [2018-11-23 12:17:40,792 INFO L273 TraceCheckUtils]: 26: Hoare triple {17013#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17013#true} is VALID [2018-11-23 12:17:40,792 INFO L273 TraceCheckUtils]: 27: Hoare triple {17013#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17013#true} is VALID [2018-11-23 12:17:40,792 INFO L273 TraceCheckUtils]: 28: Hoare triple {17013#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17013#true} is VALID [2018-11-23 12:17:40,793 INFO L273 TraceCheckUtils]: 29: Hoare triple {17013#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17013#true} is VALID [2018-11-23 12:17:40,793 INFO L273 TraceCheckUtils]: 30: Hoare triple {17013#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17013#true} is VALID [2018-11-23 12:17:40,793 INFO L273 TraceCheckUtils]: 31: Hoare triple {17013#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17013#true} is VALID [2018-11-23 12:17:40,793 INFO L273 TraceCheckUtils]: 32: Hoare triple {17013#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17013#true} is VALID [2018-11-23 12:17:40,793 INFO L273 TraceCheckUtils]: 33: Hoare triple {17013#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17013#true} is VALID [2018-11-23 12:17:40,793 INFO L273 TraceCheckUtils]: 34: Hoare triple {17013#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17013#true} is VALID [2018-11-23 12:17:40,793 INFO L273 TraceCheckUtils]: 35: Hoare triple {17013#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17013#true} is VALID [2018-11-23 12:17:40,793 INFO L273 TraceCheckUtils]: 36: Hoare triple {17013#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17013#true} is VALID [2018-11-23 12:17:40,793 INFO L273 TraceCheckUtils]: 37: Hoare triple {17013#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17013#true} is VALID [2018-11-23 12:17:40,794 INFO L273 TraceCheckUtils]: 38: Hoare triple {17013#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17013#true} is VALID [2018-11-23 12:17:40,794 INFO L273 TraceCheckUtils]: 39: Hoare triple {17013#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17013#true} is VALID [2018-11-23 12:17:40,794 INFO L273 TraceCheckUtils]: 40: Hoare triple {17013#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17013#true} is VALID [2018-11-23 12:17:40,794 INFO L273 TraceCheckUtils]: 41: Hoare triple {17013#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17013#true} is VALID [2018-11-23 12:17:40,794 INFO L273 TraceCheckUtils]: 42: Hoare triple {17013#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17013#true} is VALID [2018-11-23 12:17:40,794 INFO L273 TraceCheckUtils]: 43: Hoare triple {17013#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17013#true} is VALID [2018-11-23 12:17:40,794 INFO L273 TraceCheckUtils]: 44: Hoare triple {17013#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17013#true} is VALID [2018-11-23 12:17:40,794 INFO L273 TraceCheckUtils]: 45: Hoare triple {17013#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17013#true} is VALID [2018-11-23 12:17:40,794 INFO L273 TraceCheckUtils]: 46: Hoare triple {17013#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17013#true} is VALID [2018-11-23 12:17:40,795 INFO L273 TraceCheckUtils]: 47: Hoare triple {17013#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17013#true} is VALID [2018-11-23 12:17:40,795 INFO L273 TraceCheckUtils]: 48: Hoare triple {17013#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17013#true} is VALID [2018-11-23 12:17:40,795 INFO L273 TraceCheckUtils]: 49: Hoare triple {17013#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17013#true} is VALID [2018-11-23 12:17:40,795 INFO L273 TraceCheckUtils]: 50: Hoare triple {17013#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17013#true} is VALID [2018-11-23 12:17:40,795 INFO L273 TraceCheckUtils]: 51: Hoare triple {17013#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17013#true} is VALID [2018-11-23 12:17:40,795 INFO L273 TraceCheckUtils]: 52: Hoare triple {17013#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {17013#true} is VALID [2018-11-23 12:17:40,795 INFO L273 TraceCheckUtils]: 53: Hoare triple {17013#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {17013#true} is VALID [2018-11-23 12:17:40,795 INFO L273 TraceCheckUtils]: 54: Hoare triple {17013#true} assume !(~i~1 < 60); {17013#true} is VALID [2018-11-23 12:17:40,795 INFO L256 TraceCheckUtils]: 55: Hoare triple {17013#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {17013#true} is VALID [2018-11-23 12:17:40,795 INFO L273 TraceCheckUtils]: 56: Hoare triple {17013#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {17013#true} is VALID [2018-11-23 12:17:40,796 INFO L273 TraceCheckUtils]: 57: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:40,796 INFO L273 TraceCheckUtils]: 58: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:40,796 INFO L273 TraceCheckUtils]: 59: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:40,796 INFO L273 TraceCheckUtils]: 60: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:40,796 INFO L273 TraceCheckUtils]: 61: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:40,796 INFO L273 TraceCheckUtils]: 62: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:40,796 INFO L273 TraceCheckUtils]: 63: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:40,796 INFO L273 TraceCheckUtils]: 64: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:40,796 INFO L273 TraceCheckUtils]: 65: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:40,797 INFO L273 TraceCheckUtils]: 66: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:40,797 INFO L273 TraceCheckUtils]: 67: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:40,797 INFO L273 TraceCheckUtils]: 68: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:40,797 INFO L273 TraceCheckUtils]: 69: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:40,797 INFO L273 TraceCheckUtils]: 70: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:40,797 INFO L273 TraceCheckUtils]: 71: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:40,797 INFO L273 TraceCheckUtils]: 72: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:40,797 INFO L273 TraceCheckUtils]: 73: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:40,797 INFO L273 TraceCheckUtils]: 74: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:40,798 INFO L273 TraceCheckUtils]: 75: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:40,798 INFO L273 TraceCheckUtils]: 76: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:40,798 INFO L273 TraceCheckUtils]: 77: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:40,798 INFO L273 TraceCheckUtils]: 78: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:40,798 INFO L273 TraceCheckUtils]: 79: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:40,798 INFO L273 TraceCheckUtils]: 80: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:40,798 INFO L273 TraceCheckUtils]: 81: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:40,798 INFO L273 TraceCheckUtils]: 82: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:40,798 INFO L273 TraceCheckUtils]: 83: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:40,798 INFO L273 TraceCheckUtils]: 84: Hoare triple {17013#true} assume !(~i~0 < 60); {17013#true} is VALID [2018-11-23 12:17:40,799 INFO L273 TraceCheckUtils]: 85: Hoare triple {17013#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {17013#true} is VALID [2018-11-23 12:17:40,799 INFO L273 TraceCheckUtils]: 86: Hoare triple {17013#true} assume true; {17013#true} is VALID [2018-11-23 12:17:40,799 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {17013#true} {17013#true} #75#return; {17013#true} is VALID [2018-11-23 12:17:40,799 INFO L273 TraceCheckUtils]: 88: Hoare triple {17013#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {17013#true} is VALID [2018-11-23 12:17:40,799 INFO L256 TraceCheckUtils]: 89: Hoare triple {17013#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {17013#true} is VALID [2018-11-23 12:17:40,799 INFO L273 TraceCheckUtils]: 90: Hoare triple {17013#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {17013#true} is VALID [2018-11-23 12:17:40,799 INFO L273 TraceCheckUtils]: 91: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:40,799 INFO L273 TraceCheckUtils]: 92: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:40,799 INFO L273 TraceCheckUtils]: 93: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:40,800 INFO L273 TraceCheckUtils]: 94: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:40,800 INFO L273 TraceCheckUtils]: 95: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:40,800 INFO L273 TraceCheckUtils]: 96: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:40,800 INFO L273 TraceCheckUtils]: 97: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:40,800 INFO L273 TraceCheckUtils]: 98: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:40,800 INFO L273 TraceCheckUtils]: 99: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:40,800 INFO L273 TraceCheckUtils]: 100: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:40,800 INFO L273 TraceCheckUtils]: 101: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:40,800 INFO L273 TraceCheckUtils]: 102: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:40,800 INFO L273 TraceCheckUtils]: 103: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:40,801 INFO L273 TraceCheckUtils]: 104: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:40,801 INFO L273 TraceCheckUtils]: 105: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:40,801 INFO L273 TraceCheckUtils]: 106: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:40,801 INFO L273 TraceCheckUtils]: 107: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:40,801 INFO L273 TraceCheckUtils]: 108: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:40,801 INFO L273 TraceCheckUtils]: 109: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:40,801 INFO L273 TraceCheckUtils]: 110: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:40,801 INFO L273 TraceCheckUtils]: 111: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:40,801 INFO L273 TraceCheckUtils]: 112: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:40,802 INFO L273 TraceCheckUtils]: 113: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:40,802 INFO L273 TraceCheckUtils]: 114: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:40,802 INFO L273 TraceCheckUtils]: 115: Hoare triple {17013#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17013#true} is VALID [2018-11-23 12:17:40,802 INFO L273 TraceCheckUtils]: 116: Hoare triple {17013#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17013#true} is VALID [2018-11-23 12:17:40,802 INFO L273 TraceCheckUtils]: 117: Hoare triple {17013#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17013#true} is VALID [2018-11-23 12:17:40,802 INFO L273 TraceCheckUtils]: 118: Hoare triple {17013#true} assume !(~i~0 < 60); {17013#true} is VALID [2018-11-23 12:17:40,802 INFO L273 TraceCheckUtils]: 119: Hoare triple {17013#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {17013#true} is VALID [2018-11-23 12:17:40,802 INFO L273 TraceCheckUtils]: 120: Hoare triple {17013#true} assume true; {17013#true} is VALID [2018-11-23 12:17:40,802 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {17013#true} {17013#true} #77#return; {17013#true} is VALID [2018-11-23 12:17:40,803 INFO L273 TraceCheckUtils]: 122: Hoare triple {17013#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {17409#(<= main_~i~2 0)} is VALID [2018-11-23 12:17:40,803 INFO L273 TraceCheckUtils]: 123: Hoare triple {17409#(<= main_~i~2 0)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {17409#(<= main_~i~2 0)} is VALID [2018-11-23 12:17:40,804 INFO L273 TraceCheckUtils]: 124: Hoare triple {17409#(<= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {17416#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:40,804 INFO L273 TraceCheckUtils]: 125: Hoare triple {17416#(<= main_~i~2 1)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {17416#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:40,805 INFO L273 TraceCheckUtils]: 126: Hoare triple {17416#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {17423#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:40,805 INFO L273 TraceCheckUtils]: 127: Hoare triple {17423#(<= main_~i~2 2)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {17423#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:40,805 INFO L273 TraceCheckUtils]: 128: Hoare triple {17423#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {17430#(<= main_~i~2 3)} is VALID [2018-11-23 12:17:40,806 INFO L273 TraceCheckUtils]: 129: Hoare triple {17430#(<= main_~i~2 3)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {17430#(<= main_~i~2 3)} is VALID [2018-11-23 12:17:40,806 INFO L273 TraceCheckUtils]: 130: Hoare triple {17430#(<= main_~i~2 3)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {17437#(<= main_~i~2 4)} is VALID [2018-11-23 12:17:40,806 INFO L273 TraceCheckUtils]: 131: Hoare triple {17437#(<= main_~i~2 4)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {17437#(<= main_~i~2 4)} is VALID [2018-11-23 12:17:40,807 INFO L273 TraceCheckUtils]: 132: Hoare triple {17437#(<= main_~i~2 4)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {17444#(<= main_~i~2 5)} is VALID [2018-11-23 12:17:40,807 INFO L273 TraceCheckUtils]: 133: Hoare triple {17444#(<= main_~i~2 5)} assume !(~i~2 < 59); {17014#false} is VALID [2018-11-23 12:17:40,807 INFO L273 TraceCheckUtils]: 134: Hoare triple {17014#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {17014#false} is VALID [2018-11-23 12:17:40,807 INFO L256 TraceCheckUtils]: 135: Hoare triple {17014#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {17014#false} is VALID [2018-11-23 12:17:40,808 INFO L273 TraceCheckUtils]: 136: Hoare triple {17014#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {17014#false} is VALID [2018-11-23 12:17:40,808 INFO L273 TraceCheckUtils]: 137: Hoare triple {17014#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17014#false} is VALID [2018-11-23 12:17:40,808 INFO L273 TraceCheckUtils]: 138: Hoare triple {17014#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17014#false} is VALID [2018-11-23 12:17:40,808 INFO L273 TraceCheckUtils]: 139: Hoare triple {17014#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17014#false} is VALID [2018-11-23 12:17:40,808 INFO L273 TraceCheckUtils]: 140: Hoare triple {17014#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17014#false} is VALID [2018-11-23 12:17:40,809 INFO L273 TraceCheckUtils]: 141: Hoare triple {17014#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17014#false} is VALID [2018-11-23 12:17:40,809 INFO L273 TraceCheckUtils]: 142: Hoare triple {17014#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17014#false} is VALID [2018-11-23 12:17:40,809 INFO L273 TraceCheckUtils]: 143: Hoare triple {17014#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17014#false} is VALID [2018-11-23 12:17:40,809 INFO L273 TraceCheckUtils]: 144: Hoare triple {17014#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17014#false} is VALID [2018-11-23 12:17:40,809 INFO L273 TraceCheckUtils]: 145: Hoare triple {17014#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17014#false} is VALID [2018-11-23 12:17:40,809 INFO L273 TraceCheckUtils]: 146: Hoare triple {17014#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17014#false} is VALID [2018-11-23 12:17:40,810 INFO L273 TraceCheckUtils]: 147: Hoare triple {17014#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17014#false} is VALID [2018-11-23 12:17:40,810 INFO L273 TraceCheckUtils]: 148: Hoare triple {17014#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17014#false} is VALID [2018-11-23 12:17:40,810 INFO L273 TraceCheckUtils]: 149: Hoare triple {17014#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17014#false} is VALID [2018-11-23 12:17:40,810 INFO L273 TraceCheckUtils]: 150: Hoare triple {17014#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17014#false} is VALID [2018-11-23 12:17:40,810 INFO L273 TraceCheckUtils]: 151: Hoare triple {17014#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17014#false} is VALID [2018-11-23 12:17:40,811 INFO L273 TraceCheckUtils]: 152: Hoare triple {17014#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17014#false} is VALID [2018-11-23 12:17:40,811 INFO L273 TraceCheckUtils]: 153: Hoare triple {17014#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17014#false} is VALID [2018-11-23 12:17:40,811 INFO L273 TraceCheckUtils]: 154: Hoare triple {17014#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17014#false} is VALID [2018-11-23 12:17:40,811 INFO L273 TraceCheckUtils]: 155: Hoare triple {17014#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17014#false} is VALID [2018-11-23 12:17:40,811 INFO L273 TraceCheckUtils]: 156: Hoare triple {17014#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17014#false} is VALID [2018-11-23 12:17:40,811 INFO L273 TraceCheckUtils]: 157: Hoare triple {17014#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17014#false} is VALID [2018-11-23 12:17:40,811 INFO L273 TraceCheckUtils]: 158: Hoare triple {17014#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17014#false} is VALID [2018-11-23 12:17:40,811 INFO L273 TraceCheckUtils]: 159: Hoare triple {17014#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17014#false} is VALID [2018-11-23 12:17:40,811 INFO L273 TraceCheckUtils]: 160: Hoare triple {17014#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17014#false} is VALID [2018-11-23 12:17:40,812 INFO L273 TraceCheckUtils]: 161: Hoare triple {17014#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {17014#false} is VALID [2018-11-23 12:17:40,812 INFO L273 TraceCheckUtils]: 162: Hoare triple {17014#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {17014#false} is VALID [2018-11-23 12:17:40,812 INFO L273 TraceCheckUtils]: 163: Hoare triple {17014#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17014#false} is VALID [2018-11-23 12:17:40,812 INFO L273 TraceCheckUtils]: 164: Hoare triple {17014#false} assume !(~i~0 < 60); {17014#false} is VALID [2018-11-23 12:17:40,812 INFO L273 TraceCheckUtils]: 165: Hoare triple {17014#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {17014#false} is VALID [2018-11-23 12:17:40,812 INFO L273 TraceCheckUtils]: 166: Hoare triple {17014#false} assume true; {17014#false} is VALID [2018-11-23 12:17:40,812 INFO L268 TraceCheckUtils]: 167: Hoare quadruple {17014#false} {17014#false} #79#return; {17014#false} is VALID [2018-11-23 12:17:40,812 INFO L273 TraceCheckUtils]: 168: Hoare triple {17014#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {17014#false} is VALID [2018-11-23 12:17:40,812 INFO L273 TraceCheckUtils]: 169: Hoare triple {17014#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {17014#false} is VALID [2018-11-23 12:17:40,812 INFO L273 TraceCheckUtils]: 170: Hoare triple {17014#false} assume !false; {17014#false} is VALID [2018-11-23 12:17:40,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1750 backedges. 532 proven. 25 refuted. 0 times theorem prover too weak. 1193 trivial. 0 not checked. [2018-11-23 12:17:40,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:40,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 8] total 33 [2018-11-23 12:17:40,854 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 171 [2018-11-23 12:17:40,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:40,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 12:17:40,978 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:40,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 12:17:40,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 12:17:40,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=678, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:17:40,980 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 33 states. [2018-11-23 12:17:42,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:42,029 INFO L93 Difference]: Finished difference Result 167 states and 194 transitions. [2018-11-23 12:17:42,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 12:17:42,029 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 171 [2018-11-23 12:17:42,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:42,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:17:42,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 119 transitions. [2018-11-23 12:17:42,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:17:42,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 119 transitions. [2018-11-23 12:17:42,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 119 transitions. [2018-11-23 12:17:42,148 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:42,150 INFO L225 Difference]: With dead ends: 167 [2018-11-23 12:17:42,151 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 12:17:42,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=378, Invalid=678, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:17:42,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 12:17:42,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-11-23 12:17:42,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:42,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 112 states. [2018-11-23 12:17:42,208 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 112 states. [2018-11-23 12:17:42,209 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 112 states. [2018-11-23 12:17:42,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:42,211 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2018-11-23 12:17:42,211 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2018-11-23 12:17:42,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:42,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:42,212 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 114 states. [2018-11-23 12:17:42,212 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 114 states. [2018-11-23 12:17:42,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:42,213 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2018-11-23 12:17:42,213 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2018-11-23 12:17:42,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:42,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:42,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:42,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:42,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 12:17:42,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2018-11-23 12:17:42,216 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 171 [2018-11-23 12:17:42,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:42,216 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2018-11-23 12:17:42,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 12:17:42,217 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2018-11-23 12:17:42,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-23 12:17:42,218 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:42,218 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 25, 25, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:17:42,218 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:42,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:42,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1435108249, now seen corresponding path program 25 times [2018-11-23 12:17:42,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:42,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:42,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:42,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:42,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:43,057 INFO L256 TraceCheckUtils]: 0: Hoare triple {18187#true} call ULTIMATE.init(); {18187#true} is VALID [2018-11-23 12:17:43,057 INFO L273 TraceCheckUtils]: 1: Hoare triple {18187#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18187#true} is VALID [2018-11-23 12:17:43,057 INFO L273 TraceCheckUtils]: 2: Hoare triple {18187#true} assume true; {18187#true} is VALID [2018-11-23 12:17:43,058 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18187#true} {18187#true} #71#return; {18187#true} is VALID [2018-11-23 12:17:43,058 INFO L256 TraceCheckUtils]: 4: Hoare triple {18187#true} call #t~ret14 := main(); {18187#true} is VALID [2018-11-23 12:17:43,058 INFO L273 TraceCheckUtils]: 5: Hoare triple {18187#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {18189#(= main_~i~1 0)} is VALID [2018-11-23 12:17:43,059 INFO L273 TraceCheckUtils]: 6: Hoare triple {18189#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18189#(= main_~i~1 0)} is VALID [2018-11-23 12:17:43,059 INFO L273 TraceCheckUtils]: 7: Hoare triple {18189#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18190#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:43,060 INFO L273 TraceCheckUtils]: 8: Hoare triple {18190#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18190#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:43,061 INFO L273 TraceCheckUtils]: 9: Hoare triple {18190#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18191#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:43,061 INFO L273 TraceCheckUtils]: 10: Hoare triple {18191#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18191#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:43,062 INFO L273 TraceCheckUtils]: 11: Hoare triple {18191#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18192#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:43,062 INFO L273 TraceCheckUtils]: 12: Hoare triple {18192#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18192#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:43,063 INFO L273 TraceCheckUtils]: 13: Hoare triple {18192#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18193#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:43,064 INFO L273 TraceCheckUtils]: 14: Hoare triple {18193#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18193#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:43,064 INFO L273 TraceCheckUtils]: 15: Hoare triple {18193#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18194#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:43,065 INFO L273 TraceCheckUtils]: 16: Hoare triple {18194#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18194#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:43,066 INFO L273 TraceCheckUtils]: 17: Hoare triple {18194#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18195#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:43,066 INFO L273 TraceCheckUtils]: 18: Hoare triple {18195#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18195#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:43,067 INFO L273 TraceCheckUtils]: 19: Hoare triple {18195#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18196#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:43,067 INFO L273 TraceCheckUtils]: 20: Hoare triple {18196#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18196#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:43,068 INFO L273 TraceCheckUtils]: 21: Hoare triple {18196#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18197#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:43,069 INFO L273 TraceCheckUtils]: 22: Hoare triple {18197#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18197#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:43,069 INFO L273 TraceCheckUtils]: 23: Hoare triple {18197#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18198#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:43,070 INFO L273 TraceCheckUtils]: 24: Hoare triple {18198#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18198#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:43,070 INFO L273 TraceCheckUtils]: 25: Hoare triple {18198#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18199#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:43,071 INFO L273 TraceCheckUtils]: 26: Hoare triple {18199#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18199#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:43,072 INFO L273 TraceCheckUtils]: 27: Hoare triple {18199#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18200#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:43,072 INFO L273 TraceCheckUtils]: 28: Hoare triple {18200#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18200#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:43,073 INFO L273 TraceCheckUtils]: 29: Hoare triple {18200#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18201#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:43,074 INFO L273 TraceCheckUtils]: 30: Hoare triple {18201#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18201#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:43,074 INFO L273 TraceCheckUtils]: 31: Hoare triple {18201#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18202#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:43,075 INFO L273 TraceCheckUtils]: 32: Hoare triple {18202#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18202#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:43,075 INFO L273 TraceCheckUtils]: 33: Hoare triple {18202#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18203#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:43,076 INFO L273 TraceCheckUtils]: 34: Hoare triple {18203#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18203#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:43,077 INFO L273 TraceCheckUtils]: 35: Hoare triple {18203#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18204#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:43,077 INFO L273 TraceCheckUtils]: 36: Hoare triple {18204#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18204#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:43,078 INFO L273 TraceCheckUtils]: 37: Hoare triple {18204#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18205#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:43,078 INFO L273 TraceCheckUtils]: 38: Hoare triple {18205#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18205#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:43,079 INFO L273 TraceCheckUtils]: 39: Hoare triple {18205#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18206#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:43,079 INFO L273 TraceCheckUtils]: 40: Hoare triple {18206#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18206#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:43,080 INFO L273 TraceCheckUtils]: 41: Hoare triple {18206#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18207#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:43,081 INFO L273 TraceCheckUtils]: 42: Hoare triple {18207#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18207#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:43,081 INFO L273 TraceCheckUtils]: 43: Hoare triple {18207#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18208#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:43,082 INFO L273 TraceCheckUtils]: 44: Hoare triple {18208#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18208#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:43,083 INFO L273 TraceCheckUtils]: 45: Hoare triple {18208#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18209#(<= main_~i~1 20)} is VALID [2018-11-23 12:17:43,083 INFO L273 TraceCheckUtils]: 46: Hoare triple {18209#(<= main_~i~1 20)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18209#(<= main_~i~1 20)} is VALID [2018-11-23 12:17:43,084 INFO L273 TraceCheckUtils]: 47: Hoare triple {18209#(<= main_~i~1 20)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18210#(<= main_~i~1 21)} is VALID [2018-11-23 12:17:43,084 INFO L273 TraceCheckUtils]: 48: Hoare triple {18210#(<= main_~i~1 21)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18210#(<= main_~i~1 21)} is VALID [2018-11-23 12:17:43,085 INFO L273 TraceCheckUtils]: 49: Hoare triple {18210#(<= main_~i~1 21)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18211#(<= main_~i~1 22)} is VALID [2018-11-23 12:17:43,086 INFO L273 TraceCheckUtils]: 50: Hoare triple {18211#(<= main_~i~1 22)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18211#(<= main_~i~1 22)} is VALID [2018-11-23 12:17:43,086 INFO L273 TraceCheckUtils]: 51: Hoare triple {18211#(<= main_~i~1 22)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18212#(<= main_~i~1 23)} is VALID [2018-11-23 12:17:43,087 INFO L273 TraceCheckUtils]: 52: Hoare triple {18212#(<= main_~i~1 23)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18212#(<= main_~i~1 23)} is VALID [2018-11-23 12:17:43,087 INFO L273 TraceCheckUtils]: 53: Hoare triple {18212#(<= main_~i~1 23)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18213#(<= main_~i~1 24)} is VALID [2018-11-23 12:17:43,088 INFO L273 TraceCheckUtils]: 54: Hoare triple {18213#(<= main_~i~1 24)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18213#(<= main_~i~1 24)} is VALID [2018-11-23 12:17:43,089 INFO L273 TraceCheckUtils]: 55: Hoare triple {18213#(<= main_~i~1 24)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18214#(<= main_~i~1 25)} is VALID [2018-11-23 12:17:43,089 INFO L273 TraceCheckUtils]: 56: Hoare triple {18214#(<= main_~i~1 25)} assume !(~i~1 < 60); {18188#false} is VALID [2018-11-23 12:17:43,089 INFO L256 TraceCheckUtils]: 57: Hoare triple {18188#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {18187#true} is VALID [2018-11-23 12:17:43,090 INFO L273 TraceCheckUtils]: 58: Hoare triple {18187#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {18187#true} is VALID [2018-11-23 12:17:43,090 INFO L273 TraceCheckUtils]: 59: Hoare triple {18187#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18187#true} is VALID [2018-11-23 12:17:43,090 INFO L273 TraceCheckUtils]: 60: Hoare triple {18187#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18187#true} is VALID [2018-11-23 12:17:43,090 INFO L273 TraceCheckUtils]: 61: Hoare triple {18187#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18187#true} is VALID [2018-11-23 12:17:43,090 INFO L273 TraceCheckUtils]: 62: Hoare triple {18187#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18187#true} is VALID [2018-11-23 12:17:43,091 INFO L273 TraceCheckUtils]: 63: Hoare triple {18187#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18187#true} is VALID [2018-11-23 12:17:43,091 INFO L273 TraceCheckUtils]: 64: Hoare triple {18187#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18187#true} is VALID [2018-11-23 12:17:43,091 INFO L273 TraceCheckUtils]: 65: Hoare triple {18187#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18187#true} is VALID [2018-11-23 12:17:43,091 INFO L273 TraceCheckUtils]: 66: Hoare triple {18187#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18187#true} is VALID [2018-11-23 12:17:43,091 INFO L273 TraceCheckUtils]: 67: Hoare triple {18187#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18187#true} is VALID [2018-11-23 12:17:43,091 INFO L273 TraceCheckUtils]: 68: Hoare triple {18187#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18187#true} is VALID [2018-11-23 12:17:43,092 INFO L273 TraceCheckUtils]: 69: Hoare triple {18187#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18187#true} is VALID [2018-11-23 12:17:43,092 INFO L273 TraceCheckUtils]: 70: Hoare triple {18187#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18187#true} is VALID [2018-11-23 12:17:43,092 INFO L273 TraceCheckUtils]: 71: Hoare triple {18187#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18187#true} is VALID [2018-11-23 12:17:43,092 INFO L273 TraceCheckUtils]: 72: Hoare triple {18187#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18187#true} is VALID [2018-11-23 12:17:43,092 INFO L273 TraceCheckUtils]: 73: Hoare triple {18187#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18187#true} is VALID [2018-11-23 12:17:43,092 INFO L273 TraceCheckUtils]: 74: Hoare triple {18187#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18187#true} is VALID [2018-11-23 12:17:43,093 INFO L273 TraceCheckUtils]: 75: Hoare triple {18187#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18187#true} is VALID [2018-11-23 12:17:43,093 INFO L273 TraceCheckUtils]: 76: Hoare triple {18187#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18187#true} is VALID [2018-11-23 12:17:43,093 INFO L273 TraceCheckUtils]: 77: Hoare triple {18187#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18187#true} is VALID [2018-11-23 12:17:43,093 INFO L273 TraceCheckUtils]: 78: Hoare triple {18187#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18187#true} is VALID [2018-11-23 12:17:43,093 INFO L273 TraceCheckUtils]: 79: Hoare triple {18187#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18187#true} is VALID [2018-11-23 12:17:43,094 INFO L273 TraceCheckUtils]: 80: Hoare triple {18187#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18187#true} is VALID [2018-11-23 12:17:43,094 INFO L273 TraceCheckUtils]: 81: Hoare triple {18187#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18187#true} is VALID [2018-11-23 12:17:43,094 INFO L273 TraceCheckUtils]: 82: Hoare triple {18187#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18187#true} is VALID [2018-11-23 12:17:43,094 INFO L273 TraceCheckUtils]: 83: Hoare triple {18187#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18187#true} is VALID [2018-11-23 12:17:43,094 INFO L273 TraceCheckUtils]: 84: Hoare triple {18187#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18187#true} is VALID [2018-11-23 12:17:43,094 INFO L273 TraceCheckUtils]: 85: Hoare triple {18187#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18187#true} is VALID [2018-11-23 12:17:43,094 INFO L273 TraceCheckUtils]: 86: Hoare triple {18187#true} assume !(~i~0 < 60); {18187#true} is VALID [2018-11-23 12:17:43,094 INFO L273 TraceCheckUtils]: 87: Hoare triple {18187#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {18187#true} is VALID [2018-11-23 12:17:43,094 INFO L273 TraceCheckUtils]: 88: Hoare triple {18187#true} assume true; {18187#true} is VALID [2018-11-23 12:17:43,095 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {18187#true} {18188#false} #75#return; {18188#false} is VALID [2018-11-23 12:17:43,095 INFO L273 TraceCheckUtils]: 90: Hoare triple {18188#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {18188#false} is VALID [2018-11-23 12:17:43,095 INFO L256 TraceCheckUtils]: 91: Hoare triple {18188#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {18187#true} is VALID [2018-11-23 12:17:43,095 INFO L273 TraceCheckUtils]: 92: Hoare triple {18187#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {18187#true} is VALID [2018-11-23 12:17:43,095 INFO L273 TraceCheckUtils]: 93: Hoare triple {18187#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18187#true} is VALID [2018-11-23 12:17:43,095 INFO L273 TraceCheckUtils]: 94: Hoare triple {18187#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18187#true} is VALID [2018-11-23 12:17:43,095 INFO L273 TraceCheckUtils]: 95: Hoare triple {18187#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18187#true} is VALID [2018-11-23 12:17:43,095 INFO L273 TraceCheckUtils]: 96: Hoare triple {18187#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18187#true} is VALID [2018-11-23 12:17:43,095 INFO L273 TraceCheckUtils]: 97: Hoare triple {18187#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18187#true} is VALID [2018-11-23 12:17:43,096 INFO L273 TraceCheckUtils]: 98: Hoare triple {18187#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18187#true} is VALID [2018-11-23 12:17:43,096 INFO L273 TraceCheckUtils]: 99: Hoare triple {18187#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18187#true} is VALID [2018-11-23 12:17:43,096 INFO L273 TraceCheckUtils]: 100: Hoare triple {18187#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18187#true} is VALID [2018-11-23 12:17:43,096 INFO L273 TraceCheckUtils]: 101: Hoare triple {18187#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18187#true} is VALID [2018-11-23 12:17:43,096 INFO L273 TraceCheckUtils]: 102: Hoare triple {18187#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18187#true} is VALID [2018-11-23 12:17:43,096 INFO L273 TraceCheckUtils]: 103: Hoare triple {18187#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18187#true} is VALID [2018-11-23 12:17:43,096 INFO L273 TraceCheckUtils]: 104: Hoare triple {18187#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18187#true} is VALID [2018-11-23 12:17:43,096 INFO L273 TraceCheckUtils]: 105: Hoare triple {18187#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18187#true} is VALID [2018-11-23 12:17:43,096 INFO L273 TraceCheckUtils]: 106: Hoare triple {18187#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18187#true} is VALID [2018-11-23 12:17:43,097 INFO L273 TraceCheckUtils]: 107: Hoare triple {18187#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18187#true} is VALID [2018-11-23 12:17:43,097 INFO L273 TraceCheckUtils]: 108: Hoare triple {18187#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18187#true} is VALID [2018-11-23 12:17:43,097 INFO L273 TraceCheckUtils]: 109: Hoare triple {18187#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18187#true} is VALID [2018-11-23 12:17:43,097 INFO L273 TraceCheckUtils]: 110: Hoare triple {18187#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18187#true} is VALID [2018-11-23 12:17:43,097 INFO L273 TraceCheckUtils]: 111: Hoare triple {18187#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18187#true} is VALID [2018-11-23 12:17:43,097 INFO L273 TraceCheckUtils]: 112: Hoare triple {18187#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18187#true} is VALID [2018-11-23 12:17:43,097 INFO L273 TraceCheckUtils]: 113: Hoare triple {18187#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18187#true} is VALID [2018-11-23 12:17:43,097 INFO L273 TraceCheckUtils]: 114: Hoare triple {18187#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18187#true} is VALID [2018-11-23 12:17:43,097 INFO L273 TraceCheckUtils]: 115: Hoare triple {18187#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18187#true} is VALID [2018-11-23 12:17:43,098 INFO L273 TraceCheckUtils]: 116: Hoare triple {18187#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18187#true} is VALID [2018-11-23 12:17:43,098 INFO L273 TraceCheckUtils]: 117: Hoare triple {18187#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18187#true} is VALID [2018-11-23 12:17:43,098 INFO L273 TraceCheckUtils]: 118: Hoare triple {18187#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18187#true} is VALID [2018-11-23 12:17:43,098 INFO L273 TraceCheckUtils]: 119: Hoare triple {18187#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18187#true} is VALID [2018-11-23 12:17:43,098 INFO L273 TraceCheckUtils]: 120: Hoare triple {18187#true} assume !(~i~0 < 60); {18187#true} is VALID [2018-11-23 12:17:43,098 INFO L273 TraceCheckUtils]: 121: Hoare triple {18187#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {18187#true} is VALID [2018-11-23 12:17:43,098 INFO L273 TraceCheckUtils]: 122: Hoare triple {18187#true} assume true; {18187#true} is VALID [2018-11-23 12:17:43,098 INFO L268 TraceCheckUtils]: 123: Hoare quadruple {18187#true} {18188#false} #77#return; {18188#false} is VALID [2018-11-23 12:17:43,098 INFO L273 TraceCheckUtils]: 124: Hoare triple {18188#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {18188#false} is VALID [2018-11-23 12:17:43,098 INFO L273 TraceCheckUtils]: 125: Hoare triple {18188#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {18188#false} is VALID [2018-11-23 12:17:43,099 INFO L273 TraceCheckUtils]: 126: Hoare triple {18188#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {18188#false} is VALID [2018-11-23 12:17:43,099 INFO L273 TraceCheckUtils]: 127: Hoare triple {18188#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {18188#false} is VALID [2018-11-23 12:17:43,099 INFO L273 TraceCheckUtils]: 128: Hoare triple {18188#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {18188#false} is VALID [2018-11-23 12:17:43,099 INFO L273 TraceCheckUtils]: 129: Hoare triple {18188#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {18188#false} is VALID [2018-11-23 12:17:43,099 INFO L273 TraceCheckUtils]: 130: Hoare triple {18188#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {18188#false} is VALID [2018-11-23 12:17:43,099 INFO L273 TraceCheckUtils]: 131: Hoare triple {18188#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {18188#false} is VALID [2018-11-23 12:17:43,099 INFO L273 TraceCheckUtils]: 132: Hoare triple {18188#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {18188#false} is VALID [2018-11-23 12:17:43,099 INFO L273 TraceCheckUtils]: 133: Hoare triple {18188#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {18188#false} is VALID [2018-11-23 12:17:43,099 INFO L273 TraceCheckUtils]: 134: Hoare triple {18188#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {18188#false} is VALID [2018-11-23 12:17:43,100 INFO L273 TraceCheckUtils]: 135: Hoare triple {18188#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {18188#false} is VALID [2018-11-23 12:17:43,100 INFO L273 TraceCheckUtils]: 136: Hoare triple {18188#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {18188#false} is VALID [2018-11-23 12:17:43,100 INFO L273 TraceCheckUtils]: 137: Hoare triple {18188#false} assume !(~i~2 < 59); {18188#false} is VALID [2018-11-23 12:17:43,100 INFO L273 TraceCheckUtils]: 138: Hoare triple {18188#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {18188#false} is VALID [2018-11-23 12:17:43,100 INFO L256 TraceCheckUtils]: 139: Hoare triple {18188#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {18187#true} is VALID [2018-11-23 12:17:43,100 INFO L273 TraceCheckUtils]: 140: Hoare triple {18187#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {18187#true} is VALID [2018-11-23 12:17:43,100 INFO L273 TraceCheckUtils]: 141: Hoare triple {18187#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18187#true} is VALID [2018-11-23 12:17:43,100 INFO L273 TraceCheckUtils]: 142: Hoare triple {18187#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18187#true} is VALID [2018-11-23 12:17:43,100 INFO L273 TraceCheckUtils]: 143: Hoare triple {18187#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18187#true} is VALID [2018-11-23 12:17:43,101 INFO L273 TraceCheckUtils]: 144: Hoare triple {18187#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18187#true} is VALID [2018-11-23 12:17:43,101 INFO L273 TraceCheckUtils]: 145: Hoare triple {18187#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18187#true} is VALID [2018-11-23 12:17:43,101 INFO L273 TraceCheckUtils]: 146: Hoare triple {18187#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18187#true} is VALID [2018-11-23 12:17:43,101 INFO L273 TraceCheckUtils]: 147: Hoare triple {18187#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18187#true} is VALID [2018-11-23 12:17:43,101 INFO L273 TraceCheckUtils]: 148: Hoare triple {18187#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18187#true} is VALID [2018-11-23 12:17:43,101 INFO L273 TraceCheckUtils]: 149: Hoare triple {18187#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18187#true} is VALID [2018-11-23 12:17:43,101 INFO L273 TraceCheckUtils]: 150: Hoare triple {18187#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18187#true} is VALID [2018-11-23 12:17:43,101 INFO L273 TraceCheckUtils]: 151: Hoare triple {18187#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18187#true} is VALID [2018-11-23 12:17:43,101 INFO L273 TraceCheckUtils]: 152: Hoare triple {18187#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18187#true} is VALID [2018-11-23 12:17:43,101 INFO L273 TraceCheckUtils]: 153: Hoare triple {18187#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18187#true} is VALID [2018-11-23 12:17:43,102 INFO L273 TraceCheckUtils]: 154: Hoare triple {18187#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18187#true} is VALID [2018-11-23 12:17:43,102 INFO L273 TraceCheckUtils]: 155: Hoare triple {18187#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18187#true} is VALID [2018-11-23 12:17:43,102 INFO L273 TraceCheckUtils]: 156: Hoare triple {18187#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18187#true} is VALID [2018-11-23 12:17:43,102 INFO L273 TraceCheckUtils]: 157: Hoare triple {18187#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18187#true} is VALID [2018-11-23 12:17:43,102 INFO L273 TraceCheckUtils]: 158: Hoare triple {18187#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18187#true} is VALID [2018-11-23 12:17:43,102 INFO L273 TraceCheckUtils]: 159: Hoare triple {18187#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18187#true} is VALID [2018-11-23 12:17:43,102 INFO L273 TraceCheckUtils]: 160: Hoare triple {18187#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18187#true} is VALID [2018-11-23 12:17:43,102 INFO L273 TraceCheckUtils]: 161: Hoare triple {18187#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18187#true} is VALID [2018-11-23 12:17:43,102 INFO L273 TraceCheckUtils]: 162: Hoare triple {18187#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18187#true} is VALID [2018-11-23 12:17:43,103 INFO L273 TraceCheckUtils]: 163: Hoare triple {18187#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18187#true} is VALID [2018-11-23 12:17:43,103 INFO L273 TraceCheckUtils]: 164: Hoare triple {18187#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18187#true} is VALID [2018-11-23 12:17:43,103 INFO L273 TraceCheckUtils]: 165: Hoare triple {18187#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18187#true} is VALID [2018-11-23 12:17:43,103 INFO L273 TraceCheckUtils]: 166: Hoare triple {18187#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18187#true} is VALID [2018-11-23 12:17:43,103 INFO L273 TraceCheckUtils]: 167: Hoare triple {18187#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18187#true} is VALID [2018-11-23 12:17:43,103 INFO L273 TraceCheckUtils]: 168: Hoare triple {18187#true} assume !(~i~0 < 60); {18187#true} is VALID [2018-11-23 12:17:43,103 INFO L273 TraceCheckUtils]: 169: Hoare triple {18187#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {18187#true} is VALID [2018-11-23 12:17:43,103 INFO L273 TraceCheckUtils]: 170: Hoare triple {18187#true} assume true; {18187#true} is VALID [2018-11-23 12:17:43,103 INFO L268 TraceCheckUtils]: 171: Hoare quadruple {18187#true} {18188#false} #79#return; {18188#false} is VALID [2018-11-23 12:17:43,104 INFO L273 TraceCheckUtils]: 172: Hoare triple {18188#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {18188#false} is VALID [2018-11-23 12:17:43,104 INFO L273 TraceCheckUtils]: 173: Hoare triple {18188#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {18188#false} is VALID [2018-11-23 12:17:43,104 INFO L273 TraceCheckUtils]: 174: Hoare triple {18188#false} assume !false; {18188#false} is VALID [2018-11-23 12:17:43,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1810 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 1185 trivial. 0 not checked. [2018-11-23 12:17:43,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:43,117 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:17:43,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:17:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:43,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:43,515 INFO L256 TraceCheckUtils]: 0: Hoare triple {18187#true} call ULTIMATE.init(); {18187#true} is VALID [2018-11-23 12:17:43,515 INFO L273 TraceCheckUtils]: 1: Hoare triple {18187#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18187#true} is VALID [2018-11-23 12:17:43,516 INFO L273 TraceCheckUtils]: 2: Hoare triple {18187#true} assume true; {18187#true} is VALID [2018-11-23 12:17:43,516 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18187#true} {18187#true} #71#return; {18187#true} is VALID [2018-11-23 12:17:43,516 INFO L256 TraceCheckUtils]: 4: Hoare triple {18187#true} call #t~ret14 := main(); {18187#true} is VALID [2018-11-23 12:17:43,517 INFO L273 TraceCheckUtils]: 5: Hoare triple {18187#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {18233#(<= main_~i~1 0)} is VALID [2018-11-23 12:17:43,517 INFO L273 TraceCheckUtils]: 6: Hoare triple {18233#(<= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18233#(<= main_~i~1 0)} is VALID [2018-11-23 12:17:43,517 INFO L273 TraceCheckUtils]: 7: Hoare triple {18233#(<= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18190#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:43,518 INFO L273 TraceCheckUtils]: 8: Hoare triple {18190#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18190#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:43,518 INFO L273 TraceCheckUtils]: 9: Hoare triple {18190#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18191#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:43,518 INFO L273 TraceCheckUtils]: 10: Hoare triple {18191#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18191#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:43,519 INFO L273 TraceCheckUtils]: 11: Hoare triple {18191#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18192#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:43,519 INFO L273 TraceCheckUtils]: 12: Hoare triple {18192#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18192#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:43,520 INFO L273 TraceCheckUtils]: 13: Hoare triple {18192#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18193#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:43,520 INFO L273 TraceCheckUtils]: 14: Hoare triple {18193#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18193#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:43,521 INFO L273 TraceCheckUtils]: 15: Hoare triple {18193#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18194#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:43,521 INFO L273 TraceCheckUtils]: 16: Hoare triple {18194#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18194#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:43,538 INFO L273 TraceCheckUtils]: 17: Hoare triple {18194#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18195#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:43,546 INFO L273 TraceCheckUtils]: 18: Hoare triple {18195#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18195#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:43,560 INFO L273 TraceCheckUtils]: 19: Hoare triple {18195#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18196#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:43,568 INFO L273 TraceCheckUtils]: 20: Hoare triple {18196#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18196#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:43,569 INFO L273 TraceCheckUtils]: 21: Hoare triple {18196#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18197#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:43,569 INFO L273 TraceCheckUtils]: 22: Hoare triple {18197#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18197#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:43,570 INFO L273 TraceCheckUtils]: 23: Hoare triple {18197#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18198#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:43,570 INFO L273 TraceCheckUtils]: 24: Hoare triple {18198#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18198#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:43,570 INFO L273 TraceCheckUtils]: 25: Hoare triple {18198#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18199#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:43,571 INFO L273 TraceCheckUtils]: 26: Hoare triple {18199#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18199#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:43,571 INFO L273 TraceCheckUtils]: 27: Hoare triple {18199#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18200#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:43,572 INFO L273 TraceCheckUtils]: 28: Hoare triple {18200#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18200#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:43,572 INFO L273 TraceCheckUtils]: 29: Hoare triple {18200#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18201#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:43,572 INFO L273 TraceCheckUtils]: 30: Hoare triple {18201#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18201#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:43,573 INFO L273 TraceCheckUtils]: 31: Hoare triple {18201#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18202#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:43,573 INFO L273 TraceCheckUtils]: 32: Hoare triple {18202#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18202#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:43,574 INFO L273 TraceCheckUtils]: 33: Hoare triple {18202#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18203#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:43,574 INFO L273 TraceCheckUtils]: 34: Hoare triple {18203#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18203#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:43,575 INFO L273 TraceCheckUtils]: 35: Hoare triple {18203#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18204#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:43,575 INFO L273 TraceCheckUtils]: 36: Hoare triple {18204#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18204#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:43,576 INFO L273 TraceCheckUtils]: 37: Hoare triple {18204#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18205#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:43,577 INFO L273 TraceCheckUtils]: 38: Hoare triple {18205#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18205#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:43,577 INFO L273 TraceCheckUtils]: 39: Hoare triple {18205#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18206#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:43,578 INFO L273 TraceCheckUtils]: 40: Hoare triple {18206#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18206#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:43,579 INFO L273 TraceCheckUtils]: 41: Hoare triple {18206#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18207#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:43,579 INFO L273 TraceCheckUtils]: 42: Hoare triple {18207#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18207#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:43,580 INFO L273 TraceCheckUtils]: 43: Hoare triple {18207#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18208#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:43,580 INFO L273 TraceCheckUtils]: 44: Hoare triple {18208#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18208#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:43,581 INFO L273 TraceCheckUtils]: 45: Hoare triple {18208#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18209#(<= main_~i~1 20)} is VALID [2018-11-23 12:17:43,581 INFO L273 TraceCheckUtils]: 46: Hoare triple {18209#(<= main_~i~1 20)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18209#(<= main_~i~1 20)} is VALID [2018-11-23 12:17:43,582 INFO L273 TraceCheckUtils]: 47: Hoare triple {18209#(<= main_~i~1 20)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18210#(<= main_~i~1 21)} is VALID [2018-11-23 12:17:43,583 INFO L273 TraceCheckUtils]: 48: Hoare triple {18210#(<= main_~i~1 21)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18210#(<= main_~i~1 21)} is VALID [2018-11-23 12:17:43,583 INFO L273 TraceCheckUtils]: 49: Hoare triple {18210#(<= main_~i~1 21)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18211#(<= main_~i~1 22)} is VALID [2018-11-23 12:17:43,584 INFO L273 TraceCheckUtils]: 50: Hoare triple {18211#(<= main_~i~1 22)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18211#(<= main_~i~1 22)} is VALID [2018-11-23 12:17:43,584 INFO L273 TraceCheckUtils]: 51: Hoare triple {18211#(<= main_~i~1 22)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18212#(<= main_~i~1 23)} is VALID [2018-11-23 12:17:43,585 INFO L273 TraceCheckUtils]: 52: Hoare triple {18212#(<= main_~i~1 23)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18212#(<= main_~i~1 23)} is VALID [2018-11-23 12:17:43,586 INFO L273 TraceCheckUtils]: 53: Hoare triple {18212#(<= main_~i~1 23)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18213#(<= main_~i~1 24)} is VALID [2018-11-23 12:17:43,586 INFO L273 TraceCheckUtils]: 54: Hoare triple {18213#(<= main_~i~1 24)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {18213#(<= main_~i~1 24)} is VALID [2018-11-23 12:17:43,587 INFO L273 TraceCheckUtils]: 55: Hoare triple {18213#(<= main_~i~1 24)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18214#(<= main_~i~1 25)} is VALID [2018-11-23 12:17:43,587 INFO L273 TraceCheckUtils]: 56: Hoare triple {18214#(<= main_~i~1 25)} assume !(~i~1 < 60); {18188#false} is VALID [2018-11-23 12:17:43,588 INFO L256 TraceCheckUtils]: 57: Hoare triple {18188#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {18188#false} is VALID [2018-11-23 12:17:43,588 INFO L273 TraceCheckUtils]: 58: Hoare triple {18188#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {18188#false} is VALID [2018-11-23 12:17:43,588 INFO L273 TraceCheckUtils]: 59: Hoare triple {18188#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18188#false} is VALID [2018-11-23 12:17:43,588 INFO L273 TraceCheckUtils]: 60: Hoare triple {18188#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18188#false} is VALID [2018-11-23 12:17:43,588 INFO L273 TraceCheckUtils]: 61: Hoare triple {18188#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18188#false} is VALID [2018-11-23 12:17:43,588 INFO L273 TraceCheckUtils]: 62: Hoare triple {18188#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18188#false} is VALID [2018-11-23 12:17:43,589 INFO L273 TraceCheckUtils]: 63: Hoare triple {18188#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18188#false} is VALID [2018-11-23 12:17:43,589 INFO L273 TraceCheckUtils]: 64: Hoare triple {18188#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18188#false} is VALID [2018-11-23 12:17:43,589 INFO L273 TraceCheckUtils]: 65: Hoare triple {18188#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18188#false} is VALID [2018-11-23 12:17:43,589 INFO L273 TraceCheckUtils]: 66: Hoare triple {18188#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18188#false} is VALID [2018-11-23 12:17:43,589 INFO L273 TraceCheckUtils]: 67: Hoare triple {18188#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18188#false} is VALID [2018-11-23 12:17:43,589 INFO L273 TraceCheckUtils]: 68: Hoare triple {18188#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18188#false} is VALID [2018-11-23 12:17:43,590 INFO L273 TraceCheckUtils]: 69: Hoare triple {18188#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18188#false} is VALID [2018-11-23 12:17:43,590 INFO L273 TraceCheckUtils]: 70: Hoare triple {18188#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18188#false} is VALID [2018-11-23 12:17:43,590 INFO L273 TraceCheckUtils]: 71: Hoare triple {18188#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18188#false} is VALID [2018-11-23 12:17:43,590 INFO L273 TraceCheckUtils]: 72: Hoare triple {18188#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18188#false} is VALID [2018-11-23 12:17:43,590 INFO L273 TraceCheckUtils]: 73: Hoare triple {18188#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18188#false} is VALID [2018-11-23 12:17:43,590 INFO L273 TraceCheckUtils]: 74: Hoare triple {18188#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18188#false} is VALID [2018-11-23 12:17:43,591 INFO L273 TraceCheckUtils]: 75: Hoare triple {18188#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18188#false} is VALID [2018-11-23 12:17:43,591 INFO L273 TraceCheckUtils]: 76: Hoare triple {18188#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18188#false} is VALID [2018-11-23 12:17:43,591 INFO L273 TraceCheckUtils]: 77: Hoare triple {18188#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18188#false} is VALID [2018-11-23 12:17:43,591 INFO L273 TraceCheckUtils]: 78: Hoare triple {18188#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18188#false} is VALID [2018-11-23 12:17:43,591 INFO L273 TraceCheckUtils]: 79: Hoare triple {18188#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18188#false} is VALID [2018-11-23 12:17:43,591 INFO L273 TraceCheckUtils]: 80: Hoare triple {18188#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18188#false} is VALID [2018-11-23 12:17:43,592 INFO L273 TraceCheckUtils]: 81: Hoare triple {18188#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18188#false} is VALID [2018-11-23 12:17:43,592 INFO L273 TraceCheckUtils]: 82: Hoare triple {18188#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18188#false} is VALID [2018-11-23 12:17:43,592 INFO L273 TraceCheckUtils]: 83: Hoare triple {18188#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18188#false} is VALID [2018-11-23 12:17:43,592 INFO L273 TraceCheckUtils]: 84: Hoare triple {18188#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18188#false} is VALID [2018-11-23 12:17:43,592 INFO L273 TraceCheckUtils]: 85: Hoare triple {18188#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18188#false} is VALID [2018-11-23 12:17:43,592 INFO L273 TraceCheckUtils]: 86: Hoare triple {18188#false} assume !(~i~0 < 60); {18188#false} is VALID [2018-11-23 12:17:43,592 INFO L273 TraceCheckUtils]: 87: Hoare triple {18188#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {18188#false} is VALID [2018-11-23 12:17:43,592 INFO L273 TraceCheckUtils]: 88: Hoare triple {18188#false} assume true; {18188#false} is VALID [2018-11-23 12:17:43,593 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {18188#false} {18188#false} #75#return; {18188#false} is VALID [2018-11-23 12:17:43,593 INFO L273 TraceCheckUtils]: 90: Hoare triple {18188#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {18188#false} is VALID [2018-11-23 12:17:43,593 INFO L256 TraceCheckUtils]: 91: Hoare triple {18188#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {18188#false} is VALID [2018-11-23 12:17:43,593 INFO L273 TraceCheckUtils]: 92: Hoare triple {18188#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {18188#false} is VALID [2018-11-23 12:17:43,593 INFO L273 TraceCheckUtils]: 93: Hoare triple {18188#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18188#false} is VALID [2018-11-23 12:17:43,593 INFO L273 TraceCheckUtils]: 94: Hoare triple {18188#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18188#false} is VALID [2018-11-23 12:17:43,593 INFO L273 TraceCheckUtils]: 95: Hoare triple {18188#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18188#false} is VALID [2018-11-23 12:17:43,593 INFO L273 TraceCheckUtils]: 96: Hoare triple {18188#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18188#false} is VALID [2018-11-23 12:17:43,593 INFO L273 TraceCheckUtils]: 97: Hoare triple {18188#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18188#false} is VALID [2018-11-23 12:17:43,593 INFO L273 TraceCheckUtils]: 98: Hoare triple {18188#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18188#false} is VALID [2018-11-23 12:17:43,594 INFO L273 TraceCheckUtils]: 99: Hoare triple {18188#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18188#false} is VALID [2018-11-23 12:17:43,594 INFO L273 TraceCheckUtils]: 100: Hoare triple {18188#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18188#false} is VALID [2018-11-23 12:17:43,594 INFO L273 TraceCheckUtils]: 101: Hoare triple {18188#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18188#false} is VALID [2018-11-23 12:17:43,594 INFO L273 TraceCheckUtils]: 102: Hoare triple {18188#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18188#false} is VALID [2018-11-23 12:17:43,594 INFO L273 TraceCheckUtils]: 103: Hoare triple {18188#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18188#false} is VALID [2018-11-23 12:17:43,594 INFO L273 TraceCheckUtils]: 104: Hoare triple {18188#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18188#false} is VALID [2018-11-23 12:17:43,594 INFO L273 TraceCheckUtils]: 105: Hoare triple {18188#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18188#false} is VALID [2018-11-23 12:17:43,594 INFO L273 TraceCheckUtils]: 106: Hoare triple {18188#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18188#false} is VALID [2018-11-23 12:17:43,594 INFO L273 TraceCheckUtils]: 107: Hoare triple {18188#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18188#false} is VALID [2018-11-23 12:17:43,595 INFO L273 TraceCheckUtils]: 108: Hoare triple {18188#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18188#false} is VALID [2018-11-23 12:17:43,595 INFO L273 TraceCheckUtils]: 109: Hoare triple {18188#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18188#false} is VALID [2018-11-23 12:17:43,595 INFO L273 TraceCheckUtils]: 110: Hoare triple {18188#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18188#false} is VALID [2018-11-23 12:17:43,595 INFO L273 TraceCheckUtils]: 111: Hoare triple {18188#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18188#false} is VALID [2018-11-23 12:17:43,595 INFO L273 TraceCheckUtils]: 112: Hoare triple {18188#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18188#false} is VALID [2018-11-23 12:17:43,595 INFO L273 TraceCheckUtils]: 113: Hoare triple {18188#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18188#false} is VALID [2018-11-23 12:17:43,595 INFO L273 TraceCheckUtils]: 114: Hoare triple {18188#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18188#false} is VALID [2018-11-23 12:17:43,595 INFO L273 TraceCheckUtils]: 115: Hoare triple {18188#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18188#false} is VALID [2018-11-23 12:17:43,595 INFO L273 TraceCheckUtils]: 116: Hoare triple {18188#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18188#false} is VALID [2018-11-23 12:17:43,595 INFO L273 TraceCheckUtils]: 117: Hoare triple {18188#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18188#false} is VALID [2018-11-23 12:17:43,596 INFO L273 TraceCheckUtils]: 118: Hoare triple {18188#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18188#false} is VALID [2018-11-23 12:17:43,596 INFO L273 TraceCheckUtils]: 119: Hoare triple {18188#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18188#false} is VALID [2018-11-23 12:17:43,596 INFO L273 TraceCheckUtils]: 120: Hoare triple {18188#false} assume !(~i~0 < 60); {18188#false} is VALID [2018-11-23 12:17:43,596 INFO L273 TraceCheckUtils]: 121: Hoare triple {18188#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {18188#false} is VALID [2018-11-23 12:17:43,596 INFO L273 TraceCheckUtils]: 122: Hoare triple {18188#false} assume true; {18188#false} is VALID [2018-11-23 12:17:43,596 INFO L268 TraceCheckUtils]: 123: Hoare quadruple {18188#false} {18188#false} #77#return; {18188#false} is VALID [2018-11-23 12:17:43,596 INFO L273 TraceCheckUtils]: 124: Hoare triple {18188#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {18188#false} is VALID [2018-11-23 12:17:43,596 INFO L273 TraceCheckUtils]: 125: Hoare triple {18188#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {18188#false} is VALID [2018-11-23 12:17:43,596 INFO L273 TraceCheckUtils]: 126: Hoare triple {18188#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {18188#false} is VALID [2018-11-23 12:17:43,597 INFO L273 TraceCheckUtils]: 127: Hoare triple {18188#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {18188#false} is VALID [2018-11-23 12:17:43,597 INFO L273 TraceCheckUtils]: 128: Hoare triple {18188#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {18188#false} is VALID [2018-11-23 12:17:43,597 INFO L273 TraceCheckUtils]: 129: Hoare triple {18188#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {18188#false} is VALID [2018-11-23 12:17:43,597 INFO L273 TraceCheckUtils]: 130: Hoare triple {18188#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {18188#false} is VALID [2018-11-23 12:17:43,597 INFO L273 TraceCheckUtils]: 131: Hoare triple {18188#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {18188#false} is VALID [2018-11-23 12:17:43,597 INFO L273 TraceCheckUtils]: 132: Hoare triple {18188#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {18188#false} is VALID [2018-11-23 12:17:43,597 INFO L273 TraceCheckUtils]: 133: Hoare triple {18188#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {18188#false} is VALID [2018-11-23 12:17:43,597 INFO L273 TraceCheckUtils]: 134: Hoare triple {18188#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {18188#false} is VALID [2018-11-23 12:17:43,597 INFO L273 TraceCheckUtils]: 135: Hoare triple {18188#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {18188#false} is VALID [2018-11-23 12:17:43,598 INFO L273 TraceCheckUtils]: 136: Hoare triple {18188#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {18188#false} is VALID [2018-11-23 12:17:43,598 INFO L273 TraceCheckUtils]: 137: Hoare triple {18188#false} assume !(~i~2 < 59); {18188#false} is VALID [2018-11-23 12:17:43,598 INFO L273 TraceCheckUtils]: 138: Hoare triple {18188#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {18188#false} is VALID [2018-11-23 12:17:43,598 INFO L256 TraceCheckUtils]: 139: Hoare triple {18188#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {18188#false} is VALID [2018-11-23 12:17:43,598 INFO L273 TraceCheckUtils]: 140: Hoare triple {18188#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {18188#false} is VALID [2018-11-23 12:17:43,598 INFO L273 TraceCheckUtils]: 141: Hoare triple {18188#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18188#false} is VALID [2018-11-23 12:17:43,598 INFO L273 TraceCheckUtils]: 142: Hoare triple {18188#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18188#false} is VALID [2018-11-23 12:17:43,599 INFO L273 TraceCheckUtils]: 143: Hoare triple {18188#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18188#false} is VALID [2018-11-23 12:17:43,599 INFO L273 TraceCheckUtils]: 144: Hoare triple {18188#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18188#false} is VALID [2018-11-23 12:17:43,599 INFO L273 TraceCheckUtils]: 145: Hoare triple {18188#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18188#false} is VALID [2018-11-23 12:17:43,599 INFO L273 TraceCheckUtils]: 146: Hoare triple {18188#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18188#false} is VALID [2018-11-23 12:17:43,599 INFO L273 TraceCheckUtils]: 147: Hoare triple {18188#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18188#false} is VALID [2018-11-23 12:17:43,599 INFO L273 TraceCheckUtils]: 148: Hoare triple {18188#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18188#false} is VALID [2018-11-23 12:17:43,599 INFO L273 TraceCheckUtils]: 149: Hoare triple {18188#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18188#false} is VALID [2018-11-23 12:17:43,599 INFO L273 TraceCheckUtils]: 150: Hoare triple {18188#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18188#false} is VALID [2018-11-23 12:17:43,599 INFO L273 TraceCheckUtils]: 151: Hoare triple {18188#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18188#false} is VALID [2018-11-23 12:17:43,600 INFO L273 TraceCheckUtils]: 152: Hoare triple {18188#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18188#false} is VALID [2018-11-23 12:17:43,600 INFO L273 TraceCheckUtils]: 153: Hoare triple {18188#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18188#false} is VALID [2018-11-23 12:17:43,600 INFO L273 TraceCheckUtils]: 154: Hoare triple {18188#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18188#false} is VALID [2018-11-23 12:17:43,600 INFO L273 TraceCheckUtils]: 155: Hoare triple {18188#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18188#false} is VALID [2018-11-23 12:17:43,600 INFO L273 TraceCheckUtils]: 156: Hoare triple {18188#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18188#false} is VALID [2018-11-23 12:17:43,600 INFO L273 TraceCheckUtils]: 157: Hoare triple {18188#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18188#false} is VALID [2018-11-23 12:17:43,600 INFO L273 TraceCheckUtils]: 158: Hoare triple {18188#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18188#false} is VALID [2018-11-23 12:17:43,600 INFO L273 TraceCheckUtils]: 159: Hoare triple {18188#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18188#false} is VALID [2018-11-23 12:17:43,600 INFO L273 TraceCheckUtils]: 160: Hoare triple {18188#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18188#false} is VALID [2018-11-23 12:17:43,600 INFO L273 TraceCheckUtils]: 161: Hoare triple {18188#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18188#false} is VALID [2018-11-23 12:17:43,601 INFO L273 TraceCheckUtils]: 162: Hoare triple {18188#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18188#false} is VALID [2018-11-23 12:17:43,601 INFO L273 TraceCheckUtils]: 163: Hoare triple {18188#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18188#false} is VALID [2018-11-23 12:17:43,601 INFO L273 TraceCheckUtils]: 164: Hoare triple {18188#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18188#false} is VALID [2018-11-23 12:17:43,601 INFO L273 TraceCheckUtils]: 165: Hoare triple {18188#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {18188#false} is VALID [2018-11-23 12:17:43,601 INFO L273 TraceCheckUtils]: 166: Hoare triple {18188#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {18188#false} is VALID [2018-11-23 12:17:43,601 INFO L273 TraceCheckUtils]: 167: Hoare triple {18188#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {18188#false} is VALID [2018-11-23 12:17:43,601 INFO L273 TraceCheckUtils]: 168: Hoare triple {18188#false} assume !(~i~0 < 60); {18188#false} is VALID [2018-11-23 12:17:43,601 INFO L273 TraceCheckUtils]: 169: Hoare triple {18188#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {18188#false} is VALID [2018-11-23 12:17:43,601 INFO L273 TraceCheckUtils]: 170: Hoare triple {18188#false} assume true; {18188#false} is VALID [2018-11-23 12:17:43,602 INFO L268 TraceCheckUtils]: 171: Hoare quadruple {18188#false} {18188#false} #79#return; {18188#false} is VALID [2018-11-23 12:17:43,602 INFO L273 TraceCheckUtils]: 172: Hoare triple {18188#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {18188#false} is VALID [2018-11-23 12:17:43,602 INFO L273 TraceCheckUtils]: 173: Hoare triple {18188#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {18188#false} is VALID [2018-11-23 12:17:43,602 INFO L273 TraceCheckUtils]: 174: Hoare triple {18188#false} assume !false; {18188#false} is VALID [2018-11-23 12:17:43,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1810 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 1185 trivial. 0 not checked. [2018-11-23 12:17:43,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:43,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 12:17:43,634 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 175 [2018-11-23 12:17:43,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:43,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 12:17:43,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:43,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 12:17:43,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 12:17:43,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:17:43,887 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand 29 states. [2018-11-23 12:17:44,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:44,786 INFO L93 Difference]: Finished difference Result 170 states and 196 transitions. [2018-11-23 12:17:44,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:17:44,786 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 175 [2018-11-23 12:17:44,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:44,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:17:44,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 108 transitions. [2018-11-23 12:17:44,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:17:44,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 108 transitions. [2018-11-23 12:17:44,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 108 transitions. [2018-11-23 12:17:44,936 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-23 12:17:44,939 INFO L225 Difference]: With dead ends: 170 [2018-11-23 12:17:44,939 INFO L226 Difference]: Without dead ends: 115 [2018-11-23 12:17:44,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:17:44,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-23 12:17:44,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-11-23 12:17:44,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:44,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 114 states. [2018-11-23 12:17:44,976 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 114 states. [2018-11-23 12:17:44,976 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 114 states. [2018-11-23 12:17:44,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:44,978 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2018-11-23 12:17:44,978 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2018-11-23 12:17:44,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:44,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:44,979 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 115 states. [2018-11-23 12:17:44,979 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 115 states. [2018-11-23 12:17:44,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:44,981 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2018-11-23 12:17:44,981 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2018-11-23 12:17:44,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:44,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:44,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:44,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:44,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 12:17:44,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2018-11-23 12:17:44,984 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 175 [2018-11-23 12:17:44,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:44,985 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2018-11-23 12:17:44,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 12:17:44,985 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2018-11-23 12:17:44,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-23 12:17:44,986 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:44,986 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:17:44,986 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:44,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:44,987 INFO L82 PathProgramCache]: Analyzing trace with hash 912756663, now seen corresponding path program 26 times [2018-11-23 12:17:44,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:44,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:44,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:44,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:17:44,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:45,534 INFO L256 TraceCheckUtils]: 0: Hoare triple {19379#true} call ULTIMATE.init(); {19379#true} is VALID [2018-11-23 12:17:45,535 INFO L273 TraceCheckUtils]: 1: Hoare triple {19379#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19379#true} is VALID [2018-11-23 12:17:45,535 INFO L273 TraceCheckUtils]: 2: Hoare triple {19379#true} assume true; {19379#true} is VALID [2018-11-23 12:17:45,535 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19379#true} {19379#true} #71#return; {19379#true} is VALID [2018-11-23 12:17:45,535 INFO L256 TraceCheckUtils]: 4: Hoare triple {19379#true} call #t~ret14 := main(); {19379#true} is VALID [2018-11-23 12:17:45,536 INFO L273 TraceCheckUtils]: 5: Hoare triple {19379#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {19381#(= main_~i~1 0)} is VALID [2018-11-23 12:17:45,536 INFO L273 TraceCheckUtils]: 6: Hoare triple {19381#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19381#(= main_~i~1 0)} is VALID [2018-11-23 12:17:45,537 INFO L273 TraceCheckUtils]: 7: Hoare triple {19381#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19382#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:45,537 INFO L273 TraceCheckUtils]: 8: Hoare triple {19382#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19382#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:45,538 INFO L273 TraceCheckUtils]: 9: Hoare triple {19382#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19383#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:45,538 INFO L273 TraceCheckUtils]: 10: Hoare triple {19383#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19383#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:45,538 INFO L273 TraceCheckUtils]: 11: Hoare triple {19383#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19384#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:45,539 INFO L273 TraceCheckUtils]: 12: Hoare triple {19384#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19384#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:45,539 INFO L273 TraceCheckUtils]: 13: Hoare triple {19384#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19385#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:45,540 INFO L273 TraceCheckUtils]: 14: Hoare triple {19385#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19385#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:45,540 INFO L273 TraceCheckUtils]: 15: Hoare triple {19385#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19386#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:45,541 INFO L273 TraceCheckUtils]: 16: Hoare triple {19386#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19386#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:45,541 INFO L273 TraceCheckUtils]: 17: Hoare triple {19386#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19387#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:45,542 INFO L273 TraceCheckUtils]: 18: Hoare triple {19387#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19387#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:45,543 INFO L273 TraceCheckUtils]: 19: Hoare triple {19387#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19388#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:45,543 INFO L273 TraceCheckUtils]: 20: Hoare triple {19388#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19388#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:45,544 INFO L273 TraceCheckUtils]: 21: Hoare triple {19388#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19389#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:45,545 INFO L273 TraceCheckUtils]: 22: Hoare triple {19389#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19389#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:45,545 INFO L273 TraceCheckUtils]: 23: Hoare triple {19389#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19390#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:45,546 INFO L273 TraceCheckUtils]: 24: Hoare triple {19390#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19390#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:45,546 INFO L273 TraceCheckUtils]: 25: Hoare triple {19390#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19391#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:45,547 INFO L273 TraceCheckUtils]: 26: Hoare triple {19391#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19391#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:45,548 INFO L273 TraceCheckUtils]: 27: Hoare triple {19391#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19392#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:45,548 INFO L273 TraceCheckUtils]: 28: Hoare triple {19392#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19392#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:45,549 INFO L273 TraceCheckUtils]: 29: Hoare triple {19392#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19393#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:45,568 INFO L273 TraceCheckUtils]: 30: Hoare triple {19393#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19393#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:45,569 INFO L273 TraceCheckUtils]: 31: Hoare triple {19393#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19394#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:45,569 INFO L273 TraceCheckUtils]: 32: Hoare triple {19394#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19394#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:45,570 INFO L273 TraceCheckUtils]: 33: Hoare triple {19394#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19395#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:45,570 INFO L273 TraceCheckUtils]: 34: Hoare triple {19395#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19395#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:45,571 INFO L273 TraceCheckUtils]: 35: Hoare triple {19395#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19396#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:45,571 INFO L273 TraceCheckUtils]: 36: Hoare triple {19396#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19396#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:45,571 INFO L273 TraceCheckUtils]: 37: Hoare triple {19396#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19397#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:45,572 INFO L273 TraceCheckUtils]: 38: Hoare triple {19397#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19397#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:45,572 INFO L273 TraceCheckUtils]: 39: Hoare triple {19397#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19398#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:45,572 INFO L273 TraceCheckUtils]: 40: Hoare triple {19398#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19398#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:45,573 INFO L273 TraceCheckUtils]: 41: Hoare triple {19398#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19399#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:45,573 INFO L273 TraceCheckUtils]: 42: Hoare triple {19399#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19399#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:45,574 INFO L273 TraceCheckUtils]: 43: Hoare triple {19399#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19400#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:45,574 INFO L273 TraceCheckUtils]: 44: Hoare triple {19400#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19400#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:45,575 INFO L273 TraceCheckUtils]: 45: Hoare triple {19400#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19401#(<= main_~i~1 20)} is VALID [2018-11-23 12:17:45,576 INFO L273 TraceCheckUtils]: 46: Hoare triple {19401#(<= main_~i~1 20)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19401#(<= main_~i~1 20)} is VALID [2018-11-23 12:17:45,576 INFO L273 TraceCheckUtils]: 47: Hoare triple {19401#(<= main_~i~1 20)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19402#(<= main_~i~1 21)} is VALID [2018-11-23 12:17:45,577 INFO L273 TraceCheckUtils]: 48: Hoare triple {19402#(<= main_~i~1 21)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19402#(<= main_~i~1 21)} is VALID [2018-11-23 12:17:45,577 INFO L273 TraceCheckUtils]: 49: Hoare triple {19402#(<= main_~i~1 21)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19403#(<= main_~i~1 22)} is VALID [2018-11-23 12:17:45,578 INFO L273 TraceCheckUtils]: 50: Hoare triple {19403#(<= main_~i~1 22)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19403#(<= main_~i~1 22)} is VALID [2018-11-23 12:17:45,579 INFO L273 TraceCheckUtils]: 51: Hoare triple {19403#(<= main_~i~1 22)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19404#(<= main_~i~1 23)} is VALID [2018-11-23 12:17:45,579 INFO L273 TraceCheckUtils]: 52: Hoare triple {19404#(<= main_~i~1 23)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19404#(<= main_~i~1 23)} is VALID [2018-11-23 12:17:45,580 INFO L273 TraceCheckUtils]: 53: Hoare triple {19404#(<= main_~i~1 23)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19405#(<= main_~i~1 24)} is VALID [2018-11-23 12:17:45,580 INFO L273 TraceCheckUtils]: 54: Hoare triple {19405#(<= main_~i~1 24)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19405#(<= main_~i~1 24)} is VALID [2018-11-23 12:17:45,581 INFO L273 TraceCheckUtils]: 55: Hoare triple {19405#(<= main_~i~1 24)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19406#(<= main_~i~1 25)} is VALID [2018-11-23 12:17:45,582 INFO L273 TraceCheckUtils]: 56: Hoare triple {19406#(<= main_~i~1 25)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19406#(<= main_~i~1 25)} is VALID [2018-11-23 12:17:45,582 INFO L273 TraceCheckUtils]: 57: Hoare triple {19406#(<= main_~i~1 25)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19407#(<= main_~i~1 26)} is VALID [2018-11-23 12:17:45,583 INFO L273 TraceCheckUtils]: 58: Hoare triple {19407#(<= main_~i~1 26)} assume !(~i~1 < 60); {19380#false} is VALID [2018-11-23 12:17:45,583 INFO L256 TraceCheckUtils]: 59: Hoare triple {19380#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {19379#true} is VALID [2018-11-23 12:17:45,584 INFO L273 TraceCheckUtils]: 60: Hoare triple {19379#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {19379#true} is VALID [2018-11-23 12:17:45,584 INFO L273 TraceCheckUtils]: 61: Hoare triple {19379#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19379#true} is VALID [2018-11-23 12:17:45,584 INFO L273 TraceCheckUtils]: 62: Hoare triple {19379#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19379#true} is VALID [2018-11-23 12:17:45,584 INFO L273 TraceCheckUtils]: 63: Hoare triple {19379#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19379#true} is VALID [2018-11-23 12:17:45,584 INFO L273 TraceCheckUtils]: 64: Hoare triple {19379#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19379#true} is VALID [2018-11-23 12:17:45,584 INFO L273 TraceCheckUtils]: 65: Hoare triple {19379#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19379#true} is VALID [2018-11-23 12:17:45,585 INFO L273 TraceCheckUtils]: 66: Hoare triple {19379#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19379#true} is VALID [2018-11-23 12:17:45,585 INFO L273 TraceCheckUtils]: 67: Hoare triple {19379#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19379#true} is VALID [2018-11-23 12:17:45,585 INFO L273 TraceCheckUtils]: 68: Hoare triple {19379#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19379#true} is VALID [2018-11-23 12:17:45,585 INFO L273 TraceCheckUtils]: 69: Hoare triple {19379#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19379#true} is VALID [2018-11-23 12:17:45,585 INFO L273 TraceCheckUtils]: 70: Hoare triple {19379#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19379#true} is VALID [2018-11-23 12:17:45,586 INFO L273 TraceCheckUtils]: 71: Hoare triple {19379#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19379#true} is VALID [2018-11-23 12:17:45,586 INFO L273 TraceCheckUtils]: 72: Hoare triple {19379#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19379#true} is VALID [2018-11-23 12:17:45,586 INFO L273 TraceCheckUtils]: 73: Hoare triple {19379#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19379#true} is VALID [2018-11-23 12:17:45,586 INFO L273 TraceCheckUtils]: 74: Hoare triple {19379#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19379#true} is VALID [2018-11-23 12:17:45,586 INFO L273 TraceCheckUtils]: 75: Hoare triple {19379#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19379#true} is VALID [2018-11-23 12:17:45,586 INFO L273 TraceCheckUtils]: 76: Hoare triple {19379#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19379#true} is VALID [2018-11-23 12:17:45,587 INFO L273 TraceCheckUtils]: 77: Hoare triple {19379#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19379#true} is VALID [2018-11-23 12:17:45,587 INFO L273 TraceCheckUtils]: 78: Hoare triple {19379#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19379#true} is VALID [2018-11-23 12:17:45,587 INFO L273 TraceCheckUtils]: 79: Hoare triple {19379#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19379#true} is VALID [2018-11-23 12:17:45,587 INFO L273 TraceCheckUtils]: 80: Hoare triple {19379#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19379#true} is VALID [2018-11-23 12:17:45,587 INFO L273 TraceCheckUtils]: 81: Hoare triple {19379#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19379#true} is VALID [2018-11-23 12:17:45,587 INFO L273 TraceCheckUtils]: 82: Hoare triple {19379#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19379#true} is VALID [2018-11-23 12:17:45,587 INFO L273 TraceCheckUtils]: 83: Hoare triple {19379#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19379#true} is VALID [2018-11-23 12:17:45,587 INFO L273 TraceCheckUtils]: 84: Hoare triple {19379#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19379#true} is VALID [2018-11-23 12:17:45,587 INFO L273 TraceCheckUtils]: 85: Hoare triple {19379#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19379#true} is VALID [2018-11-23 12:17:45,588 INFO L273 TraceCheckUtils]: 86: Hoare triple {19379#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19379#true} is VALID [2018-11-23 12:17:45,588 INFO L273 TraceCheckUtils]: 87: Hoare triple {19379#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19379#true} is VALID [2018-11-23 12:17:45,588 INFO L273 TraceCheckUtils]: 88: Hoare triple {19379#true} assume !(~i~0 < 60); {19379#true} is VALID [2018-11-23 12:17:45,588 INFO L273 TraceCheckUtils]: 89: Hoare triple {19379#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {19379#true} is VALID [2018-11-23 12:17:45,588 INFO L273 TraceCheckUtils]: 90: Hoare triple {19379#true} assume true; {19379#true} is VALID [2018-11-23 12:17:45,588 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {19379#true} {19380#false} #75#return; {19380#false} is VALID [2018-11-23 12:17:45,588 INFO L273 TraceCheckUtils]: 92: Hoare triple {19380#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {19380#false} is VALID [2018-11-23 12:17:45,588 INFO L256 TraceCheckUtils]: 93: Hoare triple {19380#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {19379#true} is VALID [2018-11-23 12:17:45,588 INFO L273 TraceCheckUtils]: 94: Hoare triple {19379#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {19379#true} is VALID [2018-11-23 12:17:45,588 INFO L273 TraceCheckUtils]: 95: Hoare triple {19379#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19379#true} is VALID [2018-11-23 12:17:45,589 INFO L273 TraceCheckUtils]: 96: Hoare triple {19379#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19379#true} is VALID [2018-11-23 12:17:45,589 INFO L273 TraceCheckUtils]: 97: Hoare triple {19379#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19379#true} is VALID [2018-11-23 12:17:45,589 INFO L273 TraceCheckUtils]: 98: Hoare triple {19379#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19379#true} is VALID [2018-11-23 12:17:45,589 INFO L273 TraceCheckUtils]: 99: Hoare triple {19379#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19379#true} is VALID [2018-11-23 12:17:45,589 INFO L273 TraceCheckUtils]: 100: Hoare triple {19379#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19379#true} is VALID [2018-11-23 12:17:45,589 INFO L273 TraceCheckUtils]: 101: Hoare triple {19379#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19379#true} is VALID [2018-11-23 12:17:45,589 INFO L273 TraceCheckUtils]: 102: Hoare triple {19379#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19379#true} is VALID [2018-11-23 12:17:45,589 INFO L273 TraceCheckUtils]: 103: Hoare triple {19379#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19379#true} is VALID [2018-11-23 12:17:45,589 INFO L273 TraceCheckUtils]: 104: Hoare triple {19379#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19379#true} is VALID [2018-11-23 12:17:45,589 INFO L273 TraceCheckUtils]: 105: Hoare triple {19379#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19379#true} is VALID [2018-11-23 12:17:45,590 INFO L273 TraceCheckUtils]: 106: Hoare triple {19379#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19379#true} is VALID [2018-11-23 12:17:45,590 INFO L273 TraceCheckUtils]: 107: Hoare triple {19379#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19379#true} is VALID [2018-11-23 12:17:45,590 INFO L273 TraceCheckUtils]: 108: Hoare triple {19379#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19379#true} is VALID [2018-11-23 12:17:45,590 INFO L273 TraceCheckUtils]: 109: Hoare triple {19379#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19379#true} is VALID [2018-11-23 12:17:45,590 INFO L273 TraceCheckUtils]: 110: Hoare triple {19379#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19379#true} is VALID [2018-11-23 12:17:45,590 INFO L273 TraceCheckUtils]: 111: Hoare triple {19379#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19379#true} is VALID [2018-11-23 12:17:45,590 INFO L273 TraceCheckUtils]: 112: Hoare triple {19379#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19379#true} is VALID [2018-11-23 12:17:45,590 INFO L273 TraceCheckUtils]: 113: Hoare triple {19379#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19379#true} is VALID [2018-11-23 12:17:45,590 INFO L273 TraceCheckUtils]: 114: Hoare triple {19379#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19379#true} is VALID [2018-11-23 12:17:45,591 INFO L273 TraceCheckUtils]: 115: Hoare triple {19379#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19379#true} is VALID [2018-11-23 12:17:45,591 INFO L273 TraceCheckUtils]: 116: Hoare triple {19379#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19379#true} is VALID [2018-11-23 12:17:45,591 INFO L273 TraceCheckUtils]: 117: Hoare triple {19379#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19379#true} is VALID [2018-11-23 12:17:45,591 INFO L273 TraceCheckUtils]: 118: Hoare triple {19379#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19379#true} is VALID [2018-11-23 12:17:45,591 INFO L273 TraceCheckUtils]: 119: Hoare triple {19379#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19379#true} is VALID [2018-11-23 12:17:45,591 INFO L273 TraceCheckUtils]: 120: Hoare triple {19379#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19379#true} is VALID [2018-11-23 12:17:45,591 INFO L273 TraceCheckUtils]: 121: Hoare triple {19379#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19379#true} is VALID [2018-11-23 12:17:45,591 INFO L273 TraceCheckUtils]: 122: Hoare triple {19379#true} assume !(~i~0 < 60); {19379#true} is VALID [2018-11-23 12:17:45,591 INFO L273 TraceCheckUtils]: 123: Hoare triple {19379#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {19379#true} is VALID [2018-11-23 12:17:45,591 INFO L273 TraceCheckUtils]: 124: Hoare triple {19379#true} assume true; {19379#true} is VALID [2018-11-23 12:17:45,592 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {19379#true} {19380#false} #77#return; {19380#false} is VALID [2018-11-23 12:17:45,592 INFO L273 TraceCheckUtils]: 126: Hoare triple {19380#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {19380#false} is VALID [2018-11-23 12:17:45,592 INFO L273 TraceCheckUtils]: 127: Hoare triple {19380#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {19380#false} is VALID [2018-11-23 12:17:45,592 INFO L273 TraceCheckUtils]: 128: Hoare triple {19380#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {19380#false} is VALID [2018-11-23 12:17:45,592 INFO L273 TraceCheckUtils]: 129: Hoare triple {19380#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {19380#false} is VALID [2018-11-23 12:17:45,592 INFO L273 TraceCheckUtils]: 130: Hoare triple {19380#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {19380#false} is VALID [2018-11-23 12:17:45,592 INFO L273 TraceCheckUtils]: 131: Hoare triple {19380#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {19380#false} is VALID [2018-11-23 12:17:45,592 INFO L273 TraceCheckUtils]: 132: Hoare triple {19380#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {19380#false} is VALID [2018-11-23 12:17:45,592 INFO L273 TraceCheckUtils]: 133: Hoare triple {19380#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {19380#false} is VALID [2018-11-23 12:17:45,593 INFO L273 TraceCheckUtils]: 134: Hoare triple {19380#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {19380#false} is VALID [2018-11-23 12:17:45,593 INFO L273 TraceCheckUtils]: 135: Hoare triple {19380#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {19380#false} is VALID [2018-11-23 12:17:45,593 INFO L273 TraceCheckUtils]: 136: Hoare triple {19380#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {19380#false} is VALID [2018-11-23 12:17:45,593 INFO L273 TraceCheckUtils]: 137: Hoare triple {19380#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {19380#false} is VALID [2018-11-23 12:17:45,593 INFO L273 TraceCheckUtils]: 138: Hoare triple {19380#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {19380#false} is VALID [2018-11-23 12:17:45,593 INFO L273 TraceCheckUtils]: 139: Hoare triple {19380#false} assume !(~i~2 < 59); {19380#false} is VALID [2018-11-23 12:17:45,593 INFO L273 TraceCheckUtils]: 140: Hoare triple {19380#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {19380#false} is VALID [2018-11-23 12:17:45,593 INFO L256 TraceCheckUtils]: 141: Hoare triple {19380#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {19379#true} is VALID [2018-11-23 12:17:45,593 INFO L273 TraceCheckUtils]: 142: Hoare triple {19379#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {19379#true} is VALID [2018-11-23 12:17:45,593 INFO L273 TraceCheckUtils]: 143: Hoare triple {19379#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19379#true} is VALID [2018-11-23 12:17:45,594 INFO L273 TraceCheckUtils]: 144: Hoare triple {19379#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19379#true} is VALID [2018-11-23 12:17:45,594 INFO L273 TraceCheckUtils]: 145: Hoare triple {19379#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19379#true} is VALID [2018-11-23 12:17:45,594 INFO L273 TraceCheckUtils]: 146: Hoare triple {19379#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19379#true} is VALID [2018-11-23 12:17:45,594 INFO L273 TraceCheckUtils]: 147: Hoare triple {19379#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19379#true} is VALID [2018-11-23 12:17:45,594 INFO L273 TraceCheckUtils]: 148: Hoare triple {19379#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19379#true} is VALID [2018-11-23 12:17:45,594 INFO L273 TraceCheckUtils]: 149: Hoare triple {19379#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19379#true} is VALID [2018-11-23 12:17:45,594 INFO L273 TraceCheckUtils]: 150: Hoare triple {19379#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19379#true} is VALID [2018-11-23 12:17:45,594 INFO L273 TraceCheckUtils]: 151: Hoare triple {19379#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19379#true} is VALID [2018-11-23 12:17:45,594 INFO L273 TraceCheckUtils]: 152: Hoare triple {19379#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19379#true} is VALID [2018-11-23 12:17:45,595 INFO L273 TraceCheckUtils]: 153: Hoare triple {19379#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19379#true} is VALID [2018-11-23 12:17:45,595 INFO L273 TraceCheckUtils]: 154: Hoare triple {19379#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19379#true} is VALID [2018-11-23 12:17:45,595 INFO L273 TraceCheckUtils]: 155: Hoare triple {19379#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19379#true} is VALID [2018-11-23 12:17:45,595 INFO L273 TraceCheckUtils]: 156: Hoare triple {19379#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19379#true} is VALID [2018-11-23 12:17:45,595 INFO L273 TraceCheckUtils]: 157: Hoare triple {19379#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19379#true} is VALID [2018-11-23 12:17:45,595 INFO L273 TraceCheckUtils]: 158: Hoare triple {19379#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19379#true} is VALID [2018-11-23 12:17:45,595 INFO L273 TraceCheckUtils]: 159: Hoare triple {19379#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19379#true} is VALID [2018-11-23 12:17:45,595 INFO L273 TraceCheckUtils]: 160: Hoare triple {19379#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19379#true} is VALID [2018-11-23 12:17:45,595 INFO L273 TraceCheckUtils]: 161: Hoare triple {19379#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19379#true} is VALID [2018-11-23 12:17:45,596 INFO L273 TraceCheckUtils]: 162: Hoare triple {19379#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19379#true} is VALID [2018-11-23 12:17:45,596 INFO L273 TraceCheckUtils]: 163: Hoare triple {19379#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19379#true} is VALID [2018-11-23 12:17:45,596 INFO L273 TraceCheckUtils]: 164: Hoare triple {19379#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19379#true} is VALID [2018-11-23 12:17:45,596 INFO L273 TraceCheckUtils]: 165: Hoare triple {19379#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19379#true} is VALID [2018-11-23 12:17:45,596 INFO L273 TraceCheckUtils]: 166: Hoare triple {19379#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19379#true} is VALID [2018-11-23 12:17:45,596 INFO L273 TraceCheckUtils]: 167: Hoare triple {19379#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19379#true} is VALID [2018-11-23 12:17:45,596 INFO L273 TraceCheckUtils]: 168: Hoare triple {19379#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19379#true} is VALID [2018-11-23 12:17:45,596 INFO L273 TraceCheckUtils]: 169: Hoare triple {19379#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19379#true} is VALID [2018-11-23 12:17:45,596 INFO L273 TraceCheckUtils]: 170: Hoare triple {19379#true} assume !(~i~0 < 60); {19379#true} is VALID [2018-11-23 12:17:45,596 INFO L273 TraceCheckUtils]: 171: Hoare triple {19379#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {19379#true} is VALID [2018-11-23 12:17:45,597 INFO L273 TraceCheckUtils]: 172: Hoare triple {19379#true} assume true; {19379#true} is VALID [2018-11-23 12:17:45,597 INFO L268 TraceCheckUtils]: 173: Hoare quadruple {19379#true} {19380#false} #79#return; {19380#false} is VALID [2018-11-23 12:17:45,597 INFO L273 TraceCheckUtils]: 174: Hoare triple {19380#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {19380#false} is VALID [2018-11-23 12:17:45,597 INFO L273 TraceCheckUtils]: 175: Hoare triple {19380#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {19380#false} is VALID [2018-11-23 12:17:45,597 INFO L273 TraceCheckUtils]: 176: Hoare triple {19380#false} assume !false; {19380#false} is VALID [2018-11-23 12:17:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1861 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 1185 trivial. 0 not checked. [2018-11-23 12:17:45,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:45,610 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:17:45,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:17:45,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:17:45,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:45,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:46,017 INFO L256 TraceCheckUtils]: 0: Hoare triple {19379#true} call ULTIMATE.init(); {19379#true} is VALID [2018-11-23 12:17:46,018 INFO L273 TraceCheckUtils]: 1: Hoare triple {19379#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19379#true} is VALID [2018-11-23 12:17:46,018 INFO L273 TraceCheckUtils]: 2: Hoare triple {19379#true} assume true; {19379#true} is VALID [2018-11-23 12:17:46,018 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19379#true} {19379#true} #71#return; {19379#true} is VALID [2018-11-23 12:17:46,018 INFO L256 TraceCheckUtils]: 4: Hoare triple {19379#true} call #t~ret14 := main(); {19379#true} is VALID [2018-11-23 12:17:46,019 INFO L273 TraceCheckUtils]: 5: Hoare triple {19379#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {19426#(<= main_~i~1 0)} is VALID [2018-11-23 12:17:46,020 INFO L273 TraceCheckUtils]: 6: Hoare triple {19426#(<= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19426#(<= main_~i~1 0)} is VALID [2018-11-23 12:17:46,020 INFO L273 TraceCheckUtils]: 7: Hoare triple {19426#(<= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19382#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:46,021 INFO L273 TraceCheckUtils]: 8: Hoare triple {19382#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19382#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:46,021 INFO L273 TraceCheckUtils]: 9: Hoare triple {19382#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19383#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:46,021 INFO L273 TraceCheckUtils]: 10: Hoare triple {19383#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19383#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:46,022 INFO L273 TraceCheckUtils]: 11: Hoare triple {19383#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19384#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:46,022 INFO L273 TraceCheckUtils]: 12: Hoare triple {19384#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19384#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:46,023 INFO L273 TraceCheckUtils]: 13: Hoare triple {19384#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19385#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:46,023 INFO L273 TraceCheckUtils]: 14: Hoare triple {19385#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19385#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:46,024 INFO L273 TraceCheckUtils]: 15: Hoare triple {19385#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19386#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:46,024 INFO L273 TraceCheckUtils]: 16: Hoare triple {19386#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19386#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:46,025 INFO L273 TraceCheckUtils]: 17: Hoare triple {19386#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19387#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:46,026 INFO L273 TraceCheckUtils]: 18: Hoare triple {19387#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19387#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:46,026 INFO L273 TraceCheckUtils]: 19: Hoare triple {19387#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19388#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:46,027 INFO L273 TraceCheckUtils]: 20: Hoare triple {19388#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19388#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:46,028 INFO L273 TraceCheckUtils]: 21: Hoare triple {19388#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19389#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:46,028 INFO L273 TraceCheckUtils]: 22: Hoare triple {19389#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19389#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:46,029 INFO L273 TraceCheckUtils]: 23: Hoare triple {19389#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19390#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:46,029 INFO L273 TraceCheckUtils]: 24: Hoare triple {19390#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19390#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:46,030 INFO L273 TraceCheckUtils]: 25: Hoare triple {19390#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19391#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:46,031 INFO L273 TraceCheckUtils]: 26: Hoare triple {19391#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19391#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:46,051 INFO L273 TraceCheckUtils]: 27: Hoare triple {19391#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19392#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:46,060 INFO L273 TraceCheckUtils]: 28: Hoare triple {19392#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19392#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:46,073 INFO L273 TraceCheckUtils]: 29: Hoare triple {19392#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19393#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:46,081 INFO L273 TraceCheckUtils]: 30: Hoare triple {19393#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19393#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:46,095 INFO L273 TraceCheckUtils]: 31: Hoare triple {19393#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19394#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:46,102 INFO L273 TraceCheckUtils]: 32: Hoare triple {19394#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19394#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:46,104 INFO L273 TraceCheckUtils]: 33: Hoare triple {19394#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19395#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:46,104 INFO L273 TraceCheckUtils]: 34: Hoare triple {19395#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19395#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:46,106 INFO L273 TraceCheckUtils]: 35: Hoare triple {19395#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19396#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:46,106 INFO L273 TraceCheckUtils]: 36: Hoare triple {19396#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19396#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:46,108 INFO L273 TraceCheckUtils]: 37: Hoare triple {19396#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19397#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:46,108 INFO L273 TraceCheckUtils]: 38: Hoare triple {19397#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19397#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:46,108 INFO L273 TraceCheckUtils]: 39: Hoare triple {19397#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19398#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:46,109 INFO L273 TraceCheckUtils]: 40: Hoare triple {19398#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19398#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:46,109 INFO L273 TraceCheckUtils]: 41: Hoare triple {19398#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19399#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:46,109 INFO L273 TraceCheckUtils]: 42: Hoare triple {19399#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19399#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:46,110 INFO L273 TraceCheckUtils]: 43: Hoare triple {19399#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19400#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:46,110 INFO L273 TraceCheckUtils]: 44: Hoare triple {19400#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19400#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:46,111 INFO L273 TraceCheckUtils]: 45: Hoare triple {19400#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19401#(<= main_~i~1 20)} is VALID [2018-11-23 12:17:46,111 INFO L273 TraceCheckUtils]: 46: Hoare triple {19401#(<= main_~i~1 20)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19401#(<= main_~i~1 20)} is VALID [2018-11-23 12:17:46,111 INFO L273 TraceCheckUtils]: 47: Hoare triple {19401#(<= main_~i~1 20)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19402#(<= main_~i~1 21)} is VALID [2018-11-23 12:17:46,112 INFO L273 TraceCheckUtils]: 48: Hoare triple {19402#(<= main_~i~1 21)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19402#(<= main_~i~1 21)} is VALID [2018-11-23 12:17:46,112 INFO L273 TraceCheckUtils]: 49: Hoare triple {19402#(<= main_~i~1 21)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19403#(<= main_~i~1 22)} is VALID [2018-11-23 12:17:46,113 INFO L273 TraceCheckUtils]: 50: Hoare triple {19403#(<= main_~i~1 22)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19403#(<= main_~i~1 22)} is VALID [2018-11-23 12:17:46,114 INFO L273 TraceCheckUtils]: 51: Hoare triple {19403#(<= main_~i~1 22)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19404#(<= main_~i~1 23)} is VALID [2018-11-23 12:17:46,114 INFO L273 TraceCheckUtils]: 52: Hoare triple {19404#(<= main_~i~1 23)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19404#(<= main_~i~1 23)} is VALID [2018-11-23 12:17:46,115 INFO L273 TraceCheckUtils]: 53: Hoare triple {19404#(<= main_~i~1 23)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19405#(<= main_~i~1 24)} is VALID [2018-11-23 12:17:46,116 INFO L273 TraceCheckUtils]: 54: Hoare triple {19405#(<= main_~i~1 24)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19405#(<= main_~i~1 24)} is VALID [2018-11-23 12:17:46,116 INFO L273 TraceCheckUtils]: 55: Hoare triple {19405#(<= main_~i~1 24)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19406#(<= main_~i~1 25)} is VALID [2018-11-23 12:17:46,117 INFO L273 TraceCheckUtils]: 56: Hoare triple {19406#(<= main_~i~1 25)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {19406#(<= main_~i~1 25)} is VALID [2018-11-23 12:17:46,117 INFO L273 TraceCheckUtils]: 57: Hoare triple {19406#(<= main_~i~1 25)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19407#(<= main_~i~1 26)} is VALID [2018-11-23 12:17:46,118 INFO L273 TraceCheckUtils]: 58: Hoare triple {19407#(<= main_~i~1 26)} assume !(~i~1 < 60); {19380#false} is VALID [2018-11-23 12:17:46,118 INFO L256 TraceCheckUtils]: 59: Hoare triple {19380#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {19380#false} is VALID [2018-11-23 12:17:46,119 INFO L273 TraceCheckUtils]: 60: Hoare triple {19380#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {19380#false} is VALID [2018-11-23 12:17:46,119 INFO L273 TraceCheckUtils]: 61: Hoare triple {19380#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19380#false} is VALID [2018-11-23 12:17:46,119 INFO L273 TraceCheckUtils]: 62: Hoare triple {19380#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19380#false} is VALID [2018-11-23 12:17:46,119 INFO L273 TraceCheckUtils]: 63: Hoare triple {19380#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19380#false} is VALID [2018-11-23 12:17:46,119 INFO L273 TraceCheckUtils]: 64: Hoare triple {19380#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19380#false} is VALID [2018-11-23 12:17:46,120 INFO L273 TraceCheckUtils]: 65: Hoare triple {19380#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19380#false} is VALID [2018-11-23 12:17:46,120 INFO L273 TraceCheckUtils]: 66: Hoare triple {19380#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19380#false} is VALID [2018-11-23 12:17:46,120 INFO L273 TraceCheckUtils]: 67: Hoare triple {19380#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19380#false} is VALID [2018-11-23 12:17:46,120 INFO L273 TraceCheckUtils]: 68: Hoare triple {19380#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19380#false} is VALID [2018-11-23 12:17:46,120 INFO L273 TraceCheckUtils]: 69: Hoare triple {19380#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19380#false} is VALID [2018-11-23 12:17:46,120 INFO L273 TraceCheckUtils]: 70: Hoare triple {19380#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19380#false} is VALID [2018-11-23 12:17:46,121 INFO L273 TraceCheckUtils]: 71: Hoare triple {19380#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19380#false} is VALID [2018-11-23 12:17:46,121 INFO L273 TraceCheckUtils]: 72: Hoare triple {19380#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19380#false} is VALID [2018-11-23 12:17:46,121 INFO L273 TraceCheckUtils]: 73: Hoare triple {19380#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19380#false} is VALID [2018-11-23 12:17:46,121 INFO L273 TraceCheckUtils]: 74: Hoare triple {19380#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19380#false} is VALID [2018-11-23 12:17:46,121 INFO L273 TraceCheckUtils]: 75: Hoare triple {19380#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19380#false} is VALID [2018-11-23 12:17:46,121 INFO L273 TraceCheckUtils]: 76: Hoare triple {19380#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19380#false} is VALID [2018-11-23 12:17:46,121 INFO L273 TraceCheckUtils]: 77: Hoare triple {19380#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19380#false} is VALID [2018-11-23 12:17:46,121 INFO L273 TraceCheckUtils]: 78: Hoare triple {19380#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19380#false} is VALID [2018-11-23 12:17:46,121 INFO L273 TraceCheckUtils]: 79: Hoare triple {19380#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19380#false} is VALID [2018-11-23 12:17:46,121 INFO L273 TraceCheckUtils]: 80: Hoare triple {19380#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19380#false} is VALID [2018-11-23 12:17:46,122 INFO L273 TraceCheckUtils]: 81: Hoare triple {19380#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19380#false} is VALID [2018-11-23 12:17:46,122 INFO L273 TraceCheckUtils]: 82: Hoare triple {19380#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19380#false} is VALID [2018-11-23 12:17:46,122 INFO L273 TraceCheckUtils]: 83: Hoare triple {19380#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19380#false} is VALID [2018-11-23 12:17:46,122 INFO L273 TraceCheckUtils]: 84: Hoare triple {19380#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19380#false} is VALID [2018-11-23 12:17:46,122 INFO L273 TraceCheckUtils]: 85: Hoare triple {19380#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19380#false} is VALID [2018-11-23 12:17:46,122 INFO L273 TraceCheckUtils]: 86: Hoare triple {19380#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19380#false} is VALID [2018-11-23 12:17:46,122 INFO L273 TraceCheckUtils]: 87: Hoare triple {19380#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19380#false} is VALID [2018-11-23 12:17:46,122 INFO L273 TraceCheckUtils]: 88: Hoare triple {19380#false} assume !(~i~0 < 60); {19380#false} is VALID [2018-11-23 12:17:46,122 INFO L273 TraceCheckUtils]: 89: Hoare triple {19380#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {19380#false} is VALID [2018-11-23 12:17:46,123 INFO L273 TraceCheckUtils]: 90: Hoare triple {19380#false} assume true; {19380#false} is VALID [2018-11-23 12:17:46,123 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {19380#false} {19380#false} #75#return; {19380#false} is VALID [2018-11-23 12:17:46,123 INFO L273 TraceCheckUtils]: 92: Hoare triple {19380#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {19380#false} is VALID [2018-11-23 12:17:46,123 INFO L256 TraceCheckUtils]: 93: Hoare triple {19380#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {19380#false} is VALID [2018-11-23 12:17:46,123 INFO L273 TraceCheckUtils]: 94: Hoare triple {19380#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {19380#false} is VALID [2018-11-23 12:17:46,123 INFO L273 TraceCheckUtils]: 95: Hoare triple {19380#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19380#false} is VALID [2018-11-23 12:17:46,123 INFO L273 TraceCheckUtils]: 96: Hoare triple {19380#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19380#false} is VALID [2018-11-23 12:17:46,123 INFO L273 TraceCheckUtils]: 97: Hoare triple {19380#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19380#false} is VALID [2018-11-23 12:17:46,123 INFO L273 TraceCheckUtils]: 98: Hoare triple {19380#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19380#false} is VALID [2018-11-23 12:17:46,124 INFO L273 TraceCheckUtils]: 99: Hoare triple {19380#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19380#false} is VALID [2018-11-23 12:17:46,124 INFO L273 TraceCheckUtils]: 100: Hoare triple {19380#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19380#false} is VALID [2018-11-23 12:17:46,124 INFO L273 TraceCheckUtils]: 101: Hoare triple {19380#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19380#false} is VALID [2018-11-23 12:17:46,124 INFO L273 TraceCheckUtils]: 102: Hoare triple {19380#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19380#false} is VALID [2018-11-23 12:17:46,124 INFO L273 TraceCheckUtils]: 103: Hoare triple {19380#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19380#false} is VALID [2018-11-23 12:17:46,124 INFO L273 TraceCheckUtils]: 104: Hoare triple {19380#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19380#false} is VALID [2018-11-23 12:17:46,124 INFO L273 TraceCheckUtils]: 105: Hoare triple {19380#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19380#false} is VALID [2018-11-23 12:17:46,124 INFO L273 TraceCheckUtils]: 106: Hoare triple {19380#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19380#false} is VALID [2018-11-23 12:17:46,124 INFO L273 TraceCheckUtils]: 107: Hoare triple {19380#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19380#false} is VALID [2018-11-23 12:17:46,124 INFO L273 TraceCheckUtils]: 108: Hoare triple {19380#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19380#false} is VALID [2018-11-23 12:17:46,125 INFO L273 TraceCheckUtils]: 109: Hoare triple {19380#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19380#false} is VALID [2018-11-23 12:17:46,125 INFO L273 TraceCheckUtils]: 110: Hoare triple {19380#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19380#false} is VALID [2018-11-23 12:17:46,125 INFO L273 TraceCheckUtils]: 111: Hoare triple {19380#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19380#false} is VALID [2018-11-23 12:17:46,125 INFO L273 TraceCheckUtils]: 112: Hoare triple {19380#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19380#false} is VALID [2018-11-23 12:17:46,125 INFO L273 TraceCheckUtils]: 113: Hoare triple {19380#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19380#false} is VALID [2018-11-23 12:17:46,125 INFO L273 TraceCheckUtils]: 114: Hoare triple {19380#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19380#false} is VALID [2018-11-23 12:17:46,125 INFO L273 TraceCheckUtils]: 115: Hoare triple {19380#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19380#false} is VALID [2018-11-23 12:17:46,125 INFO L273 TraceCheckUtils]: 116: Hoare triple {19380#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19380#false} is VALID [2018-11-23 12:17:46,125 INFO L273 TraceCheckUtils]: 117: Hoare triple {19380#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19380#false} is VALID [2018-11-23 12:17:46,126 INFO L273 TraceCheckUtils]: 118: Hoare triple {19380#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19380#false} is VALID [2018-11-23 12:17:46,126 INFO L273 TraceCheckUtils]: 119: Hoare triple {19380#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19380#false} is VALID [2018-11-23 12:17:46,126 INFO L273 TraceCheckUtils]: 120: Hoare triple {19380#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19380#false} is VALID [2018-11-23 12:17:46,126 INFO L273 TraceCheckUtils]: 121: Hoare triple {19380#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19380#false} is VALID [2018-11-23 12:17:46,126 INFO L273 TraceCheckUtils]: 122: Hoare triple {19380#false} assume !(~i~0 < 60); {19380#false} is VALID [2018-11-23 12:17:46,126 INFO L273 TraceCheckUtils]: 123: Hoare triple {19380#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {19380#false} is VALID [2018-11-23 12:17:46,126 INFO L273 TraceCheckUtils]: 124: Hoare triple {19380#false} assume true; {19380#false} is VALID [2018-11-23 12:17:46,126 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {19380#false} {19380#false} #77#return; {19380#false} is VALID [2018-11-23 12:17:46,126 INFO L273 TraceCheckUtils]: 126: Hoare triple {19380#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {19380#false} is VALID [2018-11-23 12:17:46,126 INFO L273 TraceCheckUtils]: 127: Hoare triple {19380#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {19380#false} is VALID [2018-11-23 12:17:46,127 INFO L273 TraceCheckUtils]: 128: Hoare triple {19380#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {19380#false} is VALID [2018-11-23 12:17:46,127 INFO L273 TraceCheckUtils]: 129: Hoare triple {19380#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {19380#false} is VALID [2018-11-23 12:17:46,127 INFO L273 TraceCheckUtils]: 130: Hoare triple {19380#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {19380#false} is VALID [2018-11-23 12:17:46,127 INFO L273 TraceCheckUtils]: 131: Hoare triple {19380#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {19380#false} is VALID [2018-11-23 12:17:46,127 INFO L273 TraceCheckUtils]: 132: Hoare triple {19380#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {19380#false} is VALID [2018-11-23 12:17:46,127 INFO L273 TraceCheckUtils]: 133: Hoare triple {19380#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {19380#false} is VALID [2018-11-23 12:17:46,127 INFO L273 TraceCheckUtils]: 134: Hoare triple {19380#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {19380#false} is VALID [2018-11-23 12:17:46,127 INFO L273 TraceCheckUtils]: 135: Hoare triple {19380#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {19380#false} is VALID [2018-11-23 12:17:46,127 INFO L273 TraceCheckUtils]: 136: Hoare triple {19380#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {19380#false} is VALID [2018-11-23 12:17:46,127 INFO L273 TraceCheckUtils]: 137: Hoare triple {19380#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {19380#false} is VALID [2018-11-23 12:17:46,128 INFO L273 TraceCheckUtils]: 138: Hoare triple {19380#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {19380#false} is VALID [2018-11-23 12:17:46,128 INFO L273 TraceCheckUtils]: 139: Hoare triple {19380#false} assume !(~i~2 < 59); {19380#false} is VALID [2018-11-23 12:17:46,128 INFO L273 TraceCheckUtils]: 140: Hoare triple {19380#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {19380#false} is VALID [2018-11-23 12:17:46,128 INFO L256 TraceCheckUtils]: 141: Hoare triple {19380#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {19380#false} is VALID [2018-11-23 12:17:46,128 INFO L273 TraceCheckUtils]: 142: Hoare triple {19380#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {19380#false} is VALID [2018-11-23 12:17:46,128 INFO L273 TraceCheckUtils]: 143: Hoare triple {19380#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19380#false} is VALID [2018-11-23 12:17:46,128 INFO L273 TraceCheckUtils]: 144: Hoare triple {19380#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19380#false} is VALID [2018-11-23 12:17:46,128 INFO L273 TraceCheckUtils]: 145: Hoare triple {19380#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19380#false} is VALID [2018-11-23 12:17:46,128 INFO L273 TraceCheckUtils]: 146: Hoare triple {19380#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19380#false} is VALID [2018-11-23 12:17:46,129 INFO L273 TraceCheckUtils]: 147: Hoare triple {19380#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19380#false} is VALID [2018-11-23 12:17:46,129 INFO L273 TraceCheckUtils]: 148: Hoare triple {19380#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19380#false} is VALID [2018-11-23 12:17:46,129 INFO L273 TraceCheckUtils]: 149: Hoare triple {19380#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19380#false} is VALID [2018-11-23 12:17:46,129 INFO L273 TraceCheckUtils]: 150: Hoare triple {19380#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19380#false} is VALID [2018-11-23 12:17:46,129 INFO L273 TraceCheckUtils]: 151: Hoare triple {19380#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19380#false} is VALID [2018-11-23 12:17:46,129 INFO L273 TraceCheckUtils]: 152: Hoare triple {19380#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19380#false} is VALID [2018-11-23 12:17:46,129 INFO L273 TraceCheckUtils]: 153: Hoare triple {19380#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19380#false} is VALID [2018-11-23 12:17:46,129 INFO L273 TraceCheckUtils]: 154: Hoare triple {19380#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19380#false} is VALID [2018-11-23 12:17:46,129 INFO L273 TraceCheckUtils]: 155: Hoare triple {19380#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19380#false} is VALID [2018-11-23 12:17:46,129 INFO L273 TraceCheckUtils]: 156: Hoare triple {19380#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19380#false} is VALID [2018-11-23 12:17:46,130 INFO L273 TraceCheckUtils]: 157: Hoare triple {19380#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19380#false} is VALID [2018-11-23 12:17:46,130 INFO L273 TraceCheckUtils]: 158: Hoare triple {19380#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19380#false} is VALID [2018-11-23 12:17:46,130 INFO L273 TraceCheckUtils]: 159: Hoare triple {19380#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19380#false} is VALID [2018-11-23 12:17:46,130 INFO L273 TraceCheckUtils]: 160: Hoare triple {19380#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19380#false} is VALID [2018-11-23 12:17:46,130 INFO L273 TraceCheckUtils]: 161: Hoare triple {19380#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19380#false} is VALID [2018-11-23 12:17:46,130 INFO L273 TraceCheckUtils]: 162: Hoare triple {19380#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19380#false} is VALID [2018-11-23 12:17:46,130 INFO L273 TraceCheckUtils]: 163: Hoare triple {19380#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19380#false} is VALID [2018-11-23 12:17:46,130 INFO L273 TraceCheckUtils]: 164: Hoare triple {19380#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19380#false} is VALID [2018-11-23 12:17:46,130 INFO L273 TraceCheckUtils]: 165: Hoare triple {19380#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19380#false} is VALID [2018-11-23 12:17:46,130 INFO L273 TraceCheckUtils]: 166: Hoare triple {19380#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19380#false} is VALID [2018-11-23 12:17:46,131 INFO L273 TraceCheckUtils]: 167: Hoare triple {19380#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {19380#false} is VALID [2018-11-23 12:17:46,131 INFO L273 TraceCheckUtils]: 168: Hoare triple {19380#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {19380#false} is VALID [2018-11-23 12:17:46,131 INFO L273 TraceCheckUtils]: 169: Hoare triple {19380#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {19380#false} is VALID [2018-11-23 12:17:46,131 INFO L273 TraceCheckUtils]: 170: Hoare triple {19380#false} assume !(~i~0 < 60); {19380#false} is VALID [2018-11-23 12:17:46,131 INFO L273 TraceCheckUtils]: 171: Hoare triple {19380#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {19380#false} is VALID [2018-11-23 12:17:46,131 INFO L273 TraceCheckUtils]: 172: Hoare triple {19380#false} assume true; {19380#false} is VALID [2018-11-23 12:17:46,131 INFO L268 TraceCheckUtils]: 173: Hoare quadruple {19380#false} {19380#false} #79#return; {19380#false} is VALID [2018-11-23 12:17:46,131 INFO L273 TraceCheckUtils]: 174: Hoare triple {19380#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {19380#false} is VALID [2018-11-23 12:17:46,131 INFO L273 TraceCheckUtils]: 175: Hoare triple {19380#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {19380#false} is VALID [2018-11-23 12:17:46,132 INFO L273 TraceCheckUtils]: 176: Hoare triple {19380#false} assume !false; {19380#false} is VALID [2018-11-23 12:17:46,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1861 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 1185 trivial. 0 not checked. [2018-11-23 12:17:46,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:46,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 12:17:46,167 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 177 [2018-11-23 12:17:46,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:46,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:17:46,263 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-23 12:17:46,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:17:46,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:17:46,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:17:46,265 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand 30 states. [2018-11-23 12:17:46,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:46,834 INFO L93 Difference]: Finished difference Result 172 states and 198 transitions. [2018-11-23 12:17:46,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:17:46,834 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 177 [2018-11-23 12:17:46,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:46,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:17:46,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 110 transitions. [2018-11-23 12:17:46,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:17:46,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 110 transitions. [2018-11-23 12:17:46,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 110 transitions. [2018-11-23 12:17:46,940 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:46,942 INFO L225 Difference]: With dead ends: 172 [2018-11-23 12:17:46,942 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 12:17:46,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:17:46,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 12:17:46,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-11-23 12:17:46,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:46,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 116 states. [2018-11-23 12:17:46,982 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 116 states. [2018-11-23 12:17:46,983 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 116 states. [2018-11-23 12:17:46,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:46,984 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2018-11-23 12:17:46,985 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2018-11-23 12:17:46,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:46,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:46,985 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 117 states. [2018-11-23 12:17:46,985 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 117 states. [2018-11-23 12:17:46,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:46,987 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2018-11-23 12:17:46,987 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2018-11-23 12:17:46,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:46,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:46,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:46,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:46,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-23 12:17:46,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2018-11-23 12:17:46,990 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 177 [2018-11-23 12:17:46,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:46,990 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2018-11-23 12:17:46,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:17:46,990 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2018-11-23 12:17:46,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-23 12:17:46,991 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:46,991 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:17:46,991 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:46,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:46,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1444056149, now seen corresponding path program 27 times [2018-11-23 12:17:46,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:46,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:46,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:46,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:46,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:48,093 INFO L256 TraceCheckUtils]: 0: Hoare triple {20588#true} call ULTIMATE.init(); {20588#true} is VALID [2018-11-23 12:17:48,093 INFO L273 TraceCheckUtils]: 1: Hoare triple {20588#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20588#true} is VALID [2018-11-23 12:17:48,093 INFO L273 TraceCheckUtils]: 2: Hoare triple {20588#true} assume true; {20588#true} is VALID [2018-11-23 12:17:48,093 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20588#true} {20588#true} #71#return; {20588#true} is VALID [2018-11-23 12:17:48,094 INFO L256 TraceCheckUtils]: 4: Hoare triple {20588#true} call #t~ret14 := main(); {20588#true} is VALID [2018-11-23 12:17:48,094 INFO L273 TraceCheckUtils]: 5: Hoare triple {20588#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {20590#(= main_~i~1 0)} is VALID [2018-11-23 12:17:48,095 INFO L273 TraceCheckUtils]: 6: Hoare triple {20590#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20590#(= main_~i~1 0)} is VALID [2018-11-23 12:17:48,095 INFO L273 TraceCheckUtils]: 7: Hoare triple {20590#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20591#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:48,096 INFO L273 TraceCheckUtils]: 8: Hoare triple {20591#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20591#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:48,096 INFO L273 TraceCheckUtils]: 9: Hoare triple {20591#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20592#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:48,097 INFO L273 TraceCheckUtils]: 10: Hoare triple {20592#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20592#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:48,097 INFO L273 TraceCheckUtils]: 11: Hoare triple {20592#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20593#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:48,097 INFO L273 TraceCheckUtils]: 12: Hoare triple {20593#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20593#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:48,098 INFO L273 TraceCheckUtils]: 13: Hoare triple {20593#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20594#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:48,098 INFO L273 TraceCheckUtils]: 14: Hoare triple {20594#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20594#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:48,099 INFO L273 TraceCheckUtils]: 15: Hoare triple {20594#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20595#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:48,099 INFO L273 TraceCheckUtils]: 16: Hoare triple {20595#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20595#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:48,099 INFO L273 TraceCheckUtils]: 17: Hoare triple {20595#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20596#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:48,100 INFO L273 TraceCheckUtils]: 18: Hoare triple {20596#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20596#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:48,101 INFO L273 TraceCheckUtils]: 19: Hoare triple {20596#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20597#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:48,101 INFO L273 TraceCheckUtils]: 20: Hoare triple {20597#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20597#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:48,102 INFO L273 TraceCheckUtils]: 21: Hoare triple {20597#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20598#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:48,102 INFO L273 TraceCheckUtils]: 22: Hoare triple {20598#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20598#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:48,103 INFO L273 TraceCheckUtils]: 23: Hoare triple {20598#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20599#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:48,104 INFO L273 TraceCheckUtils]: 24: Hoare triple {20599#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20599#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:48,104 INFO L273 TraceCheckUtils]: 25: Hoare triple {20599#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20600#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:48,105 INFO L273 TraceCheckUtils]: 26: Hoare triple {20600#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20600#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:48,106 INFO L273 TraceCheckUtils]: 27: Hoare triple {20600#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20601#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:48,106 INFO L273 TraceCheckUtils]: 28: Hoare triple {20601#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20601#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:48,107 INFO L273 TraceCheckUtils]: 29: Hoare triple {20601#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20602#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:48,107 INFO L273 TraceCheckUtils]: 30: Hoare triple {20602#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20602#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:48,108 INFO L273 TraceCheckUtils]: 31: Hoare triple {20602#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20603#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:48,109 INFO L273 TraceCheckUtils]: 32: Hoare triple {20603#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20603#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:48,109 INFO L273 TraceCheckUtils]: 33: Hoare triple {20603#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20604#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:48,110 INFO L273 TraceCheckUtils]: 34: Hoare triple {20604#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20604#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:48,111 INFO L273 TraceCheckUtils]: 35: Hoare triple {20604#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20605#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:48,111 INFO L273 TraceCheckUtils]: 36: Hoare triple {20605#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20605#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:48,112 INFO L273 TraceCheckUtils]: 37: Hoare triple {20605#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20606#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:48,112 INFO L273 TraceCheckUtils]: 38: Hoare triple {20606#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20606#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:48,113 INFO L273 TraceCheckUtils]: 39: Hoare triple {20606#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20607#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:48,114 INFO L273 TraceCheckUtils]: 40: Hoare triple {20607#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20607#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:48,114 INFO L273 TraceCheckUtils]: 41: Hoare triple {20607#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20608#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:48,115 INFO L273 TraceCheckUtils]: 42: Hoare triple {20608#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20608#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:48,116 INFO L273 TraceCheckUtils]: 43: Hoare triple {20608#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20609#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:48,116 INFO L273 TraceCheckUtils]: 44: Hoare triple {20609#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20609#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:48,117 INFO L273 TraceCheckUtils]: 45: Hoare triple {20609#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20610#(<= main_~i~1 20)} is VALID [2018-11-23 12:17:48,117 INFO L273 TraceCheckUtils]: 46: Hoare triple {20610#(<= main_~i~1 20)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20610#(<= main_~i~1 20)} is VALID [2018-11-23 12:17:48,118 INFO L273 TraceCheckUtils]: 47: Hoare triple {20610#(<= main_~i~1 20)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20611#(<= main_~i~1 21)} is VALID [2018-11-23 12:17:48,119 INFO L273 TraceCheckUtils]: 48: Hoare triple {20611#(<= main_~i~1 21)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20611#(<= main_~i~1 21)} is VALID [2018-11-23 12:17:48,119 INFO L273 TraceCheckUtils]: 49: Hoare triple {20611#(<= main_~i~1 21)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20612#(<= main_~i~1 22)} is VALID [2018-11-23 12:17:48,120 INFO L273 TraceCheckUtils]: 50: Hoare triple {20612#(<= main_~i~1 22)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20612#(<= main_~i~1 22)} is VALID [2018-11-23 12:17:48,121 INFO L273 TraceCheckUtils]: 51: Hoare triple {20612#(<= main_~i~1 22)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20613#(<= main_~i~1 23)} is VALID [2018-11-23 12:17:48,121 INFO L273 TraceCheckUtils]: 52: Hoare triple {20613#(<= main_~i~1 23)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20613#(<= main_~i~1 23)} is VALID [2018-11-23 12:17:48,122 INFO L273 TraceCheckUtils]: 53: Hoare triple {20613#(<= main_~i~1 23)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20614#(<= main_~i~1 24)} is VALID [2018-11-23 12:17:48,122 INFO L273 TraceCheckUtils]: 54: Hoare triple {20614#(<= main_~i~1 24)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20614#(<= main_~i~1 24)} is VALID [2018-11-23 12:17:48,123 INFO L273 TraceCheckUtils]: 55: Hoare triple {20614#(<= main_~i~1 24)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20615#(<= main_~i~1 25)} is VALID [2018-11-23 12:17:48,123 INFO L273 TraceCheckUtils]: 56: Hoare triple {20615#(<= main_~i~1 25)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20615#(<= main_~i~1 25)} is VALID [2018-11-23 12:17:48,124 INFO L273 TraceCheckUtils]: 57: Hoare triple {20615#(<= main_~i~1 25)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20616#(<= main_~i~1 26)} is VALID [2018-11-23 12:17:48,125 INFO L273 TraceCheckUtils]: 58: Hoare triple {20616#(<= main_~i~1 26)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20616#(<= main_~i~1 26)} is VALID [2018-11-23 12:17:48,125 INFO L273 TraceCheckUtils]: 59: Hoare triple {20616#(<= main_~i~1 26)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20617#(<= main_~i~1 27)} is VALID [2018-11-23 12:17:48,126 INFO L273 TraceCheckUtils]: 60: Hoare triple {20617#(<= main_~i~1 27)} assume !(~i~1 < 60); {20589#false} is VALID [2018-11-23 12:17:48,126 INFO L256 TraceCheckUtils]: 61: Hoare triple {20589#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {20588#true} is VALID [2018-11-23 12:17:48,127 INFO L273 TraceCheckUtils]: 62: Hoare triple {20588#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {20588#true} is VALID [2018-11-23 12:17:48,127 INFO L273 TraceCheckUtils]: 63: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,127 INFO L273 TraceCheckUtils]: 64: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,127 INFO L273 TraceCheckUtils]: 65: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,127 INFO L273 TraceCheckUtils]: 66: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,127 INFO L273 TraceCheckUtils]: 67: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,128 INFO L273 TraceCheckUtils]: 68: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,128 INFO L273 TraceCheckUtils]: 69: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,128 INFO L273 TraceCheckUtils]: 70: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,128 INFO L273 TraceCheckUtils]: 71: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,128 INFO L273 TraceCheckUtils]: 72: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,128 INFO L273 TraceCheckUtils]: 73: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,129 INFO L273 TraceCheckUtils]: 74: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,129 INFO L273 TraceCheckUtils]: 75: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,129 INFO L273 TraceCheckUtils]: 76: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,129 INFO L273 TraceCheckUtils]: 77: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,129 INFO L273 TraceCheckUtils]: 78: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,129 INFO L273 TraceCheckUtils]: 79: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,129 INFO L273 TraceCheckUtils]: 80: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,129 INFO L273 TraceCheckUtils]: 81: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,129 INFO L273 TraceCheckUtils]: 82: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,129 INFO L273 TraceCheckUtils]: 83: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,130 INFO L273 TraceCheckUtils]: 84: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,130 INFO L273 TraceCheckUtils]: 85: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,130 INFO L273 TraceCheckUtils]: 86: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,130 INFO L273 TraceCheckUtils]: 87: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,130 INFO L273 TraceCheckUtils]: 88: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,130 INFO L273 TraceCheckUtils]: 89: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,130 INFO L273 TraceCheckUtils]: 90: Hoare triple {20588#true} assume !(~i~0 < 60); {20588#true} is VALID [2018-11-23 12:17:48,130 INFO L273 TraceCheckUtils]: 91: Hoare triple {20588#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {20588#true} is VALID [2018-11-23 12:17:48,130 INFO L273 TraceCheckUtils]: 92: Hoare triple {20588#true} assume true; {20588#true} is VALID [2018-11-23 12:17:48,130 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {20588#true} {20589#false} #75#return; {20589#false} is VALID [2018-11-23 12:17:48,131 INFO L273 TraceCheckUtils]: 94: Hoare triple {20589#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {20589#false} is VALID [2018-11-23 12:17:48,131 INFO L256 TraceCheckUtils]: 95: Hoare triple {20589#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {20588#true} is VALID [2018-11-23 12:17:48,131 INFO L273 TraceCheckUtils]: 96: Hoare triple {20588#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {20588#true} is VALID [2018-11-23 12:17:48,131 INFO L273 TraceCheckUtils]: 97: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,131 INFO L273 TraceCheckUtils]: 98: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,131 INFO L273 TraceCheckUtils]: 99: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,131 INFO L273 TraceCheckUtils]: 100: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,131 INFO L273 TraceCheckUtils]: 101: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,131 INFO L273 TraceCheckUtils]: 102: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,132 INFO L273 TraceCheckUtils]: 103: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,132 INFO L273 TraceCheckUtils]: 104: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,132 INFO L273 TraceCheckUtils]: 105: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,132 INFO L273 TraceCheckUtils]: 106: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,132 INFO L273 TraceCheckUtils]: 107: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,132 INFO L273 TraceCheckUtils]: 108: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,132 INFO L273 TraceCheckUtils]: 109: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,132 INFO L273 TraceCheckUtils]: 110: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,132 INFO L273 TraceCheckUtils]: 111: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,132 INFO L273 TraceCheckUtils]: 112: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,133 INFO L273 TraceCheckUtils]: 113: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,133 INFO L273 TraceCheckUtils]: 114: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,133 INFO L273 TraceCheckUtils]: 115: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,133 INFO L273 TraceCheckUtils]: 116: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,133 INFO L273 TraceCheckUtils]: 117: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,133 INFO L273 TraceCheckUtils]: 118: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,134 INFO L273 TraceCheckUtils]: 119: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,134 INFO L273 TraceCheckUtils]: 120: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,134 INFO L273 TraceCheckUtils]: 121: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,134 INFO L273 TraceCheckUtils]: 122: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,134 INFO L273 TraceCheckUtils]: 123: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,134 INFO L273 TraceCheckUtils]: 124: Hoare triple {20588#true} assume !(~i~0 < 60); {20588#true} is VALID [2018-11-23 12:17:48,135 INFO L273 TraceCheckUtils]: 125: Hoare triple {20588#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {20588#true} is VALID [2018-11-23 12:17:48,135 INFO L273 TraceCheckUtils]: 126: Hoare triple {20588#true} assume true; {20588#true} is VALID [2018-11-23 12:17:48,135 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {20588#true} {20589#false} #77#return; {20589#false} is VALID [2018-11-23 12:17:48,135 INFO L273 TraceCheckUtils]: 128: Hoare triple {20589#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {20589#false} is VALID [2018-11-23 12:17:48,135 INFO L273 TraceCheckUtils]: 129: Hoare triple {20589#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {20589#false} is VALID [2018-11-23 12:17:48,135 INFO L273 TraceCheckUtils]: 130: Hoare triple {20589#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {20589#false} is VALID [2018-11-23 12:17:48,135 INFO L273 TraceCheckUtils]: 131: Hoare triple {20589#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {20589#false} is VALID [2018-11-23 12:17:48,136 INFO L273 TraceCheckUtils]: 132: Hoare triple {20589#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {20589#false} is VALID [2018-11-23 12:17:48,136 INFO L273 TraceCheckUtils]: 133: Hoare triple {20589#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {20589#false} is VALID [2018-11-23 12:17:48,136 INFO L273 TraceCheckUtils]: 134: Hoare triple {20589#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {20589#false} is VALID [2018-11-23 12:17:48,136 INFO L273 TraceCheckUtils]: 135: Hoare triple {20589#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {20589#false} is VALID [2018-11-23 12:17:48,136 INFO L273 TraceCheckUtils]: 136: Hoare triple {20589#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {20589#false} is VALID [2018-11-23 12:17:48,136 INFO L273 TraceCheckUtils]: 137: Hoare triple {20589#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {20589#false} is VALID [2018-11-23 12:17:48,136 INFO L273 TraceCheckUtils]: 138: Hoare triple {20589#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {20589#false} is VALID [2018-11-23 12:17:48,136 INFO L273 TraceCheckUtils]: 139: Hoare triple {20589#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {20589#false} is VALID [2018-11-23 12:17:48,136 INFO L273 TraceCheckUtils]: 140: Hoare triple {20589#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {20589#false} is VALID [2018-11-23 12:17:48,136 INFO L273 TraceCheckUtils]: 141: Hoare triple {20589#false} assume !(~i~2 < 59); {20589#false} is VALID [2018-11-23 12:17:48,137 INFO L273 TraceCheckUtils]: 142: Hoare triple {20589#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {20589#false} is VALID [2018-11-23 12:17:48,137 INFO L256 TraceCheckUtils]: 143: Hoare triple {20589#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {20588#true} is VALID [2018-11-23 12:17:48,137 INFO L273 TraceCheckUtils]: 144: Hoare triple {20588#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {20588#true} is VALID [2018-11-23 12:17:48,137 INFO L273 TraceCheckUtils]: 145: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,137 INFO L273 TraceCheckUtils]: 146: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,137 INFO L273 TraceCheckUtils]: 147: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,137 INFO L273 TraceCheckUtils]: 148: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,137 INFO L273 TraceCheckUtils]: 149: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,137 INFO L273 TraceCheckUtils]: 150: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,137 INFO L273 TraceCheckUtils]: 151: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,138 INFO L273 TraceCheckUtils]: 152: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,138 INFO L273 TraceCheckUtils]: 153: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,138 INFO L273 TraceCheckUtils]: 154: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,138 INFO L273 TraceCheckUtils]: 155: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,138 INFO L273 TraceCheckUtils]: 156: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,138 INFO L273 TraceCheckUtils]: 157: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,138 INFO L273 TraceCheckUtils]: 158: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,138 INFO L273 TraceCheckUtils]: 159: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,138 INFO L273 TraceCheckUtils]: 160: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,138 INFO L273 TraceCheckUtils]: 161: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,139 INFO L273 TraceCheckUtils]: 162: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,139 INFO L273 TraceCheckUtils]: 163: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,139 INFO L273 TraceCheckUtils]: 164: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,139 INFO L273 TraceCheckUtils]: 165: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,139 INFO L273 TraceCheckUtils]: 166: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,139 INFO L273 TraceCheckUtils]: 167: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,139 INFO L273 TraceCheckUtils]: 168: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,139 INFO L273 TraceCheckUtils]: 169: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,139 INFO L273 TraceCheckUtils]: 170: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,139 INFO L273 TraceCheckUtils]: 171: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,140 INFO L273 TraceCheckUtils]: 172: Hoare triple {20588#true} assume !(~i~0 < 60); {20588#true} is VALID [2018-11-23 12:17:48,140 INFO L273 TraceCheckUtils]: 173: Hoare triple {20588#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {20588#true} is VALID [2018-11-23 12:17:48,140 INFO L273 TraceCheckUtils]: 174: Hoare triple {20588#true} assume true; {20588#true} is VALID [2018-11-23 12:17:48,140 INFO L268 TraceCheckUtils]: 175: Hoare quadruple {20588#true} {20589#false} #79#return; {20589#false} is VALID [2018-11-23 12:17:48,140 INFO L273 TraceCheckUtils]: 176: Hoare triple {20589#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {20589#false} is VALID [2018-11-23 12:17:48,140 INFO L273 TraceCheckUtils]: 177: Hoare triple {20589#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {20589#false} is VALID [2018-11-23 12:17:48,140 INFO L273 TraceCheckUtils]: 178: Hoare triple {20589#false} assume !false; {20589#false} is VALID [2018-11-23 12:17:48,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1914 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 1185 trivial. 0 not checked. [2018-11-23 12:17:48,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:48,154 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:17:48,163 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:17:48,316 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-23 12:17:48,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:48,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:48,609 INFO L256 TraceCheckUtils]: 0: Hoare triple {20588#true} call ULTIMATE.init(); {20588#true} is VALID [2018-11-23 12:17:48,610 INFO L273 TraceCheckUtils]: 1: Hoare triple {20588#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20588#true} is VALID [2018-11-23 12:17:48,610 INFO L273 TraceCheckUtils]: 2: Hoare triple {20588#true} assume true; {20588#true} is VALID [2018-11-23 12:17:48,610 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20588#true} {20588#true} #71#return; {20588#true} is VALID [2018-11-23 12:17:48,610 INFO L256 TraceCheckUtils]: 4: Hoare triple {20588#true} call #t~ret14 := main(); {20588#true} is VALID [2018-11-23 12:17:48,610 INFO L273 TraceCheckUtils]: 5: Hoare triple {20588#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {20588#true} is VALID [2018-11-23 12:17:48,610 INFO L273 TraceCheckUtils]: 6: Hoare triple {20588#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20588#true} is VALID [2018-11-23 12:17:48,611 INFO L273 TraceCheckUtils]: 7: Hoare triple {20588#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20588#true} is VALID [2018-11-23 12:17:48,611 INFO L273 TraceCheckUtils]: 8: Hoare triple {20588#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20588#true} is VALID [2018-11-23 12:17:48,611 INFO L273 TraceCheckUtils]: 9: Hoare triple {20588#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20588#true} is VALID [2018-11-23 12:17:48,611 INFO L273 TraceCheckUtils]: 10: Hoare triple {20588#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20588#true} is VALID [2018-11-23 12:17:48,611 INFO L273 TraceCheckUtils]: 11: Hoare triple {20588#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20588#true} is VALID [2018-11-23 12:17:48,612 INFO L273 TraceCheckUtils]: 12: Hoare triple {20588#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20588#true} is VALID [2018-11-23 12:17:48,612 INFO L273 TraceCheckUtils]: 13: Hoare triple {20588#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20588#true} is VALID [2018-11-23 12:17:48,612 INFO L273 TraceCheckUtils]: 14: Hoare triple {20588#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20588#true} is VALID [2018-11-23 12:17:48,612 INFO L273 TraceCheckUtils]: 15: Hoare triple {20588#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20588#true} is VALID [2018-11-23 12:17:48,612 INFO L273 TraceCheckUtils]: 16: Hoare triple {20588#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20588#true} is VALID [2018-11-23 12:17:48,612 INFO L273 TraceCheckUtils]: 17: Hoare triple {20588#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20588#true} is VALID [2018-11-23 12:17:48,612 INFO L273 TraceCheckUtils]: 18: Hoare triple {20588#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20588#true} is VALID [2018-11-23 12:17:48,613 INFO L273 TraceCheckUtils]: 19: Hoare triple {20588#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20588#true} is VALID [2018-11-23 12:17:48,613 INFO L273 TraceCheckUtils]: 20: Hoare triple {20588#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20588#true} is VALID [2018-11-23 12:17:48,613 INFO L273 TraceCheckUtils]: 21: Hoare triple {20588#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20588#true} is VALID [2018-11-23 12:17:48,613 INFO L273 TraceCheckUtils]: 22: Hoare triple {20588#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20588#true} is VALID [2018-11-23 12:17:48,613 INFO L273 TraceCheckUtils]: 23: Hoare triple {20588#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20588#true} is VALID [2018-11-23 12:17:48,613 INFO L273 TraceCheckUtils]: 24: Hoare triple {20588#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20588#true} is VALID [2018-11-23 12:17:48,613 INFO L273 TraceCheckUtils]: 25: Hoare triple {20588#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20588#true} is VALID [2018-11-23 12:17:48,613 INFO L273 TraceCheckUtils]: 26: Hoare triple {20588#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20588#true} is VALID [2018-11-23 12:17:48,613 INFO L273 TraceCheckUtils]: 27: Hoare triple {20588#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20588#true} is VALID [2018-11-23 12:17:48,613 INFO L273 TraceCheckUtils]: 28: Hoare triple {20588#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20588#true} is VALID [2018-11-23 12:17:48,614 INFO L273 TraceCheckUtils]: 29: Hoare triple {20588#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20588#true} is VALID [2018-11-23 12:17:48,614 INFO L273 TraceCheckUtils]: 30: Hoare triple {20588#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20588#true} is VALID [2018-11-23 12:17:48,614 INFO L273 TraceCheckUtils]: 31: Hoare triple {20588#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20588#true} is VALID [2018-11-23 12:17:48,614 INFO L273 TraceCheckUtils]: 32: Hoare triple {20588#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20588#true} is VALID [2018-11-23 12:17:48,614 INFO L273 TraceCheckUtils]: 33: Hoare triple {20588#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20588#true} is VALID [2018-11-23 12:17:48,614 INFO L273 TraceCheckUtils]: 34: Hoare triple {20588#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20588#true} is VALID [2018-11-23 12:17:48,614 INFO L273 TraceCheckUtils]: 35: Hoare triple {20588#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20588#true} is VALID [2018-11-23 12:17:48,614 INFO L273 TraceCheckUtils]: 36: Hoare triple {20588#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20588#true} is VALID [2018-11-23 12:17:48,614 INFO L273 TraceCheckUtils]: 37: Hoare triple {20588#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20588#true} is VALID [2018-11-23 12:17:48,614 INFO L273 TraceCheckUtils]: 38: Hoare triple {20588#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20588#true} is VALID [2018-11-23 12:17:48,615 INFO L273 TraceCheckUtils]: 39: Hoare triple {20588#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20588#true} is VALID [2018-11-23 12:17:48,615 INFO L273 TraceCheckUtils]: 40: Hoare triple {20588#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20588#true} is VALID [2018-11-23 12:17:48,615 INFO L273 TraceCheckUtils]: 41: Hoare triple {20588#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20588#true} is VALID [2018-11-23 12:17:48,615 INFO L273 TraceCheckUtils]: 42: Hoare triple {20588#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20588#true} is VALID [2018-11-23 12:17:48,615 INFO L273 TraceCheckUtils]: 43: Hoare triple {20588#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20588#true} is VALID [2018-11-23 12:17:48,615 INFO L273 TraceCheckUtils]: 44: Hoare triple {20588#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20588#true} is VALID [2018-11-23 12:17:48,615 INFO L273 TraceCheckUtils]: 45: Hoare triple {20588#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20588#true} is VALID [2018-11-23 12:17:48,615 INFO L273 TraceCheckUtils]: 46: Hoare triple {20588#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20588#true} is VALID [2018-11-23 12:17:48,615 INFO L273 TraceCheckUtils]: 47: Hoare triple {20588#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20588#true} is VALID [2018-11-23 12:17:48,616 INFO L273 TraceCheckUtils]: 48: Hoare triple {20588#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20588#true} is VALID [2018-11-23 12:17:48,616 INFO L273 TraceCheckUtils]: 49: Hoare triple {20588#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20588#true} is VALID [2018-11-23 12:17:48,616 INFO L273 TraceCheckUtils]: 50: Hoare triple {20588#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20588#true} is VALID [2018-11-23 12:17:48,616 INFO L273 TraceCheckUtils]: 51: Hoare triple {20588#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20588#true} is VALID [2018-11-23 12:17:48,616 INFO L273 TraceCheckUtils]: 52: Hoare triple {20588#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20588#true} is VALID [2018-11-23 12:17:48,616 INFO L273 TraceCheckUtils]: 53: Hoare triple {20588#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20588#true} is VALID [2018-11-23 12:17:48,616 INFO L273 TraceCheckUtils]: 54: Hoare triple {20588#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20588#true} is VALID [2018-11-23 12:17:48,616 INFO L273 TraceCheckUtils]: 55: Hoare triple {20588#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20588#true} is VALID [2018-11-23 12:17:48,616 INFO L273 TraceCheckUtils]: 56: Hoare triple {20588#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20588#true} is VALID [2018-11-23 12:17:48,616 INFO L273 TraceCheckUtils]: 57: Hoare triple {20588#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20588#true} is VALID [2018-11-23 12:17:48,617 INFO L273 TraceCheckUtils]: 58: Hoare triple {20588#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {20588#true} is VALID [2018-11-23 12:17:48,617 INFO L273 TraceCheckUtils]: 59: Hoare triple {20588#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {20588#true} is VALID [2018-11-23 12:17:48,617 INFO L273 TraceCheckUtils]: 60: Hoare triple {20588#true} assume !(~i~1 < 60); {20588#true} is VALID [2018-11-23 12:17:48,617 INFO L256 TraceCheckUtils]: 61: Hoare triple {20588#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {20588#true} is VALID [2018-11-23 12:17:48,617 INFO L273 TraceCheckUtils]: 62: Hoare triple {20588#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {20588#true} is VALID [2018-11-23 12:17:48,617 INFO L273 TraceCheckUtils]: 63: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,617 INFO L273 TraceCheckUtils]: 64: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,617 INFO L273 TraceCheckUtils]: 65: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,617 INFO L273 TraceCheckUtils]: 66: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,617 INFO L273 TraceCheckUtils]: 67: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,618 INFO L273 TraceCheckUtils]: 68: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,618 INFO L273 TraceCheckUtils]: 69: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,618 INFO L273 TraceCheckUtils]: 70: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,618 INFO L273 TraceCheckUtils]: 71: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,618 INFO L273 TraceCheckUtils]: 72: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,618 INFO L273 TraceCheckUtils]: 73: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,618 INFO L273 TraceCheckUtils]: 74: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,618 INFO L273 TraceCheckUtils]: 75: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,618 INFO L273 TraceCheckUtils]: 76: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,619 INFO L273 TraceCheckUtils]: 77: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,619 INFO L273 TraceCheckUtils]: 78: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,619 INFO L273 TraceCheckUtils]: 79: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,619 INFO L273 TraceCheckUtils]: 80: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,619 INFO L273 TraceCheckUtils]: 81: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,619 INFO L273 TraceCheckUtils]: 82: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,619 INFO L273 TraceCheckUtils]: 83: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,619 INFO L273 TraceCheckUtils]: 84: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,619 INFO L273 TraceCheckUtils]: 85: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,619 INFO L273 TraceCheckUtils]: 86: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,620 INFO L273 TraceCheckUtils]: 87: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,620 INFO L273 TraceCheckUtils]: 88: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,620 INFO L273 TraceCheckUtils]: 89: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,620 INFO L273 TraceCheckUtils]: 90: Hoare triple {20588#true} assume !(~i~0 < 60); {20588#true} is VALID [2018-11-23 12:17:48,620 INFO L273 TraceCheckUtils]: 91: Hoare triple {20588#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {20588#true} is VALID [2018-11-23 12:17:48,620 INFO L273 TraceCheckUtils]: 92: Hoare triple {20588#true} assume true; {20588#true} is VALID [2018-11-23 12:17:48,620 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {20588#true} {20588#true} #75#return; {20588#true} is VALID [2018-11-23 12:17:48,620 INFO L273 TraceCheckUtils]: 94: Hoare triple {20588#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {20588#true} is VALID [2018-11-23 12:17:48,620 INFO L256 TraceCheckUtils]: 95: Hoare triple {20588#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {20588#true} is VALID [2018-11-23 12:17:48,620 INFO L273 TraceCheckUtils]: 96: Hoare triple {20588#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {20588#true} is VALID [2018-11-23 12:17:48,621 INFO L273 TraceCheckUtils]: 97: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,621 INFO L273 TraceCheckUtils]: 98: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,621 INFO L273 TraceCheckUtils]: 99: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,621 INFO L273 TraceCheckUtils]: 100: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,621 INFO L273 TraceCheckUtils]: 101: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,621 INFO L273 TraceCheckUtils]: 102: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,621 INFO L273 TraceCheckUtils]: 103: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,621 INFO L273 TraceCheckUtils]: 104: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,621 INFO L273 TraceCheckUtils]: 105: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,622 INFO L273 TraceCheckUtils]: 106: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,622 INFO L273 TraceCheckUtils]: 107: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,622 INFO L273 TraceCheckUtils]: 108: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,622 INFO L273 TraceCheckUtils]: 109: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,622 INFO L273 TraceCheckUtils]: 110: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,622 INFO L273 TraceCheckUtils]: 111: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,622 INFO L273 TraceCheckUtils]: 112: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,622 INFO L273 TraceCheckUtils]: 113: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,622 INFO L273 TraceCheckUtils]: 114: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,622 INFO L273 TraceCheckUtils]: 115: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,623 INFO L273 TraceCheckUtils]: 116: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,623 INFO L273 TraceCheckUtils]: 117: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,623 INFO L273 TraceCheckUtils]: 118: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,623 INFO L273 TraceCheckUtils]: 119: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,623 INFO L273 TraceCheckUtils]: 120: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,623 INFO L273 TraceCheckUtils]: 121: Hoare triple {20588#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20588#true} is VALID [2018-11-23 12:17:48,623 INFO L273 TraceCheckUtils]: 122: Hoare triple {20588#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20588#true} is VALID [2018-11-23 12:17:48,623 INFO L273 TraceCheckUtils]: 123: Hoare triple {20588#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20588#true} is VALID [2018-11-23 12:17:48,623 INFO L273 TraceCheckUtils]: 124: Hoare triple {20588#true} assume !(~i~0 < 60); {20588#true} is VALID [2018-11-23 12:17:48,623 INFO L273 TraceCheckUtils]: 125: Hoare triple {20588#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {20588#true} is VALID [2018-11-23 12:17:48,624 INFO L273 TraceCheckUtils]: 126: Hoare triple {20588#true} assume true; {20588#true} is VALID [2018-11-23 12:17:48,624 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {20588#true} {20588#true} #77#return; {20588#true} is VALID [2018-11-23 12:17:48,624 INFO L273 TraceCheckUtils]: 128: Hoare triple {20588#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {21005#(<= main_~i~2 0)} is VALID [2018-11-23 12:17:48,625 INFO L273 TraceCheckUtils]: 129: Hoare triple {21005#(<= main_~i~2 0)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {21005#(<= main_~i~2 0)} is VALID [2018-11-23 12:17:48,625 INFO L273 TraceCheckUtils]: 130: Hoare triple {21005#(<= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {21012#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:48,625 INFO L273 TraceCheckUtils]: 131: Hoare triple {21012#(<= main_~i~2 1)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {21012#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:48,626 INFO L273 TraceCheckUtils]: 132: Hoare triple {21012#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {21019#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:48,626 INFO L273 TraceCheckUtils]: 133: Hoare triple {21019#(<= main_~i~2 2)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {21019#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:48,627 INFO L273 TraceCheckUtils]: 134: Hoare triple {21019#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {21026#(<= main_~i~2 3)} is VALID [2018-11-23 12:17:48,627 INFO L273 TraceCheckUtils]: 135: Hoare triple {21026#(<= main_~i~2 3)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {21026#(<= main_~i~2 3)} is VALID [2018-11-23 12:17:48,627 INFO L273 TraceCheckUtils]: 136: Hoare triple {21026#(<= main_~i~2 3)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {21033#(<= main_~i~2 4)} is VALID [2018-11-23 12:17:48,632 INFO L273 TraceCheckUtils]: 137: Hoare triple {21033#(<= main_~i~2 4)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {21033#(<= main_~i~2 4)} is VALID [2018-11-23 12:17:48,632 INFO L273 TraceCheckUtils]: 138: Hoare triple {21033#(<= main_~i~2 4)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {21040#(<= main_~i~2 5)} is VALID [2018-11-23 12:17:48,632 INFO L273 TraceCheckUtils]: 139: Hoare triple {21040#(<= main_~i~2 5)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {21040#(<= main_~i~2 5)} is VALID [2018-11-23 12:17:48,633 INFO L273 TraceCheckUtils]: 140: Hoare triple {21040#(<= main_~i~2 5)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {21047#(<= main_~i~2 6)} is VALID [2018-11-23 12:17:48,633 INFO L273 TraceCheckUtils]: 141: Hoare triple {21047#(<= main_~i~2 6)} assume !(~i~2 < 59); {20589#false} is VALID [2018-11-23 12:17:48,633 INFO L273 TraceCheckUtils]: 142: Hoare triple {20589#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {20589#false} is VALID [2018-11-23 12:17:48,633 INFO L256 TraceCheckUtils]: 143: Hoare triple {20589#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {20589#false} is VALID [2018-11-23 12:17:48,634 INFO L273 TraceCheckUtils]: 144: Hoare triple {20589#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {20589#false} is VALID [2018-11-23 12:17:48,634 INFO L273 TraceCheckUtils]: 145: Hoare triple {20589#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20589#false} is VALID [2018-11-23 12:17:48,634 INFO L273 TraceCheckUtils]: 146: Hoare triple {20589#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20589#false} is VALID [2018-11-23 12:17:48,634 INFO L273 TraceCheckUtils]: 147: Hoare triple {20589#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20589#false} is VALID [2018-11-23 12:17:48,634 INFO L273 TraceCheckUtils]: 148: Hoare triple {20589#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20589#false} is VALID [2018-11-23 12:17:48,634 INFO L273 TraceCheckUtils]: 149: Hoare triple {20589#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20589#false} is VALID [2018-11-23 12:17:48,634 INFO L273 TraceCheckUtils]: 150: Hoare triple {20589#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20589#false} is VALID [2018-11-23 12:17:48,634 INFO L273 TraceCheckUtils]: 151: Hoare triple {20589#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20589#false} is VALID [2018-11-23 12:17:48,634 INFO L273 TraceCheckUtils]: 152: Hoare triple {20589#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20589#false} is VALID [2018-11-23 12:17:48,635 INFO L273 TraceCheckUtils]: 153: Hoare triple {20589#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20589#false} is VALID [2018-11-23 12:17:48,635 INFO L273 TraceCheckUtils]: 154: Hoare triple {20589#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20589#false} is VALID [2018-11-23 12:17:48,635 INFO L273 TraceCheckUtils]: 155: Hoare triple {20589#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20589#false} is VALID [2018-11-23 12:17:48,635 INFO L273 TraceCheckUtils]: 156: Hoare triple {20589#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20589#false} is VALID [2018-11-23 12:17:48,635 INFO L273 TraceCheckUtils]: 157: Hoare triple {20589#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20589#false} is VALID [2018-11-23 12:17:48,635 INFO L273 TraceCheckUtils]: 158: Hoare triple {20589#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20589#false} is VALID [2018-11-23 12:17:48,635 INFO L273 TraceCheckUtils]: 159: Hoare triple {20589#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20589#false} is VALID [2018-11-23 12:17:48,635 INFO L273 TraceCheckUtils]: 160: Hoare triple {20589#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20589#false} is VALID [2018-11-23 12:17:48,635 INFO L273 TraceCheckUtils]: 161: Hoare triple {20589#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20589#false} is VALID [2018-11-23 12:17:48,635 INFO L273 TraceCheckUtils]: 162: Hoare triple {20589#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20589#false} is VALID [2018-11-23 12:17:48,636 INFO L273 TraceCheckUtils]: 163: Hoare triple {20589#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20589#false} is VALID [2018-11-23 12:17:48,636 INFO L273 TraceCheckUtils]: 164: Hoare triple {20589#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20589#false} is VALID [2018-11-23 12:17:48,636 INFO L273 TraceCheckUtils]: 165: Hoare triple {20589#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20589#false} is VALID [2018-11-23 12:17:48,636 INFO L273 TraceCheckUtils]: 166: Hoare triple {20589#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20589#false} is VALID [2018-11-23 12:17:48,636 INFO L273 TraceCheckUtils]: 167: Hoare triple {20589#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20589#false} is VALID [2018-11-23 12:17:48,636 INFO L273 TraceCheckUtils]: 168: Hoare triple {20589#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20589#false} is VALID [2018-11-23 12:17:48,636 INFO L273 TraceCheckUtils]: 169: Hoare triple {20589#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {20589#false} is VALID [2018-11-23 12:17:48,636 INFO L273 TraceCheckUtils]: 170: Hoare triple {20589#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {20589#false} is VALID [2018-11-23 12:17:48,637 INFO L273 TraceCheckUtils]: 171: Hoare triple {20589#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {20589#false} is VALID [2018-11-23 12:17:48,637 INFO L273 TraceCheckUtils]: 172: Hoare triple {20589#false} assume !(~i~0 < 60); {20589#false} is VALID [2018-11-23 12:17:48,637 INFO L273 TraceCheckUtils]: 173: Hoare triple {20589#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {20589#false} is VALID [2018-11-23 12:17:48,637 INFO L273 TraceCheckUtils]: 174: Hoare triple {20589#false} assume true; {20589#false} is VALID [2018-11-23 12:17:48,637 INFO L268 TraceCheckUtils]: 175: Hoare quadruple {20589#false} {20589#false} #79#return; {20589#false} is VALID [2018-11-23 12:17:48,637 INFO L273 TraceCheckUtils]: 176: Hoare triple {20589#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {20589#false} is VALID [2018-11-23 12:17:48,637 INFO L273 TraceCheckUtils]: 177: Hoare triple {20589#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {20589#false} is VALID [2018-11-23 12:17:48,638 INFO L273 TraceCheckUtils]: 178: Hoare triple {20589#false} assume !false; {20589#false} is VALID [2018-11-23 12:17:48,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1914 backedges. 532 proven. 36 refuted. 0 times theorem prover too weak. 1346 trivial. 0 not checked. [2018-11-23 12:17:48,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:48,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 9] total 37 [2018-11-23 12:17:48,669 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 179 [2018-11-23 12:17:48,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:48,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 12:17:48,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:48,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 12:17:48,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 12:17:48,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=862, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:17:48,785 INFO L87 Difference]: Start difference. First operand 116 states and 129 transitions. Second operand 37 states. [2018-11-23 12:17:49,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:49,659 INFO L93 Difference]: Finished difference Result 177 states and 204 transitions. [2018-11-23 12:17:49,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 12:17:49,659 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 179 [2018-11-23 12:17:49,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:49,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:17:49,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 127 transitions. [2018-11-23 12:17:49,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:17:49,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 127 transitions. [2018-11-23 12:17:49,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 127 transitions. [2018-11-23 12:17:49,785 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:49,788 INFO L225 Difference]: With dead ends: 177 [2018-11-23 12:17:49,788 INFO L226 Difference]: Without dead ends: 122 [2018-11-23 12:17:49,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=470, Invalid=862, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:17:49,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-23 12:17:49,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-11-23 12:17:49,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:49,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 120 states. [2018-11-23 12:17:49,829 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 120 states. [2018-11-23 12:17:49,830 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 120 states. [2018-11-23 12:17:49,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:49,832 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2018-11-23 12:17:49,832 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2018-11-23 12:17:49,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:49,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:49,832 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 122 states. [2018-11-23 12:17:49,832 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 122 states. [2018-11-23 12:17:49,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:49,834 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2018-11-23 12:17:49,834 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2018-11-23 12:17:49,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:49,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:49,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:49,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 12:17:49,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2018-11-23 12:17:49,837 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 179 [2018-11-23 12:17:49,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:49,837 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2018-11-23 12:17:49,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 12:17:49,837 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2018-11-23 12:17:49,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-23 12:17:49,838 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:49,838 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:17:49,838 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:49,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:49,839 INFO L82 PathProgramCache]: Analyzing trace with hash 2108811893, now seen corresponding path program 28 times [2018-11-23 12:17:49,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:49,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:49,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:49,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:49,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:50,741 INFO L256 TraceCheckUtils]: 0: Hoare triple {21833#true} call ULTIMATE.init(); {21833#true} is VALID [2018-11-23 12:17:50,741 INFO L273 TraceCheckUtils]: 1: Hoare triple {21833#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21833#true} is VALID [2018-11-23 12:17:50,742 INFO L273 TraceCheckUtils]: 2: Hoare triple {21833#true} assume true; {21833#true} is VALID [2018-11-23 12:17:50,742 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21833#true} {21833#true} #71#return; {21833#true} is VALID [2018-11-23 12:17:50,742 INFO L256 TraceCheckUtils]: 4: Hoare triple {21833#true} call #t~ret14 := main(); {21833#true} is VALID [2018-11-23 12:17:50,742 INFO L273 TraceCheckUtils]: 5: Hoare triple {21833#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {21835#(= main_~i~1 0)} is VALID [2018-11-23 12:17:50,743 INFO L273 TraceCheckUtils]: 6: Hoare triple {21835#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21835#(= main_~i~1 0)} is VALID [2018-11-23 12:17:50,743 INFO L273 TraceCheckUtils]: 7: Hoare triple {21835#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21836#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:50,744 INFO L273 TraceCheckUtils]: 8: Hoare triple {21836#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21836#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:50,744 INFO L273 TraceCheckUtils]: 9: Hoare triple {21836#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21837#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:50,745 INFO L273 TraceCheckUtils]: 10: Hoare triple {21837#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21837#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:50,745 INFO L273 TraceCheckUtils]: 11: Hoare triple {21837#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21838#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:50,745 INFO L273 TraceCheckUtils]: 12: Hoare triple {21838#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21838#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:50,746 INFO L273 TraceCheckUtils]: 13: Hoare triple {21838#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21839#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:50,746 INFO L273 TraceCheckUtils]: 14: Hoare triple {21839#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21839#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:50,747 INFO L273 TraceCheckUtils]: 15: Hoare triple {21839#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21840#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:50,747 INFO L273 TraceCheckUtils]: 16: Hoare triple {21840#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21840#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:50,748 INFO L273 TraceCheckUtils]: 17: Hoare triple {21840#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21841#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:50,748 INFO L273 TraceCheckUtils]: 18: Hoare triple {21841#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21841#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:50,749 INFO L273 TraceCheckUtils]: 19: Hoare triple {21841#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21842#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:50,749 INFO L273 TraceCheckUtils]: 20: Hoare triple {21842#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21842#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:50,750 INFO L273 TraceCheckUtils]: 21: Hoare triple {21842#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21843#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:50,750 INFO L273 TraceCheckUtils]: 22: Hoare triple {21843#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21843#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:50,751 INFO L273 TraceCheckUtils]: 23: Hoare triple {21843#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21844#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:50,752 INFO L273 TraceCheckUtils]: 24: Hoare triple {21844#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21844#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:50,752 INFO L273 TraceCheckUtils]: 25: Hoare triple {21844#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21845#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:50,753 INFO L273 TraceCheckUtils]: 26: Hoare triple {21845#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21845#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:50,753 INFO L273 TraceCheckUtils]: 27: Hoare triple {21845#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21846#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:50,754 INFO L273 TraceCheckUtils]: 28: Hoare triple {21846#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21846#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:50,755 INFO L273 TraceCheckUtils]: 29: Hoare triple {21846#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21847#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:50,755 INFO L273 TraceCheckUtils]: 30: Hoare triple {21847#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21847#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:50,756 INFO L273 TraceCheckUtils]: 31: Hoare triple {21847#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21848#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:50,756 INFO L273 TraceCheckUtils]: 32: Hoare triple {21848#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21848#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:50,757 INFO L273 TraceCheckUtils]: 33: Hoare triple {21848#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21849#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:50,757 INFO L273 TraceCheckUtils]: 34: Hoare triple {21849#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21849#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:50,758 INFO L273 TraceCheckUtils]: 35: Hoare triple {21849#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21850#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:50,759 INFO L273 TraceCheckUtils]: 36: Hoare triple {21850#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21850#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:50,759 INFO L273 TraceCheckUtils]: 37: Hoare triple {21850#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21851#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:50,760 INFO L273 TraceCheckUtils]: 38: Hoare triple {21851#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21851#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:50,760 INFO L273 TraceCheckUtils]: 39: Hoare triple {21851#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21852#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:50,761 INFO L273 TraceCheckUtils]: 40: Hoare triple {21852#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21852#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:50,762 INFO L273 TraceCheckUtils]: 41: Hoare triple {21852#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21853#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:50,762 INFO L273 TraceCheckUtils]: 42: Hoare triple {21853#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21853#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:50,763 INFO L273 TraceCheckUtils]: 43: Hoare triple {21853#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21854#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:50,763 INFO L273 TraceCheckUtils]: 44: Hoare triple {21854#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21854#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:50,764 INFO L273 TraceCheckUtils]: 45: Hoare triple {21854#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21855#(<= main_~i~1 20)} is VALID [2018-11-23 12:17:50,764 INFO L273 TraceCheckUtils]: 46: Hoare triple {21855#(<= main_~i~1 20)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21855#(<= main_~i~1 20)} is VALID [2018-11-23 12:17:50,765 INFO L273 TraceCheckUtils]: 47: Hoare triple {21855#(<= main_~i~1 20)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21856#(<= main_~i~1 21)} is VALID [2018-11-23 12:17:50,766 INFO L273 TraceCheckUtils]: 48: Hoare triple {21856#(<= main_~i~1 21)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21856#(<= main_~i~1 21)} is VALID [2018-11-23 12:17:50,766 INFO L273 TraceCheckUtils]: 49: Hoare triple {21856#(<= main_~i~1 21)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21857#(<= main_~i~1 22)} is VALID [2018-11-23 12:17:50,767 INFO L273 TraceCheckUtils]: 50: Hoare triple {21857#(<= main_~i~1 22)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21857#(<= main_~i~1 22)} is VALID [2018-11-23 12:17:50,767 INFO L273 TraceCheckUtils]: 51: Hoare triple {21857#(<= main_~i~1 22)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21858#(<= main_~i~1 23)} is VALID [2018-11-23 12:17:50,768 INFO L273 TraceCheckUtils]: 52: Hoare triple {21858#(<= main_~i~1 23)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21858#(<= main_~i~1 23)} is VALID [2018-11-23 12:17:50,769 INFO L273 TraceCheckUtils]: 53: Hoare triple {21858#(<= main_~i~1 23)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21859#(<= main_~i~1 24)} is VALID [2018-11-23 12:17:50,769 INFO L273 TraceCheckUtils]: 54: Hoare triple {21859#(<= main_~i~1 24)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21859#(<= main_~i~1 24)} is VALID [2018-11-23 12:17:50,770 INFO L273 TraceCheckUtils]: 55: Hoare triple {21859#(<= main_~i~1 24)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21860#(<= main_~i~1 25)} is VALID [2018-11-23 12:17:50,770 INFO L273 TraceCheckUtils]: 56: Hoare triple {21860#(<= main_~i~1 25)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21860#(<= main_~i~1 25)} is VALID [2018-11-23 12:17:50,771 INFO L273 TraceCheckUtils]: 57: Hoare triple {21860#(<= main_~i~1 25)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21861#(<= main_~i~1 26)} is VALID [2018-11-23 12:17:50,771 INFO L273 TraceCheckUtils]: 58: Hoare triple {21861#(<= main_~i~1 26)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21861#(<= main_~i~1 26)} is VALID [2018-11-23 12:17:50,772 INFO L273 TraceCheckUtils]: 59: Hoare triple {21861#(<= main_~i~1 26)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21862#(<= main_~i~1 27)} is VALID [2018-11-23 12:17:50,772 INFO L273 TraceCheckUtils]: 60: Hoare triple {21862#(<= main_~i~1 27)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21862#(<= main_~i~1 27)} is VALID [2018-11-23 12:17:50,773 INFO L273 TraceCheckUtils]: 61: Hoare triple {21862#(<= main_~i~1 27)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21863#(<= main_~i~1 28)} is VALID [2018-11-23 12:17:50,774 INFO L273 TraceCheckUtils]: 62: Hoare triple {21863#(<= main_~i~1 28)} assume !(~i~1 < 60); {21834#false} is VALID [2018-11-23 12:17:50,774 INFO L256 TraceCheckUtils]: 63: Hoare triple {21834#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {21833#true} is VALID [2018-11-23 12:17:50,774 INFO L273 TraceCheckUtils]: 64: Hoare triple {21833#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {21833#true} is VALID [2018-11-23 12:17:50,774 INFO L273 TraceCheckUtils]: 65: Hoare triple {21833#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21833#true} is VALID [2018-11-23 12:17:50,775 INFO L273 TraceCheckUtils]: 66: Hoare triple {21833#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21833#true} is VALID [2018-11-23 12:17:50,775 INFO L273 TraceCheckUtils]: 67: Hoare triple {21833#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21833#true} is VALID [2018-11-23 12:17:50,775 INFO L273 TraceCheckUtils]: 68: Hoare triple {21833#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21833#true} is VALID [2018-11-23 12:17:50,775 INFO L273 TraceCheckUtils]: 69: Hoare triple {21833#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21833#true} is VALID [2018-11-23 12:17:50,775 INFO L273 TraceCheckUtils]: 70: Hoare triple {21833#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21833#true} is VALID [2018-11-23 12:17:50,775 INFO L273 TraceCheckUtils]: 71: Hoare triple {21833#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21833#true} is VALID [2018-11-23 12:17:50,775 INFO L273 TraceCheckUtils]: 72: Hoare triple {21833#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21833#true} is VALID [2018-11-23 12:17:50,776 INFO L273 TraceCheckUtils]: 73: Hoare triple {21833#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21833#true} is VALID [2018-11-23 12:17:50,776 INFO L273 TraceCheckUtils]: 74: Hoare triple {21833#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21833#true} is VALID [2018-11-23 12:17:50,776 INFO L273 TraceCheckUtils]: 75: Hoare triple {21833#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21833#true} is VALID [2018-11-23 12:17:50,776 INFO L273 TraceCheckUtils]: 76: Hoare triple {21833#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21833#true} is VALID [2018-11-23 12:17:50,776 INFO L273 TraceCheckUtils]: 77: Hoare triple {21833#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21833#true} is VALID [2018-11-23 12:17:50,776 INFO L273 TraceCheckUtils]: 78: Hoare triple {21833#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21833#true} is VALID [2018-11-23 12:17:50,777 INFO L273 TraceCheckUtils]: 79: Hoare triple {21833#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21833#true} is VALID [2018-11-23 12:17:50,777 INFO L273 TraceCheckUtils]: 80: Hoare triple {21833#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21833#true} is VALID [2018-11-23 12:17:50,777 INFO L273 TraceCheckUtils]: 81: Hoare triple {21833#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21833#true} is VALID [2018-11-23 12:17:50,777 INFO L273 TraceCheckUtils]: 82: Hoare triple {21833#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21833#true} is VALID [2018-11-23 12:17:50,777 INFO L273 TraceCheckUtils]: 83: Hoare triple {21833#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21833#true} is VALID [2018-11-23 12:17:50,777 INFO L273 TraceCheckUtils]: 84: Hoare triple {21833#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21833#true} is VALID [2018-11-23 12:17:50,777 INFO L273 TraceCheckUtils]: 85: Hoare triple {21833#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21833#true} is VALID [2018-11-23 12:17:50,777 INFO L273 TraceCheckUtils]: 86: Hoare triple {21833#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21833#true} is VALID [2018-11-23 12:17:50,777 INFO L273 TraceCheckUtils]: 87: Hoare triple {21833#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21833#true} is VALID [2018-11-23 12:17:50,777 INFO L273 TraceCheckUtils]: 88: Hoare triple {21833#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21833#true} is VALID [2018-11-23 12:17:50,778 INFO L273 TraceCheckUtils]: 89: Hoare triple {21833#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21833#true} is VALID [2018-11-23 12:17:50,778 INFO L273 TraceCheckUtils]: 90: Hoare triple {21833#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21833#true} is VALID [2018-11-23 12:17:50,778 INFO L273 TraceCheckUtils]: 91: Hoare triple {21833#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21833#true} is VALID [2018-11-23 12:17:50,778 INFO L273 TraceCheckUtils]: 92: Hoare triple {21833#true} assume !(~i~0 < 60); {21833#true} is VALID [2018-11-23 12:17:50,778 INFO L273 TraceCheckUtils]: 93: Hoare triple {21833#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {21833#true} is VALID [2018-11-23 12:17:50,778 INFO L273 TraceCheckUtils]: 94: Hoare triple {21833#true} assume true; {21833#true} is VALID [2018-11-23 12:17:50,778 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {21833#true} {21834#false} #75#return; {21834#false} is VALID [2018-11-23 12:17:50,778 INFO L273 TraceCheckUtils]: 96: Hoare triple {21834#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {21834#false} is VALID [2018-11-23 12:17:50,778 INFO L256 TraceCheckUtils]: 97: Hoare triple {21834#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {21833#true} is VALID [2018-11-23 12:17:50,779 INFO L273 TraceCheckUtils]: 98: Hoare triple {21833#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {21833#true} is VALID [2018-11-23 12:17:50,779 INFO L273 TraceCheckUtils]: 99: Hoare triple {21833#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21833#true} is VALID [2018-11-23 12:17:50,779 INFO L273 TraceCheckUtils]: 100: Hoare triple {21833#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21833#true} is VALID [2018-11-23 12:17:50,779 INFO L273 TraceCheckUtils]: 101: Hoare triple {21833#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21833#true} is VALID [2018-11-23 12:17:50,779 INFO L273 TraceCheckUtils]: 102: Hoare triple {21833#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21833#true} is VALID [2018-11-23 12:17:50,779 INFO L273 TraceCheckUtils]: 103: Hoare triple {21833#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21833#true} is VALID [2018-11-23 12:17:50,779 INFO L273 TraceCheckUtils]: 104: Hoare triple {21833#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21833#true} is VALID [2018-11-23 12:17:50,779 INFO L273 TraceCheckUtils]: 105: Hoare triple {21833#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21833#true} is VALID [2018-11-23 12:17:50,779 INFO L273 TraceCheckUtils]: 106: Hoare triple {21833#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21833#true} is VALID [2018-11-23 12:17:50,779 INFO L273 TraceCheckUtils]: 107: Hoare triple {21833#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21833#true} is VALID [2018-11-23 12:17:50,780 INFO L273 TraceCheckUtils]: 108: Hoare triple {21833#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21833#true} is VALID [2018-11-23 12:17:50,780 INFO L273 TraceCheckUtils]: 109: Hoare triple {21833#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21833#true} is VALID [2018-11-23 12:17:50,780 INFO L273 TraceCheckUtils]: 110: Hoare triple {21833#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21833#true} is VALID [2018-11-23 12:17:50,780 INFO L273 TraceCheckUtils]: 111: Hoare triple {21833#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21833#true} is VALID [2018-11-23 12:17:50,780 INFO L273 TraceCheckUtils]: 112: Hoare triple {21833#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21833#true} is VALID [2018-11-23 12:17:50,780 INFO L273 TraceCheckUtils]: 113: Hoare triple {21833#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21833#true} is VALID [2018-11-23 12:17:50,780 INFO L273 TraceCheckUtils]: 114: Hoare triple {21833#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21833#true} is VALID [2018-11-23 12:17:50,780 INFO L273 TraceCheckUtils]: 115: Hoare triple {21833#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21833#true} is VALID [2018-11-23 12:17:50,780 INFO L273 TraceCheckUtils]: 116: Hoare triple {21833#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21833#true} is VALID [2018-11-23 12:17:50,780 INFO L273 TraceCheckUtils]: 117: Hoare triple {21833#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21833#true} is VALID [2018-11-23 12:17:50,781 INFO L273 TraceCheckUtils]: 118: Hoare triple {21833#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21833#true} is VALID [2018-11-23 12:17:50,781 INFO L273 TraceCheckUtils]: 119: Hoare triple {21833#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21833#true} is VALID [2018-11-23 12:17:50,781 INFO L273 TraceCheckUtils]: 120: Hoare triple {21833#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21833#true} is VALID [2018-11-23 12:17:50,781 INFO L273 TraceCheckUtils]: 121: Hoare triple {21833#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21833#true} is VALID [2018-11-23 12:17:50,781 INFO L273 TraceCheckUtils]: 122: Hoare triple {21833#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21833#true} is VALID [2018-11-23 12:17:50,781 INFO L273 TraceCheckUtils]: 123: Hoare triple {21833#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21833#true} is VALID [2018-11-23 12:17:50,781 INFO L273 TraceCheckUtils]: 124: Hoare triple {21833#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21833#true} is VALID [2018-11-23 12:17:50,781 INFO L273 TraceCheckUtils]: 125: Hoare triple {21833#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21833#true} is VALID [2018-11-23 12:17:50,781 INFO L273 TraceCheckUtils]: 126: Hoare triple {21833#true} assume !(~i~0 < 60); {21833#true} is VALID [2018-11-23 12:17:50,781 INFO L273 TraceCheckUtils]: 127: Hoare triple {21833#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {21833#true} is VALID [2018-11-23 12:17:50,782 INFO L273 TraceCheckUtils]: 128: Hoare triple {21833#true} assume true; {21833#true} is VALID [2018-11-23 12:17:50,782 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {21833#true} {21834#false} #77#return; {21834#false} is VALID [2018-11-23 12:17:50,782 INFO L273 TraceCheckUtils]: 130: Hoare triple {21834#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {21834#false} is VALID [2018-11-23 12:17:50,782 INFO L273 TraceCheckUtils]: 131: Hoare triple {21834#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {21834#false} is VALID [2018-11-23 12:17:50,782 INFO L273 TraceCheckUtils]: 132: Hoare triple {21834#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {21834#false} is VALID [2018-11-23 12:17:50,782 INFO L273 TraceCheckUtils]: 133: Hoare triple {21834#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {21834#false} is VALID [2018-11-23 12:17:50,782 INFO L273 TraceCheckUtils]: 134: Hoare triple {21834#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {21834#false} is VALID [2018-11-23 12:17:50,782 INFO L273 TraceCheckUtils]: 135: Hoare triple {21834#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {21834#false} is VALID [2018-11-23 12:17:50,782 INFO L273 TraceCheckUtils]: 136: Hoare triple {21834#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {21834#false} is VALID [2018-11-23 12:17:50,783 INFO L273 TraceCheckUtils]: 137: Hoare triple {21834#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {21834#false} is VALID [2018-11-23 12:17:50,783 INFO L273 TraceCheckUtils]: 138: Hoare triple {21834#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {21834#false} is VALID [2018-11-23 12:17:50,783 INFO L273 TraceCheckUtils]: 139: Hoare triple {21834#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {21834#false} is VALID [2018-11-23 12:17:50,783 INFO L273 TraceCheckUtils]: 140: Hoare triple {21834#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {21834#false} is VALID [2018-11-23 12:17:50,783 INFO L273 TraceCheckUtils]: 141: Hoare triple {21834#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {21834#false} is VALID [2018-11-23 12:17:50,783 INFO L273 TraceCheckUtils]: 142: Hoare triple {21834#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {21834#false} is VALID [2018-11-23 12:17:50,783 INFO L273 TraceCheckUtils]: 143: Hoare triple {21834#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {21834#false} is VALID [2018-11-23 12:17:50,783 INFO L273 TraceCheckUtils]: 144: Hoare triple {21834#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {21834#false} is VALID [2018-11-23 12:17:50,783 INFO L273 TraceCheckUtils]: 145: Hoare triple {21834#false} assume !(~i~2 < 59); {21834#false} is VALID [2018-11-23 12:17:50,783 INFO L273 TraceCheckUtils]: 146: Hoare triple {21834#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {21834#false} is VALID [2018-11-23 12:17:50,784 INFO L256 TraceCheckUtils]: 147: Hoare triple {21834#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {21833#true} is VALID [2018-11-23 12:17:50,784 INFO L273 TraceCheckUtils]: 148: Hoare triple {21833#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {21833#true} is VALID [2018-11-23 12:17:50,784 INFO L273 TraceCheckUtils]: 149: Hoare triple {21833#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21833#true} is VALID [2018-11-23 12:17:50,784 INFO L273 TraceCheckUtils]: 150: Hoare triple {21833#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21833#true} is VALID [2018-11-23 12:17:50,784 INFO L273 TraceCheckUtils]: 151: Hoare triple {21833#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21833#true} is VALID [2018-11-23 12:17:50,784 INFO L273 TraceCheckUtils]: 152: Hoare triple {21833#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21833#true} is VALID [2018-11-23 12:17:50,784 INFO L273 TraceCheckUtils]: 153: Hoare triple {21833#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21833#true} is VALID [2018-11-23 12:17:50,784 INFO L273 TraceCheckUtils]: 154: Hoare triple {21833#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21833#true} is VALID [2018-11-23 12:17:50,784 INFO L273 TraceCheckUtils]: 155: Hoare triple {21833#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21833#true} is VALID [2018-11-23 12:17:50,784 INFO L273 TraceCheckUtils]: 156: Hoare triple {21833#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21833#true} is VALID [2018-11-23 12:17:50,785 INFO L273 TraceCheckUtils]: 157: Hoare triple {21833#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21833#true} is VALID [2018-11-23 12:17:50,785 INFO L273 TraceCheckUtils]: 158: Hoare triple {21833#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21833#true} is VALID [2018-11-23 12:17:50,785 INFO L273 TraceCheckUtils]: 159: Hoare triple {21833#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21833#true} is VALID [2018-11-23 12:17:50,785 INFO L273 TraceCheckUtils]: 160: Hoare triple {21833#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21833#true} is VALID [2018-11-23 12:17:50,785 INFO L273 TraceCheckUtils]: 161: Hoare triple {21833#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21833#true} is VALID [2018-11-23 12:17:50,785 INFO L273 TraceCheckUtils]: 162: Hoare triple {21833#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21833#true} is VALID [2018-11-23 12:17:50,785 INFO L273 TraceCheckUtils]: 163: Hoare triple {21833#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21833#true} is VALID [2018-11-23 12:17:50,785 INFO L273 TraceCheckUtils]: 164: Hoare triple {21833#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21833#true} is VALID [2018-11-23 12:17:50,785 INFO L273 TraceCheckUtils]: 165: Hoare triple {21833#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21833#true} is VALID [2018-11-23 12:17:50,785 INFO L273 TraceCheckUtils]: 166: Hoare triple {21833#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21833#true} is VALID [2018-11-23 12:17:50,786 INFO L273 TraceCheckUtils]: 167: Hoare triple {21833#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21833#true} is VALID [2018-11-23 12:17:50,786 INFO L273 TraceCheckUtils]: 168: Hoare triple {21833#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21833#true} is VALID [2018-11-23 12:17:50,786 INFO L273 TraceCheckUtils]: 169: Hoare triple {21833#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21833#true} is VALID [2018-11-23 12:17:50,786 INFO L273 TraceCheckUtils]: 170: Hoare triple {21833#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21833#true} is VALID [2018-11-23 12:17:50,786 INFO L273 TraceCheckUtils]: 171: Hoare triple {21833#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21833#true} is VALID [2018-11-23 12:17:50,786 INFO L273 TraceCheckUtils]: 172: Hoare triple {21833#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21833#true} is VALID [2018-11-23 12:17:50,786 INFO L273 TraceCheckUtils]: 173: Hoare triple {21833#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21833#true} is VALID [2018-11-23 12:17:50,786 INFO L273 TraceCheckUtils]: 174: Hoare triple {21833#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21833#true} is VALID [2018-11-23 12:17:50,786 INFO L273 TraceCheckUtils]: 175: Hoare triple {21833#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21833#true} is VALID [2018-11-23 12:17:50,787 INFO L273 TraceCheckUtils]: 176: Hoare triple {21833#true} assume !(~i~0 < 60); {21833#true} is VALID [2018-11-23 12:17:50,787 INFO L273 TraceCheckUtils]: 177: Hoare triple {21833#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {21833#true} is VALID [2018-11-23 12:17:50,787 INFO L273 TraceCheckUtils]: 178: Hoare triple {21833#true} assume true; {21833#true} is VALID [2018-11-23 12:17:50,787 INFO L268 TraceCheckUtils]: 179: Hoare quadruple {21833#true} {21834#false} #79#return; {21834#false} is VALID [2018-11-23 12:17:50,787 INFO L273 TraceCheckUtils]: 180: Hoare triple {21834#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {21834#false} is VALID [2018-11-23 12:17:50,787 INFO L273 TraceCheckUtils]: 181: Hoare triple {21834#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {21834#false} is VALID [2018-11-23 12:17:50,787 INFO L273 TraceCheckUtils]: 182: Hoare triple {21834#false} assume !false; {21834#false} is VALID [2018-11-23 12:17:50,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1982 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 1198 trivial. 0 not checked. [2018-11-23 12:17:50,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:50,802 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:17:50,810 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:17:50,917 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:17:50,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:50,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:51,389 INFO L256 TraceCheckUtils]: 0: Hoare triple {21833#true} call ULTIMATE.init(); {21833#true} is VALID [2018-11-23 12:17:51,390 INFO L273 TraceCheckUtils]: 1: Hoare triple {21833#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21833#true} is VALID [2018-11-23 12:17:51,390 INFO L273 TraceCheckUtils]: 2: Hoare triple {21833#true} assume true; {21833#true} is VALID [2018-11-23 12:17:51,390 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21833#true} {21833#true} #71#return; {21833#true} is VALID [2018-11-23 12:17:51,390 INFO L256 TraceCheckUtils]: 4: Hoare triple {21833#true} call #t~ret14 := main(); {21833#true} is VALID [2018-11-23 12:17:51,391 INFO L273 TraceCheckUtils]: 5: Hoare triple {21833#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {21882#(<= main_~i~1 0)} is VALID [2018-11-23 12:17:51,411 INFO L273 TraceCheckUtils]: 6: Hoare triple {21882#(<= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21882#(<= main_~i~1 0)} is VALID [2018-11-23 12:17:51,419 INFO L273 TraceCheckUtils]: 7: Hoare triple {21882#(<= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21836#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:51,434 INFO L273 TraceCheckUtils]: 8: Hoare triple {21836#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21836#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:51,442 INFO L273 TraceCheckUtils]: 9: Hoare triple {21836#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21837#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:51,443 INFO L273 TraceCheckUtils]: 10: Hoare triple {21837#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21837#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:51,443 INFO L273 TraceCheckUtils]: 11: Hoare triple {21837#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21838#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:51,444 INFO L273 TraceCheckUtils]: 12: Hoare triple {21838#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21838#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:51,444 INFO L273 TraceCheckUtils]: 13: Hoare triple {21838#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21839#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:51,444 INFO L273 TraceCheckUtils]: 14: Hoare triple {21839#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21839#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:51,445 INFO L273 TraceCheckUtils]: 15: Hoare triple {21839#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21840#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:51,445 INFO L273 TraceCheckUtils]: 16: Hoare triple {21840#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21840#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:51,445 INFO L273 TraceCheckUtils]: 17: Hoare triple {21840#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21841#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:51,446 INFO L273 TraceCheckUtils]: 18: Hoare triple {21841#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21841#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:51,446 INFO L273 TraceCheckUtils]: 19: Hoare triple {21841#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21842#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:51,447 INFO L273 TraceCheckUtils]: 20: Hoare triple {21842#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21842#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:51,447 INFO L273 TraceCheckUtils]: 21: Hoare triple {21842#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21843#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:51,447 INFO L273 TraceCheckUtils]: 22: Hoare triple {21843#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21843#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:51,448 INFO L273 TraceCheckUtils]: 23: Hoare triple {21843#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21844#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:51,448 INFO L273 TraceCheckUtils]: 24: Hoare triple {21844#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21844#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:51,449 INFO L273 TraceCheckUtils]: 25: Hoare triple {21844#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21845#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:51,449 INFO L273 TraceCheckUtils]: 26: Hoare triple {21845#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21845#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:51,450 INFO L273 TraceCheckUtils]: 27: Hoare triple {21845#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21846#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:51,451 INFO L273 TraceCheckUtils]: 28: Hoare triple {21846#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21846#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:51,451 INFO L273 TraceCheckUtils]: 29: Hoare triple {21846#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21847#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:51,452 INFO L273 TraceCheckUtils]: 30: Hoare triple {21847#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21847#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:51,452 INFO L273 TraceCheckUtils]: 31: Hoare triple {21847#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21848#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:51,453 INFO L273 TraceCheckUtils]: 32: Hoare triple {21848#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21848#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:51,454 INFO L273 TraceCheckUtils]: 33: Hoare triple {21848#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21849#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:51,454 INFO L273 TraceCheckUtils]: 34: Hoare triple {21849#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21849#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:51,455 INFO L273 TraceCheckUtils]: 35: Hoare triple {21849#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21850#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:51,455 INFO L273 TraceCheckUtils]: 36: Hoare triple {21850#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21850#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:51,456 INFO L273 TraceCheckUtils]: 37: Hoare triple {21850#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21851#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:51,456 INFO L273 TraceCheckUtils]: 38: Hoare triple {21851#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21851#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:51,457 INFO L273 TraceCheckUtils]: 39: Hoare triple {21851#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21852#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:51,457 INFO L273 TraceCheckUtils]: 40: Hoare triple {21852#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21852#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:51,458 INFO L273 TraceCheckUtils]: 41: Hoare triple {21852#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21853#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:51,459 INFO L273 TraceCheckUtils]: 42: Hoare triple {21853#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21853#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:51,459 INFO L273 TraceCheckUtils]: 43: Hoare triple {21853#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21854#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:51,460 INFO L273 TraceCheckUtils]: 44: Hoare triple {21854#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21854#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:51,460 INFO L273 TraceCheckUtils]: 45: Hoare triple {21854#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21855#(<= main_~i~1 20)} is VALID [2018-11-23 12:17:51,461 INFO L273 TraceCheckUtils]: 46: Hoare triple {21855#(<= main_~i~1 20)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21855#(<= main_~i~1 20)} is VALID [2018-11-23 12:17:51,462 INFO L273 TraceCheckUtils]: 47: Hoare triple {21855#(<= main_~i~1 20)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21856#(<= main_~i~1 21)} is VALID [2018-11-23 12:17:51,462 INFO L273 TraceCheckUtils]: 48: Hoare triple {21856#(<= main_~i~1 21)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21856#(<= main_~i~1 21)} is VALID [2018-11-23 12:17:51,463 INFO L273 TraceCheckUtils]: 49: Hoare triple {21856#(<= main_~i~1 21)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21857#(<= main_~i~1 22)} is VALID [2018-11-23 12:17:51,463 INFO L273 TraceCheckUtils]: 50: Hoare triple {21857#(<= main_~i~1 22)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21857#(<= main_~i~1 22)} is VALID [2018-11-23 12:17:51,464 INFO L273 TraceCheckUtils]: 51: Hoare triple {21857#(<= main_~i~1 22)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21858#(<= main_~i~1 23)} is VALID [2018-11-23 12:17:51,464 INFO L273 TraceCheckUtils]: 52: Hoare triple {21858#(<= main_~i~1 23)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21858#(<= main_~i~1 23)} is VALID [2018-11-23 12:17:51,465 INFO L273 TraceCheckUtils]: 53: Hoare triple {21858#(<= main_~i~1 23)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21859#(<= main_~i~1 24)} is VALID [2018-11-23 12:17:51,466 INFO L273 TraceCheckUtils]: 54: Hoare triple {21859#(<= main_~i~1 24)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21859#(<= main_~i~1 24)} is VALID [2018-11-23 12:17:51,466 INFO L273 TraceCheckUtils]: 55: Hoare triple {21859#(<= main_~i~1 24)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21860#(<= main_~i~1 25)} is VALID [2018-11-23 12:17:51,467 INFO L273 TraceCheckUtils]: 56: Hoare triple {21860#(<= main_~i~1 25)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21860#(<= main_~i~1 25)} is VALID [2018-11-23 12:17:51,467 INFO L273 TraceCheckUtils]: 57: Hoare triple {21860#(<= main_~i~1 25)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21861#(<= main_~i~1 26)} is VALID [2018-11-23 12:17:51,468 INFO L273 TraceCheckUtils]: 58: Hoare triple {21861#(<= main_~i~1 26)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21861#(<= main_~i~1 26)} is VALID [2018-11-23 12:17:51,469 INFO L273 TraceCheckUtils]: 59: Hoare triple {21861#(<= main_~i~1 26)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21862#(<= main_~i~1 27)} is VALID [2018-11-23 12:17:51,469 INFO L273 TraceCheckUtils]: 60: Hoare triple {21862#(<= main_~i~1 27)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {21862#(<= main_~i~1 27)} is VALID [2018-11-23 12:17:51,470 INFO L273 TraceCheckUtils]: 61: Hoare triple {21862#(<= main_~i~1 27)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21863#(<= main_~i~1 28)} is VALID [2018-11-23 12:17:51,470 INFO L273 TraceCheckUtils]: 62: Hoare triple {21863#(<= main_~i~1 28)} assume !(~i~1 < 60); {21834#false} is VALID [2018-11-23 12:17:51,471 INFO L256 TraceCheckUtils]: 63: Hoare triple {21834#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {21834#false} is VALID [2018-11-23 12:17:51,471 INFO L273 TraceCheckUtils]: 64: Hoare triple {21834#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {21834#false} is VALID [2018-11-23 12:17:51,471 INFO L273 TraceCheckUtils]: 65: Hoare triple {21834#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21834#false} is VALID [2018-11-23 12:17:51,471 INFO L273 TraceCheckUtils]: 66: Hoare triple {21834#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21834#false} is VALID [2018-11-23 12:17:51,471 INFO L273 TraceCheckUtils]: 67: Hoare triple {21834#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21834#false} is VALID [2018-11-23 12:17:51,471 INFO L273 TraceCheckUtils]: 68: Hoare triple {21834#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21834#false} is VALID [2018-11-23 12:17:51,472 INFO L273 TraceCheckUtils]: 69: Hoare triple {21834#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21834#false} is VALID [2018-11-23 12:17:51,472 INFO L273 TraceCheckUtils]: 70: Hoare triple {21834#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21834#false} is VALID [2018-11-23 12:17:51,472 INFO L273 TraceCheckUtils]: 71: Hoare triple {21834#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21834#false} is VALID [2018-11-23 12:17:51,472 INFO L273 TraceCheckUtils]: 72: Hoare triple {21834#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21834#false} is VALID [2018-11-23 12:17:51,472 INFO L273 TraceCheckUtils]: 73: Hoare triple {21834#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21834#false} is VALID [2018-11-23 12:17:51,472 INFO L273 TraceCheckUtils]: 74: Hoare triple {21834#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21834#false} is VALID [2018-11-23 12:17:51,473 INFO L273 TraceCheckUtils]: 75: Hoare triple {21834#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21834#false} is VALID [2018-11-23 12:17:51,473 INFO L273 TraceCheckUtils]: 76: Hoare triple {21834#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21834#false} is VALID [2018-11-23 12:17:51,473 INFO L273 TraceCheckUtils]: 77: Hoare triple {21834#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21834#false} is VALID [2018-11-23 12:17:51,473 INFO L273 TraceCheckUtils]: 78: Hoare triple {21834#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21834#false} is VALID [2018-11-23 12:17:51,473 INFO L273 TraceCheckUtils]: 79: Hoare triple {21834#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21834#false} is VALID [2018-11-23 12:17:51,473 INFO L273 TraceCheckUtils]: 80: Hoare triple {21834#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21834#false} is VALID [2018-11-23 12:17:51,474 INFO L273 TraceCheckUtils]: 81: Hoare triple {21834#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21834#false} is VALID [2018-11-23 12:17:51,474 INFO L273 TraceCheckUtils]: 82: Hoare triple {21834#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21834#false} is VALID [2018-11-23 12:17:51,474 INFO L273 TraceCheckUtils]: 83: Hoare triple {21834#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21834#false} is VALID [2018-11-23 12:17:51,474 INFO L273 TraceCheckUtils]: 84: Hoare triple {21834#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21834#false} is VALID [2018-11-23 12:17:51,474 INFO L273 TraceCheckUtils]: 85: Hoare triple {21834#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21834#false} is VALID [2018-11-23 12:17:51,474 INFO L273 TraceCheckUtils]: 86: Hoare triple {21834#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21834#false} is VALID [2018-11-23 12:17:51,474 INFO L273 TraceCheckUtils]: 87: Hoare triple {21834#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21834#false} is VALID [2018-11-23 12:17:51,474 INFO L273 TraceCheckUtils]: 88: Hoare triple {21834#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21834#false} is VALID [2018-11-23 12:17:51,474 INFO L273 TraceCheckUtils]: 89: Hoare triple {21834#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21834#false} is VALID [2018-11-23 12:17:51,474 INFO L273 TraceCheckUtils]: 90: Hoare triple {21834#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21834#false} is VALID [2018-11-23 12:17:51,475 INFO L273 TraceCheckUtils]: 91: Hoare triple {21834#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21834#false} is VALID [2018-11-23 12:17:51,475 INFO L273 TraceCheckUtils]: 92: Hoare triple {21834#false} assume !(~i~0 < 60); {21834#false} is VALID [2018-11-23 12:17:51,475 INFO L273 TraceCheckUtils]: 93: Hoare triple {21834#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {21834#false} is VALID [2018-11-23 12:17:51,475 INFO L273 TraceCheckUtils]: 94: Hoare triple {21834#false} assume true; {21834#false} is VALID [2018-11-23 12:17:51,475 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {21834#false} {21834#false} #75#return; {21834#false} is VALID [2018-11-23 12:17:51,475 INFO L273 TraceCheckUtils]: 96: Hoare triple {21834#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {21834#false} is VALID [2018-11-23 12:17:51,476 INFO L256 TraceCheckUtils]: 97: Hoare triple {21834#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {21834#false} is VALID [2018-11-23 12:17:51,476 INFO L273 TraceCheckUtils]: 98: Hoare triple {21834#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {21834#false} is VALID [2018-11-23 12:17:51,476 INFO L273 TraceCheckUtils]: 99: Hoare triple {21834#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21834#false} is VALID [2018-11-23 12:17:51,476 INFO L273 TraceCheckUtils]: 100: Hoare triple {21834#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21834#false} is VALID [2018-11-23 12:17:51,476 INFO L273 TraceCheckUtils]: 101: Hoare triple {21834#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21834#false} is VALID [2018-11-23 12:17:51,476 INFO L273 TraceCheckUtils]: 102: Hoare triple {21834#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21834#false} is VALID [2018-11-23 12:17:51,476 INFO L273 TraceCheckUtils]: 103: Hoare triple {21834#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21834#false} is VALID [2018-11-23 12:17:51,477 INFO L273 TraceCheckUtils]: 104: Hoare triple {21834#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21834#false} is VALID [2018-11-23 12:17:51,477 INFO L273 TraceCheckUtils]: 105: Hoare triple {21834#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21834#false} is VALID [2018-11-23 12:17:51,477 INFO L273 TraceCheckUtils]: 106: Hoare triple {21834#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21834#false} is VALID [2018-11-23 12:17:51,477 INFO L273 TraceCheckUtils]: 107: Hoare triple {21834#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21834#false} is VALID [2018-11-23 12:17:51,477 INFO L273 TraceCheckUtils]: 108: Hoare triple {21834#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21834#false} is VALID [2018-11-23 12:17:51,477 INFO L273 TraceCheckUtils]: 109: Hoare triple {21834#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21834#false} is VALID [2018-11-23 12:17:51,478 INFO L273 TraceCheckUtils]: 110: Hoare triple {21834#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21834#false} is VALID [2018-11-23 12:17:51,478 INFO L273 TraceCheckUtils]: 111: Hoare triple {21834#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21834#false} is VALID [2018-11-23 12:17:51,478 INFO L273 TraceCheckUtils]: 112: Hoare triple {21834#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21834#false} is VALID [2018-11-23 12:17:51,478 INFO L273 TraceCheckUtils]: 113: Hoare triple {21834#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21834#false} is VALID [2018-11-23 12:17:51,478 INFO L273 TraceCheckUtils]: 114: Hoare triple {21834#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21834#false} is VALID [2018-11-23 12:17:51,478 INFO L273 TraceCheckUtils]: 115: Hoare triple {21834#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21834#false} is VALID [2018-11-23 12:17:51,478 INFO L273 TraceCheckUtils]: 116: Hoare triple {21834#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21834#false} is VALID [2018-11-23 12:17:51,479 INFO L273 TraceCheckUtils]: 117: Hoare triple {21834#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21834#false} is VALID [2018-11-23 12:17:51,479 INFO L273 TraceCheckUtils]: 118: Hoare triple {21834#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21834#false} is VALID [2018-11-23 12:17:51,479 INFO L273 TraceCheckUtils]: 119: Hoare triple {21834#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21834#false} is VALID [2018-11-23 12:17:51,479 INFO L273 TraceCheckUtils]: 120: Hoare triple {21834#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21834#false} is VALID [2018-11-23 12:17:51,479 INFO L273 TraceCheckUtils]: 121: Hoare triple {21834#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21834#false} is VALID [2018-11-23 12:17:51,479 INFO L273 TraceCheckUtils]: 122: Hoare triple {21834#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21834#false} is VALID [2018-11-23 12:17:51,479 INFO L273 TraceCheckUtils]: 123: Hoare triple {21834#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21834#false} is VALID [2018-11-23 12:17:51,480 INFO L273 TraceCheckUtils]: 124: Hoare triple {21834#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21834#false} is VALID [2018-11-23 12:17:51,480 INFO L273 TraceCheckUtils]: 125: Hoare triple {21834#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21834#false} is VALID [2018-11-23 12:17:51,480 INFO L273 TraceCheckUtils]: 126: Hoare triple {21834#false} assume !(~i~0 < 60); {21834#false} is VALID [2018-11-23 12:17:51,480 INFO L273 TraceCheckUtils]: 127: Hoare triple {21834#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {21834#false} is VALID [2018-11-23 12:17:51,480 INFO L273 TraceCheckUtils]: 128: Hoare triple {21834#false} assume true; {21834#false} is VALID [2018-11-23 12:17:51,480 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {21834#false} {21834#false} #77#return; {21834#false} is VALID [2018-11-23 12:17:51,480 INFO L273 TraceCheckUtils]: 130: Hoare triple {21834#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {21834#false} is VALID [2018-11-23 12:17:51,481 INFO L273 TraceCheckUtils]: 131: Hoare triple {21834#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {21834#false} is VALID [2018-11-23 12:17:51,481 INFO L273 TraceCheckUtils]: 132: Hoare triple {21834#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {21834#false} is VALID [2018-11-23 12:17:51,481 INFO L273 TraceCheckUtils]: 133: Hoare triple {21834#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {21834#false} is VALID [2018-11-23 12:17:51,481 INFO L273 TraceCheckUtils]: 134: Hoare triple {21834#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {21834#false} is VALID [2018-11-23 12:17:51,481 INFO L273 TraceCheckUtils]: 135: Hoare triple {21834#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {21834#false} is VALID [2018-11-23 12:17:51,481 INFO L273 TraceCheckUtils]: 136: Hoare triple {21834#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {21834#false} is VALID [2018-11-23 12:17:51,481 INFO L273 TraceCheckUtils]: 137: Hoare triple {21834#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {21834#false} is VALID [2018-11-23 12:17:51,482 INFO L273 TraceCheckUtils]: 138: Hoare triple {21834#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {21834#false} is VALID [2018-11-23 12:17:51,482 INFO L273 TraceCheckUtils]: 139: Hoare triple {21834#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {21834#false} is VALID [2018-11-23 12:17:51,482 INFO L273 TraceCheckUtils]: 140: Hoare triple {21834#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {21834#false} is VALID [2018-11-23 12:17:51,482 INFO L273 TraceCheckUtils]: 141: Hoare triple {21834#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {21834#false} is VALID [2018-11-23 12:17:51,482 INFO L273 TraceCheckUtils]: 142: Hoare triple {21834#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {21834#false} is VALID [2018-11-23 12:17:51,482 INFO L273 TraceCheckUtils]: 143: Hoare triple {21834#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {21834#false} is VALID [2018-11-23 12:17:51,482 INFO L273 TraceCheckUtils]: 144: Hoare triple {21834#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {21834#false} is VALID [2018-11-23 12:17:51,483 INFO L273 TraceCheckUtils]: 145: Hoare triple {21834#false} assume !(~i~2 < 59); {21834#false} is VALID [2018-11-23 12:17:51,483 INFO L273 TraceCheckUtils]: 146: Hoare triple {21834#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {21834#false} is VALID [2018-11-23 12:17:51,483 INFO L256 TraceCheckUtils]: 147: Hoare triple {21834#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {21834#false} is VALID [2018-11-23 12:17:51,483 INFO L273 TraceCheckUtils]: 148: Hoare triple {21834#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {21834#false} is VALID [2018-11-23 12:17:51,483 INFO L273 TraceCheckUtils]: 149: Hoare triple {21834#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21834#false} is VALID [2018-11-23 12:17:51,483 INFO L273 TraceCheckUtils]: 150: Hoare triple {21834#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21834#false} is VALID [2018-11-23 12:17:51,483 INFO L273 TraceCheckUtils]: 151: Hoare triple {21834#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21834#false} is VALID [2018-11-23 12:17:51,483 INFO L273 TraceCheckUtils]: 152: Hoare triple {21834#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21834#false} is VALID [2018-11-23 12:17:51,483 INFO L273 TraceCheckUtils]: 153: Hoare triple {21834#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21834#false} is VALID [2018-11-23 12:17:51,484 INFO L273 TraceCheckUtils]: 154: Hoare triple {21834#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21834#false} is VALID [2018-11-23 12:17:51,484 INFO L273 TraceCheckUtils]: 155: Hoare triple {21834#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21834#false} is VALID [2018-11-23 12:17:51,484 INFO L273 TraceCheckUtils]: 156: Hoare triple {21834#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21834#false} is VALID [2018-11-23 12:17:51,484 INFO L273 TraceCheckUtils]: 157: Hoare triple {21834#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21834#false} is VALID [2018-11-23 12:17:51,484 INFO L273 TraceCheckUtils]: 158: Hoare triple {21834#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21834#false} is VALID [2018-11-23 12:17:51,484 INFO L273 TraceCheckUtils]: 159: Hoare triple {21834#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21834#false} is VALID [2018-11-23 12:17:51,484 INFO L273 TraceCheckUtils]: 160: Hoare triple {21834#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21834#false} is VALID [2018-11-23 12:17:51,484 INFO L273 TraceCheckUtils]: 161: Hoare triple {21834#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21834#false} is VALID [2018-11-23 12:17:51,484 INFO L273 TraceCheckUtils]: 162: Hoare triple {21834#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21834#false} is VALID [2018-11-23 12:17:51,485 INFO L273 TraceCheckUtils]: 163: Hoare triple {21834#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21834#false} is VALID [2018-11-23 12:17:51,485 INFO L273 TraceCheckUtils]: 164: Hoare triple {21834#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21834#false} is VALID [2018-11-23 12:17:51,485 INFO L273 TraceCheckUtils]: 165: Hoare triple {21834#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21834#false} is VALID [2018-11-23 12:17:51,485 INFO L273 TraceCheckUtils]: 166: Hoare triple {21834#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21834#false} is VALID [2018-11-23 12:17:51,485 INFO L273 TraceCheckUtils]: 167: Hoare triple {21834#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21834#false} is VALID [2018-11-23 12:17:51,485 INFO L273 TraceCheckUtils]: 168: Hoare triple {21834#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21834#false} is VALID [2018-11-23 12:17:51,485 INFO L273 TraceCheckUtils]: 169: Hoare triple {21834#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21834#false} is VALID [2018-11-23 12:17:51,485 INFO L273 TraceCheckUtils]: 170: Hoare triple {21834#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21834#false} is VALID [2018-11-23 12:17:51,485 INFO L273 TraceCheckUtils]: 171: Hoare triple {21834#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21834#false} is VALID [2018-11-23 12:17:51,485 INFO L273 TraceCheckUtils]: 172: Hoare triple {21834#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21834#false} is VALID [2018-11-23 12:17:51,486 INFO L273 TraceCheckUtils]: 173: Hoare triple {21834#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {21834#false} is VALID [2018-11-23 12:17:51,486 INFO L273 TraceCheckUtils]: 174: Hoare triple {21834#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {21834#false} is VALID [2018-11-23 12:17:51,486 INFO L273 TraceCheckUtils]: 175: Hoare triple {21834#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21834#false} is VALID [2018-11-23 12:17:51,486 INFO L273 TraceCheckUtils]: 176: Hoare triple {21834#false} assume !(~i~0 < 60); {21834#false} is VALID [2018-11-23 12:17:51,486 INFO L273 TraceCheckUtils]: 177: Hoare triple {21834#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {21834#false} is VALID [2018-11-23 12:17:51,486 INFO L273 TraceCheckUtils]: 178: Hoare triple {21834#false} assume true; {21834#false} is VALID [2018-11-23 12:17:51,486 INFO L268 TraceCheckUtils]: 179: Hoare quadruple {21834#false} {21834#false} #79#return; {21834#false} is VALID [2018-11-23 12:17:51,486 INFO L273 TraceCheckUtils]: 180: Hoare triple {21834#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {21834#false} is VALID [2018-11-23 12:17:51,486 INFO L273 TraceCheckUtils]: 181: Hoare triple {21834#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {21834#false} is VALID [2018-11-23 12:17:51,486 INFO L273 TraceCheckUtils]: 182: Hoare triple {21834#false} assume !false; {21834#false} is VALID [2018-11-23 12:17:51,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1982 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 1198 trivial. 0 not checked. [2018-11-23 12:17:51,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:51,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-23 12:17:51,520 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 183 [2018-11-23 12:17:51,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:51,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 12:17:51,615 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:51,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 12:17:51,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 12:17:51,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:17:51,617 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand 32 states. [2018-11-23 12:17:52,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:52,447 INFO L93 Difference]: Finished difference Result 180 states and 206 transitions. [2018-11-23 12:17:52,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 12:17:52,448 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 183 [2018-11-23 12:17:52,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:17:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 114 transitions. [2018-11-23 12:17:52,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:17:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 114 transitions. [2018-11-23 12:17:52,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 114 transitions. [2018-11-23 12:17:52,556 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-23 12:17:52,558 INFO L225 Difference]: With dead ends: 180 [2018-11-23 12:17:52,559 INFO L226 Difference]: Without dead ends: 123 [2018-11-23 12:17:52,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:17:52,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-23 12:17:52,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-11-23 12:17:52,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:52,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 122 states. [2018-11-23 12:17:52,607 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 122 states. [2018-11-23 12:17:52,607 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 122 states. [2018-11-23 12:17:52,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:52,609 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2018-11-23 12:17:52,609 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2018-11-23 12:17:52,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:52,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:52,610 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 123 states. [2018-11-23 12:17:52,610 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 123 states. [2018-11-23 12:17:52,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:52,612 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2018-11-23 12:17:52,613 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2018-11-23 12:17:52,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:52,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:52,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:52,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:52,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-23 12:17:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2018-11-23 12:17:52,616 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 183 [2018-11-23 12:17:52,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:52,616 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2018-11-23 12:17:52,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 12:17:52,616 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2018-11-23 12:17:52,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-23 12:17:52,617 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:52,618 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 27, 27, 27, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:17:52,618 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:52,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:52,618 INFO L82 PathProgramCache]: Analyzing trace with hash -28804973, now seen corresponding path program 29 times [2018-11-23 12:17:52,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:52,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:52,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:52,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:52,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:53,256 INFO L256 TraceCheckUtils]: 0: Hoare triple {23095#true} call ULTIMATE.init(); {23095#true} is VALID [2018-11-23 12:17:53,256 INFO L273 TraceCheckUtils]: 1: Hoare triple {23095#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23095#true} is VALID [2018-11-23 12:17:53,256 INFO L273 TraceCheckUtils]: 2: Hoare triple {23095#true} assume true; {23095#true} is VALID [2018-11-23 12:17:53,256 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23095#true} {23095#true} #71#return; {23095#true} is VALID [2018-11-23 12:17:53,256 INFO L256 TraceCheckUtils]: 4: Hoare triple {23095#true} call #t~ret14 := main(); {23095#true} is VALID [2018-11-23 12:17:53,257 INFO L273 TraceCheckUtils]: 5: Hoare triple {23095#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {23097#(= main_~i~1 0)} is VALID [2018-11-23 12:17:53,257 INFO L273 TraceCheckUtils]: 6: Hoare triple {23097#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23097#(= main_~i~1 0)} is VALID [2018-11-23 12:17:53,258 INFO L273 TraceCheckUtils]: 7: Hoare triple {23097#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23098#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:53,259 INFO L273 TraceCheckUtils]: 8: Hoare triple {23098#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23098#(<= main_~i~1 1)} is VALID [2018-11-23 12:17:53,259 INFO L273 TraceCheckUtils]: 9: Hoare triple {23098#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23099#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:53,260 INFO L273 TraceCheckUtils]: 10: Hoare triple {23099#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23099#(<= main_~i~1 2)} is VALID [2018-11-23 12:17:53,261 INFO L273 TraceCheckUtils]: 11: Hoare triple {23099#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23100#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:53,261 INFO L273 TraceCheckUtils]: 12: Hoare triple {23100#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23100#(<= main_~i~1 3)} is VALID [2018-11-23 12:17:53,262 INFO L273 TraceCheckUtils]: 13: Hoare triple {23100#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23101#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:53,262 INFO L273 TraceCheckUtils]: 14: Hoare triple {23101#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23101#(<= main_~i~1 4)} is VALID [2018-11-23 12:17:53,263 INFO L273 TraceCheckUtils]: 15: Hoare triple {23101#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23102#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:53,263 INFO L273 TraceCheckUtils]: 16: Hoare triple {23102#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23102#(<= main_~i~1 5)} is VALID [2018-11-23 12:17:53,264 INFO L273 TraceCheckUtils]: 17: Hoare triple {23102#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23103#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:53,265 INFO L273 TraceCheckUtils]: 18: Hoare triple {23103#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23103#(<= main_~i~1 6)} is VALID [2018-11-23 12:17:53,265 INFO L273 TraceCheckUtils]: 19: Hoare triple {23103#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23104#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:53,266 INFO L273 TraceCheckUtils]: 20: Hoare triple {23104#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23104#(<= main_~i~1 7)} is VALID [2018-11-23 12:17:53,266 INFO L273 TraceCheckUtils]: 21: Hoare triple {23104#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23105#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:53,267 INFO L273 TraceCheckUtils]: 22: Hoare triple {23105#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23105#(<= main_~i~1 8)} is VALID [2018-11-23 12:17:53,268 INFO L273 TraceCheckUtils]: 23: Hoare triple {23105#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23106#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:53,268 INFO L273 TraceCheckUtils]: 24: Hoare triple {23106#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23106#(<= main_~i~1 9)} is VALID [2018-11-23 12:17:53,269 INFO L273 TraceCheckUtils]: 25: Hoare triple {23106#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23107#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:53,269 INFO L273 TraceCheckUtils]: 26: Hoare triple {23107#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23107#(<= main_~i~1 10)} is VALID [2018-11-23 12:17:53,270 INFO L273 TraceCheckUtils]: 27: Hoare triple {23107#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23108#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:53,270 INFO L273 TraceCheckUtils]: 28: Hoare triple {23108#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23108#(<= main_~i~1 11)} is VALID [2018-11-23 12:17:53,271 INFO L273 TraceCheckUtils]: 29: Hoare triple {23108#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23109#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:53,272 INFO L273 TraceCheckUtils]: 30: Hoare triple {23109#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23109#(<= main_~i~1 12)} is VALID [2018-11-23 12:17:53,272 INFO L273 TraceCheckUtils]: 31: Hoare triple {23109#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23110#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:53,273 INFO L273 TraceCheckUtils]: 32: Hoare triple {23110#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23110#(<= main_~i~1 13)} is VALID [2018-11-23 12:17:53,273 INFO L273 TraceCheckUtils]: 33: Hoare triple {23110#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23111#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:53,274 INFO L273 TraceCheckUtils]: 34: Hoare triple {23111#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23111#(<= main_~i~1 14)} is VALID [2018-11-23 12:17:53,275 INFO L273 TraceCheckUtils]: 35: Hoare triple {23111#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23112#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:53,275 INFO L273 TraceCheckUtils]: 36: Hoare triple {23112#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23112#(<= main_~i~1 15)} is VALID [2018-11-23 12:17:53,276 INFO L273 TraceCheckUtils]: 37: Hoare triple {23112#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23113#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:53,276 INFO L273 TraceCheckUtils]: 38: Hoare triple {23113#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23113#(<= main_~i~1 16)} is VALID [2018-11-23 12:17:53,277 INFO L273 TraceCheckUtils]: 39: Hoare triple {23113#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23114#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:53,277 INFO L273 TraceCheckUtils]: 40: Hoare triple {23114#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23114#(<= main_~i~1 17)} is VALID [2018-11-23 12:17:53,278 INFO L273 TraceCheckUtils]: 41: Hoare triple {23114#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23115#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:53,279 INFO L273 TraceCheckUtils]: 42: Hoare triple {23115#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23115#(<= main_~i~1 18)} is VALID [2018-11-23 12:17:53,279 INFO L273 TraceCheckUtils]: 43: Hoare triple {23115#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23116#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:53,280 INFO L273 TraceCheckUtils]: 44: Hoare triple {23116#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23116#(<= main_~i~1 19)} is VALID [2018-11-23 12:17:53,280 INFO L273 TraceCheckUtils]: 45: Hoare triple {23116#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23117#(<= main_~i~1 20)} is VALID [2018-11-23 12:17:53,281 INFO L273 TraceCheckUtils]: 46: Hoare triple {23117#(<= main_~i~1 20)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23117#(<= main_~i~1 20)} is VALID [2018-11-23 12:17:53,282 INFO L273 TraceCheckUtils]: 47: Hoare triple {23117#(<= main_~i~1 20)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23118#(<= main_~i~1 21)} is VALID [2018-11-23 12:17:53,282 INFO L273 TraceCheckUtils]: 48: Hoare triple {23118#(<= main_~i~1 21)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23118#(<= main_~i~1 21)} is VALID [2018-11-23 12:17:53,283 INFO L273 TraceCheckUtils]: 49: Hoare triple {23118#(<= main_~i~1 21)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23119#(<= main_~i~1 22)} is VALID [2018-11-23 12:17:53,283 INFO L273 TraceCheckUtils]: 50: Hoare triple {23119#(<= main_~i~1 22)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23119#(<= main_~i~1 22)} is VALID [2018-11-23 12:17:53,284 INFO L273 TraceCheckUtils]: 51: Hoare triple {23119#(<= main_~i~1 22)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23120#(<= main_~i~1 23)} is VALID [2018-11-23 12:17:53,284 INFO L273 TraceCheckUtils]: 52: Hoare triple {23120#(<= main_~i~1 23)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23120#(<= main_~i~1 23)} is VALID [2018-11-23 12:17:53,285 INFO L273 TraceCheckUtils]: 53: Hoare triple {23120#(<= main_~i~1 23)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23121#(<= main_~i~1 24)} is VALID [2018-11-23 12:17:53,286 INFO L273 TraceCheckUtils]: 54: Hoare triple {23121#(<= main_~i~1 24)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23121#(<= main_~i~1 24)} is VALID [2018-11-23 12:17:53,286 INFO L273 TraceCheckUtils]: 55: Hoare triple {23121#(<= main_~i~1 24)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23122#(<= main_~i~1 25)} is VALID [2018-11-23 12:17:53,287 INFO L273 TraceCheckUtils]: 56: Hoare triple {23122#(<= main_~i~1 25)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23122#(<= main_~i~1 25)} is VALID [2018-11-23 12:17:53,287 INFO L273 TraceCheckUtils]: 57: Hoare triple {23122#(<= main_~i~1 25)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23123#(<= main_~i~1 26)} is VALID [2018-11-23 12:17:53,288 INFO L273 TraceCheckUtils]: 58: Hoare triple {23123#(<= main_~i~1 26)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23123#(<= main_~i~1 26)} is VALID [2018-11-23 12:17:53,289 INFO L273 TraceCheckUtils]: 59: Hoare triple {23123#(<= main_~i~1 26)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23124#(<= main_~i~1 27)} is VALID [2018-11-23 12:17:53,289 INFO L273 TraceCheckUtils]: 60: Hoare triple {23124#(<= main_~i~1 27)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23124#(<= main_~i~1 27)} is VALID [2018-11-23 12:17:53,290 INFO L273 TraceCheckUtils]: 61: Hoare triple {23124#(<= main_~i~1 27)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23125#(<= main_~i~1 28)} is VALID [2018-11-23 12:17:53,290 INFO L273 TraceCheckUtils]: 62: Hoare triple {23125#(<= main_~i~1 28)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23125#(<= main_~i~1 28)} is VALID [2018-11-23 12:17:53,291 INFO L273 TraceCheckUtils]: 63: Hoare triple {23125#(<= main_~i~1 28)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23126#(<= main_~i~1 29)} is VALID [2018-11-23 12:17:53,292 INFO L273 TraceCheckUtils]: 64: Hoare triple {23126#(<= main_~i~1 29)} assume !(~i~1 < 60); {23096#false} is VALID [2018-11-23 12:17:53,292 INFO L256 TraceCheckUtils]: 65: Hoare triple {23096#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {23095#true} is VALID [2018-11-23 12:17:53,292 INFO L273 TraceCheckUtils]: 66: Hoare triple {23095#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {23095#true} is VALID [2018-11-23 12:17:53,292 INFO L273 TraceCheckUtils]: 67: Hoare triple {23095#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23095#true} is VALID [2018-11-23 12:17:53,292 INFO L273 TraceCheckUtils]: 68: Hoare triple {23095#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23095#true} is VALID [2018-11-23 12:17:53,292 INFO L273 TraceCheckUtils]: 69: Hoare triple {23095#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23095#true} is VALID [2018-11-23 12:17:53,293 INFO L273 TraceCheckUtils]: 70: Hoare triple {23095#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23095#true} is VALID [2018-11-23 12:17:53,293 INFO L273 TraceCheckUtils]: 71: Hoare triple {23095#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23095#true} is VALID [2018-11-23 12:17:53,293 INFO L273 TraceCheckUtils]: 72: Hoare triple {23095#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23095#true} is VALID [2018-11-23 12:17:53,293 INFO L273 TraceCheckUtils]: 73: Hoare triple {23095#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23095#true} is VALID [2018-11-23 12:17:53,293 INFO L273 TraceCheckUtils]: 74: Hoare triple {23095#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23095#true} is VALID [2018-11-23 12:17:53,293 INFO L273 TraceCheckUtils]: 75: Hoare triple {23095#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23095#true} is VALID [2018-11-23 12:17:53,294 INFO L273 TraceCheckUtils]: 76: Hoare triple {23095#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23095#true} is VALID [2018-11-23 12:17:53,294 INFO L273 TraceCheckUtils]: 77: Hoare triple {23095#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23095#true} is VALID [2018-11-23 12:17:53,294 INFO L273 TraceCheckUtils]: 78: Hoare triple {23095#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23095#true} is VALID [2018-11-23 12:17:53,294 INFO L273 TraceCheckUtils]: 79: Hoare triple {23095#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23095#true} is VALID [2018-11-23 12:17:53,294 INFO L273 TraceCheckUtils]: 80: Hoare triple {23095#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23095#true} is VALID [2018-11-23 12:17:53,294 INFO L273 TraceCheckUtils]: 81: Hoare triple {23095#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23095#true} is VALID [2018-11-23 12:17:53,295 INFO L273 TraceCheckUtils]: 82: Hoare triple {23095#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23095#true} is VALID [2018-11-23 12:17:53,295 INFO L273 TraceCheckUtils]: 83: Hoare triple {23095#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23095#true} is VALID [2018-11-23 12:17:53,295 INFO L273 TraceCheckUtils]: 84: Hoare triple {23095#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23095#true} is VALID [2018-11-23 12:17:53,295 INFO L273 TraceCheckUtils]: 85: Hoare triple {23095#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23095#true} is VALID [2018-11-23 12:17:53,295 INFO L273 TraceCheckUtils]: 86: Hoare triple {23095#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23095#true} is VALID [2018-11-23 12:17:53,295 INFO L273 TraceCheckUtils]: 87: Hoare triple {23095#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23095#true} is VALID [2018-11-23 12:17:53,295 INFO L273 TraceCheckUtils]: 88: Hoare triple {23095#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23095#true} is VALID [2018-11-23 12:17:53,296 INFO L273 TraceCheckUtils]: 89: Hoare triple {23095#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23095#true} is VALID [2018-11-23 12:17:53,296 INFO L273 TraceCheckUtils]: 90: Hoare triple {23095#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23095#true} is VALID [2018-11-23 12:17:53,296 INFO L273 TraceCheckUtils]: 91: Hoare triple {23095#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23095#true} is VALID [2018-11-23 12:17:53,296 INFO L273 TraceCheckUtils]: 92: Hoare triple {23095#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23095#true} is VALID [2018-11-23 12:17:53,296 INFO L273 TraceCheckUtils]: 93: Hoare triple {23095#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23095#true} is VALID [2018-11-23 12:17:53,296 INFO L273 TraceCheckUtils]: 94: Hoare triple {23095#true} assume !(~i~0 < 60); {23095#true} is VALID [2018-11-23 12:17:53,296 INFO L273 TraceCheckUtils]: 95: Hoare triple {23095#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {23095#true} is VALID [2018-11-23 12:17:53,296 INFO L273 TraceCheckUtils]: 96: Hoare triple {23095#true} assume true; {23095#true} is VALID [2018-11-23 12:17:53,296 INFO L268 TraceCheckUtils]: 97: Hoare quadruple {23095#true} {23096#false} #75#return; {23096#false} is VALID [2018-11-23 12:17:53,296 INFO L273 TraceCheckUtils]: 98: Hoare triple {23096#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {23096#false} is VALID [2018-11-23 12:17:53,297 INFO L256 TraceCheckUtils]: 99: Hoare triple {23096#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {23095#true} is VALID [2018-11-23 12:17:53,297 INFO L273 TraceCheckUtils]: 100: Hoare triple {23095#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {23095#true} is VALID [2018-11-23 12:17:53,297 INFO L273 TraceCheckUtils]: 101: Hoare triple {23095#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23095#true} is VALID [2018-11-23 12:17:53,297 INFO L273 TraceCheckUtils]: 102: Hoare triple {23095#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23095#true} is VALID [2018-11-23 12:17:53,297 INFO L273 TraceCheckUtils]: 103: Hoare triple {23095#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23095#true} is VALID [2018-11-23 12:17:53,297 INFO L273 TraceCheckUtils]: 104: Hoare triple {23095#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23095#true} is VALID [2018-11-23 12:17:53,297 INFO L273 TraceCheckUtils]: 105: Hoare triple {23095#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23095#true} is VALID [2018-11-23 12:17:53,297 INFO L273 TraceCheckUtils]: 106: Hoare triple {23095#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23095#true} is VALID [2018-11-23 12:17:53,297 INFO L273 TraceCheckUtils]: 107: Hoare triple {23095#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23095#true} is VALID [2018-11-23 12:17:53,298 INFO L273 TraceCheckUtils]: 108: Hoare triple {23095#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23095#true} is VALID [2018-11-23 12:17:53,298 INFO L273 TraceCheckUtils]: 109: Hoare triple {23095#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23095#true} is VALID [2018-11-23 12:17:53,298 INFO L273 TraceCheckUtils]: 110: Hoare triple {23095#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23095#true} is VALID [2018-11-23 12:17:53,298 INFO L273 TraceCheckUtils]: 111: Hoare triple {23095#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23095#true} is VALID [2018-11-23 12:17:53,298 INFO L273 TraceCheckUtils]: 112: Hoare triple {23095#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23095#true} is VALID [2018-11-23 12:17:53,298 INFO L273 TraceCheckUtils]: 113: Hoare triple {23095#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23095#true} is VALID [2018-11-23 12:17:53,298 INFO L273 TraceCheckUtils]: 114: Hoare triple {23095#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23095#true} is VALID [2018-11-23 12:17:53,298 INFO L273 TraceCheckUtils]: 115: Hoare triple {23095#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23095#true} is VALID [2018-11-23 12:17:53,298 INFO L273 TraceCheckUtils]: 116: Hoare triple {23095#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23095#true} is VALID [2018-11-23 12:17:53,298 INFO L273 TraceCheckUtils]: 117: Hoare triple {23095#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23095#true} is VALID [2018-11-23 12:17:53,299 INFO L273 TraceCheckUtils]: 118: Hoare triple {23095#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23095#true} is VALID [2018-11-23 12:17:53,299 INFO L273 TraceCheckUtils]: 119: Hoare triple {23095#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23095#true} is VALID [2018-11-23 12:17:53,299 INFO L273 TraceCheckUtils]: 120: Hoare triple {23095#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23095#true} is VALID [2018-11-23 12:17:53,299 INFO L273 TraceCheckUtils]: 121: Hoare triple {23095#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23095#true} is VALID [2018-11-23 12:17:53,299 INFO L273 TraceCheckUtils]: 122: Hoare triple {23095#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23095#true} is VALID [2018-11-23 12:17:53,299 INFO L273 TraceCheckUtils]: 123: Hoare triple {23095#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23095#true} is VALID [2018-11-23 12:17:53,299 INFO L273 TraceCheckUtils]: 124: Hoare triple {23095#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23095#true} is VALID [2018-11-23 12:17:53,299 INFO L273 TraceCheckUtils]: 125: Hoare triple {23095#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23095#true} is VALID [2018-11-23 12:17:53,299 INFO L273 TraceCheckUtils]: 126: Hoare triple {23095#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23095#true} is VALID [2018-11-23 12:17:53,299 INFO L273 TraceCheckUtils]: 127: Hoare triple {23095#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23095#true} is VALID [2018-11-23 12:17:53,300 INFO L273 TraceCheckUtils]: 128: Hoare triple {23095#true} assume !(~i~0 < 60); {23095#true} is VALID [2018-11-23 12:17:53,300 INFO L273 TraceCheckUtils]: 129: Hoare triple {23095#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {23095#true} is VALID [2018-11-23 12:17:53,300 INFO L273 TraceCheckUtils]: 130: Hoare triple {23095#true} assume true; {23095#true} is VALID [2018-11-23 12:17:53,300 INFO L268 TraceCheckUtils]: 131: Hoare quadruple {23095#true} {23096#false} #77#return; {23096#false} is VALID [2018-11-23 12:17:53,300 INFO L273 TraceCheckUtils]: 132: Hoare triple {23096#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {23096#false} is VALID [2018-11-23 12:17:53,300 INFO L273 TraceCheckUtils]: 133: Hoare triple {23096#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {23096#false} is VALID [2018-11-23 12:17:53,300 INFO L273 TraceCheckUtils]: 134: Hoare triple {23096#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {23096#false} is VALID [2018-11-23 12:17:53,300 INFO L273 TraceCheckUtils]: 135: Hoare triple {23096#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {23096#false} is VALID [2018-11-23 12:17:53,300 INFO L273 TraceCheckUtils]: 136: Hoare triple {23096#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {23096#false} is VALID [2018-11-23 12:17:53,301 INFO L273 TraceCheckUtils]: 137: Hoare triple {23096#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {23096#false} is VALID [2018-11-23 12:17:53,301 INFO L273 TraceCheckUtils]: 138: Hoare triple {23096#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {23096#false} is VALID [2018-11-23 12:17:53,301 INFO L273 TraceCheckUtils]: 139: Hoare triple {23096#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {23096#false} is VALID [2018-11-23 12:17:53,301 INFO L273 TraceCheckUtils]: 140: Hoare triple {23096#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {23096#false} is VALID [2018-11-23 12:17:53,301 INFO L273 TraceCheckUtils]: 141: Hoare triple {23096#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {23096#false} is VALID [2018-11-23 12:17:53,301 INFO L273 TraceCheckUtils]: 142: Hoare triple {23096#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {23096#false} is VALID [2018-11-23 12:17:53,301 INFO L273 TraceCheckUtils]: 143: Hoare triple {23096#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {23096#false} is VALID [2018-11-23 12:17:53,301 INFO L273 TraceCheckUtils]: 144: Hoare triple {23096#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {23096#false} is VALID [2018-11-23 12:17:53,301 INFO L273 TraceCheckUtils]: 145: Hoare triple {23096#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {23096#false} is VALID [2018-11-23 12:17:53,302 INFO L273 TraceCheckUtils]: 146: Hoare triple {23096#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {23096#false} is VALID [2018-11-23 12:17:53,302 INFO L273 TraceCheckUtils]: 147: Hoare triple {23096#false} assume !(~i~2 < 59); {23096#false} is VALID [2018-11-23 12:17:53,302 INFO L273 TraceCheckUtils]: 148: Hoare triple {23096#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {23096#false} is VALID [2018-11-23 12:17:53,302 INFO L256 TraceCheckUtils]: 149: Hoare triple {23096#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {23095#true} is VALID [2018-11-23 12:17:53,302 INFO L273 TraceCheckUtils]: 150: Hoare triple {23095#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {23095#true} is VALID [2018-11-23 12:17:53,302 INFO L273 TraceCheckUtils]: 151: Hoare triple {23095#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23095#true} is VALID [2018-11-23 12:17:53,302 INFO L273 TraceCheckUtils]: 152: Hoare triple {23095#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23095#true} is VALID [2018-11-23 12:17:53,302 INFO L273 TraceCheckUtils]: 153: Hoare triple {23095#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23095#true} is VALID [2018-11-23 12:17:53,303 INFO L273 TraceCheckUtils]: 154: Hoare triple {23095#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23095#true} is VALID [2018-11-23 12:17:53,303 INFO L273 TraceCheckUtils]: 155: Hoare triple {23095#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23095#true} is VALID [2018-11-23 12:17:53,303 INFO L273 TraceCheckUtils]: 156: Hoare triple {23095#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23095#true} is VALID [2018-11-23 12:17:53,303 INFO L273 TraceCheckUtils]: 157: Hoare triple {23095#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23095#true} is VALID [2018-11-23 12:17:53,303 INFO L273 TraceCheckUtils]: 158: Hoare triple {23095#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23095#true} is VALID [2018-11-23 12:17:53,303 INFO L273 TraceCheckUtils]: 159: Hoare triple {23095#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23095#true} is VALID [2018-11-23 12:17:53,304 INFO L273 TraceCheckUtils]: 160: Hoare triple {23095#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23095#true} is VALID [2018-11-23 12:17:53,304 INFO L273 TraceCheckUtils]: 161: Hoare triple {23095#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23095#true} is VALID [2018-11-23 12:17:53,304 INFO L273 TraceCheckUtils]: 162: Hoare triple {23095#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23095#true} is VALID [2018-11-23 12:17:53,304 INFO L273 TraceCheckUtils]: 163: Hoare triple {23095#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23095#true} is VALID [2018-11-23 12:17:53,304 INFO L273 TraceCheckUtils]: 164: Hoare triple {23095#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23095#true} is VALID [2018-11-23 12:17:53,304 INFO L273 TraceCheckUtils]: 165: Hoare triple {23095#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23095#true} is VALID [2018-11-23 12:17:53,305 INFO L273 TraceCheckUtils]: 166: Hoare triple {23095#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23095#true} is VALID [2018-11-23 12:17:53,305 INFO L273 TraceCheckUtils]: 167: Hoare triple {23095#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23095#true} is VALID [2018-11-23 12:17:53,305 INFO L273 TraceCheckUtils]: 168: Hoare triple {23095#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23095#true} is VALID [2018-11-23 12:17:53,305 INFO L273 TraceCheckUtils]: 169: Hoare triple {23095#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23095#true} is VALID [2018-11-23 12:17:53,305 INFO L273 TraceCheckUtils]: 170: Hoare triple {23095#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23095#true} is VALID [2018-11-23 12:17:53,305 INFO L273 TraceCheckUtils]: 171: Hoare triple {23095#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23095#true} is VALID [2018-11-23 12:17:53,305 INFO L273 TraceCheckUtils]: 172: Hoare triple {23095#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23095#true} is VALID [2018-11-23 12:17:53,306 INFO L273 TraceCheckUtils]: 173: Hoare triple {23095#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23095#true} is VALID [2018-11-23 12:17:53,306 INFO L273 TraceCheckUtils]: 174: Hoare triple {23095#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23095#true} is VALID [2018-11-23 12:17:53,306 INFO L273 TraceCheckUtils]: 175: Hoare triple {23095#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23095#true} is VALID [2018-11-23 12:17:53,306 INFO L273 TraceCheckUtils]: 176: Hoare triple {23095#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23095#true} is VALID [2018-11-23 12:17:53,306 INFO L273 TraceCheckUtils]: 177: Hoare triple {23095#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23095#true} is VALID [2018-11-23 12:17:53,306 INFO L273 TraceCheckUtils]: 178: Hoare triple {23095#true} assume !(~i~0 < 60); {23095#true} is VALID [2018-11-23 12:17:53,307 INFO L273 TraceCheckUtils]: 179: Hoare triple {23095#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {23095#true} is VALID [2018-11-23 12:17:53,307 INFO L273 TraceCheckUtils]: 180: Hoare triple {23095#true} assume true; {23095#true} is VALID [2018-11-23 12:17:53,307 INFO L268 TraceCheckUtils]: 181: Hoare quadruple {23095#true} {23096#false} #79#return; {23096#false} is VALID [2018-11-23 12:17:53,307 INFO L273 TraceCheckUtils]: 182: Hoare triple {23096#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {23096#false} is VALID [2018-11-23 12:17:53,307 INFO L273 TraceCheckUtils]: 183: Hoare triple {23096#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {23096#false} is VALID [2018-11-23 12:17:53,307 INFO L273 TraceCheckUtils]: 184: Hoare triple {23096#false} assume !false; {23096#false} is VALID [2018-11-23 12:17:53,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2039 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 1198 trivial. 0 not checked. [2018-11-23 12:17:53,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:53,332 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:17:53,350 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:18:16,336 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2018-11-23 12:18:16,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:18:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:18:16,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:18:16,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {23095#true} call ULTIMATE.init(); {23095#true} is VALID [2018-11-23 12:18:16,940 INFO L273 TraceCheckUtils]: 1: Hoare triple {23095#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23095#true} is VALID [2018-11-23 12:18:16,940 INFO L273 TraceCheckUtils]: 2: Hoare triple {23095#true} assume true; {23095#true} is VALID [2018-11-23 12:18:16,941 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23095#true} {23095#true} #71#return; {23095#true} is VALID [2018-11-23 12:18:16,941 INFO L256 TraceCheckUtils]: 4: Hoare triple {23095#true} call #t~ret14 := main(); {23095#true} is VALID [2018-11-23 12:18:16,941 INFO L273 TraceCheckUtils]: 5: Hoare triple {23095#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {23095#true} is VALID [2018-11-23 12:18:16,941 INFO L273 TraceCheckUtils]: 6: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,941 INFO L273 TraceCheckUtils]: 7: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,941 INFO L273 TraceCheckUtils]: 8: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,942 INFO L273 TraceCheckUtils]: 9: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,942 INFO L273 TraceCheckUtils]: 10: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,942 INFO L273 TraceCheckUtils]: 11: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,942 INFO L273 TraceCheckUtils]: 12: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,942 INFO L273 TraceCheckUtils]: 13: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,943 INFO L273 TraceCheckUtils]: 14: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,943 INFO L273 TraceCheckUtils]: 15: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,943 INFO L273 TraceCheckUtils]: 16: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,943 INFO L273 TraceCheckUtils]: 17: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,943 INFO L273 TraceCheckUtils]: 18: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,943 INFO L273 TraceCheckUtils]: 19: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,944 INFO L273 TraceCheckUtils]: 20: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,944 INFO L273 TraceCheckUtils]: 21: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,944 INFO L273 TraceCheckUtils]: 22: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,944 INFO L273 TraceCheckUtils]: 23: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,944 INFO L273 TraceCheckUtils]: 24: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,945 INFO L273 TraceCheckUtils]: 25: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,945 INFO L273 TraceCheckUtils]: 26: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,945 INFO L273 TraceCheckUtils]: 27: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,945 INFO L273 TraceCheckUtils]: 28: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,945 INFO L273 TraceCheckUtils]: 29: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,945 INFO L273 TraceCheckUtils]: 30: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,946 INFO L273 TraceCheckUtils]: 31: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,946 INFO L273 TraceCheckUtils]: 32: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,946 INFO L273 TraceCheckUtils]: 33: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,946 INFO L273 TraceCheckUtils]: 34: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,946 INFO L273 TraceCheckUtils]: 35: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,946 INFO L273 TraceCheckUtils]: 36: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,946 INFO L273 TraceCheckUtils]: 37: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,946 INFO L273 TraceCheckUtils]: 38: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,946 INFO L273 TraceCheckUtils]: 39: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,947 INFO L273 TraceCheckUtils]: 40: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,947 INFO L273 TraceCheckUtils]: 41: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,947 INFO L273 TraceCheckUtils]: 42: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,947 INFO L273 TraceCheckUtils]: 43: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,947 INFO L273 TraceCheckUtils]: 44: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,947 INFO L273 TraceCheckUtils]: 45: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,947 INFO L273 TraceCheckUtils]: 46: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,947 INFO L273 TraceCheckUtils]: 47: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,947 INFO L273 TraceCheckUtils]: 48: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,947 INFO L273 TraceCheckUtils]: 49: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,948 INFO L273 TraceCheckUtils]: 50: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,948 INFO L273 TraceCheckUtils]: 51: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,948 INFO L273 TraceCheckUtils]: 52: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,948 INFO L273 TraceCheckUtils]: 53: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,948 INFO L273 TraceCheckUtils]: 54: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,948 INFO L273 TraceCheckUtils]: 55: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,948 INFO L273 TraceCheckUtils]: 56: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,948 INFO L273 TraceCheckUtils]: 57: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,948 INFO L273 TraceCheckUtils]: 58: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,949 INFO L273 TraceCheckUtils]: 59: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,949 INFO L273 TraceCheckUtils]: 60: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,949 INFO L273 TraceCheckUtils]: 61: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,949 INFO L273 TraceCheckUtils]: 62: Hoare triple {23095#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {23095#true} is VALID [2018-11-23 12:18:16,949 INFO L273 TraceCheckUtils]: 63: Hoare triple {23095#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23095#true} is VALID [2018-11-23 12:18:16,949 INFO L273 TraceCheckUtils]: 64: Hoare triple {23095#true} assume !(~i~1 < 60); {23095#true} is VALID [2018-11-23 12:18:16,949 INFO L256 TraceCheckUtils]: 65: Hoare triple {23095#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {23095#true} is VALID [2018-11-23 12:18:16,950 INFO L273 TraceCheckUtils]: 66: Hoare triple {23095#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {23328#(<= sep_~i~0 0)} is VALID [2018-11-23 12:18:16,950 INFO L273 TraceCheckUtils]: 67: Hoare triple {23328#(<= sep_~i~0 0)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23328#(<= sep_~i~0 0)} is VALID [2018-11-23 12:18:16,950 INFO L273 TraceCheckUtils]: 68: Hoare triple {23328#(<= sep_~i~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23328#(<= sep_~i~0 0)} is VALID [2018-11-23 12:18:16,951 INFO L273 TraceCheckUtils]: 69: Hoare triple {23328#(<= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23338#(<= sep_~i~0 1)} is VALID [2018-11-23 12:18:16,951 INFO L273 TraceCheckUtils]: 70: Hoare triple {23338#(<= sep_~i~0 1)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23338#(<= sep_~i~0 1)} is VALID [2018-11-23 12:18:16,951 INFO L273 TraceCheckUtils]: 71: Hoare triple {23338#(<= sep_~i~0 1)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23338#(<= sep_~i~0 1)} is VALID [2018-11-23 12:18:16,952 INFO L273 TraceCheckUtils]: 72: Hoare triple {23338#(<= sep_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23348#(<= sep_~i~0 2)} is VALID [2018-11-23 12:18:16,952 INFO L273 TraceCheckUtils]: 73: Hoare triple {23348#(<= sep_~i~0 2)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23348#(<= sep_~i~0 2)} is VALID [2018-11-23 12:18:16,952 INFO L273 TraceCheckUtils]: 74: Hoare triple {23348#(<= sep_~i~0 2)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23348#(<= sep_~i~0 2)} is VALID [2018-11-23 12:18:16,953 INFO L273 TraceCheckUtils]: 75: Hoare triple {23348#(<= sep_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23358#(<= sep_~i~0 3)} is VALID [2018-11-23 12:18:16,953 INFO L273 TraceCheckUtils]: 76: Hoare triple {23358#(<= sep_~i~0 3)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23358#(<= sep_~i~0 3)} is VALID [2018-11-23 12:18:16,954 INFO L273 TraceCheckUtils]: 77: Hoare triple {23358#(<= sep_~i~0 3)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23358#(<= sep_~i~0 3)} is VALID [2018-11-23 12:18:16,955 INFO L273 TraceCheckUtils]: 78: Hoare triple {23358#(<= sep_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23368#(<= sep_~i~0 4)} is VALID [2018-11-23 12:18:16,955 INFO L273 TraceCheckUtils]: 79: Hoare triple {23368#(<= sep_~i~0 4)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23368#(<= sep_~i~0 4)} is VALID [2018-11-23 12:18:16,956 INFO L273 TraceCheckUtils]: 80: Hoare triple {23368#(<= sep_~i~0 4)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23368#(<= sep_~i~0 4)} is VALID [2018-11-23 12:18:16,956 INFO L273 TraceCheckUtils]: 81: Hoare triple {23368#(<= sep_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23378#(<= sep_~i~0 5)} is VALID [2018-11-23 12:18:16,957 INFO L273 TraceCheckUtils]: 82: Hoare triple {23378#(<= sep_~i~0 5)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23378#(<= sep_~i~0 5)} is VALID [2018-11-23 12:18:16,957 INFO L273 TraceCheckUtils]: 83: Hoare triple {23378#(<= sep_~i~0 5)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23378#(<= sep_~i~0 5)} is VALID [2018-11-23 12:18:16,958 INFO L273 TraceCheckUtils]: 84: Hoare triple {23378#(<= sep_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23388#(<= sep_~i~0 6)} is VALID [2018-11-23 12:18:16,959 INFO L273 TraceCheckUtils]: 85: Hoare triple {23388#(<= sep_~i~0 6)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23388#(<= sep_~i~0 6)} is VALID [2018-11-23 12:18:16,959 INFO L273 TraceCheckUtils]: 86: Hoare triple {23388#(<= sep_~i~0 6)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23388#(<= sep_~i~0 6)} is VALID [2018-11-23 12:18:16,960 INFO L273 TraceCheckUtils]: 87: Hoare triple {23388#(<= sep_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23398#(<= sep_~i~0 7)} is VALID [2018-11-23 12:18:16,960 INFO L273 TraceCheckUtils]: 88: Hoare triple {23398#(<= sep_~i~0 7)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23398#(<= sep_~i~0 7)} is VALID [2018-11-23 12:18:16,961 INFO L273 TraceCheckUtils]: 89: Hoare triple {23398#(<= sep_~i~0 7)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23398#(<= sep_~i~0 7)} is VALID [2018-11-23 12:18:16,962 INFO L273 TraceCheckUtils]: 90: Hoare triple {23398#(<= sep_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23408#(<= sep_~i~0 8)} is VALID [2018-11-23 12:18:16,962 INFO L273 TraceCheckUtils]: 91: Hoare triple {23408#(<= sep_~i~0 8)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23408#(<= sep_~i~0 8)} is VALID [2018-11-23 12:18:16,963 INFO L273 TraceCheckUtils]: 92: Hoare triple {23408#(<= sep_~i~0 8)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23408#(<= sep_~i~0 8)} is VALID [2018-11-23 12:18:16,963 INFO L273 TraceCheckUtils]: 93: Hoare triple {23408#(<= sep_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23418#(<= sep_~i~0 9)} is VALID [2018-11-23 12:18:16,964 INFO L273 TraceCheckUtils]: 94: Hoare triple {23418#(<= sep_~i~0 9)} assume !(~i~0 < 60); {23096#false} is VALID [2018-11-23 12:18:16,964 INFO L273 TraceCheckUtils]: 95: Hoare triple {23096#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {23096#false} is VALID [2018-11-23 12:18:16,964 INFO L273 TraceCheckUtils]: 96: Hoare triple {23096#false} assume true; {23096#false} is VALID [2018-11-23 12:18:16,965 INFO L268 TraceCheckUtils]: 97: Hoare quadruple {23096#false} {23095#true} #75#return; {23096#false} is VALID [2018-11-23 12:18:16,965 INFO L273 TraceCheckUtils]: 98: Hoare triple {23096#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {23096#false} is VALID [2018-11-23 12:18:16,965 INFO L256 TraceCheckUtils]: 99: Hoare triple {23096#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {23096#false} is VALID [2018-11-23 12:18:16,965 INFO L273 TraceCheckUtils]: 100: Hoare triple {23096#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {23096#false} is VALID [2018-11-23 12:18:16,965 INFO L273 TraceCheckUtils]: 101: Hoare triple {23096#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23096#false} is VALID [2018-11-23 12:18:16,965 INFO L273 TraceCheckUtils]: 102: Hoare triple {23096#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23096#false} is VALID [2018-11-23 12:18:16,966 INFO L273 TraceCheckUtils]: 103: Hoare triple {23096#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23096#false} is VALID [2018-11-23 12:18:16,966 INFO L273 TraceCheckUtils]: 104: Hoare triple {23096#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23096#false} is VALID [2018-11-23 12:18:16,966 INFO L273 TraceCheckUtils]: 105: Hoare triple {23096#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23096#false} is VALID [2018-11-23 12:18:16,966 INFO L273 TraceCheckUtils]: 106: Hoare triple {23096#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23096#false} is VALID [2018-11-23 12:18:16,966 INFO L273 TraceCheckUtils]: 107: Hoare triple {23096#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23096#false} is VALID [2018-11-23 12:18:16,966 INFO L273 TraceCheckUtils]: 108: Hoare triple {23096#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23096#false} is VALID [2018-11-23 12:18:16,967 INFO L273 TraceCheckUtils]: 109: Hoare triple {23096#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23096#false} is VALID [2018-11-23 12:18:16,967 INFO L273 TraceCheckUtils]: 110: Hoare triple {23096#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23096#false} is VALID [2018-11-23 12:18:16,967 INFO L273 TraceCheckUtils]: 111: Hoare triple {23096#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23096#false} is VALID [2018-11-23 12:18:16,967 INFO L273 TraceCheckUtils]: 112: Hoare triple {23096#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23096#false} is VALID [2018-11-23 12:18:16,967 INFO L273 TraceCheckUtils]: 113: Hoare triple {23096#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23096#false} is VALID [2018-11-23 12:18:16,967 INFO L273 TraceCheckUtils]: 114: Hoare triple {23096#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23096#false} is VALID [2018-11-23 12:18:16,967 INFO L273 TraceCheckUtils]: 115: Hoare triple {23096#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23096#false} is VALID [2018-11-23 12:18:16,967 INFO L273 TraceCheckUtils]: 116: Hoare triple {23096#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23096#false} is VALID [2018-11-23 12:18:16,968 INFO L273 TraceCheckUtils]: 117: Hoare triple {23096#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23096#false} is VALID [2018-11-23 12:18:16,968 INFO L273 TraceCheckUtils]: 118: Hoare triple {23096#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23096#false} is VALID [2018-11-23 12:18:16,968 INFO L273 TraceCheckUtils]: 119: Hoare triple {23096#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23096#false} is VALID [2018-11-23 12:18:16,968 INFO L273 TraceCheckUtils]: 120: Hoare triple {23096#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23096#false} is VALID [2018-11-23 12:18:16,968 INFO L273 TraceCheckUtils]: 121: Hoare triple {23096#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23096#false} is VALID [2018-11-23 12:18:16,968 INFO L273 TraceCheckUtils]: 122: Hoare triple {23096#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23096#false} is VALID [2018-11-23 12:18:16,968 INFO L273 TraceCheckUtils]: 123: Hoare triple {23096#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23096#false} is VALID [2018-11-23 12:18:16,968 INFO L273 TraceCheckUtils]: 124: Hoare triple {23096#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23096#false} is VALID [2018-11-23 12:18:16,968 INFO L273 TraceCheckUtils]: 125: Hoare triple {23096#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23096#false} is VALID [2018-11-23 12:18:16,968 INFO L273 TraceCheckUtils]: 126: Hoare triple {23096#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23096#false} is VALID [2018-11-23 12:18:16,969 INFO L273 TraceCheckUtils]: 127: Hoare triple {23096#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23096#false} is VALID [2018-11-23 12:18:16,969 INFO L273 TraceCheckUtils]: 128: Hoare triple {23096#false} assume !(~i~0 < 60); {23096#false} is VALID [2018-11-23 12:18:16,969 INFO L273 TraceCheckUtils]: 129: Hoare triple {23096#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {23096#false} is VALID [2018-11-23 12:18:16,969 INFO L273 TraceCheckUtils]: 130: Hoare triple {23096#false} assume true; {23096#false} is VALID [2018-11-23 12:18:16,969 INFO L268 TraceCheckUtils]: 131: Hoare quadruple {23096#false} {23096#false} #77#return; {23096#false} is VALID [2018-11-23 12:18:16,969 INFO L273 TraceCheckUtils]: 132: Hoare triple {23096#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {23096#false} is VALID [2018-11-23 12:18:16,969 INFO L273 TraceCheckUtils]: 133: Hoare triple {23096#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {23096#false} is VALID [2018-11-23 12:18:16,969 INFO L273 TraceCheckUtils]: 134: Hoare triple {23096#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {23096#false} is VALID [2018-11-23 12:18:16,969 INFO L273 TraceCheckUtils]: 135: Hoare triple {23096#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {23096#false} is VALID [2018-11-23 12:18:16,969 INFO L273 TraceCheckUtils]: 136: Hoare triple {23096#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {23096#false} is VALID [2018-11-23 12:18:16,970 INFO L273 TraceCheckUtils]: 137: Hoare triple {23096#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {23096#false} is VALID [2018-11-23 12:18:16,970 INFO L273 TraceCheckUtils]: 138: Hoare triple {23096#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {23096#false} is VALID [2018-11-23 12:18:16,970 INFO L273 TraceCheckUtils]: 139: Hoare triple {23096#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {23096#false} is VALID [2018-11-23 12:18:16,970 INFO L273 TraceCheckUtils]: 140: Hoare triple {23096#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {23096#false} is VALID [2018-11-23 12:18:16,970 INFO L273 TraceCheckUtils]: 141: Hoare triple {23096#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {23096#false} is VALID [2018-11-23 12:18:16,970 INFO L273 TraceCheckUtils]: 142: Hoare triple {23096#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {23096#false} is VALID [2018-11-23 12:18:16,970 INFO L273 TraceCheckUtils]: 143: Hoare triple {23096#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {23096#false} is VALID [2018-11-23 12:18:16,970 INFO L273 TraceCheckUtils]: 144: Hoare triple {23096#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {23096#false} is VALID [2018-11-23 12:18:16,970 INFO L273 TraceCheckUtils]: 145: Hoare triple {23096#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {23096#false} is VALID [2018-11-23 12:18:16,970 INFO L273 TraceCheckUtils]: 146: Hoare triple {23096#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {23096#false} is VALID [2018-11-23 12:18:16,971 INFO L273 TraceCheckUtils]: 147: Hoare triple {23096#false} assume !(~i~2 < 59); {23096#false} is VALID [2018-11-23 12:18:16,971 INFO L273 TraceCheckUtils]: 148: Hoare triple {23096#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {23096#false} is VALID [2018-11-23 12:18:16,971 INFO L256 TraceCheckUtils]: 149: Hoare triple {23096#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {23096#false} is VALID [2018-11-23 12:18:16,971 INFO L273 TraceCheckUtils]: 150: Hoare triple {23096#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {23096#false} is VALID [2018-11-23 12:18:16,971 INFO L273 TraceCheckUtils]: 151: Hoare triple {23096#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23096#false} is VALID [2018-11-23 12:18:16,971 INFO L273 TraceCheckUtils]: 152: Hoare triple {23096#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23096#false} is VALID [2018-11-23 12:18:16,971 INFO L273 TraceCheckUtils]: 153: Hoare triple {23096#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23096#false} is VALID [2018-11-23 12:18:16,971 INFO L273 TraceCheckUtils]: 154: Hoare triple {23096#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23096#false} is VALID [2018-11-23 12:18:16,971 INFO L273 TraceCheckUtils]: 155: Hoare triple {23096#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23096#false} is VALID [2018-11-23 12:18:16,971 INFO L273 TraceCheckUtils]: 156: Hoare triple {23096#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23096#false} is VALID [2018-11-23 12:18:16,972 INFO L273 TraceCheckUtils]: 157: Hoare triple {23096#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23096#false} is VALID [2018-11-23 12:18:16,972 INFO L273 TraceCheckUtils]: 158: Hoare triple {23096#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23096#false} is VALID [2018-11-23 12:18:16,972 INFO L273 TraceCheckUtils]: 159: Hoare triple {23096#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23096#false} is VALID [2018-11-23 12:18:16,972 INFO L273 TraceCheckUtils]: 160: Hoare triple {23096#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23096#false} is VALID [2018-11-23 12:18:16,972 INFO L273 TraceCheckUtils]: 161: Hoare triple {23096#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23096#false} is VALID [2018-11-23 12:18:16,972 INFO L273 TraceCheckUtils]: 162: Hoare triple {23096#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23096#false} is VALID [2018-11-23 12:18:16,972 INFO L273 TraceCheckUtils]: 163: Hoare triple {23096#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23096#false} is VALID [2018-11-23 12:18:16,972 INFO L273 TraceCheckUtils]: 164: Hoare triple {23096#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23096#false} is VALID [2018-11-23 12:18:16,972 INFO L273 TraceCheckUtils]: 165: Hoare triple {23096#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23096#false} is VALID [2018-11-23 12:18:16,972 INFO L273 TraceCheckUtils]: 166: Hoare triple {23096#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23096#false} is VALID [2018-11-23 12:18:16,973 INFO L273 TraceCheckUtils]: 167: Hoare triple {23096#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23096#false} is VALID [2018-11-23 12:18:16,973 INFO L273 TraceCheckUtils]: 168: Hoare triple {23096#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23096#false} is VALID [2018-11-23 12:18:16,973 INFO L273 TraceCheckUtils]: 169: Hoare triple {23096#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23096#false} is VALID [2018-11-23 12:18:16,973 INFO L273 TraceCheckUtils]: 170: Hoare triple {23096#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23096#false} is VALID [2018-11-23 12:18:16,973 INFO L273 TraceCheckUtils]: 171: Hoare triple {23096#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23096#false} is VALID [2018-11-23 12:18:16,973 INFO L273 TraceCheckUtils]: 172: Hoare triple {23096#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23096#false} is VALID [2018-11-23 12:18:16,973 INFO L273 TraceCheckUtils]: 173: Hoare triple {23096#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23096#false} is VALID [2018-11-23 12:18:16,973 INFO L273 TraceCheckUtils]: 174: Hoare triple {23096#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23096#false} is VALID [2018-11-23 12:18:16,973 INFO L273 TraceCheckUtils]: 175: Hoare triple {23096#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {23096#false} is VALID [2018-11-23 12:18:16,973 INFO L273 TraceCheckUtils]: 176: Hoare triple {23096#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {23096#false} is VALID [2018-11-23 12:18:16,974 INFO L273 TraceCheckUtils]: 177: Hoare triple {23096#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {23096#false} is VALID [2018-11-23 12:18:16,974 INFO L273 TraceCheckUtils]: 178: Hoare triple {23096#false} assume !(~i~0 < 60); {23096#false} is VALID [2018-11-23 12:18:16,974 INFO L273 TraceCheckUtils]: 179: Hoare triple {23096#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {23096#false} is VALID [2018-11-23 12:18:16,974 INFO L273 TraceCheckUtils]: 180: Hoare triple {23096#false} assume true; {23096#false} is VALID [2018-11-23 12:18:16,974 INFO L268 TraceCheckUtils]: 181: Hoare quadruple {23096#false} {23096#false} #79#return; {23096#false} is VALID [2018-11-23 12:18:16,974 INFO L273 TraceCheckUtils]: 182: Hoare triple {23096#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {23096#false} is VALID [2018-11-23 12:18:16,974 INFO L273 TraceCheckUtils]: 183: Hoare triple {23096#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {23096#false} is VALID [2018-11-23 12:18:16,974 INFO L273 TraceCheckUtils]: 184: Hoare triple {23096#false} assume !false; {23096#false} is VALID [2018-11-23 12:18:16,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2039 backedges. 526 proven. 117 refuted. 0 times theorem prover too weak. 1396 trivial. 0 not checked. [2018-11-23 12:18:17,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:18:17,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 12] total 42 [2018-11-23 12:18:17,012 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 185 [2018-11-23 12:18:17,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:18:17,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:18:17,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:18:17,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:18:17,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:18:17,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:18:17,152 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand 42 states. [2018-11-23 12:18:18,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:18,260 INFO L93 Difference]: Finished difference Result 187 states and 219 transitions. [2018-11-23 12:18:18,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:18:18,260 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 185 [2018-11-23 12:18:18,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:18:18,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:18:18,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 160 transitions. [2018-11-23 12:18:18,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:18:18,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 160 transitions. [2018-11-23 12:18:18,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 160 transitions. [2018-11-23 12:18:18,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:18:18,426 INFO L225 Difference]: With dead ends: 187 [2018-11-23 12:18:18,426 INFO L226 Difference]: Without dead ends: 130 [2018-11-23 12:18:18,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:18:18,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-23 12:18:18,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2018-11-23 12:18:18,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:18:18,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand 127 states. [2018-11-23 12:18:18,473 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 127 states. [2018-11-23 12:18:18,473 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 127 states. [2018-11-23 12:18:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:18,476 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2018-11-23 12:18:18,476 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 145 transitions. [2018-11-23 12:18:18,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:18:18,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:18:18,477 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 130 states. [2018-11-23 12:18:18,477 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 130 states. [2018-11-23 12:18:18,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:18,479 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2018-11-23 12:18:18,480 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 145 transitions. [2018-11-23 12:18:18,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:18:18,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:18:18,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:18:18,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:18:18,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-23 12:18:18,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 141 transitions. [2018-11-23 12:18:18,483 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 141 transitions. Word has length 185 [2018-11-23 12:18:18,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:18:18,483 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 141 transitions. [2018-11-23 12:18:18,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:18:18,483 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2018-11-23 12:18:18,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-23 12:18:18,484 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:18:18,485 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:18:18,485 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:18:18,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:18:18,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1389481148, now seen corresponding path program 30 times [2018-11-23 12:18:18,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:18:18,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:18:18,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:18,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:18:18,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:18:19,871 INFO L256 TraceCheckUtils]: 0: Hoare triple {24403#true} call ULTIMATE.init(); {24403#true} is VALID [2018-11-23 12:18:19,872 INFO L273 TraceCheckUtils]: 1: Hoare triple {24403#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24403#true} is VALID [2018-11-23 12:18:19,872 INFO L273 TraceCheckUtils]: 2: Hoare triple {24403#true} assume true; {24403#true} is VALID [2018-11-23 12:18:19,872 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24403#true} {24403#true} #71#return; {24403#true} is VALID [2018-11-23 12:18:19,872 INFO L256 TraceCheckUtils]: 4: Hoare triple {24403#true} call #t~ret14 := main(); {24403#true} is VALID [2018-11-23 12:18:19,873 INFO L273 TraceCheckUtils]: 5: Hoare triple {24403#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {24405#(= main_~i~1 0)} is VALID [2018-11-23 12:18:19,874 INFO L273 TraceCheckUtils]: 6: Hoare triple {24405#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24405#(= main_~i~1 0)} is VALID [2018-11-23 12:18:19,875 INFO L273 TraceCheckUtils]: 7: Hoare triple {24405#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24406#(<= main_~i~1 1)} is VALID [2018-11-23 12:18:19,883 INFO L273 TraceCheckUtils]: 8: Hoare triple {24406#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24406#(<= main_~i~1 1)} is VALID [2018-11-23 12:18:19,884 INFO L273 TraceCheckUtils]: 9: Hoare triple {24406#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24407#(<= main_~i~1 2)} is VALID [2018-11-23 12:18:19,886 INFO L273 TraceCheckUtils]: 10: Hoare triple {24407#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24407#(<= main_~i~1 2)} is VALID [2018-11-23 12:18:19,886 INFO L273 TraceCheckUtils]: 11: Hoare triple {24407#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24408#(<= main_~i~1 3)} is VALID [2018-11-23 12:18:19,888 INFO L273 TraceCheckUtils]: 12: Hoare triple {24408#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24408#(<= main_~i~1 3)} is VALID [2018-11-23 12:18:19,888 INFO L273 TraceCheckUtils]: 13: Hoare triple {24408#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24409#(<= main_~i~1 4)} is VALID [2018-11-23 12:18:19,890 INFO L273 TraceCheckUtils]: 14: Hoare triple {24409#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24409#(<= main_~i~1 4)} is VALID [2018-11-23 12:18:19,890 INFO L273 TraceCheckUtils]: 15: Hoare triple {24409#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24410#(<= main_~i~1 5)} is VALID [2018-11-23 12:18:19,892 INFO L273 TraceCheckUtils]: 16: Hoare triple {24410#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24410#(<= main_~i~1 5)} is VALID [2018-11-23 12:18:19,892 INFO L273 TraceCheckUtils]: 17: Hoare triple {24410#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24411#(<= main_~i~1 6)} is VALID [2018-11-23 12:18:19,894 INFO L273 TraceCheckUtils]: 18: Hoare triple {24411#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24411#(<= main_~i~1 6)} is VALID [2018-11-23 12:18:19,894 INFO L273 TraceCheckUtils]: 19: Hoare triple {24411#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24412#(<= main_~i~1 7)} is VALID [2018-11-23 12:18:19,894 INFO L273 TraceCheckUtils]: 20: Hoare triple {24412#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24412#(<= main_~i~1 7)} is VALID [2018-11-23 12:18:19,895 INFO L273 TraceCheckUtils]: 21: Hoare triple {24412#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24413#(<= main_~i~1 8)} is VALID [2018-11-23 12:18:19,896 INFO L273 TraceCheckUtils]: 22: Hoare triple {24413#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24413#(<= main_~i~1 8)} is VALID [2018-11-23 12:18:19,896 INFO L273 TraceCheckUtils]: 23: Hoare triple {24413#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24414#(<= main_~i~1 9)} is VALID [2018-11-23 12:18:19,898 INFO L273 TraceCheckUtils]: 24: Hoare triple {24414#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24414#(<= main_~i~1 9)} is VALID [2018-11-23 12:18:19,898 INFO L273 TraceCheckUtils]: 25: Hoare triple {24414#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24415#(<= main_~i~1 10)} is VALID [2018-11-23 12:18:19,900 INFO L273 TraceCheckUtils]: 26: Hoare triple {24415#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24415#(<= main_~i~1 10)} is VALID [2018-11-23 12:18:19,900 INFO L273 TraceCheckUtils]: 27: Hoare triple {24415#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24416#(<= main_~i~1 11)} is VALID [2018-11-23 12:18:19,902 INFO L273 TraceCheckUtils]: 28: Hoare triple {24416#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24416#(<= main_~i~1 11)} is VALID [2018-11-23 12:18:19,902 INFO L273 TraceCheckUtils]: 29: Hoare triple {24416#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24417#(<= main_~i~1 12)} is VALID [2018-11-23 12:18:19,904 INFO L273 TraceCheckUtils]: 30: Hoare triple {24417#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24417#(<= main_~i~1 12)} is VALID [2018-11-23 12:18:19,904 INFO L273 TraceCheckUtils]: 31: Hoare triple {24417#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24418#(<= main_~i~1 13)} is VALID [2018-11-23 12:18:19,906 INFO L273 TraceCheckUtils]: 32: Hoare triple {24418#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24418#(<= main_~i~1 13)} is VALID [2018-11-23 12:18:19,906 INFO L273 TraceCheckUtils]: 33: Hoare triple {24418#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24419#(<= main_~i~1 14)} is VALID [2018-11-23 12:18:19,908 INFO L273 TraceCheckUtils]: 34: Hoare triple {24419#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24419#(<= main_~i~1 14)} is VALID [2018-11-23 12:18:19,908 INFO L273 TraceCheckUtils]: 35: Hoare triple {24419#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24420#(<= main_~i~1 15)} is VALID [2018-11-23 12:18:19,910 INFO L273 TraceCheckUtils]: 36: Hoare triple {24420#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24420#(<= main_~i~1 15)} is VALID [2018-11-23 12:18:19,910 INFO L273 TraceCheckUtils]: 37: Hoare triple {24420#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24421#(<= main_~i~1 16)} is VALID [2018-11-23 12:18:19,912 INFO L273 TraceCheckUtils]: 38: Hoare triple {24421#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24421#(<= main_~i~1 16)} is VALID [2018-11-23 12:18:19,912 INFO L273 TraceCheckUtils]: 39: Hoare triple {24421#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24422#(<= main_~i~1 17)} is VALID [2018-11-23 12:18:19,914 INFO L273 TraceCheckUtils]: 40: Hoare triple {24422#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24422#(<= main_~i~1 17)} is VALID [2018-11-23 12:18:19,914 INFO L273 TraceCheckUtils]: 41: Hoare triple {24422#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24423#(<= main_~i~1 18)} is VALID [2018-11-23 12:18:19,916 INFO L273 TraceCheckUtils]: 42: Hoare triple {24423#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24423#(<= main_~i~1 18)} is VALID [2018-11-23 12:18:19,916 INFO L273 TraceCheckUtils]: 43: Hoare triple {24423#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24424#(<= main_~i~1 19)} is VALID [2018-11-23 12:18:19,918 INFO L273 TraceCheckUtils]: 44: Hoare triple {24424#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24424#(<= main_~i~1 19)} is VALID [2018-11-23 12:18:19,918 INFO L273 TraceCheckUtils]: 45: Hoare triple {24424#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24425#(<= main_~i~1 20)} is VALID [2018-11-23 12:18:19,920 INFO L273 TraceCheckUtils]: 46: Hoare triple {24425#(<= main_~i~1 20)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24425#(<= main_~i~1 20)} is VALID [2018-11-23 12:18:19,920 INFO L273 TraceCheckUtils]: 47: Hoare triple {24425#(<= main_~i~1 20)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24426#(<= main_~i~1 21)} is VALID [2018-11-23 12:18:19,922 INFO L273 TraceCheckUtils]: 48: Hoare triple {24426#(<= main_~i~1 21)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24426#(<= main_~i~1 21)} is VALID [2018-11-23 12:18:19,922 INFO L273 TraceCheckUtils]: 49: Hoare triple {24426#(<= main_~i~1 21)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24427#(<= main_~i~1 22)} is VALID [2018-11-23 12:18:19,924 INFO L273 TraceCheckUtils]: 50: Hoare triple {24427#(<= main_~i~1 22)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24427#(<= main_~i~1 22)} is VALID [2018-11-23 12:18:19,924 INFO L273 TraceCheckUtils]: 51: Hoare triple {24427#(<= main_~i~1 22)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24428#(<= main_~i~1 23)} is VALID [2018-11-23 12:18:19,926 INFO L273 TraceCheckUtils]: 52: Hoare triple {24428#(<= main_~i~1 23)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24428#(<= main_~i~1 23)} is VALID [2018-11-23 12:18:19,926 INFO L273 TraceCheckUtils]: 53: Hoare triple {24428#(<= main_~i~1 23)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24429#(<= main_~i~1 24)} is VALID [2018-11-23 12:18:19,928 INFO L273 TraceCheckUtils]: 54: Hoare triple {24429#(<= main_~i~1 24)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24429#(<= main_~i~1 24)} is VALID [2018-11-23 12:18:19,928 INFO L273 TraceCheckUtils]: 55: Hoare triple {24429#(<= main_~i~1 24)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24430#(<= main_~i~1 25)} is VALID [2018-11-23 12:18:19,930 INFO L273 TraceCheckUtils]: 56: Hoare triple {24430#(<= main_~i~1 25)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24430#(<= main_~i~1 25)} is VALID [2018-11-23 12:18:19,930 INFO L273 TraceCheckUtils]: 57: Hoare triple {24430#(<= main_~i~1 25)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24431#(<= main_~i~1 26)} is VALID [2018-11-23 12:18:19,932 INFO L273 TraceCheckUtils]: 58: Hoare triple {24431#(<= main_~i~1 26)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24431#(<= main_~i~1 26)} is VALID [2018-11-23 12:18:19,932 INFO L273 TraceCheckUtils]: 59: Hoare triple {24431#(<= main_~i~1 26)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24432#(<= main_~i~1 27)} is VALID [2018-11-23 12:18:19,934 INFO L273 TraceCheckUtils]: 60: Hoare triple {24432#(<= main_~i~1 27)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24432#(<= main_~i~1 27)} is VALID [2018-11-23 12:18:19,934 INFO L273 TraceCheckUtils]: 61: Hoare triple {24432#(<= main_~i~1 27)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24433#(<= main_~i~1 28)} is VALID [2018-11-23 12:18:19,936 INFO L273 TraceCheckUtils]: 62: Hoare triple {24433#(<= main_~i~1 28)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24433#(<= main_~i~1 28)} is VALID [2018-11-23 12:18:19,936 INFO L273 TraceCheckUtils]: 63: Hoare triple {24433#(<= main_~i~1 28)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24434#(<= main_~i~1 29)} is VALID [2018-11-23 12:18:19,938 INFO L273 TraceCheckUtils]: 64: Hoare triple {24434#(<= main_~i~1 29)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24434#(<= main_~i~1 29)} is VALID [2018-11-23 12:18:19,938 INFO L273 TraceCheckUtils]: 65: Hoare triple {24434#(<= main_~i~1 29)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24435#(<= main_~i~1 30)} is VALID [2018-11-23 12:18:19,944 INFO L273 TraceCheckUtils]: 66: Hoare triple {24435#(<= main_~i~1 30)} assume !(~i~1 < 60); {24404#false} is VALID [2018-11-23 12:18:19,944 INFO L256 TraceCheckUtils]: 67: Hoare triple {24404#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {24403#true} is VALID [2018-11-23 12:18:19,944 INFO L273 TraceCheckUtils]: 68: Hoare triple {24403#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {24403#true} is VALID [2018-11-23 12:18:19,944 INFO L273 TraceCheckUtils]: 69: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,944 INFO L273 TraceCheckUtils]: 70: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,944 INFO L273 TraceCheckUtils]: 71: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,944 INFO L273 TraceCheckUtils]: 72: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,945 INFO L273 TraceCheckUtils]: 73: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,945 INFO L273 TraceCheckUtils]: 74: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,945 INFO L273 TraceCheckUtils]: 75: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,945 INFO L273 TraceCheckUtils]: 76: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,945 INFO L273 TraceCheckUtils]: 77: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,945 INFO L273 TraceCheckUtils]: 78: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,945 INFO L273 TraceCheckUtils]: 79: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,945 INFO L273 TraceCheckUtils]: 80: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,945 INFO L273 TraceCheckUtils]: 81: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,945 INFO L273 TraceCheckUtils]: 82: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,946 INFO L273 TraceCheckUtils]: 83: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,946 INFO L273 TraceCheckUtils]: 84: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,946 INFO L273 TraceCheckUtils]: 85: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,946 INFO L273 TraceCheckUtils]: 86: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,946 INFO L273 TraceCheckUtils]: 87: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,946 INFO L273 TraceCheckUtils]: 88: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,946 INFO L273 TraceCheckUtils]: 89: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,946 INFO L273 TraceCheckUtils]: 90: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,946 INFO L273 TraceCheckUtils]: 91: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,947 INFO L273 TraceCheckUtils]: 92: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,947 INFO L273 TraceCheckUtils]: 93: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,947 INFO L273 TraceCheckUtils]: 94: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,947 INFO L273 TraceCheckUtils]: 95: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,947 INFO L273 TraceCheckUtils]: 96: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,947 INFO L273 TraceCheckUtils]: 97: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,947 INFO L273 TraceCheckUtils]: 98: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,947 INFO L273 TraceCheckUtils]: 99: Hoare triple {24403#true} assume !(~i~0 < 60); {24403#true} is VALID [2018-11-23 12:18:19,947 INFO L273 TraceCheckUtils]: 100: Hoare triple {24403#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {24403#true} is VALID [2018-11-23 12:18:19,947 INFO L273 TraceCheckUtils]: 101: Hoare triple {24403#true} assume true; {24403#true} is VALID [2018-11-23 12:18:19,948 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {24403#true} {24404#false} #75#return; {24404#false} is VALID [2018-11-23 12:18:19,948 INFO L273 TraceCheckUtils]: 103: Hoare triple {24404#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {24404#false} is VALID [2018-11-23 12:18:19,948 INFO L256 TraceCheckUtils]: 104: Hoare triple {24404#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {24403#true} is VALID [2018-11-23 12:18:19,948 INFO L273 TraceCheckUtils]: 105: Hoare triple {24403#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {24403#true} is VALID [2018-11-23 12:18:19,948 INFO L273 TraceCheckUtils]: 106: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,948 INFO L273 TraceCheckUtils]: 107: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,948 INFO L273 TraceCheckUtils]: 108: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,948 INFO L273 TraceCheckUtils]: 109: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,948 INFO L273 TraceCheckUtils]: 110: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,948 INFO L273 TraceCheckUtils]: 111: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,949 INFO L273 TraceCheckUtils]: 112: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,949 INFO L273 TraceCheckUtils]: 113: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,949 INFO L273 TraceCheckUtils]: 114: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,949 INFO L273 TraceCheckUtils]: 115: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,949 INFO L273 TraceCheckUtils]: 116: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,949 INFO L273 TraceCheckUtils]: 117: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,949 INFO L273 TraceCheckUtils]: 118: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,949 INFO L273 TraceCheckUtils]: 119: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,949 INFO L273 TraceCheckUtils]: 120: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,949 INFO L273 TraceCheckUtils]: 121: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,950 INFO L273 TraceCheckUtils]: 122: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,950 INFO L273 TraceCheckUtils]: 123: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,950 INFO L273 TraceCheckUtils]: 124: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,950 INFO L273 TraceCheckUtils]: 125: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,950 INFO L273 TraceCheckUtils]: 126: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,950 INFO L273 TraceCheckUtils]: 127: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,950 INFO L273 TraceCheckUtils]: 128: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,950 INFO L273 TraceCheckUtils]: 129: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,950 INFO L273 TraceCheckUtils]: 130: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,951 INFO L273 TraceCheckUtils]: 131: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,951 INFO L273 TraceCheckUtils]: 132: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,951 INFO L273 TraceCheckUtils]: 133: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,951 INFO L273 TraceCheckUtils]: 134: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,951 INFO L273 TraceCheckUtils]: 135: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,951 INFO L273 TraceCheckUtils]: 136: Hoare triple {24403#true} assume !(~i~0 < 60); {24403#true} is VALID [2018-11-23 12:18:19,951 INFO L273 TraceCheckUtils]: 137: Hoare triple {24403#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {24403#true} is VALID [2018-11-23 12:18:19,951 INFO L273 TraceCheckUtils]: 138: Hoare triple {24403#true} assume true; {24403#true} is VALID [2018-11-23 12:18:19,951 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {24403#true} {24404#false} #77#return; {24404#false} is VALID [2018-11-23 12:18:19,951 INFO L273 TraceCheckUtils]: 140: Hoare triple {24404#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {24404#false} is VALID [2018-11-23 12:18:19,952 INFO L273 TraceCheckUtils]: 141: Hoare triple {24404#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {24404#false} is VALID [2018-11-23 12:18:19,952 INFO L273 TraceCheckUtils]: 142: Hoare triple {24404#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {24404#false} is VALID [2018-11-23 12:18:19,952 INFO L273 TraceCheckUtils]: 143: Hoare triple {24404#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {24404#false} is VALID [2018-11-23 12:18:19,952 INFO L273 TraceCheckUtils]: 144: Hoare triple {24404#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {24404#false} is VALID [2018-11-23 12:18:19,952 INFO L273 TraceCheckUtils]: 145: Hoare triple {24404#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {24404#false} is VALID [2018-11-23 12:18:19,952 INFO L273 TraceCheckUtils]: 146: Hoare triple {24404#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {24404#false} is VALID [2018-11-23 12:18:19,952 INFO L273 TraceCheckUtils]: 147: Hoare triple {24404#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {24404#false} is VALID [2018-11-23 12:18:19,952 INFO L273 TraceCheckUtils]: 148: Hoare triple {24404#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {24404#false} is VALID [2018-11-23 12:18:19,952 INFO L273 TraceCheckUtils]: 149: Hoare triple {24404#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {24404#false} is VALID [2018-11-23 12:18:19,952 INFO L273 TraceCheckUtils]: 150: Hoare triple {24404#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {24404#false} is VALID [2018-11-23 12:18:19,953 INFO L273 TraceCheckUtils]: 151: Hoare triple {24404#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {24404#false} is VALID [2018-11-23 12:18:19,953 INFO L273 TraceCheckUtils]: 152: Hoare triple {24404#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {24404#false} is VALID [2018-11-23 12:18:19,953 INFO L273 TraceCheckUtils]: 153: Hoare triple {24404#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {24404#false} is VALID [2018-11-23 12:18:19,953 INFO L273 TraceCheckUtils]: 154: Hoare triple {24404#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {24404#false} is VALID [2018-11-23 12:18:19,953 INFO L273 TraceCheckUtils]: 155: Hoare triple {24404#false} assume !(~i~2 < 59); {24404#false} is VALID [2018-11-23 12:18:19,953 INFO L273 TraceCheckUtils]: 156: Hoare triple {24404#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {24404#false} is VALID [2018-11-23 12:18:19,953 INFO L256 TraceCheckUtils]: 157: Hoare triple {24404#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {24403#true} is VALID [2018-11-23 12:18:19,953 INFO L273 TraceCheckUtils]: 158: Hoare triple {24403#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {24403#true} is VALID [2018-11-23 12:18:19,953 INFO L273 TraceCheckUtils]: 159: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,953 INFO L273 TraceCheckUtils]: 160: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,954 INFO L273 TraceCheckUtils]: 161: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,954 INFO L273 TraceCheckUtils]: 162: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,954 INFO L273 TraceCheckUtils]: 163: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,954 INFO L273 TraceCheckUtils]: 164: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,954 INFO L273 TraceCheckUtils]: 165: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,954 INFO L273 TraceCheckUtils]: 166: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,954 INFO L273 TraceCheckUtils]: 167: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,954 INFO L273 TraceCheckUtils]: 168: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,954 INFO L273 TraceCheckUtils]: 169: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,955 INFO L273 TraceCheckUtils]: 170: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,955 INFO L273 TraceCheckUtils]: 171: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,955 INFO L273 TraceCheckUtils]: 172: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,955 INFO L273 TraceCheckUtils]: 173: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,955 INFO L273 TraceCheckUtils]: 174: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,955 INFO L273 TraceCheckUtils]: 175: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,955 INFO L273 TraceCheckUtils]: 176: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,955 INFO L273 TraceCheckUtils]: 177: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,955 INFO L273 TraceCheckUtils]: 178: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,955 INFO L273 TraceCheckUtils]: 179: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,956 INFO L273 TraceCheckUtils]: 180: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,956 INFO L273 TraceCheckUtils]: 181: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,956 INFO L273 TraceCheckUtils]: 182: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,956 INFO L273 TraceCheckUtils]: 183: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,956 INFO L273 TraceCheckUtils]: 184: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,956 INFO L273 TraceCheckUtils]: 185: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,956 INFO L273 TraceCheckUtils]: 186: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:19,956 INFO L273 TraceCheckUtils]: 187: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:19,956 INFO L273 TraceCheckUtils]: 188: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:19,956 INFO L273 TraceCheckUtils]: 189: Hoare triple {24403#true} assume !(~i~0 < 60); {24403#true} is VALID [2018-11-23 12:18:19,957 INFO L273 TraceCheckUtils]: 190: Hoare triple {24403#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {24403#true} is VALID [2018-11-23 12:18:19,957 INFO L273 TraceCheckUtils]: 191: Hoare triple {24403#true} assume true; {24403#true} is VALID [2018-11-23 12:18:19,957 INFO L268 TraceCheckUtils]: 192: Hoare quadruple {24403#true} {24404#false} #79#return; {24404#false} is VALID [2018-11-23 12:18:19,957 INFO L273 TraceCheckUtils]: 193: Hoare triple {24404#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {24404#false} is VALID [2018-11-23 12:18:19,957 INFO L273 TraceCheckUtils]: 194: Hoare triple {24404#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {24404#false} is VALID [2018-11-23 12:18:19,957 INFO L273 TraceCheckUtils]: 195: Hoare triple {24404#false} assume !false; {24404#false} is VALID [2018-11-23 12:18:19,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2359 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2018-11-23 12:18:19,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:18:19,974 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:18:19,983 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:18:22,205 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2018-11-23 12:18:22,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:18:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:18:22,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:18:22,570 INFO L256 TraceCheckUtils]: 0: Hoare triple {24403#true} call ULTIMATE.init(); {24403#true} is VALID [2018-11-23 12:18:22,570 INFO L273 TraceCheckUtils]: 1: Hoare triple {24403#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24403#true} is VALID [2018-11-23 12:18:22,570 INFO L273 TraceCheckUtils]: 2: Hoare triple {24403#true} assume true; {24403#true} is VALID [2018-11-23 12:18:22,570 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24403#true} {24403#true} #71#return; {24403#true} is VALID [2018-11-23 12:18:22,571 INFO L256 TraceCheckUtils]: 4: Hoare triple {24403#true} call #t~ret14 := main(); {24403#true} is VALID [2018-11-23 12:18:22,571 INFO L273 TraceCheckUtils]: 5: Hoare triple {24403#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {24403#true} is VALID [2018-11-23 12:18:22,571 INFO L273 TraceCheckUtils]: 6: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,571 INFO L273 TraceCheckUtils]: 7: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,571 INFO L273 TraceCheckUtils]: 8: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,572 INFO L273 TraceCheckUtils]: 9: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,572 INFO L273 TraceCheckUtils]: 10: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,572 INFO L273 TraceCheckUtils]: 11: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,572 INFO L273 TraceCheckUtils]: 12: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,572 INFO L273 TraceCheckUtils]: 13: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,572 INFO L273 TraceCheckUtils]: 14: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,573 INFO L273 TraceCheckUtils]: 15: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,573 INFO L273 TraceCheckUtils]: 16: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,573 INFO L273 TraceCheckUtils]: 17: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,573 INFO L273 TraceCheckUtils]: 18: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,573 INFO L273 TraceCheckUtils]: 19: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,573 INFO L273 TraceCheckUtils]: 20: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,573 INFO L273 TraceCheckUtils]: 21: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,573 INFO L273 TraceCheckUtils]: 22: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,573 INFO L273 TraceCheckUtils]: 23: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,573 INFO L273 TraceCheckUtils]: 24: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,574 INFO L273 TraceCheckUtils]: 25: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,574 INFO L273 TraceCheckUtils]: 26: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,574 INFO L273 TraceCheckUtils]: 27: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,574 INFO L273 TraceCheckUtils]: 28: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,574 INFO L273 TraceCheckUtils]: 29: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,574 INFO L273 TraceCheckUtils]: 30: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,574 INFO L273 TraceCheckUtils]: 31: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,574 INFO L273 TraceCheckUtils]: 32: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,574 INFO L273 TraceCheckUtils]: 33: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,575 INFO L273 TraceCheckUtils]: 34: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,575 INFO L273 TraceCheckUtils]: 35: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,575 INFO L273 TraceCheckUtils]: 36: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,575 INFO L273 TraceCheckUtils]: 37: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,575 INFO L273 TraceCheckUtils]: 38: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,575 INFO L273 TraceCheckUtils]: 39: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,575 INFO L273 TraceCheckUtils]: 40: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,575 INFO L273 TraceCheckUtils]: 41: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,575 INFO L273 TraceCheckUtils]: 42: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,575 INFO L273 TraceCheckUtils]: 43: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,576 INFO L273 TraceCheckUtils]: 44: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,576 INFO L273 TraceCheckUtils]: 45: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,576 INFO L273 TraceCheckUtils]: 46: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,576 INFO L273 TraceCheckUtils]: 47: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,576 INFO L273 TraceCheckUtils]: 48: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,576 INFO L273 TraceCheckUtils]: 49: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,576 INFO L273 TraceCheckUtils]: 50: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,576 INFO L273 TraceCheckUtils]: 51: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,576 INFO L273 TraceCheckUtils]: 52: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,576 INFO L273 TraceCheckUtils]: 53: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,577 INFO L273 TraceCheckUtils]: 54: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,577 INFO L273 TraceCheckUtils]: 55: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,577 INFO L273 TraceCheckUtils]: 56: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,577 INFO L273 TraceCheckUtils]: 57: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,577 INFO L273 TraceCheckUtils]: 58: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,577 INFO L273 TraceCheckUtils]: 59: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,577 INFO L273 TraceCheckUtils]: 60: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,577 INFO L273 TraceCheckUtils]: 61: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,577 INFO L273 TraceCheckUtils]: 62: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,577 INFO L273 TraceCheckUtils]: 63: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,578 INFO L273 TraceCheckUtils]: 64: Hoare triple {24403#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {24403#true} is VALID [2018-11-23 12:18:22,578 INFO L273 TraceCheckUtils]: 65: Hoare triple {24403#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24403#true} is VALID [2018-11-23 12:18:22,578 INFO L273 TraceCheckUtils]: 66: Hoare triple {24403#true} assume !(~i~1 < 60); {24403#true} is VALID [2018-11-23 12:18:22,578 INFO L256 TraceCheckUtils]: 67: Hoare triple {24403#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {24403#true} is VALID [2018-11-23 12:18:22,578 INFO L273 TraceCheckUtils]: 68: Hoare triple {24403#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {24403#true} is VALID [2018-11-23 12:18:22,578 INFO L273 TraceCheckUtils]: 69: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:22,578 INFO L273 TraceCheckUtils]: 70: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:22,578 INFO L273 TraceCheckUtils]: 71: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:22,578 INFO L273 TraceCheckUtils]: 72: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:22,578 INFO L273 TraceCheckUtils]: 73: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:22,579 INFO L273 TraceCheckUtils]: 74: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:22,579 INFO L273 TraceCheckUtils]: 75: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:22,579 INFO L273 TraceCheckUtils]: 76: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:22,579 INFO L273 TraceCheckUtils]: 77: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:22,579 INFO L273 TraceCheckUtils]: 78: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:22,579 INFO L273 TraceCheckUtils]: 79: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:22,579 INFO L273 TraceCheckUtils]: 80: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:22,579 INFO L273 TraceCheckUtils]: 81: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:22,579 INFO L273 TraceCheckUtils]: 82: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:22,579 INFO L273 TraceCheckUtils]: 83: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:22,580 INFO L273 TraceCheckUtils]: 84: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:22,580 INFO L273 TraceCheckUtils]: 85: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:22,580 INFO L273 TraceCheckUtils]: 86: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:22,580 INFO L273 TraceCheckUtils]: 87: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:22,580 INFO L273 TraceCheckUtils]: 88: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:22,580 INFO L273 TraceCheckUtils]: 89: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:22,580 INFO L273 TraceCheckUtils]: 90: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:22,580 INFO L273 TraceCheckUtils]: 91: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:22,580 INFO L273 TraceCheckUtils]: 92: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:22,580 INFO L273 TraceCheckUtils]: 93: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:22,581 INFO L273 TraceCheckUtils]: 94: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:22,581 INFO L273 TraceCheckUtils]: 95: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:22,581 INFO L273 TraceCheckUtils]: 96: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:22,581 INFO L273 TraceCheckUtils]: 97: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:22,581 INFO L273 TraceCheckUtils]: 98: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:22,581 INFO L273 TraceCheckUtils]: 99: Hoare triple {24403#true} assume !(~i~0 < 60); {24403#true} is VALID [2018-11-23 12:18:22,581 INFO L273 TraceCheckUtils]: 100: Hoare triple {24403#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {24403#true} is VALID [2018-11-23 12:18:22,581 INFO L273 TraceCheckUtils]: 101: Hoare triple {24403#true} assume true; {24403#true} is VALID [2018-11-23 12:18:22,581 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {24403#true} {24403#true} #75#return; {24403#true} is VALID [2018-11-23 12:18:22,581 INFO L273 TraceCheckUtils]: 103: Hoare triple {24403#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {24403#true} is VALID [2018-11-23 12:18:22,582 INFO L256 TraceCheckUtils]: 104: Hoare triple {24403#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {24403#true} is VALID [2018-11-23 12:18:22,582 INFO L273 TraceCheckUtils]: 105: Hoare triple {24403#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {24403#true} is VALID [2018-11-23 12:18:22,582 INFO L273 TraceCheckUtils]: 106: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:22,582 INFO L273 TraceCheckUtils]: 107: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:22,582 INFO L273 TraceCheckUtils]: 108: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:22,582 INFO L273 TraceCheckUtils]: 109: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:22,582 INFO L273 TraceCheckUtils]: 110: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:22,582 INFO L273 TraceCheckUtils]: 111: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:22,582 INFO L273 TraceCheckUtils]: 112: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:22,582 INFO L273 TraceCheckUtils]: 113: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:22,583 INFO L273 TraceCheckUtils]: 114: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:22,583 INFO L273 TraceCheckUtils]: 115: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:22,583 INFO L273 TraceCheckUtils]: 116: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:22,583 INFO L273 TraceCheckUtils]: 117: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:22,583 INFO L273 TraceCheckUtils]: 118: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:22,583 INFO L273 TraceCheckUtils]: 119: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:22,583 INFO L273 TraceCheckUtils]: 120: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:22,583 INFO L273 TraceCheckUtils]: 121: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:22,583 INFO L273 TraceCheckUtils]: 122: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:22,583 INFO L273 TraceCheckUtils]: 123: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:22,584 INFO L273 TraceCheckUtils]: 124: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:22,584 INFO L273 TraceCheckUtils]: 125: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:22,584 INFO L273 TraceCheckUtils]: 126: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:22,584 INFO L273 TraceCheckUtils]: 127: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:22,584 INFO L273 TraceCheckUtils]: 128: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:22,584 INFO L273 TraceCheckUtils]: 129: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:22,584 INFO L273 TraceCheckUtils]: 130: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:22,584 INFO L273 TraceCheckUtils]: 131: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:22,584 INFO L273 TraceCheckUtils]: 132: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:22,584 INFO L273 TraceCheckUtils]: 133: Hoare triple {24403#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24403#true} is VALID [2018-11-23 12:18:22,585 INFO L273 TraceCheckUtils]: 134: Hoare triple {24403#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24403#true} is VALID [2018-11-23 12:18:22,585 INFO L273 TraceCheckUtils]: 135: Hoare triple {24403#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24403#true} is VALID [2018-11-23 12:18:22,585 INFO L273 TraceCheckUtils]: 136: Hoare triple {24403#true} assume !(~i~0 < 60); {24403#true} is VALID [2018-11-23 12:18:22,585 INFO L273 TraceCheckUtils]: 137: Hoare triple {24403#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {24403#true} is VALID [2018-11-23 12:18:22,585 INFO L273 TraceCheckUtils]: 138: Hoare triple {24403#true} assume true; {24403#true} is VALID [2018-11-23 12:18:22,585 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {24403#true} {24403#true} #77#return; {24403#true} is VALID [2018-11-23 12:18:22,586 INFO L273 TraceCheckUtils]: 140: Hoare triple {24403#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {24859#(<= main_~i~2 0)} is VALID [2018-11-23 12:18:22,586 INFO L273 TraceCheckUtils]: 141: Hoare triple {24859#(<= main_~i~2 0)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {24859#(<= main_~i~2 0)} is VALID [2018-11-23 12:18:22,586 INFO L273 TraceCheckUtils]: 142: Hoare triple {24859#(<= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {24866#(<= main_~i~2 1)} is VALID [2018-11-23 12:18:22,587 INFO L273 TraceCheckUtils]: 143: Hoare triple {24866#(<= main_~i~2 1)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {24866#(<= main_~i~2 1)} is VALID [2018-11-23 12:18:22,587 INFO L273 TraceCheckUtils]: 144: Hoare triple {24866#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {24873#(<= main_~i~2 2)} is VALID [2018-11-23 12:18:22,588 INFO L273 TraceCheckUtils]: 145: Hoare triple {24873#(<= main_~i~2 2)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {24873#(<= main_~i~2 2)} is VALID [2018-11-23 12:18:22,588 INFO L273 TraceCheckUtils]: 146: Hoare triple {24873#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {24880#(<= main_~i~2 3)} is VALID [2018-11-23 12:18:22,588 INFO L273 TraceCheckUtils]: 147: Hoare triple {24880#(<= main_~i~2 3)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {24880#(<= main_~i~2 3)} is VALID [2018-11-23 12:18:22,589 INFO L273 TraceCheckUtils]: 148: Hoare triple {24880#(<= main_~i~2 3)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {24887#(<= main_~i~2 4)} is VALID [2018-11-23 12:18:22,589 INFO L273 TraceCheckUtils]: 149: Hoare triple {24887#(<= main_~i~2 4)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {24887#(<= main_~i~2 4)} is VALID [2018-11-23 12:18:22,589 INFO L273 TraceCheckUtils]: 150: Hoare triple {24887#(<= main_~i~2 4)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {24894#(<= main_~i~2 5)} is VALID [2018-11-23 12:18:22,590 INFO L273 TraceCheckUtils]: 151: Hoare triple {24894#(<= main_~i~2 5)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {24894#(<= main_~i~2 5)} is VALID [2018-11-23 12:18:22,591 INFO L273 TraceCheckUtils]: 152: Hoare triple {24894#(<= main_~i~2 5)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {24901#(<= main_~i~2 6)} is VALID [2018-11-23 12:18:22,591 INFO L273 TraceCheckUtils]: 153: Hoare triple {24901#(<= main_~i~2 6)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {24901#(<= main_~i~2 6)} is VALID [2018-11-23 12:18:22,592 INFO L273 TraceCheckUtils]: 154: Hoare triple {24901#(<= main_~i~2 6)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {24908#(<= main_~i~2 7)} is VALID [2018-11-23 12:18:22,593 INFO L273 TraceCheckUtils]: 155: Hoare triple {24908#(<= main_~i~2 7)} assume !(~i~2 < 59); {24404#false} is VALID [2018-11-23 12:18:22,593 INFO L273 TraceCheckUtils]: 156: Hoare triple {24404#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {24404#false} is VALID [2018-11-23 12:18:22,593 INFO L256 TraceCheckUtils]: 157: Hoare triple {24404#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {24404#false} is VALID [2018-11-23 12:18:22,593 INFO L273 TraceCheckUtils]: 158: Hoare triple {24404#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {24404#false} is VALID [2018-11-23 12:18:22,593 INFO L273 TraceCheckUtils]: 159: Hoare triple {24404#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24404#false} is VALID [2018-11-23 12:18:22,594 INFO L273 TraceCheckUtils]: 160: Hoare triple {24404#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24404#false} is VALID [2018-11-23 12:18:22,594 INFO L273 TraceCheckUtils]: 161: Hoare triple {24404#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24404#false} is VALID [2018-11-23 12:18:22,594 INFO L273 TraceCheckUtils]: 162: Hoare triple {24404#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24404#false} is VALID [2018-11-23 12:18:22,594 INFO L273 TraceCheckUtils]: 163: Hoare triple {24404#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24404#false} is VALID [2018-11-23 12:18:22,594 INFO L273 TraceCheckUtils]: 164: Hoare triple {24404#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24404#false} is VALID [2018-11-23 12:18:22,594 INFO L273 TraceCheckUtils]: 165: Hoare triple {24404#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24404#false} is VALID [2018-11-23 12:18:22,595 INFO L273 TraceCheckUtils]: 166: Hoare triple {24404#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24404#false} is VALID [2018-11-23 12:18:22,595 INFO L273 TraceCheckUtils]: 167: Hoare triple {24404#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24404#false} is VALID [2018-11-23 12:18:22,595 INFO L273 TraceCheckUtils]: 168: Hoare triple {24404#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24404#false} is VALID [2018-11-23 12:18:22,595 INFO L273 TraceCheckUtils]: 169: Hoare triple {24404#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24404#false} is VALID [2018-11-23 12:18:22,595 INFO L273 TraceCheckUtils]: 170: Hoare triple {24404#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24404#false} is VALID [2018-11-23 12:18:22,595 INFO L273 TraceCheckUtils]: 171: Hoare triple {24404#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24404#false} is VALID [2018-11-23 12:18:22,596 INFO L273 TraceCheckUtils]: 172: Hoare triple {24404#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24404#false} is VALID [2018-11-23 12:18:22,596 INFO L273 TraceCheckUtils]: 173: Hoare triple {24404#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24404#false} is VALID [2018-11-23 12:18:22,596 INFO L273 TraceCheckUtils]: 174: Hoare triple {24404#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24404#false} is VALID [2018-11-23 12:18:22,596 INFO L273 TraceCheckUtils]: 175: Hoare triple {24404#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24404#false} is VALID [2018-11-23 12:18:22,596 INFO L273 TraceCheckUtils]: 176: Hoare triple {24404#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24404#false} is VALID [2018-11-23 12:18:22,596 INFO L273 TraceCheckUtils]: 177: Hoare triple {24404#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24404#false} is VALID [2018-11-23 12:18:22,597 INFO L273 TraceCheckUtils]: 178: Hoare triple {24404#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24404#false} is VALID [2018-11-23 12:18:22,597 INFO L273 TraceCheckUtils]: 179: Hoare triple {24404#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24404#false} is VALID [2018-11-23 12:18:22,597 INFO L273 TraceCheckUtils]: 180: Hoare triple {24404#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24404#false} is VALID [2018-11-23 12:18:22,597 INFO L273 TraceCheckUtils]: 181: Hoare triple {24404#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24404#false} is VALID [2018-11-23 12:18:22,597 INFO L273 TraceCheckUtils]: 182: Hoare triple {24404#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24404#false} is VALID [2018-11-23 12:18:22,598 INFO L273 TraceCheckUtils]: 183: Hoare triple {24404#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24404#false} is VALID [2018-11-23 12:18:22,598 INFO L273 TraceCheckUtils]: 184: Hoare triple {24404#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24404#false} is VALID [2018-11-23 12:18:22,598 INFO L273 TraceCheckUtils]: 185: Hoare triple {24404#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24404#false} is VALID [2018-11-23 12:18:22,598 INFO L273 TraceCheckUtils]: 186: Hoare triple {24404#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {24404#false} is VALID [2018-11-23 12:18:22,598 INFO L273 TraceCheckUtils]: 187: Hoare triple {24404#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {24404#false} is VALID [2018-11-23 12:18:22,598 INFO L273 TraceCheckUtils]: 188: Hoare triple {24404#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {24404#false} is VALID [2018-11-23 12:18:22,598 INFO L273 TraceCheckUtils]: 189: Hoare triple {24404#false} assume !(~i~0 < 60); {24404#false} is VALID [2018-11-23 12:18:22,598 INFO L273 TraceCheckUtils]: 190: Hoare triple {24404#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {24404#false} is VALID [2018-11-23 12:18:22,598 INFO L273 TraceCheckUtils]: 191: Hoare triple {24404#false} assume true; {24404#false} is VALID [2018-11-23 12:18:22,598 INFO L268 TraceCheckUtils]: 192: Hoare quadruple {24404#false} {24404#false} #79#return; {24404#false} is VALID [2018-11-23 12:18:22,599 INFO L273 TraceCheckUtils]: 193: Hoare triple {24404#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {24404#false} is VALID [2018-11-23 12:18:22,599 INFO L273 TraceCheckUtils]: 194: Hoare triple {24404#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {24404#false} is VALID [2018-11-23 12:18:22,599 INFO L273 TraceCheckUtils]: 195: Hoare triple {24404#false} assume !false; {24404#false} is VALID [2018-11-23 12:18:22,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2359 backedges. 650 proven. 49 refuted. 0 times theorem prover too weak. 1660 trivial. 0 not checked. [2018-11-23 12:18:22,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:18:22,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 10] total 41 [2018-11-23 12:18:22,634 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 196 [2018-11-23 12:18:22,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:18:22,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 12:18:22,758 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:18:22,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 12:18:22,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 12:18:22,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=1068, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:18:22,760 INFO L87 Difference]: Start difference. First operand 127 states and 141 transitions. Second operand 41 states. [2018-11-23 12:18:23,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:23,873 INFO L93 Difference]: Finished difference Result 193 states and 222 transitions. [2018-11-23 12:18:23,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 12:18:23,873 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 196 [2018-11-23 12:18:23,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:18:23,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:18:23,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 135 transitions. [2018-11-23 12:18:23,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:18:23,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 135 transitions. [2018-11-23 12:18:23,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 135 transitions. [2018-11-23 12:18:24,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:18:24,043 INFO L225 Difference]: With dead ends: 193 [2018-11-23 12:18:24,043 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 12:18:24,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=572, Invalid=1068, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:18:24,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 12:18:24,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-11-23 12:18:24,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:18:24,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 131 states. [2018-11-23 12:18:24,163 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 131 states. [2018-11-23 12:18:24,163 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 131 states. [2018-11-23 12:18:24,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:24,166 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2018-11-23 12:18:24,166 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2018-11-23 12:18:24,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:18:24,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:18:24,167 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 133 states. [2018-11-23 12:18:24,167 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 133 states. [2018-11-23 12:18:24,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:24,169 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2018-11-23 12:18:24,169 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2018-11-23 12:18:24,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:18:24,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:18:24,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:18:24,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:18:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-23 12:18:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 145 transitions. [2018-11-23 12:18:24,171 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 145 transitions. Word has length 196 [2018-11-23 12:18:24,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:18:24,172 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 145 transitions. [2018-11-23 12:18:24,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 12:18:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 145 transitions. [2018-11-23 12:18:24,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-23 12:18:24,172 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:18:24,173 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:18:24,173 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:18:24,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:18:24,173 INFO L82 PathProgramCache]: Analyzing trace with hash 311855140, now seen corresponding path program 31 times [2018-11-23 12:18:24,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:18:24,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:18:24,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:24,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:18:24,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:24,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:18:24,905 INFO L256 TraceCheckUtils]: 0: Hoare triple {25764#true} call ULTIMATE.init(); {25764#true} is VALID [2018-11-23 12:18:24,905 INFO L273 TraceCheckUtils]: 1: Hoare triple {25764#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25764#true} is VALID [2018-11-23 12:18:24,905 INFO L273 TraceCheckUtils]: 2: Hoare triple {25764#true} assume true; {25764#true} is VALID [2018-11-23 12:18:24,905 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25764#true} {25764#true} #71#return; {25764#true} is VALID [2018-11-23 12:18:24,906 INFO L256 TraceCheckUtils]: 4: Hoare triple {25764#true} call #t~ret14 := main(); {25764#true} is VALID [2018-11-23 12:18:24,906 INFO L273 TraceCheckUtils]: 5: Hoare triple {25764#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {25766#(= main_~i~1 0)} is VALID [2018-11-23 12:18:24,907 INFO L273 TraceCheckUtils]: 6: Hoare triple {25766#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25766#(= main_~i~1 0)} is VALID [2018-11-23 12:18:24,907 INFO L273 TraceCheckUtils]: 7: Hoare triple {25766#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25767#(<= main_~i~1 1)} is VALID [2018-11-23 12:18:24,908 INFO L273 TraceCheckUtils]: 8: Hoare triple {25767#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25767#(<= main_~i~1 1)} is VALID [2018-11-23 12:18:24,909 INFO L273 TraceCheckUtils]: 9: Hoare triple {25767#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25768#(<= main_~i~1 2)} is VALID [2018-11-23 12:18:24,909 INFO L273 TraceCheckUtils]: 10: Hoare triple {25768#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25768#(<= main_~i~1 2)} is VALID [2018-11-23 12:18:24,910 INFO L273 TraceCheckUtils]: 11: Hoare triple {25768#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25769#(<= main_~i~1 3)} is VALID [2018-11-23 12:18:24,910 INFO L273 TraceCheckUtils]: 12: Hoare triple {25769#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25769#(<= main_~i~1 3)} is VALID [2018-11-23 12:18:24,911 INFO L273 TraceCheckUtils]: 13: Hoare triple {25769#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25770#(<= main_~i~1 4)} is VALID [2018-11-23 12:18:24,912 INFO L273 TraceCheckUtils]: 14: Hoare triple {25770#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25770#(<= main_~i~1 4)} is VALID [2018-11-23 12:18:24,912 INFO L273 TraceCheckUtils]: 15: Hoare triple {25770#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25771#(<= main_~i~1 5)} is VALID [2018-11-23 12:18:24,913 INFO L273 TraceCheckUtils]: 16: Hoare triple {25771#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25771#(<= main_~i~1 5)} is VALID [2018-11-23 12:18:24,914 INFO L273 TraceCheckUtils]: 17: Hoare triple {25771#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25772#(<= main_~i~1 6)} is VALID [2018-11-23 12:18:24,914 INFO L273 TraceCheckUtils]: 18: Hoare triple {25772#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25772#(<= main_~i~1 6)} is VALID [2018-11-23 12:18:24,915 INFO L273 TraceCheckUtils]: 19: Hoare triple {25772#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25773#(<= main_~i~1 7)} is VALID [2018-11-23 12:18:24,915 INFO L273 TraceCheckUtils]: 20: Hoare triple {25773#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25773#(<= main_~i~1 7)} is VALID [2018-11-23 12:18:24,916 INFO L273 TraceCheckUtils]: 21: Hoare triple {25773#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25774#(<= main_~i~1 8)} is VALID [2018-11-23 12:18:24,917 INFO L273 TraceCheckUtils]: 22: Hoare triple {25774#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25774#(<= main_~i~1 8)} is VALID [2018-11-23 12:18:24,917 INFO L273 TraceCheckUtils]: 23: Hoare triple {25774#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25775#(<= main_~i~1 9)} is VALID [2018-11-23 12:18:24,918 INFO L273 TraceCheckUtils]: 24: Hoare triple {25775#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25775#(<= main_~i~1 9)} is VALID [2018-11-23 12:18:24,919 INFO L273 TraceCheckUtils]: 25: Hoare triple {25775#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25776#(<= main_~i~1 10)} is VALID [2018-11-23 12:18:24,919 INFO L273 TraceCheckUtils]: 26: Hoare triple {25776#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25776#(<= main_~i~1 10)} is VALID [2018-11-23 12:18:24,920 INFO L273 TraceCheckUtils]: 27: Hoare triple {25776#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25777#(<= main_~i~1 11)} is VALID [2018-11-23 12:18:24,920 INFO L273 TraceCheckUtils]: 28: Hoare triple {25777#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25777#(<= main_~i~1 11)} is VALID [2018-11-23 12:18:24,921 INFO L273 TraceCheckUtils]: 29: Hoare triple {25777#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25778#(<= main_~i~1 12)} is VALID [2018-11-23 12:18:24,921 INFO L273 TraceCheckUtils]: 30: Hoare triple {25778#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25778#(<= main_~i~1 12)} is VALID [2018-11-23 12:18:24,922 INFO L273 TraceCheckUtils]: 31: Hoare triple {25778#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25779#(<= main_~i~1 13)} is VALID [2018-11-23 12:18:24,923 INFO L273 TraceCheckUtils]: 32: Hoare triple {25779#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25779#(<= main_~i~1 13)} is VALID [2018-11-23 12:18:24,923 INFO L273 TraceCheckUtils]: 33: Hoare triple {25779#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25780#(<= main_~i~1 14)} is VALID [2018-11-23 12:18:24,924 INFO L273 TraceCheckUtils]: 34: Hoare triple {25780#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25780#(<= main_~i~1 14)} is VALID [2018-11-23 12:18:24,925 INFO L273 TraceCheckUtils]: 35: Hoare triple {25780#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25781#(<= main_~i~1 15)} is VALID [2018-11-23 12:18:24,925 INFO L273 TraceCheckUtils]: 36: Hoare triple {25781#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25781#(<= main_~i~1 15)} is VALID [2018-11-23 12:18:24,926 INFO L273 TraceCheckUtils]: 37: Hoare triple {25781#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25782#(<= main_~i~1 16)} is VALID [2018-11-23 12:18:24,926 INFO L273 TraceCheckUtils]: 38: Hoare triple {25782#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25782#(<= main_~i~1 16)} is VALID [2018-11-23 12:18:24,927 INFO L273 TraceCheckUtils]: 39: Hoare triple {25782#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25783#(<= main_~i~1 17)} is VALID [2018-11-23 12:18:24,928 INFO L273 TraceCheckUtils]: 40: Hoare triple {25783#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25783#(<= main_~i~1 17)} is VALID [2018-11-23 12:18:24,928 INFO L273 TraceCheckUtils]: 41: Hoare triple {25783#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25784#(<= main_~i~1 18)} is VALID [2018-11-23 12:18:24,929 INFO L273 TraceCheckUtils]: 42: Hoare triple {25784#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25784#(<= main_~i~1 18)} is VALID [2018-11-23 12:18:24,930 INFO L273 TraceCheckUtils]: 43: Hoare triple {25784#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25785#(<= main_~i~1 19)} is VALID [2018-11-23 12:18:24,930 INFO L273 TraceCheckUtils]: 44: Hoare triple {25785#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25785#(<= main_~i~1 19)} is VALID [2018-11-23 12:18:24,931 INFO L273 TraceCheckUtils]: 45: Hoare triple {25785#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25786#(<= main_~i~1 20)} is VALID [2018-11-23 12:18:24,931 INFO L273 TraceCheckUtils]: 46: Hoare triple {25786#(<= main_~i~1 20)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25786#(<= main_~i~1 20)} is VALID [2018-11-23 12:18:24,932 INFO L273 TraceCheckUtils]: 47: Hoare triple {25786#(<= main_~i~1 20)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25787#(<= main_~i~1 21)} is VALID [2018-11-23 12:18:24,933 INFO L273 TraceCheckUtils]: 48: Hoare triple {25787#(<= main_~i~1 21)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25787#(<= main_~i~1 21)} is VALID [2018-11-23 12:18:24,933 INFO L273 TraceCheckUtils]: 49: Hoare triple {25787#(<= main_~i~1 21)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25788#(<= main_~i~1 22)} is VALID [2018-11-23 12:18:24,934 INFO L273 TraceCheckUtils]: 50: Hoare triple {25788#(<= main_~i~1 22)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25788#(<= main_~i~1 22)} is VALID [2018-11-23 12:18:24,935 INFO L273 TraceCheckUtils]: 51: Hoare triple {25788#(<= main_~i~1 22)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25789#(<= main_~i~1 23)} is VALID [2018-11-23 12:18:24,935 INFO L273 TraceCheckUtils]: 52: Hoare triple {25789#(<= main_~i~1 23)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25789#(<= main_~i~1 23)} is VALID [2018-11-23 12:18:24,936 INFO L273 TraceCheckUtils]: 53: Hoare triple {25789#(<= main_~i~1 23)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25790#(<= main_~i~1 24)} is VALID [2018-11-23 12:18:24,936 INFO L273 TraceCheckUtils]: 54: Hoare triple {25790#(<= main_~i~1 24)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25790#(<= main_~i~1 24)} is VALID [2018-11-23 12:18:24,937 INFO L273 TraceCheckUtils]: 55: Hoare triple {25790#(<= main_~i~1 24)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25791#(<= main_~i~1 25)} is VALID [2018-11-23 12:18:24,938 INFO L273 TraceCheckUtils]: 56: Hoare triple {25791#(<= main_~i~1 25)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25791#(<= main_~i~1 25)} is VALID [2018-11-23 12:18:24,938 INFO L273 TraceCheckUtils]: 57: Hoare triple {25791#(<= main_~i~1 25)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25792#(<= main_~i~1 26)} is VALID [2018-11-23 12:18:24,939 INFO L273 TraceCheckUtils]: 58: Hoare triple {25792#(<= main_~i~1 26)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25792#(<= main_~i~1 26)} is VALID [2018-11-23 12:18:24,940 INFO L273 TraceCheckUtils]: 59: Hoare triple {25792#(<= main_~i~1 26)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25793#(<= main_~i~1 27)} is VALID [2018-11-23 12:18:24,940 INFO L273 TraceCheckUtils]: 60: Hoare triple {25793#(<= main_~i~1 27)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25793#(<= main_~i~1 27)} is VALID [2018-11-23 12:18:24,941 INFO L273 TraceCheckUtils]: 61: Hoare triple {25793#(<= main_~i~1 27)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25794#(<= main_~i~1 28)} is VALID [2018-11-23 12:18:24,941 INFO L273 TraceCheckUtils]: 62: Hoare triple {25794#(<= main_~i~1 28)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25794#(<= main_~i~1 28)} is VALID [2018-11-23 12:18:24,942 INFO L273 TraceCheckUtils]: 63: Hoare triple {25794#(<= main_~i~1 28)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25795#(<= main_~i~1 29)} is VALID [2018-11-23 12:18:24,943 INFO L273 TraceCheckUtils]: 64: Hoare triple {25795#(<= main_~i~1 29)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25795#(<= main_~i~1 29)} is VALID [2018-11-23 12:18:24,943 INFO L273 TraceCheckUtils]: 65: Hoare triple {25795#(<= main_~i~1 29)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25796#(<= main_~i~1 30)} is VALID [2018-11-23 12:18:24,944 INFO L273 TraceCheckUtils]: 66: Hoare triple {25796#(<= main_~i~1 30)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25796#(<= main_~i~1 30)} is VALID [2018-11-23 12:18:24,944 INFO L273 TraceCheckUtils]: 67: Hoare triple {25796#(<= main_~i~1 30)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25797#(<= main_~i~1 31)} is VALID [2018-11-23 12:18:24,945 INFO L273 TraceCheckUtils]: 68: Hoare triple {25797#(<= main_~i~1 31)} assume !(~i~1 < 60); {25765#false} is VALID [2018-11-23 12:18:24,945 INFO L256 TraceCheckUtils]: 69: Hoare triple {25765#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {25764#true} is VALID [2018-11-23 12:18:24,946 INFO L273 TraceCheckUtils]: 70: Hoare triple {25764#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {25764#true} is VALID [2018-11-23 12:18:24,946 INFO L273 TraceCheckUtils]: 71: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,946 INFO L273 TraceCheckUtils]: 72: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,946 INFO L273 TraceCheckUtils]: 73: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,946 INFO L273 TraceCheckUtils]: 74: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,946 INFO L273 TraceCheckUtils]: 75: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,947 INFO L273 TraceCheckUtils]: 76: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,947 INFO L273 TraceCheckUtils]: 77: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,947 INFO L273 TraceCheckUtils]: 78: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,947 INFO L273 TraceCheckUtils]: 79: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,947 INFO L273 TraceCheckUtils]: 80: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,948 INFO L273 TraceCheckUtils]: 81: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,948 INFO L273 TraceCheckUtils]: 82: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,948 INFO L273 TraceCheckUtils]: 83: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,948 INFO L273 TraceCheckUtils]: 84: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,948 INFO L273 TraceCheckUtils]: 85: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,948 INFO L273 TraceCheckUtils]: 86: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,949 INFO L273 TraceCheckUtils]: 87: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,949 INFO L273 TraceCheckUtils]: 88: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,949 INFO L273 TraceCheckUtils]: 89: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,949 INFO L273 TraceCheckUtils]: 90: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,949 INFO L273 TraceCheckUtils]: 91: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,949 INFO L273 TraceCheckUtils]: 92: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,950 INFO L273 TraceCheckUtils]: 93: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,950 INFO L273 TraceCheckUtils]: 94: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,950 INFO L273 TraceCheckUtils]: 95: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,950 INFO L273 TraceCheckUtils]: 96: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,950 INFO L273 TraceCheckUtils]: 97: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,950 INFO L273 TraceCheckUtils]: 98: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,950 INFO L273 TraceCheckUtils]: 99: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,950 INFO L273 TraceCheckUtils]: 100: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,951 INFO L273 TraceCheckUtils]: 101: Hoare triple {25764#true} assume !(~i~0 < 60); {25764#true} is VALID [2018-11-23 12:18:24,951 INFO L273 TraceCheckUtils]: 102: Hoare triple {25764#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {25764#true} is VALID [2018-11-23 12:18:24,951 INFO L273 TraceCheckUtils]: 103: Hoare triple {25764#true} assume true; {25764#true} is VALID [2018-11-23 12:18:24,951 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {25764#true} {25765#false} #75#return; {25765#false} is VALID [2018-11-23 12:18:24,951 INFO L273 TraceCheckUtils]: 105: Hoare triple {25765#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {25765#false} is VALID [2018-11-23 12:18:24,951 INFO L256 TraceCheckUtils]: 106: Hoare triple {25765#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {25764#true} is VALID [2018-11-23 12:18:24,951 INFO L273 TraceCheckUtils]: 107: Hoare triple {25764#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {25764#true} is VALID [2018-11-23 12:18:24,951 INFO L273 TraceCheckUtils]: 108: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,951 INFO L273 TraceCheckUtils]: 109: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,952 INFO L273 TraceCheckUtils]: 110: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,952 INFO L273 TraceCheckUtils]: 111: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,952 INFO L273 TraceCheckUtils]: 112: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,952 INFO L273 TraceCheckUtils]: 113: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,952 INFO L273 TraceCheckUtils]: 114: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,952 INFO L273 TraceCheckUtils]: 115: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,952 INFO L273 TraceCheckUtils]: 116: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,952 INFO L273 TraceCheckUtils]: 117: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,952 INFO L273 TraceCheckUtils]: 118: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,952 INFO L273 TraceCheckUtils]: 119: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,953 INFO L273 TraceCheckUtils]: 120: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,953 INFO L273 TraceCheckUtils]: 121: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,953 INFO L273 TraceCheckUtils]: 122: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,953 INFO L273 TraceCheckUtils]: 123: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,953 INFO L273 TraceCheckUtils]: 124: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,953 INFO L273 TraceCheckUtils]: 125: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,953 INFO L273 TraceCheckUtils]: 126: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,953 INFO L273 TraceCheckUtils]: 127: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,953 INFO L273 TraceCheckUtils]: 128: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,953 INFO L273 TraceCheckUtils]: 129: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,954 INFO L273 TraceCheckUtils]: 130: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,954 INFO L273 TraceCheckUtils]: 131: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,954 INFO L273 TraceCheckUtils]: 132: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,954 INFO L273 TraceCheckUtils]: 133: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,954 INFO L273 TraceCheckUtils]: 134: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,954 INFO L273 TraceCheckUtils]: 135: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,954 INFO L273 TraceCheckUtils]: 136: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,954 INFO L273 TraceCheckUtils]: 137: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,954 INFO L273 TraceCheckUtils]: 138: Hoare triple {25764#true} assume !(~i~0 < 60); {25764#true} is VALID [2018-11-23 12:18:24,954 INFO L273 TraceCheckUtils]: 139: Hoare triple {25764#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {25764#true} is VALID [2018-11-23 12:18:24,955 INFO L273 TraceCheckUtils]: 140: Hoare triple {25764#true} assume true; {25764#true} is VALID [2018-11-23 12:18:24,955 INFO L268 TraceCheckUtils]: 141: Hoare quadruple {25764#true} {25765#false} #77#return; {25765#false} is VALID [2018-11-23 12:18:24,955 INFO L273 TraceCheckUtils]: 142: Hoare triple {25765#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {25765#false} is VALID [2018-11-23 12:18:24,955 INFO L273 TraceCheckUtils]: 143: Hoare triple {25765#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {25765#false} is VALID [2018-11-23 12:18:24,955 INFO L273 TraceCheckUtils]: 144: Hoare triple {25765#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {25765#false} is VALID [2018-11-23 12:18:24,955 INFO L273 TraceCheckUtils]: 145: Hoare triple {25765#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {25765#false} is VALID [2018-11-23 12:18:24,955 INFO L273 TraceCheckUtils]: 146: Hoare triple {25765#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {25765#false} is VALID [2018-11-23 12:18:24,955 INFO L273 TraceCheckUtils]: 147: Hoare triple {25765#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {25765#false} is VALID [2018-11-23 12:18:24,955 INFO L273 TraceCheckUtils]: 148: Hoare triple {25765#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {25765#false} is VALID [2018-11-23 12:18:24,955 INFO L273 TraceCheckUtils]: 149: Hoare triple {25765#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {25765#false} is VALID [2018-11-23 12:18:24,956 INFO L273 TraceCheckUtils]: 150: Hoare triple {25765#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {25765#false} is VALID [2018-11-23 12:18:24,956 INFO L273 TraceCheckUtils]: 151: Hoare triple {25765#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {25765#false} is VALID [2018-11-23 12:18:24,956 INFO L273 TraceCheckUtils]: 152: Hoare triple {25765#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {25765#false} is VALID [2018-11-23 12:18:24,956 INFO L273 TraceCheckUtils]: 153: Hoare triple {25765#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {25765#false} is VALID [2018-11-23 12:18:24,956 INFO L273 TraceCheckUtils]: 154: Hoare triple {25765#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {25765#false} is VALID [2018-11-23 12:18:24,956 INFO L273 TraceCheckUtils]: 155: Hoare triple {25765#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {25765#false} is VALID [2018-11-23 12:18:24,956 INFO L273 TraceCheckUtils]: 156: Hoare triple {25765#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {25765#false} is VALID [2018-11-23 12:18:24,956 INFO L273 TraceCheckUtils]: 157: Hoare triple {25765#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {25765#false} is VALID [2018-11-23 12:18:24,956 INFO L273 TraceCheckUtils]: 158: Hoare triple {25765#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {25765#false} is VALID [2018-11-23 12:18:24,957 INFO L273 TraceCheckUtils]: 159: Hoare triple {25765#false} assume !(~i~2 < 59); {25765#false} is VALID [2018-11-23 12:18:24,957 INFO L273 TraceCheckUtils]: 160: Hoare triple {25765#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {25765#false} is VALID [2018-11-23 12:18:24,957 INFO L256 TraceCheckUtils]: 161: Hoare triple {25765#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {25764#true} is VALID [2018-11-23 12:18:24,957 INFO L273 TraceCheckUtils]: 162: Hoare triple {25764#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {25764#true} is VALID [2018-11-23 12:18:24,957 INFO L273 TraceCheckUtils]: 163: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,957 INFO L273 TraceCheckUtils]: 164: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,957 INFO L273 TraceCheckUtils]: 165: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,957 INFO L273 TraceCheckUtils]: 166: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,957 INFO L273 TraceCheckUtils]: 167: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,957 INFO L273 TraceCheckUtils]: 168: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,957 INFO L273 TraceCheckUtils]: 169: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,958 INFO L273 TraceCheckUtils]: 170: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,958 INFO L273 TraceCheckUtils]: 171: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,958 INFO L273 TraceCheckUtils]: 172: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,958 INFO L273 TraceCheckUtils]: 173: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,958 INFO L273 TraceCheckUtils]: 174: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,958 INFO L273 TraceCheckUtils]: 175: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,958 INFO L273 TraceCheckUtils]: 176: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,958 INFO L273 TraceCheckUtils]: 177: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,958 INFO L273 TraceCheckUtils]: 178: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,958 INFO L273 TraceCheckUtils]: 179: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,958 INFO L273 TraceCheckUtils]: 180: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,959 INFO L273 TraceCheckUtils]: 181: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,959 INFO L273 TraceCheckUtils]: 182: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,959 INFO L273 TraceCheckUtils]: 183: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,959 INFO L273 TraceCheckUtils]: 184: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,959 INFO L273 TraceCheckUtils]: 185: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,959 INFO L273 TraceCheckUtils]: 186: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,959 INFO L273 TraceCheckUtils]: 187: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,959 INFO L273 TraceCheckUtils]: 188: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,959 INFO L273 TraceCheckUtils]: 189: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,959 INFO L273 TraceCheckUtils]: 190: Hoare triple {25764#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25764#true} is VALID [2018-11-23 12:18:24,959 INFO L273 TraceCheckUtils]: 191: Hoare triple {25764#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25764#true} is VALID [2018-11-23 12:18:24,960 INFO L273 TraceCheckUtils]: 192: Hoare triple {25764#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25764#true} is VALID [2018-11-23 12:18:24,960 INFO L273 TraceCheckUtils]: 193: Hoare triple {25764#true} assume !(~i~0 < 60); {25764#true} is VALID [2018-11-23 12:18:24,960 INFO L273 TraceCheckUtils]: 194: Hoare triple {25764#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {25764#true} is VALID [2018-11-23 12:18:24,960 INFO L273 TraceCheckUtils]: 195: Hoare triple {25764#true} assume true; {25764#true} is VALID [2018-11-23 12:18:24,960 INFO L268 TraceCheckUtils]: 196: Hoare quadruple {25764#true} {25765#false} #79#return; {25765#false} is VALID [2018-11-23 12:18:24,960 INFO L273 TraceCheckUtils]: 197: Hoare triple {25765#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {25765#false} is VALID [2018-11-23 12:18:24,960 INFO L273 TraceCheckUtils]: 198: Hoare triple {25765#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {25765#false} is VALID [2018-11-23 12:18:24,960 INFO L273 TraceCheckUtils]: 199: Hoare triple {25765#false} assume !false; {25765#false} is VALID [2018-11-23 12:18:25,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2435 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1474 trivial. 0 not checked. [2018-11-23 12:18:25,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:18:25,012 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:18:25,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:18:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:18:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:18:25,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:18:25,618 INFO L256 TraceCheckUtils]: 0: Hoare triple {25764#true} call ULTIMATE.init(); {25764#true} is VALID [2018-11-23 12:18:25,619 INFO L273 TraceCheckUtils]: 1: Hoare triple {25764#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25764#true} is VALID [2018-11-23 12:18:25,619 INFO L273 TraceCheckUtils]: 2: Hoare triple {25764#true} assume true; {25764#true} is VALID [2018-11-23 12:18:25,619 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25764#true} {25764#true} #71#return; {25764#true} is VALID [2018-11-23 12:18:25,619 INFO L256 TraceCheckUtils]: 4: Hoare triple {25764#true} call #t~ret14 := main(); {25764#true} is VALID [2018-11-23 12:18:25,620 INFO L273 TraceCheckUtils]: 5: Hoare triple {25764#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {25816#(<= main_~i~1 0)} is VALID [2018-11-23 12:18:25,620 INFO L273 TraceCheckUtils]: 6: Hoare triple {25816#(<= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25816#(<= main_~i~1 0)} is VALID [2018-11-23 12:18:25,621 INFO L273 TraceCheckUtils]: 7: Hoare triple {25816#(<= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25767#(<= main_~i~1 1)} is VALID [2018-11-23 12:18:25,622 INFO L273 TraceCheckUtils]: 8: Hoare triple {25767#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25767#(<= main_~i~1 1)} is VALID [2018-11-23 12:18:25,623 INFO L273 TraceCheckUtils]: 9: Hoare triple {25767#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25768#(<= main_~i~1 2)} is VALID [2018-11-23 12:18:25,623 INFO L273 TraceCheckUtils]: 10: Hoare triple {25768#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25768#(<= main_~i~1 2)} is VALID [2018-11-23 12:18:25,624 INFO L273 TraceCheckUtils]: 11: Hoare triple {25768#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25769#(<= main_~i~1 3)} is VALID [2018-11-23 12:18:25,624 INFO L273 TraceCheckUtils]: 12: Hoare triple {25769#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25769#(<= main_~i~1 3)} is VALID [2018-11-23 12:18:25,625 INFO L273 TraceCheckUtils]: 13: Hoare triple {25769#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25770#(<= main_~i~1 4)} is VALID [2018-11-23 12:18:25,626 INFO L273 TraceCheckUtils]: 14: Hoare triple {25770#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25770#(<= main_~i~1 4)} is VALID [2018-11-23 12:18:25,626 INFO L273 TraceCheckUtils]: 15: Hoare triple {25770#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25771#(<= main_~i~1 5)} is VALID [2018-11-23 12:18:25,627 INFO L273 TraceCheckUtils]: 16: Hoare triple {25771#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25771#(<= main_~i~1 5)} is VALID [2018-11-23 12:18:25,628 INFO L273 TraceCheckUtils]: 17: Hoare triple {25771#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25772#(<= main_~i~1 6)} is VALID [2018-11-23 12:18:25,628 INFO L273 TraceCheckUtils]: 18: Hoare triple {25772#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25772#(<= main_~i~1 6)} is VALID [2018-11-23 12:18:25,629 INFO L273 TraceCheckUtils]: 19: Hoare triple {25772#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25773#(<= main_~i~1 7)} is VALID [2018-11-23 12:18:25,629 INFO L273 TraceCheckUtils]: 20: Hoare triple {25773#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25773#(<= main_~i~1 7)} is VALID [2018-11-23 12:18:25,630 INFO L273 TraceCheckUtils]: 21: Hoare triple {25773#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25774#(<= main_~i~1 8)} is VALID [2018-11-23 12:18:25,630 INFO L273 TraceCheckUtils]: 22: Hoare triple {25774#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25774#(<= main_~i~1 8)} is VALID [2018-11-23 12:18:25,631 INFO L273 TraceCheckUtils]: 23: Hoare triple {25774#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25775#(<= main_~i~1 9)} is VALID [2018-11-23 12:18:25,632 INFO L273 TraceCheckUtils]: 24: Hoare triple {25775#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25775#(<= main_~i~1 9)} is VALID [2018-11-23 12:18:25,632 INFO L273 TraceCheckUtils]: 25: Hoare triple {25775#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25776#(<= main_~i~1 10)} is VALID [2018-11-23 12:18:25,633 INFO L273 TraceCheckUtils]: 26: Hoare triple {25776#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25776#(<= main_~i~1 10)} is VALID [2018-11-23 12:18:25,634 INFO L273 TraceCheckUtils]: 27: Hoare triple {25776#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25777#(<= main_~i~1 11)} is VALID [2018-11-23 12:18:25,634 INFO L273 TraceCheckUtils]: 28: Hoare triple {25777#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25777#(<= main_~i~1 11)} is VALID [2018-11-23 12:18:25,635 INFO L273 TraceCheckUtils]: 29: Hoare triple {25777#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25778#(<= main_~i~1 12)} is VALID [2018-11-23 12:18:25,635 INFO L273 TraceCheckUtils]: 30: Hoare triple {25778#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25778#(<= main_~i~1 12)} is VALID [2018-11-23 12:18:25,636 INFO L273 TraceCheckUtils]: 31: Hoare triple {25778#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25779#(<= main_~i~1 13)} is VALID [2018-11-23 12:18:25,637 INFO L273 TraceCheckUtils]: 32: Hoare triple {25779#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25779#(<= main_~i~1 13)} is VALID [2018-11-23 12:18:25,637 INFO L273 TraceCheckUtils]: 33: Hoare triple {25779#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25780#(<= main_~i~1 14)} is VALID [2018-11-23 12:18:25,638 INFO L273 TraceCheckUtils]: 34: Hoare triple {25780#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25780#(<= main_~i~1 14)} is VALID [2018-11-23 12:18:25,639 INFO L273 TraceCheckUtils]: 35: Hoare triple {25780#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25781#(<= main_~i~1 15)} is VALID [2018-11-23 12:18:25,639 INFO L273 TraceCheckUtils]: 36: Hoare triple {25781#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25781#(<= main_~i~1 15)} is VALID [2018-11-23 12:18:25,640 INFO L273 TraceCheckUtils]: 37: Hoare triple {25781#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25782#(<= main_~i~1 16)} is VALID [2018-11-23 12:18:25,640 INFO L273 TraceCheckUtils]: 38: Hoare triple {25782#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25782#(<= main_~i~1 16)} is VALID [2018-11-23 12:18:25,641 INFO L273 TraceCheckUtils]: 39: Hoare triple {25782#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25783#(<= main_~i~1 17)} is VALID [2018-11-23 12:18:25,642 INFO L273 TraceCheckUtils]: 40: Hoare triple {25783#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25783#(<= main_~i~1 17)} is VALID [2018-11-23 12:18:25,642 INFO L273 TraceCheckUtils]: 41: Hoare triple {25783#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25784#(<= main_~i~1 18)} is VALID [2018-11-23 12:18:25,643 INFO L273 TraceCheckUtils]: 42: Hoare triple {25784#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25784#(<= main_~i~1 18)} is VALID [2018-11-23 12:18:25,644 INFO L273 TraceCheckUtils]: 43: Hoare triple {25784#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25785#(<= main_~i~1 19)} is VALID [2018-11-23 12:18:25,644 INFO L273 TraceCheckUtils]: 44: Hoare triple {25785#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25785#(<= main_~i~1 19)} is VALID [2018-11-23 12:18:25,645 INFO L273 TraceCheckUtils]: 45: Hoare triple {25785#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25786#(<= main_~i~1 20)} is VALID [2018-11-23 12:18:25,645 INFO L273 TraceCheckUtils]: 46: Hoare triple {25786#(<= main_~i~1 20)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25786#(<= main_~i~1 20)} is VALID [2018-11-23 12:18:25,646 INFO L273 TraceCheckUtils]: 47: Hoare triple {25786#(<= main_~i~1 20)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25787#(<= main_~i~1 21)} is VALID [2018-11-23 12:18:25,647 INFO L273 TraceCheckUtils]: 48: Hoare triple {25787#(<= main_~i~1 21)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25787#(<= main_~i~1 21)} is VALID [2018-11-23 12:18:25,647 INFO L273 TraceCheckUtils]: 49: Hoare triple {25787#(<= main_~i~1 21)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25788#(<= main_~i~1 22)} is VALID [2018-11-23 12:18:25,648 INFO L273 TraceCheckUtils]: 50: Hoare triple {25788#(<= main_~i~1 22)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25788#(<= main_~i~1 22)} is VALID [2018-11-23 12:18:25,649 INFO L273 TraceCheckUtils]: 51: Hoare triple {25788#(<= main_~i~1 22)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25789#(<= main_~i~1 23)} is VALID [2018-11-23 12:18:25,649 INFO L273 TraceCheckUtils]: 52: Hoare triple {25789#(<= main_~i~1 23)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25789#(<= main_~i~1 23)} is VALID [2018-11-23 12:18:25,650 INFO L273 TraceCheckUtils]: 53: Hoare triple {25789#(<= main_~i~1 23)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25790#(<= main_~i~1 24)} is VALID [2018-11-23 12:18:25,650 INFO L273 TraceCheckUtils]: 54: Hoare triple {25790#(<= main_~i~1 24)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25790#(<= main_~i~1 24)} is VALID [2018-11-23 12:18:25,651 INFO L273 TraceCheckUtils]: 55: Hoare triple {25790#(<= main_~i~1 24)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25791#(<= main_~i~1 25)} is VALID [2018-11-23 12:18:25,652 INFO L273 TraceCheckUtils]: 56: Hoare triple {25791#(<= main_~i~1 25)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25791#(<= main_~i~1 25)} is VALID [2018-11-23 12:18:25,652 INFO L273 TraceCheckUtils]: 57: Hoare triple {25791#(<= main_~i~1 25)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25792#(<= main_~i~1 26)} is VALID [2018-11-23 12:18:25,653 INFO L273 TraceCheckUtils]: 58: Hoare triple {25792#(<= main_~i~1 26)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25792#(<= main_~i~1 26)} is VALID [2018-11-23 12:18:25,653 INFO L273 TraceCheckUtils]: 59: Hoare triple {25792#(<= main_~i~1 26)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25793#(<= main_~i~1 27)} is VALID [2018-11-23 12:18:25,654 INFO L273 TraceCheckUtils]: 60: Hoare triple {25793#(<= main_~i~1 27)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25793#(<= main_~i~1 27)} is VALID [2018-11-23 12:18:25,655 INFO L273 TraceCheckUtils]: 61: Hoare triple {25793#(<= main_~i~1 27)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25794#(<= main_~i~1 28)} is VALID [2018-11-23 12:18:25,655 INFO L273 TraceCheckUtils]: 62: Hoare triple {25794#(<= main_~i~1 28)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25794#(<= main_~i~1 28)} is VALID [2018-11-23 12:18:25,656 INFO L273 TraceCheckUtils]: 63: Hoare triple {25794#(<= main_~i~1 28)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25795#(<= main_~i~1 29)} is VALID [2018-11-23 12:18:25,656 INFO L273 TraceCheckUtils]: 64: Hoare triple {25795#(<= main_~i~1 29)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25795#(<= main_~i~1 29)} is VALID [2018-11-23 12:18:25,657 INFO L273 TraceCheckUtils]: 65: Hoare triple {25795#(<= main_~i~1 29)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25796#(<= main_~i~1 30)} is VALID [2018-11-23 12:18:25,658 INFO L273 TraceCheckUtils]: 66: Hoare triple {25796#(<= main_~i~1 30)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {25796#(<= main_~i~1 30)} is VALID [2018-11-23 12:18:25,658 INFO L273 TraceCheckUtils]: 67: Hoare triple {25796#(<= main_~i~1 30)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25797#(<= main_~i~1 31)} is VALID [2018-11-23 12:18:25,659 INFO L273 TraceCheckUtils]: 68: Hoare triple {25797#(<= main_~i~1 31)} assume !(~i~1 < 60); {25765#false} is VALID [2018-11-23 12:18:25,659 INFO L256 TraceCheckUtils]: 69: Hoare triple {25765#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {25765#false} is VALID [2018-11-23 12:18:25,659 INFO L273 TraceCheckUtils]: 70: Hoare triple {25765#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {25765#false} is VALID [2018-11-23 12:18:25,660 INFO L273 TraceCheckUtils]: 71: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,660 INFO L273 TraceCheckUtils]: 72: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,660 INFO L273 TraceCheckUtils]: 73: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,660 INFO L273 TraceCheckUtils]: 74: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,660 INFO L273 TraceCheckUtils]: 75: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,661 INFO L273 TraceCheckUtils]: 76: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,661 INFO L273 TraceCheckUtils]: 77: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,661 INFO L273 TraceCheckUtils]: 78: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,661 INFO L273 TraceCheckUtils]: 79: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,661 INFO L273 TraceCheckUtils]: 80: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,661 INFO L273 TraceCheckUtils]: 81: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,661 INFO L273 TraceCheckUtils]: 82: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,662 INFO L273 TraceCheckUtils]: 83: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,662 INFO L273 TraceCheckUtils]: 84: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,662 INFO L273 TraceCheckUtils]: 85: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,662 INFO L273 TraceCheckUtils]: 86: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,662 INFO L273 TraceCheckUtils]: 87: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,662 INFO L273 TraceCheckUtils]: 88: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,662 INFO L273 TraceCheckUtils]: 89: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,662 INFO L273 TraceCheckUtils]: 90: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,662 INFO L273 TraceCheckUtils]: 91: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,662 INFO L273 TraceCheckUtils]: 92: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,663 INFO L273 TraceCheckUtils]: 93: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,663 INFO L273 TraceCheckUtils]: 94: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,663 INFO L273 TraceCheckUtils]: 95: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,663 INFO L273 TraceCheckUtils]: 96: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,663 INFO L273 TraceCheckUtils]: 97: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,663 INFO L273 TraceCheckUtils]: 98: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,663 INFO L273 TraceCheckUtils]: 99: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,663 INFO L273 TraceCheckUtils]: 100: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,663 INFO L273 TraceCheckUtils]: 101: Hoare triple {25765#false} assume !(~i~0 < 60); {25765#false} is VALID [2018-11-23 12:18:25,664 INFO L273 TraceCheckUtils]: 102: Hoare triple {25765#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {25765#false} is VALID [2018-11-23 12:18:25,664 INFO L273 TraceCheckUtils]: 103: Hoare triple {25765#false} assume true; {25765#false} is VALID [2018-11-23 12:18:25,664 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {25765#false} {25765#false} #75#return; {25765#false} is VALID [2018-11-23 12:18:25,664 INFO L273 TraceCheckUtils]: 105: Hoare triple {25765#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {25765#false} is VALID [2018-11-23 12:18:25,664 INFO L256 TraceCheckUtils]: 106: Hoare triple {25765#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {25765#false} is VALID [2018-11-23 12:18:25,664 INFO L273 TraceCheckUtils]: 107: Hoare triple {25765#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {25765#false} is VALID [2018-11-23 12:18:25,664 INFO L273 TraceCheckUtils]: 108: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,664 INFO L273 TraceCheckUtils]: 109: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,664 INFO L273 TraceCheckUtils]: 110: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,664 INFO L273 TraceCheckUtils]: 111: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,665 INFO L273 TraceCheckUtils]: 112: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,665 INFO L273 TraceCheckUtils]: 113: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,665 INFO L273 TraceCheckUtils]: 114: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,665 INFO L273 TraceCheckUtils]: 115: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,665 INFO L273 TraceCheckUtils]: 116: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,665 INFO L273 TraceCheckUtils]: 117: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,665 INFO L273 TraceCheckUtils]: 118: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,665 INFO L273 TraceCheckUtils]: 119: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,665 INFO L273 TraceCheckUtils]: 120: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,665 INFO L273 TraceCheckUtils]: 121: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,666 INFO L273 TraceCheckUtils]: 122: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,666 INFO L273 TraceCheckUtils]: 123: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,666 INFO L273 TraceCheckUtils]: 124: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,666 INFO L273 TraceCheckUtils]: 125: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,666 INFO L273 TraceCheckUtils]: 126: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,666 INFO L273 TraceCheckUtils]: 127: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,666 INFO L273 TraceCheckUtils]: 128: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,666 INFO L273 TraceCheckUtils]: 129: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,666 INFO L273 TraceCheckUtils]: 130: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,666 INFO L273 TraceCheckUtils]: 131: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,667 INFO L273 TraceCheckUtils]: 132: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,667 INFO L273 TraceCheckUtils]: 133: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,667 INFO L273 TraceCheckUtils]: 134: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,667 INFO L273 TraceCheckUtils]: 135: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,667 INFO L273 TraceCheckUtils]: 136: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,667 INFO L273 TraceCheckUtils]: 137: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,667 INFO L273 TraceCheckUtils]: 138: Hoare triple {25765#false} assume !(~i~0 < 60); {25765#false} is VALID [2018-11-23 12:18:25,667 INFO L273 TraceCheckUtils]: 139: Hoare triple {25765#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {25765#false} is VALID [2018-11-23 12:18:25,667 INFO L273 TraceCheckUtils]: 140: Hoare triple {25765#false} assume true; {25765#false} is VALID [2018-11-23 12:18:25,667 INFO L268 TraceCheckUtils]: 141: Hoare quadruple {25765#false} {25765#false} #77#return; {25765#false} is VALID [2018-11-23 12:18:25,668 INFO L273 TraceCheckUtils]: 142: Hoare triple {25765#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {25765#false} is VALID [2018-11-23 12:18:25,668 INFO L273 TraceCheckUtils]: 143: Hoare triple {25765#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {25765#false} is VALID [2018-11-23 12:18:25,668 INFO L273 TraceCheckUtils]: 144: Hoare triple {25765#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {25765#false} is VALID [2018-11-23 12:18:25,668 INFO L273 TraceCheckUtils]: 145: Hoare triple {25765#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {25765#false} is VALID [2018-11-23 12:18:25,668 INFO L273 TraceCheckUtils]: 146: Hoare triple {25765#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {25765#false} is VALID [2018-11-23 12:18:25,668 INFO L273 TraceCheckUtils]: 147: Hoare triple {25765#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {25765#false} is VALID [2018-11-23 12:18:25,668 INFO L273 TraceCheckUtils]: 148: Hoare triple {25765#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {25765#false} is VALID [2018-11-23 12:18:25,668 INFO L273 TraceCheckUtils]: 149: Hoare triple {25765#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {25765#false} is VALID [2018-11-23 12:18:25,668 INFO L273 TraceCheckUtils]: 150: Hoare triple {25765#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {25765#false} is VALID [2018-11-23 12:18:25,668 INFO L273 TraceCheckUtils]: 151: Hoare triple {25765#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {25765#false} is VALID [2018-11-23 12:18:25,669 INFO L273 TraceCheckUtils]: 152: Hoare triple {25765#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {25765#false} is VALID [2018-11-23 12:18:25,669 INFO L273 TraceCheckUtils]: 153: Hoare triple {25765#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {25765#false} is VALID [2018-11-23 12:18:25,669 INFO L273 TraceCheckUtils]: 154: Hoare triple {25765#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {25765#false} is VALID [2018-11-23 12:18:25,669 INFO L273 TraceCheckUtils]: 155: Hoare triple {25765#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {25765#false} is VALID [2018-11-23 12:18:25,669 INFO L273 TraceCheckUtils]: 156: Hoare triple {25765#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {25765#false} is VALID [2018-11-23 12:18:25,669 INFO L273 TraceCheckUtils]: 157: Hoare triple {25765#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {25765#false} is VALID [2018-11-23 12:18:25,669 INFO L273 TraceCheckUtils]: 158: Hoare triple {25765#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {25765#false} is VALID [2018-11-23 12:18:25,669 INFO L273 TraceCheckUtils]: 159: Hoare triple {25765#false} assume !(~i~2 < 59); {25765#false} is VALID [2018-11-23 12:18:25,669 INFO L273 TraceCheckUtils]: 160: Hoare triple {25765#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {25765#false} is VALID [2018-11-23 12:18:25,670 INFO L256 TraceCheckUtils]: 161: Hoare triple {25765#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {25765#false} is VALID [2018-11-23 12:18:25,670 INFO L273 TraceCheckUtils]: 162: Hoare triple {25765#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {25765#false} is VALID [2018-11-23 12:18:25,670 INFO L273 TraceCheckUtils]: 163: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,670 INFO L273 TraceCheckUtils]: 164: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,670 INFO L273 TraceCheckUtils]: 165: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,670 INFO L273 TraceCheckUtils]: 166: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,670 INFO L273 TraceCheckUtils]: 167: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,670 INFO L273 TraceCheckUtils]: 168: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,670 INFO L273 TraceCheckUtils]: 169: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,670 INFO L273 TraceCheckUtils]: 170: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,671 INFO L273 TraceCheckUtils]: 171: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,671 INFO L273 TraceCheckUtils]: 172: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,671 INFO L273 TraceCheckUtils]: 173: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,671 INFO L273 TraceCheckUtils]: 174: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,671 INFO L273 TraceCheckUtils]: 175: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,671 INFO L273 TraceCheckUtils]: 176: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,671 INFO L273 TraceCheckUtils]: 177: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,671 INFO L273 TraceCheckUtils]: 178: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,671 INFO L273 TraceCheckUtils]: 179: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,671 INFO L273 TraceCheckUtils]: 180: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,672 INFO L273 TraceCheckUtils]: 181: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,672 INFO L273 TraceCheckUtils]: 182: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,672 INFO L273 TraceCheckUtils]: 183: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,672 INFO L273 TraceCheckUtils]: 184: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,672 INFO L273 TraceCheckUtils]: 185: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,672 INFO L273 TraceCheckUtils]: 186: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,672 INFO L273 TraceCheckUtils]: 187: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,672 INFO L273 TraceCheckUtils]: 188: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,672 INFO L273 TraceCheckUtils]: 189: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,672 INFO L273 TraceCheckUtils]: 190: Hoare triple {25765#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {25765#false} is VALID [2018-11-23 12:18:25,673 INFO L273 TraceCheckUtils]: 191: Hoare triple {25765#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {25765#false} is VALID [2018-11-23 12:18:25,673 INFO L273 TraceCheckUtils]: 192: Hoare triple {25765#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {25765#false} is VALID [2018-11-23 12:18:25,673 INFO L273 TraceCheckUtils]: 193: Hoare triple {25765#false} assume !(~i~0 < 60); {25765#false} is VALID [2018-11-23 12:18:25,673 INFO L273 TraceCheckUtils]: 194: Hoare triple {25765#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {25765#false} is VALID [2018-11-23 12:18:25,673 INFO L273 TraceCheckUtils]: 195: Hoare triple {25765#false} assume true; {25765#false} is VALID [2018-11-23 12:18:25,673 INFO L268 TraceCheckUtils]: 196: Hoare quadruple {25765#false} {25765#false} #79#return; {25765#false} is VALID [2018-11-23 12:18:25,673 INFO L273 TraceCheckUtils]: 197: Hoare triple {25765#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {25765#false} is VALID [2018-11-23 12:18:25,673 INFO L273 TraceCheckUtils]: 198: Hoare triple {25765#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {25765#false} is VALID [2018-11-23 12:18:25,673 INFO L273 TraceCheckUtils]: 199: Hoare triple {25765#false} assume !false; {25765#false} is VALID [2018-11-23 12:18:25,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2435 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1474 trivial. 0 not checked. [2018-11-23 12:18:25,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:18:25,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-23 12:18:25,711 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 200 [2018-11-23 12:18:25,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:18:25,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:18:25,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:18:25,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:18:25,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:18:25,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:18:25,817 INFO L87 Difference]: Start difference. First operand 131 states and 145 transitions. Second operand 35 states. [2018-11-23 12:18:26,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:26,198 INFO L93 Difference]: Finished difference Result 196 states and 224 transitions. [2018-11-23 12:18:26,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:18:26,198 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 200 [2018-11-23 12:18:26,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:18:26,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:18:26,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 120 transitions. [2018-11-23 12:18:26,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:18:26,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 120 transitions. [2018-11-23 12:18:26,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 120 transitions. [2018-11-23 12:18:26,359 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:18:26,363 INFO L225 Difference]: With dead ends: 196 [2018-11-23 12:18:26,363 INFO L226 Difference]: Without dead ends: 134 [2018-11-23 12:18:26,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:18:26,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-23 12:18:26,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-11-23 12:18:26,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:18:26,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand 133 states. [2018-11-23 12:18:26,445 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 133 states. [2018-11-23 12:18:26,445 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 133 states. [2018-11-23 12:18:26,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:26,448 INFO L93 Difference]: Finished difference Result 134 states and 148 transitions. [2018-11-23 12:18:26,448 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2018-11-23 12:18:26,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:18:26,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:18:26,448 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 134 states. [2018-11-23 12:18:26,449 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 134 states. [2018-11-23 12:18:26,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:26,450 INFO L93 Difference]: Finished difference Result 134 states and 148 transitions. [2018-11-23 12:18:26,451 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2018-11-23 12:18:26,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:18:26,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:18:26,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:18:26,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:18:26,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-23 12:18:26,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 147 transitions. [2018-11-23 12:18:26,454 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 147 transitions. Word has length 200 [2018-11-23 12:18:26,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:18:26,454 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 147 transitions. [2018-11-23 12:18:26,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:18:26,454 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2018-11-23 12:18:26,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-23 12:18:26,455 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:18:26,455 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 30, 30, 30, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:18:26,455 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:18:26,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:18:26,456 INFO L82 PathProgramCache]: Analyzing trace with hash 88488390, now seen corresponding path program 32 times [2018-11-23 12:18:26,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:18:26,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:18:26,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:26,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:18:26,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:18:27,259 INFO L256 TraceCheckUtils]: 0: Hoare triple {27141#true} call ULTIMATE.init(); {27141#true} is VALID [2018-11-23 12:18:27,259 INFO L273 TraceCheckUtils]: 1: Hoare triple {27141#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27141#true} is VALID [2018-11-23 12:18:27,259 INFO L273 TraceCheckUtils]: 2: Hoare triple {27141#true} assume true; {27141#true} is VALID [2018-11-23 12:18:27,259 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27141#true} {27141#true} #71#return; {27141#true} is VALID [2018-11-23 12:18:27,259 INFO L256 TraceCheckUtils]: 4: Hoare triple {27141#true} call #t~ret14 := main(); {27141#true} is VALID [2018-11-23 12:18:27,260 INFO L273 TraceCheckUtils]: 5: Hoare triple {27141#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {27143#(= main_~i~1 0)} is VALID [2018-11-23 12:18:27,260 INFO L273 TraceCheckUtils]: 6: Hoare triple {27143#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27143#(= main_~i~1 0)} is VALID [2018-11-23 12:18:27,261 INFO L273 TraceCheckUtils]: 7: Hoare triple {27143#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27144#(<= main_~i~1 1)} is VALID [2018-11-23 12:18:27,262 INFO L273 TraceCheckUtils]: 8: Hoare triple {27144#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27144#(<= main_~i~1 1)} is VALID [2018-11-23 12:18:27,262 INFO L273 TraceCheckUtils]: 9: Hoare triple {27144#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27145#(<= main_~i~1 2)} is VALID [2018-11-23 12:18:27,262 INFO L273 TraceCheckUtils]: 10: Hoare triple {27145#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27145#(<= main_~i~1 2)} is VALID [2018-11-23 12:18:27,263 INFO L273 TraceCheckUtils]: 11: Hoare triple {27145#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27146#(<= main_~i~1 3)} is VALID [2018-11-23 12:18:27,263 INFO L273 TraceCheckUtils]: 12: Hoare triple {27146#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27146#(<= main_~i~1 3)} is VALID [2018-11-23 12:18:27,264 INFO L273 TraceCheckUtils]: 13: Hoare triple {27146#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27147#(<= main_~i~1 4)} is VALID [2018-11-23 12:18:27,264 INFO L273 TraceCheckUtils]: 14: Hoare triple {27147#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27147#(<= main_~i~1 4)} is VALID [2018-11-23 12:18:27,265 INFO L273 TraceCheckUtils]: 15: Hoare triple {27147#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27148#(<= main_~i~1 5)} is VALID [2018-11-23 12:18:27,265 INFO L273 TraceCheckUtils]: 16: Hoare triple {27148#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27148#(<= main_~i~1 5)} is VALID [2018-11-23 12:18:27,266 INFO L273 TraceCheckUtils]: 17: Hoare triple {27148#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27149#(<= main_~i~1 6)} is VALID [2018-11-23 12:18:27,267 INFO L273 TraceCheckUtils]: 18: Hoare triple {27149#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27149#(<= main_~i~1 6)} is VALID [2018-11-23 12:18:27,267 INFO L273 TraceCheckUtils]: 19: Hoare triple {27149#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27150#(<= main_~i~1 7)} is VALID [2018-11-23 12:18:27,268 INFO L273 TraceCheckUtils]: 20: Hoare triple {27150#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27150#(<= main_~i~1 7)} is VALID [2018-11-23 12:18:27,269 INFO L273 TraceCheckUtils]: 21: Hoare triple {27150#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27151#(<= main_~i~1 8)} is VALID [2018-11-23 12:18:27,269 INFO L273 TraceCheckUtils]: 22: Hoare triple {27151#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27151#(<= main_~i~1 8)} is VALID [2018-11-23 12:18:27,270 INFO L273 TraceCheckUtils]: 23: Hoare triple {27151#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27152#(<= main_~i~1 9)} is VALID [2018-11-23 12:18:27,270 INFO L273 TraceCheckUtils]: 24: Hoare triple {27152#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27152#(<= main_~i~1 9)} is VALID [2018-11-23 12:18:27,271 INFO L273 TraceCheckUtils]: 25: Hoare triple {27152#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27153#(<= main_~i~1 10)} is VALID [2018-11-23 12:18:27,272 INFO L273 TraceCheckUtils]: 26: Hoare triple {27153#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27153#(<= main_~i~1 10)} is VALID [2018-11-23 12:18:27,272 INFO L273 TraceCheckUtils]: 27: Hoare triple {27153#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27154#(<= main_~i~1 11)} is VALID [2018-11-23 12:18:27,273 INFO L273 TraceCheckUtils]: 28: Hoare triple {27154#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27154#(<= main_~i~1 11)} is VALID [2018-11-23 12:18:27,274 INFO L273 TraceCheckUtils]: 29: Hoare triple {27154#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27155#(<= main_~i~1 12)} is VALID [2018-11-23 12:18:27,274 INFO L273 TraceCheckUtils]: 30: Hoare triple {27155#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27155#(<= main_~i~1 12)} is VALID [2018-11-23 12:18:27,275 INFO L273 TraceCheckUtils]: 31: Hoare triple {27155#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27156#(<= main_~i~1 13)} is VALID [2018-11-23 12:18:27,275 INFO L273 TraceCheckUtils]: 32: Hoare triple {27156#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27156#(<= main_~i~1 13)} is VALID [2018-11-23 12:18:27,276 INFO L273 TraceCheckUtils]: 33: Hoare triple {27156#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27157#(<= main_~i~1 14)} is VALID [2018-11-23 12:18:27,277 INFO L273 TraceCheckUtils]: 34: Hoare triple {27157#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27157#(<= main_~i~1 14)} is VALID [2018-11-23 12:18:27,277 INFO L273 TraceCheckUtils]: 35: Hoare triple {27157#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27158#(<= main_~i~1 15)} is VALID [2018-11-23 12:18:27,278 INFO L273 TraceCheckUtils]: 36: Hoare triple {27158#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27158#(<= main_~i~1 15)} is VALID [2018-11-23 12:18:27,278 INFO L273 TraceCheckUtils]: 37: Hoare triple {27158#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27159#(<= main_~i~1 16)} is VALID [2018-11-23 12:18:27,279 INFO L273 TraceCheckUtils]: 38: Hoare triple {27159#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27159#(<= main_~i~1 16)} is VALID [2018-11-23 12:18:27,280 INFO L273 TraceCheckUtils]: 39: Hoare triple {27159#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27160#(<= main_~i~1 17)} is VALID [2018-11-23 12:18:27,280 INFO L273 TraceCheckUtils]: 40: Hoare triple {27160#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27160#(<= main_~i~1 17)} is VALID [2018-11-23 12:18:27,281 INFO L273 TraceCheckUtils]: 41: Hoare triple {27160#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27161#(<= main_~i~1 18)} is VALID [2018-11-23 12:18:27,281 INFO L273 TraceCheckUtils]: 42: Hoare triple {27161#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27161#(<= main_~i~1 18)} is VALID [2018-11-23 12:18:27,282 INFO L273 TraceCheckUtils]: 43: Hoare triple {27161#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27162#(<= main_~i~1 19)} is VALID [2018-11-23 12:18:27,283 INFO L273 TraceCheckUtils]: 44: Hoare triple {27162#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27162#(<= main_~i~1 19)} is VALID [2018-11-23 12:18:27,283 INFO L273 TraceCheckUtils]: 45: Hoare triple {27162#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27163#(<= main_~i~1 20)} is VALID [2018-11-23 12:18:27,284 INFO L273 TraceCheckUtils]: 46: Hoare triple {27163#(<= main_~i~1 20)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27163#(<= main_~i~1 20)} is VALID [2018-11-23 12:18:27,285 INFO L273 TraceCheckUtils]: 47: Hoare triple {27163#(<= main_~i~1 20)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27164#(<= main_~i~1 21)} is VALID [2018-11-23 12:18:27,285 INFO L273 TraceCheckUtils]: 48: Hoare triple {27164#(<= main_~i~1 21)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27164#(<= main_~i~1 21)} is VALID [2018-11-23 12:18:27,286 INFO L273 TraceCheckUtils]: 49: Hoare triple {27164#(<= main_~i~1 21)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27165#(<= main_~i~1 22)} is VALID [2018-11-23 12:18:27,286 INFO L273 TraceCheckUtils]: 50: Hoare triple {27165#(<= main_~i~1 22)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27165#(<= main_~i~1 22)} is VALID [2018-11-23 12:18:27,287 INFO L273 TraceCheckUtils]: 51: Hoare triple {27165#(<= main_~i~1 22)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27166#(<= main_~i~1 23)} is VALID [2018-11-23 12:18:27,288 INFO L273 TraceCheckUtils]: 52: Hoare triple {27166#(<= main_~i~1 23)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27166#(<= main_~i~1 23)} is VALID [2018-11-23 12:18:27,288 INFO L273 TraceCheckUtils]: 53: Hoare triple {27166#(<= main_~i~1 23)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27167#(<= main_~i~1 24)} is VALID [2018-11-23 12:18:27,289 INFO L273 TraceCheckUtils]: 54: Hoare triple {27167#(<= main_~i~1 24)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27167#(<= main_~i~1 24)} is VALID [2018-11-23 12:18:27,290 INFO L273 TraceCheckUtils]: 55: Hoare triple {27167#(<= main_~i~1 24)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27168#(<= main_~i~1 25)} is VALID [2018-11-23 12:18:27,290 INFO L273 TraceCheckUtils]: 56: Hoare triple {27168#(<= main_~i~1 25)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27168#(<= main_~i~1 25)} is VALID [2018-11-23 12:18:27,291 INFO L273 TraceCheckUtils]: 57: Hoare triple {27168#(<= main_~i~1 25)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27169#(<= main_~i~1 26)} is VALID [2018-11-23 12:18:27,291 INFO L273 TraceCheckUtils]: 58: Hoare triple {27169#(<= main_~i~1 26)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27169#(<= main_~i~1 26)} is VALID [2018-11-23 12:18:27,292 INFO L273 TraceCheckUtils]: 59: Hoare triple {27169#(<= main_~i~1 26)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27170#(<= main_~i~1 27)} is VALID [2018-11-23 12:18:27,293 INFO L273 TraceCheckUtils]: 60: Hoare triple {27170#(<= main_~i~1 27)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27170#(<= main_~i~1 27)} is VALID [2018-11-23 12:18:27,293 INFO L273 TraceCheckUtils]: 61: Hoare triple {27170#(<= main_~i~1 27)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27171#(<= main_~i~1 28)} is VALID [2018-11-23 12:18:27,294 INFO L273 TraceCheckUtils]: 62: Hoare triple {27171#(<= main_~i~1 28)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27171#(<= main_~i~1 28)} is VALID [2018-11-23 12:18:27,295 INFO L273 TraceCheckUtils]: 63: Hoare triple {27171#(<= main_~i~1 28)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27172#(<= main_~i~1 29)} is VALID [2018-11-23 12:18:27,295 INFO L273 TraceCheckUtils]: 64: Hoare triple {27172#(<= main_~i~1 29)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27172#(<= main_~i~1 29)} is VALID [2018-11-23 12:18:27,296 INFO L273 TraceCheckUtils]: 65: Hoare triple {27172#(<= main_~i~1 29)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27173#(<= main_~i~1 30)} is VALID [2018-11-23 12:18:27,296 INFO L273 TraceCheckUtils]: 66: Hoare triple {27173#(<= main_~i~1 30)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27173#(<= main_~i~1 30)} is VALID [2018-11-23 12:18:27,297 INFO L273 TraceCheckUtils]: 67: Hoare triple {27173#(<= main_~i~1 30)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27174#(<= main_~i~1 31)} is VALID [2018-11-23 12:18:27,298 INFO L273 TraceCheckUtils]: 68: Hoare triple {27174#(<= main_~i~1 31)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27174#(<= main_~i~1 31)} is VALID [2018-11-23 12:18:27,298 INFO L273 TraceCheckUtils]: 69: Hoare triple {27174#(<= main_~i~1 31)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27175#(<= main_~i~1 32)} is VALID [2018-11-23 12:18:27,299 INFO L273 TraceCheckUtils]: 70: Hoare triple {27175#(<= main_~i~1 32)} assume !(~i~1 < 60); {27142#false} is VALID [2018-11-23 12:18:27,299 INFO L256 TraceCheckUtils]: 71: Hoare triple {27142#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {27141#true} is VALID [2018-11-23 12:18:27,299 INFO L273 TraceCheckUtils]: 72: Hoare triple {27141#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {27141#true} is VALID [2018-11-23 12:18:27,300 INFO L273 TraceCheckUtils]: 73: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,300 INFO L273 TraceCheckUtils]: 74: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,300 INFO L273 TraceCheckUtils]: 75: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,300 INFO L273 TraceCheckUtils]: 76: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,300 INFO L273 TraceCheckUtils]: 77: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,300 INFO L273 TraceCheckUtils]: 78: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,301 INFO L273 TraceCheckUtils]: 79: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,301 INFO L273 TraceCheckUtils]: 80: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,301 INFO L273 TraceCheckUtils]: 81: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,301 INFO L273 TraceCheckUtils]: 82: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,301 INFO L273 TraceCheckUtils]: 83: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,301 INFO L273 TraceCheckUtils]: 84: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,302 INFO L273 TraceCheckUtils]: 85: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,302 INFO L273 TraceCheckUtils]: 86: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,302 INFO L273 TraceCheckUtils]: 87: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,302 INFO L273 TraceCheckUtils]: 88: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,302 INFO L273 TraceCheckUtils]: 89: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,302 INFO L273 TraceCheckUtils]: 90: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,302 INFO L273 TraceCheckUtils]: 91: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,302 INFO L273 TraceCheckUtils]: 92: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,302 INFO L273 TraceCheckUtils]: 93: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,302 INFO L273 TraceCheckUtils]: 94: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,303 INFO L273 TraceCheckUtils]: 95: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,303 INFO L273 TraceCheckUtils]: 96: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,303 INFO L273 TraceCheckUtils]: 97: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,303 INFO L273 TraceCheckUtils]: 98: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,303 INFO L273 TraceCheckUtils]: 99: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,303 INFO L273 TraceCheckUtils]: 100: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,303 INFO L273 TraceCheckUtils]: 101: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,303 INFO L273 TraceCheckUtils]: 102: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,303 INFO L273 TraceCheckUtils]: 103: Hoare triple {27141#true} assume !(~i~0 < 60); {27141#true} is VALID [2018-11-23 12:18:27,303 INFO L273 TraceCheckUtils]: 104: Hoare triple {27141#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {27141#true} is VALID [2018-11-23 12:18:27,304 INFO L273 TraceCheckUtils]: 105: Hoare triple {27141#true} assume true; {27141#true} is VALID [2018-11-23 12:18:27,304 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {27141#true} {27142#false} #75#return; {27142#false} is VALID [2018-11-23 12:18:27,304 INFO L273 TraceCheckUtils]: 107: Hoare triple {27142#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {27142#false} is VALID [2018-11-23 12:18:27,304 INFO L256 TraceCheckUtils]: 108: Hoare triple {27142#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {27141#true} is VALID [2018-11-23 12:18:27,304 INFO L273 TraceCheckUtils]: 109: Hoare triple {27141#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {27141#true} is VALID [2018-11-23 12:18:27,304 INFO L273 TraceCheckUtils]: 110: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,304 INFO L273 TraceCheckUtils]: 111: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,304 INFO L273 TraceCheckUtils]: 112: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,304 INFO L273 TraceCheckUtils]: 113: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,305 INFO L273 TraceCheckUtils]: 114: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,305 INFO L273 TraceCheckUtils]: 115: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,305 INFO L273 TraceCheckUtils]: 116: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,305 INFO L273 TraceCheckUtils]: 117: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,305 INFO L273 TraceCheckUtils]: 118: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,305 INFO L273 TraceCheckUtils]: 119: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,305 INFO L273 TraceCheckUtils]: 120: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,305 INFO L273 TraceCheckUtils]: 121: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,305 INFO L273 TraceCheckUtils]: 122: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,305 INFO L273 TraceCheckUtils]: 123: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,306 INFO L273 TraceCheckUtils]: 124: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,306 INFO L273 TraceCheckUtils]: 125: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,306 INFO L273 TraceCheckUtils]: 126: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,306 INFO L273 TraceCheckUtils]: 127: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,306 INFO L273 TraceCheckUtils]: 128: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,306 INFO L273 TraceCheckUtils]: 129: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,306 INFO L273 TraceCheckUtils]: 130: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,306 INFO L273 TraceCheckUtils]: 131: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,306 INFO L273 TraceCheckUtils]: 132: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,306 INFO L273 TraceCheckUtils]: 133: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,307 INFO L273 TraceCheckUtils]: 134: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,307 INFO L273 TraceCheckUtils]: 135: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,307 INFO L273 TraceCheckUtils]: 136: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,307 INFO L273 TraceCheckUtils]: 137: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,307 INFO L273 TraceCheckUtils]: 138: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,307 INFO L273 TraceCheckUtils]: 139: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,307 INFO L273 TraceCheckUtils]: 140: Hoare triple {27141#true} assume !(~i~0 < 60); {27141#true} is VALID [2018-11-23 12:18:27,307 INFO L273 TraceCheckUtils]: 141: Hoare triple {27141#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {27141#true} is VALID [2018-11-23 12:18:27,307 INFO L273 TraceCheckUtils]: 142: Hoare triple {27141#true} assume true; {27141#true} is VALID [2018-11-23 12:18:27,307 INFO L268 TraceCheckUtils]: 143: Hoare quadruple {27141#true} {27142#false} #77#return; {27142#false} is VALID [2018-11-23 12:18:27,308 INFO L273 TraceCheckUtils]: 144: Hoare triple {27142#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {27142#false} is VALID [2018-11-23 12:18:27,308 INFO L273 TraceCheckUtils]: 145: Hoare triple {27142#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {27142#false} is VALID [2018-11-23 12:18:27,308 INFO L273 TraceCheckUtils]: 146: Hoare triple {27142#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {27142#false} is VALID [2018-11-23 12:18:27,308 INFO L273 TraceCheckUtils]: 147: Hoare triple {27142#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {27142#false} is VALID [2018-11-23 12:18:27,308 INFO L273 TraceCheckUtils]: 148: Hoare triple {27142#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {27142#false} is VALID [2018-11-23 12:18:27,308 INFO L273 TraceCheckUtils]: 149: Hoare triple {27142#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {27142#false} is VALID [2018-11-23 12:18:27,308 INFO L273 TraceCheckUtils]: 150: Hoare triple {27142#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {27142#false} is VALID [2018-11-23 12:18:27,308 INFO L273 TraceCheckUtils]: 151: Hoare triple {27142#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {27142#false} is VALID [2018-11-23 12:18:27,308 INFO L273 TraceCheckUtils]: 152: Hoare triple {27142#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {27142#false} is VALID [2018-11-23 12:18:27,309 INFO L273 TraceCheckUtils]: 153: Hoare triple {27142#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {27142#false} is VALID [2018-11-23 12:18:27,309 INFO L273 TraceCheckUtils]: 154: Hoare triple {27142#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {27142#false} is VALID [2018-11-23 12:18:27,309 INFO L273 TraceCheckUtils]: 155: Hoare triple {27142#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {27142#false} is VALID [2018-11-23 12:18:27,309 INFO L273 TraceCheckUtils]: 156: Hoare triple {27142#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {27142#false} is VALID [2018-11-23 12:18:27,309 INFO L273 TraceCheckUtils]: 157: Hoare triple {27142#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {27142#false} is VALID [2018-11-23 12:18:27,309 INFO L273 TraceCheckUtils]: 158: Hoare triple {27142#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {27142#false} is VALID [2018-11-23 12:18:27,309 INFO L273 TraceCheckUtils]: 159: Hoare triple {27142#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {27142#false} is VALID [2018-11-23 12:18:27,309 INFO L273 TraceCheckUtils]: 160: Hoare triple {27142#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {27142#false} is VALID [2018-11-23 12:18:27,309 INFO L273 TraceCheckUtils]: 161: Hoare triple {27142#false} assume !(~i~2 < 59); {27142#false} is VALID [2018-11-23 12:18:27,309 INFO L273 TraceCheckUtils]: 162: Hoare triple {27142#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {27142#false} is VALID [2018-11-23 12:18:27,310 INFO L256 TraceCheckUtils]: 163: Hoare triple {27142#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {27141#true} is VALID [2018-11-23 12:18:27,310 INFO L273 TraceCheckUtils]: 164: Hoare triple {27141#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {27141#true} is VALID [2018-11-23 12:18:27,310 INFO L273 TraceCheckUtils]: 165: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,310 INFO L273 TraceCheckUtils]: 166: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,310 INFO L273 TraceCheckUtils]: 167: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,310 INFO L273 TraceCheckUtils]: 168: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,310 INFO L273 TraceCheckUtils]: 169: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,310 INFO L273 TraceCheckUtils]: 170: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,310 INFO L273 TraceCheckUtils]: 171: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,310 INFO L273 TraceCheckUtils]: 172: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,311 INFO L273 TraceCheckUtils]: 173: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,311 INFO L273 TraceCheckUtils]: 174: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,311 INFO L273 TraceCheckUtils]: 175: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,311 INFO L273 TraceCheckUtils]: 176: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,311 INFO L273 TraceCheckUtils]: 177: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,311 INFO L273 TraceCheckUtils]: 178: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,311 INFO L273 TraceCheckUtils]: 179: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,311 INFO L273 TraceCheckUtils]: 180: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,311 INFO L273 TraceCheckUtils]: 181: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,311 INFO L273 TraceCheckUtils]: 182: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,312 INFO L273 TraceCheckUtils]: 183: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,312 INFO L273 TraceCheckUtils]: 184: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,312 INFO L273 TraceCheckUtils]: 185: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,312 INFO L273 TraceCheckUtils]: 186: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,312 INFO L273 TraceCheckUtils]: 187: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,312 INFO L273 TraceCheckUtils]: 188: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,312 INFO L273 TraceCheckUtils]: 189: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,312 INFO L273 TraceCheckUtils]: 190: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,312 INFO L273 TraceCheckUtils]: 191: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,312 INFO L273 TraceCheckUtils]: 192: Hoare triple {27141#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27141#true} is VALID [2018-11-23 12:18:27,313 INFO L273 TraceCheckUtils]: 193: Hoare triple {27141#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27141#true} is VALID [2018-11-23 12:18:27,313 INFO L273 TraceCheckUtils]: 194: Hoare triple {27141#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27141#true} is VALID [2018-11-23 12:18:27,313 INFO L273 TraceCheckUtils]: 195: Hoare triple {27141#true} assume !(~i~0 < 60); {27141#true} is VALID [2018-11-23 12:18:27,313 INFO L273 TraceCheckUtils]: 196: Hoare triple {27141#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {27141#true} is VALID [2018-11-23 12:18:27,313 INFO L273 TraceCheckUtils]: 197: Hoare triple {27141#true} assume true; {27141#true} is VALID [2018-11-23 12:18:27,313 INFO L268 TraceCheckUtils]: 198: Hoare quadruple {27141#true} {27142#false} #79#return; {27142#false} is VALID [2018-11-23 12:18:27,313 INFO L273 TraceCheckUtils]: 199: Hoare triple {27142#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {27142#false} is VALID [2018-11-23 12:18:27,313 INFO L273 TraceCheckUtils]: 200: Hoare triple {27142#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {27142#false} is VALID [2018-11-23 12:18:27,313 INFO L273 TraceCheckUtils]: 201: Hoare triple {27142#false} assume !false; {27142#false} is VALID [2018-11-23 12:18:27,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2498 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1474 trivial. 0 not checked. [2018-11-23 12:18:27,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:18:27,331 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:18:27,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:18:27,446 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:18:27,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:18:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:18:27,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:18:27,825 INFO L256 TraceCheckUtils]: 0: Hoare triple {27141#true} call ULTIMATE.init(); {27141#true} is VALID [2018-11-23 12:18:27,825 INFO L273 TraceCheckUtils]: 1: Hoare triple {27141#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27141#true} is VALID [2018-11-23 12:18:27,825 INFO L273 TraceCheckUtils]: 2: Hoare triple {27141#true} assume true; {27141#true} is VALID [2018-11-23 12:18:27,825 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27141#true} {27141#true} #71#return; {27141#true} is VALID [2018-11-23 12:18:27,825 INFO L256 TraceCheckUtils]: 4: Hoare triple {27141#true} call #t~ret14 := main(); {27141#true} is VALID [2018-11-23 12:18:27,826 INFO L273 TraceCheckUtils]: 5: Hoare triple {27141#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {27194#(<= main_~i~1 0)} is VALID [2018-11-23 12:18:27,826 INFO L273 TraceCheckUtils]: 6: Hoare triple {27194#(<= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27194#(<= main_~i~1 0)} is VALID [2018-11-23 12:18:27,827 INFO L273 TraceCheckUtils]: 7: Hoare triple {27194#(<= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27144#(<= main_~i~1 1)} is VALID [2018-11-23 12:18:27,827 INFO L273 TraceCheckUtils]: 8: Hoare triple {27144#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27144#(<= main_~i~1 1)} is VALID [2018-11-23 12:18:27,827 INFO L273 TraceCheckUtils]: 9: Hoare triple {27144#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27145#(<= main_~i~1 2)} is VALID [2018-11-23 12:18:27,828 INFO L273 TraceCheckUtils]: 10: Hoare triple {27145#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27145#(<= main_~i~1 2)} is VALID [2018-11-23 12:18:27,828 INFO L273 TraceCheckUtils]: 11: Hoare triple {27145#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27146#(<= main_~i~1 3)} is VALID [2018-11-23 12:18:27,828 INFO L273 TraceCheckUtils]: 12: Hoare triple {27146#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27146#(<= main_~i~1 3)} is VALID [2018-11-23 12:18:27,829 INFO L273 TraceCheckUtils]: 13: Hoare triple {27146#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27147#(<= main_~i~1 4)} is VALID [2018-11-23 12:18:27,830 INFO L273 TraceCheckUtils]: 14: Hoare triple {27147#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27147#(<= main_~i~1 4)} is VALID [2018-11-23 12:18:27,830 INFO L273 TraceCheckUtils]: 15: Hoare triple {27147#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27148#(<= main_~i~1 5)} is VALID [2018-11-23 12:18:27,831 INFO L273 TraceCheckUtils]: 16: Hoare triple {27148#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27148#(<= main_~i~1 5)} is VALID [2018-11-23 12:18:27,832 INFO L273 TraceCheckUtils]: 17: Hoare triple {27148#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27149#(<= main_~i~1 6)} is VALID [2018-11-23 12:18:27,832 INFO L273 TraceCheckUtils]: 18: Hoare triple {27149#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27149#(<= main_~i~1 6)} is VALID [2018-11-23 12:18:27,833 INFO L273 TraceCheckUtils]: 19: Hoare triple {27149#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27150#(<= main_~i~1 7)} is VALID [2018-11-23 12:18:27,833 INFO L273 TraceCheckUtils]: 20: Hoare triple {27150#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27150#(<= main_~i~1 7)} is VALID [2018-11-23 12:18:27,834 INFO L273 TraceCheckUtils]: 21: Hoare triple {27150#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27151#(<= main_~i~1 8)} is VALID [2018-11-23 12:18:27,835 INFO L273 TraceCheckUtils]: 22: Hoare triple {27151#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27151#(<= main_~i~1 8)} is VALID [2018-11-23 12:18:27,835 INFO L273 TraceCheckUtils]: 23: Hoare triple {27151#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27152#(<= main_~i~1 9)} is VALID [2018-11-23 12:18:27,836 INFO L273 TraceCheckUtils]: 24: Hoare triple {27152#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27152#(<= main_~i~1 9)} is VALID [2018-11-23 12:18:27,837 INFO L273 TraceCheckUtils]: 25: Hoare triple {27152#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27153#(<= main_~i~1 10)} is VALID [2018-11-23 12:18:27,837 INFO L273 TraceCheckUtils]: 26: Hoare triple {27153#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27153#(<= main_~i~1 10)} is VALID [2018-11-23 12:18:27,838 INFO L273 TraceCheckUtils]: 27: Hoare triple {27153#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27154#(<= main_~i~1 11)} is VALID [2018-11-23 12:18:27,838 INFO L273 TraceCheckUtils]: 28: Hoare triple {27154#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27154#(<= main_~i~1 11)} is VALID [2018-11-23 12:18:27,839 INFO L273 TraceCheckUtils]: 29: Hoare triple {27154#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27155#(<= main_~i~1 12)} is VALID [2018-11-23 12:18:27,840 INFO L273 TraceCheckUtils]: 30: Hoare triple {27155#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27155#(<= main_~i~1 12)} is VALID [2018-11-23 12:18:27,840 INFO L273 TraceCheckUtils]: 31: Hoare triple {27155#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27156#(<= main_~i~1 13)} is VALID [2018-11-23 12:18:27,841 INFO L273 TraceCheckUtils]: 32: Hoare triple {27156#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27156#(<= main_~i~1 13)} is VALID [2018-11-23 12:18:27,842 INFO L273 TraceCheckUtils]: 33: Hoare triple {27156#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27157#(<= main_~i~1 14)} is VALID [2018-11-23 12:18:27,842 INFO L273 TraceCheckUtils]: 34: Hoare triple {27157#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27157#(<= main_~i~1 14)} is VALID [2018-11-23 12:18:27,843 INFO L273 TraceCheckUtils]: 35: Hoare triple {27157#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27158#(<= main_~i~1 15)} is VALID [2018-11-23 12:18:27,843 INFO L273 TraceCheckUtils]: 36: Hoare triple {27158#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27158#(<= main_~i~1 15)} is VALID [2018-11-23 12:18:27,844 INFO L273 TraceCheckUtils]: 37: Hoare triple {27158#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27159#(<= main_~i~1 16)} is VALID [2018-11-23 12:18:27,845 INFO L273 TraceCheckUtils]: 38: Hoare triple {27159#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27159#(<= main_~i~1 16)} is VALID [2018-11-23 12:18:27,845 INFO L273 TraceCheckUtils]: 39: Hoare triple {27159#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27160#(<= main_~i~1 17)} is VALID [2018-11-23 12:18:27,846 INFO L273 TraceCheckUtils]: 40: Hoare triple {27160#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27160#(<= main_~i~1 17)} is VALID [2018-11-23 12:18:27,847 INFO L273 TraceCheckUtils]: 41: Hoare triple {27160#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27161#(<= main_~i~1 18)} is VALID [2018-11-23 12:18:27,847 INFO L273 TraceCheckUtils]: 42: Hoare triple {27161#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27161#(<= main_~i~1 18)} is VALID [2018-11-23 12:18:27,848 INFO L273 TraceCheckUtils]: 43: Hoare triple {27161#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27162#(<= main_~i~1 19)} is VALID [2018-11-23 12:18:27,848 INFO L273 TraceCheckUtils]: 44: Hoare triple {27162#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27162#(<= main_~i~1 19)} is VALID [2018-11-23 12:18:27,849 INFO L273 TraceCheckUtils]: 45: Hoare triple {27162#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27163#(<= main_~i~1 20)} is VALID [2018-11-23 12:18:27,850 INFO L273 TraceCheckUtils]: 46: Hoare triple {27163#(<= main_~i~1 20)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27163#(<= main_~i~1 20)} is VALID [2018-11-23 12:18:27,850 INFO L273 TraceCheckUtils]: 47: Hoare triple {27163#(<= main_~i~1 20)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27164#(<= main_~i~1 21)} is VALID [2018-11-23 12:18:27,851 INFO L273 TraceCheckUtils]: 48: Hoare triple {27164#(<= main_~i~1 21)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27164#(<= main_~i~1 21)} is VALID [2018-11-23 12:18:27,852 INFO L273 TraceCheckUtils]: 49: Hoare triple {27164#(<= main_~i~1 21)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27165#(<= main_~i~1 22)} is VALID [2018-11-23 12:18:27,852 INFO L273 TraceCheckUtils]: 50: Hoare triple {27165#(<= main_~i~1 22)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27165#(<= main_~i~1 22)} is VALID [2018-11-23 12:18:27,853 INFO L273 TraceCheckUtils]: 51: Hoare triple {27165#(<= main_~i~1 22)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27166#(<= main_~i~1 23)} is VALID [2018-11-23 12:18:27,853 INFO L273 TraceCheckUtils]: 52: Hoare triple {27166#(<= main_~i~1 23)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27166#(<= main_~i~1 23)} is VALID [2018-11-23 12:18:27,854 INFO L273 TraceCheckUtils]: 53: Hoare triple {27166#(<= main_~i~1 23)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27167#(<= main_~i~1 24)} is VALID [2018-11-23 12:18:27,855 INFO L273 TraceCheckUtils]: 54: Hoare triple {27167#(<= main_~i~1 24)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27167#(<= main_~i~1 24)} is VALID [2018-11-23 12:18:27,855 INFO L273 TraceCheckUtils]: 55: Hoare triple {27167#(<= main_~i~1 24)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27168#(<= main_~i~1 25)} is VALID [2018-11-23 12:18:27,856 INFO L273 TraceCheckUtils]: 56: Hoare triple {27168#(<= main_~i~1 25)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27168#(<= main_~i~1 25)} is VALID [2018-11-23 12:18:27,856 INFO L273 TraceCheckUtils]: 57: Hoare triple {27168#(<= main_~i~1 25)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27169#(<= main_~i~1 26)} is VALID [2018-11-23 12:18:27,857 INFO L273 TraceCheckUtils]: 58: Hoare triple {27169#(<= main_~i~1 26)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27169#(<= main_~i~1 26)} is VALID [2018-11-23 12:18:27,858 INFO L273 TraceCheckUtils]: 59: Hoare triple {27169#(<= main_~i~1 26)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27170#(<= main_~i~1 27)} is VALID [2018-11-23 12:18:27,858 INFO L273 TraceCheckUtils]: 60: Hoare triple {27170#(<= main_~i~1 27)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27170#(<= main_~i~1 27)} is VALID [2018-11-23 12:18:27,859 INFO L273 TraceCheckUtils]: 61: Hoare triple {27170#(<= main_~i~1 27)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27171#(<= main_~i~1 28)} is VALID [2018-11-23 12:18:27,859 INFO L273 TraceCheckUtils]: 62: Hoare triple {27171#(<= main_~i~1 28)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27171#(<= main_~i~1 28)} is VALID [2018-11-23 12:18:27,860 INFO L273 TraceCheckUtils]: 63: Hoare triple {27171#(<= main_~i~1 28)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27172#(<= main_~i~1 29)} is VALID [2018-11-23 12:18:27,861 INFO L273 TraceCheckUtils]: 64: Hoare triple {27172#(<= main_~i~1 29)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27172#(<= main_~i~1 29)} is VALID [2018-11-23 12:18:27,861 INFO L273 TraceCheckUtils]: 65: Hoare triple {27172#(<= main_~i~1 29)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27173#(<= main_~i~1 30)} is VALID [2018-11-23 12:18:27,862 INFO L273 TraceCheckUtils]: 66: Hoare triple {27173#(<= main_~i~1 30)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27173#(<= main_~i~1 30)} is VALID [2018-11-23 12:18:27,863 INFO L273 TraceCheckUtils]: 67: Hoare triple {27173#(<= main_~i~1 30)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27174#(<= main_~i~1 31)} is VALID [2018-11-23 12:18:27,863 INFO L273 TraceCheckUtils]: 68: Hoare triple {27174#(<= main_~i~1 31)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {27174#(<= main_~i~1 31)} is VALID [2018-11-23 12:18:27,864 INFO L273 TraceCheckUtils]: 69: Hoare triple {27174#(<= main_~i~1 31)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {27175#(<= main_~i~1 32)} is VALID [2018-11-23 12:18:27,865 INFO L273 TraceCheckUtils]: 70: Hoare triple {27175#(<= main_~i~1 32)} assume !(~i~1 < 60); {27142#false} is VALID [2018-11-23 12:18:27,865 INFO L256 TraceCheckUtils]: 71: Hoare triple {27142#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {27142#false} is VALID [2018-11-23 12:18:27,865 INFO L273 TraceCheckUtils]: 72: Hoare triple {27142#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {27142#false} is VALID [2018-11-23 12:18:27,865 INFO L273 TraceCheckUtils]: 73: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,865 INFO L273 TraceCheckUtils]: 74: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,865 INFO L273 TraceCheckUtils]: 75: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,866 INFO L273 TraceCheckUtils]: 76: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,866 INFO L273 TraceCheckUtils]: 77: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,866 INFO L273 TraceCheckUtils]: 78: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,866 INFO L273 TraceCheckUtils]: 79: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,866 INFO L273 TraceCheckUtils]: 80: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,867 INFO L273 TraceCheckUtils]: 81: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,867 INFO L273 TraceCheckUtils]: 82: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,867 INFO L273 TraceCheckUtils]: 83: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,867 INFO L273 TraceCheckUtils]: 84: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,867 INFO L273 TraceCheckUtils]: 85: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,867 INFO L273 TraceCheckUtils]: 86: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,868 INFO L273 TraceCheckUtils]: 87: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,868 INFO L273 TraceCheckUtils]: 88: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,868 INFO L273 TraceCheckUtils]: 89: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,868 INFO L273 TraceCheckUtils]: 90: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,868 INFO L273 TraceCheckUtils]: 91: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,868 INFO L273 TraceCheckUtils]: 92: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,868 INFO L273 TraceCheckUtils]: 93: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,868 INFO L273 TraceCheckUtils]: 94: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,868 INFO L273 TraceCheckUtils]: 95: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,868 INFO L273 TraceCheckUtils]: 96: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,869 INFO L273 TraceCheckUtils]: 97: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,869 INFO L273 TraceCheckUtils]: 98: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,869 INFO L273 TraceCheckUtils]: 99: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,869 INFO L273 TraceCheckUtils]: 100: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,869 INFO L273 TraceCheckUtils]: 101: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,869 INFO L273 TraceCheckUtils]: 102: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,869 INFO L273 TraceCheckUtils]: 103: Hoare triple {27142#false} assume !(~i~0 < 60); {27142#false} is VALID [2018-11-23 12:18:27,869 INFO L273 TraceCheckUtils]: 104: Hoare triple {27142#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {27142#false} is VALID [2018-11-23 12:18:27,869 INFO L273 TraceCheckUtils]: 105: Hoare triple {27142#false} assume true; {27142#false} is VALID [2018-11-23 12:18:27,870 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {27142#false} {27142#false} #75#return; {27142#false} is VALID [2018-11-23 12:18:27,870 INFO L273 TraceCheckUtils]: 107: Hoare triple {27142#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {27142#false} is VALID [2018-11-23 12:18:27,870 INFO L256 TraceCheckUtils]: 108: Hoare triple {27142#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {27142#false} is VALID [2018-11-23 12:18:27,870 INFO L273 TraceCheckUtils]: 109: Hoare triple {27142#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {27142#false} is VALID [2018-11-23 12:18:27,870 INFO L273 TraceCheckUtils]: 110: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,870 INFO L273 TraceCheckUtils]: 111: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,870 INFO L273 TraceCheckUtils]: 112: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,870 INFO L273 TraceCheckUtils]: 113: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,870 INFO L273 TraceCheckUtils]: 114: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,870 INFO L273 TraceCheckUtils]: 115: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,871 INFO L273 TraceCheckUtils]: 116: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,871 INFO L273 TraceCheckUtils]: 117: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,871 INFO L273 TraceCheckUtils]: 118: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,871 INFO L273 TraceCheckUtils]: 119: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,871 INFO L273 TraceCheckUtils]: 120: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,871 INFO L273 TraceCheckUtils]: 121: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,871 INFO L273 TraceCheckUtils]: 122: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,871 INFO L273 TraceCheckUtils]: 123: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,871 INFO L273 TraceCheckUtils]: 124: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,872 INFO L273 TraceCheckUtils]: 125: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,872 INFO L273 TraceCheckUtils]: 126: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,872 INFO L273 TraceCheckUtils]: 127: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,872 INFO L273 TraceCheckUtils]: 128: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,872 INFO L273 TraceCheckUtils]: 129: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,872 INFO L273 TraceCheckUtils]: 130: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,872 INFO L273 TraceCheckUtils]: 131: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,872 INFO L273 TraceCheckUtils]: 132: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,872 INFO L273 TraceCheckUtils]: 133: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,872 INFO L273 TraceCheckUtils]: 134: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,873 INFO L273 TraceCheckUtils]: 135: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,873 INFO L273 TraceCheckUtils]: 136: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,873 INFO L273 TraceCheckUtils]: 137: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,873 INFO L273 TraceCheckUtils]: 138: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,873 INFO L273 TraceCheckUtils]: 139: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,873 INFO L273 TraceCheckUtils]: 140: Hoare triple {27142#false} assume !(~i~0 < 60); {27142#false} is VALID [2018-11-23 12:18:27,873 INFO L273 TraceCheckUtils]: 141: Hoare triple {27142#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {27142#false} is VALID [2018-11-23 12:18:27,873 INFO L273 TraceCheckUtils]: 142: Hoare triple {27142#false} assume true; {27142#false} is VALID [2018-11-23 12:18:27,873 INFO L268 TraceCheckUtils]: 143: Hoare quadruple {27142#false} {27142#false} #77#return; {27142#false} is VALID [2018-11-23 12:18:27,874 INFO L273 TraceCheckUtils]: 144: Hoare triple {27142#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {27142#false} is VALID [2018-11-23 12:18:27,874 INFO L273 TraceCheckUtils]: 145: Hoare triple {27142#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {27142#false} is VALID [2018-11-23 12:18:27,874 INFO L273 TraceCheckUtils]: 146: Hoare triple {27142#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {27142#false} is VALID [2018-11-23 12:18:27,874 INFO L273 TraceCheckUtils]: 147: Hoare triple {27142#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {27142#false} is VALID [2018-11-23 12:18:27,874 INFO L273 TraceCheckUtils]: 148: Hoare triple {27142#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {27142#false} is VALID [2018-11-23 12:18:27,874 INFO L273 TraceCheckUtils]: 149: Hoare triple {27142#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {27142#false} is VALID [2018-11-23 12:18:27,874 INFO L273 TraceCheckUtils]: 150: Hoare triple {27142#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {27142#false} is VALID [2018-11-23 12:18:27,874 INFO L273 TraceCheckUtils]: 151: Hoare triple {27142#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {27142#false} is VALID [2018-11-23 12:18:27,874 INFO L273 TraceCheckUtils]: 152: Hoare triple {27142#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {27142#false} is VALID [2018-11-23 12:18:27,874 INFO L273 TraceCheckUtils]: 153: Hoare triple {27142#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {27142#false} is VALID [2018-11-23 12:18:27,875 INFO L273 TraceCheckUtils]: 154: Hoare triple {27142#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {27142#false} is VALID [2018-11-23 12:18:27,875 INFO L273 TraceCheckUtils]: 155: Hoare triple {27142#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {27142#false} is VALID [2018-11-23 12:18:27,875 INFO L273 TraceCheckUtils]: 156: Hoare triple {27142#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {27142#false} is VALID [2018-11-23 12:18:27,875 INFO L273 TraceCheckUtils]: 157: Hoare triple {27142#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {27142#false} is VALID [2018-11-23 12:18:27,875 INFO L273 TraceCheckUtils]: 158: Hoare triple {27142#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {27142#false} is VALID [2018-11-23 12:18:27,875 INFO L273 TraceCheckUtils]: 159: Hoare triple {27142#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {27142#false} is VALID [2018-11-23 12:18:27,875 INFO L273 TraceCheckUtils]: 160: Hoare triple {27142#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {27142#false} is VALID [2018-11-23 12:18:27,875 INFO L273 TraceCheckUtils]: 161: Hoare triple {27142#false} assume !(~i~2 < 59); {27142#false} is VALID [2018-11-23 12:18:27,875 INFO L273 TraceCheckUtils]: 162: Hoare triple {27142#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {27142#false} is VALID [2018-11-23 12:18:27,875 INFO L256 TraceCheckUtils]: 163: Hoare triple {27142#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {27142#false} is VALID [2018-11-23 12:18:27,876 INFO L273 TraceCheckUtils]: 164: Hoare triple {27142#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {27142#false} is VALID [2018-11-23 12:18:27,876 INFO L273 TraceCheckUtils]: 165: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,876 INFO L273 TraceCheckUtils]: 166: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,876 INFO L273 TraceCheckUtils]: 167: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,876 INFO L273 TraceCheckUtils]: 168: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,876 INFO L273 TraceCheckUtils]: 169: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,876 INFO L273 TraceCheckUtils]: 170: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,876 INFO L273 TraceCheckUtils]: 171: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,876 INFO L273 TraceCheckUtils]: 172: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,876 INFO L273 TraceCheckUtils]: 173: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,877 INFO L273 TraceCheckUtils]: 174: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,877 INFO L273 TraceCheckUtils]: 175: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,877 INFO L273 TraceCheckUtils]: 176: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,877 INFO L273 TraceCheckUtils]: 177: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,877 INFO L273 TraceCheckUtils]: 178: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,877 INFO L273 TraceCheckUtils]: 179: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,877 INFO L273 TraceCheckUtils]: 180: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,877 INFO L273 TraceCheckUtils]: 181: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,877 INFO L273 TraceCheckUtils]: 182: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,878 INFO L273 TraceCheckUtils]: 183: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,878 INFO L273 TraceCheckUtils]: 184: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,878 INFO L273 TraceCheckUtils]: 185: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,878 INFO L273 TraceCheckUtils]: 186: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,878 INFO L273 TraceCheckUtils]: 187: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,878 INFO L273 TraceCheckUtils]: 188: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,878 INFO L273 TraceCheckUtils]: 189: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,878 INFO L273 TraceCheckUtils]: 190: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,878 INFO L273 TraceCheckUtils]: 191: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,878 INFO L273 TraceCheckUtils]: 192: Hoare triple {27142#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {27142#false} is VALID [2018-11-23 12:18:27,879 INFO L273 TraceCheckUtils]: 193: Hoare triple {27142#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {27142#false} is VALID [2018-11-23 12:18:27,879 INFO L273 TraceCheckUtils]: 194: Hoare triple {27142#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {27142#false} is VALID [2018-11-23 12:18:27,879 INFO L273 TraceCheckUtils]: 195: Hoare triple {27142#false} assume !(~i~0 < 60); {27142#false} is VALID [2018-11-23 12:18:27,879 INFO L273 TraceCheckUtils]: 196: Hoare triple {27142#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {27142#false} is VALID [2018-11-23 12:18:27,879 INFO L273 TraceCheckUtils]: 197: Hoare triple {27142#false} assume true; {27142#false} is VALID [2018-11-23 12:18:27,879 INFO L268 TraceCheckUtils]: 198: Hoare quadruple {27142#false} {27142#false} #79#return; {27142#false} is VALID [2018-11-23 12:18:27,879 INFO L273 TraceCheckUtils]: 199: Hoare triple {27142#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {27142#false} is VALID [2018-11-23 12:18:27,879 INFO L273 TraceCheckUtils]: 200: Hoare triple {27142#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {27142#false} is VALID [2018-11-23 12:18:27,879 INFO L273 TraceCheckUtils]: 201: Hoare triple {27142#false} assume !false; {27142#false} is VALID [2018-11-23 12:18:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2498 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1474 trivial. 0 not checked. [2018-11-23 12:18:27,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:18:27,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 12:18:27,916 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 202 [2018-11-23 12:18:27,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:18:27,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 12:18:28,025 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:18:28,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 12:18:28,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 12:18:28,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:18:28,027 INFO L87 Difference]: Start difference. First operand 133 states and 147 transitions. Second operand 36 states. [2018-11-23 12:18:29,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:29,399 INFO L93 Difference]: Finished difference Result 198 states and 226 transitions. [2018-11-23 12:18:29,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:18:29,399 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 202 [2018-11-23 12:18:29,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:18:29,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:18:29,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2018-11-23 12:18:29,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:18:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2018-11-23 12:18:29,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 122 transitions. [2018-11-23 12:18:29,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:18:29,523 INFO L225 Difference]: With dead ends: 198 [2018-11-23 12:18:29,523 INFO L226 Difference]: Without dead ends: 136 [2018-11-23 12:18:29,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:18:29,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-23 12:18:29,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2018-11-23 12:18:29,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:18:29,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand 135 states. [2018-11-23 12:18:29,828 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 135 states. [2018-11-23 12:18:29,828 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 135 states. [2018-11-23 12:18:29,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:29,832 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2018-11-23 12:18:29,832 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2018-11-23 12:18:29,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:18:29,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:18:29,832 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 136 states. [2018-11-23 12:18:29,832 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 136 states. [2018-11-23 12:18:29,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:29,835 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2018-11-23 12:18:29,835 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2018-11-23 12:18:29,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:18:29,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:18:29,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:18:29,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:18:29,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 12:18:29,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 149 transitions. [2018-11-23 12:18:29,838 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 149 transitions. Word has length 202 [2018-11-23 12:18:29,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:18:29,839 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 149 transitions. [2018-11-23 12:18:29,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 12:18:29,839 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 149 transitions. [2018-11-23 12:18:29,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-23 12:18:29,840 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:18:29,840 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 30, 30, 30, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:18:29,840 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:18:29,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:18:29,841 INFO L82 PathProgramCache]: Analyzing trace with hash 181406440, now seen corresponding path program 33 times [2018-11-23 12:18:29,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:18:29,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:18:29,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:29,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:18:29,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:18:30,975 INFO L256 TraceCheckUtils]: 0: Hoare triple {28535#true} call ULTIMATE.init(); {28535#true} is VALID [2018-11-23 12:18:30,975 INFO L273 TraceCheckUtils]: 1: Hoare triple {28535#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28535#true} is VALID [2018-11-23 12:18:30,975 INFO L273 TraceCheckUtils]: 2: Hoare triple {28535#true} assume true; {28535#true} is VALID [2018-11-23 12:18:30,976 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28535#true} {28535#true} #71#return; {28535#true} is VALID [2018-11-23 12:18:30,976 INFO L256 TraceCheckUtils]: 4: Hoare triple {28535#true} call #t~ret14 := main(); {28535#true} is VALID [2018-11-23 12:18:30,976 INFO L273 TraceCheckUtils]: 5: Hoare triple {28535#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {28537#(= main_~i~1 0)} is VALID [2018-11-23 12:18:30,977 INFO L273 TraceCheckUtils]: 6: Hoare triple {28537#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28537#(= main_~i~1 0)} is VALID [2018-11-23 12:18:30,977 INFO L273 TraceCheckUtils]: 7: Hoare triple {28537#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28538#(<= main_~i~1 1)} is VALID [2018-11-23 12:18:30,978 INFO L273 TraceCheckUtils]: 8: Hoare triple {28538#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28538#(<= main_~i~1 1)} is VALID [2018-11-23 12:18:30,978 INFO L273 TraceCheckUtils]: 9: Hoare triple {28538#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28539#(<= main_~i~1 2)} is VALID [2018-11-23 12:18:30,979 INFO L273 TraceCheckUtils]: 10: Hoare triple {28539#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28539#(<= main_~i~1 2)} is VALID [2018-11-23 12:18:30,979 INFO L273 TraceCheckUtils]: 11: Hoare triple {28539#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28540#(<= main_~i~1 3)} is VALID [2018-11-23 12:18:30,979 INFO L273 TraceCheckUtils]: 12: Hoare triple {28540#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28540#(<= main_~i~1 3)} is VALID [2018-11-23 12:18:30,980 INFO L273 TraceCheckUtils]: 13: Hoare triple {28540#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28541#(<= main_~i~1 4)} is VALID [2018-11-23 12:18:30,981 INFO L273 TraceCheckUtils]: 14: Hoare triple {28541#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28541#(<= main_~i~1 4)} is VALID [2018-11-23 12:18:30,981 INFO L273 TraceCheckUtils]: 15: Hoare triple {28541#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28542#(<= main_~i~1 5)} is VALID [2018-11-23 12:18:30,982 INFO L273 TraceCheckUtils]: 16: Hoare triple {28542#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28542#(<= main_~i~1 5)} is VALID [2018-11-23 12:18:30,983 INFO L273 TraceCheckUtils]: 17: Hoare triple {28542#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28543#(<= main_~i~1 6)} is VALID [2018-11-23 12:18:30,983 INFO L273 TraceCheckUtils]: 18: Hoare triple {28543#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28543#(<= main_~i~1 6)} is VALID [2018-11-23 12:18:30,984 INFO L273 TraceCheckUtils]: 19: Hoare triple {28543#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28544#(<= main_~i~1 7)} is VALID [2018-11-23 12:18:30,984 INFO L273 TraceCheckUtils]: 20: Hoare triple {28544#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28544#(<= main_~i~1 7)} is VALID [2018-11-23 12:18:30,985 INFO L273 TraceCheckUtils]: 21: Hoare triple {28544#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28545#(<= main_~i~1 8)} is VALID [2018-11-23 12:18:30,985 INFO L273 TraceCheckUtils]: 22: Hoare triple {28545#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28545#(<= main_~i~1 8)} is VALID [2018-11-23 12:18:30,986 INFO L273 TraceCheckUtils]: 23: Hoare triple {28545#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28546#(<= main_~i~1 9)} is VALID [2018-11-23 12:18:30,987 INFO L273 TraceCheckUtils]: 24: Hoare triple {28546#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28546#(<= main_~i~1 9)} is VALID [2018-11-23 12:18:30,987 INFO L273 TraceCheckUtils]: 25: Hoare triple {28546#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28547#(<= main_~i~1 10)} is VALID [2018-11-23 12:18:30,988 INFO L273 TraceCheckUtils]: 26: Hoare triple {28547#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28547#(<= main_~i~1 10)} is VALID [2018-11-23 12:18:30,989 INFO L273 TraceCheckUtils]: 27: Hoare triple {28547#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28548#(<= main_~i~1 11)} is VALID [2018-11-23 12:18:30,989 INFO L273 TraceCheckUtils]: 28: Hoare triple {28548#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28548#(<= main_~i~1 11)} is VALID [2018-11-23 12:18:30,990 INFO L273 TraceCheckUtils]: 29: Hoare triple {28548#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28549#(<= main_~i~1 12)} is VALID [2018-11-23 12:18:30,990 INFO L273 TraceCheckUtils]: 30: Hoare triple {28549#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28549#(<= main_~i~1 12)} is VALID [2018-11-23 12:18:30,991 INFO L273 TraceCheckUtils]: 31: Hoare triple {28549#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28550#(<= main_~i~1 13)} is VALID [2018-11-23 12:18:30,992 INFO L273 TraceCheckUtils]: 32: Hoare triple {28550#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28550#(<= main_~i~1 13)} is VALID [2018-11-23 12:18:30,992 INFO L273 TraceCheckUtils]: 33: Hoare triple {28550#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28551#(<= main_~i~1 14)} is VALID [2018-11-23 12:18:30,993 INFO L273 TraceCheckUtils]: 34: Hoare triple {28551#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28551#(<= main_~i~1 14)} is VALID [2018-11-23 12:18:30,994 INFO L273 TraceCheckUtils]: 35: Hoare triple {28551#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28552#(<= main_~i~1 15)} is VALID [2018-11-23 12:18:30,994 INFO L273 TraceCheckUtils]: 36: Hoare triple {28552#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28552#(<= main_~i~1 15)} is VALID [2018-11-23 12:18:30,995 INFO L273 TraceCheckUtils]: 37: Hoare triple {28552#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28553#(<= main_~i~1 16)} is VALID [2018-11-23 12:18:30,995 INFO L273 TraceCheckUtils]: 38: Hoare triple {28553#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28553#(<= main_~i~1 16)} is VALID [2018-11-23 12:18:30,996 INFO L273 TraceCheckUtils]: 39: Hoare triple {28553#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28554#(<= main_~i~1 17)} is VALID [2018-11-23 12:18:30,997 INFO L273 TraceCheckUtils]: 40: Hoare triple {28554#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28554#(<= main_~i~1 17)} is VALID [2018-11-23 12:18:30,997 INFO L273 TraceCheckUtils]: 41: Hoare triple {28554#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28555#(<= main_~i~1 18)} is VALID [2018-11-23 12:18:30,998 INFO L273 TraceCheckUtils]: 42: Hoare triple {28555#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28555#(<= main_~i~1 18)} is VALID [2018-11-23 12:18:30,999 INFO L273 TraceCheckUtils]: 43: Hoare triple {28555#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28556#(<= main_~i~1 19)} is VALID [2018-11-23 12:18:30,999 INFO L273 TraceCheckUtils]: 44: Hoare triple {28556#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28556#(<= main_~i~1 19)} is VALID [2018-11-23 12:18:31,000 INFO L273 TraceCheckUtils]: 45: Hoare triple {28556#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28557#(<= main_~i~1 20)} is VALID [2018-11-23 12:18:31,000 INFO L273 TraceCheckUtils]: 46: Hoare triple {28557#(<= main_~i~1 20)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28557#(<= main_~i~1 20)} is VALID [2018-11-23 12:18:31,001 INFO L273 TraceCheckUtils]: 47: Hoare triple {28557#(<= main_~i~1 20)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28558#(<= main_~i~1 21)} is VALID [2018-11-23 12:18:31,002 INFO L273 TraceCheckUtils]: 48: Hoare triple {28558#(<= main_~i~1 21)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28558#(<= main_~i~1 21)} is VALID [2018-11-23 12:18:31,002 INFO L273 TraceCheckUtils]: 49: Hoare triple {28558#(<= main_~i~1 21)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28559#(<= main_~i~1 22)} is VALID [2018-11-23 12:18:31,003 INFO L273 TraceCheckUtils]: 50: Hoare triple {28559#(<= main_~i~1 22)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28559#(<= main_~i~1 22)} is VALID [2018-11-23 12:18:31,004 INFO L273 TraceCheckUtils]: 51: Hoare triple {28559#(<= main_~i~1 22)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28560#(<= main_~i~1 23)} is VALID [2018-11-23 12:18:31,004 INFO L273 TraceCheckUtils]: 52: Hoare triple {28560#(<= main_~i~1 23)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28560#(<= main_~i~1 23)} is VALID [2018-11-23 12:18:31,005 INFO L273 TraceCheckUtils]: 53: Hoare triple {28560#(<= main_~i~1 23)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28561#(<= main_~i~1 24)} is VALID [2018-11-23 12:18:31,005 INFO L273 TraceCheckUtils]: 54: Hoare triple {28561#(<= main_~i~1 24)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28561#(<= main_~i~1 24)} is VALID [2018-11-23 12:18:31,006 INFO L273 TraceCheckUtils]: 55: Hoare triple {28561#(<= main_~i~1 24)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28562#(<= main_~i~1 25)} is VALID [2018-11-23 12:18:31,006 INFO L273 TraceCheckUtils]: 56: Hoare triple {28562#(<= main_~i~1 25)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28562#(<= main_~i~1 25)} is VALID [2018-11-23 12:18:31,007 INFO L273 TraceCheckUtils]: 57: Hoare triple {28562#(<= main_~i~1 25)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28563#(<= main_~i~1 26)} is VALID [2018-11-23 12:18:31,008 INFO L273 TraceCheckUtils]: 58: Hoare triple {28563#(<= main_~i~1 26)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28563#(<= main_~i~1 26)} is VALID [2018-11-23 12:18:31,008 INFO L273 TraceCheckUtils]: 59: Hoare triple {28563#(<= main_~i~1 26)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28564#(<= main_~i~1 27)} is VALID [2018-11-23 12:18:31,009 INFO L273 TraceCheckUtils]: 60: Hoare triple {28564#(<= main_~i~1 27)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28564#(<= main_~i~1 27)} is VALID [2018-11-23 12:18:31,010 INFO L273 TraceCheckUtils]: 61: Hoare triple {28564#(<= main_~i~1 27)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28565#(<= main_~i~1 28)} is VALID [2018-11-23 12:18:31,010 INFO L273 TraceCheckUtils]: 62: Hoare triple {28565#(<= main_~i~1 28)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28565#(<= main_~i~1 28)} is VALID [2018-11-23 12:18:31,011 INFO L273 TraceCheckUtils]: 63: Hoare triple {28565#(<= main_~i~1 28)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28566#(<= main_~i~1 29)} is VALID [2018-11-23 12:18:31,011 INFO L273 TraceCheckUtils]: 64: Hoare triple {28566#(<= main_~i~1 29)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28566#(<= main_~i~1 29)} is VALID [2018-11-23 12:18:31,012 INFO L273 TraceCheckUtils]: 65: Hoare triple {28566#(<= main_~i~1 29)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28567#(<= main_~i~1 30)} is VALID [2018-11-23 12:18:31,013 INFO L273 TraceCheckUtils]: 66: Hoare triple {28567#(<= main_~i~1 30)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28567#(<= main_~i~1 30)} is VALID [2018-11-23 12:18:31,013 INFO L273 TraceCheckUtils]: 67: Hoare triple {28567#(<= main_~i~1 30)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28568#(<= main_~i~1 31)} is VALID [2018-11-23 12:18:31,014 INFO L273 TraceCheckUtils]: 68: Hoare triple {28568#(<= main_~i~1 31)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28568#(<= main_~i~1 31)} is VALID [2018-11-23 12:18:31,015 INFO L273 TraceCheckUtils]: 69: Hoare triple {28568#(<= main_~i~1 31)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28569#(<= main_~i~1 32)} is VALID [2018-11-23 12:18:31,015 INFO L273 TraceCheckUtils]: 70: Hoare triple {28569#(<= main_~i~1 32)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28569#(<= main_~i~1 32)} is VALID [2018-11-23 12:18:31,016 INFO L273 TraceCheckUtils]: 71: Hoare triple {28569#(<= main_~i~1 32)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28570#(<= main_~i~1 33)} is VALID [2018-11-23 12:18:31,017 INFO L273 TraceCheckUtils]: 72: Hoare triple {28570#(<= main_~i~1 33)} assume !(~i~1 < 60); {28536#false} is VALID [2018-11-23 12:18:31,017 INFO L256 TraceCheckUtils]: 73: Hoare triple {28536#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {28535#true} is VALID [2018-11-23 12:18:31,017 INFO L273 TraceCheckUtils]: 74: Hoare triple {28535#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {28535#true} is VALID [2018-11-23 12:18:31,017 INFO L273 TraceCheckUtils]: 75: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,017 INFO L273 TraceCheckUtils]: 76: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,017 INFO L273 TraceCheckUtils]: 77: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,018 INFO L273 TraceCheckUtils]: 78: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,018 INFO L273 TraceCheckUtils]: 79: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,018 INFO L273 TraceCheckUtils]: 80: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,018 INFO L273 TraceCheckUtils]: 81: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,018 INFO L273 TraceCheckUtils]: 82: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,019 INFO L273 TraceCheckUtils]: 83: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,019 INFO L273 TraceCheckUtils]: 84: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,019 INFO L273 TraceCheckUtils]: 85: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,019 INFO L273 TraceCheckUtils]: 86: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,019 INFO L273 TraceCheckUtils]: 87: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,019 INFO L273 TraceCheckUtils]: 88: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,020 INFO L273 TraceCheckUtils]: 89: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,020 INFO L273 TraceCheckUtils]: 90: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,020 INFO L273 TraceCheckUtils]: 91: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,020 INFO L273 TraceCheckUtils]: 92: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,020 INFO L273 TraceCheckUtils]: 93: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,020 INFO L273 TraceCheckUtils]: 94: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,020 INFO L273 TraceCheckUtils]: 95: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,020 INFO L273 TraceCheckUtils]: 96: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,020 INFO L273 TraceCheckUtils]: 97: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,020 INFO L273 TraceCheckUtils]: 98: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,020 INFO L273 TraceCheckUtils]: 99: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,021 INFO L273 TraceCheckUtils]: 100: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,021 INFO L273 TraceCheckUtils]: 101: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,021 INFO L273 TraceCheckUtils]: 102: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,021 INFO L273 TraceCheckUtils]: 103: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,021 INFO L273 TraceCheckUtils]: 104: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,021 INFO L273 TraceCheckUtils]: 105: Hoare triple {28535#true} assume !(~i~0 < 60); {28535#true} is VALID [2018-11-23 12:18:31,021 INFO L273 TraceCheckUtils]: 106: Hoare triple {28535#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {28535#true} is VALID [2018-11-23 12:18:31,021 INFO L273 TraceCheckUtils]: 107: Hoare triple {28535#true} assume true; {28535#true} is VALID [2018-11-23 12:18:31,021 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {28535#true} {28536#false} #75#return; {28536#false} is VALID [2018-11-23 12:18:31,022 INFO L273 TraceCheckUtils]: 109: Hoare triple {28536#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {28536#false} is VALID [2018-11-23 12:18:31,022 INFO L256 TraceCheckUtils]: 110: Hoare triple {28536#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {28535#true} is VALID [2018-11-23 12:18:31,022 INFO L273 TraceCheckUtils]: 111: Hoare triple {28535#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {28535#true} is VALID [2018-11-23 12:18:31,022 INFO L273 TraceCheckUtils]: 112: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,022 INFO L273 TraceCheckUtils]: 113: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,022 INFO L273 TraceCheckUtils]: 114: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,022 INFO L273 TraceCheckUtils]: 115: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,022 INFO L273 TraceCheckUtils]: 116: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,022 INFO L273 TraceCheckUtils]: 117: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,022 INFO L273 TraceCheckUtils]: 118: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,023 INFO L273 TraceCheckUtils]: 119: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,023 INFO L273 TraceCheckUtils]: 120: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,023 INFO L273 TraceCheckUtils]: 121: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,023 INFO L273 TraceCheckUtils]: 122: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,023 INFO L273 TraceCheckUtils]: 123: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,023 INFO L273 TraceCheckUtils]: 124: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,023 INFO L273 TraceCheckUtils]: 125: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,023 INFO L273 TraceCheckUtils]: 126: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,023 INFO L273 TraceCheckUtils]: 127: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,023 INFO L273 TraceCheckUtils]: 128: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,024 INFO L273 TraceCheckUtils]: 129: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,024 INFO L273 TraceCheckUtils]: 130: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,024 INFO L273 TraceCheckUtils]: 131: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,024 INFO L273 TraceCheckUtils]: 132: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,024 INFO L273 TraceCheckUtils]: 133: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,024 INFO L273 TraceCheckUtils]: 134: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,024 INFO L273 TraceCheckUtils]: 135: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,024 INFO L273 TraceCheckUtils]: 136: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,024 INFO L273 TraceCheckUtils]: 137: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,024 INFO L273 TraceCheckUtils]: 138: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,025 INFO L273 TraceCheckUtils]: 139: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,025 INFO L273 TraceCheckUtils]: 140: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,025 INFO L273 TraceCheckUtils]: 141: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,025 INFO L273 TraceCheckUtils]: 142: Hoare triple {28535#true} assume !(~i~0 < 60); {28535#true} is VALID [2018-11-23 12:18:31,025 INFO L273 TraceCheckUtils]: 143: Hoare triple {28535#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {28535#true} is VALID [2018-11-23 12:18:31,025 INFO L273 TraceCheckUtils]: 144: Hoare triple {28535#true} assume true; {28535#true} is VALID [2018-11-23 12:18:31,025 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {28535#true} {28536#false} #77#return; {28536#false} is VALID [2018-11-23 12:18:31,025 INFO L273 TraceCheckUtils]: 146: Hoare triple {28536#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {28536#false} is VALID [2018-11-23 12:18:31,025 INFO L273 TraceCheckUtils]: 147: Hoare triple {28536#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {28536#false} is VALID [2018-11-23 12:18:31,025 INFO L273 TraceCheckUtils]: 148: Hoare triple {28536#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {28536#false} is VALID [2018-11-23 12:18:31,026 INFO L273 TraceCheckUtils]: 149: Hoare triple {28536#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {28536#false} is VALID [2018-11-23 12:18:31,026 INFO L273 TraceCheckUtils]: 150: Hoare triple {28536#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {28536#false} is VALID [2018-11-23 12:18:31,026 INFO L273 TraceCheckUtils]: 151: Hoare triple {28536#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {28536#false} is VALID [2018-11-23 12:18:31,026 INFO L273 TraceCheckUtils]: 152: Hoare triple {28536#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {28536#false} is VALID [2018-11-23 12:18:31,026 INFO L273 TraceCheckUtils]: 153: Hoare triple {28536#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {28536#false} is VALID [2018-11-23 12:18:31,026 INFO L273 TraceCheckUtils]: 154: Hoare triple {28536#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {28536#false} is VALID [2018-11-23 12:18:31,026 INFO L273 TraceCheckUtils]: 155: Hoare triple {28536#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {28536#false} is VALID [2018-11-23 12:18:31,026 INFO L273 TraceCheckUtils]: 156: Hoare triple {28536#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {28536#false} is VALID [2018-11-23 12:18:31,026 INFO L273 TraceCheckUtils]: 157: Hoare triple {28536#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {28536#false} is VALID [2018-11-23 12:18:31,026 INFO L273 TraceCheckUtils]: 158: Hoare triple {28536#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {28536#false} is VALID [2018-11-23 12:18:31,027 INFO L273 TraceCheckUtils]: 159: Hoare triple {28536#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {28536#false} is VALID [2018-11-23 12:18:31,027 INFO L273 TraceCheckUtils]: 160: Hoare triple {28536#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {28536#false} is VALID [2018-11-23 12:18:31,027 INFO L273 TraceCheckUtils]: 161: Hoare triple {28536#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {28536#false} is VALID [2018-11-23 12:18:31,027 INFO L273 TraceCheckUtils]: 162: Hoare triple {28536#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {28536#false} is VALID [2018-11-23 12:18:31,027 INFO L273 TraceCheckUtils]: 163: Hoare triple {28536#false} assume !(~i~2 < 59); {28536#false} is VALID [2018-11-23 12:18:31,027 INFO L273 TraceCheckUtils]: 164: Hoare triple {28536#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {28536#false} is VALID [2018-11-23 12:18:31,027 INFO L256 TraceCheckUtils]: 165: Hoare triple {28536#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {28535#true} is VALID [2018-11-23 12:18:31,027 INFO L273 TraceCheckUtils]: 166: Hoare triple {28535#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {28535#true} is VALID [2018-11-23 12:18:31,027 INFO L273 TraceCheckUtils]: 167: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,027 INFO L273 TraceCheckUtils]: 168: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,028 INFO L273 TraceCheckUtils]: 169: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,028 INFO L273 TraceCheckUtils]: 170: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,028 INFO L273 TraceCheckUtils]: 171: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,028 INFO L273 TraceCheckUtils]: 172: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,028 INFO L273 TraceCheckUtils]: 173: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,028 INFO L273 TraceCheckUtils]: 174: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,028 INFO L273 TraceCheckUtils]: 175: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,028 INFO L273 TraceCheckUtils]: 176: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,028 INFO L273 TraceCheckUtils]: 177: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,028 INFO L273 TraceCheckUtils]: 178: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,029 INFO L273 TraceCheckUtils]: 179: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,029 INFO L273 TraceCheckUtils]: 180: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,029 INFO L273 TraceCheckUtils]: 181: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,029 INFO L273 TraceCheckUtils]: 182: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,029 INFO L273 TraceCheckUtils]: 183: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,029 INFO L273 TraceCheckUtils]: 184: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,029 INFO L273 TraceCheckUtils]: 185: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,029 INFO L273 TraceCheckUtils]: 186: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,029 INFO L273 TraceCheckUtils]: 187: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,029 INFO L273 TraceCheckUtils]: 188: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,030 INFO L273 TraceCheckUtils]: 189: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,030 INFO L273 TraceCheckUtils]: 190: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,030 INFO L273 TraceCheckUtils]: 191: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,030 INFO L273 TraceCheckUtils]: 192: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,030 INFO L273 TraceCheckUtils]: 193: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,030 INFO L273 TraceCheckUtils]: 194: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,030 INFO L273 TraceCheckUtils]: 195: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,030 INFO L273 TraceCheckUtils]: 196: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,030 INFO L273 TraceCheckUtils]: 197: Hoare triple {28535#true} assume !(~i~0 < 60); {28535#true} is VALID [2018-11-23 12:18:31,030 INFO L273 TraceCheckUtils]: 198: Hoare triple {28535#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {28535#true} is VALID [2018-11-23 12:18:31,031 INFO L273 TraceCheckUtils]: 199: Hoare triple {28535#true} assume true; {28535#true} is VALID [2018-11-23 12:18:31,031 INFO L268 TraceCheckUtils]: 200: Hoare quadruple {28535#true} {28536#false} #79#return; {28536#false} is VALID [2018-11-23 12:18:31,031 INFO L273 TraceCheckUtils]: 201: Hoare triple {28536#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {28536#false} is VALID [2018-11-23 12:18:31,031 INFO L273 TraceCheckUtils]: 202: Hoare triple {28536#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {28536#false} is VALID [2018-11-23 12:18:31,031 INFO L273 TraceCheckUtils]: 203: Hoare triple {28536#false} assume !false; {28536#false} is VALID [2018-11-23 12:18:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2563 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1474 trivial. 0 not checked. [2018-11-23 12:18:31,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:18:31,073 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:18:31,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:18:31,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 12:18:31,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:18:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:18:31,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:18:31,682 INFO L256 TraceCheckUtils]: 0: Hoare triple {28535#true} call ULTIMATE.init(); {28535#true} is VALID [2018-11-23 12:18:31,682 INFO L273 TraceCheckUtils]: 1: Hoare triple {28535#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28535#true} is VALID [2018-11-23 12:18:31,683 INFO L273 TraceCheckUtils]: 2: Hoare triple {28535#true} assume true; {28535#true} is VALID [2018-11-23 12:18:31,683 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28535#true} {28535#true} #71#return; {28535#true} is VALID [2018-11-23 12:18:31,683 INFO L256 TraceCheckUtils]: 4: Hoare triple {28535#true} call #t~ret14 := main(); {28535#true} is VALID [2018-11-23 12:18:31,683 INFO L273 TraceCheckUtils]: 5: Hoare triple {28535#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {28535#true} is VALID [2018-11-23 12:18:31,683 INFO L273 TraceCheckUtils]: 6: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,684 INFO L273 TraceCheckUtils]: 7: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,684 INFO L273 TraceCheckUtils]: 8: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,684 INFO L273 TraceCheckUtils]: 9: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,684 INFO L273 TraceCheckUtils]: 10: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,684 INFO L273 TraceCheckUtils]: 11: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,685 INFO L273 TraceCheckUtils]: 12: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,685 INFO L273 TraceCheckUtils]: 13: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,685 INFO L273 TraceCheckUtils]: 14: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,685 INFO L273 TraceCheckUtils]: 15: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,685 INFO L273 TraceCheckUtils]: 16: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,685 INFO L273 TraceCheckUtils]: 17: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,685 INFO L273 TraceCheckUtils]: 18: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,685 INFO L273 TraceCheckUtils]: 19: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,685 INFO L273 TraceCheckUtils]: 20: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,686 INFO L273 TraceCheckUtils]: 21: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,686 INFO L273 TraceCheckUtils]: 22: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,686 INFO L273 TraceCheckUtils]: 23: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,686 INFO L273 TraceCheckUtils]: 24: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,686 INFO L273 TraceCheckUtils]: 25: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,686 INFO L273 TraceCheckUtils]: 26: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,686 INFO L273 TraceCheckUtils]: 27: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,686 INFO L273 TraceCheckUtils]: 28: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,686 INFO L273 TraceCheckUtils]: 29: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,686 INFO L273 TraceCheckUtils]: 30: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,687 INFO L273 TraceCheckUtils]: 31: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,687 INFO L273 TraceCheckUtils]: 32: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,687 INFO L273 TraceCheckUtils]: 33: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,687 INFO L273 TraceCheckUtils]: 34: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,687 INFO L273 TraceCheckUtils]: 35: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,687 INFO L273 TraceCheckUtils]: 36: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,687 INFO L273 TraceCheckUtils]: 37: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,687 INFO L273 TraceCheckUtils]: 38: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,687 INFO L273 TraceCheckUtils]: 39: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,687 INFO L273 TraceCheckUtils]: 40: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,688 INFO L273 TraceCheckUtils]: 41: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,688 INFO L273 TraceCheckUtils]: 42: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,688 INFO L273 TraceCheckUtils]: 43: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,688 INFO L273 TraceCheckUtils]: 44: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,688 INFO L273 TraceCheckUtils]: 45: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,688 INFO L273 TraceCheckUtils]: 46: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,688 INFO L273 TraceCheckUtils]: 47: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,688 INFO L273 TraceCheckUtils]: 48: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,688 INFO L273 TraceCheckUtils]: 49: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,688 INFO L273 TraceCheckUtils]: 50: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,689 INFO L273 TraceCheckUtils]: 51: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,689 INFO L273 TraceCheckUtils]: 52: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,689 INFO L273 TraceCheckUtils]: 53: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,689 INFO L273 TraceCheckUtils]: 54: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,689 INFO L273 TraceCheckUtils]: 55: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,689 INFO L273 TraceCheckUtils]: 56: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,689 INFO L273 TraceCheckUtils]: 57: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,689 INFO L273 TraceCheckUtils]: 58: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,689 INFO L273 TraceCheckUtils]: 59: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,689 INFO L273 TraceCheckUtils]: 60: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,690 INFO L273 TraceCheckUtils]: 61: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,690 INFO L273 TraceCheckUtils]: 62: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,690 INFO L273 TraceCheckUtils]: 63: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,690 INFO L273 TraceCheckUtils]: 64: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,690 INFO L273 TraceCheckUtils]: 65: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,690 INFO L273 TraceCheckUtils]: 66: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,690 INFO L273 TraceCheckUtils]: 67: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,690 INFO L273 TraceCheckUtils]: 68: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,690 INFO L273 TraceCheckUtils]: 69: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,690 INFO L273 TraceCheckUtils]: 70: Hoare triple {28535#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {28535#true} is VALID [2018-11-23 12:18:31,691 INFO L273 TraceCheckUtils]: 71: Hoare triple {28535#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {28535#true} is VALID [2018-11-23 12:18:31,691 INFO L273 TraceCheckUtils]: 72: Hoare triple {28535#true} assume !(~i~1 < 60); {28535#true} is VALID [2018-11-23 12:18:31,691 INFO L256 TraceCheckUtils]: 73: Hoare triple {28535#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {28535#true} is VALID [2018-11-23 12:18:31,691 INFO L273 TraceCheckUtils]: 74: Hoare triple {28535#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {28535#true} is VALID [2018-11-23 12:18:31,691 INFO L273 TraceCheckUtils]: 75: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,691 INFO L273 TraceCheckUtils]: 76: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,691 INFO L273 TraceCheckUtils]: 77: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,691 INFO L273 TraceCheckUtils]: 78: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,691 INFO L273 TraceCheckUtils]: 79: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,691 INFO L273 TraceCheckUtils]: 80: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,692 INFO L273 TraceCheckUtils]: 81: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,692 INFO L273 TraceCheckUtils]: 82: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,692 INFO L273 TraceCheckUtils]: 83: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,692 INFO L273 TraceCheckUtils]: 84: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,692 INFO L273 TraceCheckUtils]: 85: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,692 INFO L273 TraceCheckUtils]: 86: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,692 INFO L273 TraceCheckUtils]: 87: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,692 INFO L273 TraceCheckUtils]: 88: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,692 INFO L273 TraceCheckUtils]: 89: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,692 INFO L273 TraceCheckUtils]: 90: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,693 INFO L273 TraceCheckUtils]: 91: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,693 INFO L273 TraceCheckUtils]: 92: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,693 INFO L273 TraceCheckUtils]: 93: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,693 INFO L273 TraceCheckUtils]: 94: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,693 INFO L273 TraceCheckUtils]: 95: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,693 INFO L273 TraceCheckUtils]: 96: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,693 INFO L273 TraceCheckUtils]: 97: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,693 INFO L273 TraceCheckUtils]: 98: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,693 INFO L273 TraceCheckUtils]: 99: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,693 INFO L273 TraceCheckUtils]: 100: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,694 INFO L273 TraceCheckUtils]: 101: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,694 INFO L273 TraceCheckUtils]: 102: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,694 INFO L273 TraceCheckUtils]: 103: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,694 INFO L273 TraceCheckUtils]: 104: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,694 INFO L273 TraceCheckUtils]: 105: Hoare triple {28535#true} assume !(~i~0 < 60); {28535#true} is VALID [2018-11-23 12:18:31,694 INFO L273 TraceCheckUtils]: 106: Hoare triple {28535#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {28535#true} is VALID [2018-11-23 12:18:31,694 INFO L273 TraceCheckUtils]: 107: Hoare triple {28535#true} assume true; {28535#true} is VALID [2018-11-23 12:18:31,694 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {28535#true} {28535#true} #75#return; {28535#true} is VALID [2018-11-23 12:18:31,694 INFO L273 TraceCheckUtils]: 109: Hoare triple {28535#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {28535#true} is VALID [2018-11-23 12:18:31,695 INFO L256 TraceCheckUtils]: 110: Hoare triple {28535#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {28535#true} is VALID [2018-11-23 12:18:31,695 INFO L273 TraceCheckUtils]: 111: Hoare triple {28535#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {28535#true} is VALID [2018-11-23 12:18:31,695 INFO L273 TraceCheckUtils]: 112: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,695 INFO L273 TraceCheckUtils]: 113: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,695 INFO L273 TraceCheckUtils]: 114: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,695 INFO L273 TraceCheckUtils]: 115: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,695 INFO L273 TraceCheckUtils]: 116: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,695 INFO L273 TraceCheckUtils]: 117: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,695 INFO L273 TraceCheckUtils]: 118: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,695 INFO L273 TraceCheckUtils]: 119: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,696 INFO L273 TraceCheckUtils]: 120: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,696 INFO L273 TraceCheckUtils]: 121: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,696 INFO L273 TraceCheckUtils]: 122: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,696 INFO L273 TraceCheckUtils]: 123: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,696 INFO L273 TraceCheckUtils]: 124: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,696 INFO L273 TraceCheckUtils]: 125: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,696 INFO L273 TraceCheckUtils]: 126: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,696 INFO L273 TraceCheckUtils]: 127: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,696 INFO L273 TraceCheckUtils]: 128: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,696 INFO L273 TraceCheckUtils]: 129: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,697 INFO L273 TraceCheckUtils]: 130: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,697 INFO L273 TraceCheckUtils]: 131: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,697 INFO L273 TraceCheckUtils]: 132: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,697 INFO L273 TraceCheckUtils]: 133: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,697 INFO L273 TraceCheckUtils]: 134: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,697 INFO L273 TraceCheckUtils]: 135: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,697 INFO L273 TraceCheckUtils]: 136: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,697 INFO L273 TraceCheckUtils]: 137: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,697 INFO L273 TraceCheckUtils]: 138: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,697 INFO L273 TraceCheckUtils]: 139: Hoare triple {28535#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28535#true} is VALID [2018-11-23 12:18:31,698 INFO L273 TraceCheckUtils]: 140: Hoare triple {28535#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28535#true} is VALID [2018-11-23 12:18:31,698 INFO L273 TraceCheckUtils]: 141: Hoare triple {28535#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28535#true} is VALID [2018-11-23 12:18:31,698 INFO L273 TraceCheckUtils]: 142: Hoare triple {28535#true} assume !(~i~0 < 60); {28535#true} is VALID [2018-11-23 12:18:31,698 INFO L273 TraceCheckUtils]: 143: Hoare triple {28535#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {28535#true} is VALID [2018-11-23 12:18:31,698 INFO L273 TraceCheckUtils]: 144: Hoare triple {28535#true} assume true; {28535#true} is VALID [2018-11-23 12:18:31,698 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {28535#true} {28535#true} #77#return; {28535#true} is VALID [2018-11-23 12:18:31,699 INFO L273 TraceCheckUtils]: 146: Hoare triple {28535#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {29012#(<= main_~i~2 0)} is VALID [2018-11-23 12:18:31,699 INFO L273 TraceCheckUtils]: 147: Hoare triple {29012#(<= main_~i~2 0)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {29012#(<= main_~i~2 0)} is VALID [2018-11-23 12:18:31,699 INFO L273 TraceCheckUtils]: 148: Hoare triple {29012#(<= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {29019#(<= main_~i~2 1)} is VALID [2018-11-23 12:18:31,700 INFO L273 TraceCheckUtils]: 149: Hoare triple {29019#(<= main_~i~2 1)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {29019#(<= main_~i~2 1)} is VALID [2018-11-23 12:18:31,700 INFO L273 TraceCheckUtils]: 150: Hoare triple {29019#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {29026#(<= main_~i~2 2)} is VALID [2018-11-23 12:18:31,700 INFO L273 TraceCheckUtils]: 151: Hoare triple {29026#(<= main_~i~2 2)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {29026#(<= main_~i~2 2)} is VALID [2018-11-23 12:18:31,701 INFO L273 TraceCheckUtils]: 152: Hoare triple {29026#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {29033#(<= main_~i~2 3)} is VALID [2018-11-23 12:18:31,701 INFO L273 TraceCheckUtils]: 153: Hoare triple {29033#(<= main_~i~2 3)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {29033#(<= main_~i~2 3)} is VALID [2018-11-23 12:18:31,702 INFO L273 TraceCheckUtils]: 154: Hoare triple {29033#(<= main_~i~2 3)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {29040#(<= main_~i~2 4)} is VALID [2018-11-23 12:18:31,702 INFO L273 TraceCheckUtils]: 155: Hoare triple {29040#(<= main_~i~2 4)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {29040#(<= main_~i~2 4)} is VALID [2018-11-23 12:18:31,703 INFO L273 TraceCheckUtils]: 156: Hoare triple {29040#(<= main_~i~2 4)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {29047#(<= main_~i~2 5)} is VALID [2018-11-23 12:18:31,703 INFO L273 TraceCheckUtils]: 157: Hoare triple {29047#(<= main_~i~2 5)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {29047#(<= main_~i~2 5)} is VALID [2018-11-23 12:18:31,704 INFO L273 TraceCheckUtils]: 158: Hoare triple {29047#(<= main_~i~2 5)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {29054#(<= main_~i~2 6)} is VALID [2018-11-23 12:18:31,705 INFO L273 TraceCheckUtils]: 159: Hoare triple {29054#(<= main_~i~2 6)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {29054#(<= main_~i~2 6)} is VALID [2018-11-23 12:18:31,705 INFO L273 TraceCheckUtils]: 160: Hoare triple {29054#(<= main_~i~2 6)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {29061#(<= main_~i~2 7)} is VALID [2018-11-23 12:18:31,706 INFO L273 TraceCheckUtils]: 161: Hoare triple {29061#(<= main_~i~2 7)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {29061#(<= main_~i~2 7)} is VALID [2018-11-23 12:18:31,706 INFO L273 TraceCheckUtils]: 162: Hoare triple {29061#(<= main_~i~2 7)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {29068#(<= main_~i~2 8)} is VALID [2018-11-23 12:18:31,707 INFO L273 TraceCheckUtils]: 163: Hoare triple {29068#(<= main_~i~2 8)} assume !(~i~2 < 59); {28536#false} is VALID [2018-11-23 12:18:31,707 INFO L273 TraceCheckUtils]: 164: Hoare triple {28536#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {28536#false} is VALID [2018-11-23 12:18:31,708 INFO L256 TraceCheckUtils]: 165: Hoare triple {28536#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {28536#false} is VALID [2018-11-23 12:18:31,708 INFO L273 TraceCheckUtils]: 166: Hoare triple {28536#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {28536#false} is VALID [2018-11-23 12:18:31,708 INFO L273 TraceCheckUtils]: 167: Hoare triple {28536#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28536#false} is VALID [2018-11-23 12:18:31,708 INFO L273 TraceCheckUtils]: 168: Hoare triple {28536#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28536#false} is VALID [2018-11-23 12:18:31,708 INFO L273 TraceCheckUtils]: 169: Hoare triple {28536#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28536#false} is VALID [2018-11-23 12:18:31,708 INFO L273 TraceCheckUtils]: 170: Hoare triple {28536#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28536#false} is VALID [2018-11-23 12:18:31,709 INFO L273 TraceCheckUtils]: 171: Hoare triple {28536#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28536#false} is VALID [2018-11-23 12:18:31,709 INFO L273 TraceCheckUtils]: 172: Hoare triple {28536#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28536#false} is VALID [2018-11-23 12:18:31,709 INFO L273 TraceCheckUtils]: 173: Hoare triple {28536#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28536#false} is VALID [2018-11-23 12:18:31,709 INFO L273 TraceCheckUtils]: 174: Hoare triple {28536#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28536#false} is VALID [2018-11-23 12:18:31,709 INFO L273 TraceCheckUtils]: 175: Hoare triple {28536#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28536#false} is VALID [2018-11-23 12:18:31,709 INFO L273 TraceCheckUtils]: 176: Hoare triple {28536#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28536#false} is VALID [2018-11-23 12:18:31,710 INFO L273 TraceCheckUtils]: 177: Hoare triple {28536#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28536#false} is VALID [2018-11-23 12:18:31,710 INFO L273 TraceCheckUtils]: 178: Hoare triple {28536#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28536#false} is VALID [2018-11-23 12:18:31,710 INFO L273 TraceCheckUtils]: 179: Hoare triple {28536#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28536#false} is VALID [2018-11-23 12:18:31,710 INFO L273 TraceCheckUtils]: 180: Hoare triple {28536#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28536#false} is VALID [2018-11-23 12:18:31,710 INFO L273 TraceCheckUtils]: 181: Hoare triple {28536#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28536#false} is VALID [2018-11-23 12:18:31,710 INFO L273 TraceCheckUtils]: 182: Hoare triple {28536#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28536#false} is VALID [2018-11-23 12:18:31,711 INFO L273 TraceCheckUtils]: 183: Hoare triple {28536#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28536#false} is VALID [2018-11-23 12:18:31,711 INFO L273 TraceCheckUtils]: 184: Hoare triple {28536#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28536#false} is VALID [2018-11-23 12:18:31,711 INFO L273 TraceCheckUtils]: 185: Hoare triple {28536#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28536#false} is VALID [2018-11-23 12:18:31,711 INFO L273 TraceCheckUtils]: 186: Hoare triple {28536#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28536#false} is VALID [2018-11-23 12:18:31,711 INFO L273 TraceCheckUtils]: 187: Hoare triple {28536#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28536#false} is VALID [2018-11-23 12:18:31,712 INFO L273 TraceCheckUtils]: 188: Hoare triple {28536#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28536#false} is VALID [2018-11-23 12:18:31,712 INFO L273 TraceCheckUtils]: 189: Hoare triple {28536#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28536#false} is VALID [2018-11-23 12:18:31,712 INFO L273 TraceCheckUtils]: 190: Hoare triple {28536#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28536#false} is VALID [2018-11-23 12:18:31,712 INFO L273 TraceCheckUtils]: 191: Hoare triple {28536#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28536#false} is VALID [2018-11-23 12:18:31,712 INFO L273 TraceCheckUtils]: 192: Hoare triple {28536#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28536#false} is VALID [2018-11-23 12:18:31,712 INFO L273 TraceCheckUtils]: 193: Hoare triple {28536#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28536#false} is VALID [2018-11-23 12:18:31,712 INFO L273 TraceCheckUtils]: 194: Hoare triple {28536#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {28536#false} is VALID [2018-11-23 12:18:31,712 INFO L273 TraceCheckUtils]: 195: Hoare triple {28536#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {28536#false} is VALID [2018-11-23 12:18:31,712 INFO L273 TraceCheckUtils]: 196: Hoare triple {28536#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {28536#false} is VALID [2018-11-23 12:18:31,712 INFO L273 TraceCheckUtils]: 197: Hoare triple {28536#false} assume !(~i~0 < 60); {28536#false} is VALID [2018-11-23 12:18:31,713 INFO L273 TraceCheckUtils]: 198: Hoare triple {28536#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {28536#false} is VALID [2018-11-23 12:18:31,713 INFO L273 TraceCheckUtils]: 199: Hoare triple {28536#false} assume true; {28536#false} is VALID [2018-11-23 12:18:31,713 INFO L268 TraceCheckUtils]: 200: Hoare quadruple {28536#false} {28536#false} #79#return; {28536#false} is VALID [2018-11-23 12:18:31,713 INFO L273 TraceCheckUtils]: 201: Hoare triple {28536#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {28536#false} is VALID [2018-11-23 12:18:31,713 INFO L273 TraceCheckUtils]: 202: Hoare triple {28536#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {28536#false} is VALID [2018-11-23 12:18:31,713 INFO L273 TraceCheckUtils]: 203: Hoare triple {28536#false} assume !false; {28536#false} is VALID [2018-11-23 12:18:31,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2563 backedges. 650 proven. 64 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-11-23 12:18:31,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:18:31,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 11] total 45 [2018-11-23 12:18:31,750 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 204 [2018-11-23 12:18:31,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:18:31,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states. [2018-11-23 12:18:31,882 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:18:31,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-23 12:18:31,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-23 12:18:31,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=684, Invalid=1296, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:18:31,885 INFO L87 Difference]: Start difference. First operand 135 states and 149 transitions. Second operand 45 states. [2018-11-23 12:18:32,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:32,916 INFO L93 Difference]: Finished difference Result 203 states and 232 transitions. [2018-11-23 12:18:32,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-23 12:18:32,916 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 204 [2018-11-23 12:18:32,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:18:32,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:18:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 143 transitions. [2018-11-23 12:18:32,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:18:32,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 143 transitions. [2018-11-23 12:18:32,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 143 transitions. [2018-11-23 12:18:33,059 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-23 12:18:33,062 INFO L225 Difference]: With dead ends: 203 [2018-11-23 12:18:33,062 INFO L226 Difference]: Without dead ends: 141 [2018-11-23 12:18:33,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=684, Invalid=1296, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:18:33,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-23 12:18:33,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-11-23 12:18:33,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:18:33,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand 139 states. [2018-11-23 12:18:33,112 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 139 states. [2018-11-23 12:18:33,112 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 139 states. [2018-11-23 12:18:33,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:33,114 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2018-11-23 12:18:33,115 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2018-11-23 12:18:33,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:18:33,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:18:33,115 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 141 states. [2018-11-23 12:18:33,115 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 141 states. [2018-11-23 12:18:33,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:33,117 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2018-11-23 12:18:33,117 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2018-11-23 12:18:33,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:18:33,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:18:33,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:18:33,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:18:33,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-23 12:18:33,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2018-11-23 12:18:33,120 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 204 [2018-11-23 12:18:33,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:18:33,120 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2018-11-23 12:18:33,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-23 12:18:33,120 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2018-11-23 12:18:33,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-11-23 12:18:33,121 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:18:33,121 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 30, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:18:33,121 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:18:33,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:18:33,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1382401224, now seen corresponding path program 34 times [2018-11-23 12:18:33,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:18:33,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:18:33,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:33,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:18:33,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:18:34,923 INFO L256 TraceCheckUtils]: 0: Hoare triple {29967#true} call ULTIMATE.init(); {29967#true} is VALID [2018-11-23 12:18:34,924 INFO L273 TraceCheckUtils]: 1: Hoare triple {29967#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {29967#true} is VALID [2018-11-23 12:18:34,924 INFO L273 TraceCheckUtils]: 2: Hoare triple {29967#true} assume true; {29967#true} is VALID [2018-11-23 12:18:34,924 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29967#true} {29967#true} #71#return; {29967#true} is VALID [2018-11-23 12:18:34,924 INFO L256 TraceCheckUtils]: 4: Hoare triple {29967#true} call #t~ret14 := main(); {29967#true} is VALID [2018-11-23 12:18:34,925 INFO L273 TraceCheckUtils]: 5: Hoare triple {29967#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {29969#(= main_~i~1 0)} is VALID [2018-11-23 12:18:34,925 INFO L273 TraceCheckUtils]: 6: Hoare triple {29969#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29969#(= main_~i~1 0)} is VALID [2018-11-23 12:18:34,926 INFO L273 TraceCheckUtils]: 7: Hoare triple {29969#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29970#(<= main_~i~1 1)} is VALID [2018-11-23 12:18:34,926 INFO L273 TraceCheckUtils]: 8: Hoare triple {29970#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29970#(<= main_~i~1 1)} is VALID [2018-11-23 12:18:34,927 INFO L273 TraceCheckUtils]: 9: Hoare triple {29970#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29971#(<= main_~i~1 2)} is VALID [2018-11-23 12:18:34,927 INFO L273 TraceCheckUtils]: 10: Hoare triple {29971#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29971#(<= main_~i~1 2)} is VALID [2018-11-23 12:18:34,927 INFO L273 TraceCheckUtils]: 11: Hoare triple {29971#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29972#(<= main_~i~1 3)} is VALID [2018-11-23 12:18:34,928 INFO L273 TraceCheckUtils]: 12: Hoare triple {29972#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29972#(<= main_~i~1 3)} is VALID [2018-11-23 12:18:34,928 INFO L273 TraceCheckUtils]: 13: Hoare triple {29972#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29973#(<= main_~i~1 4)} is VALID [2018-11-23 12:18:34,929 INFO L273 TraceCheckUtils]: 14: Hoare triple {29973#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29973#(<= main_~i~1 4)} is VALID [2018-11-23 12:18:34,930 INFO L273 TraceCheckUtils]: 15: Hoare triple {29973#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29974#(<= main_~i~1 5)} is VALID [2018-11-23 12:18:34,930 INFO L273 TraceCheckUtils]: 16: Hoare triple {29974#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29974#(<= main_~i~1 5)} is VALID [2018-11-23 12:18:34,931 INFO L273 TraceCheckUtils]: 17: Hoare triple {29974#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29975#(<= main_~i~1 6)} is VALID [2018-11-23 12:18:34,931 INFO L273 TraceCheckUtils]: 18: Hoare triple {29975#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29975#(<= main_~i~1 6)} is VALID [2018-11-23 12:18:34,932 INFO L273 TraceCheckUtils]: 19: Hoare triple {29975#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29976#(<= main_~i~1 7)} is VALID [2018-11-23 12:18:34,933 INFO L273 TraceCheckUtils]: 20: Hoare triple {29976#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29976#(<= main_~i~1 7)} is VALID [2018-11-23 12:18:34,933 INFO L273 TraceCheckUtils]: 21: Hoare triple {29976#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29977#(<= main_~i~1 8)} is VALID [2018-11-23 12:18:34,934 INFO L273 TraceCheckUtils]: 22: Hoare triple {29977#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29977#(<= main_~i~1 8)} is VALID [2018-11-23 12:18:34,935 INFO L273 TraceCheckUtils]: 23: Hoare triple {29977#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29978#(<= main_~i~1 9)} is VALID [2018-11-23 12:18:34,935 INFO L273 TraceCheckUtils]: 24: Hoare triple {29978#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29978#(<= main_~i~1 9)} is VALID [2018-11-23 12:18:34,936 INFO L273 TraceCheckUtils]: 25: Hoare triple {29978#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29979#(<= main_~i~1 10)} is VALID [2018-11-23 12:18:34,936 INFO L273 TraceCheckUtils]: 26: Hoare triple {29979#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29979#(<= main_~i~1 10)} is VALID [2018-11-23 12:18:34,937 INFO L273 TraceCheckUtils]: 27: Hoare triple {29979#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29980#(<= main_~i~1 11)} is VALID [2018-11-23 12:18:34,938 INFO L273 TraceCheckUtils]: 28: Hoare triple {29980#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29980#(<= main_~i~1 11)} is VALID [2018-11-23 12:18:34,938 INFO L273 TraceCheckUtils]: 29: Hoare triple {29980#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29981#(<= main_~i~1 12)} is VALID [2018-11-23 12:18:34,939 INFO L273 TraceCheckUtils]: 30: Hoare triple {29981#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29981#(<= main_~i~1 12)} is VALID [2018-11-23 12:18:34,939 INFO L273 TraceCheckUtils]: 31: Hoare triple {29981#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29982#(<= main_~i~1 13)} is VALID [2018-11-23 12:18:34,940 INFO L273 TraceCheckUtils]: 32: Hoare triple {29982#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29982#(<= main_~i~1 13)} is VALID [2018-11-23 12:18:34,941 INFO L273 TraceCheckUtils]: 33: Hoare triple {29982#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29983#(<= main_~i~1 14)} is VALID [2018-11-23 12:18:34,941 INFO L273 TraceCheckUtils]: 34: Hoare triple {29983#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29983#(<= main_~i~1 14)} is VALID [2018-11-23 12:18:34,942 INFO L273 TraceCheckUtils]: 35: Hoare triple {29983#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29984#(<= main_~i~1 15)} is VALID [2018-11-23 12:18:34,942 INFO L273 TraceCheckUtils]: 36: Hoare triple {29984#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29984#(<= main_~i~1 15)} is VALID [2018-11-23 12:18:34,943 INFO L273 TraceCheckUtils]: 37: Hoare triple {29984#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29985#(<= main_~i~1 16)} is VALID [2018-11-23 12:18:34,944 INFO L273 TraceCheckUtils]: 38: Hoare triple {29985#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29985#(<= main_~i~1 16)} is VALID [2018-11-23 12:18:34,944 INFO L273 TraceCheckUtils]: 39: Hoare triple {29985#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29986#(<= main_~i~1 17)} is VALID [2018-11-23 12:18:34,945 INFO L273 TraceCheckUtils]: 40: Hoare triple {29986#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29986#(<= main_~i~1 17)} is VALID [2018-11-23 12:18:34,946 INFO L273 TraceCheckUtils]: 41: Hoare triple {29986#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29987#(<= main_~i~1 18)} is VALID [2018-11-23 12:18:34,946 INFO L273 TraceCheckUtils]: 42: Hoare triple {29987#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29987#(<= main_~i~1 18)} is VALID [2018-11-23 12:18:34,947 INFO L273 TraceCheckUtils]: 43: Hoare triple {29987#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29988#(<= main_~i~1 19)} is VALID [2018-11-23 12:18:34,947 INFO L273 TraceCheckUtils]: 44: Hoare triple {29988#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29988#(<= main_~i~1 19)} is VALID [2018-11-23 12:18:34,948 INFO L273 TraceCheckUtils]: 45: Hoare triple {29988#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29989#(<= main_~i~1 20)} is VALID [2018-11-23 12:18:34,949 INFO L273 TraceCheckUtils]: 46: Hoare triple {29989#(<= main_~i~1 20)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29989#(<= main_~i~1 20)} is VALID [2018-11-23 12:18:34,949 INFO L273 TraceCheckUtils]: 47: Hoare triple {29989#(<= main_~i~1 20)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29990#(<= main_~i~1 21)} is VALID [2018-11-23 12:18:34,950 INFO L273 TraceCheckUtils]: 48: Hoare triple {29990#(<= main_~i~1 21)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29990#(<= main_~i~1 21)} is VALID [2018-11-23 12:18:34,951 INFO L273 TraceCheckUtils]: 49: Hoare triple {29990#(<= main_~i~1 21)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29991#(<= main_~i~1 22)} is VALID [2018-11-23 12:18:34,951 INFO L273 TraceCheckUtils]: 50: Hoare triple {29991#(<= main_~i~1 22)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29991#(<= main_~i~1 22)} is VALID [2018-11-23 12:18:34,952 INFO L273 TraceCheckUtils]: 51: Hoare triple {29991#(<= main_~i~1 22)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29992#(<= main_~i~1 23)} is VALID [2018-11-23 12:18:34,952 INFO L273 TraceCheckUtils]: 52: Hoare triple {29992#(<= main_~i~1 23)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29992#(<= main_~i~1 23)} is VALID [2018-11-23 12:18:34,953 INFO L273 TraceCheckUtils]: 53: Hoare triple {29992#(<= main_~i~1 23)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29993#(<= main_~i~1 24)} is VALID [2018-11-23 12:18:34,954 INFO L273 TraceCheckUtils]: 54: Hoare triple {29993#(<= main_~i~1 24)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29993#(<= main_~i~1 24)} is VALID [2018-11-23 12:18:34,954 INFO L273 TraceCheckUtils]: 55: Hoare triple {29993#(<= main_~i~1 24)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29994#(<= main_~i~1 25)} is VALID [2018-11-23 12:18:34,955 INFO L273 TraceCheckUtils]: 56: Hoare triple {29994#(<= main_~i~1 25)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29994#(<= main_~i~1 25)} is VALID [2018-11-23 12:18:34,956 INFO L273 TraceCheckUtils]: 57: Hoare triple {29994#(<= main_~i~1 25)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29995#(<= main_~i~1 26)} is VALID [2018-11-23 12:18:34,956 INFO L273 TraceCheckUtils]: 58: Hoare triple {29995#(<= main_~i~1 26)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29995#(<= main_~i~1 26)} is VALID [2018-11-23 12:18:34,957 INFO L273 TraceCheckUtils]: 59: Hoare triple {29995#(<= main_~i~1 26)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29996#(<= main_~i~1 27)} is VALID [2018-11-23 12:18:34,957 INFO L273 TraceCheckUtils]: 60: Hoare triple {29996#(<= main_~i~1 27)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29996#(<= main_~i~1 27)} is VALID [2018-11-23 12:18:34,958 INFO L273 TraceCheckUtils]: 61: Hoare triple {29996#(<= main_~i~1 27)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29997#(<= main_~i~1 28)} is VALID [2018-11-23 12:18:34,959 INFO L273 TraceCheckUtils]: 62: Hoare triple {29997#(<= main_~i~1 28)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29997#(<= main_~i~1 28)} is VALID [2018-11-23 12:18:34,959 INFO L273 TraceCheckUtils]: 63: Hoare triple {29997#(<= main_~i~1 28)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29998#(<= main_~i~1 29)} is VALID [2018-11-23 12:18:34,960 INFO L273 TraceCheckUtils]: 64: Hoare triple {29998#(<= main_~i~1 29)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29998#(<= main_~i~1 29)} is VALID [2018-11-23 12:18:34,961 INFO L273 TraceCheckUtils]: 65: Hoare triple {29998#(<= main_~i~1 29)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29999#(<= main_~i~1 30)} is VALID [2018-11-23 12:18:34,961 INFO L273 TraceCheckUtils]: 66: Hoare triple {29999#(<= main_~i~1 30)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29999#(<= main_~i~1 30)} is VALID [2018-11-23 12:18:34,962 INFO L273 TraceCheckUtils]: 67: Hoare triple {29999#(<= main_~i~1 30)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30000#(<= main_~i~1 31)} is VALID [2018-11-23 12:18:34,962 INFO L273 TraceCheckUtils]: 68: Hoare triple {30000#(<= main_~i~1 31)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {30000#(<= main_~i~1 31)} is VALID [2018-11-23 12:18:34,963 INFO L273 TraceCheckUtils]: 69: Hoare triple {30000#(<= main_~i~1 31)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30001#(<= main_~i~1 32)} is VALID [2018-11-23 12:18:34,963 INFO L273 TraceCheckUtils]: 70: Hoare triple {30001#(<= main_~i~1 32)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {30001#(<= main_~i~1 32)} is VALID [2018-11-23 12:18:34,964 INFO L273 TraceCheckUtils]: 71: Hoare triple {30001#(<= main_~i~1 32)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30002#(<= main_~i~1 33)} is VALID [2018-11-23 12:18:34,965 INFO L273 TraceCheckUtils]: 72: Hoare triple {30002#(<= main_~i~1 33)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {30002#(<= main_~i~1 33)} is VALID [2018-11-23 12:18:34,965 INFO L273 TraceCheckUtils]: 73: Hoare triple {30002#(<= main_~i~1 33)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30003#(<= main_~i~1 34)} is VALID [2018-11-23 12:18:34,966 INFO L273 TraceCheckUtils]: 74: Hoare triple {30003#(<= main_~i~1 34)} assume !(~i~1 < 60); {29968#false} is VALID [2018-11-23 12:18:34,966 INFO L256 TraceCheckUtils]: 75: Hoare triple {29968#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {29967#true} is VALID [2018-11-23 12:18:34,966 INFO L273 TraceCheckUtils]: 76: Hoare triple {29967#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {29967#true} is VALID [2018-11-23 12:18:34,967 INFO L273 TraceCheckUtils]: 77: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,967 INFO L273 TraceCheckUtils]: 78: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,967 INFO L273 TraceCheckUtils]: 79: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,967 INFO L273 TraceCheckUtils]: 80: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,967 INFO L273 TraceCheckUtils]: 81: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,968 INFO L273 TraceCheckUtils]: 82: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,968 INFO L273 TraceCheckUtils]: 83: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,968 INFO L273 TraceCheckUtils]: 84: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,968 INFO L273 TraceCheckUtils]: 85: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,968 INFO L273 TraceCheckUtils]: 86: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,968 INFO L273 TraceCheckUtils]: 87: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,969 INFO L273 TraceCheckUtils]: 88: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,969 INFO L273 TraceCheckUtils]: 89: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,969 INFO L273 TraceCheckUtils]: 90: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,969 INFO L273 TraceCheckUtils]: 91: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,969 INFO L273 TraceCheckUtils]: 92: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,969 INFO L273 TraceCheckUtils]: 93: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,970 INFO L273 TraceCheckUtils]: 94: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,970 INFO L273 TraceCheckUtils]: 95: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,970 INFO L273 TraceCheckUtils]: 96: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,970 INFO L273 TraceCheckUtils]: 97: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,970 INFO L273 TraceCheckUtils]: 98: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,971 INFO L273 TraceCheckUtils]: 99: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,971 INFO L273 TraceCheckUtils]: 100: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,971 INFO L273 TraceCheckUtils]: 101: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,971 INFO L273 TraceCheckUtils]: 102: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,971 INFO L273 TraceCheckUtils]: 103: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,971 INFO L273 TraceCheckUtils]: 104: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,971 INFO L273 TraceCheckUtils]: 105: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,971 INFO L273 TraceCheckUtils]: 106: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,971 INFO L273 TraceCheckUtils]: 107: Hoare triple {29967#true} assume !(~i~0 < 60); {29967#true} is VALID [2018-11-23 12:18:34,972 INFO L273 TraceCheckUtils]: 108: Hoare triple {29967#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {29967#true} is VALID [2018-11-23 12:18:34,972 INFO L273 TraceCheckUtils]: 109: Hoare triple {29967#true} assume true; {29967#true} is VALID [2018-11-23 12:18:34,972 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {29967#true} {29968#false} #75#return; {29968#false} is VALID [2018-11-23 12:18:34,972 INFO L273 TraceCheckUtils]: 111: Hoare triple {29968#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {29968#false} is VALID [2018-11-23 12:18:34,972 INFO L256 TraceCheckUtils]: 112: Hoare triple {29968#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {29967#true} is VALID [2018-11-23 12:18:34,972 INFO L273 TraceCheckUtils]: 113: Hoare triple {29967#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {29967#true} is VALID [2018-11-23 12:18:34,972 INFO L273 TraceCheckUtils]: 114: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,972 INFO L273 TraceCheckUtils]: 115: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,972 INFO L273 TraceCheckUtils]: 116: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,972 INFO L273 TraceCheckUtils]: 117: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,973 INFO L273 TraceCheckUtils]: 118: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,973 INFO L273 TraceCheckUtils]: 119: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,973 INFO L273 TraceCheckUtils]: 120: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,973 INFO L273 TraceCheckUtils]: 121: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,973 INFO L273 TraceCheckUtils]: 122: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,973 INFO L273 TraceCheckUtils]: 123: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,973 INFO L273 TraceCheckUtils]: 124: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,973 INFO L273 TraceCheckUtils]: 125: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,973 INFO L273 TraceCheckUtils]: 126: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,973 INFO L273 TraceCheckUtils]: 127: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,974 INFO L273 TraceCheckUtils]: 128: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,974 INFO L273 TraceCheckUtils]: 129: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,974 INFO L273 TraceCheckUtils]: 130: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,974 INFO L273 TraceCheckUtils]: 131: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,974 INFO L273 TraceCheckUtils]: 132: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,974 INFO L273 TraceCheckUtils]: 133: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,974 INFO L273 TraceCheckUtils]: 134: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,974 INFO L273 TraceCheckUtils]: 135: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,974 INFO L273 TraceCheckUtils]: 136: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,974 INFO L273 TraceCheckUtils]: 137: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,975 INFO L273 TraceCheckUtils]: 138: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,975 INFO L273 TraceCheckUtils]: 139: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,975 INFO L273 TraceCheckUtils]: 140: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,975 INFO L273 TraceCheckUtils]: 141: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,975 INFO L273 TraceCheckUtils]: 142: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,975 INFO L273 TraceCheckUtils]: 143: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,975 INFO L273 TraceCheckUtils]: 144: Hoare triple {29967#true} assume !(~i~0 < 60); {29967#true} is VALID [2018-11-23 12:18:34,975 INFO L273 TraceCheckUtils]: 145: Hoare triple {29967#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {29967#true} is VALID [2018-11-23 12:18:34,975 INFO L273 TraceCheckUtils]: 146: Hoare triple {29967#true} assume true; {29967#true} is VALID [2018-11-23 12:18:34,976 INFO L268 TraceCheckUtils]: 147: Hoare quadruple {29967#true} {29968#false} #77#return; {29968#false} is VALID [2018-11-23 12:18:34,976 INFO L273 TraceCheckUtils]: 148: Hoare triple {29968#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {29968#false} is VALID [2018-11-23 12:18:34,976 INFO L273 TraceCheckUtils]: 149: Hoare triple {29968#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {29968#false} is VALID [2018-11-23 12:18:34,976 INFO L273 TraceCheckUtils]: 150: Hoare triple {29968#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {29968#false} is VALID [2018-11-23 12:18:34,976 INFO L273 TraceCheckUtils]: 151: Hoare triple {29968#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {29968#false} is VALID [2018-11-23 12:18:34,976 INFO L273 TraceCheckUtils]: 152: Hoare triple {29968#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {29968#false} is VALID [2018-11-23 12:18:34,976 INFO L273 TraceCheckUtils]: 153: Hoare triple {29968#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {29968#false} is VALID [2018-11-23 12:18:34,976 INFO L273 TraceCheckUtils]: 154: Hoare triple {29968#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {29968#false} is VALID [2018-11-23 12:18:34,976 INFO L273 TraceCheckUtils]: 155: Hoare triple {29968#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {29968#false} is VALID [2018-11-23 12:18:34,976 INFO L273 TraceCheckUtils]: 156: Hoare triple {29968#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {29968#false} is VALID [2018-11-23 12:18:34,977 INFO L273 TraceCheckUtils]: 157: Hoare triple {29968#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {29968#false} is VALID [2018-11-23 12:18:34,977 INFO L273 TraceCheckUtils]: 158: Hoare triple {29968#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {29968#false} is VALID [2018-11-23 12:18:34,977 INFO L273 TraceCheckUtils]: 159: Hoare triple {29968#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {29968#false} is VALID [2018-11-23 12:18:34,977 INFO L273 TraceCheckUtils]: 160: Hoare triple {29968#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {29968#false} is VALID [2018-11-23 12:18:34,977 INFO L273 TraceCheckUtils]: 161: Hoare triple {29968#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {29968#false} is VALID [2018-11-23 12:18:34,977 INFO L273 TraceCheckUtils]: 162: Hoare triple {29968#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {29968#false} is VALID [2018-11-23 12:18:34,977 INFO L273 TraceCheckUtils]: 163: Hoare triple {29968#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {29968#false} is VALID [2018-11-23 12:18:34,977 INFO L273 TraceCheckUtils]: 164: Hoare triple {29968#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {29968#false} is VALID [2018-11-23 12:18:34,977 INFO L273 TraceCheckUtils]: 165: Hoare triple {29968#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {29968#false} is VALID [2018-11-23 12:18:34,977 INFO L273 TraceCheckUtils]: 166: Hoare triple {29968#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {29968#false} is VALID [2018-11-23 12:18:34,978 INFO L273 TraceCheckUtils]: 167: Hoare triple {29968#false} assume !(~i~2 < 59); {29968#false} is VALID [2018-11-23 12:18:34,978 INFO L273 TraceCheckUtils]: 168: Hoare triple {29968#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {29968#false} is VALID [2018-11-23 12:18:34,978 INFO L256 TraceCheckUtils]: 169: Hoare triple {29968#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {29967#true} is VALID [2018-11-23 12:18:34,978 INFO L273 TraceCheckUtils]: 170: Hoare triple {29967#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {29967#true} is VALID [2018-11-23 12:18:34,978 INFO L273 TraceCheckUtils]: 171: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,978 INFO L273 TraceCheckUtils]: 172: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,978 INFO L273 TraceCheckUtils]: 173: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,978 INFO L273 TraceCheckUtils]: 174: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,978 INFO L273 TraceCheckUtils]: 175: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,978 INFO L273 TraceCheckUtils]: 176: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,979 INFO L273 TraceCheckUtils]: 177: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,979 INFO L273 TraceCheckUtils]: 178: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,979 INFO L273 TraceCheckUtils]: 179: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,979 INFO L273 TraceCheckUtils]: 180: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,979 INFO L273 TraceCheckUtils]: 181: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,979 INFO L273 TraceCheckUtils]: 182: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,979 INFO L273 TraceCheckUtils]: 183: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,979 INFO L273 TraceCheckUtils]: 184: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,979 INFO L273 TraceCheckUtils]: 185: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,979 INFO L273 TraceCheckUtils]: 186: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,980 INFO L273 TraceCheckUtils]: 187: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,980 INFO L273 TraceCheckUtils]: 188: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,980 INFO L273 TraceCheckUtils]: 189: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,980 INFO L273 TraceCheckUtils]: 190: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,980 INFO L273 TraceCheckUtils]: 191: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,980 INFO L273 TraceCheckUtils]: 192: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,980 INFO L273 TraceCheckUtils]: 193: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,980 INFO L273 TraceCheckUtils]: 194: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,980 INFO L273 TraceCheckUtils]: 195: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,980 INFO L273 TraceCheckUtils]: 196: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,981 INFO L273 TraceCheckUtils]: 197: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,981 INFO L273 TraceCheckUtils]: 198: Hoare triple {29967#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29967#true} is VALID [2018-11-23 12:18:34,981 INFO L273 TraceCheckUtils]: 199: Hoare triple {29967#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29967#true} is VALID [2018-11-23 12:18:34,981 INFO L273 TraceCheckUtils]: 200: Hoare triple {29967#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29967#true} is VALID [2018-11-23 12:18:34,981 INFO L273 TraceCheckUtils]: 201: Hoare triple {29967#true} assume !(~i~0 < 60); {29967#true} is VALID [2018-11-23 12:18:34,981 INFO L273 TraceCheckUtils]: 202: Hoare triple {29967#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {29967#true} is VALID [2018-11-23 12:18:34,981 INFO L273 TraceCheckUtils]: 203: Hoare triple {29967#true} assume true; {29967#true} is VALID [2018-11-23 12:18:34,981 INFO L268 TraceCheckUtils]: 204: Hoare quadruple {29967#true} {29968#false} #79#return; {29968#false} is VALID [2018-11-23 12:18:34,981 INFO L273 TraceCheckUtils]: 205: Hoare triple {29968#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {29968#false} is VALID [2018-11-23 12:18:34,981 INFO L273 TraceCheckUtils]: 206: Hoare triple {29968#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {29968#false} is VALID [2018-11-23 12:18:34,982 INFO L273 TraceCheckUtils]: 207: Hoare triple {29968#false} assume !false; {29968#false} is VALID [2018-11-23 12:18:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1491 trivial. 0 not checked. [2018-11-23 12:18:35,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:18:35,000 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:18:35,009 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:18:35,122 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:18:35,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:18:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:18:35,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:18:35,681 INFO L256 TraceCheckUtils]: 0: Hoare triple {29967#true} call ULTIMATE.init(); {29967#true} is VALID [2018-11-23 12:18:35,682 INFO L273 TraceCheckUtils]: 1: Hoare triple {29967#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {29967#true} is VALID [2018-11-23 12:18:35,682 INFO L273 TraceCheckUtils]: 2: Hoare triple {29967#true} assume true; {29967#true} is VALID [2018-11-23 12:18:35,682 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29967#true} {29967#true} #71#return; {29967#true} is VALID [2018-11-23 12:18:35,682 INFO L256 TraceCheckUtils]: 4: Hoare triple {29967#true} call #t~ret14 := main(); {29967#true} is VALID [2018-11-23 12:18:35,683 INFO L273 TraceCheckUtils]: 5: Hoare triple {29967#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {30022#(<= main_~i~1 0)} is VALID [2018-11-23 12:18:35,683 INFO L273 TraceCheckUtils]: 6: Hoare triple {30022#(<= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {30022#(<= main_~i~1 0)} is VALID [2018-11-23 12:18:35,684 INFO L273 TraceCheckUtils]: 7: Hoare triple {30022#(<= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29970#(<= main_~i~1 1)} is VALID [2018-11-23 12:18:35,684 INFO L273 TraceCheckUtils]: 8: Hoare triple {29970#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29970#(<= main_~i~1 1)} is VALID [2018-11-23 12:18:35,685 INFO L273 TraceCheckUtils]: 9: Hoare triple {29970#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29971#(<= main_~i~1 2)} is VALID [2018-11-23 12:18:35,685 INFO L273 TraceCheckUtils]: 10: Hoare triple {29971#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29971#(<= main_~i~1 2)} is VALID [2018-11-23 12:18:35,686 INFO L273 TraceCheckUtils]: 11: Hoare triple {29971#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29972#(<= main_~i~1 3)} is VALID [2018-11-23 12:18:35,686 INFO L273 TraceCheckUtils]: 12: Hoare triple {29972#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29972#(<= main_~i~1 3)} is VALID [2018-11-23 12:18:35,687 INFO L273 TraceCheckUtils]: 13: Hoare triple {29972#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29973#(<= main_~i~1 4)} is VALID [2018-11-23 12:18:35,687 INFO L273 TraceCheckUtils]: 14: Hoare triple {29973#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29973#(<= main_~i~1 4)} is VALID [2018-11-23 12:18:35,688 INFO L273 TraceCheckUtils]: 15: Hoare triple {29973#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29974#(<= main_~i~1 5)} is VALID [2018-11-23 12:18:35,689 INFO L273 TraceCheckUtils]: 16: Hoare triple {29974#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29974#(<= main_~i~1 5)} is VALID [2018-11-23 12:18:35,689 INFO L273 TraceCheckUtils]: 17: Hoare triple {29974#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29975#(<= main_~i~1 6)} is VALID [2018-11-23 12:18:35,690 INFO L273 TraceCheckUtils]: 18: Hoare triple {29975#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29975#(<= main_~i~1 6)} is VALID [2018-11-23 12:18:35,690 INFO L273 TraceCheckUtils]: 19: Hoare triple {29975#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29976#(<= main_~i~1 7)} is VALID [2018-11-23 12:18:35,691 INFO L273 TraceCheckUtils]: 20: Hoare triple {29976#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29976#(<= main_~i~1 7)} is VALID [2018-11-23 12:18:35,692 INFO L273 TraceCheckUtils]: 21: Hoare triple {29976#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29977#(<= main_~i~1 8)} is VALID [2018-11-23 12:18:35,692 INFO L273 TraceCheckUtils]: 22: Hoare triple {29977#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29977#(<= main_~i~1 8)} is VALID [2018-11-23 12:18:35,693 INFO L273 TraceCheckUtils]: 23: Hoare triple {29977#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29978#(<= main_~i~1 9)} is VALID [2018-11-23 12:18:35,693 INFO L273 TraceCheckUtils]: 24: Hoare triple {29978#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29978#(<= main_~i~1 9)} is VALID [2018-11-23 12:18:35,694 INFO L273 TraceCheckUtils]: 25: Hoare triple {29978#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29979#(<= main_~i~1 10)} is VALID [2018-11-23 12:18:35,695 INFO L273 TraceCheckUtils]: 26: Hoare triple {29979#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29979#(<= main_~i~1 10)} is VALID [2018-11-23 12:18:35,695 INFO L273 TraceCheckUtils]: 27: Hoare triple {29979#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29980#(<= main_~i~1 11)} is VALID [2018-11-23 12:18:35,696 INFO L273 TraceCheckUtils]: 28: Hoare triple {29980#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29980#(<= main_~i~1 11)} is VALID [2018-11-23 12:18:35,697 INFO L273 TraceCheckUtils]: 29: Hoare triple {29980#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29981#(<= main_~i~1 12)} is VALID [2018-11-23 12:18:35,697 INFO L273 TraceCheckUtils]: 30: Hoare triple {29981#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29981#(<= main_~i~1 12)} is VALID [2018-11-23 12:18:35,698 INFO L273 TraceCheckUtils]: 31: Hoare triple {29981#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29982#(<= main_~i~1 13)} is VALID [2018-11-23 12:18:35,698 INFO L273 TraceCheckUtils]: 32: Hoare triple {29982#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29982#(<= main_~i~1 13)} is VALID [2018-11-23 12:18:35,699 INFO L273 TraceCheckUtils]: 33: Hoare triple {29982#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29983#(<= main_~i~1 14)} is VALID [2018-11-23 12:18:35,700 INFO L273 TraceCheckUtils]: 34: Hoare triple {29983#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29983#(<= main_~i~1 14)} is VALID [2018-11-23 12:18:35,700 INFO L273 TraceCheckUtils]: 35: Hoare triple {29983#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29984#(<= main_~i~1 15)} is VALID [2018-11-23 12:18:35,701 INFO L273 TraceCheckUtils]: 36: Hoare triple {29984#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29984#(<= main_~i~1 15)} is VALID [2018-11-23 12:18:35,702 INFO L273 TraceCheckUtils]: 37: Hoare triple {29984#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29985#(<= main_~i~1 16)} is VALID [2018-11-23 12:18:35,702 INFO L273 TraceCheckUtils]: 38: Hoare triple {29985#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29985#(<= main_~i~1 16)} is VALID [2018-11-23 12:18:35,703 INFO L273 TraceCheckUtils]: 39: Hoare triple {29985#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29986#(<= main_~i~1 17)} is VALID [2018-11-23 12:18:35,703 INFO L273 TraceCheckUtils]: 40: Hoare triple {29986#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29986#(<= main_~i~1 17)} is VALID [2018-11-23 12:18:35,704 INFO L273 TraceCheckUtils]: 41: Hoare triple {29986#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29987#(<= main_~i~1 18)} is VALID [2018-11-23 12:18:35,705 INFO L273 TraceCheckUtils]: 42: Hoare triple {29987#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29987#(<= main_~i~1 18)} is VALID [2018-11-23 12:18:35,705 INFO L273 TraceCheckUtils]: 43: Hoare triple {29987#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29988#(<= main_~i~1 19)} is VALID [2018-11-23 12:18:35,706 INFO L273 TraceCheckUtils]: 44: Hoare triple {29988#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29988#(<= main_~i~1 19)} is VALID [2018-11-23 12:18:35,706 INFO L273 TraceCheckUtils]: 45: Hoare triple {29988#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29989#(<= main_~i~1 20)} is VALID [2018-11-23 12:18:35,707 INFO L273 TraceCheckUtils]: 46: Hoare triple {29989#(<= main_~i~1 20)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29989#(<= main_~i~1 20)} is VALID [2018-11-23 12:18:35,708 INFO L273 TraceCheckUtils]: 47: Hoare triple {29989#(<= main_~i~1 20)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29990#(<= main_~i~1 21)} is VALID [2018-11-23 12:18:35,708 INFO L273 TraceCheckUtils]: 48: Hoare triple {29990#(<= main_~i~1 21)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29990#(<= main_~i~1 21)} is VALID [2018-11-23 12:18:35,709 INFO L273 TraceCheckUtils]: 49: Hoare triple {29990#(<= main_~i~1 21)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29991#(<= main_~i~1 22)} is VALID [2018-11-23 12:18:35,710 INFO L273 TraceCheckUtils]: 50: Hoare triple {29991#(<= main_~i~1 22)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29991#(<= main_~i~1 22)} is VALID [2018-11-23 12:18:35,710 INFO L273 TraceCheckUtils]: 51: Hoare triple {29991#(<= main_~i~1 22)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29992#(<= main_~i~1 23)} is VALID [2018-11-23 12:18:35,711 INFO L273 TraceCheckUtils]: 52: Hoare triple {29992#(<= main_~i~1 23)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29992#(<= main_~i~1 23)} is VALID [2018-11-23 12:18:35,711 INFO L273 TraceCheckUtils]: 53: Hoare triple {29992#(<= main_~i~1 23)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29993#(<= main_~i~1 24)} is VALID [2018-11-23 12:18:35,712 INFO L273 TraceCheckUtils]: 54: Hoare triple {29993#(<= main_~i~1 24)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29993#(<= main_~i~1 24)} is VALID [2018-11-23 12:18:35,713 INFO L273 TraceCheckUtils]: 55: Hoare triple {29993#(<= main_~i~1 24)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29994#(<= main_~i~1 25)} is VALID [2018-11-23 12:18:35,713 INFO L273 TraceCheckUtils]: 56: Hoare triple {29994#(<= main_~i~1 25)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29994#(<= main_~i~1 25)} is VALID [2018-11-23 12:18:35,714 INFO L273 TraceCheckUtils]: 57: Hoare triple {29994#(<= main_~i~1 25)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29995#(<= main_~i~1 26)} is VALID [2018-11-23 12:18:35,714 INFO L273 TraceCheckUtils]: 58: Hoare triple {29995#(<= main_~i~1 26)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29995#(<= main_~i~1 26)} is VALID [2018-11-23 12:18:35,715 INFO L273 TraceCheckUtils]: 59: Hoare triple {29995#(<= main_~i~1 26)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29996#(<= main_~i~1 27)} is VALID [2018-11-23 12:18:35,716 INFO L273 TraceCheckUtils]: 60: Hoare triple {29996#(<= main_~i~1 27)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29996#(<= main_~i~1 27)} is VALID [2018-11-23 12:18:35,716 INFO L273 TraceCheckUtils]: 61: Hoare triple {29996#(<= main_~i~1 27)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29997#(<= main_~i~1 28)} is VALID [2018-11-23 12:18:35,717 INFO L273 TraceCheckUtils]: 62: Hoare triple {29997#(<= main_~i~1 28)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29997#(<= main_~i~1 28)} is VALID [2018-11-23 12:18:35,718 INFO L273 TraceCheckUtils]: 63: Hoare triple {29997#(<= main_~i~1 28)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29998#(<= main_~i~1 29)} is VALID [2018-11-23 12:18:35,718 INFO L273 TraceCheckUtils]: 64: Hoare triple {29998#(<= main_~i~1 29)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29998#(<= main_~i~1 29)} is VALID [2018-11-23 12:18:35,719 INFO L273 TraceCheckUtils]: 65: Hoare triple {29998#(<= main_~i~1 29)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29999#(<= main_~i~1 30)} is VALID [2018-11-23 12:18:35,719 INFO L273 TraceCheckUtils]: 66: Hoare triple {29999#(<= main_~i~1 30)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {29999#(<= main_~i~1 30)} is VALID [2018-11-23 12:18:35,720 INFO L273 TraceCheckUtils]: 67: Hoare triple {29999#(<= main_~i~1 30)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30000#(<= main_~i~1 31)} is VALID [2018-11-23 12:18:35,721 INFO L273 TraceCheckUtils]: 68: Hoare triple {30000#(<= main_~i~1 31)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {30000#(<= main_~i~1 31)} is VALID [2018-11-23 12:18:35,721 INFO L273 TraceCheckUtils]: 69: Hoare triple {30000#(<= main_~i~1 31)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30001#(<= main_~i~1 32)} is VALID [2018-11-23 12:18:35,722 INFO L273 TraceCheckUtils]: 70: Hoare triple {30001#(<= main_~i~1 32)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {30001#(<= main_~i~1 32)} is VALID [2018-11-23 12:18:35,723 INFO L273 TraceCheckUtils]: 71: Hoare triple {30001#(<= main_~i~1 32)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30002#(<= main_~i~1 33)} is VALID [2018-11-23 12:18:35,723 INFO L273 TraceCheckUtils]: 72: Hoare triple {30002#(<= main_~i~1 33)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {30002#(<= main_~i~1 33)} is VALID [2018-11-23 12:18:35,724 INFO L273 TraceCheckUtils]: 73: Hoare triple {30002#(<= main_~i~1 33)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30003#(<= main_~i~1 34)} is VALID [2018-11-23 12:18:35,724 INFO L273 TraceCheckUtils]: 74: Hoare triple {30003#(<= main_~i~1 34)} assume !(~i~1 < 60); {29968#false} is VALID [2018-11-23 12:18:35,725 INFO L256 TraceCheckUtils]: 75: Hoare triple {29968#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {29968#false} is VALID [2018-11-23 12:18:35,725 INFO L273 TraceCheckUtils]: 76: Hoare triple {29968#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {29968#false} is VALID [2018-11-23 12:18:35,725 INFO L273 TraceCheckUtils]: 77: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,725 INFO L273 TraceCheckUtils]: 78: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,725 INFO L273 TraceCheckUtils]: 79: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,726 INFO L273 TraceCheckUtils]: 80: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,726 INFO L273 TraceCheckUtils]: 81: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,726 INFO L273 TraceCheckUtils]: 82: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,726 INFO L273 TraceCheckUtils]: 83: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,726 INFO L273 TraceCheckUtils]: 84: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,726 INFO L273 TraceCheckUtils]: 85: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,727 INFO L273 TraceCheckUtils]: 86: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,727 INFO L273 TraceCheckUtils]: 87: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,727 INFO L273 TraceCheckUtils]: 88: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,727 INFO L273 TraceCheckUtils]: 89: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,727 INFO L273 TraceCheckUtils]: 90: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,727 INFO L273 TraceCheckUtils]: 91: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,728 INFO L273 TraceCheckUtils]: 92: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,728 INFO L273 TraceCheckUtils]: 93: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,728 INFO L273 TraceCheckUtils]: 94: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,728 INFO L273 TraceCheckUtils]: 95: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,728 INFO L273 TraceCheckUtils]: 96: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,728 INFO L273 TraceCheckUtils]: 97: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,728 INFO L273 TraceCheckUtils]: 98: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,728 INFO L273 TraceCheckUtils]: 99: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,728 INFO L273 TraceCheckUtils]: 100: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,728 INFO L273 TraceCheckUtils]: 101: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,729 INFO L273 TraceCheckUtils]: 102: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,729 INFO L273 TraceCheckUtils]: 103: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,729 INFO L273 TraceCheckUtils]: 104: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,729 INFO L273 TraceCheckUtils]: 105: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,729 INFO L273 TraceCheckUtils]: 106: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,729 INFO L273 TraceCheckUtils]: 107: Hoare triple {29968#false} assume !(~i~0 < 60); {29968#false} is VALID [2018-11-23 12:18:35,729 INFO L273 TraceCheckUtils]: 108: Hoare triple {29968#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {29968#false} is VALID [2018-11-23 12:18:35,729 INFO L273 TraceCheckUtils]: 109: Hoare triple {29968#false} assume true; {29968#false} is VALID [2018-11-23 12:18:35,729 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {29968#false} {29968#false} #75#return; {29968#false} is VALID [2018-11-23 12:18:35,729 INFO L273 TraceCheckUtils]: 111: Hoare triple {29968#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {29968#false} is VALID [2018-11-23 12:18:35,730 INFO L256 TraceCheckUtils]: 112: Hoare triple {29968#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {29968#false} is VALID [2018-11-23 12:18:35,730 INFO L273 TraceCheckUtils]: 113: Hoare triple {29968#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {29968#false} is VALID [2018-11-23 12:18:35,730 INFO L273 TraceCheckUtils]: 114: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,730 INFO L273 TraceCheckUtils]: 115: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,730 INFO L273 TraceCheckUtils]: 116: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,730 INFO L273 TraceCheckUtils]: 117: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,730 INFO L273 TraceCheckUtils]: 118: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,730 INFO L273 TraceCheckUtils]: 119: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,730 INFO L273 TraceCheckUtils]: 120: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,730 INFO L273 TraceCheckUtils]: 121: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,731 INFO L273 TraceCheckUtils]: 122: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,731 INFO L273 TraceCheckUtils]: 123: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,731 INFO L273 TraceCheckUtils]: 124: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,731 INFO L273 TraceCheckUtils]: 125: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,731 INFO L273 TraceCheckUtils]: 126: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,731 INFO L273 TraceCheckUtils]: 127: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,731 INFO L273 TraceCheckUtils]: 128: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,731 INFO L273 TraceCheckUtils]: 129: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,731 INFO L273 TraceCheckUtils]: 130: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,731 INFO L273 TraceCheckUtils]: 131: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,732 INFO L273 TraceCheckUtils]: 132: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,732 INFO L273 TraceCheckUtils]: 133: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,732 INFO L273 TraceCheckUtils]: 134: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,732 INFO L273 TraceCheckUtils]: 135: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,732 INFO L273 TraceCheckUtils]: 136: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,732 INFO L273 TraceCheckUtils]: 137: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,732 INFO L273 TraceCheckUtils]: 138: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,732 INFO L273 TraceCheckUtils]: 139: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,732 INFO L273 TraceCheckUtils]: 140: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,732 INFO L273 TraceCheckUtils]: 141: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,733 INFO L273 TraceCheckUtils]: 142: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,733 INFO L273 TraceCheckUtils]: 143: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,733 INFO L273 TraceCheckUtils]: 144: Hoare triple {29968#false} assume !(~i~0 < 60); {29968#false} is VALID [2018-11-23 12:18:35,733 INFO L273 TraceCheckUtils]: 145: Hoare triple {29968#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {29968#false} is VALID [2018-11-23 12:18:35,733 INFO L273 TraceCheckUtils]: 146: Hoare triple {29968#false} assume true; {29968#false} is VALID [2018-11-23 12:18:35,733 INFO L268 TraceCheckUtils]: 147: Hoare quadruple {29968#false} {29968#false} #77#return; {29968#false} is VALID [2018-11-23 12:18:35,733 INFO L273 TraceCheckUtils]: 148: Hoare triple {29968#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {29968#false} is VALID [2018-11-23 12:18:35,733 INFO L273 TraceCheckUtils]: 149: Hoare triple {29968#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {29968#false} is VALID [2018-11-23 12:18:35,733 INFO L273 TraceCheckUtils]: 150: Hoare triple {29968#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {29968#false} is VALID [2018-11-23 12:18:35,734 INFO L273 TraceCheckUtils]: 151: Hoare triple {29968#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {29968#false} is VALID [2018-11-23 12:18:35,734 INFO L273 TraceCheckUtils]: 152: Hoare triple {29968#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {29968#false} is VALID [2018-11-23 12:18:35,734 INFO L273 TraceCheckUtils]: 153: Hoare triple {29968#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {29968#false} is VALID [2018-11-23 12:18:35,734 INFO L273 TraceCheckUtils]: 154: Hoare triple {29968#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {29968#false} is VALID [2018-11-23 12:18:35,734 INFO L273 TraceCheckUtils]: 155: Hoare triple {29968#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {29968#false} is VALID [2018-11-23 12:18:35,734 INFO L273 TraceCheckUtils]: 156: Hoare triple {29968#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {29968#false} is VALID [2018-11-23 12:18:35,734 INFO L273 TraceCheckUtils]: 157: Hoare triple {29968#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {29968#false} is VALID [2018-11-23 12:18:35,734 INFO L273 TraceCheckUtils]: 158: Hoare triple {29968#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {29968#false} is VALID [2018-11-23 12:18:35,734 INFO L273 TraceCheckUtils]: 159: Hoare triple {29968#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {29968#false} is VALID [2018-11-23 12:18:35,734 INFO L273 TraceCheckUtils]: 160: Hoare triple {29968#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {29968#false} is VALID [2018-11-23 12:18:35,735 INFO L273 TraceCheckUtils]: 161: Hoare triple {29968#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {29968#false} is VALID [2018-11-23 12:18:35,735 INFO L273 TraceCheckUtils]: 162: Hoare triple {29968#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {29968#false} is VALID [2018-11-23 12:18:35,735 INFO L273 TraceCheckUtils]: 163: Hoare triple {29968#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {29968#false} is VALID [2018-11-23 12:18:35,735 INFO L273 TraceCheckUtils]: 164: Hoare triple {29968#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {29968#false} is VALID [2018-11-23 12:18:35,735 INFO L273 TraceCheckUtils]: 165: Hoare triple {29968#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {29968#false} is VALID [2018-11-23 12:18:35,735 INFO L273 TraceCheckUtils]: 166: Hoare triple {29968#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {29968#false} is VALID [2018-11-23 12:18:35,735 INFO L273 TraceCheckUtils]: 167: Hoare triple {29968#false} assume !(~i~2 < 59); {29968#false} is VALID [2018-11-23 12:18:35,735 INFO L273 TraceCheckUtils]: 168: Hoare triple {29968#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {29968#false} is VALID [2018-11-23 12:18:35,735 INFO L256 TraceCheckUtils]: 169: Hoare triple {29968#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {29968#false} is VALID [2018-11-23 12:18:35,735 INFO L273 TraceCheckUtils]: 170: Hoare triple {29968#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {29968#false} is VALID [2018-11-23 12:18:35,736 INFO L273 TraceCheckUtils]: 171: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,736 INFO L273 TraceCheckUtils]: 172: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,736 INFO L273 TraceCheckUtils]: 173: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,736 INFO L273 TraceCheckUtils]: 174: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,736 INFO L273 TraceCheckUtils]: 175: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,736 INFO L273 TraceCheckUtils]: 176: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,736 INFO L273 TraceCheckUtils]: 177: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,736 INFO L273 TraceCheckUtils]: 178: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,736 INFO L273 TraceCheckUtils]: 179: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,736 INFO L273 TraceCheckUtils]: 180: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,737 INFO L273 TraceCheckUtils]: 181: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,737 INFO L273 TraceCheckUtils]: 182: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,737 INFO L273 TraceCheckUtils]: 183: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,737 INFO L273 TraceCheckUtils]: 184: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,737 INFO L273 TraceCheckUtils]: 185: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,737 INFO L273 TraceCheckUtils]: 186: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,737 INFO L273 TraceCheckUtils]: 187: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,737 INFO L273 TraceCheckUtils]: 188: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,737 INFO L273 TraceCheckUtils]: 189: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,737 INFO L273 TraceCheckUtils]: 190: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,738 INFO L273 TraceCheckUtils]: 191: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,738 INFO L273 TraceCheckUtils]: 192: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,738 INFO L273 TraceCheckUtils]: 193: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,738 INFO L273 TraceCheckUtils]: 194: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,738 INFO L273 TraceCheckUtils]: 195: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,738 INFO L273 TraceCheckUtils]: 196: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,738 INFO L273 TraceCheckUtils]: 197: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,738 INFO L273 TraceCheckUtils]: 198: Hoare triple {29968#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {29968#false} is VALID [2018-11-23 12:18:35,738 INFO L273 TraceCheckUtils]: 199: Hoare triple {29968#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {29968#false} is VALID [2018-11-23 12:18:35,738 INFO L273 TraceCheckUtils]: 200: Hoare triple {29968#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {29968#false} is VALID [2018-11-23 12:18:35,739 INFO L273 TraceCheckUtils]: 201: Hoare triple {29968#false} assume !(~i~0 < 60); {29968#false} is VALID [2018-11-23 12:18:35,739 INFO L273 TraceCheckUtils]: 202: Hoare triple {29968#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {29968#false} is VALID [2018-11-23 12:18:35,739 INFO L273 TraceCheckUtils]: 203: Hoare triple {29968#false} assume true; {29968#false} is VALID [2018-11-23 12:18:35,739 INFO L268 TraceCheckUtils]: 204: Hoare quadruple {29968#false} {29968#false} #79#return; {29968#false} is VALID [2018-11-23 12:18:35,739 INFO L273 TraceCheckUtils]: 205: Hoare triple {29968#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {29968#false} is VALID [2018-11-23 12:18:35,739 INFO L273 TraceCheckUtils]: 206: Hoare triple {29968#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {29968#false} is VALID [2018-11-23 12:18:35,739 INFO L273 TraceCheckUtils]: 207: Hoare triple {29968#false} assume !false; {29968#false} is VALID [2018-11-23 12:18:35,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1491 trivial. 0 not checked. [2018-11-23 12:18:35,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:18:35,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-11-23 12:18:35,779 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 208 [2018-11-23 12:18:35,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:18:35,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 12:18:35,891 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:18:35,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 12:18:35,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 12:18:35,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:18:35,893 INFO L87 Difference]: Start difference. First operand 139 states and 153 transitions. Second operand 38 states. [2018-11-23 12:18:36,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:36,940 INFO L93 Difference]: Finished difference Result 206 states and 234 transitions. [2018-11-23 12:18:36,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 12:18:36,940 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 208 [2018-11-23 12:18:36,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:18:36,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:18:36,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 126 transitions. [2018-11-23 12:18:36,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:18:36,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 126 transitions. [2018-11-23 12:18:36,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 126 transitions. [2018-11-23 12:18:37,110 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-23 12:18:37,114 INFO L225 Difference]: With dead ends: 206 [2018-11-23 12:18:37,114 INFO L226 Difference]: Without dead ends: 142 [2018-11-23 12:18:37,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:18:37,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-23 12:18:37,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-11-23 12:18:37,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:18:37,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 141 states. [2018-11-23 12:18:37,169 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 141 states. [2018-11-23 12:18:37,169 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 141 states. [2018-11-23 12:18:37,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:37,171 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2018-11-23 12:18:37,171 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 156 transitions. [2018-11-23 12:18:37,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:18:37,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:18:37,172 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 142 states. [2018-11-23 12:18:37,172 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 142 states. [2018-11-23 12:18:37,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:37,174 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2018-11-23 12:18:37,174 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 156 transitions. [2018-11-23 12:18:37,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:18:37,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:18:37,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:18:37,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:18:37,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-23 12:18:37,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 155 transitions. [2018-11-23 12:18:37,178 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 155 transitions. Word has length 208 [2018-11-23 12:18:37,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:18:37,178 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 155 transitions. [2018-11-23 12:18:37,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 12:18:37,178 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2018-11-23 12:18:37,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-23 12:18:37,179 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:18:37,180 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 30, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:18:37,180 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:18:37,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:18:37,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1243788394, now seen corresponding path program 35 times [2018-11-23 12:18:37,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:18:37,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:18:37,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:37,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:18:37,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:18:38,010 INFO L256 TraceCheckUtils]: 0: Hoare triple {31414#true} call ULTIMATE.init(); {31414#true} is VALID [2018-11-23 12:18:38,010 INFO L273 TraceCheckUtils]: 1: Hoare triple {31414#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31414#true} is VALID [2018-11-23 12:18:38,011 INFO L273 TraceCheckUtils]: 2: Hoare triple {31414#true} assume true; {31414#true} is VALID [2018-11-23 12:18:38,011 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31414#true} {31414#true} #71#return; {31414#true} is VALID [2018-11-23 12:18:38,011 INFO L256 TraceCheckUtils]: 4: Hoare triple {31414#true} call #t~ret14 := main(); {31414#true} is VALID [2018-11-23 12:18:38,011 INFO L273 TraceCheckUtils]: 5: Hoare triple {31414#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {31416#(= main_~i~1 0)} is VALID [2018-11-23 12:18:38,012 INFO L273 TraceCheckUtils]: 6: Hoare triple {31416#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31416#(= main_~i~1 0)} is VALID [2018-11-23 12:18:38,013 INFO L273 TraceCheckUtils]: 7: Hoare triple {31416#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31417#(<= main_~i~1 1)} is VALID [2018-11-23 12:18:38,013 INFO L273 TraceCheckUtils]: 8: Hoare triple {31417#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31417#(<= main_~i~1 1)} is VALID [2018-11-23 12:18:38,013 INFO L273 TraceCheckUtils]: 9: Hoare triple {31417#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31418#(<= main_~i~1 2)} is VALID [2018-11-23 12:18:38,014 INFO L273 TraceCheckUtils]: 10: Hoare triple {31418#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31418#(<= main_~i~1 2)} is VALID [2018-11-23 12:18:38,014 INFO L273 TraceCheckUtils]: 11: Hoare triple {31418#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31419#(<= main_~i~1 3)} is VALID [2018-11-23 12:18:38,014 INFO L273 TraceCheckUtils]: 12: Hoare triple {31419#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31419#(<= main_~i~1 3)} is VALID [2018-11-23 12:18:38,015 INFO L273 TraceCheckUtils]: 13: Hoare triple {31419#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31420#(<= main_~i~1 4)} is VALID [2018-11-23 12:18:38,016 INFO L273 TraceCheckUtils]: 14: Hoare triple {31420#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31420#(<= main_~i~1 4)} is VALID [2018-11-23 12:18:38,016 INFO L273 TraceCheckUtils]: 15: Hoare triple {31420#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31421#(<= main_~i~1 5)} is VALID [2018-11-23 12:18:38,017 INFO L273 TraceCheckUtils]: 16: Hoare triple {31421#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31421#(<= main_~i~1 5)} is VALID [2018-11-23 12:18:38,018 INFO L273 TraceCheckUtils]: 17: Hoare triple {31421#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31422#(<= main_~i~1 6)} is VALID [2018-11-23 12:18:38,018 INFO L273 TraceCheckUtils]: 18: Hoare triple {31422#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31422#(<= main_~i~1 6)} is VALID [2018-11-23 12:18:38,019 INFO L273 TraceCheckUtils]: 19: Hoare triple {31422#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31423#(<= main_~i~1 7)} is VALID [2018-11-23 12:18:38,019 INFO L273 TraceCheckUtils]: 20: Hoare triple {31423#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31423#(<= main_~i~1 7)} is VALID [2018-11-23 12:18:38,020 INFO L273 TraceCheckUtils]: 21: Hoare triple {31423#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31424#(<= main_~i~1 8)} is VALID [2018-11-23 12:18:38,021 INFO L273 TraceCheckUtils]: 22: Hoare triple {31424#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31424#(<= main_~i~1 8)} is VALID [2018-11-23 12:18:38,021 INFO L273 TraceCheckUtils]: 23: Hoare triple {31424#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31425#(<= main_~i~1 9)} is VALID [2018-11-23 12:18:38,022 INFO L273 TraceCheckUtils]: 24: Hoare triple {31425#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31425#(<= main_~i~1 9)} is VALID [2018-11-23 12:18:38,023 INFO L273 TraceCheckUtils]: 25: Hoare triple {31425#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31426#(<= main_~i~1 10)} is VALID [2018-11-23 12:18:38,023 INFO L273 TraceCheckUtils]: 26: Hoare triple {31426#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31426#(<= main_~i~1 10)} is VALID [2018-11-23 12:18:38,024 INFO L273 TraceCheckUtils]: 27: Hoare triple {31426#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31427#(<= main_~i~1 11)} is VALID [2018-11-23 12:18:38,024 INFO L273 TraceCheckUtils]: 28: Hoare triple {31427#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31427#(<= main_~i~1 11)} is VALID [2018-11-23 12:18:38,025 INFO L273 TraceCheckUtils]: 29: Hoare triple {31427#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31428#(<= main_~i~1 12)} is VALID [2018-11-23 12:18:38,026 INFO L273 TraceCheckUtils]: 30: Hoare triple {31428#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31428#(<= main_~i~1 12)} is VALID [2018-11-23 12:18:38,026 INFO L273 TraceCheckUtils]: 31: Hoare triple {31428#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31429#(<= main_~i~1 13)} is VALID [2018-11-23 12:18:38,027 INFO L273 TraceCheckUtils]: 32: Hoare triple {31429#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31429#(<= main_~i~1 13)} is VALID [2018-11-23 12:18:38,027 INFO L273 TraceCheckUtils]: 33: Hoare triple {31429#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31430#(<= main_~i~1 14)} is VALID [2018-11-23 12:18:38,028 INFO L273 TraceCheckUtils]: 34: Hoare triple {31430#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31430#(<= main_~i~1 14)} is VALID [2018-11-23 12:18:38,029 INFO L273 TraceCheckUtils]: 35: Hoare triple {31430#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31431#(<= main_~i~1 15)} is VALID [2018-11-23 12:18:38,029 INFO L273 TraceCheckUtils]: 36: Hoare triple {31431#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31431#(<= main_~i~1 15)} is VALID [2018-11-23 12:18:38,030 INFO L273 TraceCheckUtils]: 37: Hoare triple {31431#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31432#(<= main_~i~1 16)} is VALID [2018-11-23 12:18:38,030 INFO L273 TraceCheckUtils]: 38: Hoare triple {31432#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31432#(<= main_~i~1 16)} is VALID [2018-11-23 12:18:38,031 INFO L273 TraceCheckUtils]: 39: Hoare triple {31432#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31433#(<= main_~i~1 17)} is VALID [2018-11-23 12:18:38,032 INFO L273 TraceCheckUtils]: 40: Hoare triple {31433#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31433#(<= main_~i~1 17)} is VALID [2018-11-23 12:18:38,032 INFO L273 TraceCheckUtils]: 41: Hoare triple {31433#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31434#(<= main_~i~1 18)} is VALID [2018-11-23 12:18:38,033 INFO L273 TraceCheckUtils]: 42: Hoare triple {31434#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31434#(<= main_~i~1 18)} is VALID [2018-11-23 12:18:38,034 INFO L273 TraceCheckUtils]: 43: Hoare triple {31434#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31435#(<= main_~i~1 19)} is VALID [2018-11-23 12:18:38,034 INFO L273 TraceCheckUtils]: 44: Hoare triple {31435#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31435#(<= main_~i~1 19)} is VALID [2018-11-23 12:18:38,035 INFO L273 TraceCheckUtils]: 45: Hoare triple {31435#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31436#(<= main_~i~1 20)} is VALID [2018-11-23 12:18:38,035 INFO L273 TraceCheckUtils]: 46: Hoare triple {31436#(<= main_~i~1 20)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31436#(<= main_~i~1 20)} is VALID [2018-11-23 12:18:38,036 INFO L273 TraceCheckUtils]: 47: Hoare triple {31436#(<= main_~i~1 20)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31437#(<= main_~i~1 21)} is VALID [2018-11-23 12:18:38,037 INFO L273 TraceCheckUtils]: 48: Hoare triple {31437#(<= main_~i~1 21)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31437#(<= main_~i~1 21)} is VALID [2018-11-23 12:18:38,037 INFO L273 TraceCheckUtils]: 49: Hoare triple {31437#(<= main_~i~1 21)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31438#(<= main_~i~1 22)} is VALID [2018-11-23 12:18:38,038 INFO L273 TraceCheckUtils]: 50: Hoare triple {31438#(<= main_~i~1 22)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31438#(<= main_~i~1 22)} is VALID [2018-11-23 12:18:38,039 INFO L273 TraceCheckUtils]: 51: Hoare triple {31438#(<= main_~i~1 22)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31439#(<= main_~i~1 23)} is VALID [2018-11-23 12:18:38,039 INFO L273 TraceCheckUtils]: 52: Hoare triple {31439#(<= main_~i~1 23)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31439#(<= main_~i~1 23)} is VALID [2018-11-23 12:18:38,040 INFO L273 TraceCheckUtils]: 53: Hoare triple {31439#(<= main_~i~1 23)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31440#(<= main_~i~1 24)} is VALID [2018-11-23 12:18:38,040 INFO L273 TraceCheckUtils]: 54: Hoare triple {31440#(<= main_~i~1 24)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31440#(<= main_~i~1 24)} is VALID [2018-11-23 12:18:38,041 INFO L273 TraceCheckUtils]: 55: Hoare triple {31440#(<= main_~i~1 24)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31441#(<= main_~i~1 25)} is VALID [2018-11-23 12:18:38,042 INFO L273 TraceCheckUtils]: 56: Hoare triple {31441#(<= main_~i~1 25)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31441#(<= main_~i~1 25)} is VALID [2018-11-23 12:18:38,042 INFO L273 TraceCheckUtils]: 57: Hoare triple {31441#(<= main_~i~1 25)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31442#(<= main_~i~1 26)} is VALID [2018-11-23 12:18:38,043 INFO L273 TraceCheckUtils]: 58: Hoare triple {31442#(<= main_~i~1 26)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31442#(<= main_~i~1 26)} is VALID [2018-11-23 12:18:38,044 INFO L273 TraceCheckUtils]: 59: Hoare triple {31442#(<= main_~i~1 26)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31443#(<= main_~i~1 27)} is VALID [2018-11-23 12:18:38,044 INFO L273 TraceCheckUtils]: 60: Hoare triple {31443#(<= main_~i~1 27)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31443#(<= main_~i~1 27)} is VALID [2018-11-23 12:18:38,045 INFO L273 TraceCheckUtils]: 61: Hoare triple {31443#(<= main_~i~1 27)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31444#(<= main_~i~1 28)} is VALID [2018-11-23 12:18:38,045 INFO L273 TraceCheckUtils]: 62: Hoare triple {31444#(<= main_~i~1 28)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31444#(<= main_~i~1 28)} is VALID [2018-11-23 12:18:38,046 INFO L273 TraceCheckUtils]: 63: Hoare triple {31444#(<= main_~i~1 28)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31445#(<= main_~i~1 29)} is VALID [2018-11-23 12:18:38,047 INFO L273 TraceCheckUtils]: 64: Hoare triple {31445#(<= main_~i~1 29)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31445#(<= main_~i~1 29)} is VALID [2018-11-23 12:18:38,047 INFO L273 TraceCheckUtils]: 65: Hoare triple {31445#(<= main_~i~1 29)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31446#(<= main_~i~1 30)} is VALID [2018-11-23 12:18:38,048 INFO L273 TraceCheckUtils]: 66: Hoare triple {31446#(<= main_~i~1 30)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31446#(<= main_~i~1 30)} is VALID [2018-11-23 12:18:38,049 INFO L273 TraceCheckUtils]: 67: Hoare triple {31446#(<= main_~i~1 30)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31447#(<= main_~i~1 31)} is VALID [2018-11-23 12:18:38,049 INFO L273 TraceCheckUtils]: 68: Hoare triple {31447#(<= main_~i~1 31)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31447#(<= main_~i~1 31)} is VALID [2018-11-23 12:18:38,050 INFO L273 TraceCheckUtils]: 69: Hoare triple {31447#(<= main_~i~1 31)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31448#(<= main_~i~1 32)} is VALID [2018-11-23 12:18:38,050 INFO L273 TraceCheckUtils]: 70: Hoare triple {31448#(<= main_~i~1 32)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31448#(<= main_~i~1 32)} is VALID [2018-11-23 12:18:38,051 INFO L273 TraceCheckUtils]: 71: Hoare triple {31448#(<= main_~i~1 32)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31449#(<= main_~i~1 33)} is VALID [2018-11-23 12:18:38,052 INFO L273 TraceCheckUtils]: 72: Hoare triple {31449#(<= main_~i~1 33)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31449#(<= main_~i~1 33)} is VALID [2018-11-23 12:18:38,052 INFO L273 TraceCheckUtils]: 73: Hoare triple {31449#(<= main_~i~1 33)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31450#(<= main_~i~1 34)} is VALID [2018-11-23 12:18:38,053 INFO L273 TraceCheckUtils]: 74: Hoare triple {31450#(<= main_~i~1 34)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31450#(<= main_~i~1 34)} is VALID [2018-11-23 12:18:38,054 INFO L273 TraceCheckUtils]: 75: Hoare triple {31450#(<= main_~i~1 34)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31451#(<= main_~i~1 35)} is VALID [2018-11-23 12:18:38,054 INFO L273 TraceCheckUtils]: 76: Hoare triple {31451#(<= main_~i~1 35)} assume !(~i~1 < 60); {31415#false} is VALID [2018-11-23 12:18:38,054 INFO L256 TraceCheckUtils]: 77: Hoare triple {31415#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {31414#true} is VALID [2018-11-23 12:18:38,055 INFO L273 TraceCheckUtils]: 78: Hoare triple {31414#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {31414#true} is VALID [2018-11-23 12:18:38,055 INFO L273 TraceCheckUtils]: 79: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,055 INFO L273 TraceCheckUtils]: 80: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,055 INFO L273 TraceCheckUtils]: 81: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,055 INFO L273 TraceCheckUtils]: 82: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,055 INFO L273 TraceCheckUtils]: 83: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,056 INFO L273 TraceCheckUtils]: 84: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,056 INFO L273 TraceCheckUtils]: 85: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,056 INFO L273 TraceCheckUtils]: 86: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,056 INFO L273 TraceCheckUtils]: 87: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,056 INFO L273 TraceCheckUtils]: 88: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,057 INFO L273 TraceCheckUtils]: 89: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,057 INFO L273 TraceCheckUtils]: 90: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,057 INFO L273 TraceCheckUtils]: 91: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,057 INFO L273 TraceCheckUtils]: 92: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,057 INFO L273 TraceCheckUtils]: 93: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,057 INFO L273 TraceCheckUtils]: 94: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,058 INFO L273 TraceCheckUtils]: 95: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,058 INFO L273 TraceCheckUtils]: 96: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,058 INFO L273 TraceCheckUtils]: 97: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,058 INFO L273 TraceCheckUtils]: 98: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,058 INFO L273 TraceCheckUtils]: 99: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,058 INFO L273 TraceCheckUtils]: 100: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,058 INFO L273 TraceCheckUtils]: 101: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,058 INFO L273 TraceCheckUtils]: 102: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,058 INFO L273 TraceCheckUtils]: 103: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,059 INFO L273 TraceCheckUtils]: 104: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,059 INFO L273 TraceCheckUtils]: 105: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,059 INFO L273 TraceCheckUtils]: 106: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,059 INFO L273 TraceCheckUtils]: 107: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,059 INFO L273 TraceCheckUtils]: 108: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,059 INFO L273 TraceCheckUtils]: 109: Hoare triple {31414#true} assume !(~i~0 < 60); {31414#true} is VALID [2018-11-23 12:18:38,059 INFO L273 TraceCheckUtils]: 110: Hoare triple {31414#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {31414#true} is VALID [2018-11-23 12:18:38,059 INFO L273 TraceCheckUtils]: 111: Hoare triple {31414#true} assume true; {31414#true} is VALID [2018-11-23 12:18:38,059 INFO L268 TraceCheckUtils]: 112: Hoare quadruple {31414#true} {31415#false} #75#return; {31415#false} is VALID [2018-11-23 12:18:38,059 INFO L273 TraceCheckUtils]: 113: Hoare triple {31415#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {31415#false} is VALID [2018-11-23 12:18:38,060 INFO L256 TraceCheckUtils]: 114: Hoare triple {31415#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {31414#true} is VALID [2018-11-23 12:18:38,060 INFO L273 TraceCheckUtils]: 115: Hoare triple {31414#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {31414#true} is VALID [2018-11-23 12:18:38,060 INFO L273 TraceCheckUtils]: 116: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,060 INFO L273 TraceCheckUtils]: 117: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,060 INFO L273 TraceCheckUtils]: 118: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,060 INFO L273 TraceCheckUtils]: 119: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,060 INFO L273 TraceCheckUtils]: 120: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,060 INFO L273 TraceCheckUtils]: 121: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,060 INFO L273 TraceCheckUtils]: 122: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,060 INFO L273 TraceCheckUtils]: 123: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,061 INFO L273 TraceCheckUtils]: 124: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,061 INFO L273 TraceCheckUtils]: 125: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,061 INFO L273 TraceCheckUtils]: 126: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,061 INFO L273 TraceCheckUtils]: 127: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,061 INFO L273 TraceCheckUtils]: 128: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,061 INFO L273 TraceCheckUtils]: 129: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,061 INFO L273 TraceCheckUtils]: 130: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,061 INFO L273 TraceCheckUtils]: 131: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,061 INFO L273 TraceCheckUtils]: 132: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,062 INFO L273 TraceCheckUtils]: 133: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,062 INFO L273 TraceCheckUtils]: 134: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,062 INFO L273 TraceCheckUtils]: 135: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,062 INFO L273 TraceCheckUtils]: 136: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,062 INFO L273 TraceCheckUtils]: 137: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,062 INFO L273 TraceCheckUtils]: 138: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,062 INFO L273 TraceCheckUtils]: 139: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,062 INFO L273 TraceCheckUtils]: 140: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,062 INFO L273 TraceCheckUtils]: 141: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,062 INFO L273 TraceCheckUtils]: 142: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,063 INFO L273 TraceCheckUtils]: 143: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,063 INFO L273 TraceCheckUtils]: 144: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,063 INFO L273 TraceCheckUtils]: 145: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,063 INFO L273 TraceCheckUtils]: 146: Hoare triple {31414#true} assume !(~i~0 < 60); {31414#true} is VALID [2018-11-23 12:18:38,063 INFO L273 TraceCheckUtils]: 147: Hoare triple {31414#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {31414#true} is VALID [2018-11-23 12:18:38,063 INFO L273 TraceCheckUtils]: 148: Hoare triple {31414#true} assume true; {31414#true} is VALID [2018-11-23 12:18:38,063 INFO L268 TraceCheckUtils]: 149: Hoare quadruple {31414#true} {31415#false} #77#return; {31415#false} is VALID [2018-11-23 12:18:38,063 INFO L273 TraceCheckUtils]: 150: Hoare triple {31415#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {31415#false} is VALID [2018-11-23 12:18:38,063 INFO L273 TraceCheckUtils]: 151: Hoare triple {31415#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {31415#false} is VALID [2018-11-23 12:18:38,063 INFO L273 TraceCheckUtils]: 152: Hoare triple {31415#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {31415#false} is VALID [2018-11-23 12:18:38,064 INFO L273 TraceCheckUtils]: 153: Hoare triple {31415#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {31415#false} is VALID [2018-11-23 12:18:38,064 INFO L273 TraceCheckUtils]: 154: Hoare triple {31415#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {31415#false} is VALID [2018-11-23 12:18:38,064 INFO L273 TraceCheckUtils]: 155: Hoare triple {31415#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {31415#false} is VALID [2018-11-23 12:18:38,064 INFO L273 TraceCheckUtils]: 156: Hoare triple {31415#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {31415#false} is VALID [2018-11-23 12:18:38,064 INFO L273 TraceCheckUtils]: 157: Hoare triple {31415#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {31415#false} is VALID [2018-11-23 12:18:38,064 INFO L273 TraceCheckUtils]: 158: Hoare triple {31415#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {31415#false} is VALID [2018-11-23 12:18:38,064 INFO L273 TraceCheckUtils]: 159: Hoare triple {31415#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {31415#false} is VALID [2018-11-23 12:18:38,064 INFO L273 TraceCheckUtils]: 160: Hoare triple {31415#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {31415#false} is VALID [2018-11-23 12:18:38,064 INFO L273 TraceCheckUtils]: 161: Hoare triple {31415#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {31415#false} is VALID [2018-11-23 12:18:38,064 INFO L273 TraceCheckUtils]: 162: Hoare triple {31415#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {31415#false} is VALID [2018-11-23 12:18:38,065 INFO L273 TraceCheckUtils]: 163: Hoare triple {31415#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {31415#false} is VALID [2018-11-23 12:18:38,065 INFO L273 TraceCheckUtils]: 164: Hoare triple {31415#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {31415#false} is VALID [2018-11-23 12:18:38,065 INFO L273 TraceCheckUtils]: 165: Hoare triple {31415#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {31415#false} is VALID [2018-11-23 12:18:38,065 INFO L273 TraceCheckUtils]: 166: Hoare triple {31415#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {31415#false} is VALID [2018-11-23 12:18:38,065 INFO L273 TraceCheckUtils]: 167: Hoare triple {31415#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {31415#false} is VALID [2018-11-23 12:18:38,065 INFO L273 TraceCheckUtils]: 168: Hoare triple {31415#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {31415#false} is VALID [2018-11-23 12:18:38,065 INFO L273 TraceCheckUtils]: 169: Hoare triple {31415#false} assume !(~i~2 < 59); {31415#false} is VALID [2018-11-23 12:18:38,065 INFO L273 TraceCheckUtils]: 170: Hoare triple {31415#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {31415#false} is VALID [2018-11-23 12:18:38,065 INFO L256 TraceCheckUtils]: 171: Hoare triple {31415#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {31414#true} is VALID [2018-11-23 12:18:38,065 INFO L273 TraceCheckUtils]: 172: Hoare triple {31414#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {31414#true} is VALID [2018-11-23 12:18:38,066 INFO L273 TraceCheckUtils]: 173: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,066 INFO L273 TraceCheckUtils]: 174: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,066 INFO L273 TraceCheckUtils]: 175: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,066 INFO L273 TraceCheckUtils]: 176: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,066 INFO L273 TraceCheckUtils]: 177: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,066 INFO L273 TraceCheckUtils]: 178: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,066 INFO L273 TraceCheckUtils]: 179: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,066 INFO L273 TraceCheckUtils]: 180: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,066 INFO L273 TraceCheckUtils]: 181: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,066 INFO L273 TraceCheckUtils]: 182: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,067 INFO L273 TraceCheckUtils]: 183: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,067 INFO L273 TraceCheckUtils]: 184: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,067 INFO L273 TraceCheckUtils]: 185: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,067 INFO L273 TraceCheckUtils]: 186: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,067 INFO L273 TraceCheckUtils]: 187: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,067 INFO L273 TraceCheckUtils]: 188: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,067 INFO L273 TraceCheckUtils]: 189: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,067 INFO L273 TraceCheckUtils]: 190: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,067 INFO L273 TraceCheckUtils]: 191: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,067 INFO L273 TraceCheckUtils]: 192: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,068 INFO L273 TraceCheckUtils]: 193: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,068 INFO L273 TraceCheckUtils]: 194: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,068 INFO L273 TraceCheckUtils]: 195: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,068 INFO L273 TraceCheckUtils]: 196: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,068 INFO L273 TraceCheckUtils]: 197: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,068 INFO L273 TraceCheckUtils]: 198: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,068 INFO L273 TraceCheckUtils]: 199: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,068 INFO L273 TraceCheckUtils]: 200: Hoare triple {31414#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31414#true} is VALID [2018-11-23 12:18:38,068 INFO L273 TraceCheckUtils]: 201: Hoare triple {31414#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31414#true} is VALID [2018-11-23 12:18:38,068 INFO L273 TraceCheckUtils]: 202: Hoare triple {31414#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31414#true} is VALID [2018-11-23 12:18:38,069 INFO L273 TraceCheckUtils]: 203: Hoare triple {31414#true} assume !(~i~0 < 60); {31414#true} is VALID [2018-11-23 12:18:38,069 INFO L273 TraceCheckUtils]: 204: Hoare triple {31414#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {31414#true} is VALID [2018-11-23 12:18:38,069 INFO L273 TraceCheckUtils]: 205: Hoare triple {31414#true} assume true; {31414#true} is VALID [2018-11-23 12:18:38,069 INFO L268 TraceCheckUtils]: 206: Hoare quadruple {31414#true} {31415#false} #79#return; {31415#false} is VALID [2018-11-23 12:18:38,069 INFO L273 TraceCheckUtils]: 207: Hoare triple {31415#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {31415#false} is VALID [2018-11-23 12:18:38,069 INFO L273 TraceCheckUtils]: 208: Hoare triple {31415#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {31415#false} is VALID [2018-11-23 12:18:38,069 INFO L273 TraceCheckUtils]: 209: Hoare triple {31415#false} assume !false; {31415#false} is VALID [2018-11-23 12:18:38,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2716 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1491 trivial. 0 not checked. [2018-11-23 12:18:38,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:18:38,088 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:18:38,098 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:19:24,980 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2018-11-23 12:19:24,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:19:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:25,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:19:25,474 INFO L256 TraceCheckUtils]: 0: Hoare triple {31414#true} call ULTIMATE.init(); {31414#true} is VALID [2018-11-23 12:19:25,475 INFO L273 TraceCheckUtils]: 1: Hoare triple {31414#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31414#true} is VALID [2018-11-23 12:19:25,475 INFO L273 TraceCheckUtils]: 2: Hoare triple {31414#true} assume true; {31414#true} is VALID [2018-11-23 12:19:25,475 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31414#true} {31414#true} #71#return; {31414#true} is VALID [2018-11-23 12:19:25,475 INFO L256 TraceCheckUtils]: 4: Hoare triple {31414#true} call #t~ret14 := main(); {31414#true} is VALID [2018-11-23 12:19:25,476 INFO L273 TraceCheckUtils]: 5: Hoare triple {31414#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {31414#true} is VALID [2018-11-23 12:19:25,476 INFO L273 TraceCheckUtils]: 6: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,476 INFO L273 TraceCheckUtils]: 7: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,476 INFO L273 TraceCheckUtils]: 8: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,477 INFO L273 TraceCheckUtils]: 9: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,477 INFO L273 TraceCheckUtils]: 10: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,477 INFO L273 TraceCheckUtils]: 11: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,477 INFO L273 TraceCheckUtils]: 12: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,477 INFO L273 TraceCheckUtils]: 13: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,477 INFO L273 TraceCheckUtils]: 14: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,477 INFO L273 TraceCheckUtils]: 15: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,478 INFO L273 TraceCheckUtils]: 16: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,478 INFO L273 TraceCheckUtils]: 17: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,478 INFO L273 TraceCheckUtils]: 18: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,478 INFO L273 TraceCheckUtils]: 19: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,478 INFO L273 TraceCheckUtils]: 20: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,478 INFO L273 TraceCheckUtils]: 21: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,478 INFO L273 TraceCheckUtils]: 22: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,478 INFO L273 TraceCheckUtils]: 23: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,478 INFO L273 TraceCheckUtils]: 24: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,479 INFO L273 TraceCheckUtils]: 25: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,479 INFO L273 TraceCheckUtils]: 26: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,479 INFO L273 TraceCheckUtils]: 27: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,479 INFO L273 TraceCheckUtils]: 28: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,479 INFO L273 TraceCheckUtils]: 29: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,479 INFO L273 TraceCheckUtils]: 30: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,479 INFO L273 TraceCheckUtils]: 31: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,479 INFO L273 TraceCheckUtils]: 32: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,479 INFO L273 TraceCheckUtils]: 33: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,479 INFO L273 TraceCheckUtils]: 34: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,480 INFO L273 TraceCheckUtils]: 35: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,480 INFO L273 TraceCheckUtils]: 36: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,480 INFO L273 TraceCheckUtils]: 37: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,480 INFO L273 TraceCheckUtils]: 38: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,480 INFO L273 TraceCheckUtils]: 39: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,480 INFO L273 TraceCheckUtils]: 40: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,480 INFO L273 TraceCheckUtils]: 41: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,480 INFO L273 TraceCheckUtils]: 42: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,480 INFO L273 TraceCheckUtils]: 43: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,480 INFO L273 TraceCheckUtils]: 44: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,481 INFO L273 TraceCheckUtils]: 45: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,481 INFO L273 TraceCheckUtils]: 46: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,481 INFO L273 TraceCheckUtils]: 47: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,481 INFO L273 TraceCheckUtils]: 48: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,481 INFO L273 TraceCheckUtils]: 49: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,481 INFO L273 TraceCheckUtils]: 50: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,481 INFO L273 TraceCheckUtils]: 51: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,481 INFO L273 TraceCheckUtils]: 52: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,481 INFO L273 TraceCheckUtils]: 53: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,481 INFO L273 TraceCheckUtils]: 54: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,482 INFO L273 TraceCheckUtils]: 55: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,482 INFO L273 TraceCheckUtils]: 56: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,482 INFO L273 TraceCheckUtils]: 57: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,482 INFO L273 TraceCheckUtils]: 58: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,482 INFO L273 TraceCheckUtils]: 59: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,482 INFO L273 TraceCheckUtils]: 60: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,482 INFO L273 TraceCheckUtils]: 61: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,482 INFO L273 TraceCheckUtils]: 62: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,482 INFO L273 TraceCheckUtils]: 63: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,482 INFO L273 TraceCheckUtils]: 64: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,483 INFO L273 TraceCheckUtils]: 65: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,483 INFO L273 TraceCheckUtils]: 66: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,483 INFO L273 TraceCheckUtils]: 67: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,483 INFO L273 TraceCheckUtils]: 68: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,483 INFO L273 TraceCheckUtils]: 69: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,483 INFO L273 TraceCheckUtils]: 70: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,483 INFO L273 TraceCheckUtils]: 71: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,483 INFO L273 TraceCheckUtils]: 72: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,483 INFO L273 TraceCheckUtils]: 73: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,483 INFO L273 TraceCheckUtils]: 74: Hoare triple {31414#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {31414#true} is VALID [2018-11-23 12:19:25,484 INFO L273 TraceCheckUtils]: 75: Hoare triple {31414#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {31414#true} is VALID [2018-11-23 12:19:25,484 INFO L273 TraceCheckUtils]: 76: Hoare triple {31414#true} assume !(~i~1 < 60); {31414#true} is VALID [2018-11-23 12:19:25,484 INFO L256 TraceCheckUtils]: 77: Hoare triple {31414#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {31414#true} is VALID [2018-11-23 12:19:25,484 INFO L273 TraceCheckUtils]: 78: Hoare triple {31414#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {31689#(<= sep_~i~0 0)} is VALID [2018-11-23 12:19:25,485 INFO L273 TraceCheckUtils]: 79: Hoare triple {31689#(<= sep_~i~0 0)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31689#(<= sep_~i~0 0)} is VALID [2018-11-23 12:19:25,485 INFO L273 TraceCheckUtils]: 80: Hoare triple {31689#(<= sep_~i~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31689#(<= sep_~i~0 0)} is VALID [2018-11-23 12:19:25,485 INFO L273 TraceCheckUtils]: 81: Hoare triple {31689#(<= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31699#(<= sep_~i~0 1)} is VALID [2018-11-23 12:19:25,486 INFO L273 TraceCheckUtils]: 82: Hoare triple {31699#(<= sep_~i~0 1)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31699#(<= sep_~i~0 1)} is VALID [2018-11-23 12:19:25,486 INFO L273 TraceCheckUtils]: 83: Hoare triple {31699#(<= sep_~i~0 1)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31699#(<= sep_~i~0 1)} is VALID [2018-11-23 12:19:25,486 INFO L273 TraceCheckUtils]: 84: Hoare triple {31699#(<= sep_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31709#(<= sep_~i~0 2)} is VALID [2018-11-23 12:19:25,487 INFO L273 TraceCheckUtils]: 85: Hoare triple {31709#(<= sep_~i~0 2)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31709#(<= sep_~i~0 2)} is VALID [2018-11-23 12:19:25,488 INFO L273 TraceCheckUtils]: 86: Hoare triple {31709#(<= sep_~i~0 2)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31709#(<= sep_~i~0 2)} is VALID [2018-11-23 12:19:25,488 INFO L273 TraceCheckUtils]: 87: Hoare triple {31709#(<= sep_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31719#(<= sep_~i~0 3)} is VALID [2018-11-23 12:19:25,489 INFO L273 TraceCheckUtils]: 88: Hoare triple {31719#(<= sep_~i~0 3)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31719#(<= sep_~i~0 3)} is VALID [2018-11-23 12:19:25,489 INFO L273 TraceCheckUtils]: 89: Hoare triple {31719#(<= sep_~i~0 3)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31719#(<= sep_~i~0 3)} is VALID [2018-11-23 12:19:25,490 INFO L273 TraceCheckUtils]: 90: Hoare triple {31719#(<= sep_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31729#(<= sep_~i~0 4)} is VALID [2018-11-23 12:19:25,491 INFO L273 TraceCheckUtils]: 91: Hoare triple {31729#(<= sep_~i~0 4)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31729#(<= sep_~i~0 4)} is VALID [2018-11-23 12:19:25,491 INFO L273 TraceCheckUtils]: 92: Hoare triple {31729#(<= sep_~i~0 4)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31729#(<= sep_~i~0 4)} is VALID [2018-11-23 12:19:25,492 INFO L273 TraceCheckUtils]: 93: Hoare triple {31729#(<= sep_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31739#(<= sep_~i~0 5)} is VALID [2018-11-23 12:19:25,492 INFO L273 TraceCheckUtils]: 94: Hoare triple {31739#(<= sep_~i~0 5)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31739#(<= sep_~i~0 5)} is VALID [2018-11-23 12:19:25,493 INFO L273 TraceCheckUtils]: 95: Hoare triple {31739#(<= sep_~i~0 5)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31739#(<= sep_~i~0 5)} is VALID [2018-11-23 12:19:25,493 INFO L273 TraceCheckUtils]: 96: Hoare triple {31739#(<= sep_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31749#(<= sep_~i~0 6)} is VALID [2018-11-23 12:19:25,494 INFO L273 TraceCheckUtils]: 97: Hoare triple {31749#(<= sep_~i~0 6)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31749#(<= sep_~i~0 6)} is VALID [2018-11-23 12:19:25,494 INFO L273 TraceCheckUtils]: 98: Hoare triple {31749#(<= sep_~i~0 6)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31749#(<= sep_~i~0 6)} is VALID [2018-11-23 12:19:25,495 INFO L273 TraceCheckUtils]: 99: Hoare triple {31749#(<= sep_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31759#(<= sep_~i~0 7)} is VALID [2018-11-23 12:19:25,496 INFO L273 TraceCheckUtils]: 100: Hoare triple {31759#(<= sep_~i~0 7)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31759#(<= sep_~i~0 7)} is VALID [2018-11-23 12:19:25,496 INFO L273 TraceCheckUtils]: 101: Hoare triple {31759#(<= sep_~i~0 7)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31759#(<= sep_~i~0 7)} is VALID [2018-11-23 12:19:25,497 INFO L273 TraceCheckUtils]: 102: Hoare triple {31759#(<= sep_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31769#(<= sep_~i~0 8)} is VALID [2018-11-23 12:19:25,497 INFO L273 TraceCheckUtils]: 103: Hoare triple {31769#(<= sep_~i~0 8)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31769#(<= sep_~i~0 8)} is VALID [2018-11-23 12:19:25,498 INFO L273 TraceCheckUtils]: 104: Hoare triple {31769#(<= sep_~i~0 8)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31769#(<= sep_~i~0 8)} is VALID [2018-11-23 12:19:25,499 INFO L273 TraceCheckUtils]: 105: Hoare triple {31769#(<= sep_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31779#(<= sep_~i~0 9)} is VALID [2018-11-23 12:19:25,499 INFO L273 TraceCheckUtils]: 106: Hoare triple {31779#(<= sep_~i~0 9)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31779#(<= sep_~i~0 9)} is VALID [2018-11-23 12:19:25,500 INFO L273 TraceCheckUtils]: 107: Hoare triple {31779#(<= sep_~i~0 9)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31779#(<= sep_~i~0 9)} is VALID [2018-11-23 12:19:25,500 INFO L273 TraceCheckUtils]: 108: Hoare triple {31779#(<= sep_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31789#(<= sep_~i~0 10)} is VALID [2018-11-23 12:19:25,501 INFO L273 TraceCheckUtils]: 109: Hoare triple {31789#(<= sep_~i~0 10)} assume !(~i~0 < 60); {31415#false} is VALID [2018-11-23 12:19:25,501 INFO L273 TraceCheckUtils]: 110: Hoare triple {31415#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {31415#false} is VALID [2018-11-23 12:19:25,501 INFO L273 TraceCheckUtils]: 111: Hoare triple {31415#false} assume true; {31415#false} is VALID [2018-11-23 12:19:25,502 INFO L268 TraceCheckUtils]: 112: Hoare quadruple {31415#false} {31414#true} #75#return; {31415#false} is VALID [2018-11-23 12:19:25,502 INFO L273 TraceCheckUtils]: 113: Hoare triple {31415#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {31415#false} is VALID [2018-11-23 12:19:25,502 INFO L256 TraceCheckUtils]: 114: Hoare triple {31415#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {31415#false} is VALID [2018-11-23 12:19:25,502 INFO L273 TraceCheckUtils]: 115: Hoare triple {31415#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {31415#false} is VALID [2018-11-23 12:19:25,502 INFO L273 TraceCheckUtils]: 116: Hoare triple {31415#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31415#false} is VALID [2018-11-23 12:19:25,502 INFO L273 TraceCheckUtils]: 117: Hoare triple {31415#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31415#false} is VALID [2018-11-23 12:19:25,503 INFO L273 TraceCheckUtils]: 118: Hoare triple {31415#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31415#false} is VALID [2018-11-23 12:19:25,503 INFO L273 TraceCheckUtils]: 119: Hoare triple {31415#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31415#false} is VALID [2018-11-23 12:19:25,503 INFO L273 TraceCheckUtils]: 120: Hoare triple {31415#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31415#false} is VALID [2018-11-23 12:19:25,503 INFO L273 TraceCheckUtils]: 121: Hoare triple {31415#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31415#false} is VALID [2018-11-23 12:19:25,503 INFO L273 TraceCheckUtils]: 122: Hoare triple {31415#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31415#false} is VALID [2018-11-23 12:19:25,503 INFO L273 TraceCheckUtils]: 123: Hoare triple {31415#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31415#false} is VALID [2018-11-23 12:19:25,504 INFO L273 TraceCheckUtils]: 124: Hoare triple {31415#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31415#false} is VALID [2018-11-23 12:19:25,504 INFO L273 TraceCheckUtils]: 125: Hoare triple {31415#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31415#false} is VALID [2018-11-23 12:19:25,504 INFO L273 TraceCheckUtils]: 126: Hoare triple {31415#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31415#false} is VALID [2018-11-23 12:19:25,504 INFO L273 TraceCheckUtils]: 127: Hoare triple {31415#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31415#false} is VALID [2018-11-23 12:19:25,504 INFO L273 TraceCheckUtils]: 128: Hoare triple {31415#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31415#false} is VALID [2018-11-23 12:19:25,504 INFO L273 TraceCheckUtils]: 129: Hoare triple {31415#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31415#false} is VALID [2018-11-23 12:19:25,504 INFO L273 TraceCheckUtils]: 130: Hoare triple {31415#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31415#false} is VALID [2018-11-23 12:19:25,504 INFO L273 TraceCheckUtils]: 131: Hoare triple {31415#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31415#false} is VALID [2018-11-23 12:19:25,504 INFO L273 TraceCheckUtils]: 132: Hoare triple {31415#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31415#false} is VALID [2018-11-23 12:19:25,504 INFO L273 TraceCheckUtils]: 133: Hoare triple {31415#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31415#false} is VALID [2018-11-23 12:19:25,505 INFO L273 TraceCheckUtils]: 134: Hoare triple {31415#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31415#false} is VALID [2018-11-23 12:19:25,505 INFO L273 TraceCheckUtils]: 135: Hoare triple {31415#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31415#false} is VALID [2018-11-23 12:19:25,505 INFO L273 TraceCheckUtils]: 136: Hoare triple {31415#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31415#false} is VALID [2018-11-23 12:19:25,505 INFO L273 TraceCheckUtils]: 137: Hoare triple {31415#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31415#false} is VALID [2018-11-23 12:19:25,505 INFO L273 TraceCheckUtils]: 138: Hoare triple {31415#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31415#false} is VALID [2018-11-23 12:19:25,505 INFO L273 TraceCheckUtils]: 139: Hoare triple {31415#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31415#false} is VALID [2018-11-23 12:19:25,505 INFO L273 TraceCheckUtils]: 140: Hoare triple {31415#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31415#false} is VALID [2018-11-23 12:19:25,505 INFO L273 TraceCheckUtils]: 141: Hoare triple {31415#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31415#false} is VALID [2018-11-23 12:19:25,505 INFO L273 TraceCheckUtils]: 142: Hoare triple {31415#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31415#false} is VALID [2018-11-23 12:19:25,505 INFO L273 TraceCheckUtils]: 143: Hoare triple {31415#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31415#false} is VALID [2018-11-23 12:19:25,506 INFO L273 TraceCheckUtils]: 144: Hoare triple {31415#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31415#false} is VALID [2018-11-23 12:19:25,506 INFO L273 TraceCheckUtils]: 145: Hoare triple {31415#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31415#false} is VALID [2018-11-23 12:19:25,506 INFO L273 TraceCheckUtils]: 146: Hoare triple {31415#false} assume !(~i~0 < 60); {31415#false} is VALID [2018-11-23 12:19:25,506 INFO L273 TraceCheckUtils]: 147: Hoare triple {31415#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {31415#false} is VALID [2018-11-23 12:19:25,506 INFO L273 TraceCheckUtils]: 148: Hoare triple {31415#false} assume true; {31415#false} is VALID [2018-11-23 12:19:25,506 INFO L268 TraceCheckUtils]: 149: Hoare quadruple {31415#false} {31415#false} #77#return; {31415#false} is VALID [2018-11-23 12:19:25,506 INFO L273 TraceCheckUtils]: 150: Hoare triple {31415#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {31415#false} is VALID [2018-11-23 12:19:25,506 INFO L273 TraceCheckUtils]: 151: Hoare triple {31415#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {31415#false} is VALID [2018-11-23 12:19:25,506 INFO L273 TraceCheckUtils]: 152: Hoare triple {31415#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {31415#false} is VALID [2018-11-23 12:19:25,507 INFO L273 TraceCheckUtils]: 153: Hoare triple {31415#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {31415#false} is VALID [2018-11-23 12:19:25,507 INFO L273 TraceCheckUtils]: 154: Hoare triple {31415#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {31415#false} is VALID [2018-11-23 12:19:25,507 INFO L273 TraceCheckUtils]: 155: Hoare triple {31415#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {31415#false} is VALID [2018-11-23 12:19:25,507 INFO L273 TraceCheckUtils]: 156: Hoare triple {31415#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {31415#false} is VALID [2018-11-23 12:19:25,507 INFO L273 TraceCheckUtils]: 157: Hoare triple {31415#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {31415#false} is VALID [2018-11-23 12:19:25,507 INFO L273 TraceCheckUtils]: 158: Hoare triple {31415#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {31415#false} is VALID [2018-11-23 12:19:25,507 INFO L273 TraceCheckUtils]: 159: Hoare triple {31415#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {31415#false} is VALID [2018-11-23 12:19:25,507 INFO L273 TraceCheckUtils]: 160: Hoare triple {31415#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {31415#false} is VALID [2018-11-23 12:19:25,507 INFO L273 TraceCheckUtils]: 161: Hoare triple {31415#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {31415#false} is VALID [2018-11-23 12:19:25,507 INFO L273 TraceCheckUtils]: 162: Hoare triple {31415#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {31415#false} is VALID [2018-11-23 12:19:25,508 INFO L273 TraceCheckUtils]: 163: Hoare triple {31415#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {31415#false} is VALID [2018-11-23 12:19:25,508 INFO L273 TraceCheckUtils]: 164: Hoare triple {31415#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {31415#false} is VALID [2018-11-23 12:19:25,508 INFO L273 TraceCheckUtils]: 165: Hoare triple {31415#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {31415#false} is VALID [2018-11-23 12:19:25,508 INFO L273 TraceCheckUtils]: 166: Hoare triple {31415#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {31415#false} is VALID [2018-11-23 12:19:25,508 INFO L273 TraceCheckUtils]: 167: Hoare triple {31415#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {31415#false} is VALID [2018-11-23 12:19:25,508 INFO L273 TraceCheckUtils]: 168: Hoare triple {31415#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {31415#false} is VALID [2018-11-23 12:19:25,508 INFO L273 TraceCheckUtils]: 169: Hoare triple {31415#false} assume !(~i~2 < 59); {31415#false} is VALID [2018-11-23 12:19:25,508 INFO L273 TraceCheckUtils]: 170: Hoare triple {31415#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {31415#false} is VALID [2018-11-23 12:19:25,508 INFO L256 TraceCheckUtils]: 171: Hoare triple {31415#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {31415#false} is VALID [2018-11-23 12:19:25,508 INFO L273 TraceCheckUtils]: 172: Hoare triple {31415#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {31415#false} is VALID [2018-11-23 12:19:25,509 INFO L273 TraceCheckUtils]: 173: Hoare triple {31415#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31415#false} is VALID [2018-11-23 12:19:25,509 INFO L273 TraceCheckUtils]: 174: Hoare triple {31415#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31415#false} is VALID [2018-11-23 12:19:25,509 INFO L273 TraceCheckUtils]: 175: Hoare triple {31415#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31415#false} is VALID [2018-11-23 12:19:25,509 INFO L273 TraceCheckUtils]: 176: Hoare triple {31415#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31415#false} is VALID [2018-11-23 12:19:25,509 INFO L273 TraceCheckUtils]: 177: Hoare triple {31415#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31415#false} is VALID [2018-11-23 12:19:25,509 INFO L273 TraceCheckUtils]: 178: Hoare triple {31415#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31415#false} is VALID [2018-11-23 12:19:25,509 INFO L273 TraceCheckUtils]: 179: Hoare triple {31415#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31415#false} is VALID [2018-11-23 12:19:25,509 INFO L273 TraceCheckUtils]: 180: Hoare triple {31415#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31415#false} is VALID [2018-11-23 12:19:25,509 INFO L273 TraceCheckUtils]: 181: Hoare triple {31415#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31415#false} is VALID [2018-11-23 12:19:25,509 INFO L273 TraceCheckUtils]: 182: Hoare triple {31415#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31415#false} is VALID [2018-11-23 12:19:25,510 INFO L273 TraceCheckUtils]: 183: Hoare triple {31415#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31415#false} is VALID [2018-11-23 12:19:25,510 INFO L273 TraceCheckUtils]: 184: Hoare triple {31415#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31415#false} is VALID [2018-11-23 12:19:25,510 INFO L273 TraceCheckUtils]: 185: Hoare triple {31415#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31415#false} is VALID [2018-11-23 12:19:25,510 INFO L273 TraceCheckUtils]: 186: Hoare triple {31415#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31415#false} is VALID [2018-11-23 12:19:25,510 INFO L273 TraceCheckUtils]: 187: Hoare triple {31415#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31415#false} is VALID [2018-11-23 12:19:25,510 INFO L273 TraceCheckUtils]: 188: Hoare triple {31415#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31415#false} is VALID [2018-11-23 12:19:25,510 INFO L273 TraceCheckUtils]: 189: Hoare triple {31415#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31415#false} is VALID [2018-11-23 12:19:25,510 INFO L273 TraceCheckUtils]: 190: Hoare triple {31415#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31415#false} is VALID [2018-11-23 12:19:25,510 INFO L273 TraceCheckUtils]: 191: Hoare triple {31415#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31415#false} is VALID [2018-11-23 12:19:25,510 INFO L273 TraceCheckUtils]: 192: Hoare triple {31415#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31415#false} is VALID [2018-11-23 12:19:25,511 INFO L273 TraceCheckUtils]: 193: Hoare triple {31415#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31415#false} is VALID [2018-11-23 12:19:25,511 INFO L273 TraceCheckUtils]: 194: Hoare triple {31415#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31415#false} is VALID [2018-11-23 12:19:25,511 INFO L273 TraceCheckUtils]: 195: Hoare triple {31415#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31415#false} is VALID [2018-11-23 12:19:25,511 INFO L273 TraceCheckUtils]: 196: Hoare triple {31415#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31415#false} is VALID [2018-11-23 12:19:25,511 INFO L273 TraceCheckUtils]: 197: Hoare triple {31415#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31415#false} is VALID [2018-11-23 12:19:25,511 INFO L273 TraceCheckUtils]: 198: Hoare triple {31415#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31415#false} is VALID [2018-11-23 12:19:25,511 INFO L273 TraceCheckUtils]: 199: Hoare triple {31415#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31415#false} is VALID [2018-11-23 12:19:25,511 INFO L273 TraceCheckUtils]: 200: Hoare triple {31415#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {31415#false} is VALID [2018-11-23 12:19:25,511 INFO L273 TraceCheckUtils]: 201: Hoare triple {31415#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {31415#false} is VALID [2018-11-23 12:19:25,511 INFO L273 TraceCheckUtils]: 202: Hoare triple {31415#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {31415#false} is VALID [2018-11-23 12:19:25,512 INFO L273 TraceCheckUtils]: 203: Hoare triple {31415#false} assume !(~i~0 < 60); {31415#false} is VALID [2018-11-23 12:19:25,512 INFO L273 TraceCheckUtils]: 204: Hoare triple {31415#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {31415#false} is VALID [2018-11-23 12:19:25,512 INFO L273 TraceCheckUtils]: 205: Hoare triple {31415#false} assume true; {31415#false} is VALID [2018-11-23 12:19:25,512 INFO L268 TraceCheckUtils]: 206: Hoare quadruple {31415#false} {31415#false} #79#return; {31415#false} is VALID [2018-11-23 12:19:25,512 INFO L273 TraceCheckUtils]: 207: Hoare triple {31415#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {31415#false} is VALID [2018-11-23 12:19:25,512 INFO L273 TraceCheckUtils]: 208: Hoare triple {31415#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {31415#false} is VALID [2018-11-23 12:19:25,512 INFO L273 TraceCheckUtils]: 209: Hoare triple {31415#false} assume !false; {31415#false} is VALID [2018-11-23 12:19:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2716 backedges. 644 proven. 145 refuted. 0 times theorem prover too weak. 1927 trivial. 0 not checked. [2018-11-23 12:19:25,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:19:25,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 13] total 49 [2018-11-23 12:19:25,559 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 210 [2018-11-23 12:19:25,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:25,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-23 12:19:25,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:25,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-23 12:19:25,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-23 12:19:25,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:19:25,711 INFO L87 Difference]: Start difference. First operand 141 states and 155 transitions. Second operand 49 states. [2018-11-23 12:19:27,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:27,008 INFO L93 Difference]: Finished difference Result 213 states and 247 transitions. [2018-11-23 12:19:27,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 12:19:27,008 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 210 [2018-11-23 12:19:27,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:27,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:19:27,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 176 transitions. [2018-11-23 12:19:27,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:19:27,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 176 transitions. [2018-11-23 12:19:27,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 176 transitions. [2018-11-23 12:19:27,185 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:27,188 INFO L225 Difference]: With dead ends: 213 [2018-11-23 12:19:27,188 INFO L226 Difference]: Without dead ends: 149 [2018-11-23 12:19:27,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:19:27,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-23 12:19:27,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2018-11-23 12:19:27,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:27,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 146 states. [2018-11-23 12:19:27,287 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 146 states. [2018-11-23 12:19:27,287 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 146 states. [2018-11-23 12:19:27,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:27,291 INFO L93 Difference]: Finished difference Result 149 states and 165 transitions. [2018-11-23 12:19:27,291 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 165 transitions. [2018-11-23 12:19:27,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:27,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:27,291 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 149 states. [2018-11-23 12:19:27,292 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 149 states. [2018-11-23 12:19:27,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:27,294 INFO L93 Difference]: Finished difference Result 149 states and 165 transitions. [2018-11-23 12:19:27,295 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 165 transitions. [2018-11-23 12:19:27,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:27,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:27,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:27,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:27,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-23 12:19:27,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 161 transitions. [2018-11-23 12:19:27,298 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 161 transitions. Word has length 210 [2018-11-23 12:19:27,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:27,298 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 161 transitions. [2018-11-23 12:19:27,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-23 12:19:27,299 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2018-11-23 12:19:27,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-23 12:19:27,300 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:27,300 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 33, 33, 33, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:19:27,300 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:27,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:27,300 INFO L82 PathProgramCache]: Analyzing trace with hash -763689655, now seen corresponding path program 36 times [2018-11-23 12:19:27,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:27,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:27,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:27,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:19:27,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:28,953 INFO L256 TraceCheckUtils]: 0: Hoare triple {32908#true} call ULTIMATE.init(); {32908#true} is VALID [2018-11-23 12:19:28,953 INFO L273 TraceCheckUtils]: 1: Hoare triple {32908#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32908#true} is VALID [2018-11-23 12:19:28,953 INFO L273 TraceCheckUtils]: 2: Hoare triple {32908#true} assume true; {32908#true} is VALID [2018-11-23 12:19:28,954 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32908#true} {32908#true} #71#return; {32908#true} is VALID [2018-11-23 12:19:28,954 INFO L256 TraceCheckUtils]: 4: Hoare triple {32908#true} call #t~ret14 := main(); {32908#true} is VALID [2018-11-23 12:19:28,954 INFO L273 TraceCheckUtils]: 5: Hoare triple {32908#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {32910#(= main_~i~1 0)} is VALID [2018-11-23 12:19:28,955 INFO L273 TraceCheckUtils]: 6: Hoare triple {32910#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32910#(= main_~i~1 0)} is VALID [2018-11-23 12:19:28,955 INFO L273 TraceCheckUtils]: 7: Hoare triple {32910#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32911#(<= main_~i~1 1)} is VALID [2018-11-23 12:19:28,956 INFO L273 TraceCheckUtils]: 8: Hoare triple {32911#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32911#(<= main_~i~1 1)} is VALID [2018-11-23 12:19:28,956 INFO L273 TraceCheckUtils]: 9: Hoare triple {32911#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32912#(<= main_~i~1 2)} is VALID [2018-11-23 12:19:28,956 INFO L273 TraceCheckUtils]: 10: Hoare triple {32912#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32912#(<= main_~i~1 2)} is VALID [2018-11-23 12:19:28,957 INFO L273 TraceCheckUtils]: 11: Hoare triple {32912#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32913#(<= main_~i~1 3)} is VALID [2018-11-23 12:19:28,958 INFO L273 TraceCheckUtils]: 12: Hoare triple {32913#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32913#(<= main_~i~1 3)} is VALID [2018-11-23 12:19:28,958 INFO L273 TraceCheckUtils]: 13: Hoare triple {32913#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32914#(<= main_~i~1 4)} is VALID [2018-11-23 12:19:28,959 INFO L273 TraceCheckUtils]: 14: Hoare triple {32914#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32914#(<= main_~i~1 4)} is VALID [2018-11-23 12:19:28,959 INFO L273 TraceCheckUtils]: 15: Hoare triple {32914#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32915#(<= main_~i~1 5)} is VALID [2018-11-23 12:19:28,960 INFO L273 TraceCheckUtils]: 16: Hoare triple {32915#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32915#(<= main_~i~1 5)} is VALID [2018-11-23 12:19:28,961 INFO L273 TraceCheckUtils]: 17: Hoare triple {32915#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32916#(<= main_~i~1 6)} is VALID [2018-11-23 12:19:28,961 INFO L273 TraceCheckUtils]: 18: Hoare triple {32916#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32916#(<= main_~i~1 6)} is VALID [2018-11-23 12:19:28,962 INFO L273 TraceCheckUtils]: 19: Hoare triple {32916#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32917#(<= main_~i~1 7)} is VALID [2018-11-23 12:19:28,962 INFO L273 TraceCheckUtils]: 20: Hoare triple {32917#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32917#(<= main_~i~1 7)} is VALID [2018-11-23 12:19:28,963 INFO L273 TraceCheckUtils]: 21: Hoare triple {32917#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32918#(<= main_~i~1 8)} is VALID [2018-11-23 12:19:28,964 INFO L273 TraceCheckUtils]: 22: Hoare triple {32918#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32918#(<= main_~i~1 8)} is VALID [2018-11-23 12:19:28,964 INFO L273 TraceCheckUtils]: 23: Hoare triple {32918#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32919#(<= main_~i~1 9)} is VALID [2018-11-23 12:19:28,965 INFO L273 TraceCheckUtils]: 24: Hoare triple {32919#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32919#(<= main_~i~1 9)} is VALID [2018-11-23 12:19:28,966 INFO L273 TraceCheckUtils]: 25: Hoare triple {32919#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32920#(<= main_~i~1 10)} is VALID [2018-11-23 12:19:28,966 INFO L273 TraceCheckUtils]: 26: Hoare triple {32920#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32920#(<= main_~i~1 10)} is VALID [2018-11-23 12:19:28,967 INFO L273 TraceCheckUtils]: 27: Hoare triple {32920#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32921#(<= main_~i~1 11)} is VALID [2018-11-23 12:19:28,968 INFO L273 TraceCheckUtils]: 28: Hoare triple {32921#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32921#(<= main_~i~1 11)} is VALID [2018-11-23 12:19:28,968 INFO L273 TraceCheckUtils]: 29: Hoare triple {32921#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32922#(<= main_~i~1 12)} is VALID [2018-11-23 12:19:28,969 INFO L273 TraceCheckUtils]: 30: Hoare triple {32922#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32922#(<= main_~i~1 12)} is VALID [2018-11-23 12:19:28,969 INFO L273 TraceCheckUtils]: 31: Hoare triple {32922#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32923#(<= main_~i~1 13)} is VALID [2018-11-23 12:19:28,970 INFO L273 TraceCheckUtils]: 32: Hoare triple {32923#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32923#(<= main_~i~1 13)} is VALID [2018-11-23 12:19:28,971 INFO L273 TraceCheckUtils]: 33: Hoare triple {32923#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32924#(<= main_~i~1 14)} is VALID [2018-11-23 12:19:28,971 INFO L273 TraceCheckUtils]: 34: Hoare triple {32924#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32924#(<= main_~i~1 14)} is VALID [2018-11-23 12:19:28,972 INFO L273 TraceCheckUtils]: 35: Hoare triple {32924#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32925#(<= main_~i~1 15)} is VALID [2018-11-23 12:19:28,973 INFO L273 TraceCheckUtils]: 36: Hoare triple {32925#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32925#(<= main_~i~1 15)} is VALID [2018-11-23 12:19:28,973 INFO L273 TraceCheckUtils]: 37: Hoare triple {32925#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32926#(<= main_~i~1 16)} is VALID [2018-11-23 12:19:28,974 INFO L273 TraceCheckUtils]: 38: Hoare triple {32926#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32926#(<= main_~i~1 16)} is VALID [2018-11-23 12:19:28,975 INFO L273 TraceCheckUtils]: 39: Hoare triple {32926#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32927#(<= main_~i~1 17)} is VALID [2018-11-23 12:19:28,975 INFO L273 TraceCheckUtils]: 40: Hoare triple {32927#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32927#(<= main_~i~1 17)} is VALID [2018-11-23 12:19:28,976 INFO L273 TraceCheckUtils]: 41: Hoare triple {32927#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32928#(<= main_~i~1 18)} is VALID [2018-11-23 12:19:28,976 INFO L273 TraceCheckUtils]: 42: Hoare triple {32928#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32928#(<= main_~i~1 18)} is VALID [2018-11-23 12:19:28,977 INFO L273 TraceCheckUtils]: 43: Hoare triple {32928#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32929#(<= main_~i~1 19)} is VALID [2018-11-23 12:19:28,978 INFO L273 TraceCheckUtils]: 44: Hoare triple {32929#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32929#(<= main_~i~1 19)} is VALID [2018-11-23 12:19:28,978 INFO L273 TraceCheckUtils]: 45: Hoare triple {32929#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32930#(<= main_~i~1 20)} is VALID [2018-11-23 12:19:28,979 INFO L273 TraceCheckUtils]: 46: Hoare triple {32930#(<= main_~i~1 20)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32930#(<= main_~i~1 20)} is VALID [2018-11-23 12:19:28,980 INFO L273 TraceCheckUtils]: 47: Hoare triple {32930#(<= main_~i~1 20)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32931#(<= main_~i~1 21)} is VALID [2018-11-23 12:19:28,980 INFO L273 TraceCheckUtils]: 48: Hoare triple {32931#(<= main_~i~1 21)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32931#(<= main_~i~1 21)} is VALID [2018-11-23 12:19:28,981 INFO L273 TraceCheckUtils]: 49: Hoare triple {32931#(<= main_~i~1 21)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32932#(<= main_~i~1 22)} is VALID [2018-11-23 12:19:28,981 INFO L273 TraceCheckUtils]: 50: Hoare triple {32932#(<= main_~i~1 22)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32932#(<= main_~i~1 22)} is VALID [2018-11-23 12:19:28,982 INFO L273 TraceCheckUtils]: 51: Hoare triple {32932#(<= main_~i~1 22)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32933#(<= main_~i~1 23)} is VALID [2018-11-23 12:19:28,983 INFO L273 TraceCheckUtils]: 52: Hoare triple {32933#(<= main_~i~1 23)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32933#(<= main_~i~1 23)} is VALID [2018-11-23 12:19:28,983 INFO L273 TraceCheckUtils]: 53: Hoare triple {32933#(<= main_~i~1 23)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32934#(<= main_~i~1 24)} is VALID [2018-11-23 12:19:28,984 INFO L273 TraceCheckUtils]: 54: Hoare triple {32934#(<= main_~i~1 24)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32934#(<= main_~i~1 24)} is VALID [2018-11-23 12:19:28,985 INFO L273 TraceCheckUtils]: 55: Hoare triple {32934#(<= main_~i~1 24)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32935#(<= main_~i~1 25)} is VALID [2018-11-23 12:19:28,985 INFO L273 TraceCheckUtils]: 56: Hoare triple {32935#(<= main_~i~1 25)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32935#(<= main_~i~1 25)} is VALID [2018-11-23 12:19:28,986 INFO L273 TraceCheckUtils]: 57: Hoare triple {32935#(<= main_~i~1 25)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32936#(<= main_~i~1 26)} is VALID [2018-11-23 12:19:28,986 INFO L273 TraceCheckUtils]: 58: Hoare triple {32936#(<= main_~i~1 26)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32936#(<= main_~i~1 26)} is VALID [2018-11-23 12:19:28,987 INFO L273 TraceCheckUtils]: 59: Hoare triple {32936#(<= main_~i~1 26)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32937#(<= main_~i~1 27)} is VALID [2018-11-23 12:19:28,988 INFO L273 TraceCheckUtils]: 60: Hoare triple {32937#(<= main_~i~1 27)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32937#(<= main_~i~1 27)} is VALID [2018-11-23 12:19:28,988 INFO L273 TraceCheckUtils]: 61: Hoare triple {32937#(<= main_~i~1 27)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32938#(<= main_~i~1 28)} is VALID [2018-11-23 12:19:28,989 INFO L273 TraceCheckUtils]: 62: Hoare triple {32938#(<= main_~i~1 28)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32938#(<= main_~i~1 28)} is VALID [2018-11-23 12:19:28,990 INFO L273 TraceCheckUtils]: 63: Hoare triple {32938#(<= main_~i~1 28)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32939#(<= main_~i~1 29)} is VALID [2018-11-23 12:19:28,990 INFO L273 TraceCheckUtils]: 64: Hoare triple {32939#(<= main_~i~1 29)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32939#(<= main_~i~1 29)} is VALID [2018-11-23 12:19:28,991 INFO L273 TraceCheckUtils]: 65: Hoare triple {32939#(<= main_~i~1 29)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32940#(<= main_~i~1 30)} is VALID [2018-11-23 12:19:28,991 INFO L273 TraceCheckUtils]: 66: Hoare triple {32940#(<= main_~i~1 30)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32940#(<= main_~i~1 30)} is VALID [2018-11-23 12:19:28,992 INFO L273 TraceCheckUtils]: 67: Hoare triple {32940#(<= main_~i~1 30)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32941#(<= main_~i~1 31)} is VALID [2018-11-23 12:19:28,993 INFO L273 TraceCheckUtils]: 68: Hoare triple {32941#(<= main_~i~1 31)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32941#(<= main_~i~1 31)} is VALID [2018-11-23 12:19:28,994 INFO L273 TraceCheckUtils]: 69: Hoare triple {32941#(<= main_~i~1 31)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32942#(<= main_~i~1 32)} is VALID [2018-11-23 12:19:28,994 INFO L273 TraceCheckUtils]: 70: Hoare triple {32942#(<= main_~i~1 32)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32942#(<= main_~i~1 32)} is VALID [2018-11-23 12:19:28,995 INFO L273 TraceCheckUtils]: 71: Hoare triple {32942#(<= main_~i~1 32)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32943#(<= main_~i~1 33)} is VALID [2018-11-23 12:19:28,995 INFO L273 TraceCheckUtils]: 72: Hoare triple {32943#(<= main_~i~1 33)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32943#(<= main_~i~1 33)} is VALID [2018-11-23 12:19:28,996 INFO L273 TraceCheckUtils]: 73: Hoare triple {32943#(<= main_~i~1 33)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32944#(<= main_~i~1 34)} is VALID [2018-11-23 12:19:28,997 INFO L273 TraceCheckUtils]: 74: Hoare triple {32944#(<= main_~i~1 34)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32944#(<= main_~i~1 34)} is VALID [2018-11-23 12:19:28,997 INFO L273 TraceCheckUtils]: 75: Hoare triple {32944#(<= main_~i~1 34)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32945#(<= main_~i~1 35)} is VALID [2018-11-23 12:19:28,998 INFO L273 TraceCheckUtils]: 76: Hoare triple {32945#(<= main_~i~1 35)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32945#(<= main_~i~1 35)} is VALID [2018-11-23 12:19:28,999 INFO L273 TraceCheckUtils]: 77: Hoare triple {32945#(<= main_~i~1 35)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32946#(<= main_~i~1 36)} is VALID [2018-11-23 12:19:28,999 INFO L273 TraceCheckUtils]: 78: Hoare triple {32946#(<= main_~i~1 36)} assume !(~i~1 < 60); {32909#false} is VALID [2018-11-23 12:19:29,000 INFO L256 TraceCheckUtils]: 79: Hoare triple {32909#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {32908#true} is VALID [2018-11-23 12:19:29,000 INFO L273 TraceCheckUtils]: 80: Hoare triple {32908#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {32908#true} is VALID [2018-11-23 12:19:29,000 INFO L273 TraceCheckUtils]: 81: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,000 INFO L273 TraceCheckUtils]: 82: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,000 INFO L273 TraceCheckUtils]: 83: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,000 INFO L273 TraceCheckUtils]: 84: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,001 INFO L273 TraceCheckUtils]: 85: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,001 INFO L273 TraceCheckUtils]: 86: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,001 INFO L273 TraceCheckUtils]: 87: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,001 INFO L273 TraceCheckUtils]: 88: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,001 INFO L273 TraceCheckUtils]: 89: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,002 INFO L273 TraceCheckUtils]: 90: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,002 INFO L273 TraceCheckUtils]: 91: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,002 INFO L273 TraceCheckUtils]: 92: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,002 INFO L273 TraceCheckUtils]: 93: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,002 INFO L273 TraceCheckUtils]: 94: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,002 INFO L273 TraceCheckUtils]: 95: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,002 INFO L273 TraceCheckUtils]: 96: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,002 INFO L273 TraceCheckUtils]: 97: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,003 INFO L273 TraceCheckUtils]: 98: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,003 INFO L273 TraceCheckUtils]: 99: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,003 INFO L273 TraceCheckUtils]: 100: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,003 INFO L273 TraceCheckUtils]: 101: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,003 INFO L273 TraceCheckUtils]: 102: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,003 INFO L273 TraceCheckUtils]: 103: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,003 INFO L273 TraceCheckUtils]: 104: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,003 INFO L273 TraceCheckUtils]: 105: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,003 INFO L273 TraceCheckUtils]: 106: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,003 INFO L273 TraceCheckUtils]: 107: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,004 INFO L273 TraceCheckUtils]: 108: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,004 INFO L273 TraceCheckUtils]: 109: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,004 INFO L273 TraceCheckUtils]: 110: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,004 INFO L273 TraceCheckUtils]: 111: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,004 INFO L273 TraceCheckUtils]: 112: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,004 INFO L273 TraceCheckUtils]: 113: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,004 INFO L273 TraceCheckUtils]: 114: Hoare triple {32908#true} assume !(~i~0 < 60); {32908#true} is VALID [2018-11-23 12:19:29,004 INFO L273 TraceCheckUtils]: 115: Hoare triple {32908#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {32908#true} is VALID [2018-11-23 12:19:29,004 INFO L273 TraceCheckUtils]: 116: Hoare triple {32908#true} assume true; {32908#true} is VALID [2018-11-23 12:19:29,005 INFO L268 TraceCheckUtils]: 117: Hoare quadruple {32908#true} {32909#false} #75#return; {32909#false} is VALID [2018-11-23 12:19:29,005 INFO L273 TraceCheckUtils]: 118: Hoare triple {32909#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {32909#false} is VALID [2018-11-23 12:19:29,005 INFO L256 TraceCheckUtils]: 119: Hoare triple {32909#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {32908#true} is VALID [2018-11-23 12:19:29,005 INFO L273 TraceCheckUtils]: 120: Hoare triple {32908#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {32908#true} is VALID [2018-11-23 12:19:29,005 INFO L273 TraceCheckUtils]: 121: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,005 INFO L273 TraceCheckUtils]: 122: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,005 INFO L273 TraceCheckUtils]: 123: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,005 INFO L273 TraceCheckUtils]: 124: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,005 INFO L273 TraceCheckUtils]: 125: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,005 INFO L273 TraceCheckUtils]: 126: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,006 INFO L273 TraceCheckUtils]: 127: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,006 INFO L273 TraceCheckUtils]: 128: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,006 INFO L273 TraceCheckUtils]: 129: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,006 INFO L273 TraceCheckUtils]: 130: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,006 INFO L273 TraceCheckUtils]: 131: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,006 INFO L273 TraceCheckUtils]: 132: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,006 INFO L273 TraceCheckUtils]: 133: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,006 INFO L273 TraceCheckUtils]: 134: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,006 INFO L273 TraceCheckUtils]: 135: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,006 INFO L273 TraceCheckUtils]: 136: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,007 INFO L273 TraceCheckUtils]: 137: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,007 INFO L273 TraceCheckUtils]: 138: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,007 INFO L273 TraceCheckUtils]: 139: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,007 INFO L273 TraceCheckUtils]: 140: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,007 INFO L273 TraceCheckUtils]: 141: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,007 INFO L273 TraceCheckUtils]: 142: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,007 INFO L273 TraceCheckUtils]: 143: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,007 INFO L273 TraceCheckUtils]: 144: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,007 INFO L273 TraceCheckUtils]: 145: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,007 INFO L273 TraceCheckUtils]: 146: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,008 INFO L273 TraceCheckUtils]: 147: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,008 INFO L273 TraceCheckUtils]: 148: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,008 INFO L273 TraceCheckUtils]: 149: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,008 INFO L273 TraceCheckUtils]: 150: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,008 INFO L273 TraceCheckUtils]: 151: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,008 INFO L273 TraceCheckUtils]: 152: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,008 INFO L273 TraceCheckUtils]: 153: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,008 INFO L273 TraceCheckUtils]: 154: Hoare triple {32908#true} assume !(~i~0 < 60); {32908#true} is VALID [2018-11-23 12:19:29,008 INFO L273 TraceCheckUtils]: 155: Hoare triple {32908#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {32908#true} is VALID [2018-11-23 12:19:29,008 INFO L273 TraceCheckUtils]: 156: Hoare triple {32908#true} assume true; {32908#true} is VALID [2018-11-23 12:19:29,009 INFO L268 TraceCheckUtils]: 157: Hoare quadruple {32908#true} {32909#false} #77#return; {32909#false} is VALID [2018-11-23 12:19:29,009 INFO L273 TraceCheckUtils]: 158: Hoare triple {32909#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {32909#false} is VALID [2018-11-23 12:19:29,009 INFO L273 TraceCheckUtils]: 159: Hoare triple {32909#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {32909#false} is VALID [2018-11-23 12:19:29,009 INFO L273 TraceCheckUtils]: 160: Hoare triple {32909#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {32909#false} is VALID [2018-11-23 12:19:29,009 INFO L273 TraceCheckUtils]: 161: Hoare triple {32909#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {32909#false} is VALID [2018-11-23 12:19:29,009 INFO L273 TraceCheckUtils]: 162: Hoare triple {32909#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {32909#false} is VALID [2018-11-23 12:19:29,009 INFO L273 TraceCheckUtils]: 163: Hoare triple {32909#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {32909#false} is VALID [2018-11-23 12:19:29,009 INFO L273 TraceCheckUtils]: 164: Hoare triple {32909#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {32909#false} is VALID [2018-11-23 12:19:29,009 INFO L273 TraceCheckUtils]: 165: Hoare triple {32909#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {32909#false} is VALID [2018-11-23 12:19:29,010 INFO L273 TraceCheckUtils]: 166: Hoare triple {32909#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {32909#false} is VALID [2018-11-23 12:19:29,010 INFO L273 TraceCheckUtils]: 167: Hoare triple {32909#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {32909#false} is VALID [2018-11-23 12:19:29,010 INFO L273 TraceCheckUtils]: 168: Hoare triple {32909#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {32909#false} is VALID [2018-11-23 12:19:29,010 INFO L273 TraceCheckUtils]: 169: Hoare triple {32909#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {32909#false} is VALID [2018-11-23 12:19:29,010 INFO L273 TraceCheckUtils]: 170: Hoare triple {32909#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {32909#false} is VALID [2018-11-23 12:19:29,010 INFO L273 TraceCheckUtils]: 171: Hoare triple {32909#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {32909#false} is VALID [2018-11-23 12:19:29,010 INFO L273 TraceCheckUtils]: 172: Hoare triple {32909#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {32909#false} is VALID [2018-11-23 12:19:29,010 INFO L273 TraceCheckUtils]: 173: Hoare triple {32909#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {32909#false} is VALID [2018-11-23 12:19:29,010 INFO L273 TraceCheckUtils]: 174: Hoare triple {32909#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {32909#false} is VALID [2018-11-23 12:19:29,010 INFO L273 TraceCheckUtils]: 175: Hoare triple {32909#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {32909#false} is VALID [2018-11-23 12:19:29,011 INFO L273 TraceCheckUtils]: 176: Hoare triple {32909#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {32909#false} is VALID [2018-11-23 12:19:29,011 INFO L273 TraceCheckUtils]: 177: Hoare triple {32909#false} assume !(~i~2 < 59); {32909#false} is VALID [2018-11-23 12:19:29,011 INFO L273 TraceCheckUtils]: 178: Hoare triple {32909#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {32909#false} is VALID [2018-11-23 12:19:29,011 INFO L256 TraceCheckUtils]: 179: Hoare triple {32909#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {32908#true} is VALID [2018-11-23 12:19:29,011 INFO L273 TraceCheckUtils]: 180: Hoare triple {32908#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {32908#true} is VALID [2018-11-23 12:19:29,011 INFO L273 TraceCheckUtils]: 181: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,011 INFO L273 TraceCheckUtils]: 182: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,011 INFO L273 TraceCheckUtils]: 183: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,011 INFO L273 TraceCheckUtils]: 184: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,011 INFO L273 TraceCheckUtils]: 185: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,012 INFO L273 TraceCheckUtils]: 186: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,012 INFO L273 TraceCheckUtils]: 187: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,012 INFO L273 TraceCheckUtils]: 188: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,012 INFO L273 TraceCheckUtils]: 189: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,012 INFO L273 TraceCheckUtils]: 190: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,012 INFO L273 TraceCheckUtils]: 191: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,012 INFO L273 TraceCheckUtils]: 192: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,012 INFO L273 TraceCheckUtils]: 193: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,012 INFO L273 TraceCheckUtils]: 194: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,012 INFO L273 TraceCheckUtils]: 195: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,013 INFO L273 TraceCheckUtils]: 196: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,013 INFO L273 TraceCheckUtils]: 197: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,013 INFO L273 TraceCheckUtils]: 198: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,013 INFO L273 TraceCheckUtils]: 199: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,013 INFO L273 TraceCheckUtils]: 200: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,013 INFO L273 TraceCheckUtils]: 201: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,013 INFO L273 TraceCheckUtils]: 202: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,013 INFO L273 TraceCheckUtils]: 203: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,013 INFO L273 TraceCheckUtils]: 204: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,013 INFO L273 TraceCheckUtils]: 205: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,014 INFO L273 TraceCheckUtils]: 206: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,014 INFO L273 TraceCheckUtils]: 207: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,014 INFO L273 TraceCheckUtils]: 208: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,014 INFO L273 TraceCheckUtils]: 209: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,014 INFO L273 TraceCheckUtils]: 210: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,014 INFO L273 TraceCheckUtils]: 211: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:29,014 INFO L273 TraceCheckUtils]: 212: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:29,014 INFO L273 TraceCheckUtils]: 213: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:29,014 INFO L273 TraceCheckUtils]: 214: Hoare triple {32908#true} assume !(~i~0 < 60); {32908#true} is VALID [2018-11-23 12:19:29,014 INFO L273 TraceCheckUtils]: 215: Hoare triple {32908#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {32908#true} is VALID [2018-11-23 12:19:29,015 INFO L273 TraceCheckUtils]: 216: Hoare triple {32908#true} assume true; {32908#true} is VALID [2018-11-23 12:19:29,015 INFO L268 TraceCheckUtils]: 217: Hoare quadruple {32908#true} {32909#false} #79#return; {32909#false} is VALID [2018-11-23 12:19:29,015 INFO L273 TraceCheckUtils]: 218: Hoare triple {32909#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {32909#false} is VALID [2018-11-23 12:19:29,015 INFO L273 TraceCheckUtils]: 219: Hoare triple {32909#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {32909#false} is VALID [2018-11-23 12:19:29,015 INFO L273 TraceCheckUtils]: 220: Hoare triple {32909#false} assume !false; {32909#false} is VALID [2018-11-23 12:19:29,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3075 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1779 trivial. 0 not checked. [2018-11-23 12:19:29,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:19:29,035 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:19:29,044 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:19:37,597 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2018-11-23 12:19:37,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:19:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:37,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:19:38,482 INFO L256 TraceCheckUtils]: 0: Hoare triple {32908#true} call ULTIMATE.init(); {32908#true} is VALID [2018-11-23 12:19:38,483 INFO L273 TraceCheckUtils]: 1: Hoare triple {32908#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32908#true} is VALID [2018-11-23 12:19:38,483 INFO L273 TraceCheckUtils]: 2: Hoare triple {32908#true} assume true; {32908#true} is VALID [2018-11-23 12:19:38,483 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32908#true} {32908#true} #71#return; {32908#true} is VALID [2018-11-23 12:19:38,483 INFO L256 TraceCheckUtils]: 4: Hoare triple {32908#true} call #t~ret14 := main(); {32908#true} is VALID [2018-11-23 12:19:38,483 INFO L273 TraceCheckUtils]: 5: Hoare triple {32908#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {32908#true} is VALID [2018-11-23 12:19:38,483 INFO L273 TraceCheckUtils]: 6: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,484 INFO L273 TraceCheckUtils]: 7: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,484 INFO L273 TraceCheckUtils]: 8: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,484 INFO L273 TraceCheckUtils]: 9: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,484 INFO L273 TraceCheckUtils]: 10: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,484 INFO L273 TraceCheckUtils]: 11: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,484 INFO L273 TraceCheckUtils]: 12: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,485 INFO L273 TraceCheckUtils]: 13: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,485 INFO L273 TraceCheckUtils]: 14: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,485 INFO L273 TraceCheckUtils]: 15: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,485 INFO L273 TraceCheckUtils]: 16: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,485 INFO L273 TraceCheckUtils]: 17: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,485 INFO L273 TraceCheckUtils]: 18: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,485 INFO L273 TraceCheckUtils]: 19: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,485 INFO L273 TraceCheckUtils]: 20: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,486 INFO L273 TraceCheckUtils]: 21: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,486 INFO L273 TraceCheckUtils]: 22: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,486 INFO L273 TraceCheckUtils]: 23: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,486 INFO L273 TraceCheckUtils]: 24: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,486 INFO L273 TraceCheckUtils]: 25: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,486 INFO L273 TraceCheckUtils]: 26: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,486 INFO L273 TraceCheckUtils]: 27: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,486 INFO L273 TraceCheckUtils]: 28: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,486 INFO L273 TraceCheckUtils]: 29: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,486 INFO L273 TraceCheckUtils]: 30: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,487 INFO L273 TraceCheckUtils]: 31: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,487 INFO L273 TraceCheckUtils]: 32: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,487 INFO L273 TraceCheckUtils]: 33: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,487 INFO L273 TraceCheckUtils]: 34: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,487 INFO L273 TraceCheckUtils]: 35: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,487 INFO L273 TraceCheckUtils]: 36: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,487 INFO L273 TraceCheckUtils]: 37: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,487 INFO L273 TraceCheckUtils]: 38: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,487 INFO L273 TraceCheckUtils]: 39: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,487 INFO L273 TraceCheckUtils]: 40: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,488 INFO L273 TraceCheckUtils]: 41: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,488 INFO L273 TraceCheckUtils]: 42: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,488 INFO L273 TraceCheckUtils]: 43: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,488 INFO L273 TraceCheckUtils]: 44: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,488 INFO L273 TraceCheckUtils]: 45: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,488 INFO L273 TraceCheckUtils]: 46: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,488 INFO L273 TraceCheckUtils]: 47: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,488 INFO L273 TraceCheckUtils]: 48: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,488 INFO L273 TraceCheckUtils]: 49: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,488 INFO L273 TraceCheckUtils]: 50: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,489 INFO L273 TraceCheckUtils]: 51: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,489 INFO L273 TraceCheckUtils]: 52: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,489 INFO L273 TraceCheckUtils]: 53: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,489 INFO L273 TraceCheckUtils]: 54: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,489 INFO L273 TraceCheckUtils]: 55: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,489 INFO L273 TraceCheckUtils]: 56: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,489 INFO L273 TraceCheckUtils]: 57: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,489 INFO L273 TraceCheckUtils]: 58: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,489 INFO L273 TraceCheckUtils]: 59: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,489 INFO L273 TraceCheckUtils]: 60: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,490 INFO L273 TraceCheckUtils]: 61: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,490 INFO L273 TraceCheckUtils]: 62: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,490 INFO L273 TraceCheckUtils]: 63: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,490 INFO L273 TraceCheckUtils]: 64: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,490 INFO L273 TraceCheckUtils]: 65: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,490 INFO L273 TraceCheckUtils]: 66: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,490 INFO L273 TraceCheckUtils]: 67: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,490 INFO L273 TraceCheckUtils]: 68: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,490 INFO L273 TraceCheckUtils]: 69: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,490 INFO L273 TraceCheckUtils]: 70: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,491 INFO L273 TraceCheckUtils]: 71: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,491 INFO L273 TraceCheckUtils]: 72: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,491 INFO L273 TraceCheckUtils]: 73: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,491 INFO L273 TraceCheckUtils]: 74: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,491 INFO L273 TraceCheckUtils]: 75: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,491 INFO L273 TraceCheckUtils]: 76: Hoare triple {32908#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {32908#true} is VALID [2018-11-23 12:19:38,491 INFO L273 TraceCheckUtils]: 77: Hoare triple {32908#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32908#true} is VALID [2018-11-23 12:19:38,491 INFO L273 TraceCheckUtils]: 78: Hoare triple {32908#true} assume !(~i~1 < 60); {32908#true} is VALID [2018-11-23 12:19:38,491 INFO L256 TraceCheckUtils]: 79: Hoare triple {32908#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {32908#true} is VALID [2018-11-23 12:19:38,491 INFO L273 TraceCheckUtils]: 80: Hoare triple {32908#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {32908#true} is VALID [2018-11-23 12:19:38,492 INFO L273 TraceCheckUtils]: 81: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:38,492 INFO L273 TraceCheckUtils]: 82: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:38,516 INFO L273 TraceCheckUtils]: 83: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:38,516 INFO L273 TraceCheckUtils]: 84: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:38,516 INFO L273 TraceCheckUtils]: 85: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:38,516 INFO L273 TraceCheckUtils]: 86: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:38,516 INFO L273 TraceCheckUtils]: 87: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:38,516 INFO L273 TraceCheckUtils]: 88: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:38,517 INFO L273 TraceCheckUtils]: 89: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:38,517 INFO L273 TraceCheckUtils]: 90: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:38,517 INFO L273 TraceCheckUtils]: 91: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:38,517 INFO L273 TraceCheckUtils]: 92: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:38,517 INFO L273 TraceCheckUtils]: 93: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:38,517 INFO L273 TraceCheckUtils]: 94: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:38,517 INFO L273 TraceCheckUtils]: 95: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:38,517 INFO L273 TraceCheckUtils]: 96: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:38,518 INFO L273 TraceCheckUtils]: 97: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:38,518 INFO L273 TraceCheckUtils]: 98: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:38,518 INFO L273 TraceCheckUtils]: 99: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:38,518 INFO L273 TraceCheckUtils]: 100: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:38,518 INFO L273 TraceCheckUtils]: 101: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:38,518 INFO L273 TraceCheckUtils]: 102: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:38,518 INFO L273 TraceCheckUtils]: 103: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:38,519 INFO L273 TraceCheckUtils]: 104: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:38,519 INFO L273 TraceCheckUtils]: 105: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:38,519 INFO L273 TraceCheckUtils]: 106: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:38,519 INFO L273 TraceCheckUtils]: 107: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:38,519 INFO L273 TraceCheckUtils]: 108: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:38,519 INFO L273 TraceCheckUtils]: 109: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:38,519 INFO L273 TraceCheckUtils]: 110: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:38,519 INFO L273 TraceCheckUtils]: 111: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:38,519 INFO L273 TraceCheckUtils]: 112: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:38,519 INFO L273 TraceCheckUtils]: 113: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:38,520 INFO L273 TraceCheckUtils]: 114: Hoare triple {32908#true} assume !(~i~0 < 60); {32908#true} is VALID [2018-11-23 12:19:38,520 INFO L273 TraceCheckUtils]: 115: Hoare triple {32908#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {32908#true} is VALID [2018-11-23 12:19:38,520 INFO L273 TraceCheckUtils]: 116: Hoare triple {32908#true} assume true; {32908#true} is VALID [2018-11-23 12:19:38,520 INFO L268 TraceCheckUtils]: 117: Hoare quadruple {32908#true} {32908#true} #75#return; {32908#true} is VALID [2018-11-23 12:19:38,520 INFO L273 TraceCheckUtils]: 118: Hoare triple {32908#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {32908#true} is VALID [2018-11-23 12:19:38,520 INFO L256 TraceCheckUtils]: 119: Hoare triple {32908#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {32908#true} is VALID [2018-11-23 12:19:38,520 INFO L273 TraceCheckUtils]: 120: Hoare triple {32908#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {32908#true} is VALID [2018-11-23 12:19:38,520 INFO L273 TraceCheckUtils]: 121: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:38,520 INFO L273 TraceCheckUtils]: 122: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:38,520 INFO L273 TraceCheckUtils]: 123: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:38,521 INFO L273 TraceCheckUtils]: 124: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:38,521 INFO L273 TraceCheckUtils]: 125: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:38,521 INFO L273 TraceCheckUtils]: 126: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:38,521 INFO L273 TraceCheckUtils]: 127: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:38,521 INFO L273 TraceCheckUtils]: 128: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:38,521 INFO L273 TraceCheckUtils]: 129: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:38,521 INFO L273 TraceCheckUtils]: 130: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:38,521 INFO L273 TraceCheckUtils]: 131: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:38,521 INFO L273 TraceCheckUtils]: 132: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:38,521 INFO L273 TraceCheckUtils]: 133: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:38,522 INFO L273 TraceCheckUtils]: 134: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:38,522 INFO L273 TraceCheckUtils]: 135: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:38,522 INFO L273 TraceCheckUtils]: 136: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:38,522 INFO L273 TraceCheckUtils]: 137: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:38,522 INFO L273 TraceCheckUtils]: 138: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:38,522 INFO L273 TraceCheckUtils]: 139: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:38,522 INFO L273 TraceCheckUtils]: 140: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:38,522 INFO L273 TraceCheckUtils]: 141: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:38,522 INFO L273 TraceCheckUtils]: 142: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:38,522 INFO L273 TraceCheckUtils]: 143: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:38,523 INFO L273 TraceCheckUtils]: 144: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:38,523 INFO L273 TraceCheckUtils]: 145: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:38,523 INFO L273 TraceCheckUtils]: 146: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:38,523 INFO L273 TraceCheckUtils]: 147: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:38,523 INFO L273 TraceCheckUtils]: 148: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:38,523 INFO L273 TraceCheckUtils]: 149: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:38,523 INFO L273 TraceCheckUtils]: 150: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:38,523 INFO L273 TraceCheckUtils]: 151: Hoare triple {32908#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32908#true} is VALID [2018-11-23 12:19:38,523 INFO L273 TraceCheckUtils]: 152: Hoare triple {32908#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32908#true} is VALID [2018-11-23 12:19:38,523 INFO L273 TraceCheckUtils]: 153: Hoare triple {32908#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32908#true} is VALID [2018-11-23 12:19:38,524 INFO L273 TraceCheckUtils]: 154: Hoare triple {32908#true} assume !(~i~0 < 60); {32908#true} is VALID [2018-11-23 12:19:38,524 INFO L273 TraceCheckUtils]: 155: Hoare triple {32908#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {32908#true} is VALID [2018-11-23 12:19:38,524 INFO L273 TraceCheckUtils]: 156: Hoare triple {32908#true} assume true; {32908#true} is VALID [2018-11-23 12:19:38,524 INFO L268 TraceCheckUtils]: 157: Hoare quadruple {32908#true} {32908#true} #77#return; {32908#true} is VALID [2018-11-23 12:19:38,525 INFO L273 TraceCheckUtils]: 158: Hoare triple {32908#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {33424#(<= main_~i~2 0)} is VALID [2018-11-23 12:19:38,525 INFO L273 TraceCheckUtils]: 159: Hoare triple {33424#(<= main_~i~2 0)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {33424#(<= main_~i~2 0)} is VALID [2018-11-23 12:19:38,526 INFO L273 TraceCheckUtils]: 160: Hoare triple {33424#(<= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {33431#(<= main_~i~2 1)} is VALID [2018-11-23 12:19:38,526 INFO L273 TraceCheckUtils]: 161: Hoare triple {33431#(<= main_~i~2 1)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {33431#(<= main_~i~2 1)} is VALID [2018-11-23 12:19:38,528 INFO L273 TraceCheckUtils]: 162: Hoare triple {33431#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {33438#(<= main_~i~2 2)} is VALID [2018-11-23 12:19:38,528 INFO L273 TraceCheckUtils]: 163: Hoare triple {33438#(<= main_~i~2 2)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {33438#(<= main_~i~2 2)} is VALID [2018-11-23 12:19:38,530 INFO L273 TraceCheckUtils]: 164: Hoare triple {33438#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {33445#(<= main_~i~2 3)} is VALID [2018-11-23 12:19:38,530 INFO L273 TraceCheckUtils]: 165: Hoare triple {33445#(<= main_~i~2 3)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {33445#(<= main_~i~2 3)} is VALID [2018-11-23 12:19:38,532 INFO L273 TraceCheckUtils]: 166: Hoare triple {33445#(<= main_~i~2 3)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {33452#(<= main_~i~2 4)} is VALID [2018-11-23 12:19:38,532 INFO L273 TraceCheckUtils]: 167: Hoare triple {33452#(<= main_~i~2 4)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {33452#(<= main_~i~2 4)} is VALID [2018-11-23 12:19:38,534 INFO L273 TraceCheckUtils]: 168: Hoare triple {33452#(<= main_~i~2 4)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {33459#(<= main_~i~2 5)} is VALID [2018-11-23 12:19:38,534 INFO L273 TraceCheckUtils]: 169: Hoare triple {33459#(<= main_~i~2 5)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {33459#(<= main_~i~2 5)} is VALID [2018-11-23 12:19:38,534 INFO L273 TraceCheckUtils]: 170: Hoare triple {33459#(<= main_~i~2 5)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {33466#(<= main_~i~2 6)} is VALID [2018-11-23 12:19:38,535 INFO L273 TraceCheckUtils]: 171: Hoare triple {33466#(<= main_~i~2 6)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {33466#(<= main_~i~2 6)} is VALID [2018-11-23 12:19:38,535 INFO L273 TraceCheckUtils]: 172: Hoare triple {33466#(<= main_~i~2 6)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {33473#(<= main_~i~2 7)} is VALID [2018-11-23 12:19:38,535 INFO L273 TraceCheckUtils]: 173: Hoare triple {33473#(<= main_~i~2 7)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {33473#(<= main_~i~2 7)} is VALID [2018-11-23 12:19:38,536 INFO L273 TraceCheckUtils]: 174: Hoare triple {33473#(<= main_~i~2 7)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {33480#(<= main_~i~2 8)} is VALID [2018-11-23 12:19:38,536 INFO L273 TraceCheckUtils]: 175: Hoare triple {33480#(<= main_~i~2 8)} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {33480#(<= main_~i~2 8)} is VALID [2018-11-23 12:19:38,537 INFO L273 TraceCheckUtils]: 176: Hoare triple {33480#(<= main_~i~2 8)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {33487#(<= main_~i~2 9)} is VALID [2018-11-23 12:19:38,537 INFO L273 TraceCheckUtils]: 177: Hoare triple {33487#(<= main_~i~2 9)} assume !(~i~2 < 59); {32909#false} is VALID [2018-11-23 12:19:38,537 INFO L273 TraceCheckUtils]: 178: Hoare triple {32909#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {32909#false} is VALID [2018-11-23 12:19:38,537 INFO L256 TraceCheckUtils]: 179: Hoare triple {32909#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {32909#false} is VALID [2018-11-23 12:19:38,537 INFO L273 TraceCheckUtils]: 180: Hoare triple {32909#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {32909#false} is VALID [2018-11-23 12:19:38,538 INFO L273 TraceCheckUtils]: 181: Hoare triple {32909#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32909#false} is VALID [2018-11-23 12:19:38,538 INFO L273 TraceCheckUtils]: 182: Hoare triple {32909#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32909#false} is VALID [2018-11-23 12:19:38,538 INFO L273 TraceCheckUtils]: 183: Hoare triple {32909#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32909#false} is VALID [2018-11-23 12:19:38,538 INFO L273 TraceCheckUtils]: 184: Hoare triple {32909#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32909#false} is VALID [2018-11-23 12:19:38,538 INFO L273 TraceCheckUtils]: 185: Hoare triple {32909#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32909#false} is VALID [2018-11-23 12:19:38,538 INFO L273 TraceCheckUtils]: 186: Hoare triple {32909#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32909#false} is VALID [2018-11-23 12:19:38,539 INFO L273 TraceCheckUtils]: 187: Hoare triple {32909#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32909#false} is VALID [2018-11-23 12:19:38,539 INFO L273 TraceCheckUtils]: 188: Hoare triple {32909#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32909#false} is VALID [2018-11-23 12:19:38,539 INFO L273 TraceCheckUtils]: 189: Hoare triple {32909#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32909#false} is VALID [2018-11-23 12:19:38,539 INFO L273 TraceCheckUtils]: 190: Hoare triple {32909#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32909#false} is VALID [2018-11-23 12:19:38,539 INFO L273 TraceCheckUtils]: 191: Hoare triple {32909#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32909#false} is VALID [2018-11-23 12:19:38,539 INFO L273 TraceCheckUtils]: 192: Hoare triple {32909#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32909#false} is VALID [2018-11-23 12:19:38,539 INFO L273 TraceCheckUtils]: 193: Hoare triple {32909#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32909#false} is VALID [2018-11-23 12:19:38,539 INFO L273 TraceCheckUtils]: 194: Hoare triple {32909#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32909#false} is VALID [2018-11-23 12:19:38,540 INFO L273 TraceCheckUtils]: 195: Hoare triple {32909#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32909#false} is VALID [2018-11-23 12:19:38,540 INFO L273 TraceCheckUtils]: 196: Hoare triple {32909#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32909#false} is VALID [2018-11-23 12:19:38,540 INFO L273 TraceCheckUtils]: 197: Hoare triple {32909#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32909#false} is VALID [2018-11-23 12:19:38,540 INFO L273 TraceCheckUtils]: 198: Hoare triple {32909#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32909#false} is VALID [2018-11-23 12:19:38,540 INFO L273 TraceCheckUtils]: 199: Hoare triple {32909#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32909#false} is VALID [2018-11-23 12:19:38,540 INFO L273 TraceCheckUtils]: 200: Hoare triple {32909#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32909#false} is VALID [2018-11-23 12:19:38,540 INFO L273 TraceCheckUtils]: 201: Hoare triple {32909#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32909#false} is VALID [2018-11-23 12:19:38,540 INFO L273 TraceCheckUtils]: 202: Hoare triple {32909#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32909#false} is VALID [2018-11-23 12:19:38,540 INFO L273 TraceCheckUtils]: 203: Hoare triple {32909#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32909#false} is VALID [2018-11-23 12:19:38,540 INFO L273 TraceCheckUtils]: 204: Hoare triple {32909#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32909#false} is VALID [2018-11-23 12:19:38,541 INFO L273 TraceCheckUtils]: 205: Hoare triple {32909#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32909#false} is VALID [2018-11-23 12:19:38,541 INFO L273 TraceCheckUtils]: 206: Hoare triple {32909#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32909#false} is VALID [2018-11-23 12:19:38,541 INFO L273 TraceCheckUtils]: 207: Hoare triple {32909#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32909#false} is VALID [2018-11-23 12:19:38,541 INFO L273 TraceCheckUtils]: 208: Hoare triple {32909#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32909#false} is VALID [2018-11-23 12:19:38,541 INFO L273 TraceCheckUtils]: 209: Hoare triple {32909#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32909#false} is VALID [2018-11-23 12:19:38,541 INFO L273 TraceCheckUtils]: 210: Hoare triple {32909#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32909#false} is VALID [2018-11-23 12:19:38,541 INFO L273 TraceCheckUtils]: 211: Hoare triple {32909#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {32909#false} is VALID [2018-11-23 12:19:38,541 INFO L273 TraceCheckUtils]: 212: Hoare triple {32909#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {32909#false} is VALID [2018-11-23 12:19:38,541 INFO L273 TraceCheckUtils]: 213: Hoare triple {32909#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32909#false} is VALID [2018-11-23 12:19:38,541 INFO L273 TraceCheckUtils]: 214: Hoare triple {32909#false} assume !(~i~0 < 60); {32909#false} is VALID [2018-11-23 12:19:38,542 INFO L273 TraceCheckUtils]: 215: Hoare triple {32909#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {32909#false} is VALID [2018-11-23 12:19:38,542 INFO L273 TraceCheckUtils]: 216: Hoare triple {32909#false} assume true; {32909#false} is VALID [2018-11-23 12:19:38,542 INFO L268 TraceCheckUtils]: 217: Hoare quadruple {32909#false} {32909#false} #79#return; {32909#false} is VALID [2018-11-23 12:19:38,542 INFO L273 TraceCheckUtils]: 218: Hoare triple {32909#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {32909#false} is VALID [2018-11-23 12:19:38,542 INFO L273 TraceCheckUtils]: 219: Hoare triple {32909#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {32909#false} is VALID [2018-11-23 12:19:38,542 INFO L273 TraceCheckUtils]: 220: Hoare triple {32909#false} assume !false; {32909#false} is VALID [2018-11-23 12:19:38,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3075 backedges. 780 proven. 81 refuted. 0 times theorem prover too weak. 2214 trivial. 0 not checked. [2018-11-23 12:19:38,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:19:38,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 12] total 49 [2018-11-23 12:19:38,581 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 221 [2018-11-23 12:19:38,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:38,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-23 12:19:38,716 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:38,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-23 12:19:38,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-23 12:19:38,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=806, Invalid=1546, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:19:38,718 INFO L87 Difference]: Start difference. First operand 146 states and 161 transitions. Second operand 49 states. [2018-11-23 12:19:40,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:40,128 INFO L93 Difference]: Finished difference Result 219 states and 250 transitions. [2018-11-23 12:19:40,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 12:19:40,128 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 221 [2018-11-23 12:19:40,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:40,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:19:40,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 151 transitions. [2018-11-23 12:19:40,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:19:40,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 151 transitions. [2018-11-23 12:19:40,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 151 transitions. [2018-11-23 12:19:40,287 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:40,290 INFO L225 Difference]: With dead ends: 219 [2018-11-23 12:19:40,291 INFO L226 Difference]: Without dead ends: 152 [2018-11-23 12:19:40,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=806, Invalid=1546, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:19:40,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-23 12:19:40,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-11-23 12:19:40,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:40,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 150 states. [2018-11-23 12:19:40,377 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 150 states. [2018-11-23 12:19:40,377 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 150 states. [2018-11-23 12:19:40,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:40,380 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2018-11-23 12:19:40,380 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2018-11-23 12:19:40,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:40,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:40,380 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 152 states. [2018-11-23 12:19:40,381 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 152 states. [2018-11-23 12:19:40,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:40,383 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2018-11-23 12:19:40,383 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2018-11-23 12:19:40,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:40,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:40,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:40,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:40,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-23 12:19:40,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2018-11-23 12:19:40,385 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 221 [2018-11-23 12:19:40,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:40,385 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2018-11-23 12:19:40,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-23 12:19:40,385 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2018-11-23 12:19:40,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-11-23 12:19:40,386 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:40,386 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 33, 33, 33, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:19:40,387 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:40,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:40,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1920663703, now seen corresponding path program 37 times [2018-11-23 12:19:40,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:40,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:40,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:40,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:19:40,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:41,392 INFO L256 TraceCheckUtils]: 0: Hoare triple {34456#true} call ULTIMATE.init(); {34456#true} is VALID [2018-11-23 12:19:41,393 INFO L273 TraceCheckUtils]: 1: Hoare triple {34456#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34456#true} is VALID [2018-11-23 12:19:41,393 INFO L273 TraceCheckUtils]: 2: Hoare triple {34456#true} assume true; {34456#true} is VALID [2018-11-23 12:19:41,393 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34456#true} {34456#true} #71#return; {34456#true} is VALID [2018-11-23 12:19:41,393 INFO L256 TraceCheckUtils]: 4: Hoare triple {34456#true} call #t~ret14 := main(); {34456#true} is VALID [2018-11-23 12:19:41,394 INFO L273 TraceCheckUtils]: 5: Hoare triple {34456#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {34458#(= main_~i~1 0)} is VALID [2018-11-23 12:19:41,394 INFO L273 TraceCheckUtils]: 6: Hoare triple {34458#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34458#(= main_~i~1 0)} is VALID [2018-11-23 12:19:41,395 INFO L273 TraceCheckUtils]: 7: Hoare triple {34458#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34459#(<= main_~i~1 1)} is VALID [2018-11-23 12:19:41,395 INFO L273 TraceCheckUtils]: 8: Hoare triple {34459#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34459#(<= main_~i~1 1)} is VALID [2018-11-23 12:19:41,396 INFO L273 TraceCheckUtils]: 9: Hoare triple {34459#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34460#(<= main_~i~1 2)} is VALID [2018-11-23 12:19:41,397 INFO L273 TraceCheckUtils]: 10: Hoare triple {34460#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34460#(<= main_~i~1 2)} is VALID [2018-11-23 12:19:41,397 INFO L273 TraceCheckUtils]: 11: Hoare triple {34460#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34461#(<= main_~i~1 3)} is VALID [2018-11-23 12:19:41,398 INFO L273 TraceCheckUtils]: 12: Hoare triple {34461#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34461#(<= main_~i~1 3)} is VALID [2018-11-23 12:19:41,399 INFO L273 TraceCheckUtils]: 13: Hoare triple {34461#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34462#(<= main_~i~1 4)} is VALID [2018-11-23 12:19:41,399 INFO L273 TraceCheckUtils]: 14: Hoare triple {34462#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34462#(<= main_~i~1 4)} is VALID [2018-11-23 12:19:41,400 INFO L273 TraceCheckUtils]: 15: Hoare triple {34462#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34463#(<= main_~i~1 5)} is VALID [2018-11-23 12:19:41,400 INFO L273 TraceCheckUtils]: 16: Hoare triple {34463#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34463#(<= main_~i~1 5)} is VALID [2018-11-23 12:19:41,401 INFO L273 TraceCheckUtils]: 17: Hoare triple {34463#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34464#(<= main_~i~1 6)} is VALID [2018-11-23 12:19:41,402 INFO L273 TraceCheckUtils]: 18: Hoare triple {34464#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34464#(<= main_~i~1 6)} is VALID [2018-11-23 12:19:41,402 INFO L273 TraceCheckUtils]: 19: Hoare triple {34464#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34465#(<= main_~i~1 7)} is VALID [2018-11-23 12:19:41,403 INFO L273 TraceCheckUtils]: 20: Hoare triple {34465#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34465#(<= main_~i~1 7)} is VALID [2018-11-23 12:19:41,403 INFO L273 TraceCheckUtils]: 21: Hoare triple {34465#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34466#(<= main_~i~1 8)} is VALID [2018-11-23 12:19:41,404 INFO L273 TraceCheckUtils]: 22: Hoare triple {34466#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34466#(<= main_~i~1 8)} is VALID [2018-11-23 12:19:41,405 INFO L273 TraceCheckUtils]: 23: Hoare triple {34466#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34467#(<= main_~i~1 9)} is VALID [2018-11-23 12:19:41,405 INFO L273 TraceCheckUtils]: 24: Hoare triple {34467#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34467#(<= main_~i~1 9)} is VALID [2018-11-23 12:19:41,406 INFO L273 TraceCheckUtils]: 25: Hoare triple {34467#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34468#(<= main_~i~1 10)} is VALID [2018-11-23 12:19:41,406 INFO L273 TraceCheckUtils]: 26: Hoare triple {34468#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34468#(<= main_~i~1 10)} is VALID [2018-11-23 12:19:41,407 INFO L273 TraceCheckUtils]: 27: Hoare triple {34468#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34469#(<= main_~i~1 11)} is VALID [2018-11-23 12:19:41,408 INFO L273 TraceCheckUtils]: 28: Hoare triple {34469#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34469#(<= main_~i~1 11)} is VALID [2018-11-23 12:19:41,408 INFO L273 TraceCheckUtils]: 29: Hoare triple {34469#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34470#(<= main_~i~1 12)} is VALID [2018-11-23 12:19:41,409 INFO L273 TraceCheckUtils]: 30: Hoare triple {34470#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34470#(<= main_~i~1 12)} is VALID [2018-11-23 12:19:41,410 INFO L273 TraceCheckUtils]: 31: Hoare triple {34470#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34471#(<= main_~i~1 13)} is VALID [2018-11-23 12:19:41,410 INFO L273 TraceCheckUtils]: 32: Hoare triple {34471#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34471#(<= main_~i~1 13)} is VALID [2018-11-23 12:19:41,411 INFO L273 TraceCheckUtils]: 33: Hoare triple {34471#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34472#(<= main_~i~1 14)} is VALID [2018-11-23 12:19:41,411 INFO L273 TraceCheckUtils]: 34: Hoare triple {34472#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34472#(<= main_~i~1 14)} is VALID [2018-11-23 12:19:41,412 INFO L273 TraceCheckUtils]: 35: Hoare triple {34472#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34473#(<= main_~i~1 15)} is VALID [2018-11-23 12:19:41,413 INFO L273 TraceCheckUtils]: 36: Hoare triple {34473#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34473#(<= main_~i~1 15)} is VALID [2018-11-23 12:19:41,413 INFO L273 TraceCheckUtils]: 37: Hoare triple {34473#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34474#(<= main_~i~1 16)} is VALID [2018-11-23 12:19:41,414 INFO L273 TraceCheckUtils]: 38: Hoare triple {34474#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34474#(<= main_~i~1 16)} is VALID [2018-11-23 12:19:41,415 INFO L273 TraceCheckUtils]: 39: Hoare triple {34474#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34475#(<= main_~i~1 17)} is VALID [2018-11-23 12:19:41,415 INFO L273 TraceCheckUtils]: 40: Hoare triple {34475#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34475#(<= main_~i~1 17)} is VALID [2018-11-23 12:19:41,416 INFO L273 TraceCheckUtils]: 41: Hoare triple {34475#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34476#(<= main_~i~1 18)} is VALID [2018-11-23 12:19:41,416 INFO L273 TraceCheckUtils]: 42: Hoare triple {34476#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34476#(<= main_~i~1 18)} is VALID [2018-11-23 12:19:41,417 INFO L273 TraceCheckUtils]: 43: Hoare triple {34476#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34477#(<= main_~i~1 19)} is VALID [2018-11-23 12:19:41,417 INFO L273 TraceCheckUtils]: 44: Hoare triple {34477#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34477#(<= main_~i~1 19)} is VALID [2018-11-23 12:19:41,418 INFO L273 TraceCheckUtils]: 45: Hoare triple {34477#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34478#(<= main_~i~1 20)} is VALID [2018-11-23 12:19:41,419 INFO L273 TraceCheckUtils]: 46: Hoare triple {34478#(<= main_~i~1 20)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34478#(<= main_~i~1 20)} is VALID [2018-11-23 12:19:41,419 INFO L273 TraceCheckUtils]: 47: Hoare triple {34478#(<= main_~i~1 20)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34479#(<= main_~i~1 21)} is VALID [2018-11-23 12:19:41,420 INFO L273 TraceCheckUtils]: 48: Hoare triple {34479#(<= main_~i~1 21)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34479#(<= main_~i~1 21)} is VALID [2018-11-23 12:19:41,421 INFO L273 TraceCheckUtils]: 49: Hoare triple {34479#(<= main_~i~1 21)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34480#(<= main_~i~1 22)} is VALID [2018-11-23 12:19:41,421 INFO L273 TraceCheckUtils]: 50: Hoare triple {34480#(<= main_~i~1 22)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34480#(<= main_~i~1 22)} is VALID [2018-11-23 12:19:41,422 INFO L273 TraceCheckUtils]: 51: Hoare triple {34480#(<= main_~i~1 22)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34481#(<= main_~i~1 23)} is VALID [2018-11-23 12:19:41,422 INFO L273 TraceCheckUtils]: 52: Hoare triple {34481#(<= main_~i~1 23)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34481#(<= main_~i~1 23)} is VALID [2018-11-23 12:19:41,423 INFO L273 TraceCheckUtils]: 53: Hoare triple {34481#(<= main_~i~1 23)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34482#(<= main_~i~1 24)} is VALID [2018-11-23 12:19:41,424 INFO L273 TraceCheckUtils]: 54: Hoare triple {34482#(<= main_~i~1 24)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34482#(<= main_~i~1 24)} is VALID [2018-11-23 12:19:41,424 INFO L273 TraceCheckUtils]: 55: Hoare triple {34482#(<= main_~i~1 24)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34483#(<= main_~i~1 25)} is VALID [2018-11-23 12:19:41,425 INFO L273 TraceCheckUtils]: 56: Hoare triple {34483#(<= main_~i~1 25)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34483#(<= main_~i~1 25)} is VALID [2018-11-23 12:19:41,426 INFO L273 TraceCheckUtils]: 57: Hoare triple {34483#(<= main_~i~1 25)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34484#(<= main_~i~1 26)} is VALID [2018-11-23 12:19:41,426 INFO L273 TraceCheckUtils]: 58: Hoare triple {34484#(<= main_~i~1 26)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34484#(<= main_~i~1 26)} is VALID [2018-11-23 12:19:41,427 INFO L273 TraceCheckUtils]: 59: Hoare triple {34484#(<= main_~i~1 26)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34485#(<= main_~i~1 27)} is VALID [2018-11-23 12:19:41,427 INFO L273 TraceCheckUtils]: 60: Hoare triple {34485#(<= main_~i~1 27)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34485#(<= main_~i~1 27)} is VALID [2018-11-23 12:19:41,428 INFO L273 TraceCheckUtils]: 61: Hoare triple {34485#(<= main_~i~1 27)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34486#(<= main_~i~1 28)} is VALID [2018-11-23 12:19:41,428 INFO L273 TraceCheckUtils]: 62: Hoare triple {34486#(<= main_~i~1 28)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34486#(<= main_~i~1 28)} is VALID [2018-11-23 12:19:41,429 INFO L273 TraceCheckUtils]: 63: Hoare triple {34486#(<= main_~i~1 28)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34487#(<= main_~i~1 29)} is VALID [2018-11-23 12:19:41,430 INFO L273 TraceCheckUtils]: 64: Hoare triple {34487#(<= main_~i~1 29)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34487#(<= main_~i~1 29)} is VALID [2018-11-23 12:19:41,430 INFO L273 TraceCheckUtils]: 65: Hoare triple {34487#(<= main_~i~1 29)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34488#(<= main_~i~1 30)} is VALID [2018-11-23 12:19:41,431 INFO L273 TraceCheckUtils]: 66: Hoare triple {34488#(<= main_~i~1 30)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34488#(<= main_~i~1 30)} is VALID [2018-11-23 12:19:41,432 INFO L273 TraceCheckUtils]: 67: Hoare triple {34488#(<= main_~i~1 30)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34489#(<= main_~i~1 31)} is VALID [2018-11-23 12:19:41,432 INFO L273 TraceCheckUtils]: 68: Hoare triple {34489#(<= main_~i~1 31)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34489#(<= main_~i~1 31)} is VALID [2018-11-23 12:19:41,433 INFO L273 TraceCheckUtils]: 69: Hoare triple {34489#(<= main_~i~1 31)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34490#(<= main_~i~1 32)} is VALID [2018-11-23 12:19:41,433 INFO L273 TraceCheckUtils]: 70: Hoare triple {34490#(<= main_~i~1 32)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34490#(<= main_~i~1 32)} is VALID [2018-11-23 12:19:41,434 INFO L273 TraceCheckUtils]: 71: Hoare triple {34490#(<= main_~i~1 32)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34491#(<= main_~i~1 33)} is VALID [2018-11-23 12:19:41,435 INFO L273 TraceCheckUtils]: 72: Hoare triple {34491#(<= main_~i~1 33)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34491#(<= main_~i~1 33)} is VALID [2018-11-23 12:19:41,435 INFO L273 TraceCheckUtils]: 73: Hoare triple {34491#(<= main_~i~1 33)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34492#(<= main_~i~1 34)} is VALID [2018-11-23 12:19:41,436 INFO L273 TraceCheckUtils]: 74: Hoare triple {34492#(<= main_~i~1 34)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34492#(<= main_~i~1 34)} is VALID [2018-11-23 12:19:41,437 INFO L273 TraceCheckUtils]: 75: Hoare triple {34492#(<= main_~i~1 34)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34493#(<= main_~i~1 35)} is VALID [2018-11-23 12:19:41,437 INFO L273 TraceCheckUtils]: 76: Hoare triple {34493#(<= main_~i~1 35)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34493#(<= main_~i~1 35)} is VALID [2018-11-23 12:19:41,438 INFO L273 TraceCheckUtils]: 77: Hoare triple {34493#(<= main_~i~1 35)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34494#(<= main_~i~1 36)} is VALID [2018-11-23 12:19:41,438 INFO L273 TraceCheckUtils]: 78: Hoare triple {34494#(<= main_~i~1 36)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34494#(<= main_~i~1 36)} is VALID [2018-11-23 12:19:41,439 INFO L273 TraceCheckUtils]: 79: Hoare triple {34494#(<= main_~i~1 36)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34495#(<= main_~i~1 37)} is VALID [2018-11-23 12:19:41,440 INFO L273 TraceCheckUtils]: 80: Hoare triple {34495#(<= main_~i~1 37)} assume !(~i~1 < 60); {34457#false} is VALID [2018-11-23 12:19:41,440 INFO L256 TraceCheckUtils]: 81: Hoare triple {34457#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {34456#true} is VALID [2018-11-23 12:19:41,440 INFO L273 TraceCheckUtils]: 82: Hoare triple {34456#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {34456#true} is VALID [2018-11-23 12:19:41,440 INFO L273 TraceCheckUtils]: 83: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,440 INFO L273 TraceCheckUtils]: 84: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,441 INFO L273 TraceCheckUtils]: 85: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,441 INFO L273 TraceCheckUtils]: 86: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,441 INFO L273 TraceCheckUtils]: 87: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,441 INFO L273 TraceCheckUtils]: 88: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,441 INFO L273 TraceCheckUtils]: 89: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,442 INFO L273 TraceCheckUtils]: 90: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,442 INFO L273 TraceCheckUtils]: 91: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,442 INFO L273 TraceCheckUtils]: 92: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,442 INFO L273 TraceCheckUtils]: 93: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,442 INFO L273 TraceCheckUtils]: 94: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,442 INFO L273 TraceCheckUtils]: 95: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,443 INFO L273 TraceCheckUtils]: 96: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,443 INFO L273 TraceCheckUtils]: 97: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,443 INFO L273 TraceCheckUtils]: 98: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,443 INFO L273 TraceCheckUtils]: 99: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,443 INFO L273 TraceCheckUtils]: 100: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,443 INFO L273 TraceCheckUtils]: 101: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,443 INFO L273 TraceCheckUtils]: 102: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,443 INFO L273 TraceCheckUtils]: 103: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,443 INFO L273 TraceCheckUtils]: 104: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,443 INFO L273 TraceCheckUtils]: 105: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,444 INFO L273 TraceCheckUtils]: 106: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,444 INFO L273 TraceCheckUtils]: 107: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,444 INFO L273 TraceCheckUtils]: 108: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,444 INFO L273 TraceCheckUtils]: 109: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,444 INFO L273 TraceCheckUtils]: 110: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,444 INFO L273 TraceCheckUtils]: 111: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,444 INFO L273 TraceCheckUtils]: 112: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,444 INFO L273 TraceCheckUtils]: 113: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,444 INFO L273 TraceCheckUtils]: 114: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,444 INFO L273 TraceCheckUtils]: 115: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,445 INFO L273 TraceCheckUtils]: 116: Hoare triple {34456#true} assume !(~i~0 < 60); {34456#true} is VALID [2018-11-23 12:19:41,445 INFO L273 TraceCheckUtils]: 117: Hoare triple {34456#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {34456#true} is VALID [2018-11-23 12:19:41,445 INFO L273 TraceCheckUtils]: 118: Hoare triple {34456#true} assume true; {34456#true} is VALID [2018-11-23 12:19:41,445 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {34456#true} {34457#false} #75#return; {34457#false} is VALID [2018-11-23 12:19:41,445 INFO L273 TraceCheckUtils]: 120: Hoare triple {34457#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {34457#false} is VALID [2018-11-23 12:19:41,445 INFO L256 TraceCheckUtils]: 121: Hoare triple {34457#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {34456#true} is VALID [2018-11-23 12:19:41,445 INFO L273 TraceCheckUtils]: 122: Hoare triple {34456#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {34456#true} is VALID [2018-11-23 12:19:41,445 INFO L273 TraceCheckUtils]: 123: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,445 INFO L273 TraceCheckUtils]: 124: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,446 INFO L273 TraceCheckUtils]: 125: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,446 INFO L273 TraceCheckUtils]: 126: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,446 INFO L273 TraceCheckUtils]: 127: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,446 INFO L273 TraceCheckUtils]: 128: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,446 INFO L273 TraceCheckUtils]: 129: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,446 INFO L273 TraceCheckUtils]: 130: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,446 INFO L273 TraceCheckUtils]: 131: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,446 INFO L273 TraceCheckUtils]: 132: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,446 INFO L273 TraceCheckUtils]: 133: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,446 INFO L273 TraceCheckUtils]: 134: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,447 INFO L273 TraceCheckUtils]: 135: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,447 INFO L273 TraceCheckUtils]: 136: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,447 INFO L273 TraceCheckUtils]: 137: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,447 INFO L273 TraceCheckUtils]: 138: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,447 INFO L273 TraceCheckUtils]: 139: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,447 INFO L273 TraceCheckUtils]: 140: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,447 INFO L273 TraceCheckUtils]: 141: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,447 INFO L273 TraceCheckUtils]: 142: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,447 INFO L273 TraceCheckUtils]: 143: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,447 INFO L273 TraceCheckUtils]: 144: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,448 INFO L273 TraceCheckUtils]: 145: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,448 INFO L273 TraceCheckUtils]: 146: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,448 INFO L273 TraceCheckUtils]: 147: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,448 INFO L273 TraceCheckUtils]: 148: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,448 INFO L273 TraceCheckUtils]: 149: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,448 INFO L273 TraceCheckUtils]: 150: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,448 INFO L273 TraceCheckUtils]: 151: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,448 INFO L273 TraceCheckUtils]: 152: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,448 INFO L273 TraceCheckUtils]: 153: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,448 INFO L273 TraceCheckUtils]: 154: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,449 INFO L273 TraceCheckUtils]: 155: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,449 INFO L273 TraceCheckUtils]: 156: Hoare triple {34456#true} assume !(~i~0 < 60); {34456#true} is VALID [2018-11-23 12:19:41,449 INFO L273 TraceCheckUtils]: 157: Hoare triple {34456#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {34456#true} is VALID [2018-11-23 12:19:41,449 INFO L273 TraceCheckUtils]: 158: Hoare triple {34456#true} assume true; {34456#true} is VALID [2018-11-23 12:19:41,449 INFO L268 TraceCheckUtils]: 159: Hoare quadruple {34456#true} {34457#false} #77#return; {34457#false} is VALID [2018-11-23 12:19:41,449 INFO L273 TraceCheckUtils]: 160: Hoare triple {34457#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {34457#false} is VALID [2018-11-23 12:19:41,449 INFO L273 TraceCheckUtils]: 161: Hoare triple {34457#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {34457#false} is VALID [2018-11-23 12:19:41,449 INFO L273 TraceCheckUtils]: 162: Hoare triple {34457#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {34457#false} is VALID [2018-11-23 12:19:41,449 INFO L273 TraceCheckUtils]: 163: Hoare triple {34457#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {34457#false} is VALID [2018-11-23 12:19:41,450 INFO L273 TraceCheckUtils]: 164: Hoare triple {34457#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {34457#false} is VALID [2018-11-23 12:19:41,450 INFO L273 TraceCheckUtils]: 165: Hoare triple {34457#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {34457#false} is VALID [2018-11-23 12:19:41,450 INFO L273 TraceCheckUtils]: 166: Hoare triple {34457#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {34457#false} is VALID [2018-11-23 12:19:41,450 INFO L273 TraceCheckUtils]: 167: Hoare triple {34457#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {34457#false} is VALID [2018-11-23 12:19:41,450 INFO L273 TraceCheckUtils]: 168: Hoare triple {34457#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {34457#false} is VALID [2018-11-23 12:19:41,450 INFO L273 TraceCheckUtils]: 169: Hoare triple {34457#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {34457#false} is VALID [2018-11-23 12:19:41,450 INFO L273 TraceCheckUtils]: 170: Hoare triple {34457#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {34457#false} is VALID [2018-11-23 12:19:41,450 INFO L273 TraceCheckUtils]: 171: Hoare triple {34457#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {34457#false} is VALID [2018-11-23 12:19:41,450 INFO L273 TraceCheckUtils]: 172: Hoare triple {34457#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {34457#false} is VALID [2018-11-23 12:19:41,450 INFO L273 TraceCheckUtils]: 173: Hoare triple {34457#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {34457#false} is VALID [2018-11-23 12:19:41,451 INFO L273 TraceCheckUtils]: 174: Hoare triple {34457#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {34457#false} is VALID [2018-11-23 12:19:41,451 INFO L273 TraceCheckUtils]: 175: Hoare triple {34457#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {34457#false} is VALID [2018-11-23 12:19:41,451 INFO L273 TraceCheckUtils]: 176: Hoare triple {34457#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {34457#false} is VALID [2018-11-23 12:19:41,451 INFO L273 TraceCheckUtils]: 177: Hoare triple {34457#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {34457#false} is VALID [2018-11-23 12:19:41,451 INFO L273 TraceCheckUtils]: 178: Hoare triple {34457#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {34457#false} is VALID [2018-11-23 12:19:41,451 INFO L273 TraceCheckUtils]: 179: Hoare triple {34457#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {34457#false} is VALID [2018-11-23 12:19:41,451 INFO L273 TraceCheckUtils]: 180: Hoare triple {34457#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {34457#false} is VALID [2018-11-23 12:19:41,451 INFO L273 TraceCheckUtils]: 181: Hoare triple {34457#false} assume !(~i~2 < 59); {34457#false} is VALID [2018-11-23 12:19:41,451 INFO L273 TraceCheckUtils]: 182: Hoare triple {34457#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {34457#false} is VALID [2018-11-23 12:19:41,451 INFO L256 TraceCheckUtils]: 183: Hoare triple {34457#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {34456#true} is VALID [2018-11-23 12:19:41,452 INFO L273 TraceCheckUtils]: 184: Hoare triple {34456#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {34456#true} is VALID [2018-11-23 12:19:41,452 INFO L273 TraceCheckUtils]: 185: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,452 INFO L273 TraceCheckUtils]: 186: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,452 INFO L273 TraceCheckUtils]: 187: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,452 INFO L273 TraceCheckUtils]: 188: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,452 INFO L273 TraceCheckUtils]: 189: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,452 INFO L273 TraceCheckUtils]: 190: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,452 INFO L273 TraceCheckUtils]: 191: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,452 INFO L273 TraceCheckUtils]: 192: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,452 INFO L273 TraceCheckUtils]: 193: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,453 INFO L273 TraceCheckUtils]: 194: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,453 INFO L273 TraceCheckUtils]: 195: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,453 INFO L273 TraceCheckUtils]: 196: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,453 INFO L273 TraceCheckUtils]: 197: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,453 INFO L273 TraceCheckUtils]: 198: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,453 INFO L273 TraceCheckUtils]: 199: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,453 INFO L273 TraceCheckUtils]: 200: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,453 INFO L273 TraceCheckUtils]: 201: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,453 INFO L273 TraceCheckUtils]: 202: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,453 INFO L273 TraceCheckUtils]: 203: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,454 INFO L273 TraceCheckUtils]: 204: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,454 INFO L273 TraceCheckUtils]: 205: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,454 INFO L273 TraceCheckUtils]: 206: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,454 INFO L273 TraceCheckUtils]: 207: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,454 INFO L273 TraceCheckUtils]: 208: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,454 INFO L273 TraceCheckUtils]: 209: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,454 INFO L273 TraceCheckUtils]: 210: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,454 INFO L273 TraceCheckUtils]: 211: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,454 INFO L273 TraceCheckUtils]: 212: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,454 INFO L273 TraceCheckUtils]: 213: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,455 INFO L273 TraceCheckUtils]: 214: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,455 INFO L273 TraceCheckUtils]: 215: Hoare triple {34456#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34456#true} is VALID [2018-11-23 12:19:41,455 INFO L273 TraceCheckUtils]: 216: Hoare triple {34456#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34456#true} is VALID [2018-11-23 12:19:41,455 INFO L273 TraceCheckUtils]: 217: Hoare triple {34456#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34456#true} is VALID [2018-11-23 12:19:41,455 INFO L273 TraceCheckUtils]: 218: Hoare triple {34456#true} assume !(~i~0 < 60); {34456#true} is VALID [2018-11-23 12:19:41,455 INFO L273 TraceCheckUtils]: 219: Hoare triple {34456#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {34456#true} is VALID [2018-11-23 12:19:41,455 INFO L273 TraceCheckUtils]: 220: Hoare triple {34456#true} assume true; {34456#true} is VALID [2018-11-23 12:19:41,455 INFO L268 TraceCheckUtils]: 221: Hoare quadruple {34456#true} {34457#false} #79#return; {34457#false} is VALID [2018-11-23 12:19:41,455 INFO L273 TraceCheckUtils]: 222: Hoare triple {34457#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {34457#false} is VALID [2018-11-23 12:19:41,455 INFO L273 TraceCheckUtils]: 223: Hoare triple {34457#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {34457#false} is VALID [2018-11-23 12:19:41,456 INFO L273 TraceCheckUtils]: 224: Hoare triple {34457#false} assume !false; {34457#false} is VALID [2018-11-23 12:19:41,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3167 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1798 trivial. 0 not checked. [2018-11-23 12:19:41,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:19:41,477 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:19:41,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:41,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:19:42,207 INFO L256 TraceCheckUtils]: 0: Hoare triple {34456#true} call ULTIMATE.init(); {34456#true} is VALID [2018-11-23 12:19:42,207 INFO L273 TraceCheckUtils]: 1: Hoare triple {34456#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34456#true} is VALID [2018-11-23 12:19:42,207 INFO L273 TraceCheckUtils]: 2: Hoare triple {34456#true} assume true; {34456#true} is VALID [2018-11-23 12:19:42,208 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34456#true} {34456#true} #71#return; {34456#true} is VALID [2018-11-23 12:19:42,208 INFO L256 TraceCheckUtils]: 4: Hoare triple {34456#true} call #t~ret14 := main(); {34456#true} is VALID [2018-11-23 12:19:42,208 INFO L273 TraceCheckUtils]: 5: Hoare triple {34456#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {34514#(<= main_~i~1 0)} is VALID [2018-11-23 12:19:42,209 INFO L273 TraceCheckUtils]: 6: Hoare triple {34514#(<= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34514#(<= main_~i~1 0)} is VALID [2018-11-23 12:19:42,209 INFO L273 TraceCheckUtils]: 7: Hoare triple {34514#(<= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34459#(<= main_~i~1 1)} is VALID [2018-11-23 12:19:42,209 INFO L273 TraceCheckUtils]: 8: Hoare triple {34459#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34459#(<= main_~i~1 1)} is VALID [2018-11-23 12:19:42,210 INFO L273 TraceCheckUtils]: 9: Hoare triple {34459#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34460#(<= main_~i~1 2)} is VALID [2018-11-23 12:19:42,210 INFO L273 TraceCheckUtils]: 10: Hoare triple {34460#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34460#(<= main_~i~1 2)} is VALID [2018-11-23 12:19:42,210 INFO L273 TraceCheckUtils]: 11: Hoare triple {34460#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34461#(<= main_~i~1 3)} is VALID [2018-11-23 12:19:42,211 INFO L273 TraceCheckUtils]: 12: Hoare triple {34461#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34461#(<= main_~i~1 3)} is VALID [2018-11-23 12:19:42,211 INFO L273 TraceCheckUtils]: 13: Hoare triple {34461#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34462#(<= main_~i~1 4)} is VALID [2018-11-23 12:19:42,212 INFO L273 TraceCheckUtils]: 14: Hoare triple {34462#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34462#(<= main_~i~1 4)} is VALID [2018-11-23 12:19:42,213 INFO L273 TraceCheckUtils]: 15: Hoare triple {34462#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34463#(<= main_~i~1 5)} is VALID [2018-11-23 12:19:42,213 INFO L273 TraceCheckUtils]: 16: Hoare triple {34463#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34463#(<= main_~i~1 5)} is VALID [2018-11-23 12:19:42,214 INFO L273 TraceCheckUtils]: 17: Hoare triple {34463#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34464#(<= main_~i~1 6)} is VALID [2018-11-23 12:19:42,214 INFO L273 TraceCheckUtils]: 18: Hoare triple {34464#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34464#(<= main_~i~1 6)} is VALID [2018-11-23 12:19:42,215 INFO L273 TraceCheckUtils]: 19: Hoare triple {34464#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34465#(<= main_~i~1 7)} is VALID [2018-11-23 12:19:42,216 INFO L273 TraceCheckUtils]: 20: Hoare triple {34465#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34465#(<= main_~i~1 7)} is VALID [2018-11-23 12:19:42,216 INFO L273 TraceCheckUtils]: 21: Hoare triple {34465#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34466#(<= main_~i~1 8)} is VALID [2018-11-23 12:19:42,217 INFO L273 TraceCheckUtils]: 22: Hoare triple {34466#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34466#(<= main_~i~1 8)} is VALID [2018-11-23 12:19:42,217 INFO L273 TraceCheckUtils]: 23: Hoare triple {34466#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34467#(<= main_~i~1 9)} is VALID [2018-11-23 12:19:42,218 INFO L273 TraceCheckUtils]: 24: Hoare triple {34467#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34467#(<= main_~i~1 9)} is VALID [2018-11-23 12:19:42,219 INFO L273 TraceCheckUtils]: 25: Hoare triple {34467#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34468#(<= main_~i~1 10)} is VALID [2018-11-23 12:19:42,219 INFO L273 TraceCheckUtils]: 26: Hoare triple {34468#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34468#(<= main_~i~1 10)} is VALID [2018-11-23 12:19:42,220 INFO L273 TraceCheckUtils]: 27: Hoare triple {34468#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34469#(<= main_~i~1 11)} is VALID [2018-11-23 12:19:42,220 INFO L273 TraceCheckUtils]: 28: Hoare triple {34469#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34469#(<= main_~i~1 11)} is VALID [2018-11-23 12:19:42,221 INFO L273 TraceCheckUtils]: 29: Hoare triple {34469#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34470#(<= main_~i~1 12)} is VALID [2018-11-23 12:19:42,221 INFO L273 TraceCheckUtils]: 30: Hoare triple {34470#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34470#(<= main_~i~1 12)} is VALID [2018-11-23 12:19:42,222 INFO L273 TraceCheckUtils]: 31: Hoare triple {34470#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34471#(<= main_~i~1 13)} is VALID [2018-11-23 12:19:42,223 INFO L273 TraceCheckUtils]: 32: Hoare triple {34471#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34471#(<= main_~i~1 13)} is VALID [2018-11-23 12:19:42,223 INFO L273 TraceCheckUtils]: 33: Hoare triple {34471#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34472#(<= main_~i~1 14)} is VALID [2018-11-23 12:19:42,224 INFO L273 TraceCheckUtils]: 34: Hoare triple {34472#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34472#(<= main_~i~1 14)} is VALID [2018-11-23 12:19:42,224 INFO L273 TraceCheckUtils]: 35: Hoare triple {34472#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34473#(<= main_~i~1 15)} is VALID [2018-11-23 12:19:42,225 INFO L273 TraceCheckUtils]: 36: Hoare triple {34473#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34473#(<= main_~i~1 15)} is VALID [2018-11-23 12:19:42,226 INFO L273 TraceCheckUtils]: 37: Hoare triple {34473#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34474#(<= main_~i~1 16)} is VALID [2018-11-23 12:19:42,226 INFO L273 TraceCheckUtils]: 38: Hoare triple {34474#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34474#(<= main_~i~1 16)} is VALID [2018-11-23 12:19:42,227 INFO L273 TraceCheckUtils]: 39: Hoare triple {34474#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34475#(<= main_~i~1 17)} is VALID [2018-11-23 12:19:42,227 INFO L273 TraceCheckUtils]: 40: Hoare triple {34475#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34475#(<= main_~i~1 17)} is VALID [2018-11-23 12:19:42,228 INFO L273 TraceCheckUtils]: 41: Hoare triple {34475#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34476#(<= main_~i~1 18)} is VALID [2018-11-23 12:19:42,229 INFO L273 TraceCheckUtils]: 42: Hoare triple {34476#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34476#(<= main_~i~1 18)} is VALID [2018-11-23 12:19:42,229 INFO L273 TraceCheckUtils]: 43: Hoare triple {34476#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34477#(<= main_~i~1 19)} is VALID [2018-11-23 12:19:42,230 INFO L273 TraceCheckUtils]: 44: Hoare triple {34477#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34477#(<= main_~i~1 19)} is VALID [2018-11-23 12:19:42,231 INFO L273 TraceCheckUtils]: 45: Hoare triple {34477#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34478#(<= main_~i~1 20)} is VALID [2018-11-23 12:19:42,231 INFO L273 TraceCheckUtils]: 46: Hoare triple {34478#(<= main_~i~1 20)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34478#(<= main_~i~1 20)} is VALID [2018-11-23 12:19:42,232 INFO L273 TraceCheckUtils]: 47: Hoare triple {34478#(<= main_~i~1 20)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34479#(<= main_~i~1 21)} is VALID [2018-11-23 12:19:42,232 INFO L273 TraceCheckUtils]: 48: Hoare triple {34479#(<= main_~i~1 21)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34479#(<= main_~i~1 21)} is VALID [2018-11-23 12:19:42,233 INFO L273 TraceCheckUtils]: 49: Hoare triple {34479#(<= main_~i~1 21)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34480#(<= main_~i~1 22)} is VALID [2018-11-23 12:19:42,233 INFO L273 TraceCheckUtils]: 50: Hoare triple {34480#(<= main_~i~1 22)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34480#(<= main_~i~1 22)} is VALID [2018-11-23 12:19:42,234 INFO L273 TraceCheckUtils]: 51: Hoare triple {34480#(<= main_~i~1 22)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34481#(<= main_~i~1 23)} is VALID [2018-11-23 12:19:42,235 INFO L273 TraceCheckUtils]: 52: Hoare triple {34481#(<= main_~i~1 23)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34481#(<= main_~i~1 23)} is VALID [2018-11-23 12:19:42,235 INFO L273 TraceCheckUtils]: 53: Hoare triple {34481#(<= main_~i~1 23)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34482#(<= main_~i~1 24)} is VALID [2018-11-23 12:19:42,236 INFO L273 TraceCheckUtils]: 54: Hoare triple {34482#(<= main_~i~1 24)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34482#(<= main_~i~1 24)} is VALID [2018-11-23 12:19:42,236 INFO L273 TraceCheckUtils]: 55: Hoare triple {34482#(<= main_~i~1 24)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34483#(<= main_~i~1 25)} is VALID [2018-11-23 12:19:42,237 INFO L273 TraceCheckUtils]: 56: Hoare triple {34483#(<= main_~i~1 25)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34483#(<= main_~i~1 25)} is VALID [2018-11-23 12:19:42,238 INFO L273 TraceCheckUtils]: 57: Hoare triple {34483#(<= main_~i~1 25)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34484#(<= main_~i~1 26)} is VALID [2018-11-23 12:19:42,238 INFO L273 TraceCheckUtils]: 58: Hoare triple {34484#(<= main_~i~1 26)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34484#(<= main_~i~1 26)} is VALID [2018-11-23 12:19:42,239 INFO L273 TraceCheckUtils]: 59: Hoare triple {34484#(<= main_~i~1 26)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34485#(<= main_~i~1 27)} is VALID [2018-11-23 12:19:42,239 INFO L273 TraceCheckUtils]: 60: Hoare triple {34485#(<= main_~i~1 27)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34485#(<= main_~i~1 27)} is VALID [2018-11-23 12:19:42,240 INFO L273 TraceCheckUtils]: 61: Hoare triple {34485#(<= main_~i~1 27)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34486#(<= main_~i~1 28)} is VALID [2018-11-23 12:19:42,241 INFO L273 TraceCheckUtils]: 62: Hoare triple {34486#(<= main_~i~1 28)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34486#(<= main_~i~1 28)} is VALID [2018-11-23 12:19:42,241 INFO L273 TraceCheckUtils]: 63: Hoare triple {34486#(<= main_~i~1 28)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34487#(<= main_~i~1 29)} is VALID [2018-11-23 12:19:42,242 INFO L273 TraceCheckUtils]: 64: Hoare triple {34487#(<= main_~i~1 29)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34487#(<= main_~i~1 29)} is VALID [2018-11-23 12:19:42,243 INFO L273 TraceCheckUtils]: 65: Hoare triple {34487#(<= main_~i~1 29)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34488#(<= main_~i~1 30)} is VALID [2018-11-23 12:19:42,243 INFO L273 TraceCheckUtils]: 66: Hoare triple {34488#(<= main_~i~1 30)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34488#(<= main_~i~1 30)} is VALID [2018-11-23 12:19:42,244 INFO L273 TraceCheckUtils]: 67: Hoare triple {34488#(<= main_~i~1 30)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34489#(<= main_~i~1 31)} is VALID [2018-11-23 12:19:42,244 INFO L273 TraceCheckUtils]: 68: Hoare triple {34489#(<= main_~i~1 31)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34489#(<= main_~i~1 31)} is VALID [2018-11-23 12:19:42,245 INFO L273 TraceCheckUtils]: 69: Hoare triple {34489#(<= main_~i~1 31)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34490#(<= main_~i~1 32)} is VALID [2018-11-23 12:19:42,245 INFO L273 TraceCheckUtils]: 70: Hoare triple {34490#(<= main_~i~1 32)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34490#(<= main_~i~1 32)} is VALID [2018-11-23 12:19:42,246 INFO L273 TraceCheckUtils]: 71: Hoare triple {34490#(<= main_~i~1 32)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34491#(<= main_~i~1 33)} is VALID [2018-11-23 12:19:42,246 INFO L273 TraceCheckUtils]: 72: Hoare triple {34491#(<= main_~i~1 33)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34491#(<= main_~i~1 33)} is VALID [2018-11-23 12:19:42,247 INFO L273 TraceCheckUtils]: 73: Hoare triple {34491#(<= main_~i~1 33)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34492#(<= main_~i~1 34)} is VALID [2018-11-23 12:19:42,248 INFO L273 TraceCheckUtils]: 74: Hoare triple {34492#(<= main_~i~1 34)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34492#(<= main_~i~1 34)} is VALID [2018-11-23 12:19:42,248 INFO L273 TraceCheckUtils]: 75: Hoare triple {34492#(<= main_~i~1 34)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34493#(<= main_~i~1 35)} is VALID [2018-11-23 12:19:42,249 INFO L273 TraceCheckUtils]: 76: Hoare triple {34493#(<= main_~i~1 35)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34493#(<= main_~i~1 35)} is VALID [2018-11-23 12:19:42,250 INFO L273 TraceCheckUtils]: 77: Hoare triple {34493#(<= main_~i~1 35)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34494#(<= main_~i~1 36)} is VALID [2018-11-23 12:19:42,250 INFO L273 TraceCheckUtils]: 78: Hoare triple {34494#(<= main_~i~1 36)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {34494#(<= main_~i~1 36)} is VALID [2018-11-23 12:19:42,251 INFO L273 TraceCheckUtils]: 79: Hoare triple {34494#(<= main_~i~1 36)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34495#(<= main_~i~1 37)} is VALID [2018-11-23 12:19:42,251 INFO L273 TraceCheckUtils]: 80: Hoare triple {34495#(<= main_~i~1 37)} assume !(~i~1 < 60); {34457#false} is VALID [2018-11-23 12:19:42,252 INFO L256 TraceCheckUtils]: 81: Hoare triple {34457#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {34457#false} is VALID [2018-11-23 12:19:42,252 INFO L273 TraceCheckUtils]: 82: Hoare triple {34457#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {34457#false} is VALID [2018-11-23 12:19:42,252 INFO L273 TraceCheckUtils]: 83: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,252 INFO L273 TraceCheckUtils]: 84: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,252 INFO L273 TraceCheckUtils]: 85: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,253 INFO L273 TraceCheckUtils]: 86: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,253 INFO L273 TraceCheckUtils]: 87: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,253 INFO L273 TraceCheckUtils]: 88: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,253 INFO L273 TraceCheckUtils]: 89: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,253 INFO L273 TraceCheckUtils]: 90: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,253 INFO L273 TraceCheckUtils]: 91: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,254 INFO L273 TraceCheckUtils]: 92: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,254 INFO L273 TraceCheckUtils]: 93: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,254 INFO L273 TraceCheckUtils]: 94: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,254 INFO L273 TraceCheckUtils]: 95: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,254 INFO L273 TraceCheckUtils]: 96: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,254 INFO L273 TraceCheckUtils]: 97: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,255 INFO L273 TraceCheckUtils]: 98: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,255 INFO L273 TraceCheckUtils]: 99: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,255 INFO L273 TraceCheckUtils]: 100: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,255 INFO L273 TraceCheckUtils]: 101: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,255 INFO L273 TraceCheckUtils]: 102: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,255 INFO L273 TraceCheckUtils]: 103: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,255 INFO L273 TraceCheckUtils]: 104: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,256 INFO L273 TraceCheckUtils]: 105: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,256 INFO L273 TraceCheckUtils]: 106: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,256 INFO L273 TraceCheckUtils]: 107: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,256 INFO L273 TraceCheckUtils]: 108: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,256 INFO L273 TraceCheckUtils]: 109: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,256 INFO L273 TraceCheckUtils]: 110: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,256 INFO L273 TraceCheckUtils]: 111: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,256 INFO L273 TraceCheckUtils]: 112: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,256 INFO L273 TraceCheckUtils]: 113: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,256 INFO L273 TraceCheckUtils]: 114: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,257 INFO L273 TraceCheckUtils]: 115: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,257 INFO L273 TraceCheckUtils]: 116: Hoare triple {34457#false} assume !(~i~0 < 60); {34457#false} is VALID [2018-11-23 12:19:42,257 INFO L273 TraceCheckUtils]: 117: Hoare triple {34457#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {34457#false} is VALID [2018-11-23 12:19:42,257 INFO L273 TraceCheckUtils]: 118: Hoare triple {34457#false} assume true; {34457#false} is VALID [2018-11-23 12:19:42,257 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {34457#false} {34457#false} #75#return; {34457#false} is VALID [2018-11-23 12:19:42,257 INFO L273 TraceCheckUtils]: 120: Hoare triple {34457#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {34457#false} is VALID [2018-11-23 12:19:42,257 INFO L256 TraceCheckUtils]: 121: Hoare triple {34457#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {34457#false} is VALID [2018-11-23 12:19:42,257 INFO L273 TraceCheckUtils]: 122: Hoare triple {34457#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {34457#false} is VALID [2018-11-23 12:19:42,257 INFO L273 TraceCheckUtils]: 123: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,257 INFO L273 TraceCheckUtils]: 124: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,258 INFO L273 TraceCheckUtils]: 125: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,258 INFO L273 TraceCheckUtils]: 126: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,258 INFO L273 TraceCheckUtils]: 127: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,258 INFO L273 TraceCheckUtils]: 128: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,258 INFO L273 TraceCheckUtils]: 129: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,258 INFO L273 TraceCheckUtils]: 130: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,258 INFO L273 TraceCheckUtils]: 131: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,258 INFO L273 TraceCheckUtils]: 132: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,258 INFO L273 TraceCheckUtils]: 133: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,258 INFO L273 TraceCheckUtils]: 134: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,259 INFO L273 TraceCheckUtils]: 135: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,259 INFO L273 TraceCheckUtils]: 136: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,259 INFO L273 TraceCheckUtils]: 137: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,259 INFO L273 TraceCheckUtils]: 138: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,259 INFO L273 TraceCheckUtils]: 139: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,259 INFO L273 TraceCheckUtils]: 140: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,259 INFO L273 TraceCheckUtils]: 141: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,259 INFO L273 TraceCheckUtils]: 142: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,259 INFO L273 TraceCheckUtils]: 143: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,259 INFO L273 TraceCheckUtils]: 144: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,260 INFO L273 TraceCheckUtils]: 145: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,260 INFO L273 TraceCheckUtils]: 146: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,260 INFO L273 TraceCheckUtils]: 147: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,260 INFO L273 TraceCheckUtils]: 148: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,260 INFO L273 TraceCheckUtils]: 149: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,260 INFO L273 TraceCheckUtils]: 150: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,260 INFO L273 TraceCheckUtils]: 151: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,260 INFO L273 TraceCheckUtils]: 152: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,260 INFO L273 TraceCheckUtils]: 153: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,260 INFO L273 TraceCheckUtils]: 154: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,261 INFO L273 TraceCheckUtils]: 155: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,261 INFO L273 TraceCheckUtils]: 156: Hoare triple {34457#false} assume !(~i~0 < 60); {34457#false} is VALID [2018-11-23 12:19:42,261 INFO L273 TraceCheckUtils]: 157: Hoare triple {34457#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {34457#false} is VALID [2018-11-23 12:19:42,261 INFO L273 TraceCheckUtils]: 158: Hoare triple {34457#false} assume true; {34457#false} is VALID [2018-11-23 12:19:42,261 INFO L268 TraceCheckUtils]: 159: Hoare quadruple {34457#false} {34457#false} #77#return; {34457#false} is VALID [2018-11-23 12:19:42,261 INFO L273 TraceCheckUtils]: 160: Hoare triple {34457#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {34457#false} is VALID [2018-11-23 12:19:42,261 INFO L273 TraceCheckUtils]: 161: Hoare triple {34457#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {34457#false} is VALID [2018-11-23 12:19:42,261 INFO L273 TraceCheckUtils]: 162: Hoare triple {34457#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {34457#false} is VALID [2018-11-23 12:19:42,261 INFO L273 TraceCheckUtils]: 163: Hoare triple {34457#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {34457#false} is VALID [2018-11-23 12:19:42,261 INFO L273 TraceCheckUtils]: 164: Hoare triple {34457#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {34457#false} is VALID [2018-11-23 12:19:42,262 INFO L273 TraceCheckUtils]: 165: Hoare triple {34457#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {34457#false} is VALID [2018-11-23 12:19:42,262 INFO L273 TraceCheckUtils]: 166: Hoare triple {34457#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {34457#false} is VALID [2018-11-23 12:19:42,262 INFO L273 TraceCheckUtils]: 167: Hoare triple {34457#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {34457#false} is VALID [2018-11-23 12:19:42,262 INFO L273 TraceCheckUtils]: 168: Hoare triple {34457#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {34457#false} is VALID [2018-11-23 12:19:42,262 INFO L273 TraceCheckUtils]: 169: Hoare triple {34457#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {34457#false} is VALID [2018-11-23 12:19:42,262 INFO L273 TraceCheckUtils]: 170: Hoare triple {34457#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {34457#false} is VALID [2018-11-23 12:19:42,262 INFO L273 TraceCheckUtils]: 171: Hoare triple {34457#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {34457#false} is VALID [2018-11-23 12:19:42,262 INFO L273 TraceCheckUtils]: 172: Hoare triple {34457#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {34457#false} is VALID [2018-11-23 12:19:42,262 INFO L273 TraceCheckUtils]: 173: Hoare triple {34457#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {34457#false} is VALID [2018-11-23 12:19:42,262 INFO L273 TraceCheckUtils]: 174: Hoare triple {34457#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {34457#false} is VALID [2018-11-23 12:19:42,263 INFO L273 TraceCheckUtils]: 175: Hoare triple {34457#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {34457#false} is VALID [2018-11-23 12:19:42,263 INFO L273 TraceCheckUtils]: 176: Hoare triple {34457#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {34457#false} is VALID [2018-11-23 12:19:42,263 INFO L273 TraceCheckUtils]: 177: Hoare triple {34457#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {34457#false} is VALID [2018-11-23 12:19:42,263 INFO L273 TraceCheckUtils]: 178: Hoare triple {34457#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {34457#false} is VALID [2018-11-23 12:19:42,263 INFO L273 TraceCheckUtils]: 179: Hoare triple {34457#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {34457#false} is VALID [2018-11-23 12:19:42,263 INFO L273 TraceCheckUtils]: 180: Hoare triple {34457#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {34457#false} is VALID [2018-11-23 12:19:42,263 INFO L273 TraceCheckUtils]: 181: Hoare triple {34457#false} assume !(~i~2 < 59); {34457#false} is VALID [2018-11-23 12:19:42,263 INFO L273 TraceCheckUtils]: 182: Hoare triple {34457#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {34457#false} is VALID [2018-11-23 12:19:42,263 INFO L256 TraceCheckUtils]: 183: Hoare triple {34457#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {34457#false} is VALID [2018-11-23 12:19:42,263 INFO L273 TraceCheckUtils]: 184: Hoare triple {34457#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {34457#false} is VALID [2018-11-23 12:19:42,264 INFO L273 TraceCheckUtils]: 185: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,264 INFO L273 TraceCheckUtils]: 186: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,264 INFO L273 TraceCheckUtils]: 187: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,264 INFO L273 TraceCheckUtils]: 188: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,264 INFO L273 TraceCheckUtils]: 189: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,264 INFO L273 TraceCheckUtils]: 190: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,264 INFO L273 TraceCheckUtils]: 191: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,264 INFO L273 TraceCheckUtils]: 192: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,264 INFO L273 TraceCheckUtils]: 193: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,264 INFO L273 TraceCheckUtils]: 194: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,265 INFO L273 TraceCheckUtils]: 195: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,265 INFO L273 TraceCheckUtils]: 196: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,265 INFO L273 TraceCheckUtils]: 197: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,265 INFO L273 TraceCheckUtils]: 198: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,265 INFO L273 TraceCheckUtils]: 199: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,265 INFO L273 TraceCheckUtils]: 200: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,265 INFO L273 TraceCheckUtils]: 201: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,265 INFO L273 TraceCheckUtils]: 202: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,265 INFO L273 TraceCheckUtils]: 203: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,265 INFO L273 TraceCheckUtils]: 204: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,266 INFO L273 TraceCheckUtils]: 205: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,266 INFO L273 TraceCheckUtils]: 206: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,266 INFO L273 TraceCheckUtils]: 207: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,266 INFO L273 TraceCheckUtils]: 208: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,266 INFO L273 TraceCheckUtils]: 209: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,266 INFO L273 TraceCheckUtils]: 210: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,266 INFO L273 TraceCheckUtils]: 211: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,266 INFO L273 TraceCheckUtils]: 212: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,266 INFO L273 TraceCheckUtils]: 213: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,266 INFO L273 TraceCheckUtils]: 214: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,266 INFO L273 TraceCheckUtils]: 215: Hoare triple {34457#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {34457#false} is VALID [2018-11-23 12:19:42,267 INFO L273 TraceCheckUtils]: 216: Hoare triple {34457#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {34457#false} is VALID [2018-11-23 12:19:42,267 INFO L273 TraceCheckUtils]: 217: Hoare triple {34457#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {34457#false} is VALID [2018-11-23 12:19:42,267 INFO L273 TraceCheckUtils]: 218: Hoare triple {34457#false} assume !(~i~0 < 60); {34457#false} is VALID [2018-11-23 12:19:42,267 INFO L273 TraceCheckUtils]: 219: Hoare triple {34457#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {34457#false} is VALID [2018-11-23 12:19:42,267 INFO L273 TraceCheckUtils]: 220: Hoare triple {34457#false} assume true; {34457#false} is VALID [2018-11-23 12:19:42,267 INFO L268 TraceCheckUtils]: 221: Hoare quadruple {34457#false} {34457#false} #79#return; {34457#false} is VALID [2018-11-23 12:19:42,267 INFO L273 TraceCheckUtils]: 222: Hoare triple {34457#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {34457#false} is VALID [2018-11-23 12:19:42,267 INFO L273 TraceCheckUtils]: 223: Hoare triple {34457#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {34457#false} is VALID [2018-11-23 12:19:42,267 INFO L273 TraceCheckUtils]: 224: Hoare triple {34457#false} assume !false; {34457#false} is VALID [2018-11-23 12:19:42,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3167 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1798 trivial. 0 not checked. [2018-11-23 12:19:42,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:19:42,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-11-23 12:19:42,320 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 225 [2018-11-23 12:19:42,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:42,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 12:19:42,529 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:42,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 12:19:42,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 12:19:42,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:19:42,531 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 41 states. [2018-11-23 12:19:43,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:43,662 INFO L93 Difference]: Finished difference Result 222 states and 252 transitions. [2018-11-23 12:19:43,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:19:43,662 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 225 [2018-11-23 12:19:43,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:43,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:19:43,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 132 transitions. [2018-11-23 12:19:43,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:19:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 132 transitions. [2018-11-23 12:19:43,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 132 transitions. [2018-11-23 12:19:43,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:43,806 INFO L225 Difference]: With dead ends: 222 [2018-11-23 12:19:43,806 INFO L226 Difference]: Without dead ends: 153 [2018-11-23 12:19:43,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:19:43,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-23 12:19:43,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2018-11-23 12:19:43,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:43,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 152 states. [2018-11-23 12:19:43,888 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 152 states. [2018-11-23 12:19:43,889 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 152 states. [2018-11-23 12:19:43,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:43,892 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2018-11-23 12:19:43,892 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 168 transitions. [2018-11-23 12:19:43,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:43,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:43,893 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 153 states. [2018-11-23 12:19:43,893 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 153 states. [2018-11-23 12:19:43,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:43,896 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2018-11-23 12:19:43,896 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 168 transitions. [2018-11-23 12:19:43,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:43,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:43,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:43,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:43,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-23 12:19:43,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2018-11-23 12:19:43,899 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 225 [2018-11-23 12:19:43,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:43,900 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2018-11-23 12:19:43,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 12:19:43,900 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2018-11-23 12:19:43,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-23 12:19:43,901 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:43,901 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 33, 33, 33, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:19:43,901 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:43,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:43,902 INFO L82 PathProgramCache]: Analyzing trace with hash 464848903, now seen corresponding path program 38 times [2018-11-23 12:19:43,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:43,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:43,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:43,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:43,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:44,854 INFO L256 TraceCheckUtils]: 0: Hoare triple {36018#true} call ULTIMATE.init(); {36018#true} is VALID [2018-11-23 12:19:44,854 INFO L273 TraceCheckUtils]: 1: Hoare triple {36018#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36018#true} is VALID [2018-11-23 12:19:44,854 INFO L273 TraceCheckUtils]: 2: Hoare triple {36018#true} assume true; {36018#true} is VALID [2018-11-23 12:19:44,855 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36018#true} {36018#true} #71#return; {36018#true} is VALID [2018-11-23 12:19:44,855 INFO L256 TraceCheckUtils]: 4: Hoare triple {36018#true} call #t~ret14 := main(); {36018#true} is VALID [2018-11-23 12:19:44,855 INFO L273 TraceCheckUtils]: 5: Hoare triple {36018#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {36020#(= main_~i~1 0)} is VALID [2018-11-23 12:19:44,856 INFO L273 TraceCheckUtils]: 6: Hoare triple {36020#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36020#(= main_~i~1 0)} is VALID [2018-11-23 12:19:44,856 INFO L273 TraceCheckUtils]: 7: Hoare triple {36020#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36021#(<= main_~i~1 1)} is VALID [2018-11-23 12:19:44,857 INFO L273 TraceCheckUtils]: 8: Hoare triple {36021#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36021#(<= main_~i~1 1)} is VALID [2018-11-23 12:19:44,858 INFO L273 TraceCheckUtils]: 9: Hoare triple {36021#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36022#(<= main_~i~1 2)} is VALID [2018-11-23 12:19:44,858 INFO L273 TraceCheckUtils]: 10: Hoare triple {36022#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36022#(<= main_~i~1 2)} is VALID [2018-11-23 12:19:44,859 INFO L273 TraceCheckUtils]: 11: Hoare triple {36022#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36023#(<= main_~i~1 3)} is VALID [2018-11-23 12:19:44,859 INFO L273 TraceCheckUtils]: 12: Hoare triple {36023#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36023#(<= main_~i~1 3)} is VALID [2018-11-23 12:19:44,860 INFO L273 TraceCheckUtils]: 13: Hoare triple {36023#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36024#(<= main_~i~1 4)} is VALID [2018-11-23 12:19:44,861 INFO L273 TraceCheckUtils]: 14: Hoare triple {36024#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36024#(<= main_~i~1 4)} is VALID [2018-11-23 12:19:44,861 INFO L273 TraceCheckUtils]: 15: Hoare triple {36024#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36025#(<= main_~i~1 5)} is VALID [2018-11-23 12:19:44,862 INFO L273 TraceCheckUtils]: 16: Hoare triple {36025#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36025#(<= main_~i~1 5)} is VALID [2018-11-23 12:19:44,863 INFO L273 TraceCheckUtils]: 17: Hoare triple {36025#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36026#(<= main_~i~1 6)} is VALID [2018-11-23 12:19:44,863 INFO L273 TraceCheckUtils]: 18: Hoare triple {36026#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36026#(<= main_~i~1 6)} is VALID [2018-11-23 12:19:44,864 INFO L273 TraceCheckUtils]: 19: Hoare triple {36026#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36027#(<= main_~i~1 7)} is VALID [2018-11-23 12:19:44,864 INFO L273 TraceCheckUtils]: 20: Hoare triple {36027#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36027#(<= main_~i~1 7)} is VALID [2018-11-23 12:19:44,865 INFO L273 TraceCheckUtils]: 21: Hoare triple {36027#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36028#(<= main_~i~1 8)} is VALID [2018-11-23 12:19:44,865 INFO L273 TraceCheckUtils]: 22: Hoare triple {36028#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36028#(<= main_~i~1 8)} is VALID [2018-11-23 12:19:44,866 INFO L273 TraceCheckUtils]: 23: Hoare triple {36028#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36029#(<= main_~i~1 9)} is VALID [2018-11-23 12:19:44,867 INFO L273 TraceCheckUtils]: 24: Hoare triple {36029#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36029#(<= main_~i~1 9)} is VALID [2018-11-23 12:19:44,867 INFO L273 TraceCheckUtils]: 25: Hoare triple {36029#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36030#(<= main_~i~1 10)} is VALID [2018-11-23 12:19:44,868 INFO L273 TraceCheckUtils]: 26: Hoare triple {36030#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36030#(<= main_~i~1 10)} is VALID [2018-11-23 12:19:44,868 INFO L273 TraceCheckUtils]: 27: Hoare triple {36030#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36031#(<= main_~i~1 11)} is VALID [2018-11-23 12:19:44,869 INFO L273 TraceCheckUtils]: 28: Hoare triple {36031#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36031#(<= main_~i~1 11)} is VALID [2018-11-23 12:19:44,869 INFO L273 TraceCheckUtils]: 29: Hoare triple {36031#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36032#(<= main_~i~1 12)} is VALID [2018-11-23 12:19:44,870 INFO L273 TraceCheckUtils]: 30: Hoare triple {36032#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36032#(<= main_~i~1 12)} is VALID [2018-11-23 12:19:44,871 INFO L273 TraceCheckUtils]: 31: Hoare triple {36032#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36033#(<= main_~i~1 13)} is VALID [2018-11-23 12:19:44,871 INFO L273 TraceCheckUtils]: 32: Hoare triple {36033#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36033#(<= main_~i~1 13)} is VALID [2018-11-23 12:19:44,872 INFO L273 TraceCheckUtils]: 33: Hoare triple {36033#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36034#(<= main_~i~1 14)} is VALID [2018-11-23 12:19:44,872 INFO L273 TraceCheckUtils]: 34: Hoare triple {36034#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36034#(<= main_~i~1 14)} is VALID [2018-11-23 12:19:44,873 INFO L273 TraceCheckUtils]: 35: Hoare triple {36034#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36035#(<= main_~i~1 15)} is VALID [2018-11-23 12:19:44,873 INFO L273 TraceCheckUtils]: 36: Hoare triple {36035#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36035#(<= main_~i~1 15)} is VALID [2018-11-23 12:19:44,874 INFO L273 TraceCheckUtils]: 37: Hoare triple {36035#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36036#(<= main_~i~1 16)} is VALID [2018-11-23 12:19:44,875 INFO L273 TraceCheckUtils]: 38: Hoare triple {36036#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36036#(<= main_~i~1 16)} is VALID [2018-11-23 12:19:44,875 INFO L273 TraceCheckUtils]: 39: Hoare triple {36036#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36037#(<= main_~i~1 17)} is VALID [2018-11-23 12:19:44,876 INFO L273 TraceCheckUtils]: 40: Hoare triple {36037#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36037#(<= main_~i~1 17)} is VALID [2018-11-23 12:19:44,876 INFO L273 TraceCheckUtils]: 41: Hoare triple {36037#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36038#(<= main_~i~1 18)} is VALID [2018-11-23 12:19:44,877 INFO L273 TraceCheckUtils]: 42: Hoare triple {36038#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36038#(<= main_~i~1 18)} is VALID [2018-11-23 12:19:44,878 INFO L273 TraceCheckUtils]: 43: Hoare triple {36038#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36039#(<= main_~i~1 19)} is VALID [2018-11-23 12:19:44,878 INFO L273 TraceCheckUtils]: 44: Hoare triple {36039#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36039#(<= main_~i~1 19)} is VALID [2018-11-23 12:19:44,879 INFO L273 TraceCheckUtils]: 45: Hoare triple {36039#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36040#(<= main_~i~1 20)} is VALID [2018-11-23 12:19:44,879 INFO L273 TraceCheckUtils]: 46: Hoare triple {36040#(<= main_~i~1 20)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36040#(<= main_~i~1 20)} is VALID [2018-11-23 12:19:44,880 INFO L273 TraceCheckUtils]: 47: Hoare triple {36040#(<= main_~i~1 20)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36041#(<= main_~i~1 21)} is VALID [2018-11-23 12:19:44,880 INFO L273 TraceCheckUtils]: 48: Hoare triple {36041#(<= main_~i~1 21)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36041#(<= main_~i~1 21)} is VALID [2018-11-23 12:19:44,881 INFO L273 TraceCheckUtils]: 49: Hoare triple {36041#(<= main_~i~1 21)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36042#(<= main_~i~1 22)} is VALID [2018-11-23 12:19:44,882 INFO L273 TraceCheckUtils]: 50: Hoare triple {36042#(<= main_~i~1 22)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36042#(<= main_~i~1 22)} is VALID [2018-11-23 12:19:44,882 INFO L273 TraceCheckUtils]: 51: Hoare triple {36042#(<= main_~i~1 22)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36043#(<= main_~i~1 23)} is VALID [2018-11-23 12:19:44,883 INFO L273 TraceCheckUtils]: 52: Hoare triple {36043#(<= main_~i~1 23)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36043#(<= main_~i~1 23)} is VALID [2018-11-23 12:19:44,883 INFO L273 TraceCheckUtils]: 53: Hoare triple {36043#(<= main_~i~1 23)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36044#(<= main_~i~1 24)} is VALID [2018-11-23 12:19:44,884 INFO L273 TraceCheckUtils]: 54: Hoare triple {36044#(<= main_~i~1 24)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36044#(<= main_~i~1 24)} is VALID [2018-11-23 12:19:44,885 INFO L273 TraceCheckUtils]: 55: Hoare triple {36044#(<= main_~i~1 24)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36045#(<= main_~i~1 25)} is VALID [2018-11-23 12:19:44,885 INFO L273 TraceCheckUtils]: 56: Hoare triple {36045#(<= main_~i~1 25)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36045#(<= main_~i~1 25)} is VALID [2018-11-23 12:19:44,886 INFO L273 TraceCheckUtils]: 57: Hoare triple {36045#(<= main_~i~1 25)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36046#(<= main_~i~1 26)} is VALID [2018-11-23 12:19:44,886 INFO L273 TraceCheckUtils]: 58: Hoare triple {36046#(<= main_~i~1 26)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36046#(<= main_~i~1 26)} is VALID [2018-11-23 12:19:44,887 INFO L273 TraceCheckUtils]: 59: Hoare triple {36046#(<= main_~i~1 26)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36047#(<= main_~i~1 27)} is VALID [2018-11-23 12:19:44,888 INFO L273 TraceCheckUtils]: 60: Hoare triple {36047#(<= main_~i~1 27)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36047#(<= main_~i~1 27)} is VALID [2018-11-23 12:19:44,888 INFO L273 TraceCheckUtils]: 61: Hoare triple {36047#(<= main_~i~1 27)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36048#(<= main_~i~1 28)} is VALID [2018-11-23 12:19:44,889 INFO L273 TraceCheckUtils]: 62: Hoare triple {36048#(<= main_~i~1 28)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36048#(<= main_~i~1 28)} is VALID [2018-11-23 12:19:44,889 INFO L273 TraceCheckUtils]: 63: Hoare triple {36048#(<= main_~i~1 28)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36049#(<= main_~i~1 29)} is VALID [2018-11-23 12:19:44,890 INFO L273 TraceCheckUtils]: 64: Hoare triple {36049#(<= main_~i~1 29)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36049#(<= main_~i~1 29)} is VALID [2018-11-23 12:19:44,891 INFO L273 TraceCheckUtils]: 65: Hoare triple {36049#(<= main_~i~1 29)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36050#(<= main_~i~1 30)} is VALID [2018-11-23 12:19:44,891 INFO L273 TraceCheckUtils]: 66: Hoare triple {36050#(<= main_~i~1 30)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36050#(<= main_~i~1 30)} is VALID [2018-11-23 12:19:44,892 INFO L273 TraceCheckUtils]: 67: Hoare triple {36050#(<= main_~i~1 30)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36051#(<= main_~i~1 31)} is VALID [2018-11-23 12:19:44,892 INFO L273 TraceCheckUtils]: 68: Hoare triple {36051#(<= main_~i~1 31)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36051#(<= main_~i~1 31)} is VALID [2018-11-23 12:19:44,893 INFO L273 TraceCheckUtils]: 69: Hoare triple {36051#(<= main_~i~1 31)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36052#(<= main_~i~1 32)} is VALID [2018-11-23 12:19:44,894 INFO L273 TraceCheckUtils]: 70: Hoare triple {36052#(<= main_~i~1 32)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36052#(<= main_~i~1 32)} is VALID [2018-11-23 12:19:44,894 INFO L273 TraceCheckUtils]: 71: Hoare triple {36052#(<= main_~i~1 32)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36053#(<= main_~i~1 33)} is VALID [2018-11-23 12:19:44,895 INFO L273 TraceCheckUtils]: 72: Hoare triple {36053#(<= main_~i~1 33)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36053#(<= main_~i~1 33)} is VALID [2018-11-23 12:19:44,895 INFO L273 TraceCheckUtils]: 73: Hoare triple {36053#(<= main_~i~1 33)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36054#(<= main_~i~1 34)} is VALID [2018-11-23 12:19:44,896 INFO L273 TraceCheckUtils]: 74: Hoare triple {36054#(<= main_~i~1 34)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36054#(<= main_~i~1 34)} is VALID [2018-11-23 12:19:44,897 INFO L273 TraceCheckUtils]: 75: Hoare triple {36054#(<= main_~i~1 34)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36055#(<= main_~i~1 35)} is VALID [2018-11-23 12:19:44,897 INFO L273 TraceCheckUtils]: 76: Hoare triple {36055#(<= main_~i~1 35)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36055#(<= main_~i~1 35)} is VALID [2018-11-23 12:19:44,898 INFO L273 TraceCheckUtils]: 77: Hoare triple {36055#(<= main_~i~1 35)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36056#(<= main_~i~1 36)} is VALID [2018-11-23 12:19:44,898 INFO L273 TraceCheckUtils]: 78: Hoare triple {36056#(<= main_~i~1 36)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36056#(<= main_~i~1 36)} is VALID [2018-11-23 12:19:44,899 INFO L273 TraceCheckUtils]: 79: Hoare triple {36056#(<= main_~i~1 36)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36057#(<= main_~i~1 37)} is VALID [2018-11-23 12:19:44,900 INFO L273 TraceCheckUtils]: 80: Hoare triple {36057#(<= main_~i~1 37)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36057#(<= main_~i~1 37)} is VALID [2018-11-23 12:19:44,900 INFO L273 TraceCheckUtils]: 81: Hoare triple {36057#(<= main_~i~1 37)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36058#(<= main_~i~1 38)} is VALID [2018-11-23 12:19:44,901 INFO L273 TraceCheckUtils]: 82: Hoare triple {36058#(<= main_~i~1 38)} assume !(~i~1 < 60); {36019#false} is VALID [2018-11-23 12:19:44,901 INFO L256 TraceCheckUtils]: 83: Hoare triple {36019#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {36018#true} is VALID [2018-11-23 12:19:44,901 INFO L273 TraceCheckUtils]: 84: Hoare triple {36018#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {36018#true} is VALID [2018-11-23 12:19:44,901 INFO L273 TraceCheckUtils]: 85: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,902 INFO L273 TraceCheckUtils]: 86: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,902 INFO L273 TraceCheckUtils]: 87: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,902 INFO L273 TraceCheckUtils]: 88: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,902 INFO L273 TraceCheckUtils]: 89: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,902 INFO L273 TraceCheckUtils]: 90: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,902 INFO L273 TraceCheckUtils]: 91: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,903 INFO L273 TraceCheckUtils]: 92: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,903 INFO L273 TraceCheckUtils]: 93: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,903 INFO L273 TraceCheckUtils]: 94: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,903 INFO L273 TraceCheckUtils]: 95: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,903 INFO L273 TraceCheckUtils]: 96: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,903 INFO L273 TraceCheckUtils]: 97: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,904 INFO L273 TraceCheckUtils]: 98: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,904 INFO L273 TraceCheckUtils]: 99: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,904 INFO L273 TraceCheckUtils]: 100: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,904 INFO L273 TraceCheckUtils]: 101: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,904 INFO L273 TraceCheckUtils]: 102: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,904 INFO L273 TraceCheckUtils]: 103: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,904 INFO L273 TraceCheckUtils]: 104: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,905 INFO L273 TraceCheckUtils]: 105: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,905 INFO L273 TraceCheckUtils]: 106: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,905 INFO L273 TraceCheckUtils]: 107: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,905 INFO L273 TraceCheckUtils]: 108: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,905 INFO L273 TraceCheckUtils]: 109: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,905 INFO L273 TraceCheckUtils]: 110: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,905 INFO L273 TraceCheckUtils]: 111: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,905 INFO L273 TraceCheckUtils]: 112: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,905 INFO L273 TraceCheckUtils]: 113: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,905 INFO L273 TraceCheckUtils]: 114: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,906 INFO L273 TraceCheckUtils]: 115: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,906 INFO L273 TraceCheckUtils]: 116: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,906 INFO L273 TraceCheckUtils]: 117: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,906 INFO L273 TraceCheckUtils]: 118: Hoare triple {36018#true} assume !(~i~0 < 60); {36018#true} is VALID [2018-11-23 12:19:44,906 INFO L273 TraceCheckUtils]: 119: Hoare triple {36018#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {36018#true} is VALID [2018-11-23 12:19:44,906 INFO L273 TraceCheckUtils]: 120: Hoare triple {36018#true} assume true; {36018#true} is VALID [2018-11-23 12:19:44,906 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {36018#true} {36019#false} #75#return; {36019#false} is VALID [2018-11-23 12:19:44,906 INFO L273 TraceCheckUtils]: 122: Hoare triple {36019#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {36019#false} is VALID [2018-11-23 12:19:44,906 INFO L256 TraceCheckUtils]: 123: Hoare triple {36019#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {36018#true} is VALID [2018-11-23 12:19:44,906 INFO L273 TraceCheckUtils]: 124: Hoare triple {36018#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {36018#true} is VALID [2018-11-23 12:19:44,907 INFO L273 TraceCheckUtils]: 125: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,907 INFO L273 TraceCheckUtils]: 126: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,907 INFO L273 TraceCheckUtils]: 127: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,907 INFO L273 TraceCheckUtils]: 128: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,907 INFO L273 TraceCheckUtils]: 129: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,907 INFO L273 TraceCheckUtils]: 130: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,907 INFO L273 TraceCheckUtils]: 131: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,907 INFO L273 TraceCheckUtils]: 132: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,907 INFO L273 TraceCheckUtils]: 133: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,907 INFO L273 TraceCheckUtils]: 134: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,908 INFO L273 TraceCheckUtils]: 135: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,908 INFO L273 TraceCheckUtils]: 136: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,908 INFO L273 TraceCheckUtils]: 137: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,908 INFO L273 TraceCheckUtils]: 138: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,908 INFO L273 TraceCheckUtils]: 139: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,908 INFO L273 TraceCheckUtils]: 140: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,908 INFO L273 TraceCheckUtils]: 141: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,908 INFO L273 TraceCheckUtils]: 142: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,908 INFO L273 TraceCheckUtils]: 143: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,908 INFO L273 TraceCheckUtils]: 144: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,909 INFO L273 TraceCheckUtils]: 145: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,909 INFO L273 TraceCheckUtils]: 146: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,909 INFO L273 TraceCheckUtils]: 147: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,909 INFO L273 TraceCheckUtils]: 148: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,909 INFO L273 TraceCheckUtils]: 149: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,909 INFO L273 TraceCheckUtils]: 150: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,909 INFO L273 TraceCheckUtils]: 151: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,909 INFO L273 TraceCheckUtils]: 152: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,909 INFO L273 TraceCheckUtils]: 153: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,909 INFO L273 TraceCheckUtils]: 154: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,910 INFO L273 TraceCheckUtils]: 155: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,910 INFO L273 TraceCheckUtils]: 156: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,910 INFO L273 TraceCheckUtils]: 157: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,910 INFO L273 TraceCheckUtils]: 158: Hoare triple {36018#true} assume !(~i~0 < 60); {36018#true} is VALID [2018-11-23 12:19:44,910 INFO L273 TraceCheckUtils]: 159: Hoare triple {36018#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {36018#true} is VALID [2018-11-23 12:19:44,910 INFO L273 TraceCheckUtils]: 160: Hoare triple {36018#true} assume true; {36018#true} is VALID [2018-11-23 12:19:44,910 INFO L268 TraceCheckUtils]: 161: Hoare quadruple {36018#true} {36019#false} #77#return; {36019#false} is VALID [2018-11-23 12:19:44,910 INFO L273 TraceCheckUtils]: 162: Hoare triple {36019#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {36019#false} is VALID [2018-11-23 12:19:44,910 INFO L273 TraceCheckUtils]: 163: Hoare triple {36019#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {36019#false} is VALID [2018-11-23 12:19:44,910 INFO L273 TraceCheckUtils]: 164: Hoare triple {36019#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {36019#false} is VALID [2018-11-23 12:19:44,911 INFO L273 TraceCheckUtils]: 165: Hoare triple {36019#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {36019#false} is VALID [2018-11-23 12:19:44,911 INFO L273 TraceCheckUtils]: 166: Hoare triple {36019#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {36019#false} is VALID [2018-11-23 12:19:44,911 INFO L273 TraceCheckUtils]: 167: Hoare triple {36019#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {36019#false} is VALID [2018-11-23 12:19:44,911 INFO L273 TraceCheckUtils]: 168: Hoare triple {36019#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {36019#false} is VALID [2018-11-23 12:19:44,911 INFO L273 TraceCheckUtils]: 169: Hoare triple {36019#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {36019#false} is VALID [2018-11-23 12:19:44,911 INFO L273 TraceCheckUtils]: 170: Hoare triple {36019#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {36019#false} is VALID [2018-11-23 12:19:44,911 INFO L273 TraceCheckUtils]: 171: Hoare triple {36019#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {36019#false} is VALID [2018-11-23 12:19:44,911 INFO L273 TraceCheckUtils]: 172: Hoare triple {36019#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {36019#false} is VALID [2018-11-23 12:19:44,911 INFO L273 TraceCheckUtils]: 173: Hoare triple {36019#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {36019#false} is VALID [2018-11-23 12:19:44,911 INFO L273 TraceCheckUtils]: 174: Hoare triple {36019#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {36019#false} is VALID [2018-11-23 12:19:44,912 INFO L273 TraceCheckUtils]: 175: Hoare triple {36019#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {36019#false} is VALID [2018-11-23 12:19:44,912 INFO L273 TraceCheckUtils]: 176: Hoare triple {36019#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {36019#false} is VALID [2018-11-23 12:19:44,912 INFO L273 TraceCheckUtils]: 177: Hoare triple {36019#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {36019#false} is VALID [2018-11-23 12:19:44,912 INFO L273 TraceCheckUtils]: 178: Hoare triple {36019#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {36019#false} is VALID [2018-11-23 12:19:44,912 INFO L273 TraceCheckUtils]: 179: Hoare triple {36019#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {36019#false} is VALID [2018-11-23 12:19:44,912 INFO L273 TraceCheckUtils]: 180: Hoare triple {36019#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {36019#false} is VALID [2018-11-23 12:19:44,912 INFO L273 TraceCheckUtils]: 181: Hoare triple {36019#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {36019#false} is VALID [2018-11-23 12:19:44,912 INFO L273 TraceCheckUtils]: 182: Hoare triple {36019#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {36019#false} is VALID [2018-11-23 12:19:44,912 INFO L273 TraceCheckUtils]: 183: Hoare triple {36019#false} assume !(~i~2 < 59); {36019#false} is VALID [2018-11-23 12:19:44,912 INFO L273 TraceCheckUtils]: 184: Hoare triple {36019#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {36019#false} is VALID [2018-11-23 12:19:44,913 INFO L256 TraceCheckUtils]: 185: Hoare triple {36019#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {36018#true} is VALID [2018-11-23 12:19:44,913 INFO L273 TraceCheckUtils]: 186: Hoare triple {36018#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {36018#true} is VALID [2018-11-23 12:19:44,913 INFO L273 TraceCheckUtils]: 187: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,913 INFO L273 TraceCheckUtils]: 188: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,913 INFO L273 TraceCheckUtils]: 189: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,913 INFO L273 TraceCheckUtils]: 190: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,913 INFO L273 TraceCheckUtils]: 191: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,913 INFO L273 TraceCheckUtils]: 192: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,913 INFO L273 TraceCheckUtils]: 193: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,913 INFO L273 TraceCheckUtils]: 194: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,914 INFO L273 TraceCheckUtils]: 195: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,914 INFO L273 TraceCheckUtils]: 196: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,914 INFO L273 TraceCheckUtils]: 197: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,914 INFO L273 TraceCheckUtils]: 198: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,914 INFO L273 TraceCheckUtils]: 199: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,914 INFO L273 TraceCheckUtils]: 200: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,914 INFO L273 TraceCheckUtils]: 201: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,914 INFO L273 TraceCheckUtils]: 202: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,914 INFO L273 TraceCheckUtils]: 203: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,914 INFO L273 TraceCheckUtils]: 204: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,915 INFO L273 TraceCheckUtils]: 205: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,915 INFO L273 TraceCheckUtils]: 206: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,915 INFO L273 TraceCheckUtils]: 207: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,915 INFO L273 TraceCheckUtils]: 208: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,915 INFO L273 TraceCheckUtils]: 209: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,915 INFO L273 TraceCheckUtils]: 210: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,915 INFO L273 TraceCheckUtils]: 211: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,915 INFO L273 TraceCheckUtils]: 212: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,915 INFO L273 TraceCheckUtils]: 213: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,915 INFO L273 TraceCheckUtils]: 214: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,916 INFO L273 TraceCheckUtils]: 215: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,916 INFO L273 TraceCheckUtils]: 216: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,916 INFO L273 TraceCheckUtils]: 217: Hoare triple {36018#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36018#true} is VALID [2018-11-23 12:19:44,916 INFO L273 TraceCheckUtils]: 218: Hoare triple {36018#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36018#true} is VALID [2018-11-23 12:19:44,916 INFO L273 TraceCheckUtils]: 219: Hoare triple {36018#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36018#true} is VALID [2018-11-23 12:19:44,916 INFO L273 TraceCheckUtils]: 220: Hoare triple {36018#true} assume !(~i~0 < 60); {36018#true} is VALID [2018-11-23 12:19:44,916 INFO L273 TraceCheckUtils]: 221: Hoare triple {36018#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {36018#true} is VALID [2018-11-23 12:19:44,916 INFO L273 TraceCheckUtils]: 222: Hoare triple {36018#true} assume true; {36018#true} is VALID [2018-11-23 12:19:44,916 INFO L268 TraceCheckUtils]: 223: Hoare quadruple {36018#true} {36019#false} #79#return; {36019#false} is VALID [2018-11-23 12:19:44,916 INFO L273 TraceCheckUtils]: 224: Hoare triple {36019#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {36019#false} is VALID [2018-11-23 12:19:44,917 INFO L273 TraceCheckUtils]: 225: Hoare triple {36019#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {36019#false} is VALID [2018-11-23 12:19:44,917 INFO L273 TraceCheckUtils]: 226: Hoare triple {36019#false} assume !false; {36019#false} is VALID [2018-11-23 12:19:44,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3242 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1798 trivial. 0 not checked. [2018-11-23 12:19:44,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:19:44,938 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:19:44,947 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:19:45,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:19:45,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:19:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:45,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:19:46,207 INFO L256 TraceCheckUtils]: 0: Hoare triple {36018#true} call ULTIMATE.init(); {36018#true} is VALID [2018-11-23 12:19:46,208 INFO L273 TraceCheckUtils]: 1: Hoare triple {36018#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36018#true} is VALID [2018-11-23 12:19:46,208 INFO L273 TraceCheckUtils]: 2: Hoare triple {36018#true} assume true; {36018#true} is VALID [2018-11-23 12:19:46,208 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36018#true} {36018#true} #71#return; {36018#true} is VALID [2018-11-23 12:19:46,208 INFO L256 TraceCheckUtils]: 4: Hoare triple {36018#true} call #t~ret14 := main(); {36018#true} is VALID [2018-11-23 12:19:46,209 INFO L273 TraceCheckUtils]: 5: Hoare triple {36018#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {36077#(<= main_~i~1 0)} is VALID [2018-11-23 12:19:46,210 INFO L273 TraceCheckUtils]: 6: Hoare triple {36077#(<= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36077#(<= main_~i~1 0)} is VALID [2018-11-23 12:19:46,210 INFO L273 TraceCheckUtils]: 7: Hoare triple {36077#(<= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36021#(<= main_~i~1 1)} is VALID [2018-11-23 12:19:46,210 INFO L273 TraceCheckUtils]: 8: Hoare triple {36021#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36021#(<= main_~i~1 1)} is VALID [2018-11-23 12:19:46,211 INFO L273 TraceCheckUtils]: 9: Hoare triple {36021#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36022#(<= main_~i~1 2)} is VALID [2018-11-23 12:19:46,211 INFO L273 TraceCheckUtils]: 10: Hoare triple {36022#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36022#(<= main_~i~1 2)} is VALID [2018-11-23 12:19:46,211 INFO L273 TraceCheckUtils]: 11: Hoare triple {36022#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36023#(<= main_~i~1 3)} is VALID [2018-11-23 12:19:46,212 INFO L273 TraceCheckUtils]: 12: Hoare triple {36023#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36023#(<= main_~i~1 3)} is VALID [2018-11-23 12:19:46,213 INFO L273 TraceCheckUtils]: 13: Hoare triple {36023#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36024#(<= main_~i~1 4)} is VALID [2018-11-23 12:19:46,213 INFO L273 TraceCheckUtils]: 14: Hoare triple {36024#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36024#(<= main_~i~1 4)} is VALID [2018-11-23 12:19:46,214 INFO L273 TraceCheckUtils]: 15: Hoare triple {36024#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36025#(<= main_~i~1 5)} is VALID [2018-11-23 12:19:46,214 INFO L273 TraceCheckUtils]: 16: Hoare triple {36025#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36025#(<= main_~i~1 5)} is VALID [2018-11-23 12:19:46,215 INFO L273 TraceCheckUtils]: 17: Hoare triple {36025#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36026#(<= main_~i~1 6)} is VALID [2018-11-23 12:19:46,215 INFO L273 TraceCheckUtils]: 18: Hoare triple {36026#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36026#(<= main_~i~1 6)} is VALID [2018-11-23 12:19:46,216 INFO L273 TraceCheckUtils]: 19: Hoare triple {36026#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36027#(<= main_~i~1 7)} is VALID [2018-11-23 12:19:46,217 INFO L273 TraceCheckUtils]: 20: Hoare triple {36027#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36027#(<= main_~i~1 7)} is VALID [2018-11-23 12:19:46,217 INFO L273 TraceCheckUtils]: 21: Hoare triple {36027#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36028#(<= main_~i~1 8)} is VALID [2018-11-23 12:19:46,218 INFO L273 TraceCheckUtils]: 22: Hoare triple {36028#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36028#(<= main_~i~1 8)} is VALID [2018-11-23 12:19:46,218 INFO L273 TraceCheckUtils]: 23: Hoare triple {36028#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36029#(<= main_~i~1 9)} is VALID [2018-11-23 12:19:46,219 INFO L273 TraceCheckUtils]: 24: Hoare triple {36029#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36029#(<= main_~i~1 9)} is VALID [2018-11-23 12:19:46,220 INFO L273 TraceCheckUtils]: 25: Hoare triple {36029#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36030#(<= main_~i~1 10)} is VALID [2018-11-23 12:19:46,220 INFO L273 TraceCheckUtils]: 26: Hoare triple {36030#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36030#(<= main_~i~1 10)} is VALID [2018-11-23 12:19:46,221 INFO L273 TraceCheckUtils]: 27: Hoare triple {36030#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36031#(<= main_~i~1 11)} is VALID [2018-11-23 12:19:46,221 INFO L273 TraceCheckUtils]: 28: Hoare triple {36031#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36031#(<= main_~i~1 11)} is VALID [2018-11-23 12:19:46,222 INFO L273 TraceCheckUtils]: 29: Hoare triple {36031#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36032#(<= main_~i~1 12)} is VALID [2018-11-23 12:19:46,222 INFO L273 TraceCheckUtils]: 30: Hoare triple {36032#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36032#(<= main_~i~1 12)} is VALID [2018-11-23 12:19:46,223 INFO L273 TraceCheckUtils]: 31: Hoare triple {36032#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36033#(<= main_~i~1 13)} is VALID [2018-11-23 12:19:46,224 INFO L273 TraceCheckUtils]: 32: Hoare triple {36033#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36033#(<= main_~i~1 13)} is VALID [2018-11-23 12:19:46,224 INFO L273 TraceCheckUtils]: 33: Hoare triple {36033#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36034#(<= main_~i~1 14)} is VALID [2018-11-23 12:19:46,225 INFO L273 TraceCheckUtils]: 34: Hoare triple {36034#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36034#(<= main_~i~1 14)} is VALID [2018-11-23 12:19:46,225 INFO L273 TraceCheckUtils]: 35: Hoare triple {36034#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36035#(<= main_~i~1 15)} is VALID [2018-11-23 12:19:46,226 INFO L273 TraceCheckUtils]: 36: Hoare triple {36035#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36035#(<= main_~i~1 15)} is VALID [2018-11-23 12:19:46,227 INFO L273 TraceCheckUtils]: 37: Hoare triple {36035#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36036#(<= main_~i~1 16)} is VALID [2018-11-23 12:19:46,227 INFO L273 TraceCheckUtils]: 38: Hoare triple {36036#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36036#(<= main_~i~1 16)} is VALID [2018-11-23 12:19:46,228 INFO L273 TraceCheckUtils]: 39: Hoare triple {36036#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36037#(<= main_~i~1 17)} is VALID [2018-11-23 12:19:46,228 INFO L273 TraceCheckUtils]: 40: Hoare triple {36037#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36037#(<= main_~i~1 17)} is VALID [2018-11-23 12:19:46,229 INFO L273 TraceCheckUtils]: 41: Hoare triple {36037#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36038#(<= main_~i~1 18)} is VALID [2018-11-23 12:19:46,229 INFO L273 TraceCheckUtils]: 42: Hoare triple {36038#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36038#(<= main_~i~1 18)} is VALID [2018-11-23 12:19:46,230 INFO L273 TraceCheckUtils]: 43: Hoare triple {36038#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36039#(<= main_~i~1 19)} is VALID [2018-11-23 12:19:46,231 INFO L273 TraceCheckUtils]: 44: Hoare triple {36039#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36039#(<= main_~i~1 19)} is VALID [2018-11-23 12:19:46,231 INFO L273 TraceCheckUtils]: 45: Hoare triple {36039#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36040#(<= main_~i~1 20)} is VALID [2018-11-23 12:19:46,232 INFO L273 TraceCheckUtils]: 46: Hoare triple {36040#(<= main_~i~1 20)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36040#(<= main_~i~1 20)} is VALID [2018-11-23 12:19:46,233 INFO L273 TraceCheckUtils]: 47: Hoare triple {36040#(<= main_~i~1 20)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36041#(<= main_~i~1 21)} is VALID [2018-11-23 12:19:46,233 INFO L273 TraceCheckUtils]: 48: Hoare triple {36041#(<= main_~i~1 21)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36041#(<= main_~i~1 21)} is VALID [2018-11-23 12:19:46,234 INFO L273 TraceCheckUtils]: 49: Hoare triple {36041#(<= main_~i~1 21)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36042#(<= main_~i~1 22)} is VALID [2018-11-23 12:19:46,234 INFO L273 TraceCheckUtils]: 50: Hoare triple {36042#(<= main_~i~1 22)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36042#(<= main_~i~1 22)} is VALID [2018-11-23 12:19:46,235 INFO L273 TraceCheckUtils]: 51: Hoare triple {36042#(<= main_~i~1 22)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36043#(<= main_~i~1 23)} is VALID [2018-11-23 12:19:46,235 INFO L273 TraceCheckUtils]: 52: Hoare triple {36043#(<= main_~i~1 23)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36043#(<= main_~i~1 23)} is VALID [2018-11-23 12:19:46,236 INFO L273 TraceCheckUtils]: 53: Hoare triple {36043#(<= main_~i~1 23)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36044#(<= main_~i~1 24)} is VALID [2018-11-23 12:19:46,237 INFO L273 TraceCheckUtils]: 54: Hoare triple {36044#(<= main_~i~1 24)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36044#(<= main_~i~1 24)} is VALID [2018-11-23 12:19:46,237 INFO L273 TraceCheckUtils]: 55: Hoare triple {36044#(<= main_~i~1 24)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36045#(<= main_~i~1 25)} is VALID [2018-11-23 12:19:46,238 INFO L273 TraceCheckUtils]: 56: Hoare triple {36045#(<= main_~i~1 25)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36045#(<= main_~i~1 25)} is VALID [2018-11-23 12:19:46,238 INFO L273 TraceCheckUtils]: 57: Hoare triple {36045#(<= main_~i~1 25)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36046#(<= main_~i~1 26)} is VALID [2018-11-23 12:19:46,239 INFO L273 TraceCheckUtils]: 58: Hoare triple {36046#(<= main_~i~1 26)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36046#(<= main_~i~1 26)} is VALID [2018-11-23 12:19:46,240 INFO L273 TraceCheckUtils]: 59: Hoare triple {36046#(<= main_~i~1 26)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36047#(<= main_~i~1 27)} is VALID [2018-11-23 12:19:46,240 INFO L273 TraceCheckUtils]: 60: Hoare triple {36047#(<= main_~i~1 27)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36047#(<= main_~i~1 27)} is VALID [2018-11-23 12:19:46,241 INFO L273 TraceCheckUtils]: 61: Hoare triple {36047#(<= main_~i~1 27)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36048#(<= main_~i~1 28)} is VALID [2018-11-23 12:19:46,241 INFO L273 TraceCheckUtils]: 62: Hoare triple {36048#(<= main_~i~1 28)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36048#(<= main_~i~1 28)} is VALID [2018-11-23 12:19:46,242 INFO L273 TraceCheckUtils]: 63: Hoare triple {36048#(<= main_~i~1 28)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36049#(<= main_~i~1 29)} is VALID [2018-11-23 12:19:46,242 INFO L273 TraceCheckUtils]: 64: Hoare triple {36049#(<= main_~i~1 29)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36049#(<= main_~i~1 29)} is VALID [2018-11-23 12:19:46,243 INFO L273 TraceCheckUtils]: 65: Hoare triple {36049#(<= main_~i~1 29)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36050#(<= main_~i~1 30)} is VALID [2018-11-23 12:19:46,244 INFO L273 TraceCheckUtils]: 66: Hoare triple {36050#(<= main_~i~1 30)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36050#(<= main_~i~1 30)} is VALID [2018-11-23 12:19:46,244 INFO L273 TraceCheckUtils]: 67: Hoare triple {36050#(<= main_~i~1 30)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36051#(<= main_~i~1 31)} is VALID [2018-11-23 12:19:46,245 INFO L273 TraceCheckUtils]: 68: Hoare triple {36051#(<= main_~i~1 31)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36051#(<= main_~i~1 31)} is VALID [2018-11-23 12:19:46,245 INFO L273 TraceCheckUtils]: 69: Hoare triple {36051#(<= main_~i~1 31)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36052#(<= main_~i~1 32)} is VALID [2018-11-23 12:19:46,246 INFO L273 TraceCheckUtils]: 70: Hoare triple {36052#(<= main_~i~1 32)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36052#(<= main_~i~1 32)} is VALID [2018-11-23 12:19:46,247 INFO L273 TraceCheckUtils]: 71: Hoare triple {36052#(<= main_~i~1 32)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36053#(<= main_~i~1 33)} is VALID [2018-11-23 12:19:46,247 INFO L273 TraceCheckUtils]: 72: Hoare triple {36053#(<= main_~i~1 33)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36053#(<= main_~i~1 33)} is VALID [2018-11-23 12:19:46,248 INFO L273 TraceCheckUtils]: 73: Hoare triple {36053#(<= main_~i~1 33)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36054#(<= main_~i~1 34)} is VALID [2018-11-23 12:19:46,248 INFO L273 TraceCheckUtils]: 74: Hoare triple {36054#(<= main_~i~1 34)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36054#(<= main_~i~1 34)} is VALID [2018-11-23 12:19:46,249 INFO L273 TraceCheckUtils]: 75: Hoare triple {36054#(<= main_~i~1 34)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36055#(<= main_~i~1 35)} is VALID [2018-11-23 12:19:46,250 INFO L273 TraceCheckUtils]: 76: Hoare triple {36055#(<= main_~i~1 35)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36055#(<= main_~i~1 35)} is VALID [2018-11-23 12:19:46,250 INFO L273 TraceCheckUtils]: 77: Hoare triple {36055#(<= main_~i~1 35)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36056#(<= main_~i~1 36)} is VALID [2018-11-23 12:19:46,251 INFO L273 TraceCheckUtils]: 78: Hoare triple {36056#(<= main_~i~1 36)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36056#(<= main_~i~1 36)} is VALID [2018-11-23 12:19:46,251 INFO L273 TraceCheckUtils]: 79: Hoare triple {36056#(<= main_~i~1 36)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36057#(<= main_~i~1 37)} is VALID [2018-11-23 12:19:46,252 INFO L273 TraceCheckUtils]: 80: Hoare triple {36057#(<= main_~i~1 37)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {36057#(<= main_~i~1 37)} is VALID [2018-11-23 12:19:46,253 INFO L273 TraceCheckUtils]: 81: Hoare triple {36057#(<= main_~i~1 37)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36058#(<= main_~i~1 38)} is VALID [2018-11-23 12:19:46,253 INFO L273 TraceCheckUtils]: 82: Hoare triple {36058#(<= main_~i~1 38)} assume !(~i~1 < 60); {36019#false} is VALID [2018-11-23 12:19:46,253 INFO L256 TraceCheckUtils]: 83: Hoare triple {36019#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {36019#false} is VALID [2018-11-23 12:19:46,254 INFO L273 TraceCheckUtils]: 84: Hoare triple {36019#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {36019#false} is VALID [2018-11-23 12:19:46,254 INFO L273 TraceCheckUtils]: 85: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,254 INFO L273 TraceCheckUtils]: 86: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,254 INFO L273 TraceCheckUtils]: 87: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,254 INFO L273 TraceCheckUtils]: 88: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,254 INFO L273 TraceCheckUtils]: 89: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,255 INFO L273 TraceCheckUtils]: 90: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,255 INFO L273 TraceCheckUtils]: 91: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,255 INFO L273 TraceCheckUtils]: 92: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,255 INFO L273 TraceCheckUtils]: 93: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,255 INFO L273 TraceCheckUtils]: 94: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,255 INFO L273 TraceCheckUtils]: 95: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,256 INFO L273 TraceCheckUtils]: 96: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,256 INFO L273 TraceCheckUtils]: 97: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,256 INFO L273 TraceCheckUtils]: 98: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,256 INFO L273 TraceCheckUtils]: 99: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,256 INFO L273 TraceCheckUtils]: 100: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,256 INFO L273 TraceCheckUtils]: 101: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,257 INFO L273 TraceCheckUtils]: 102: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,257 INFO L273 TraceCheckUtils]: 103: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,257 INFO L273 TraceCheckUtils]: 104: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,257 INFO L273 TraceCheckUtils]: 105: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,257 INFO L273 TraceCheckUtils]: 106: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,257 INFO L273 TraceCheckUtils]: 107: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,258 INFO L273 TraceCheckUtils]: 108: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,258 INFO L273 TraceCheckUtils]: 109: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,258 INFO L273 TraceCheckUtils]: 110: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,258 INFO L273 TraceCheckUtils]: 111: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,258 INFO L273 TraceCheckUtils]: 112: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,258 INFO L273 TraceCheckUtils]: 113: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,259 INFO L273 TraceCheckUtils]: 114: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,259 INFO L273 TraceCheckUtils]: 115: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,259 INFO L273 TraceCheckUtils]: 116: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,259 INFO L273 TraceCheckUtils]: 117: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,259 INFO L273 TraceCheckUtils]: 118: Hoare triple {36019#false} assume !(~i~0 < 60); {36019#false} is VALID [2018-11-23 12:19:46,259 INFO L273 TraceCheckUtils]: 119: Hoare triple {36019#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {36019#false} is VALID [2018-11-23 12:19:46,259 INFO L273 TraceCheckUtils]: 120: Hoare triple {36019#false} assume true; {36019#false} is VALID [2018-11-23 12:19:46,259 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {36019#false} {36019#false} #75#return; {36019#false} is VALID [2018-11-23 12:19:46,259 INFO L273 TraceCheckUtils]: 122: Hoare triple {36019#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {36019#false} is VALID [2018-11-23 12:19:46,259 INFO L256 TraceCheckUtils]: 123: Hoare triple {36019#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {36019#false} is VALID [2018-11-23 12:19:46,260 INFO L273 TraceCheckUtils]: 124: Hoare triple {36019#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {36019#false} is VALID [2018-11-23 12:19:46,260 INFO L273 TraceCheckUtils]: 125: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,260 INFO L273 TraceCheckUtils]: 126: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,260 INFO L273 TraceCheckUtils]: 127: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,260 INFO L273 TraceCheckUtils]: 128: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,260 INFO L273 TraceCheckUtils]: 129: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,260 INFO L273 TraceCheckUtils]: 130: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,260 INFO L273 TraceCheckUtils]: 131: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,260 INFO L273 TraceCheckUtils]: 132: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,260 INFO L273 TraceCheckUtils]: 133: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,261 INFO L273 TraceCheckUtils]: 134: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,261 INFO L273 TraceCheckUtils]: 135: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,261 INFO L273 TraceCheckUtils]: 136: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,261 INFO L273 TraceCheckUtils]: 137: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,261 INFO L273 TraceCheckUtils]: 138: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,261 INFO L273 TraceCheckUtils]: 139: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,261 INFO L273 TraceCheckUtils]: 140: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,261 INFO L273 TraceCheckUtils]: 141: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,261 INFO L273 TraceCheckUtils]: 142: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,261 INFO L273 TraceCheckUtils]: 143: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,262 INFO L273 TraceCheckUtils]: 144: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,262 INFO L273 TraceCheckUtils]: 145: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,262 INFO L273 TraceCheckUtils]: 146: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,262 INFO L273 TraceCheckUtils]: 147: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,262 INFO L273 TraceCheckUtils]: 148: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,262 INFO L273 TraceCheckUtils]: 149: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,262 INFO L273 TraceCheckUtils]: 150: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,262 INFO L273 TraceCheckUtils]: 151: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,262 INFO L273 TraceCheckUtils]: 152: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,262 INFO L273 TraceCheckUtils]: 153: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,263 INFO L273 TraceCheckUtils]: 154: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,263 INFO L273 TraceCheckUtils]: 155: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,263 INFO L273 TraceCheckUtils]: 156: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,263 INFO L273 TraceCheckUtils]: 157: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,263 INFO L273 TraceCheckUtils]: 158: Hoare triple {36019#false} assume !(~i~0 < 60); {36019#false} is VALID [2018-11-23 12:19:46,263 INFO L273 TraceCheckUtils]: 159: Hoare triple {36019#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {36019#false} is VALID [2018-11-23 12:19:46,263 INFO L273 TraceCheckUtils]: 160: Hoare triple {36019#false} assume true; {36019#false} is VALID [2018-11-23 12:19:46,263 INFO L268 TraceCheckUtils]: 161: Hoare quadruple {36019#false} {36019#false} #77#return; {36019#false} is VALID [2018-11-23 12:19:46,263 INFO L273 TraceCheckUtils]: 162: Hoare triple {36019#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {36019#false} is VALID [2018-11-23 12:19:46,263 INFO L273 TraceCheckUtils]: 163: Hoare triple {36019#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {36019#false} is VALID [2018-11-23 12:19:46,264 INFO L273 TraceCheckUtils]: 164: Hoare triple {36019#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {36019#false} is VALID [2018-11-23 12:19:46,264 INFO L273 TraceCheckUtils]: 165: Hoare triple {36019#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {36019#false} is VALID [2018-11-23 12:19:46,264 INFO L273 TraceCheckUtils]: 166: Hoare triple {36019#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {36019#false} is VALID [2018-11-23 12:19:46,264 INFO L273 TraceCheckUtils]: 167: Hoare triple {36019#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {36019#false} is VALID [2018-11-23 12:19:46,264 INFO L273 TraceCheckUtils]: 168: Hoare triple {36019#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {36019#false} is VALID [2018-11-23 12:19:46,264 INFO L273 TraceCheckUtils]: 169: Hoare triple {36019#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {36019#false} is VALID [2018-11-23 12:19:46,264 INFO L273 TraceCheckUtils]: 170: Hoare triple {36019#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {36019#false} is VALID [2018-11-23 12:19:46,264 INFO L273 TraceCheckUtils]: 171: Hoare triple {36019#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {36019#false} is VALID [2018-11-23 12:19:46,264 INFO L273 TraceCheckUtils]: 172: Hoare triple {36019#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {36019#false} is VALID [2018-11-23 12:19:46,264 INFO L273 TraceCheckUtils]: 173: Hoare triple {36019#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {36019#false} is VALID [2018-11-23 12:19:46,265 INFO L273 TraceCheckUtils]: 174: Hoare triple {36019#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {36019#false} is VALID [2018-11-23 12:19:46,265 INFO L273 TraceCheckUtils]: 175: Hoare triple {36019#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {36019#false} is VALID [2018-11-23 12:19:46,265 INFO L273 TraceCheckUtils]: 176: Hoare triple {36019#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {36019#false} is VALID [2018-11-23 12:19:46,265 INFO L273 TraceCheckUtils]: 177: Hoare triple {36019#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {36019#false} is VALID [2018-11-23 12:19:46,265 INFO L273 TraceCheckUtils]: 178: Hoare triple {36019#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {36019#false} is VALID [2018-11-23 12:19:46,265 INFO L273 TraceCheckUtils]: 179: Hoare triple {36019#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {36019#false} is VALID [2018-11-23 12:19:46,265 INFO L273 TraceCheckUtils]: 180: Hoare triple {36019#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {36019#false} is VALID [2018-11-23 12:19:46,265 INFO L273 TraceCheckUtils]: 181: Hoare triple {36019#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {36019#false} is VALID [2018-11-23 12:19:46,265 INFO L273 TraceCheckUtils]: 182: Hoare triple {36019#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {36019#false} is VALID [2018-11-23 12:19:46,265 INFO L273 TraceCheckUtils]: 183: Hoare triple {36019#false} assume !(~i~2 < 59); {36019#false} is VALID [2018-11-23 12:19:46,266 INFO L273 TraceCheckUtils]: 184: Hoare triple {36019#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {36019#false} is VALID [2018-11-23 12:19:46,266 INFO L256 TraceCheckUtils]: 185: Hoare triple {36019#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {36019#false} is VALID [2018-11-23 12:19:46,266 INFO L273 TraceCheckUtils]: 186: Hoare triple {36019#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {36019#false} is VALID [2018-11-23 12:19:46,266 INFO L273 TraceCheckUtils]: 187: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,266 INFO L273 TraceCheckUtils]: 188: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,266 INFO L273 TraceCheckUtils]: 189: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,266 INFO L273 TraceCheckUtils]: 190: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,266 INFO L273 TraceCheckUtils]: 191: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,266 INFO L273 TraceCheckUtils]: 192: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,267 INFO L273 TraceCheckUtils]: 193: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,267 INFO L273 TraceCheckUtils]: 194: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,267 INFO L273 TraceCheckUtils]: 195: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,267 INFO L273 TraceCheckUtils]: 196: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,267 INFO L273 TraceCheckUtils]: 197: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,267 INFO L273 TraceCheckUtils]: 198: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,267 INFO L273 TraceCheckUtils]: 199: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,267 INFO L273 TraceCheckUtils]: 200: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,267 INFO L273 TraceCheckUtils]: 201: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,267 INFO L273 TraceCheckUtils]: 202: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,268 INFO L273 TraceCheckUtils]: 203: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,268 INFO L273 TraceCheckUtils]: 204: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,268 INFO L273 TraceCheckUtils]: 205: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,268 INFO L273 TraceCheckUtils]: 206: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,268 INFO L273 TraceCheckUtils]: 207: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,268 INFO L273 TraceCheckUtils]: 208: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,268 INFO L273 TraceCheckUtils]: 209: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,268 INFO L273 TraceCheckUtils]: 210: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,268 INFO L273 TraceCheckUtils]: 211: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,268 INFO L273 TraceCheckUtils]: 212: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,269 INFO L273 TraceCheckUtils]: 213: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,269 INFO L273 TraceCheckUtils]: 214: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,269 INFO L273 TraceCheckUtils]: 215: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,269 INFO L273 TraceCheckUtils]: 216: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,269 INFO L273 TraceCheckUtils]: 217: Hoare triple {36019#false} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {36019#false} is VALID [2018-11-23 12:19:46,269 INFO L273 TraceCheckUtils]: 218: Hoare triple {36019#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {36019#false} is VALID [2018-11-23 12:19:46,269 INFO L273 TraceCheckUtils]: 219: Hoare triple {36019#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {36019#false} is VALID [2018-11-23 12:19:46,269 INFO L273 TraceCheckUtils]: 220: Hoare triple {36019#false} assume !(~i~0 < 60); {36019#false} is VALID [2018-11-23 12:19:46,269 INFO L273 TraceCheckUtils]: 221: Hoare triple {36019#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {36019#false} is VALID [2018-11-23 12:19:46,269 INFO L273 TraceCheckUtils]: 222: Hoare triple {36019#false} assume true; {36019#false} is VALID [2018-11-23 12:19:46,270 INFO L268 TraceCheckUtils]: 223: Hoare quadruple {36019#false} {36019#false} #79#return; {36019#false} is VALID [2018-11-23 12:19:46,270 INFO L273 TraceCheckUtils]: 224: Hoare triple {36019#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {36019#false} is VALID [2018-11-23 12:19:46,270 INFO L273 TraceCheckUtils]: 225: Hoare triple {36019#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {36019#false} is VALID [2018-11-23 12:19:46,270 INFO L273 TraceCheckUtils]: 226: Hoare triple {36019#false} assume !false; {36019#false} is VALID [2018-11-23 12:19:46,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3242 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1798 trivial. 0 not checked. [2018-11-23 12:19:46,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:19:46,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-23 12:19:46,311 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 227 [2018-11-23 12:19:46,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:46,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:19:46,425 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-23 12:19:46,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:19:46,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:19:46,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:19:46,427 INFO L87 Difference]: Start difference. First operand 152 states and 167 transitions. Second operand 42 states. [2018-11-23 12:19:47,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:47,477 INFO L93 Difference]: Finished difference Result 224 states and 254 transitions. [2018-11-23 12:19:47,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 12:19:47,477 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 227 [2018-11-23 12:19:47,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:19:47,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 134 transitions. [2018-11-23 12:19:47,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:19:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 134 transitions. [2018-11-23 12:19:47,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 134 transitions. [2018-11-23 12:19:47,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:47,605 INFO L225 Difference]: With dead ends: 224 [2018-11-23 12:19:47,605 INFO L226 Difference]: Without dead ends: 155 [2018-11-23 12:19:47,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:19:47,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-23 12:19:47,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2018-11-23 12:19:47,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:47,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand 154 states. [2018-11-23 12:19:47,724 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 154 states. [2018-11-23 12:19:47,724 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 154 states. [2018-11-23 12:19:47,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:47,726 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2018-11-23 12:19:47,726 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 170 transitions. [2018-11-23 12:19:47,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:47,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:47,727 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 155 states. [2018-11-23 12:19:47,727 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 155 states. [2018-11-23 12:19:47,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:47,729 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2018-11-23 12:19:47,729 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 170 transitions. [2018-11-23 12:19:47,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:47,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:47,729 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:47,729 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:47,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-23 12:19:47,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 169 transitions. [2018-11-23 12:19:47,731 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 169 transitions. Word has length 227 [2018-11-23 12:19:47,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:47,732 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 169 transitions. [2018-11-23 12:19:47,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:19:47,732 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 169 transitions. [2018-11-23 12:19:47,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-23 12:19:47,733 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:47,733 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 33, 33, 33, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:19:47,734 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:47,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:47,734 INFO L82 PathProgramCache]: Analyzing trace with hash -570072795, now seen corresponding path program 39 times [2018-11-23 12:19:47,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:47,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:47,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:47,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:19:47,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:48,733 INFO L256 TraceCheckUtils]: 0: Hoare triple {37597#true} call ULTIMATE.init(); {37597#true} is VALID [2018-11-23 12:19:48,733 INFO L273 TraceCheckUtils]: 1: Hoare triple {37597#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37597#true} is VALID [2018-11-23 12:19:48,733 INFO L273 TraceCheckUtils]: 2: Hoare triple {37597#true} assume true; {37597#true} is VALID [2018-11-23 12:19:48,733 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37597#true} {37597#true} #71#return; {37597#true} is VALID [2018-11-23 12:19:48,733 INFO L256 TraceCheckUtils]: 4: Hoare triple {37597#true} call #t~ret14 := main(); {37597#true} is VALID [2018-11-23 12:19:48,734 INFO L273 TraceCheckUtils]: 5: Hoare triple {37597#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {37599#(= main_~i~1 0)} is VALID [2018-11-23 12:19:48,734 INFO L273 TraceCheckUtils]: 6: Hoare triple {37599#(= main_~i~1 0)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37599#(= main_~i~1 0)} is VALID [2018-11-23 12:19:48,734 INFO L273 TraceCheckUtils]: 7: Hoare triple {37599#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37600#(<= main_~i~1 1)} is VALID [2018-11-23 12:19:48,735 INFO L273 TraceCheckUtils]: 8: Hoare triple {37600#(<= main_~i~1 1)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37600#(<= main_~i~1 1)} is VALID [2018-11-23 12:19:48,735 INFO L273 TraceCheckUtils]: 9: Hoare triple {37600#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37601#(<= main_~i~1 2)} is VALID [2018-11-23 12:19:48,735 INFO L273 TraceCheckUtils]: 10: Hoare triple {37601#(<= main_~i~1 2)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37601#(<= main_~i~1 2)} is VALID [2018-11-23 12:19:48,736 INFO L273 TraceCheckUtils]: 11: Hoare triple {37601#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37602#(<= main_~i~1 3)} is VALID [2018-11-23 12:19:48,736 INFO L273 TraceCheckUtils]: 12: Hoare triple {37602#(<= main_~i~1 3)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37602#(<= main_~i~1 3)} is VALID [2018-11-23 12:19:48,737 INFO L273 TraceCheckUtils]: 13: Hoare triple {37602#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37603#(<= main_~i~1 4)} is VALID [2018-11-23 12:19:48,738 INFO L273 TraceCheckUtils]: 14: Hoare triple {37603#(<= main_~i~1 4)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37603#(<= main_~i~1 4)} is VALID [2018-11-23 12:19:48,738 INFO L273 TraceCheckUtils]: 15: Hoare triple {37603#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37604#(<= main_~i~1 5)} is VALID [2018-11-23 12:19:48,739 INFO L273 TraceCheckUtils]: 16: Hoare triple {37604#(<= main_~i~1 5)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37604#(<= main_~i~1 5)} is VALID [2018-11-23 12:19:48,739 INFO L273 TraceCheckUtils]: 17: Hoare triple {37604#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37605#(<= main_~i~1 6)} is VALID [2018-11-23 12:19:48,740 INFO L273 TraceCheckUtils]: 18: Hoare triple {37605#(<= main_~i~1 6)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37605#(<= main_~i~1 6)} is VALID [2018-11-23 12:19:48,741 INFO L273 TraceCheckUtils]: 19: Hoare triple {37605#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37606#(<= main_~i~1 7)} is VALID [2018-11-23 12:19:48,741 INFO L273 TraceCheckUtils]: 20: Hoare triple {37606#(<= main_~i~1 7)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37606#(<= main_~i~1 7)} is VALID [2018-11-23 12:19:48,742 INFO L273 TraceCheckUtils]: 21: Hoare triple {37606#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37607#(<= main_~i~1 8)} is VALID [2018-11-23 12:19:48,742 INFO L273 TraceCheckUtils]: 22: Hoare triple {37607#(<= main_~i~1 8)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37607#(<= main_~i~1 8)} is VALID [2018-11-23 12:19:48,743 INFO L273 TraceCheckUtils]: 23: Hoare triple {37607#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37608#(<= main_~i~1 9)} is VALID [2018-11-23 12:19:48,743 INFO L273 TraceCheckUtils]: 24: Hoare triple {37608#(<= main_~i~1 9)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37608#(<= main_~i~1 9)} is VALID [2018-11-23 12:19:48,744 INFO L273 TraceCheckUtils]: 25: Hoare triple {37608#(<= main_~i~1 9)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37609#(<= main_~i~1 10)} is VALID [2018-11-23 12:19:48,745 INFO L273 TraceCheckUtils]: 26: Hoare triple {37609#(<= main_~i~1 10)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37609#(<= main_~i~1 10)} is VALID [2018-11-23 12:19:48,745 INFO L273 TraceCheckUtils]: 27: Hoare triple {37609#(<= main_~i~1 10)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37610#(<= main_~i~1 11)} is VALID [2018-11-23 12:19:48,746 INFO L273 TraceCheckUtils]: 28: Hoare triple {37610#(<= main_~i~1 11)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37610#(<= main_~i~1 11)} is VALID [2018-11-23 12:19:48,746 INFO L273 TraceCheckUtils]: 29: Hoare triple {37610#(<= main_~i~1 11)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37611#(<= main_~i~1 12)} is VALID [2018-11-23 12:19:48,747 INFO L273 TraceCheckUtils]: 30: Hoare triple {37611#(<= main_~i~1 12)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37611#(<= main_~i~1 12)} is VALID [2018-11-23 12:19:48,748 INFO L273 TraceCheckUtils]: 31: Hoare triple {37611#(<= main_~i~1 12)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37612#(<= main_~i~1 13)} is VALID [2018-11-23 12:19:48,748 INFO L273 TraceCheckUtils]: 32: Hoare triple {37612#(<= main_~i~1 13)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37612#(<= main_~i~1 13)} is VALID [2018-11-23 12:19:48,749 INFO L273 TraceCheckUtils]: 33: Hoare triple {37612#(<= main_~i~1 13)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37613#(<= main_~i~1 14)} is VALID [2018-11-23 12:19:48,749 INFO L273 TraceCheckUtils]: 34: Hoare triple {37613#(<= main_~i~1 14)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37613#(<= main_~i~1 14)} is VALID [2018-11-23 12:19:48,750 INFO L273 TraceCheckUtils]: 35: Hoare triple {37613#(<= main_~i~1 14)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37614#(<= main_~i~1 15)} is VALID [2018-11-23 12:19:48,750 INFO L273 TraceCheckUtils]: 36: Hoare triple {37614#(<= main_~i~1 15)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37614#(<= main_~i~1 15)} is VALID [2018-11-23 12:19:48,751 INFO L273 TraceCheckUtils]: 37: Hoare triple {37614#(<= main_~i~1 15)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37615#(<= main_~i~1 16)} is VALID [2018-11-23 12:19:48,751 INFO L273 TraceCheckUtils]: 38: Hoare triple {37615#(<= main_~i~1 16)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37615#(<= main_~i~1 16)} is VALID [2018-11-23 12:19:48,752 INFO L273 TraceCheckUtils]: 39: Hoare triple {37615#(<= main_~i~1 16)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37616#(<= main_~i~1 17)} is VALID [2018-11-23 12:19:48,753 INFO L273 TraceCheckUtils]: 40: Hoare triple {37616#(<= main_~i~1 17)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37616#(<= main_~i~1 17)} is VALID [2018-11-23 12:19:48,753 INFO L273 TraceCheckUtils]: 41: Hoare triple {37616#(<= main_~i~1 17)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37617#(<= main_~i~1 18)} is VALID [2018-11-23 12:19:48,754 INFO L273 TraceCheckUtils]: 42: Hoare triple {37617#(<= main_~i~1 18)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37617#(<= main_~i~1 18)} is VALID [2018-11-23 12:19:48,755 INFO L273 TraceCheckUtils]: 43: Hoare triple {37617#(<= main_~i~1 18)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37618#(<= main_~i~1 19)} is VALID [2018-11-23 12:19:48,755 INFO L273 TraceCheckUtils]: 44: Hoare triple {37618#(<= main_~i~1 19)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37618#(<= main_~i~1 19)} is VALID [2018-11-23 12:19:48,756 INFO L273 TraceCheckUtils]: 45: Hoare triple {37618#(<= main_~i~1 19)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37619#(<= main_~i~1 20)} is VALID [2018-11-23 12:19:48,756 INFO L273 TraceCheckUtils]: 46: Hoare triple {37619#(<= main_~i~1 20)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37619#(<= main_~i~1 20)} is VALID [2018-11-23 12:19:48,757 INFO L273 TraceCheckUtils]: 47: Hoare triple {37619#(<= main_~i~1 20)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37620#(<= main_~i~1 21)} is VALID [2018-11-23 12:19:48,757 INFO L273 TraceCheckUtils]: 48: Hoare triple {37620#(<= main_~i~1 21)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37620#(<= main_~i~1 21)} is VALID [2018-11-23 12:19:48,758 INFO L273 TraceCheckUtils]: 49: Hoare triple {37620#(<= main_~i~1 21)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37621#(<= main_~i~1 22)} is VALID [2018-11-23 12:19:48,759 INFO L273 TraceCheckUtils]: 50: Hoare triple {37621#(<= main_~i~1 22)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37621#(<= main_~i~1 22)} is VALID [2018-11-23 12:19:48,759 INFO L273 TraceCheckUtils]: 51: Hoare triple {37621#(<= main_~i~1 22)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37622#(<= main_~i~1 23)} is VALID [2018-11-23 12:19:48,760 INFO L273 TraceCheckUtils]: 52: Hoare triple {37622#(<= main_~i~1 23)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37622#(<= main_~i~1 23)} is VALID [2018-11-23 12:19:48,760 INFO L273 TraceCheckUtils]: 53: Hoare triple {37622#(<= main_~i~1 23)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37623#(<= main_~i~1 24)} is VALID [2018-11-23 12:19:48,761 INFO L273 TraceCheckUtils]: 54: Hoare triple {37623#(<= main_~i~1 24)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37623#(<= main_~i~1 24)} is VALID [2018-11-23 12:19:48,762 INFO L273 TraceCheckUtils]: 55: Hoare triple {37623#(<= main_~i~1 24)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37624#(<= main_~i~1 25)} is VALID [2018-11-23 12:19:48,762 INFO L273 TraceCheckUtils]: 56: Hoare triple {37624#(<= main_~i~1 25)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37624#(<= main_~i~1 25)} is VALID [2018-11-23 12:19:48,763 INFO L273 TraceCheckUtils]: 57: Hoare triple {37624#(<= main_~i~1 25)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37625#(<= main_~i~1 26)} is VALID [2018-11-23 12:19:48,763 INFO L273 TraceCheckUtils]: 58: Hoare triple {37625#(<= main_~i~1 26)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37625#(<= main_~i~1 26)} is VALID [2018-11-23 12:19:48,764 INFO L273 TraceCheckUtils]: 59: Hoare triple {37625#(<= main_~i~1 26)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37626#(<= main_~i~1 27)} is VALID [2018-11-23 12:19:48,764 INFO L273 TraceCheckUtils]: 60: Hoare triple {37626#(<= main_~i~1 27)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37626#(<= main_~i~1 27)} is VALID [2018-11-23 12:19:48,765 INFO L273 TraceCheckUtils]: 61: Hoare triple {37626#(<= main_~i~1 27)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37627#(<= main_~i~1 28)} is VALID [2018-11-23 12:19:48,766 INFO L273 TraceCheckUtils]: 62: Hoare triple {37627#(<= main_~i~1 28)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37627#(<= main_~i~1 28)} is VALID [2018-11-23 12:19:48,766 INFO L273 TraceCheckUtils]: 63: Hoare triple {37627#(<= main_~i~1 28)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37628#(<= main_~i~1 29)} is VALID [2018-11-23 12:19:48,767 INFO L273 TraceCheckUtils]: 64: Hoare triple {37628#(<= main_~i~1 29)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37628#(<= main_~i~1 29)} is VALID [2018-11-23 12:19:48,767 INFO L273 TraceCheckUtils]: 65: Hoare triple {37628#(<= main_~i~1 29)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37629#(<= main_~i~1 30)} is VALID [2018-11-23 12:19:48,768 INFO L273 TraceCheckUtils]: 66: Hoare triple {37629#(<= main_~i~1 30)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37629#(<= main_~i~1 30)} is VALID [2018-11-23 12:19:48,769 INFO L273 TraceCheckUtils]: 67: Hoare triple {37629#(<= main_~i~1 30)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37630#(<= main_~i~1 31)} is VALID [2018-11-23 12:19:48,769 INFO L273 TraceCheckUtils]: 68: Hoare triple {37630#(<= main_~i~1 31)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37630#(<= main_~i~1 31)} is VALID [2018-11-23 12:19:48,770 INFO L273 TraceCheckUtils]: 69: Hoare triple {37630#(<= main_~i~1 31)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37631#(<= main_~i~1 32)} is VALID [2018-11-23 12:19:48,770 INFO L273 TraceCheckUtils]: 70: Hoare triple {37631#(<= main_~i~1 32)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37631#(<= main_~i~1 32)} is VALID [2018-11-23 12:19:48,771 INFO L273 TraceCheckUtils]: 71: Hoare triple {37631#(<= main_~i~1 32)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37632#(<= main_~i~1 33)} is VALID [2018-11-23 12:19:48,771 INFO L273 TraceCheckUtils]: 72: Hoare triple {37632#(<= main_~i~1 33)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37632#(<= main_~i~1 33)} is VALID [2018-11-23 12:19:48,772 INFO L273 TraceCheckUtils]: 73: Hoare triple {37632#(<= main_~i~1 33)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37633#(<= main_~i~1 34)} is VALID [2018-11-23 12:19:48,772 INFO L273 TraceCheckUtils]: 74: Hoare triple {37633#(<= main_~i~1 34)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37633#(<= main_~i~1 34)} is VALID [2018-11-23 12:19:48,773 INFO L273 TraceCheckUtils]: 75: Hoare triple {37633#(<= main_~i~1 34)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37634#(<= main_~i~1 35)} is VALID [2018-11-23 12:19:48,774 INFO L273 TraceCheckUtils]: 76: Hoare triple {37634#(<= main_~i~1 35)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37634#(<= main_~i~1 35)} is VALID [2018-11-23 12:19:48,774 INFO L273 TraceCheckUtils]: 77: Hoare triple {37634#(<= main_~i~1 35)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37635#(<= main_~i~1 36)} is VALID [2018-11-23 12:19:48,775 INFO L273 TraceCheckUtils]: 78: Hoare triple {37635#(<= main_~i~1 36)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37635#(<= main_~i~1 36)} is VALID [2018-11-23 12:19:48,775 INFO L273 TraceCheckUtils]: 79: Hoare triple {37635#(<= main_~i~1 36)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37636#(<= main_~i~1 37)} is VALID [2018-11-23 12:19:48,776 INFO L273 TraceCheckUtils]: 80: Hoare triple {37636#(<= main_~i~1 37)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37636#(<= main_~i~1 37)} is VALID [2018-11-23 12:19:48,777 INFO L273 TraceCheckUtils]: 81: Hoare triple {37636#(<= main_~i~1 37)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37637#(<= main_~i~1 38)} is VALID [2018-11-23 12:19:48,777 INFO L273 TraceCheckUtils]: 82: Hoare triple {37637#(<= main_~i~1 38)} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37637#(<= main_~i~1 38)} is VALID [2018-11-23 12:19:48,778 INFO L273 TraceCheckUtils]: 83: Hoare triple {37637#(<= main_~i~1 38)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37638#(<= main_~i~1 39)} is VALID [2018-11-23 12:19:48,778 INFO L273 TraceCheckUtils]: 84: Hoare triple {37638#(<= main_~i~1 39)} assume !(~i~1 < 60); {37598#false} is VALID [2018-11-23 12:19:48,779 INFO L256 TraceCheckUtils]: 85: Hoare triple {37598#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {37597#true} is VALID [2018-11-23 12:19:48,779 INFO L273 TraceCheckUtils]: 86: Hoare triple {37597#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {37597#true} is VALID [2018-11-23 12:19:48,779 INFO L273 TraceCheckUtils]: 87: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,779 INFO L273 TraceCheckUtils]: 88: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,779 INFO L273 TraceCheckUtils]: 89: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,779 INFO L273 TraceCheckUtils]: 90: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,780 INFO L273 TraceCheckUtils]: 91: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,780 INFO L273 TraceCheckUtils]: 92: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,780 INFO L273 TraceCheckUtils]: 93: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,780 INFO L273 TraceCheckUtils]: 94: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,780 INFO L273 TraceCheckUtils]: 95: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,780 INFO L273 TraceCheckUtils]: 96: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,781 INFO L273 TraceCheckUtils]: 97: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,781 INFO L273 TraceCheckUtils]: 98: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,781 INFO L273 TraceCheckUtils]: 99: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,781 INFO L273 TraceCheckUtils]: 100: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,781 INFO L273 TraceCheckUtils]: 101: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,781 INFO L273 TraceCheckUtils]: 102: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,782 INFO L273 TraceCheckUtils]: 103: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,782 INFO L273 TraceCheckUtils]: 104: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,782 INFO L273 TraceCheckUtils]: 105: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,782 INFO L273 TraceCheckUtils]: 106: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,782 INFO L273 TraceCheckUtils]: 107: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,782 INFO L273 TraceCheckUtils]: 108: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,783 INFO L273 TraceCheckUtils]: 109: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,783 INFO L273 TraceCheckUtils]: 110: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,783 INFO L273 TraceCheckUtils]: 111: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,783 INFO L273 TraceCheckUtils]: 112: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,783 INFO L273 TraceCheckUtils]: 113: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,783 INFO L273 TraceCheckUtils]: 114: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,784 INFO L273 TraceCheckUtils]: 115: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,784 INFO L273 TraceCheckUtils]: 116: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,784 INFO L273 TraceCheckUtils]: 117: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,784 INFO L273 TraceCheckUtils]: 118: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,784 INFO L273 TraceCheckUtils]: 119: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,784 INFO L273 TraceCheckUtils]: 120: Hoare triple {37597#true} assume !(~i~0 < 60); {37597#true} is VALID [2018-11-23 12:19:48,784 INFO L273 TraceCheckUtils]: 121: Hoare triple {37597#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {37597#true} is VALID [2018-11-23 12:19:48,784 INFO L273 TraceCheckUtils]: 122: Hoare triple {37597#true} assume true; {37597#true} is VALID [2018-11-23 12:19:48,784 INFO L268 TraceCheckUtils]: 123: Hoare quadruple {37597#true} {37598#false} #75#return; {37598#false} is VALID [2018-11-23 12:19:48,784 INFO L273 TraceCheckUtils]: 124: Hoare triple {37598#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {37598#false} is VALID [2018-11-23 12:19:48,785 INFO L256 TraceCheckUtils]: 125: Hoare triple {37598#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {37597#true} is VALID [2018-11-23 12:19:48,785 INFO L273 TraceCheckUtils]: 126: Hoare triple {37597#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {37597#true} is VALID [2018-11-23 12:19:48,785 INFO L273 TraceCheckUtils]: 127: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,785 INFO L273 TraceCheckUtils]: 128: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,785 INFO L273 TraceCheckUtils]: 129: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,785 INFO L273 TraceCheckUtils]: 130: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,785 INFO L273 TraceCheckUtils]: 131: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,785 INFO L273 TraceCheckUtils]: 132: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,785 INFO L273 TraceCheckUtils]: 133: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,785 INFO L273 TraceCheckUtils]: 134: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,786 INFO L273 TraceCheckUtils]: 135: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,786 INFO L273 TraceCheckUtils]: 136: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,786 INFO L273 TraceCheckUtils]: 137: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,786 INFO L273 TraceCheckUtils]: 138: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,786 INFO L273 TraceCheckUtils]: 139: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,786 INFO L273 TraceCheckUtils]: 140: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,786 INFO L273 TraceCheckUtils]: 141: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,786 INFO L273 TraceCheckUtils]: 142: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,786 INFO L273 TraceCheckUtils]: 143: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,786 INFO L273 TraceCheckUtils]: 144: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,787 INFO L273 TraceCheckUtils]: 145: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,787 INFO L273 TraceCheckUtils]: 146: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,787 INFO L273 TraceCheckUtils]: 147: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,787 INFO L273 TraceCheckUtils]: 148: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,787 INFO L273 TraceCheckUtils]: 149: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,787 INFO L273 TraceCheckUtils]: 150: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,787 INFO L273 TraceCheckUtils]: 151: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,787 INFO L273 TraceCheckUtils]: 152: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,787 INFO L273 TraceCheckUtils]: 153: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,787 INFO L273 TraceCheckUtils]: 154: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,788 INFO L273 TraceCheckUtils]: 155: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,788 INFO L273 TraceCheckUtils]: 156: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,788 INFO L273 TraceCheckUtils]: 157: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,788 INFO L273 TraceCheckUtils]: 158: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,788 INFO L273 TraceCheckUtils]: 159: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,788 INFO L273 TraceCheckUtils]: 160: Hoare triple {37597#true} assume !(~i~0 < 60); {37597#true} is VALID [2018-11-23 12:19:48,788 INFO L273 TraceCheckUtils]: 161: Hoare triple {37597#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {37597#true} is VALID [2018-11-23 12:19:48,788 INFO L273 TraceCheckUtils]: 162: Hoare triple {37597#true} assume true; {37597#true} is VALID [2018-11-23 12:19:48,788 INFO L268 TraceCheckUtils]: 163: Hoare quadruple {37597#true} {37598#false} #77#return; {37598#false} is VALID [2018-11-23 12:19:48,788 INFO L273 TraceCheckUtils]: 164: Hoare triple {37598#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {37598#false} is VALID [2018-11-23 12:19:48,789 INFO L273 TraceCheckUtils]: 165: Hoare triple {37598#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {37598#false} is VALID [2018-11-23 12:19:48,789 INFO L273 TraceCheckUtils]: 166: Hoare triple {37598#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {37598#false} is VALID [2018-11-23 12:19:48,789 INFO L273 TraceCheckUtils]: 167: Hoare triple {37598#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {37598#false} is VALID [2018-11-23 12:19:48,789 INFO L273 TraceCheckUtils]: 168: Hoare triple {37598#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {37598#false} is VALID [2018-11-23 12:19:48,789 INFO L273 TraceCheckUtils]: 169: Hoare triple {37598#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {37598#false} is VALID [2018-11-23 12:19:48,789 INFO L273 TraceCheckUtils]: 170: Hoare triple {37598#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {37598#false} is VALID [2018-11-23 12:19:48,789 INFO L273 TraceCheckUtils]: 171: Hoare triple {37598#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {37598#false} is VALID [2018-11-23 12:19:48,789 INFO L273 TraceCheckUtils]: 172: Hoare triple {37598#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {37598#false} is VALID [2018-11-23 12:19:48,789 INFO L273 TraceCheckUtils]: 173: Hoare triple {37598#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {37598#false} is VALID [2018-11-23 12:19:48,789 INFO L273 TraceCheckUtils]: 174: Hoare triple {37598#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {37598#false} is VALID [2018-11-23 12:19:48,790 INFO L273 TraceCheckUtils]: 175: Hoare triple {37598#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {37598#false} is VALID [2018-11-23 12:19:48,790 INFO L273 TraceCheckUtils]: 176: Hoare triple {37598#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {37598#false} is VALID [2018-11-23 12:19:48,790 INFO L273 TraceCheckUtils]: 177: Hoare triple {37598#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {37598#false} is VALID [2018-11-23 12:19:48,790 INFO L273 TraceCheckUtils]: 178: Hoare triple {37598#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {37598#false} is VALID [2018-11-23 12:19:48,790 INFO L273 TraceCheckUtils]: 179: Hoare triple {37598#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {37598#false} is VALID [2018-11-23 12:19:48,790 INFO L273 TraceCheckUtils]: 180: Hoare triple {37598#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {37598#false} is VALID [2018-11-23 12:19:48,790 INFO L273 TraceCheckUtils]: 181: Hoare triple {37598#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {37598#false} is VALID [2018-11-23 12:19:48,790 INFO L273 TraceCheckUtils]: 182: Hoare triple {37598#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {37598#false} is VALID [2018-11-23 12:19:48,790 INFO L273 TraceCheckUtils]: 183: Hoare triple {37598#false} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {37598#false} is VALID [2018-11-23 12:19:48,790 INFO L273 TraceCheckUtils]: 184: Hoare triple {37598#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {37598#false} is VALID [2018-11-23 12:19:48,791 INFO L273 TraceCheckUtils]: 185: Hoare triple {37598#false} assume !(~i~2 < 59); {37598#false} is VALID [2018-11-23 12:19:48,791 INFO L273 TraceCheckUtils]: 186: Hoare triple {37598#false} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {37598#false} is VALID [2018-11-23 12:19:48,791 INFO L256 TraceCheckUtils]: 187: Hoare triple {37598#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {37597#true} is VALID [2018-11-23 12:19:48,791 INFO L273 TraceCheckUtils]: 188: Hoare triple {37597#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {37597#true} is VALID [2018-11-23 12:19:48,791 INFO L273 TraceCheckUtils]: 189: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,791 INFO L273 TraceCheckUtils]: 190: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,791 INFO L273 TraceCheckUtils]: 191: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,791 INFO L273 TraceCheckUtils]: 192: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,791 INFO L273 TraceCheckUtils]: 193: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,791 INFO L273 TraceCheckUtils]: 194: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,792 INFO L273 TraceCheckUtils]: 195: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,792 INFO L273 TraceCheckUtils]: 196: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,792 INFO L273 TraceCheckUtils]: 197: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,792 INFO L273 TraceCheckUtils]: 198: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,792 INFO L273 TraceCheckUtils]: 199: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,792 INFO L273 TraceCheckUtils]: 200: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,792 INFO L273 TraceCheckUtils]: 201: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,792 INFO L273 TraceCheckUtils]: 202: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,792 INFO L273 TraceCheckUtils]: 203: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,792 INFO L273 TraceCheckUtils]: 204: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,793 INFO L273 TraceCheckUtils]: 205: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,793 INFO L273 TraceCheckUtils]: 206: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,793 INFO L273 TraceCheckUtils]: 207: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,793 INFO L273 TraceCheckUtils]: 208: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,793 INFO L273 TraceCheckUtils]: 209: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,793 INFO L273 TraceCheckUtils]: 210: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,793 INFO L273 TraceCheckUtils]: 211: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,793 INFO L273 TraceCheckUtils]: 212: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,793 INFO L273 TraceCheckUtils]: 213: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,793 INFO L273 TraceCheckUtils]: 214: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,794 INFO L273 TraceCheckUtils]: 215: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,794 INFO L273 TraceCheckUtils]: 216: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,794 INFO L273 TraceCheckUtils]: 217: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,794 INFO L273 TraceCheckUtils]: 218: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,794 INFO L273 TraceCheckUtils]: 219: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:48,794 INFO L273 TraceCheckUtils]: 220: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:48,794 INFO L273 TraceCheckUtils]: 221: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:48,794 INFO L273 TraceCheckUtils]: 222: Hoare triple {37597#true} assume !(~i~0 < 60); {37597#true} is VALID [2018-11-23 12:19:48,794 INFO L273 TraceCheckUtils]: 223: Hoare triple {37597#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {37597#true} is VALID [2018-11-23 12:19:48,794 INFO L273 TraceCheckUtils]: 224: Hoare triple {37597#true} assume true; {37597#true} is VALID [2018-11-23 12:19:48,795 INFO L268 TraceCheckUtils]: 225: Hoare quadruple {37597#true} {37598#false} #79#return; {37598#false} is VALID [2018-11-23 12:19:48,795 INFO L273 TraceCheckUtils]: 226: Hoare triple {37598#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {37598#false} is VALID [2018-11-23 12:19:48,795 INFO L273 TraceCheckUtils]: 227: Hoare triple {37598#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {37598#false} is VALID [2018-11-23 12:19:48,795 INFO L273 TraceCheckUtils]: 228: Hoare triple {37598#false} assume !false; {37598#false} is VALID [2018-11-23 12:19:48,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3319 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1798 trivial. 0 not checked. [2018-11-23 12:19:48,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:19:48,818 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:19:48,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:19:49,535 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 12:19:49,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:19:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:49,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:19:50,800 INFO L256 TraceCheckUtils]: 0: Hoare triple {37597#true} call ULTIMATE.init(); {37597#true} is VALID [2018-11-23 12:19:50,801 INFO L273 TraceCheckUtils]: 1: Hoare triple {37597#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37597#true} is VALID [2018-11-23 12:19:50,801 INFO L273 TraceCheckUtils]: 2: Hoare triple {37597#true} assume true; {37597#true} is VALID [2018-11-23 12:19:50,801 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37597#true} {37597#true} #71#return; {37597#true} is VALID [2018-11-23 12:19:50,801 INFO L256 TraceCheckUtils]: 4: Hoare triple {37597#true} call #t~ret14 := main(); {37597#true} is VALID [2018-11-23 12:19:50,801 INFO L273 TraceCheckUtils]: 5: Hoare triple {37597#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(240);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {37597#true} is VALID [2018-11-23 12:19:50,801 INFO L273 TraceCheckUtils]: 6: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,802 INFO L273 TraceCheckUtils]: 7: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,802 INFO L273 TraceCheckUtils]: 8: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,802 INFO L273 TraceCheckUtils]: 9: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,802 INFO L273 TraceCheckUtils]: 10: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,802 INFO L273 TraceCheckUtils]: 11: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,802 INFO L273 TraceCheckUtils]: 12: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,802 INFO L273 TraceCheckUtils]: 13: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,803 INFO L273 TraceCheckUtils]: 14: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,803 INFO L273 TraceCheckUtils]: 15: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,803 INFO L273 TraceCheckUtils]: 16: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,803 INFO L273 TraceCheckUtils]: 17: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,803 INFO L273 TraceCheckUtils]: 18: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,803 INFO L273 TraceCheckUtils]: 19: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,803 INFO L273 TraceCheckUtils]: 20: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,803 INFO L273 TraceCheckUtils]: 21: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,803 INFO L273 TraceCheckUtils]: 22: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,803 INFO L273 TraceCheckUtils]: 23: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,804 INFO L273 TraceCheckUtils]: 24: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,804 INFO L273 TraceCheckUtils]: 25: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,804 INFO L273 TraceCheckUtils]: 26: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,804 INFO L273 TraceCheckUtils]: 27: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,804 INFO L273 TraceCheckUtils]: 28: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,804 INFO L273 TraceCheckUtils]: 29: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,804 INFO L273 TraceCheckUtils]: 30: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,804 INFO L273 TraceCheckUtils]: 31: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,804 INFO L273 TraceCheckUtils]: 32: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,805 INFO L273 TraceCheckUtils]: 33: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,805 INFO L273 TraceCheckUtils]: 34: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,805 INFO L273 TraceCheckUtils]: 35: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,805 INFO L273 TraceCheckUtils]: 36: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,805 INFO L273 TraceCheckUtils]: 37: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,805 INFO L273 TraceCheckUtils]: 38: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,805 INFO L273 TraceCheckUtils]: 39: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,805 INFO L273 TraceCheckUtils]: 40: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,805 INFO L273 TraceCheckUtils]: 41: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,805 INFO L273 TraceCheckUtils]: 42: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,806 INFO L273 TraceCheckUtils]: 43: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,806 INFO L273 TraceCheckUtils]: 44: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,806 INFO L273 TraceCheckUtils]: 45: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,806 INFO L273 TraceCheckUtils]: 46: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,806 INFO L273 TraceCheckUtils]: 47: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,806 INFO L273 TraceCheckUtils]: 48: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,806 INFO L273 TraceCheckUtils]: 49: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,806 INFO L273 TraceCheckUtils]: 50: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,806 INFO L273 TraceCheckUtils]: 51: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,806 INFO L273 TraceCheckUtils]: 52: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,807 INFO L273 TraceCheckUtils]: 53: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,807 INFO L273 TraceCheckUtils]: 54: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,807 INFO L273 TraceCheckUtils]: 55: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,807 INFO L273 TraceCheckUtils]: 56: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,807 INFO L273 TraceCheckUtils]: 57: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,807 INFO L273 TraceCheckUtils]: 58: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,807 INFO L273 TraceCheckUtils]: 59: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,807 INFO L273 TraceCheckUtils]: 60: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,807 INFO L273 TraceCheckUtils]: 61: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,807 INFO L273 TraceCheckUtils]: 62: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,808 INFO L273 TraceCheckUtils]: 63: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,808 INFO L273 TraceCheckUtils]: 64: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,808 INFO L273 TraceCheckUtils]: 65: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,808 INFO L273 TraceCheckUtils]: 66: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,808 INFO L273 TraceCheckUtils]: 67: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,808 INFO L273 TraceCheckUtils]: 68: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,808 INFO L273 TraceCheckUtils]: 69: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,808 INFO L273 TraceCheckUtils]: 70: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,808 INFO L273 TraceCheckUtils]: 71: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,808 INFO L273 TraceCheckUtils]: 72: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,809 INFO L273 TraceCheckUtils]: 73: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,809 INFO L273 TraceCheckUtils]: 74: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,809 INFO L273 TraceCheckUtils]: 75: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,809 INFO L273 TraceCheckUtils]: 76: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,809 INFO L273 TraceCheckUtils]: 77: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,809 INFO L273 TraceCheckUtils]: 78: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,809 INFO L273 TraceCheckUtils]: 79: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,809 INFO L273 TraceCheckUtils]: 80: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,809 INFO L273 TraceCheckUtils]: 81: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,809 INFO L273 TraceCheckUtils]: 82: Hoare triple {37597#true} assume !!(~i~1 < 60);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {37597#true} is VALID [2018-11-23 12:19:50,810 INFO L273 TraceCheckUtils]: 83: Hoare triple {37597#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {37597#true} is VALID [2018-11-23 12:19:50,810 INFO L273 TraceCheckUtils]: 84: Hoare triple {37597#true} assume !(~i~1 < 60); {37597#true} is VALID [2018-11-23 12:19:50,810 INFO L256 TraceCheckUtils]: 85: Hoare triple {37597#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {37597#true} is VALID [2018-11-23 12:19:50,810 INFO L273 TraceCheckUtils]: 86: Hoare triple {37597#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {37597#true} is VALID [2018-11-23 12:19:50,810 INFO L273 TraceCheckUtils]: 87: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:50,810 INFO L273 TraceCheckUtils]: 88: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:50,810 INFO L273 TraceCheckUtils]: 89: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:50,810 INFO L273 TraceCheckUtils]: 90: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:50,810 INFO L273 TraceCheckUtils]: 91: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:50,810 INFO L273 TraceCheckUtils]: 92: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:50,811 INFO L273 TraceCheckUtils]: 93: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:50,811 INFO L273 TraceCheckUtils]: 94: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:50,811 INFO L273 TraceCheckUtils]: 95: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:50,811 INFO L273 TraceCheckUtils]: 96: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:50,811 INFO L273 TraceCheckUtils]: 97: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:50,811 INFO L273 TraceCheckUtils]: 98: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:50,811 INFO L273 TraceCheckUtils]: 99: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:50,811 INFO L273 TraceCheckUtils]: 100: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:50,811 INFO L273 TraceCheckUtils]: 101: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:50,811 INFO L273 TraceCheckUtils]: 102: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:50,812 INFO L273 TraceCheckUtils]: 103: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:50,812 INFO L273 TraceCheckUtils]: 104: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:50,812 INFO L273 TraceCheckUtils]: 105: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:50,812 INFO L273 TraceCheckUtils]: 106: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:50,812 INFO L273 TraceCheckUtils]: 107: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:50,812 INFO L273 TraceCheckUtils]: 108: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:50,812 INFO L273 TraceCheckUtils]: 109: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:50,812 INFO L273 TraceCheckUtils]: 110: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:50,812 INFO L273 TraceCheckUtils]: 111: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:50,812 INFO L273 TraceCheckUtils]: 112: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:50,813 INFO L273 TraceCheckUtils]: 113: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:50,813 INFO L273 TraceCheckUtils]: 114: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:50,813 INFO L273 TraceCheckUtils]: 115: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:50,813 INFO L273 TraceCheckUtils]: 116: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:50,813 INFO L273 TraceCheckUtils]: 117: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:50,813 INFO L273 TraceCheckUtils]: 118: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:50,813 INFO L273 TraceCheckUtils]: 119: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:50,813 INFO L273 TraceCheckUtils]: 120: Hoare triple {37597#true} assume !(~i~0 < 60); {37597#true} is VALID [2018-11-23 12:19:50,813 INFO L273 TraceCheckUtils]: 121: Hoare triple {37597#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {37597#true} is VALID [2018-11-23 12:19:50,813 INFO L273 TraceCheckUtils]: 122: Hoare triple {37597#true} assume true; {37597#true} is VALID [2018-11-23 12:19:50,814 INFO L268 TraceCheckUtils]: 123: Hoare quadruple {37597#true} {37597#true} #75#return; {37597#true} is VALID [2018-11-23 12:19:50,814 INFO L273 TraceCheckUtils]: 124: Hoare triple {37597#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;~ret~1 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem7;havoc #t~mem7;call #t~mem8 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem8, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem8;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {37597#true} is VALID [2018-11-23 12:19:50,814 INFO L256 TraceCheckUtils]: 125: Hoare triple {37597#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {37597#true} is VALID [2018-11-23 12:19:50,814 INFO L273 TraceCheckUtils]: 126: Hoare triple {37597#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {37597#true} is VALID [2018-11-23 12:19:50,814 INFO L273 TraceCheckUtils]: 127: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:50,814 INFO L273 TraceCheckUtils]: 128: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:50,814 INFO L273 TraceCheckUtils]: 129: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:50,814 INFO L273 TraceCheckUtils]: 130: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:50,814 INFO L273 TraceCheckUtils]: 131: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:50,815 INFO L273 TraceCheckUtils]: 132: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:50,815 INFO L273 TraceCheckUtils]: 133: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:50,815 INFO L273 TraceCheckUtils]: 134: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:50,815 INFO L273 TraceCheckUtils]: 135: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:50,815 INFO L273 TraceCheckUtils]: 136: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:50,815 INFO L273 TraceCheckUtils]: 137: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:50,815 INFO L273 TraceCheckUtils]: 138: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:50,815 INFO L273 TraceCheckUtils]: 139: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:50,815 INFO L273 TraceCheckUtils]: 140: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:50,815 INFO L273 TraceCheckUtils]: 141: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:50,816 INFO L273 TraceCheckUtils]: 142: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:50,816 INFO L273 TraceCheckUtils]: 143: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:50,816 INFO L273 TraceCheckUtils]: 144: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:50,816 INFO L273 TraceCheckUtils]: 145: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:50,816 INFO L273 TraceCheckUtils]: 146: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:50,816 INFO L273 TraceCheckUtils]: 147: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:50,816 INFO L273 TraceCheckUtils]: 148: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:50,816 INFO L273 TraceCheckUtils]: 149: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:50,816 INFO L273 TraceCheckUtils]: 150: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:50,816 INFO L273 TraceCheckUtils]: 151: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:50,817 INFO L273 TraceCheckUtils]: 152: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:50,817 INFO L273 TraceCheckUtils]: 153: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:50,817 INFO L273 TraceCheckUtils]: 154: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:50,817 INFO L273 TraceCheckUtils]: 155: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:50,817 INFO L273 TraceCheckUtils]: 156: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:50,817 INFO L273 TraceCheckUtils]: 157: Hoare triple {37597#true} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {37597#true} is VALID [2018-11-23 12:19:50,817 INFO L273 TraceCheckUtils]: 158: Hoare triple {37597#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {37597#true} is VALID [2018-11-23 12:19:50,817 INFO L273 TraceCheckUtils]: 159: Hoare triple {37597#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {37597#true} is VALID [2018-11-23 12:19:50,817 INFO L273 TraceCheckUtils]: 160: Hoare triple {37597#true} assume !(~i~0 < 60); {37597#true} is VALID [2018-11-23 12:19:50,817 INFO L273 TraceCheckUtils]: 161: Hoare triple {37597#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {37597#true} is VALID [2018-11-23 12:19:50,818 INFO L273 TraceCheckUtils]: 162: Hoare triple {37597#true} assume true; {37597#true} is VALID [2018-11-23 12:19:50,818 INFO L268 TraceCheckUtils]: 163: Hoare quadruple {37597#true} {37597#true} #77#return; {37597#true} is VALID [2018-11-23 12:19:50,818 INFO L273 TraceCheckUtils]: 164: Hoare triple {37597#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~ret2~0 := #t~ret9;havoc #t~ret9;call #t~mem10 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem10;havoc #t~mem10;~i~2 := 0; {37597#true} is VALID [2018-11-23 12:19:50,818 INFO L273 TraceCheckUtils]: 165: Hoare triple {37597#true} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {37597#true} is VALID [2018-11-23 12:19:50,818 INFO L273 TraceCheckUtils]: 166: Hoare triple {37597#true} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {37597#true} is VALID [2018-11-23 12:19:50,818 INFO L273 TraceCheckUtils]: 167: Hoare triple {37597#true} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {37597#true} is VALID [2018-11-23 12:19:50,818 INFO L273 TraceCheckUtils]: 168: Hoare triple {37597#true} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {37597#true} is VALID [2018-11-23 12:19:50,818 INFO L273 TraceCheckUtils]: 169: Hoare triple {37597#true} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {37597#true} is VALID [2018-11-23 12:19:50,818 INFO L273 TraceCheckUtils]: 170: Hoare triple {37597#true} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {37597#true} is VALID [2018-11-23 12:19:50,818 INFO L273 TraceCheckUtils]: 171: Hoare triple {37597#true} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {37597#true} is VALID [2018-11-23 12:19:50,819 INFO L273 TraceCheckUtils]: 172: Hoare triple {37597#true} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {37597#true} is VALID [2018-11-23 12:19:50,819 INFO L273 TraceCheckUtils]: 173: Hoare triple {37597#true} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {37597#true} is VALID [2018-11-23 12:19:50,819 INFO L273 TraceCheckUtils]: 174: Hoare triple {37597#true} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {37597#true} is VALID [2018-11-23 12:19:50,819 INFO L273 TraceCheckUtils]: 175: Hoare triple {37597#true} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {37597#true} is VALID [2018-11-23 12:19:50,819 INFO L273 TraceCheckUtils]: 176: Hoare triple {37597#true} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {37597#true} is VALID [2018-11-23 12:19:50,819 INFO L273 TraceCheckUtils]: 177: Hoare triple {37597#true} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {37597#true} is VALID [2018-11-23 12:19:50,819 INFO L273 TraceCheckUtils]: 178: Hoare triple {37597#true} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {37597#true} is VALID [2018-11-23 12:19:50,819 INFO L273 TraceCheckUtils]: 179: Hoare triple {37597#true} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {37597#true} is VALID [2018-11-23 12:19:50,819 INFO L273 TraceCheckUtils]: 180: Hoare triple {37597#true} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {37597#true} is VALID [2018-11-23 12:19:50,819 INFO L273 TraceCheckUtils]: 181: Hoare triple {37597#true} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {37597#true} is VALID [2018-11-23 12:19:50,820 INFO L273 TraceCheckUtils]: 182: Hoare triple {37597#true} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {37597#true} is VALID [2018-11-23 12:19:50,820 INFO L273 TraceCheckUtils]: 183: Hoare triple {37597#true} assume !!(~i~2 < 59);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {37597#true} is VALID [2018-11-23 12:19:50,820 INFO L273 TraceCheckUtils]: 184: Hoare triple {37597#true} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {37597#true} is VALID [2018-11-23 12:19:50,820 INFO L273 TraceCheckUtils]: 185: Hoare triple {37597#true} assume !(~i~2 < 59); {37597#true} is VALID [2018-11-23 12:19:50,820 INFO L273 TraceCheckUtils]: 186: Hoare triple {37597#true} call write~int(~temp~0, ~#x~0.base, 236 + ~#x~0.offset, 4); {37597#true} is VALID [2018-11-23 12:19:50,820 INFO L256 TraceCheckUtils]: 187: Hoare triple {37597#true} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {37597#true} is VALID [2018-11-23 12:19:50,821 INFO L273 TraceCheckUtils]: 188: Hoare triple {37597#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {38206#(<= sep_~i~0 0)} is VALID [2018-11-23 12:19:50,821 INFO L273 TraceCheckUtils]: 189: Hoare triple {38206#(<= sep_~i~0 0)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {38206#(<= sep_~i~0 0)} is VALID [2018-11-23 12:19:50,821 INFO L273 TraceCheckUtils]: 190: Hoare triple {38206#(<= sep_~i~0 0)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {38206#(<= sep_~i~0 0)} is VALID [2018-11-23 12:19:50,822 INFO L273 TraceCheckUtils]: 191: Hoare triple {38206#(<= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38216#(<= sep_~i~0 1)} is VALID [2018-11-23 12:19:50,822 INFO L273 TraceCheckUtils]: 192: Hoare triple {38216#(<= sep_~i~0 1)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {38216#(<= sep_~i~0 1)} is VALID [2018-11-23 12:19:50,822 INFO L273 TraceCheckUtils]: 193: Hoare triple {38216#(<= sep_~i~0 1)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {38216#(<= sep_~i~0 1)} is VALID [2018-11-23 12:19:50,823 INFO L273 TraceCheckUtils]: 194: Hoare triple {38216#(<= sep_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38226#(<= sep_~i~0 2)} is VALID [2018-11-23 12:19:50,823 INFO L273 TraceCheckUtils]: 195: Hoare triple {38226#(<= sep_~i~0 2)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {38226#(<= sep_~i~0 2)} is VALID [2018-11-23 12:19:50,823 INFO L273 TraceCheckUtils]: 196: Hoare triple {38226#(<= sep_~i~0 2)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {38226#(<= sep_~i~0 2)} is VALID [2018-11-23 12:19:50,824 INFO L273 TraceCheckUtils]: 197: Hoare triple {38226#(<= sep_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38236#(<= sep_~i~0 3)} is VALID [2018-11-23 12:19:50,824 INFO L273 TraceCheckUtils]: 198: Hoare triple {38236#(<= sep_~i~0 3)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {38236#(<= sep_~i~0 3)} is VALID [2018-11-23 12:19:50,824 INFO L273 TraceCheckUtils]: 199: Hoare triple {38236#(<= sep_~i~0 3)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {38236#(<= sep_~i~0 3)} is VALID [2018-11-23 12:19:50,825 INFO L273 TraceCheckUtils]: 200: Hoare triple {38236#(<= sep_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38246#(<= sep_~i~0 4)} is VALID [2018-11-23 12:19:50,825 INFO L273 TraceCheckUtils]: 201: Hoare triple {38246#(<= sep_~i~0 4)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {38246#(<= sep_~i~0 4)} is VALID [2018-11-23 12:19:50,826 INFO L273 TraceCheckUtils]: 202: Hoare triple {38246#(<= sep_~i~0 4)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {38246#(<= sep_~i~0 4)} is VALID [2018-11-23 12:19:50,827 INFO L273 TraceCheckUtils]: 203: Hoare triple {38246#(<= sep_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38256#(<= sep_~i~0 5)} is VALID [2018-11-23 12:19:50,827 INFO L273 TraceCheckUtils]: 204: Hoare triple {38256#(<= sep_~i~0 5)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {38256#(<= sep_~i~0 5)} is VALID [2018-11-23 12:19:50,828 INFO L273 TraceCheckUtils]: 205: Hoare triple {38256#(<= sep_~i~0 5)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {38256#(<= sep_~i~0 5)} is VALID [2018-11-23 12:19:50,828 INFO L273 TraceCheckUtils]: 206: Hoare triple {38256#(<= sep_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38266#(<= sep_~i~0 6)} is VALID [2018-11-23 12:19:50,829 INFO L273 TraceCheckUtils]: 207: Hoare triple {38266#(<= sep_~i~0 6)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {38266#(<= sep_~i~0 6)} is VALID [2018-11-23 12:19:50,829 INFO L273 TraceCheckUtils]: 208: Hoare triple {38266#(<= sep_~i~0 6)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {38266#(<= sep_~i~0 6)} is VALID [2018-11-23 12:19:50,830 INFO L273 TraceCheckUtils]: 209: Hoare triple {38266#(<= sep_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38276#(<= sep_~i~0 7)} is VALID [2018-11-23 12:19:50,831 INFO L273 TraceCheckUtils]: 210: Hoare triple {38276#(<= sep_~i~0 7)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {38276#(<= sep_~i~0 7)} is VALID [2018-11-23 12:19:50,831 INFO L273 TraceCheckUtils]: 211: Hoare triple {38276#(<= sep_~i~0 7)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {38276#(<= sep_~i~0 7)} is VALID [2018-11-23 12:19:50,832 INFO L273 TraceCheckUtils]: 212: Hoare triple {38276#(<= sep_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38286#(<= sep_~i~0 8)} is VALID [2018-11-23 12:19:50,832 INFO L273 TraceCheckUtils]: 213: Hoare triple {38286#(<= sep_~i~0 8)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {38286#(<= sep_~i~0 8)} is VALID [2018-11-23 12:19:50,833 INFO L273 TraceCheckUtils]: 214: Hoare triple {38286#(<= sep_~i~0 8)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {38286#(<= sep_~i~0 8)} is VALID [2018-11-23 12:19:50,833 INFO L273 TraceCheckUtils]: 215: Hoare triple {38286#(<= sep_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38296#(<= sep_~i~0 9)} is VALID [2018-11-23 12:19:50,834 INFO L273 TraceCheckUtils]: 216: Hoare triple {38296#(<= sep_~i~0 9)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {38296#(<= sep_~i~0 9)} is VALID [2018-11-23 12:19:50,835 INFO L273 TraceCheckUtils]: 217: Hoare triple {38296#(<= sep_~i~0 9)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {38296#(<= sep_~i~0 9)} is VALID [2018-11-23 12:19:50,835 INFO L273 TraceCheckUtils]: 218: Hoare triple {38296#(<= sep_~i~0 9)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38306#(<= sep_~i~0 10)} is VALID [2018-11-23 12:19:50,836 INFO L273 TraceCheckUtils]: 219: Hoare triple {38306#(<= sep_~i~0 10)} assume !!(~i~0 < 60);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {38306#(<= sep_~i~0 10)} is VALID [2018-11-23 12:19:50,836 INFO L273 TraceCheckUtils]: 220: Hoare triple {38306#(<= sep_~i~0 10)} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {38306#(<= sep_~i~0 10)} is VALID [2018-11-23 12:19:50,837 INFO L273 TraceCheckUtils]: 221: Hoare triple {38306#(<= sep_~i~0 10)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {38316#(<= sep_~i~0 11)} is VALID [2018-11-23 12:19:50,838 INFO L273 TraceCheckUtils]: 222: Hoare triple {38316#(<= sep_~i~0 11)} assume !(~i~0 < 60); {37598#false} is VALID [2018-11-23 12:19:50,838 INFO L273 TraceCheckUtils]: 223: Hoare triple {37598#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {37598#false} is VALID [2018-11-23 12:19:50,838 INFO L273 TraceCheckUtils]: 224: Hoare triple {37598#false} assume true; {37598#false} is VALID [2018-11-23 12:19:50,838 INFO L268 TraceCheckUtils]: 225: Hoare quadruple {37598#false} {37597#true} #79#return; {37598#false} is VALID [2018-11-23 12:19:50,838 INFO L273 TraceCheckUtils]: 226: Hoare triple {37598#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {37598#false} is VALID [2018-11-23 12:19:50,839 INFO L273 TraceCheckUtils]: 227: Hoare triple {37598#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {37598#false} is VALID [2018-11-23 12:19:50,839 INFO L273 TraceCheckUtils]: 228: Hoare triple {37598#false} assume !false; {37598#false} is VALID [2018-11-23 12:19:50,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3319 backedges. 778 proven. 176 refuted. 0 times theorem prover too weak. 2365 trivial. 0 not checked. [2018-11-23 12:19:50,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:19:50,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 14] total 54 [2018-11-23 12:19:50,880 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 229 [2018-11-23 12:19:50,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:50,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states. [2018-11-23 12:19:51,039 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:51,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-23 12:19:51,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-23 12:19:51,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=1911, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 12:19:51,042 INFO L87 Difference]: Start difference. First operand 154 states and 169 transitions. Second operand 54 states. [2018-11-23 12:19:51,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:51,705 INFO L93 Difference]: Finished difference Result 231 states and 267 transitions. [2018-11-23 12:19:51,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-23 12:19:51,705 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 229 [2018-11-23 12:19:51,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:51,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:19:51,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 188 transitions. [2018-11-23 12:19:51,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:19:51,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 188 transitions. [2018-11-23 12:19:51,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 188 transitions. [2018-11-23 12:19:51,897 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:51,900 INFO L225 Difference]: With dead ends: 231 [2018-11-23 12:19:51,900 INFO L226 Difference]: Without dead ends: 162 [2018-11-23 12:19:51,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=951, Invalid=1911, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 12:19:51,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-23 12:19:51,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2018-11-23 12:19:51,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:51,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand 159 states. [2018-11-23 12:19:51,954 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 159 states. [2018-11-23 12:19:51,954 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 159 states. [2018-11-23 12:19:51,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:51,957 INFO L93 Difference]: Finished difference Result 162 states and 179 transitions. [2018-11-23 12:19:51,957 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 179 transitions. [2018-11-23 12:19:51,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:51,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:51,958 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 162 states. [2018-11-23 12:19:51,958 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 162 states. [2018-11-23 12:19:51,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:51,960 INFO L93 Difference]: Finished difference Result 162 states and 179 transitions. [2018-11-23 12:19:51,960 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 179 transitions. [2018-11-23 12:19:51,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:51,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:51,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:51,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:51,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-23 12:19:51,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 175 transitions. [2018-11-23 12:19:51,963 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 175 transitions. Word has length 229 [2018-11-23 12:19:51,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:51,963 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 175 transitions. [2018-11-23 12:19:51,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-23 12:19:51,963 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 175 transitions. [2018-11-23 12:19:51,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-11-23 12:19:51,964 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:51,964 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 36, 36, 36, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:19:51,964 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:51,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:51,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1307781390, now seen corresponding path program 40 times [2018-11-23 12:19:51,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:51,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:51,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:51,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:19:51,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat