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/sep10_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:16:33,016 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:16:33,018 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:16:33,030 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:16:33,030 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:16:33,031 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:16:33,032 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:16:33,034 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:16:33,036 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:16:33,037 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:16:33,038 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:16:33,040 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:16:33,041 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:16:33,042 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:16:33,043 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:16:33,043 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:16:33,048 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:16:33,053 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:16:33,055 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:16:33,057 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:16:33,059 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:16:33,060 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:16:33,063 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:16:33,063 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:16:33,063 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:16:33,064 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:16:33,065 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:16:33,066 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:16:33,067 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:16:33,068 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:16:33,068 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:16:33,069 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:16:33,069 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:16:33,070 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:16:33,071 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:16:33,071 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:16:33,072 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:33,087 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:16:33,087 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:16:33,088 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:16:33,088 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:16:33,089 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:16:33,089 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:16:33,089 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:16:33,090 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:16:33,090 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:16:33,090 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:16:33,090 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:16:33,090 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:16:33,091 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:16:33,091 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:16:33,091 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:16:33,091 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:16:33,091 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:16:33,091 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:16:33,092 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:16:33,092 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:16:33,092 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:16:33,092 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:16:33,092 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:16:33,094 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:16:33,094 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:16:33,094 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:16:33,095 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:16:33,095 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:16:33,095 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:16:33,095 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:16:33,095 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:16:33,140 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:16:33,154 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:16:33,157 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:16:33,158 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:16:33,159 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:16:33,159 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sep10_true-unreach-call.i [2018-11-23 12:16:33,210 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/643309d80/d510cdbd38004863b506af1dffd65ad8/FLAG1cd1de19b [2018-11-23 12:16:33,635 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:16:33,635 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sep10_true-unreach-call.i [2018-11-23 12:16:33,642 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/643309d80/d510cdbd38004863b506af1dffd65ad8/FLAG1cd1de19b [2018-11-23 12:16:34,011 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/643309d80/d510cdbd38004863b506af1dffd65ad8 [2018-11-23 12:16:34,024 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:16:34,026 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:16:34,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:16:34,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:16:34,031 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:16:34,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:16:34" (1/1) ... [2018-11-23 12:16:34,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e8d527e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:34, skipping insertion in model container [2018-11-23 12:16:34,038 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:16:34" (1/1) ... [2018-11-23 12:16:34,049 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:16:34,076 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:16:34,292 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:16:34,315 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:16:34,339 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:16:34,357 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:16:34,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:34 WrapperNode [2018-11-23 12:16:34,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:16:34,358 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:16:34,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:16:34,358 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:16:34,368 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:34" (1/1) ... [2018-11-23 12:16:34,377 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:34" (1/1) ... [2018-11-23 12:16:34,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:16:34,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:16:34,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:16:34,386 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:16:34,396 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:34" (1/1) ... [2018-11-23 12:16:34,397 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:34" (1/1) ... [2018-11-23 12:16:34,399 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:34" (1/1) ... [2018-11-23 12:16:34,399 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:34" (1/1) ... [2018-11-23 12:16:34,412 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:34" (1/1) ... [2018-11-23 12:16:34,419 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:34" (1/1) ... [2018-11-23 12:16:34,421 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:34" (1/1) ... [2018-11-23 12:16:34,424 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:16:34,424 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:16:34,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:16:34,425 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:16:34,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:34" (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:34,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:16:34,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:16:34,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:16:34,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:16:34,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:16:34,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:16:34,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:16:34,551 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:16:34,551 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:16:34,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:16:34,552 INFO L130 BoogieDeclarations]: Found specification of procedure sep [2018-11-23 12:16:34,552 INFO L138 BoogieDeclarations]: Found implementation of procedure sep [2018-11-23 12:16:35,438 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:16:35,438 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:16:35,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:16:35 BoogieIcfgContainer [2018-11-23 12:16:35,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:16:35,440 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:16:35,440 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:16:35,444 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:16:35,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:16:34" (1/3) ... [2018-11-23 12:16:35,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c4cc8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:16:35, skipping insertion in model container [2018-11-23 12:16:35,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:16:34" (2/3) ... [2018-11-23 12:16:35,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c4cc8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:16:35, skipping insertion in model container [2018-11-23 12:16:35,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:16:35" (3/3) ... [2018-11-23 12:16:35,448 INFO L112 eAbstractionObserver]: Analyzing ICFG sep10_true-unreach-call.i [2018-11-23 12:16:35,461 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:16:35,473 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:16:35,496 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:16:35,543 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:16:35,544 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:16:35,544 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:16:35,544 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:16:35,545 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:16:35,545 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:16:35,545 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:16:35,545 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:16:35,545 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:16:35,569 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-23 12:16:35,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:16:35,577 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:35,580 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:35,583 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:35,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:35,592 INFO L82 PathProgramCache]: Analyzing trace with hash 794343521, now seen corresponding path program 1 times [2018-11-23 12:16:35,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:35,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:35,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:35,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:35,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:35,874 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-23 12:16:35,880 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:35,881 INFO L273 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 12:16:35,881 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2018-11-23 12:16:35,882 INFO L256 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret14 := main(); {35#true} is VALID [2018-11-23 12:16:35,882 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {35#true} is VALID [2018-11-23 12:16:35,896 INFO L273 TraceCheckUtils]: 6: Hoare triple {35#true} assume !true; {36#false} is VALID [2018-11-23 12:16:35,897 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:35,897 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:35,897 INFO L273 TraceCheckUtils]: 9: Hoare triple {35#true} assume !true; {35#true} is VALID [2018-11-23 12:16:35,898 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:35,898 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 12:16:35,898 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {35#true} {36#false} #75#return; {36#false} is VALID [2018-11-23 12:16:35,901 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:35,901 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:35,901 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:35,902 INFO L273 TraceCheckUtils]: 16: Hoare triple {35#true} assume !true; {35#true} is VALID [2018-11-23 12:16:35,902 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:35,903 INFO L273 TraceCheckUtils]: 18: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 12:16:35,903 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {35#true} {36#false} #77#return; {36#false} is VALID [2018-11-23 12:16:35,903 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:35,904 INFO L273 TraceCheckUtils]: 21: Hoare triple {36#false} assume !true; {36#false} is VALID [2018-11-23 12:16:35,904 INFO L273 TraceCheckUtils]: 22: Hoare triple {36#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {36#false} is VALID [2018-11-23 12:16:35,904 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:35,905 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:35,906 INFO L273 TraceCheckUtils]: 25: Hoare triple {35#true} assume !true; {35#true} is VALID [2018-11-23 12:16:35,906 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:35,906 INFO L273 TraceCheckUtils]: 27: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 12:16:35,908 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {35#true} {36#false} #79#return; {36#false} is VALID [2018-11-23 12:16:35,908 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:35,909 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:35,909 INFO L273 TraceCheckUtils]: 31: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-23 12:16:35,923 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:35,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:16:35,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:16:35,932 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:16:35,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:35,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:16:36,123 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:36,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:16:36,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:16:36,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:16:36,136 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-11-23 12:16:36,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:36,288 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2018-11-23 12:16:36,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:16:36,289 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:16:36,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:36,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:16:36,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2018-11-23 12:16:36,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:16:36,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2018-11-23 12:16:36,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 75 transitions. [2018-11-23 12:16:36,562 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:36,575 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:16:36,576 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:16:36,580 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:36,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:16:36,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 12:16:36,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:36,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 12:16:36,659 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:16:36,659 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:16:36,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:36,665 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-23 12:16:36,666 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2018-11-23 12:16:36,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:36,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:36,667 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:16:36,667 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:16:36,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:36,672 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-23 12:16:36,673 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2018-11-23 12:16:36,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:36,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:36,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:36,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:36,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:16:36,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-11-23 12:16:36,680 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 32 [2018-11-23 12:16:36,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:36,680 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-23 12:16:36,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:16:36,681 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2018-11-23 12:16:36,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:16:36,682 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:36,683 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:36,683 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:36,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:36,684 INFO L82 PathProgramCache]: Analyzing trace with hash 2140793590, now seen corresponding path program 1 times [2018-11-23 12:16:36,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:36,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:36,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:36,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:36,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:36,806 INFO L256 TraceCheckUtils]: 0: Hoare triple {204#true} call ULTIMATE.init(); {204#true} is VALID [2018-11-23 12:16:36,807 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:36,807 INFO L273 TraceCheckUtils]: 2: Hoare triple {204#true} assume true; {204#true} is VALID [2018-11-23 12:16:36,808 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {204#true} {204#true} #71#return; {204#true} is VALID [2018-11-23 12:16:36,808 INFO L256 TraceCheckUtils]: 4: Hoare triple {204#true} call #t~ret14 := main(); {204#true} is VALID [2018-11-23 12:16:36,809 INFO L273 TraceCheckUtils]: 5: Hoare triple {204#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);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:36,814 INFO L273 TraceCheckUtils]: 6: Hoare triple {206#(= main_~i~1 0)} assume !(~i~1 < 10); {205#false} is VALID [2018-11-23 12:16:36,814 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:36,814 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:36,815 INFO L273 TraceCheckUtils]: 9: Hoare triple {204#true} assume !(~i~0 < 10); {204#true} is VALID [2018-11-23 12:16:36,815 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:36,815 INFO L273 TraceCheckUtils]: 11: Hoare triple {204#true} assume true; {204#true} is VALID [2018-11-23 12:16:36,815 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {204#true} {205#false} #75#return; {205#false} is VALID [2018-11-23 12:16:36,816 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:36,816 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:36,816 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:36,816 INFO L273 TraceCheckUtils]: 16: Hoare triple {204#true} assume !(~i~0 < 10); {204#true} is VALID [2018-11-23 12:16:36,817 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:36,817 INFO L273 TraceCheckUtils]: 18: Hoare triple {204#true} assume true; {204#true} is VALID [2018-11-23 12:16:36,817 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {204#true} {205#false} #77#return; {205#false} is VALID [2018-11-23 12:16:36,818 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:36,818 INFO L273 TraceCheckUtils]: 21: Hoare triple {205#false} assume !(~i~2 < 9); {205#false} is VALID [2018-11-23 12:16:36,818 INFO L273 TraceCheckUtils]: 22: Hoare triple {205#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {205#false} is VALID [2018-11-23 12:16:36,819 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:36,819 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:36,819 INFO L273 TraceCheckUtils]: 25: Hoare triple {204#true} assume !(~i~0 < 10); {204#true} is VALID [2018-11-23 12:16:36,820 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:36,820 INFO L273 TraceCheckUtils]: 27: Hoare triple {204#true} assume true; {204#true} is VALID [2018-11-23 12:16:36,820 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {204#true} {205#false} #79#return; {205#false} is VALID [2018-11-23 12:16:36,821 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:36,821 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:36,821 INFO L273 TraceCheckUtils]: 31: Hoare triple {205#false} assume !false; {205#false} is VALID [2018-11-23 12:16:36,823 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:36,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:16:36,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:16:36,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:16:36,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:36,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:16:36,911 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:36,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:16:36,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:16:36,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:16:36,913 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 3 states. [2018-11-23 12:16:37,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:37,454 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-11-23 12:16:37,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:16:37,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:16:37,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:37,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:16:37,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-23 12:16:37,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:16:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-23 12:16:37,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2018-11-23 12:16:37,617 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:37,619 INFO L225 Difference]: With dead ends: 48 [2018-11-23 12:16:37,620 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:16:37,621 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:37,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:16:37,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 12:16:37,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:37,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 12:16:37,640 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 12:16:37,641 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 12:16:37,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:37,646 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 12:16:37,646 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:16:37,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:37,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:37,648 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 12:16:37,648 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 12:16:37,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:37,651 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 12:16:37,652 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:16:37,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:37,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:37,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:37,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:16:37,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-23 12:16:37,656 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 32 [2018-11-23 12:16:37,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:37,656 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 12:16:37,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:16:37,656 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 12:16:37,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:16:37,658 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:37,658 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:37,658 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:37,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:37,659 INFO L82 PathProgramCache]: Analyzing trace with hash 2099349144, now seen corresponding path program 1 times [2018-11-23 12:16:37,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:37,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:37,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:37,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:37,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:37,744 INFO L256 TraceCheckUtils]: 0: Hoare triple {373#true} call ULTIMATE.init(); {373#true} is VALID [2018-11-23 12:16:37,744 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:37,745 INFO L273 TraceCheckUtils]: 2: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-23 12:16:37,745 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {373#true} {373#true} #71#return; {373#true} is VALID [2018-11-23 12:16:37,745 INFO L256 TraceCheckUtils]: 4: Hoare triple {373#true} call #t~ret14 := main(); {373#true} is VALID [2018-11-23 12:16:37,745 INFO L273 TraceCheckUtils]: 5: Hoare triple {373#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {373#true} is VALID [2018-11-23 12:16:37,746 INFO L273 TraceCheckUtils]: 6: Hoare triple {373#true} assume !!(~i~1 < 10);assume -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:37,746 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:37,746 INFO L273 TraceCheckUtils]: 8: Hoare triple {373#true} assume !(~i~1 < 10); {373#true} is VALID [2018-11-23 12:16:37,747 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:37,747 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:37,751 INFO L273 TraceCheckUtils]: 11: Hoare triple {375#(= sep_~i~0 0)} assume !(~i~0 < 10); {374#false} is VALID [2018-11-23 12:16:37,751 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:37,751 INFO L273 TraceCheckUtils]: 13: Hoare triple {374#false} assume true; {374#false} is VALID [2018-11-23 12:16:37,751 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {374#false} {373#true} #75#return; {374#false} is VALID [2018-11-23 12:16:37,752 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:37,752 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:37,752 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:37,753 INFO L273 TraceCheckUtils]: 18: Hoare triple {373#true} assume !(~i~0 < 10); {373#true} is VALID [2018-11-23 12:16:37,753 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:37,753 INFO L273 TraceCheckUtils]: 20: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-23 12:16:37,753 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {373#true} {374#false} #77#return; {374#false} is VALID [2018-11-23 12:16:37,754 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:37,754 INFO L273 TraceCheckUtils]: 23: Hoare triple {374#false} assume !(~i~2 < 9); {374#false} is VALID [2018-11-23 12:16:37,754 INFO L273 TraceCheckUtils]: 24: Hoare triple {374#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {374#false} is VALID [2018-11-23 12:16:37,755 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:37,755 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:37,755 INFO L273 TraceCheckUtils]: 27: Hoare triple {373#true} assume !(~i~0 < 10); {373#true} is VALID [2018-11-23 12:16:37,755 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:37,756 INFO L273 TraceCheckUtils]: 29: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-23 12:16:37,756 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {373#true} {374#false} #79#return; {374#false} is VALID [2018-11-23 12:16:37,756 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:37,757 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:37,757 INFO L273 TraceCheckUtils]: 33: Hoare triple {374#false} assume !false; {374#false} is VALID [2018-11-23 12:16:37,759 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:37,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:37,760 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:37,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:37,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:38,018 INFO L256 TraceCheckUtils]: 0: Hoare triple {373#true} call ULTIMATE.init(); {373#true} is VALID [2018-11-23 12:16:38,019 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:38,019 INFO L273 TraceCheckUtils]: 2: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-23 12:16:38,020 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {373#true} {373#true} #71#return; {373#true} is VALID [2018-11-23 12:16:38,020 INFO L256 TraceCheckUtils]: 4: Hoare triple {373#true} call #t~ret14 := main(); {373#true} is VALID [2018-11-23 12:16:38,020 INFO L273 TraceCheckUtils]: 5: Hoare triple {373#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {373#true} is VALID [2018-11-23 12:16:38,021 INFO L273 TraceCheckUtils]: 6: Hoare triple {373#true} assume !!(~i~1 < 10);assume -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:38,021 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:38,021 INFO L273 TraceCheckUtils]: 8: Hoare triple {373#true} assume !(~i~1 < 10); {373#true} is VALID [2018-11-23 12:16:38,022 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:38,029 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:38,030 INFO L273 TraceCheckUtils]: 11: Hoare triple {409#(<= sep_~i~0 0)} assume !(~i~0 < 10); {374#false} is VALID [2018-11-23 12:16:38,030 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:38,030 INFO L273 TraceCheckUtils]: 13: Hoare triple {374#false} assume true; {374#false} is VALID [2018-11-23 12:16:38,031 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {374#false} {373#true} #75#return; {374#false} is VALID [2018-11-23 12:16:38,031 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:38,031 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:38,031 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:38,032 INFO L273 TraceCheckUtils]: 18: Hoare triple {374#false} assume !(~i~0 < 10); {374#false} is VALID [2018-11-23 12:16:38,032 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:38,032 INFO L273 TraceCheckUtils]: 20: Hoare triple {374#false} assume true; {374#false} is VALID [2018-11-23 12:16:38,032 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {374#false} {374#false} #77#return; {374#false} is VALID [2018-11-23 12:16:38,033 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:38,033 INFO L273 TraceCheckUtils]: 23: Hoare triple {374#false} assume !(~i~2 < 9); {374#false} is VALID [2018-11-23 12:16:38,033 INFO L273 TraceCheckUtils]: 24: Hoare triple {374#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {374#false} is VALID [2018-11-23 12:16:38,034 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:38,034 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:38,034 INFO L273 TraceCheckUtils]: 27: Hoare triple {374#false} assume !(~i~0 < 10); {374#false} is VALID [2018-11-23 12:16:38,035 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:38,035 INFO L273 TraceCheckUtils]: 29: Hoare triple {374#false} assume true; {374#false} is VALID [2018-11-23 12:16:38,035 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {374#false} {374#false} #79#return; {374#false} is VALID [2018-11-23 12:16:38,036 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:38,036 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:38,036 INFO L273 TraceCheckUtils]: 33: Hoare triple {374#false} assume !false; {374#false} is VALID [2018-11-23 12:16:38,039 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:38,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:16:38,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-23 12:16:38,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:16:38,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:38,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:16:38,210 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:38,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:16:38,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:16:38,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:16:38,211 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 4 states. [2018-11-23 12:16:38,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:38,545 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2018-11-23 12:16:38,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:16:38,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:16:38,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:38,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:16:38,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-23 12:16:38,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:16:38,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-23 12:16:38,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2018-11-23 12:16:38,673 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:38,675 INFO L225 Difference]: With dead ends: 49 [2018-11-23 12:16:38,676 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:16:38,677 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:38,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:16:38,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-23 12:16:38,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:38,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 29 states. [2018-11-23 12:16:38,697 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 29 states. [2018-11-23 12:16:38,697 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 29 states. [2018-11-23 12:16:38,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:38,700 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2018-11-23 12:16:38,700 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2018-11-23 12:16:38,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:38,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:38,701 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 31 states. [2018-11-23 12:16:38,701 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 31 states. [2018-11-23 12:16:38,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:38,704 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2018-11-23 12:16:38,705 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2018-11-23 12:16:38,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:38,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:38,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:38,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:16:38,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-11-23 12:16:38,709 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 34 [2018-11-23 12:16:38,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:38,709 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-11-23 12:16:38,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:16:38,709 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:16:38,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 12:16:38,711 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:38,711 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:38,711 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:38,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:38,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1279819331, now seen corresponding path program 1 times [2018-11-23 12:16:38,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:38,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:38,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:38,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:38,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:38,851 INFO L256 TraceCheckUtils]: 0: Hoare triple {649#true} call ULTIMATE.init(); {649#true} is VALID [2018-11-23 12:16:38,851 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:38,852 INFO L273 TraceCheckUtils]: 2: Hoare triple {649#true} assume true; {649#true} is VALID [2018-11-23 12:16:38,852 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {649#true} {649#true} #71#return; {649#true} is VALID [2018-11-23 12:16:38,852 INFO L256 TraceCheckUtils]: 4: Hoare triple {649#true} call #t~ret14 := main(); {649#true} is VALID [2018-11-23 12:16:38,852 INFO L273 TraceCheckUtils]: 5: Hoare triple {649#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {649#true} is VALID [2018-11-23 12:16:38,853 INFO L273 TraceCheckUtils]: 6: Hoare triple {649#true} assume !!(~i~1 < 10);assume -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:38,853 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:38,853 INFO L273 TraceCheckUtils]: 8: Hoare triple {649#true} assume !(~i~1 < 10); {649#true} is VALID [2018-11-23 12:16:38,853 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:38,854 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:38,854 INFO L273 TraceCheckUtils]: 11: Hoare triple {649#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {649#true} is VALID [2018-11-23 12:16:38,854 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:38,854 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:38,855 INFO L273 TraceCheckUtils]: 14: Hoare triple {649#true} assume !(~i~0 < 10); {649#true} is VALID [2018-11-23 12:16:38,855 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:38,855 INFO L273 TraceCheckUtils]: 16: Hoare triple {649#true} assume true; {649#true} is VALID [2018-11-23 12:16:38,855 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {649#true} {649#true} #75#return; {649#true} is VALID [2018-11-23 12:16:38,856 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:38,856 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:38,856 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:38,857 INFO L273 TraceCheckUtils]: 21: Hoare triple {649#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {649#true} is VALID [2018-11-23 12:16:38,857 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:38,857 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:38,858 INFO L273 TraceCheckUtils]: 24: Hoare triple {649#true} assume !(~i~0 < 10); {649#true} is VALID [2018-11-23 12:16:38,858 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:38,858 INFO L273 TraceCheckUtils]: 26: Hoare triple {649#true} assume true; {649#true} is VALID [2018-11-23 12:16:38,858 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {649#true} {649#true} #77#return; {649#true} is VALID [2018-11-23 12:16:38,867 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:38,868 INFO L273 TraceCheckUtils]: 29: Hoare triple {651#(= main_~i~2 0)} assume !(~i~2 < 9); {650#false} is VALID [2018-11-23 12:16:38,868 INFO L273 TraceCheckUtils]: 30: Hoare triple {650#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {650#false} is VALID [2018-11-23 12:16:38,868 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:38,868 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:38,868 INFO L273 TraceCheckUtils]: 33: Hoare triple {649#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {649#true} is VALID [2018-11-23 12:16:38,869 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:38,869 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:38,869 INFO L273 TraceCheckUtils]: 36: Hoare triple {649#true} assume !(~i~0 < 10); {649#true} is VALID [2018-11-23 12:16:38,869 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:38,870 INFO L273 TraceCheckUtils]: 38: Hoare triple {649#true} assume true; {649#true} is VALID [2018-11-23 12:16:38,870 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {649#true} {650#false} #79#return; {650#false} is VALID [2018-11-23 12:16:38,870 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:38,870 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:38,870 INFO L273 TraceCheckUtils]: 42: Hoare triple {650#false} assume !false; {650#false} is VALID [2018-11-23 12:16:38,873 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:38,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:16:38,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:16:38,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-11-23 12:16:38,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:38,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:16:38,952 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:38,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:16:38,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:16:38,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:16:38,954 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 3 states. [2018-11-23 12:16:39,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:39,092 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-23 12:16:39,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:16:39,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-11-23 12:16:39,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:39,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:16:39,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2018-11-23 12:16:39,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:16:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2018-11-23 12:16:39,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 49 transitions. [2018-11-23 12:16:39,196 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:39,198 INFO L225 Difference]: With dead ends: 45 [2018-11-23 12:16:39,199 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:16:39,199 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:39,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:16:39,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-23 12:16:39,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:39,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2018-11-23 12:16:39,211 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2018-11-23 12:16:39,211 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2018-11-23 12:16:39,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:39,213 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 12:16:39,214 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 12:16:39,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:39,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:39,215 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2018-11-23 12:16:39,215 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2018-11-23 12:16:39,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:39,217 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 12:16:39,218 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 12:16:39,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:39,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:39,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:39,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:16:39,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 12:16:39,224 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 43 [2018-11-23 12:16:39,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:39,225 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 12:16:39,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:16:39,225 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 12:16:39,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 12:16:39,227 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:39,227 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:39,227 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:39,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:39,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1550635457, now seen corresponding path program 1 times [2018-11-23 12:16:39,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:39,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:39,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:39,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:39,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:39,342 INFO L256 TraceCheckUtils]: 0: Hoare triple {823#true} call ULTIMATE.init(); {823#true} is VALID [2018-11-23 12:16:39,343 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:39,343 INFO L273 TraceCheckUtils]: 2: Hoare triple {823#true} assume true; {823#true} is VALID [2018-11-23 12:16:39,343 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {823#true} {823#true} #71#return; {823#true} is VALID [2018-11-23 12:16:39,344 INFO L256 TraceCheckUtils]: 4: Hoare triple {823#true} call #t~ret14 := main(); {823#true} is VALID [2018-11-23 12:16:39,344 INFO L273 TraceCheckUtils]: 5: Hoare triple {823#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);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:39,345 INFO L273 TraceCheckUtils]: 6: Hoare triple {825#(= main_~i~1 0)} assume !!(~i~1 < 10);assume -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:39,345 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:39,346 INFO L273 TraceCheckUtils]: 8: Hoare triple {826#(<= main_~i~1 1)} assume !(~i~1 < 10); {824#false} is VALID [2018-11-23 12:16:39,346 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:39,346 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:39,346 INFO L273 TraceCheckUtils]: 11: Hoare triple {823#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {823#true} is VALID [2018-11-23 12:16:39,347 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:39,347 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:39,347 INFO L273 TraceCheckUtils]: 14: Hoare triple {823#true} assume !(~i~0 < 10); {823#true} is VALID [2018-11-23 12:16:39,347 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:39,348 INFO L273 TraceCheckUtils]: 16: Hoare triple {823#true} assume true; {823#true} is VALID [2018-11-23 12:16:39,348 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {823#true} {824#false} #75#return; {824#false} is VALID [2018-11-23 12:16:39,349 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:39,349 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:39,350 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:39,350 INFO L273 TraceCheckUtils]: 21: Hoare triple {823#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {823#true} is VALID [2018-11-23 12:16:39,350 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:39,350 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:39,351 INFO L273 TraceCheckUtils]: 24: Hoare triple {823#true} assume !(~i~0 < 10); {823#true} is VALID [2018-11-23 12:16:39,351 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:39,351 INFO L273 TraceCheckUtils]: 26: Hoare triple {823#true} assume true; {823#true} is VALID [2018-11-23 12:16:39,351 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {823#true} {824#false} #77#return; {824#false} is VALID [2018-11-23 12:16:39,352 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:39,352 INFO L273 TraceCheckUtils]: 29: Hoare triple {824#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.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:39,352 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:39,353 INFO L273 TraceCheckUtils]: 31: Hoare triple {824#false} assume !(~i~2 < 9); {824#false} is VALID [2018-11-23 12:16:39,353 INFO L273 TraceCheckUtils]: 32: Hoare triple {824#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {824#false} is VALID [2018-11-23 12:16:39,353 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:39,353 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:39,354 INFO L273 TraceCheckUtils]: 35: Hoare triple {823#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {823#true} is VALID [2018-11-23 12:16:39,354 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:39,355 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:39,355 INFO L273 TraceCheckUtils]: 38: Hoare triple {823#true} assume !(~i~0 < 10); {823#true} is VALID [2018-11-23 12:16:39,355 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:39,356 INFO L273 TraceCheckUtils]: 40: Hoare triple {823#true} assume true; {823#true} is VALID [2018-11-23 12:16:39,356 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {823#true} {824#false} #79#return; {824#false} is VALID [2018-11-23 12:16:39,356 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:39,357 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:39,357 INFO L273 TraceCheckUtils]: 44: Hoare triple {824#false} assume !false; {824#false} is VALID [2018-11-23 12:16:39,361 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:39,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:39,362 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:39,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:39,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:39,764 INFO L256 TraceCheckUtils]: 0: Hoare triple {823#true} call ULTIMATE.init(); {823#true} is VALID [2018-11-23 12:16:39,765 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:39,765 INFO L273 TraceCheckUtils]: 2: Hoare triple {823#true} assume true; {823#true} is VALID [2018-11-23 12:16:39,766 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {823#true} {823#true} #71#return; {823#true} is VALID [2018-11-23 12:16:39,766 INFO L256 TraceCheckUtils]: 4: Hoare triple {823#true} call #t~ret14 := main(); {823#true} is VALID [2018-11-23 12:16:39,767 INFO L273 TraceCheckUtils]: 5: Hoare triple {823#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);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:39,768 INFO L273 TraceCheckUtils]: 6: Hoare triple {845#(<= main_~i~1 0)} assume !!(~i~1 < 10);assume -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:39,769 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:39,770 INFO L273 TraceCheckUtils]: 8: Hoare triple {826#(<= main_~i~1 1)} assume !(~i~1 < 10); {824#false} is VALID [2018-11-23 12:16:39,770 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:39,770 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:39,771 INFO L273 TraceCheckUtils]: 11: Hoare triple {824#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {824#false} is VALID [2018-11-23 12:16:39,771 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:39,772 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:39,772 INFO L273 TraceCheckUtils]: 14: Hoare triple {824#false} assume !(~i~0 < 10); {824#false} is VALID [2018-11-23 12:16:39,772 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:39,773 INFO L273 TraceCheckUtils]: 16: Hoare triple {824#false} assume true; {824#false} is VALID [2018-11-23 12:16:39,773 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {824#false} {824#false} #75#return; {824#false} is VALID [2018-11-23 12:16:39,774 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:39,774 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:39,774 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:39,774 INFO L273 TraceCheckUtils]: 21: Hoare triple {824#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {824#false} is VALID [2018-11-23 12:16:39,774 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:39,775 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:39,775 INFO L273 TraceCheckUtils]: 24: Hoare triple {824#false} assume !(~i~0 < 10); {824#false} is VALID [2018-11-23 12:16:39,775 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:39,775 INFO L273 TraceCheckUtils]: 26: Hoare triple {824#false} assume true; {824#false} is VALID [2018-11-23 12:16:39,775 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {824#false} {824#false} #77#return; {824#false} is VALID [2018-11-23 12:16:39,776 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:39,776 INFO L273 TraceCheckUtils]: 29: Hoare triple {824#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.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:39,776 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:39,776 INFO L273 TraceCheckUtils]: 31: Hoare triple {824#false} assume !(~i~2 < 9); {824#false} is VALID [2018-11-23 12:16:39,777 INFO L273 TraceCheckUtils]: 32: Hoare triple {824#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {824#false} is VALID [2018-11-23 12:16:39,777 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:39,777 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:39,777 INFO L273 TraceCheckUtils]: 35: Hoare triple {824#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {824#false} is VALID [2018-11-23 12:16:39,778 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:39,778 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:39,778 INFO L273 TraceCheckUtils]: 38: Hoare triple {824#false} assume !(~i~0 < 10); {824#false} is VALID [2018-11-23 12:16:39,779 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:39,779 INFO L273 TraceCheckUtils]: 40: Hoare triple {824#false} assume true; {824#false} is VALID [2018-11-23 12:16:39,779 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {824#false} {824#false} #79#return; {824#false} is VALID [2018-11-23 12:16:39,779 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:39,780 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:39,780 INFO L273 TraceCheckUtils]: 44: Hoare triple {824#false} assume !false; {824#false} is VALID [2018-11-23 12:16:39,783 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:39,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:39,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:16:39,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-23 12:16:39,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:39,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:16:39,903 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:39,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:16:39,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:16:39,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:16:39,904 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 5 states. [2018-11-23 12:16:40,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:40,061 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2018-11-23 12:16:40,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:16:40,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-23 12:16:40,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:40,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:16:40,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2018-11-23 12:16:40,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:16:40,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2018-11-23 12:16:40,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 60 transitions. [2018-11-23 12:16:40,198 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:40,200 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:16:40,201 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 12:16:40,202 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:40,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 12:16:40,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-23 12:16:40,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:40,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2018-11-23 12:16:40,221 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2018-11-23 12:16:40,222 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2018-11-23 12:16:40,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:40,225 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-23 12:16:40,225 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-23 12:16:40,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:40,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:40,226 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2018-11-23 12:16:40,226 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2018-11-23 12:16:40,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:40,228 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-23 12:16:40,229 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-23 12:16:40,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:40,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:40,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:40,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:40,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:16:40,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-23 12:16:40,232 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 45 [2018-11-23 12:16:40,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:40,232 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-23 12:16:40,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:16:40,232 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-23 12:16:40,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 12:16:40,233 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:40,233 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:40,234 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:40,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:40,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1356401117, now seen corresponding path program 2 times [2018-11-23 12:16:40,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:40,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:40,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:40,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:40,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:40,511 INFO L256 TraceCheckUtils]: 0: Hoare triple {1152#true} call ULTIMATE.init(); {1152#true} is VALID [2018-11-23 12:16:40,511 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:40,512 INFO L273 TraceCheckUtils]: 2: Hoare triple {1152#true} assume true; {1152#true} is VALID [2018-11-23 12:16:40,512 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1152#true} {1152#true} #71#return; {1152#true} is VALID [2018-11-23 12:16:40,512 INFO L256 TraceCheckUtils]: 4: Hoare triple {1152#true} call #t~ret14 := main(); {1152#true} is VALID [2018-11-23 12:16:40,513 INFO L273 TraceCheckUtils]: 5: Hoare triple {1152#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);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:40,524 INFO L273 TraceCheckUtils]: 6: Hoare triple {1154#(= main_~i~1 0)} assume !!(~i~1 < 10);assume -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:40,525 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:40,526 INFO L273 TraceCheckUtils]: 8: Hoare triple {1155#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -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:40,526 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:40,527 INFO L273 TraceCheckUtils]: 10: Hoare triple {1156#(<= main_~i~1 2)} assume !(~i~1 < 10); {1153#false} is VALID [2018-11-23 12:16:40,527 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:40,527 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:40,527 INFO L273 TraceCheckUtils]: 13: Hoare triple {1152#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1152#true} is VALID [2018-11-23 12:16:40,528 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:40,528 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:40,528 INFO L273 TraceCheckUtils]: 16: Hoare triple {1152#true} assume !(~i~0 < 10); {1152#true} is VALID [2018-11-23 12:16:40,528 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:40,529 INFO L273 TraceCheckUtils]: 18: Hoare triple {1152#true} assume true; {1152#true} is VALID [2018-11-23 12:16:40,529 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1152#true} {1153#false} #75#return; {1153#false} is VALID [2018-11-23 12:16:40,529 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:40,530 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:40,530 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:40,530 INFO L273 TraceCheckUtils]: 23: Hoare triple {1152#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1152#true} is VALID [2018-11-23 12:16:40,530 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:40,531 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:40,531 INFO L273 TraceCheckUtils]: 26: Hoare triple {1152#true} assume !(~i~0 < 10); {1152#true} is VALID [2018-11-23 12:16:40,531 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:40,531 INFO L273 TraceCheckUtils]: 28: Hoare triple {1152#true} assume true; {1152#true} is VALID [2018-11-23 12:16:40,531 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1152#true} {1153#false} #77#return; {1153#false} is VALID [2018-11-23 12:16:40,532 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:40,532 INFO L273 TraceCheckUtils]: 31: Hoare triple {1153#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.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:40,532 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:40,532 INFO L273 TraceCheckUtils]: 33: Hoare triple {1153#false} assume !(~i~2 < 9); {1153#false} is VALID [2018-11-23 12:16:40,532 INFO L273 TraceCheckUtils]: 34: Hoare triple {1153#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {1153#false} is VALID [2018-11-23 12:16:40,533 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:40,533 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:40,533 INFO L273 TraceCheckUtils]: 37: Hoare triple {1152#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1152#true} is VALID [2018-11-23 12:16:40,533 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:40,534 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:40,534 INFO L273 TraceCheckUtils]: 40: Hoare triple {1152#true} assume !(~i~0 < 10); {1152#true} is VALID [2018-11-23 12:16:40,534 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:40,534 INFO L273 TraceCheckUtils]: 42: Hoare triple {1152#true} assume true; {1152#true} is VALID [2018-11-23 12:16:40,534 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {1152#true} {1153#false} #79#return; {1153#false} is VALID [2018-11-23 12:16:40,535 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:40,535 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:40,536 INFO L273 TraceCheckUtils]: 46: Hoare triple {1153#false} assume !false; {1153#false} is VALID [2018-11-23 12:16:40,538 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:40,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:40,538 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:40,549 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:16:40,600 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:16:40,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:40,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:40,716 INFO L256 TraceCheckUtils]: 0: Hoare triple {1152#true} call ULTIMATE.init(); {1152#true} is VALID [2018-11-23 12:16:40,717 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:40,717 INFO L273 TraceCheckUtils]: 2: Hoare triple {1152#true} assume true; {1152#true} is VALID [2018-11-23 12:16:40,717 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1152#true} {1152#true} #71#return; {1152#true} is VALID [2018-11-23 12:16:40,718 INFO L256 TraceCheckUtils]: 4: Hoare triple {1152#true} call #t~ret14 := main(); {1152#true} is VALID [2018-11-23 12:16:40,719 INFO L273 TraceCheckUtils]: 5: Hoare triple {1152#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);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:40,720 INFO L273 TraceCheckUtils]: 6: Hoare triple {1175#(<= main_~i~1 0)} assume !!(~i~1 < 10);assume -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:40,721 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:40,721 INFO L273 TraceCheckUtils]: 8: Hoare triple {1155#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -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:40,722 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:40,723 INFO L273 TraceCheckUtils]: 10: Hoare triple {1156#(<= main_~i~1 2)} assume !(~i~1 < 10); {1153#false} is VALID [2018-11-23 12:16:40,723 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:40,724 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:40,724 INFO L273 TraceCheckUtils]: 13: Hoare triple {1153#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1153#false} is VALID [2018-11-23 12:16:40,724 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:40,724 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:40,725 INFO L273 TraceCheckUtils]: 16: Hoare triple {1153#false} assume !(~i~0 < 10); {1153#false} is VALID [2018-11-23 12:16:40,725 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:40,725 INFO L273 TraceCheckUtils]: 18: Hoare triple {1153#false} assume true; {1153#false} is VALID [2018-11-23 12:16:40,726 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1153#false} {1153#false} #75#return; {1153#false} is VALID [2018-11-23 12:16:40,726 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:40,726 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:40,727 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:40,727 INFO L273 TraceCheckUtils]: 23: Hoare triple {1153#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1153#false} is VALID [2018-11-23 12:16:40,727 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:40,727 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:40,728 INFO L273 TraceCheckUtils]: 26: Hoare triple {1153#false} assume !(~i~0 < 10); {1153#false} is VALID [2018-11-23 12:16:40,728 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:40,728 INFO L273 TraceCheckUtils]: 28: Hoare triple {1153#false} assume true; {1153#false} is VALID [2018-11-23 12:16:40,728 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1153#false} {1153#false} #77#return; {1153#false} is VALID [2018-11-23 12:16:40,728 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:40,729 INFO L273 TraceCheckUtils]: 31: Hoare triple {1153#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.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:40,729 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:40,729 INFO L273 TraceCheckUtils]: 33: Hoare triple {1153#false} assume !(~i~2 < 9); {1153#false} is VALID [2018-11-23 12:16:40,729 INFO L273 TraceCheckUtils]: 34: Hoare triple {1153#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {1153#false} is VALID [2018-11-23 12:16:40,729 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:40,730 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:40,730 INFO L273 TraceCheckUtils]: 37: Hoare triple {1153#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1153#false} is VALID [2018-11-23 12:16:40,730 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:40,730 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:40,730 INFO L273 TraceCheckUtils]: 40: Hoare triple {1153#false} assume !(~i~0 < 10); {1153#false} is VALID [2018-11-23 12:16:40,731 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:40,731 INFO L273 TraceCheckUtils]: 42: Hoare triple {1153#false} assume true; {1153#false} is VALID [2018-11-23 12:16:40,731 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {1153#false} {1153#false} #79#return; {1153#false} is VALID [2018-11-23 12:16:40,731 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:40,731 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:40,732 INFO L273 TraceCheckUtils]: 46: Hoare triple {1153#false} assume !false; {1153#false} is VALID [2018-11-23 12:16:40,734 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:40,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:40,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:16:40,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-11-23 12:16:40,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:40,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:16:40,814 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:40,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:16:40,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:16:40,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:16:40,816 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 6 states. [2018-11-23 12:16:41,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:41,037 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-23 12:16:41,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:16:41,037 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-11-23 12:16:41,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:41,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:16:41,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2018-11-23 12:16:41,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:16:41,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2018-11-23 12:16:41,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2018-11-23 12:16:41,259 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:41,260 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:16:41,261 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 12:16:41,261 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:41,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 12:16:41,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-11-23 12:16:41,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:41,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2018-11-23 12:16:41,288 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2018-11-23 12:16:41,289 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2018-11-23 12:16:41,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:41,293 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-23 12:16:41,294 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-11-23 12:16:41,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:41,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:41,294 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2018-11-23 12:16:41,294 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2018-11-23 12:16:41,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:41,297 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-23 12:16:41,297 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-11-23 12:16:41,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:41,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:41,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:41,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:41,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:16:41,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-11-23 12:16:41,300 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 47 [2018-11-23 12:16:41,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:41,300 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-23 12:16:41,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:16:41,300 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 12:16:41,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 12:16:41,301 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:41,301 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:41,302 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:41,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:41,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1005160965, now seen corresponding path program 3 times [2018-11-23 12:16:41,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:41,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:41,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:41,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:41,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:41,920 INFO L256 TraceCheckUtils]: 0: Hoare triple {1498#true} call ULTIMATE.init(); {1498#true} is VALID [2018-11-23 12:16:41,921 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:41,921 INFO L273 TraceCheckUtils]: 2: Hoare triple {1498#true} assume true; {1498#true} is VALID [2018-11-23 12:16:41,922 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1498#true} {1498#true} #71#return; {1498#true} is VALID [2018-11-23 12:16:41,922 INFO L256 TraceCheckUtils]: 4: Hoare triple {1498#true} call #t~ret14 := main(); {1498#true} is VALID [2018-11-23 12:16:41,923 INFO L273 TraceCheckUtils]: 5: Hoare triple {1498#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);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:41,923 INFO L273 TraceCheckUtils]: 6: Hoare triple {1500#(= main_~i~1 0)} assume !!(~i~1 < 10);assume -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:41,924 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:41,924 INFO L273 TraceCheckUtils]: 8: Hoare triple {1501#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -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:41,925 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:41,925 INFO L273 TraceCheckUtils]: 10: Hoare triple {1502#(<= main_~i~1 2)} assume !!(~i~1 < 10);assume -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:41,926 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:41,927 INFO L273 TraceCheckUtils]: 12: Hoare triple {1503#(<= main_~i~1 3)} assume !(~i~1 < 10); {1499#false} is VALID [2018-11-23 12:16:41,927 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:41,927 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:41,928 INFO L273 TraceCheckUtils]: 15: Hoare triple {1498#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1498#true} is VALID [2018-11-23 12:16:41,928 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:41,928 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:41,929 INFO L273 TraceCheckUtils]: 18: Hoare triple {1498#true} assume !(~i~0 < 10); {1498#true} is VALID [2018-11-23 12:16:41,929 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:41,929 INFO L273 TraceCheckUtils]: 20: Hoare triple {1498#true} assume true; {1498#true} is VALID [2018-11-23 12:16:41,930 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1498#true} {1499#false} #75#return; {1499#false} is VALID [2018-11-23 12:16:41,930 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:41,930 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:41,930 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:41,930 INFO L273 TraceCheckUtils]: 25: Hoare triple {1498#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1498#true} is VALID [2018-11-23 12:16:41,930 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:41,931 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:41,931 INFO L273 TraceCheckUtils]: 28: Hoare triple {1498#true} assume !(~i~0 < 10); {1498#true} is VALID [2018-11-23 12:16:41,931 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:41,931 INFO L273 TraceCheckUtils]: 30: Hoare triple {1498#true} assume true; {1498#true} is VALID [2018-11-23 12:16:41,931 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1498#true} {1499#false} #77#return; {1499#false} is VALID [2018-11-23 12:16:41,933 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:41,933 INFO L273 TraceCheckUtils]: 33: Hoare triple {1499#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.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:41,933 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:41,933 INFO L273 TraceCheckUtils]: 35: Hoare triple {1499#false} assume !(~i~2 < 9); {1499#false} is VALID [2018-11-23 12:16:41,933 INFO L273 TraceCheckUtils]: 36: Hoare triple {1499#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {1499#false} is VALID [2018-11-23 12:16:41,936 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:41,936 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:41,936 INFO L273 TraceCheckUtils]: 39: Hoare triple {1498#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1498#true} is VALID [2018-11-23 12:16:41,936 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:41,937 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:41,937 INFO L273 TraceCheckUtils]: 42: Hoare triple {1498#true} assume !(~i~0 < 10); {1498#true} is VALID [2018-11-23 12:16:41,937 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:41,937 INFO L273 TraceCheckUtils]: 44: Hoare triple {1498#true} assume true; {1498#true} is VALID [2018-11-23 12:16:41,938 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1498#true} {1499#false} #79#return; {1499#false} is VALID [2018-11-23 12:16:41,938 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:41,938 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:41,938 INFO L273 TraceCheckUtils]: 48: Hoare triple {1499#false} assume !false; {1499#false} is VALID [2018-11-23 12:16:41,941 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:41,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:41,942 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:41,950 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:16:41,981 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:16:41,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:42,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:42,163 INFO L256 TraceCheckUtils]: 0: Hoare triple {1498#true} call ULTIMATE.init(); {1498#true} is VALID [2018-11-23 12:16:42,163 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:42,164 INFO L273 TraceCheckUtils]: 2: Hoare triple {1498#true} assume true; {1498#true} is VALID [2018-11-23 12:16:42,164 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1498#true} {1498#true} #71#return; {1498#true} is VALID [2018-11-23 12:16:42,164 INFO L256 TraceCheckUtils]: 4: Hoare triple {1498#true} call #t~ret14 := main(); {1498#true} is VALID [2018-11-23 12:16:42,165 INFO L273 TraceCheckUtils]: 5: Hoare triple {1498#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1498#true} is VALID [2018-11-23 12:16:42,165 INFO L273 TraceCheckUtils]: 6: Hoare triple {1498#true} assume !!(~i~1 < 10);assume -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:42,165 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:42,165 INFO L273 TraceCheckUtils]: 8: Hoare triple {1498#true} assume !!(~i~1 < 10);assume -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:42,166 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:42,166 INFO L273 TraceCheckUtils]: 10: Hoare triple {1498#true} assume !!(~i~1 < 10);assume -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:42,166 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:42,166 INFO L273 TraceCheckUtils]: 12: Hoare triple {1498#true} assume !(~i~1 < 10); {1498#true} is VALID [2018-11-23 12:16:42,166 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:42,166 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:42,167 INFO L273 TraceCheckUtils]: 15: Hoare triple {1498#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1498#true} is VALID [2018-11-23 12:16:42,167 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:42,167 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:42,167 INFO L273 TraceCheckUtils]: 18: Hoare triple {1498#true} assume !(~i~0 < 10); {1498#true} is VALID [2018-11-23 12:16:42,167 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:42,168 INFO L273 TraceCheckUtils]: 20: Hoare triple {1498#true} assume true; {1498#true} is VALID [2018-11-23 12:16:42,168 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1498#true} {1498#true} #75#return; {1498#true} is VALID [2018-11-23 12:16:42,168 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:42,168 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:42,168 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:42,169 INFO L273 TraceCheckUtils]: 25: Hoare triple {1498#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1498#true} is VALID [2018-11-23 12:16:42,169 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:42,169 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:42,169 INFO L273 TraceCheckUtils]: 28: Hoare triple {1498#true} assume !(~i~0 < 10); {1498#true} is VALID [2018-11-23 12:16:42,169 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:42,170 INFO L273 TraceCheckUtils]: 30: Hoare triple {1498#true} assume true; {1498#true} is VALID [2018-11-23 12:16:42,170 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1498#true} {1498#true} #77#return; {1498#true} is VALID [2018-11-23 12:16:42,170 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:42,170 INFO L273 TraceCheckUtils]: 33: Hoare triple {1498#true} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.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:42,170 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:42,171 INFO L273 TraceCheckUtils]: 35: Hoare triple {1498#true} assume !(~i~2 < 9); {1498#true} is VALID [2018-11-23 12:16:42,171 INFO L273 TraceCheckUtils]: 36: Hoare triple {1498#true} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {1498#true} is VALID [2018-11-23 12:16:42,171 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:42,185 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:42,186 INFO L273 TraceCheckUtils]: 39: Hoare triple {1621#(<= sep_~i~0 0)} assume !!(~i~0 < 10);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:42,187 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:42,189 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:42,189 INFO L273 TraceCheckUtils]: 42: Hoare triple {1631#(<= sep_~i~0 1)} assume !(~i~0 < 10); {1499#false} is VALID [2018-11-23 12:16:42,189 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:42,189 INFO L273 TraceCheckUtils]: 44: Hoare triple {1499#false} assume true; {1499#false} is VALID [2018-11-23 12:16:42,190 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1499#false} {1498#true} #79#return; {1499#false} is VALID [2018-11-23 12:16:42,190 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:42,190 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:42,190 INFO L273 TraceCheckUtils]: 48: Hoare triple {1499#false} assume !false; {1499#false} is VALID [2018-11-23 12:16:42,191 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:42,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:42,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-23 12:16:42,211 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-23 12:16:42,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:42,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:16:42,292 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:42,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:16:42,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:16:42,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:16:42,293 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 8 states. [2018-11-23 12:16:42,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:42,574 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2018-11-23 12:16:42,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:16:42,574 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-23 12:16:42,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:42,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:16:42,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2018-11-23 12:16:42,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:16:42,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2018-11-23 12:16:42,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 76 transitions. [2018-11-23 12:16:42,730 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:42,731 INFO L225 Difference]: With dead ends: 63 [2018-11-23 12:16:42,731 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:16:42,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:16:42,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:16:42,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-11-23 12:16:42,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:42,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 39 states. [2018-11-23 12:16:42,778 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 39 states. [2018-11-23 12:16:42,778 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 39 states. [2018-11-23 12:16:42,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:42,781 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-23 12:16:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-23 12:16:42,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:42,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:42,782 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 42 states. [2018-11-23 12:16:42,782 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 42 states. [2018-11-23 12:16:42,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:42,784 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-23 12:16:42,784 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-23 12:16:42,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:42,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:42,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:42,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:42,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:16:42,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-11-23 12:16:42,787 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 49 [2018-11-23 12:16:42,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:42,788 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-11-23 12:16:42,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:16:42,788 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-11-23 12:16:42,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 12:16:42,789 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:42,789 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:42,789 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:42,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:42,790 INFO L82 PathProgramCache]: Analyzing trace with hash 742022364, now seen corresponding path program 4 times [2018-11-23 12:16:42,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:42,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:42,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:42,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:42,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:43,162 INFO L256 TraceCheckUtils]: 0: Hoare triple {1882#true} call ULTIMATE.init(); {1882#true} is VALID [2018-11-23 12:16:43,162 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:43,163 INFO L273 TraceCheckUtils]: 2: Hoare triple {1882#true} assume true; {1882#true} is VALID [2018-11-23 12:16:43,163 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1882#true} {1882#true} #71#return; {1882#true} is VALID [2018-11-23 12:16:43,163 INFO L256 TraceCheckUtils]: 4: Hoare triple {1882#true} call #t~ret14 := main(); {1882#true} is VALID [2018-11-23 12:16:43,164 INFO L273 TraceCheckUtils]: 5: Hoare triple {1882#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);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:43,164 INFO L273 TraceCheckUtils]: 6: Hoare triple {1884#(= main_~i~1 0)} assume !!(~i~1 < 10);assume -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:43,165 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:43,166 INFO L273 TraceCheckUtils]: 8: Hoare triple {1885#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -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:43,167 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:43,168 INFO L273 TraceCheckUtils]: 10: Hoare triple {1886#(<= main_~i~1 2)} assume !!(~i~1 < 10);assume -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:43,168 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:43,169 INFO L273 TraceCheckUtils]: 12: Hoare triple {1887#(<= main_~i~1 3)} assume !!(~i~1 < 10);assume -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:43,170 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:43,171 INFO L273 TraceCheckUtils]: 14: Hoare triple {1888#(<= main_~i~1 4)} assume !(~i~1 < 10); {1883#false} is VALID [2018-11-23 12:16:43,171 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:43,171 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:43,172 INFO L273 TraceCheckUtils]: 17: Hoare triple {1882#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1882#true} is VALID [2018-11-23 12:16:43,172 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:43,172 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:43,172 INFO L273 TraceCheckUtils]: 20: Hoare triple {1882#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1882#true} is VALID [2018-11-23 12:16:43,173 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:43,173 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:43,173 INFO L273 TraceCheckUtils]: 23: Hoare triple {1882#true} assume !(~i~0 < 10); {1882#true} is VALID [2018-11-23 12:16:43,174 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:43,174 INFO L273 TraceCheckUtils]: 25: Hoare triple {1882#true} assume true; {1882#true} is VALID [2018-11-23 12:16:43,174 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1882#true} {1883#false} #75#return; {1883#false} is VALID [2018-11-23 12:16:43,174 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:43,174 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:43,175 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:43,175 INFO L273 TraceCheckUtils]: 30: Hoare triple {1882#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1882#true} is VALID [2018-11-23 12:16:43,175 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:43,175 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:43,175 INFO L273 TraceCheckUtils]: 33: Hoare triple {1882#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1882#true} is VALID [2018-11-23 12:16:43,176 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:43,176 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:43,176 INFO L273 TraceCheckUtils]: 36: Hoare triple {1882#true} assume !(~i~0 < 10); {1882#true} is VALID [2018-11-23 12:16:43,176 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:43,176 INFO L273 TraceCheckUtils]: 38: Hoare triple {1882#true} assume true; {1882#true} is VALID [2018-11-23 12:16:43,177 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1882#true} {1883#false} #77#return; {1883#false} is VALID [2018-11-23 12:16:43,177 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:43,177 INFO L273 TraceCheckUtils]: 41: Hoare triple {1883#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.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:43,177 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:43,178 INFO L273 TraceCheckUtils]: 43: Hoare triple {1883#false} assume !(~i~2 < 9); {1883#false} is VALID [2018-11-23 12:16:43,178 INFO L273 TraceCheckUtils]: 44: Hoare triple {1883#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {1883#false} is VALID [2018-11-23 12:16:43,178 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:43,178 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:43,179 INFO L273 TraceCheckUtils]: 47: Hoare triple {1882#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1882#true} is VALID [2018-11-23 12:16:43,179 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:43,179 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:43,179 INFO L273 TraceCheckUtils]: 50: Hoare triple {1882#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1882#true} is VALID [2018-11-23 12:16:43,180 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:43,180 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:43,180 INFO L273 TraceCheckUtils]: 53: Hoare triple {1882#true} assume !(~i~0 < 10); {1882#true} is VALID [2018-11-23 12:16:43,180 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:43,181 INFO L273 TraceCheckUtils]: 55: Hoare triple {1882#true} assume true; {1882#true} is VALID [2018-11-23 12:16:43,181 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {1882#true} {1883#false} #79#return; {1883#false} is VALID [2018-11-23 12:16:43,181 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:43,181 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:43,182 INFO L273 TraceCheckUtils]: 59: Hoare triple {1883#false} assume !false; {1883#false} is VALID [2018-11-23 12:16:43,186 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:43,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:43,186 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:43,201 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:16:43,241 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:16:43,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:43,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:43,459 INFO L256 TraceCheckUtils]: 0: Hoare triple {1882#true} call ULTIMATE.init(); {1882#true} is VALID [2018-11-23 12:16:43,459 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:43,459 INFO L273 TraceCheckUtils]: 2: Hoare triple {1882#true} assume true; {1882#true} is VALID [2018-11-23 12:16:43,460 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1882#true} {1882#true} #71#return; {1882#true} is VALID [2018-11-23 12:16:43,460 INFO L256 TraceCheckUtils]: 4: Hoare triple {1882#true} call #t~ret14 := main(); {1882#true} is VALID [2018-11-23 12:16:43,460 INFO L273 TraceCheckUtils]: 5: Hoare triple {1882#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1882#true} is VALID [2018-11-23 12:16:43,461 INFO L273 TraceCheckUtils]: 6: Hoare triple {1882#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1882#true} is VALID [2018-11-23 12:16:43,461 INFO L273 TraceCheckUtils]: 7: Hoare triple {1882#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1882#true} is VALID [2018-11-23 12:16:43,461 INFO L273 TraceCheckUtils]: 8: Hoare triple {1882#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1882#true} is VALID [2018-11-23 12:16:43,461 INFO L273 TraceCheckUtils]: 9: Hoare triple {1882#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1882#true} is VALID [2018-11-23 12:16:43,462 INFO L273 TraceCheckUtils]: 10: Hoare triple {1882#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1882#true} is VALID [2018-11-23 12:16:43,462 INFO L273 TraceCheckUtils]: 11: Hoare triple {1882#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1882#true} is VALID [2018-11-23 12:16:43,462 INFO L273 TraceCheckUtils]: 12: Hoare triple {1882#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {1882#true} is VALID [2018-11-23 12:16:43,462 INFO L273 TraceCheckUtils]: 13: Hoare triple {1882#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1882#true} is VALID [2018-11-23 12:16:43,462 INFO L273 TraceCheckUtils]: 14: Hoare triple {1882#true} assume !(~i~1 < 10); {1882#true} is VALID [2018-11-23 12:16:43,462 INFO L256 TraceCheckUtils]: 15: Hoare triple {1882#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {1882#true} is VALID [2018-11-23 12:16:43,463 INFO L273 TraceCheckUtils]: 16: Hoare triple {1882#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {1940#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:43,463 INFO L273 TraceCheckUtils]: 17: Hoare triple {1940#(<= sep_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1940#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:43,464 INFO L273 TraceCheckUtils]: 18: Hoare triple {1940#(<= 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; {1940#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:43,464 INFO L273 TraceCheckUtils]: 19: Hoare triple {1940#(<= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1950#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:43,465 INFO L273 TraceCheckUtils]: 20: Hoare triple {1950#(<= sep_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1950#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:43,465 INFO L273 TraceCheckUtils]: 21: Hoare triple {1950#(<= 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; {1950#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:43,465 INFO L273 TraceCheckUtils]: 22: Hoare triple {1950#(<= sep_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1960#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:43,466 INFO L273 TraceCheckUtils]: 23: Hoare triple {1960#(<= sep_~i~0 2)} assume !(~i~0 < 10); {1883#false} is VALID [2018-11-23 12:16:43,466 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:43,466 INFO L273 TraceCheckUtils]: 25: Hoare triple {1883#false} assume true; {1883#false} is VALID [2018-11-23 12:16:43,466 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1883#false} {1882#true} #75#return; {1883#false} is VALID [2018-11-23 12:16:43,466 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:43,467 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:43,467 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:43,467 INFO L273 TraceCheckUtils]: 30: Hoare triple {1883#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1883#false} is VALID [2018-11-23 12:16:43,467 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:43,468 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:43,468 INFO L273 TraceCheckUtils]: 33: Hoare triple {1883#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1883#false} is VALID [2018-11-23 12:16:43,468 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:43,468 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:43,468 INFO L273 TraceCheckUtils]: 36: Hoare triple {1883#false} assume !(~i~0 < 10); {1883#false} is VALID [2018-11-23 12:16:43,469 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:43,469 INFO L273 TraceCheckUtils]: 38: Hoare triple {1883#false} assume true; {1883#false} is VALID [2018-11-23 12:16:43,469 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1883#false} {1883#false} #77#return; {1883#false} is VALID [2018-11-23 12:16:43,469 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:43,469 INFO L273 TraceCheckUtils]: 41: Hoare triple {1883#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.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:43,469 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:43,469 INFO L273 TraceCheckUtils]: 43: Hoare triple {1883#false} assume !(~i~2 < 9); {1883#false} is VALID [2018-11-23 12:16:43,470 INFO L273 TraceCheckUtils]: 44: Hoare triple {1883#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {1883#false} is VALID [2018-11-23 12:16:43,470 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:43,470 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:43,470 INFO L273 TraceCheckUtils]: 47: Hoare triple {1883#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1883#false} is VALID [2018-11-23 12:16:43,470 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:43,470 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:43,470 INFO L273 TraceCheckUtils]: 50: Hoare triple {1883#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {1883#false} is VALID [2018-11-23 12:16:43,470 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:43,471 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:43,471 INFO L273 TraceCheckUtils]: 53: Hoare triple {1883#false} assume !(~i~0 < 10); {1883#false} is VALID [2018-11-23 12:16:43,471 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:43,471 INFO L273 TraceCheckUtils]: 55: Hoare triple {1883#false} assume true; {1883#false} is VALID [2018-11-23 12:16:43,471 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {1883#false} {1883#false} #79#return; {1883#false} is VALID [2018-11-23 12:16:43,471 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:43,471 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:43,472 INFO L273 TraceCheckUtils]: 59: Hoare triple {1883#false} assume !false; {1883#false} is VALID [2018-11-23 12:16:43,473 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 36 proven. 5 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-23 12:16:43,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:43,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-11-23 12:16:43,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2018-11-23 12:16:43,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:43,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:16:43,635 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:43,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:16:43,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:16:43,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:16:43,636 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 10 states. [2018-11-23 12:16:44,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:44,154 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2018-11-23 12:16:44,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:16:44,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2018-11-23 12:16:44,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:44,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:16:44,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2018-11-23 12:16:44,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:16:44,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 82 transitions. [2018-11-23 12:16:44,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 82 transitions. [2018-11-23 12:16:44,254 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:16:44,255 INFO L225 Difference]: With dead ends: 71 [2018-11-23 12:16:44,255 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 12:16:44,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:16:44,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 12:16:44,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-11-23 12:16:44,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:44,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 44 states. [2018-11-23 12:16:44,298 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 44 states. [2018-11-23 12:16:44,298 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 44 states. [2018-11-23 12:16:44,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:44,301 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-11-23 12:16:44,301 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-23 12:16:44,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:44,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:44,301 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 47 states. [2018-11-23 12:16:44,302 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 47 states. [2018-11-23 12:16:44,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:44,304 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-11-23 12:16:44,304 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-23 12:16:44,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:44,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:44,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:44,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:44,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:16:44,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-11-23 12:16:44,307 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 60 [2018-11-23 12:16:44,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:44,307 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-23 12:16:44,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:16:44,307 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-23 12:16:44,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 12:16:44,308 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:44,308 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 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:44,308 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:44,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:44,309 INFO L82 PathProgramCache]: Analyzing trace with hash -535819369, now seen corresponding path program 5 times [2018-11-23 12:16:44,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:44,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:44,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:44,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:44,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:45,279 INFO L256 TraceCheckUtils]: 0: Hoare triple {2329#true} call ULTIMATE.init(); {2329#true} is VALID [2018-11-23 12:16:45,279 INFO L273 TraceCheckUtils]: 1: Hoare triple {2329#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2329#true} is VALID [2018-11-23 12:16:45,280 INFO L273 TraceCheckUtils]: 2: Hoare triple {2329#true} assume true; {2329#true} is VALID [2018-11-23 12:16:45,280 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2329#true} {2329#true} #71#return; {2329#true} is VALID [2018-11-23 12:16:45,280 INFO L256 TraceCheckUtils]: 4: Hoare triple {2329#true} call #t~ret14 := main(); {2329#true} is VALID [2018-11-23 12:16:45,281 INFO L273 TraceCheckUtils]: 5: Hoare triple {2329#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2331#(= main_~i~1 0)} is VALID [2018-11-23 12:16:45,281 INFO L273 TraceCheckUtils]: 6: Hoare triple {2331#(= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2331#(= main_~i~1 0)} is VALID [2018-11-23 12:16:45,282 INFO L273 TraceCheckUtils]: 7: Hoare triple {2331#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2332#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:45,283 INFO L273 TraceCheckUtils]: 8: Hoare triple {2332#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2332#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:45,283 INFO L273 TraceCheckUtils]: 9: Hoare triple {2332#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2333#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:45,302 INFO L273 TraceCheckUtils]: 10: Hoare triple {2333#(<= main_~i~1 2)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2333#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:45,311 INFO L273 TraceCheckUtils]: 11: Hoare triple {2333#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2334#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:45,322 INFO L273 TraceCheckUtils]: 12: Hoare triple {2334#(<= main_~i~1 3)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2334#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:45,323 INFO L273 TraceCheckUtils]: 13: Hoare triple {2334#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2335#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:45,323 INFO L273 TraceCheckUtils]: 14: Hoare triple {2335#(<= main_~i~1 4)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2335#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:45,325 INFO L273 TraceCheckUtils]: 15: Hoare triple {2335#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2336#(<= main_~i~1 5)} is VALID [2018-11-23 12:16:45,325 INFO L273 TraceCheckUtils]: 16: Hoare triple {2336#(<= main_~i~1 5)} assume !(~i~1 < 10); {2330#false} is VALID [2018-11-23 12:16:45,325 INFO L256 TraceCheckUtils]: 17: Hoare triple {2330#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {2329#true} is VALID [2018-11-23 12:16:45,326 INFO L273 TraceCheckUtils]: 18: Hoare triple {2329#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2329#true} is VALID [2018-11-23 12:16:45,326 INFO L273 TraceCheckUtils]: 19: Hoare triple {2329#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2329#true} is VALID [2018-11-23 12:16:45,326 INFO L273 TraceCheckUtils]: 20: Hoare triple {2329#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2329#true} is VALID [2018-11-23 12:16:45,326 INFO L273 TraceCheckUtils]: 21: Hoare triple {2329#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2329#true} is VALID [2018-11-23 12:16:45,326 INFO L273 TraceCheckUtils]: 22: Hoare triple {2329#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2329#true} is VALID [2018-11-23 12:16:45,326 INFO L273 TraceCheckUtils]: 23: Hoare triple {2329#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2329#true} is VALID [2018-11-23 12:16:45,326 INFO L273 TraceCheckUtils]: 24: Hoare triple {2329#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2329#true} is VALID [2018-11-23 12:16:45,327 INFO L273 TraceCheckUtils]: 25: Hoare triple {2329#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2329#true} is VALID [2018-11-23 12:16:45,327 INFO L273 TraceCheckUtils]: 26: Hoare triple {2329#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2329#true} is VALID [2018-11-23 12:16:45,327 INFO L273 TraceCheckUtils]: 27: Hoare triple {2329#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2329#true} is VALID [2018-11-23 12:16:45,327 INFO L273 TraceCheckUtils]: 28: Hoare triple {2329#true} assume !(~i~0 < 10); {2329#true} is VALID [2018-11-23 12:16:45,327 INFO L273 TraceCheckUtils]: 29: Hoare triple {2329#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2329#true} is VALID [2018-11-23 12:16:45,327 INFO L273 TraceCheckUtils]: 30: Hoare triple {2329#true} assume true; {2329#true} is VALID [2018-11-23 12:16:45,328 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {2329#true} {2330#false} #75#return; {2330#false} is VALID [2018-11-23 12:16:45,328 INFO L273 TraceCheckUtils]: 32: Hoare triple {2330#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); {2330#false} is VALID [2018-11-23 12:16:45,328 INFO L256 TraceCheckUtils]: 33: Hoare triple {2330#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {2329#true} is VALID [2018-11-23 12:16:45,328 INFO L273 TraceCheckUtils]: 34: Hoare triple {2329#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2329#true} is VALID [2018-11-23 12:16:45,330 INFO L273 TraceCheckUtils]: 35: Hoare triple {2329#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2329#true} is VALID [2018-11-23 12:16:45,330 INFO L273 TraceCheckUtils]: 36: Hoare triple {2329#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2329#true} is VALID [2018-11-23 12:16:45,330 INFO L273 TraceCheckUtils]: 37: Hoare triple {2329#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2329#true} is VALID [2018-11-23 12:16:45,330 INFO L273 TraceCheckUtils]: 38: Hoare triple {2329#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2329#true} is VALID [2018-11-23 12:16:45,331 INFO L273 TraceCheckUtils]: 39: Hoare triple {2329#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2329#true} is VALID [2018-11-23 12:16:45,331 INFO L273 TraceCheckUtils]: 40: Hoare triple {2329#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2329#true} is VALID [2018-11-23 12:16:45,331 INFO L273 TraceCheckUtils]: 41: Hoare triple {2329#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2329#true} is VALID [2018-11-23 12:16:45,331 INFO L273 TraceCheckUtils]: 42: Hoare triple {2329#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2329#true} is VALID [2018-11-23 12:16:45,331 INFO L273 TraceCheckUtils]: 43: Hoare triple {2329#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2329#true} is VALID [2018-11-23 12:16:45,331 INFO L273 TraceCheckUtils]: 44: Hoare triple {2329#true} assume !(~i~0 < 10); {2329#true} is VALID [2018-11-23 12:16:45,332 INFO L273 TraceCheckUtils]: 45: Hoare triple {2329#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2329#true} is VALID [2018-11-23 12:16:45,332 INFO L273 TraceCheckUtils]: 46: Hoare triple {2329#true} assume true; {2329#true} is VALID [2018-11-23 12:16:45,332 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {2329#true} {2330#false} #77#return; {2330#false} is VALID [2018-11-23 12:16:45,332 INFO L273 TraceCheckUtils]: 48: Hoare triple {2330#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; {2330#false} is VALID [2018-11-23 12:16:45,332 INFO L273 TraceCheckUtils]: 49: Hoare triple {2330#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {2330#false} is VALID [2018-11-23 12:16:45,333 INFO L273 TraceCheckUtils]: 50: Hoare triple {2330#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {2330#false} is VALID [2018-11-23 12:16:45,333 INFO L273 TraceCheckUtils]: 51: Hoare triple {2330#false} assume !(~i~2 < 9); {2330#false} is VALID [2018-11-23 12:16:45,333 INFO L273 TraceCheckUtils]: 52: Hoare triple {2330#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {2330#false} is VALID [2018-11-23 12:16:45,333 INFO L256 TraceCheckUtils]: 53: Hoare triple {2330#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {2329#true} is VALID [2018-11-23 12:16:45,333 INFO L273 TraceCheckUtils]: 54: Hoare triple {2329#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2329#true} is VALID [2018-11-23 12:16:45,334 INFO L273 TraceCheckUtils]: 55: Hoare triple {2329#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2329#true} is VALID [2018-11-23 12:16:45,334 INFO L273 TraceCheckUtils]: 56: Hoare triple {2329#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2329#true} is VALID [2018-11-23 12:16:45,334 INFO L273 TraceCheckUtils]: 57: Hoare triple {2329#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2329#true} is VALID [2018-11-23 12:16:45,334 INFO L273 TraceCheckUtils]: 58: Hoare triple {2329#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2329#true} is VALID [2018-11-23 12:16:45,334 INFO L273 TraceCheckUtils]: 59: Hoare triple {2329#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2329#true} is VALID [2018-11-23 12:16:45,335 INFO L273 TraceCheckUtils]: 60: Hoare triple {2329#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2329#true} is VALID [2018-11-23 12:16:45,335 INFO L273 TraceCheckUtils]: 61: Hoare triple {2329#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2329#true} is VALID [2018-11-23 12:16:45,335 INFO L273 TraceCheckUtils]: 62: Hoare triple {2329#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2329#true} is VALID [2018-11-23 12:16:45,335 INFO L273 TraceCheckUtils]: 63: Hoare triple {2329#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2329#true} is VALID [2018-11-23 12:16:45,335 INFO L273 TraceCheckUtils]: 64: Hoare triple {2329#true} assume !(~i~0 < 10); {2329#true} is VALID [2018-11-23 12:16:45,336 INFO L273 TraceCheckUtils]: 65: Hoare triple {2329#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2329#true} is VALID [2018-11-23 12:16:45,336 INFO L273 TraceCheckUtils]: 66: Hoare triple {2329#true} assume true; {2329#true} is VALID [2018-11-23 12:16:45,336 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {2329#true} {2330#false} #79#return; {2330#false} is VALID [2018-11-23 12:16:45,336 INFO L273 TraceCheckUtils]: 68: Hoare triple {2330#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {2330#false} is VALID [2018-11-23 12:16:45,336 INFO L273 TraceCheckUtils]: 69: Hoare triple {2330#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2330#false} is VALID [2018-11-23 12:16:45,336 INFO L273 TraceCheckUtils]: 70: Hoare triple {2330#false} assume !false; {2330#false} is VALID [2018-11-23 12:16:45,348 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-11-23 12:16:45,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:45,348 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:45,364 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:16:45,447 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 12:16:45,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:45,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:45,635 INFO L256 TraceCheckUtils]: 0: Hoare triple {2329#true} call ULTIMATE.init(); {2329#true} is VALID [2018-11-23 12:16:45,635 INFO L273 TraceCheckUtils]: 1: Hoare triple {2329#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2329#true} is VALID [2018-11-23 12:16:45,636 INFO L273 TraceCheckUtils]: 2: Hoare triple {2329#true} assume true; {2329#true} is VALID [2018-11-23 12:16:45,636 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2329#true} {2329#true} #71#return; {2329#true} is VALID [2018-11-23 12:16:45,636 INFO L256 TraceCheckUtils]: 4: Hoare triple {2329#true} call #t~ret14 := main(); {2329#true} is VALID [2018-11-23 12:16:45,637 INFO L273 TraceCheckUtils]: 5: Hoare triple {2329#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2329#true} is VALID [2018-11-23 12:16:45,637 INFO L273 TraceCheckUtils]: 6: Hoare triple {2329#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2329#true} is VALID [2018-11-23 12:16:45,637 INFO L273 TraceCheckUtils]: 7: Hoare triple {2329#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2329#true} is VALID [2018-11-23 12:16:45,638 INFO L273 TraceCheckUtils]: 8: Hoare triple {2329#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2329#true} is VALID [2018-11-23 12:16:45,638 INFO L273 TraceCheckUtils]: 9: Hoare triple {2329#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2329#true} is VALID [2018-11-23 12:16:45,638 INFO L273 TraceCheckUtils]: 10: Hoare triple {2329#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2329#true} is VALID [2018-11-23 12:16:45,638 INFO L273 TraceCheckUtils]: 11: Hoare triple {2329#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2329#true} is VALID [2018-11-23 12:16:45,639 INFO L273 TraceCheckUtils]: 12: Hoare triple {2329#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2329#true} is VALID [2018-11-23 12:16:45,639 INFO L273 TraceCheckUtils]: 13: Hoare triple {2329#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2329#true} is VALID [2018-11-23 12:16:45,639 INFO L273 TraceCheckUtils]: 14: Hoare triple {2329#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2329#true} is VALID [2018-11-23 12:16:45,639 INFO L273 TraceCheckUtils]: 15: Hoare triple {2329#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2329#true} is VALID [2018-11-23 12:16:45,639 INFO L273 TraceCheckUtils]: 16: Hoare triple {2329#true} assume !(~i~1 < 10); {2329#true} is VALID [2018-11-23 12:16:45,639 INFO L256 TraceCheckUtils]: 17: Hoare triple {2329#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {2329#true} is VALID [2018-11-23 12:16:45,653 INFO L273 TraceCheckUtils]: 18: Hoare triple {2329#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2394#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:45,662 INFO L273 TraceCheckUtils]: 19: Hoare triple {2394#(<= sep_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2394#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:45,663 INFO L273 TraceCheckUtils]: 20: Hoare triple {2394#(<= 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; {2394#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:45,663 INFO L273 TraceCheckUtils]: 21: Hoare triple {2394#(<= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2404#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:45,665 INFO L273 TraceCheckUtils]: 22: Hoare triple {2404#(<= sep_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2404#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:45,665 INFO L273 TraceCheckUtils]: 23: Hoare triple {2404#(<= 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; {2404#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:45,665 INFO L273 TraceCheckUtils]: 24: Hoare triple {2404#(<= sep_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2414#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:45,666 INFO L273 TraceCheckUtils]: 25: Hoare triple {2414#(<= sep_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2414#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:45,667 INFO L273 TraceCheckUtils]: 26: Hoare triple {2414#(<= 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; {2414#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:45,685 INFO L273 TraceCheckUtils]: 27: Hoare triple {2414#(<= sep_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2424#(<= sep_~i~0 3)} is VALID [2018-11-23 12:16:45,694 INFO L273 TraceCheckUtils]: 28: Hoare triple {2424#(<= sep_~i~0 3)} assume !(~i~0 < 10); {2330#false} is VALID [2018-11-23 12:16:45,694 INFO L273 TraceCheckUtils]: 29: Hoare triple {2330#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2330#false} is VALID [2018-11-23 12:16:45,694 INFO L273 TraceCheckUtils]: 30: Hoare triple {2330#false} assume true; {2330#false} is VALID [2018-11-23 12:16:45,694 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {2330#false} {2329#true} #75#return; {2330#false} is VALID [2018-11-23 12:16:45,694 INFO L273 TraceCheckUtils]: 32: Hoare triple {2330#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); {2330#false} is VALID [2018-11-23 12:16:45,695 INFO L256 TraceCheckUtils]: 33: Hoare triple {2330#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {2330#false} is VALID [2018-11-23 12:16:45,695 INFO L273 TraceCheckUtils]: 34: Hoare triple {2330#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2330#false} is VALID [2018-11-23 12:16:45,695 INFO L273 TraceCheckUtils]: 35: Hoare triple {2330#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2330#false} is VALID [2018-11-23 12:16:45,695 INFO L273 TraceCheckUtils]: 36: Hoare triple {2330#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2330#false} is VALID [2018-11-23 12:16:45,695 INFO L273 TraceCheckUtils]: 37: Hoare triple {2330#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2330#false} is VALID [2018-11-23 12:16:45,695 INFO L273 TraceCheckUtils]: 38: Hoare triple {2330#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2330#false} is VALID [2018-11-23 12:16:45,696 INFO L273 TraceCheckUtils]: 39: Hoare triple {2330#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2330#false} is VALID [2018-11-23 12:16:45,696 INFO L273 TraceCheckUtils]: 40: Hoare triple {2330#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2330#false} is VALID [2018-11-23 12:16:45,696 INFO L273 TraceCheckUtils]: 41: Hoare triple {2330#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2330#false} is VALID [2018-11-23 12:16:45,696 INFO L273 TraceCheckUtils]: 42: Hoare triple {2330#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2330#false} is VALID [2018-11-23 12:16:45,696 INFO L273 TraceCheckUtils]: 43: Hoare triple {2330#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2330#false} is VALID [2018-11-23 12:16:45,696 INFO L273 TraceCheckUtils]: 44: Hoare triple {2330#false} assume !(~i~0 < 10); {2330#false} is VALID [2018-11-23 12:16:45,697 INFO L273 TraceCheckUtils]: 45: Hoare triple {2330#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2330#false} is VALID [2018-11-23 12:16:45,697 INFO L273 TraceCheckUtils]: 46: Hoare triple {2330#false} assume true; {2330#false} is VALID [2018-11-23 12:16:45,697 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {2330#false} {2330#false} #77#return; {2330#false} is VALID [2018-11-23 12:16:45,697 INFO L273 TraceCheckUtils]: 48: Hoare triple {2330#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; {2330#false} is VALID [2018-11-23 12:16:45,697 INFO L273 TraceCheckUtils]: 49: Hoare triple {2330#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {2330#false} is VALID [2018-11-23 12:16:45,698 INFO L273 TraceCheckUtils]: 50: Hoare triple {2330#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {2330#false} is VALID [2018-11-23 12:16:45,698 INFO L273 TraceCheckUtils]: 51: Hoare triple {2330#false} assume !(~i~2 < 9); {2330#false} is VALID [2018-11-23 12:16:45,698 INFO L273 TraceCheckUtils]: 52: Hoare triple {2330#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {2330#false} is VALID [2018-11-23 12:16:45,698 INFO L256 TraceCheckUtils]: 53: Hoare triple {2330#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {2330#false} is VALID [2018-11-23 12:16:45,698 INFO L273 TraceCheckUtils]: 54: Hoare triple {2330#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2330#false} is VALID [2018-11-23 12:16:45,698 INFO L273 TraceCheckUtils]: 55: Hoare triple {2330#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2330#false} is VALID [2018-11-23 12:16:45,699 INFO L273 TraceCheckUtils]: 56: Hoare triple {2330#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2330#false} is VALID [2018-11-23 12:16:45,699 INFO L273 TraceCheckUtils]: 57: Hoare triple {2330#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2330#false} is VALID [2018-11-23 12:16:45,699 INFO L273 TraceCheckUtils]: 58: Hoare triple {2330#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2330#false} is VALID [2018-11-23 12:16:45,699 INFO L273 TraceCheckUtils]: 59: Hoare triple {2330#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2330#false} is VALID [2018-11-23 12:16:45,699 INFO L273 TraceCheckUtils]: 60: Hoare triple {2330#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2330#false} is VALID [2018-11-23 12:16:45,699 INFO L273 TraceCheckUtils]: 61: Hoare triple {2330#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2330#false} is VALID [2018-11-23 12:16:45,700 INFO L273 TraceCheckUtils]: 62: Hoare triple {2330#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2330#false} is VALID [2018-11-23 12:16:45,700 INFO L273 TraceCheckUtils]: 63: Hoare triple {2330#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2330#false} is VALID [2018-11-23 12:16:45,700 INFO L273 TraceCheckUtils]: 64: Hoare triple {2330#false} assume !(~i~0 < 10); {2330#false} is VALID [2018-11-23 12:16:45,700 INFO L273 TraceCheckUtils]: 65: Hoare triple {2330#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2330#false} is VALID [2018-11-23 12:16:45,700 INFO L273 TraceCheckUtils]: 66: Hoare triple {2330#false} assume true; {2330#false} is VALID [2018-11-23 12:16:45,700 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {2330#false} {2330#false} #79#return; {2330#false} is VALID [2018-11-23 12:16:45,701 INFO L273 TraceCheckUtils]: 68: Hoare triple {2330#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {2330#false} is VALID [2018-11-23 12:16:45,701 INFO L273 TraceCheckUtils]: 69: Hoare triple {2330#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2330#false} is VALID [2018-11-23 12:16:45,701 INFO L273 TraceCheckUtils]: 70: Hoare triple {2330#false} assume !false; {2330#false} is VALID [2018-11-23 12:16:45,704 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 70 proven. 12 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-23 12:16:45,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:45,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-23 12:16:45,725 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2018-11-23 12:16:45,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:45,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:16:45,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:45,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:16:45,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:16:45,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:16:45,807 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 12 states. [2018-11-23 12:16:46,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:46,024 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2018-11-23 12:16:46,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:16:46,024 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2018-11-23 12:16:46,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:46,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:16:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 88 transitions. [2018-11-23 12:16:46,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:16:46,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 88 transitions. [2018-11-23 12:16:46,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 88 transitions. [2018-11-23 12:16:46,193 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:46,195 INFO L225 Difference]: With dead ends: 79 [2018-11-23 12:16:46,196 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:16:46,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:16:46,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:16:46,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-11-23 12:16:46,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:46,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 49 states. [2018-11-23 12:16:46,222 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 49 states. [2018-11-23 12:16:46,223 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 49 states. [2018-11-23 12:16:46,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:46,225 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2018-11-23 12:16:46,225 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2018-11-23 12:16:46,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:46,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:46,226 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 52 states. [2018-11-23 12:16:46,226 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 52 states. [2018-11-23 12:16:46,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:46,228 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2018-11-23 12:16:46,228 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2018-11-23 12:16:46,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:46,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:46,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:46,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:46,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:16:46,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-11-23 12:16:46,231 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 71 [2018-11-23 12:16:46,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:46,232 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-11-23 12:16:46,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:16:46,232 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-11-23 12:16:46,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-23 12:16:46,233 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:46,233 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 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:46,233 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:46,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:46,234 INFO L82 PathProgramCache]: Analyzing trace with hash 778847808, now seen corresponding path program 6 times [2018-11-23 12:16:46,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:46,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:46,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:46,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:46,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:46,495 INFO L256 TraceCheckUtils]: 0: Hoare triple {2839#true} call ULTIMATE.init(); {2839#true} is VALID [2018-11-23 12:16:46,495 INFO L273 TraceCheckUtils]: 1: Hoare triple {2839#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2839#true} is VALID [2018-11-23 12:16:46,496 INFO L273 TraceCheckUtils]: 2: Hoare triple {2839#true} assume true; {2839#true} is VALID [2018-11-23 12:16:46,496 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2839#true} {2839#true} #71#return; {2839#true} is VALID [2018-11-23 12:16:46,496 INFO L256 TraceCheckUtils]: 4: Hoare triple {2839#true} call #t~ret14 := main(); {2839#true} is VALID [2018-11-23 12:16:46,497 INFO L273 TraceCheckUtils]: 5: Hoare triple {2839#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2841#(= main_~i~1 0)} is VALID [2018-11-23 12:16:46,497 INFO L273 TraceCheckUtils]: 6: Hoare triple {2841#(= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2841#(= main_~i~1 0)} is VALID [2018-11-23 12:16:46,498 INFO L273 TraceCheckUtils]: 7: Hoare triple {2841#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2842#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:46,498 INFO L273 TraceCheckUtils]: 8: Hoare triple {2842#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2842#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:46,499 INFO L273 TraceCheckUtils]: 9: Hoare triple {2842#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2843#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:46,499 INFO L273 TraceCheckUtils]: 10: Hoare triple {2843#(<= main_~i~1 2)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2843#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:46,500 INFO L273 TraceCheckUtils]: 11: Hoare triple {2843#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2844#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:46,500 INFO L273 TraceCheckUtils]: 12: Hoare triple {2844#(<= main_~i~1 3)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2844#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:46,501 INFO L273 TraceCheckUtils]: 13: Hoare triple {2844#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2845#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:46,501 INFO L273 TraceCheckUtils]: 14: Hoare triple {2845#(<= main_~i~1 4)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2845#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:46,502 INFO L273 TraceCheckUtils]: 15: Hoare triple {2845#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2846#(<= main_~i~1 5)} is VALID [2018-11-23 12:16:46,502 INFO L273 TraceCheckUtils]: 16: Hoare triple {2846#(<= main_~i~1 5)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2846#(<= main_~i~1 5)} is VALID [2018-11-23 12:16:46,503 INFO L273 TraceCheckUtils]: 17: Hoare triple {2846#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2847#(<= main_~i~1 6)} is VALID [2018-11-23 12:16:46,504 INFO L273 TraceCheckUtils]: 18: Hoare triple {2847#(<= main_~i~1 6)} assume !(~i~1 < 10); {2840#false} is VALID [2018-11-23 12:16:46,504 INFO L256 TraceCheckUtils]: 19: Hoare triple {2840#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {2839#true} is VALID [2018-11-23 12:16:46,504 INFO L273 TraceCheckUtils]: 20: Hoare triple {2839#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2839#true} is VALID [2018-11-23 12:16:46,504 INFO L273 TraceCheckUtils]: 21: Hoare triple {2839#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2839#true} is VALID [2018-11-23 12:16:46,505 INFO L273 TraceCheckUtils]: 22: Hoare triple {2839#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2839#true} is VALID [2018-11-23 12:16:46,505 INFO L273 TraceCheckUtils]: 23: Hoare triple {2839#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2839#true} is VALID [2018-11-23 12:16:46,505 INFO L273 TraceCheckUtils]: 24: Hoare triple {2839#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2839#true} is VALID [2018-11-23 12:16:46,505 INFO L273 TraceCheckUtils]: 25: Hoare triple {2839#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2839#true} is VALID [2018-11-23 12:16:46,506 INFO L273 TraceCheckUtils]: 26: Hoare triple {2839#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2839#true} is VALID [2018-11-23 12:16:46,506 INFO L273 TraceCheckUtils]: 27: Hoare triple {2839#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2839#true} is VALID [2018-11-23 12:16:46,506 INFO L273 TraceCheckUtils]: 28: Hoare triple {2839#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2839#true} is VALID [2018-11-23 12:16:46,506 INFO L273 TraceCheckUtils]: 29: Hoare triple {2839#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2839#true} is VALID [2018-11-23 12:16:46,506 INFO L273 TraceCheckUtils]: 30: Hoare triple {2839#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2839#true} is VALID [2018-11-23 12:16:46,507 INFO L273 TraceCheckUtils]: 31: Hoare triple {2839#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2839#true} is VALID [2018-11-23 12:16:46,507 INFO L273 TraceCheckUtils]: 32: Hoare triple {2839#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2839#true} is VALID [2018-11-23 12:16:46,507 INFO L273 TraceCheckUtils]: 33: Hoare triple {2839#true} assume !(~i~0 < 10); {2839#true} is VALID [2018-11-23 12:16:46,507 INFO L273 TraceCheckUtils]: 34: Hoare triple {2839#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2839#true} is VALID [2018-11-23 12:16:46,507 INFO L273 TraceCheckUtils]: 35: Hoare triple {2839#true} assume true; {2839#true} is VALID [2018-11-23 12:16:46,508 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {2839#true} {2840#false} #75#return; {2840#false} is VALID [2018-11-23 12:16:46,508 INFO L273 TraceCheckUtils]: 37: Hoare triple {2840#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); {2840#false} is VALID [2018-11-23 12:16:46,508 INFO L256 TraceCheckUtils]: 38: Hoare triple {2840#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {2839#true} is VALID [2018-11-23 12:16:46,508 INFO L273 TraceCheckUtils]: 39: Hoare triple {2839#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2839#true} is VALID [2018-11-23 12:16:46,508 INFO L273 TraceCheckUtils]: 40: Hoare triple {2839#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2839#true} is VALID [2018-11-23 12:16:46,508 INFO L273 TraceCheckUtils]: 41: Hoare triple {2839#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2839#true} is VALID [2018-11-23 12:16:46,508 INFO L273 TraceCheckUtils]: 42: Hoare triple {2839#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2839#true} is VALID [2018-11-23 12:16:46,508 INFO L273 TraceCheckUtils]: 43: Hoare triple {2839#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2839#true} is VALID [2018-11-23 12:16:46,509 INFO L273 TraceCheckUtils]: 44: Hoare triple {2839#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2839#true} is VALID [2018-11-23 12:16:46,509 INFO L273 TraceCheckUtils]: 45: Hoare triple {2839#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2839#true} is VALID [2018-11-23 12:16:46,509 INFO L273 TraceCheckUtils]: 46: Hoare triple {2839#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2839#true} is VALID [2018-11-23 12:16:46,509 INFO L273 TraceCheckUtils]: 47: Hoare triple {2839#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2839#true} is VALID [2018-11-23 12:16:46,509 INFO L273 TraceCheckUtils]: 48: Hoare triple {2839#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2839#true} is VALID [2018-11-23 12:16:46,509 INFO L273 TraceCheckUtils]: 49: Hoare triple {2839#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2839#true} is VALID [2018-11-23 12:16:46,509 INFO L273 TraceCheckUtils]: 50: Hoare triple {2839#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2839#true} is VALID [2018-11-23 12:16:46,509 INFO L273 TraceCheckUtils]: 51: Hoare triple {2839#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2839#true} is VALID [2018-11-23 12:16:46,510 INFO L273 TraceCheckUtils]: 52: Hoare triple {2839#true} assume !(~i~0 < 10); {2839#true} is VALID [2018-11-23 12:16:46,510 INFO L273 TraceCheckUtils]: 53: Hoare triple {2839#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2839#true} is VALID [2018-11-23 12:16:46,510 INFO L273 TraceCheckUtils]: 54: Hoare triple {2839#true} assume true; {2839#true} is VALID [2018-11-23 12:16:46,510 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {2839#true} {2840#false} #77#return; {2840#false} is VALID [2018-11-23 12:16:46,510 INFO L273 TraceCheckUtils]: 56: Hoare triple {2840#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; {2840#false} is VALID [2018-11-23 12:16:46,510 INFO L273 TraceCheckUtils]: 57: Hoare triple {2840#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {2840#false} is VALID [2018-11-23 12:16:46,510 INFO L273 TraceCheckUtils]: 58: Hoare triple {2840#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {2840#false} is VALID [2018-11-23 12:16:46,511 INFO L273 TraceCheckUtils]: 59: Hoare triple {2840#false} assume !(~i~2 < 9); {2840#false} is VALID [2018-11-23 12:16:46,511 INFO L273 TraceCheckUtils]: 60: Hoare triple {2840#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {2840#false} is VALID [2018-11-23 12:16:46,511 INFO L256 TraceCheckUtils]: 61: Hoare triple {2840#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {2839#true} is VALID [2018-11-23 12:16:46,511 INFO L273 TraceCheckUtils]: 62: Hoare triple {2839#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2839#true} is VALID [2018-11-23 12:16:46,511 INFO L273 TraceCheckUtils]: 63: Hoare triple {2839#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2839#true} is VALID [2018-11-23 12:16:46,512 INFO L273 TraceCheckUtils]: 64: Hoare triple {2839#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2839#true} is VALID [2018-11-23 12:16:46,512 INFO L273 TraceCheckUtils]: 65: Hoare triple {2839#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2839#true} is VALID [2018-11-23 12:16:46,512 INFO L273 TraceCheckUtils]: 66: Hoare triple {2839#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2839#true} is VALID [2018-11-23 12:16:46,512 INFO L273 TraceCheckUtils]: 67: Hoare triple {2839#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2839#true} is VALID [2018-11-23 12:16:46,512 INFO L273 TraceCheckUtils]: 68: Hoare triple {2839#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2839#true} is VALID [2018-11-23 12:16:46,512 INFO L273 TraceCheckUtils]: 69: Hoare triple {2839#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2839#true} is VALID [2018-11-23 12:16:46,513 INFO L273 TraceCheckUtils]: 70: Hoare triple {2839#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2839#true} is VALID [2018-11-23 12:16:46,513 INFO L273 TraceCheckUtils]: 71: Hoare triple {2839#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2839#true} is VALID [2018-11-23 12:16:46,513 INFO L273 TraceCheckUtils]: 72: Hoare triple {2839#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2839#true} is VALID [2018-11-23 12:16:46,513 INFO L273 TraceCheckUtils]: 73: Hoare triple {2839#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2839#true} is VALID [2018-11-23 12:16:46,513 INFO L273 TraceCheckUtils]: 74: Hoare triple {2839#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2839#true} is VALID [2018-11-23 12:16:46,514 INFO L273 TraceCheckUtils]: 75: Hoare triple {2839#true} assume !(~i~0 < 10); {2839#true} is VALID [2018-11-23 12:16:46,514 INFO L273 TraceCheckUtils]: 76: Hoare triple {2839#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2839#true} is VALID [2018-11-23 12:16:46,514 INFO L273 TraceCheckUtils]: 77: Hoare triple {2839#true} assume true; {2839#true} is VALID [2018-11-23 12:16:46,514 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {2839#true} {2840#false} #79#return; {2840#false} is VALID [2018-11-23 12:16:46,514 INFO L273 TraceCheckUtils]: 79: Hoare triple {2840#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {2840#false} is VALID [2018-11-23 12:16:46,514 INFO L273 TraceCheckUtils]: 80: Hoare triple {2840#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2840#false} is VALID [2018-11-23 12:16:46,515 INFO L273 TraceCheckUtils]: 81: Hoare triple {2840#false} assume !false; {2840#false} is VALID [2018-11-23 12:16:46,518 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-11-23 12:16:46,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:46,519 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:46,535 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:16:46,631 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 12:16:46,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:46,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:46,920 INFO L256 TraceCheckUtils]: 0: Hoare triple {2839#true} call ULTIMATE.init(); {2839#true} is VALID [2018-11-23 12:16:46,920 INFO L273 TraceCheckUtils]: 1: Hoare triple {2839#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2839#true} is VALID [2018-11-23 12:16:46,921 INFO L273 TraceCheckUtils]: 2: Hoare triple {2839#true} assume true; {2839#true} is VALID [2018-11-23 12:16:46,921 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2839#true} {2839#true} #71#return; {2839#true} is VALID [2018-11-23 12:16:46,921 INFO L256 TraceCheckUtils]: 4: Hoare triple {2839#true} call #t~ret14 := main(); {2839#true} is VALID [2018-11-23 12:16:46,921 INFO L273 TraceCheckUtils]: 5: Hoare triple {2839#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2839#true} is VALID [2018-11-23 12:16:46,921 INFO L273 TraceCheckUtils]: 6: Hoare triple {2839#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2839#true} is VALID [2018-11-23 12:16:46,921 INFO L273 TraceCheckUtils]: 7: Hoare triple {2839#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2839#true} is VALID [2018-11-23 12:16:46,921 INFO L273 TraceCheckUtils]: 8: Hoare triple {2839#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2839#true} is VALID [2018-11-23 12:16:46,921 INFO L273 TraceCheckUtils]: 9: Hoare triple {2839#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2839#true} is VALID [2018-11-23 12:16:46,922 INFO L273 TraceCheckUtils]: 10: Hoare triple {2839#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2839#true} is VALID [2018-11-23 12:16:46,922 INFO L273 TraceCheckUtils]: 11: Hoare triple {2839#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2839#true} is VALID [2018-11-23 12:16:46,922 INFO L273 TraceCheckUtils]: 12: Hoare triple {2839#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2839#true} is VALID [2018-11-23 12:16:46,922 INFO L273 TraceCheckUtils]: 13: Hoare triple {2839#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2839#true} is VALID [2018-11-23 12:16:46,922 INFO L273 TraceCheckUtils]: 14: Hoare triple {2839#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2839#true} is VALID [2018-11-23 12:16:46,922 INFO L273 TraceCheckUtils]: 15: Hoare triple {2839#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2839#true} is VALID [2018-11-23 12:16:46,922 INFO L273 TraceCheckUtils]: 16: Hoare triple {2839#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {2839#true} is VALID [2018-11-23 12:16:46,922 INFO L273 TraceCheckUtils]: 17: Hoare triple {2839#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2839#true} is VALID [2018-11-23 12:16:46,923 INFO L273 TraceCheckUtils]: 18: Hoare triple {2839#true} assume !(~i~1 < 10); {2839#true} is VALID [2018-11-23 12:16:46,923 INFO L256 TraceCheckUtils]: 19: Hoare triple {2839#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {2839#true} is VALID [2018-11-23 12:16:46,923 INFO L273 TraceCheckUtils]: 20: Hoare triple {2839#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2839#true} is VALID [2018-11-23 12:16:46,923 INFO L273 TraceCheckUtils]: 21: Hoare triple {2839#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2839#true} is VALID [2018-11-23 12:16:46,923 INFO L273 TraceCheckUtils]: 22: Hoare triple {2839#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2839#true} is VALID [2018-11-23 12:16:46,923 INFO L273 TraceCheckUtils]: 23: Hoare triple {2839#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2839#true} is VALID [2018-11-23 12:16:46,923 INFO L273 TraceCheckUtils]: 24: Hoare triple {2839#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2839#true} is VALID [2018-11-23 12:16:46,923 INFO L273 TraceCheckUtils]: 25: Hoare triple {2839#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2839#true} is VALID [2018-11-23 12:16:46,924 INFO L273 TraceCheckUtils]: 26: Hoare triple {2839#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2839#true} is VALID [2018-11-23 12:16:46,924 INFO L273 TraceCheckUtils]: 27: Hoare triple {2839#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2839#true} is VALID [2018-11-23 12:16:46,924 INFO L273 TraceCheckUtils]: 28: Hoare triple {2839#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2839#true} is VALID [2018-11-23 12:16:46,924 INFO L273 TraceCheckUtils]: 29: Hoare triple {2839#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2839#true} is VALID [2018-11-23 12:16:46,924 INFO L273 TraceCheckUtils]: 30: Hoare triple {2839#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2839#true} is VALID [2018-11-23 12:16:46,924 INFO L273 TraceCheckUtils]: 31: Hoare triple {2839#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2839#true} is VALID [2018-11-23 12:16:46,924 INFO L273 TraceCheckUtils]: 32: Hoare triple {2839#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2839#true} is VALID [2018-11-23 12:16:46,924 INFO L273 TraceCheckUtils]: 33: Hoare triple {2839#true} assume !(~i~0 < 10); {2839#true} is VALID [2018-11-23 12:16:46,924 INFO L273 TraceCheckUtils]: 34: Hoare triple {2839#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2839#true} is VALID [2018-11-23 12:16:46,925 INFO L273 TraceCheckUtils]: 35: Hoare triple {2839#true} assume true; {2839#true} is VALID [2018-11-23 12:16:46,925 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {2839#true} {2839#true} #75#return; {2839#true} is VALID [2018-11-23 12:16:46,925 INFO L273 TraceCheckUtils]: 37: Hoare triple {2839#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); {2839#true} is VALID [2018-11-23 12:16:46,925 INFO L256 TraceCheckUtils]: 38: Hoare triple {2839#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {2839#true} is VALID [2018-11-23 12:16:46,925 INFO L273 TraceCheckUtils]: 39: Hoare triple {2839#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2839#true} is VALID [2018-11-23 12:16:46,925 INFO L273 TraceCheckUtils]: 40: Hoare triple {2839#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2839#true} is VALID [2018-11-23 12:16:46,925 INFO L273 TraceCheckUtils]: 41: Hoare triple {2839#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2839#true} is VALID [2018-11-23 12:16:46,925 INFO L273 TraceCheckUtils]: 42: Hoare triple {2839#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2839#true} is VALID [2018-11-23 12:16:46,926 INFO L273 TraceCheckUtils]: 43: Hoare triple {2839#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2839#true} is VALID [2018-11-23 12:16:46,926 INFO L273 TraceCheckUtils]: 44: Hoare triple {2839#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2839#true} is VALID [2018-11-23 12:16:46,926 INFO L273 TraceCheckUtils]: 45: Hoare triple {2839#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2839#true} is VALID [2018-11-23 12:16:46,926 INFO L273 TraceCheckUtils]: 46: Hoare triple {2839#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2839#true} is VALID [2018-11-23 12:16:46,926 INFO L273 TraceCheckUtils]: 47: Hoare triple {2839#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2839#true} is VALID [2018-11-23 12:16:46,926 INFO L273 TraceCheckUtils]: 48: Hoare triple {2839#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2839#true} is VALID [2018-11-23 12:16:46,926 INFO L273 TraceCheckUtils]: 49: Hoare triple {2839#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2839#true} is VALID [2018-11-23 12:16:46,926 INFO L273 TraceCheckUtils]: 50: Hoare triple {2839#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2839#true} is VALID [2018-11-23 12:16:46,927 INFO L273 TraceCheckUtils]: 51: Hoare triple {2839#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2839#true} is VALID [2018-11-23 12:16:46,927 INFO L273 TraceCheckUtils]: 52: Hoare triple {2839#true} assume !(~i~0 < 10); {2839#true} is VALID [2018-11-23 12:16:46,927 INFO L273 TraceCheckUtils]: 53: Hoare triple {2839#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2839#true} is VALID [2018-11-23 12:16:46,927 INFO L273 TraceCheckUtils]: 54: Hoare triple {2839#true} assume true; {2839#true} is VALID [2018-11-23 12:16:46,927 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {2839#true} {2839#true} #77#return; {2839#true} is VALID [2018-11-23 12:16:46,928 INFO L273 TraceCheckUtils]: 56: Hoare triple {2839#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; {3019#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:46,928 INFO L273 TraceCheckUtils]: 57: Hoare triple {3019#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3019#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:46,928 INFO L273 TraceCheckUtils]: 58: Hoare triple {3019#(<= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3026#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:46,929 INFO L273 TraceCheckUtils]: 59: Hoare triple {3026#(<= main_~i~2 1)} assume !(~i~2 < 9); {2840#false} is VALID [2018-11-23 12:16:46,929 INFO L273 TraceCheckUtils]: 60: Hoare triple {2840#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {2840#false} is VALID [2018-11-23 12:16:46,929 INFO L256 TraceCheckUtils]: 61: Hoare triple {2840#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {2840#false} is VALID [2018-11-23 12:16:46,929 INFO L273 TraceCheckUtils]: 62: Hoare triple {2840#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {2840#false} is VALID [2018-11-23 12:16:46,929 INFO L273 TraceCheckUtils]: 63: Hoare triple {2840#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2840#false} is VALID [2018-11-23 12:16:46,929 INFO L273 TraceCheckUtils]: 64: Hoare triple {2840#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2840#false} is VALID [2018-11-23 12:16:46,930 INFO L273 TraceCheckUtils]: 65: Hoare triple {2840#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2840#false} is VALID [2018-11-23 12:16:46,930 INFO L273 TraceCheckUtils]: 66: Hoare triple {2840#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2840#false} is VALID [2018-11-23 12:16:46,930 INFO L273 TraceCheckUtils]: 67: Hoare triple {2840#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2840#false} is VALID [2018-11-23 12:16:46,930 INFO L273 TraceCheckUtils]: 68: Hoare triple {2840#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2840#false} is VALID [2018-11-23 12:16:46,930 INFO L273 TraceCheckUtils]: 69: Hoare triple {2840#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2840#false} is VALID [2018-11-23 12:16:46,930 INFO L273 TraceCheckUtils]: 70: Hoare triple {2840#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2840#false} is VALID [2018-11-23 12:16:46,930 INFO L273 TraceCheckUtils]: 71: Hoare triple {2840#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2840#false} is VALID [2018-11-23 12:16:46,930 INFO L273 TraceCheckUtils]: 72: Hoare triple {2840#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {2840#false} is VALID [2018-11-23 12:16:46,931 INFO L273 TraceCheckUtils]: 73: Hoare triple {2840#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {2840#false} is VALID [2018-11-23 12:16:46,931 INFO L273 TraceCheckUtils]: 74: Hoare triple {2840#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2840#false} is VALID [2018-11-23 12:16:46,931 INFO L273 TraceCheckUtils]: 75: Hoare triple {2840#false} assume !(~i~0 < 10); {2840#false} is VALID [2018-11-23 12:16:46,931 INFO L273 TraceCheckUtils]: 76: Hoare triple {2840#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {2840#false} is VALID [2018-11-23 12:16:46,931 INFO L273 TraceCheckUtils]: 77: Hoare triple {2840#false} assume true; {2840#false} is VALID [2018-11-23 12:16:46,931 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {2840#false} {2840#false} #79#return; {2840#false} is VALID [2018-11-23 12:16:46,931 INFO L273 TraceCheckUtils]: 79: Hoare triple {2840#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {2840#false} is VALID [2018-11-23 12:16:46,931 INFO L273 TraceCheckUtils]: 80: Hoare triple {2840#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2840#false} is VALID [2018-11-23 12:16:46,931 INFO L273 TraceCheckUtils]: 81: Hoare triple {2840#false} assume !false; {2840#false} is VALID [2018-11-23 12:16:46,935 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 122 proven. 1 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2018-11-23 12:16:46,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:46,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-11-23 12:16:46,956 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2018-11-23 12:16:46,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:46,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:16:47,042 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:47,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:16:47,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:16:47,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:16:47,044 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 11 states. [2018-11-23 12:16:47,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:47,497 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2018-11-23 12:16:47,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:16:47,498 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2018-11-23 12:16:47,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:47,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:16:47,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 75 transitions. [2018-11-23 12:16:47,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:16:47,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 75 transitions. [2018-11-23 12:16:47,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 75 transitions. [2018-11-23 12:16:47,584 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,586 INFO L225 Difference]: With dead ends: 85 [2018-11-23 12:16:47,586 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 12:16:47,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:16:47,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 12:16:47,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-11-23 12:16:47,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:47,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 53 states. [2018-11-23 12:16:47,823 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 53 states. [2018-11-23 12:16:47,823 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 53 states. [2018-11-23 12:16:47,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:47,825 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-23 12:16:47,825 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-11-23 12:16:47,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:47,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:47,825 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 55 states. [2018-11-23 12:16:47,826 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 55 states. [2018-11-23 12:16:47,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:47,827 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-23 12:16:47,827 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-11-23 12:16:47,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:47,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:47,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:47,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:47,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:16:47,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-11-23 12:16:47,829 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 82 [2018-11-23 12:16:47,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:47,829 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-11-23 12:16:47,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:16:47,829 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-11-23 12:16:47,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 12:16:47,830 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:47,831 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 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:47,831 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:47,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:47,831 INFO L82 PathProgramCache]: Analyzing trace with hash 27018272, now seen corresponding path program 7 times [2018-11-23 12:16:47,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:47,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:47,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:47,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:47,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:48,147 INFO L256 TraceCheckUtils]: 0: Hoare triple {3402#true} call ULTIMATE.init(); {3402#true} is VALID [2018-11-23 12:16:48,147 INFO L273 TraceCheckUtils]: 1: Hoare triple {3402#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3402#true} is VALID [2018-11-23 12:16:48,148 INFO L273 TraceCheckUtils]: 2: Hoare triple {3402#true} assume true; {3402#true} is VALID [2018-11-23 12:16:48,148 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3402#true} {3402#true} #71#return; {3402#true} is VALID [2018-11-23 12:16:48,148 INFO L256 TraceCheckUtils]: 4: Hoare triple {3402#true} call #t~ret14 := main(); {3402#true} is VALID [2018-11-23 12:16:48,150 INFO L273 TraceCheckUtils]: 5: Hoare triple {3402#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3404#(= main_~i~1 0)} is VALID [2018-11-23 12:16:48,150 INFO L273 TraceCheckUtils]: 6: Hoare triple {3404#(= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3404#(= main_~i~1 0)} is VALID [2018-11-23 12:16:48,151 INFO L273 TraceCheckUtils]: 7: Hoare triple {3404#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3405#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:48,152 INFO L273 TraceCheckUtils]: 8: Hoare triple {3405#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3405#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:48,152 INFO L273 TraceCheckUtils]: 9: Hoare triple {3405#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3406#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:48,152 INFO L273 TraceCheckUtils]: 10: Hoare triple {3406#(<= main_~i~1 2)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3406#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:48,153 INFO L273 TraceCheckUtils]: 11: Hoare triple {3406#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3407#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:48,153 INFO L273 TraceCheckUtils]: 12: Hoare triple {3407#(<= main_~i~1 3)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3407#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:48,154 INFO L273 TraceCheckUtils]: 13: Hoare triple {3407#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3408#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:48,154 INFO L273 TraceCheckUtils]: 14: Hoare triple {3408#(<= main_~i~1 4)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3408#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:48,155 INFO L273 TraceCheckUtils]: 15: Hoare triple {3408#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3409#(<= main_~i~1 5)} is VALID [2018-11-23 12:16:48,156 INFO L273 TraceCheckUtils]: 16: Hoare triple {3409#(<= main_~i~1 5)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3409#(<= main_~i~1 5)} is VALID [2018-11-23 12:16:48,156 INFO L273 TraceCheckUtils]: 17: Hoare triple {3409#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3410#(<= main_~i~1 6)} is VALID [2018-11-23 12:16:48,157 INFO L273 TraceCheckUtils]: 18: Hoare triple {3410#(<= main_~i~1 6)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3410#(<= main_~i~1 6)} is VALID [2018-11-23 12:16:48,158 INFO L273 TraceCheckUtils]: 19: Hoare triple {3410#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3411#(<= main_~i~1 7)} is VALID [2018-11-23 12:16:48,158 INFO L273 TraceCheckUtils]: 20: Hoare triple {3411#(<= main_~i~1 7)} assume !(~i~1 < 10); {3403#false} is VALID [2018-11-23 12:16:48,159 INFO L256 TraceCheckUtils]: 21: Hoare triple {3403#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {3402#true} is VALID [2018-11-23 12:16:48,159 INFO L273 TraceCheckUtils]: 22: Hoare triple {3402#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3402#true} is VALID [2018-11-23 12:16:48,159 INFO L273 TraceCheckUtils]: 23: Hoare triple {3402#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3402#true} is VALID [2018-11-23 12:16:48,159 INFO L273 TraceCheckUtils]: 24: Hoare triple {3402#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3402#true} is VALID [2018-11-23 12:16:48,160 INFO L273 TraceCheckUtils]: 25: Hoare triple {3402#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3402#true} is VALID [2018-11-23 12:16:48,160 INFO L273 TraceCheckUtils]: 26: Hoare triple {3402#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3402#true} is VALID [2018-11-23 12:16:48,160 INFO L273 TraceCheckUtils]: 27: Hoare triple {3402#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3402#true} is VALID [2018-11-23 12:16:48,161 INFO L273 TraceCheckUtils]: 28: Hoare triple {3402#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3402#true} is VALID [2018-11-23 12:16:48,161 INFO L273 TraceCheckUtils]: 29: Hoare triple {3402#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3402#true} is VALID [2018-11-23 12:16:48,161 INFO L273 TraceCheckUtils]: 30: Hoare triple {3402#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3402#true} is VALID [2018-11-23 12:16:48,161 INFO L273 TraceCheckUtils]: 31: Hoare triple {3402#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3402#true} is VALID [2018-11-23 12:16:48,162 INFO L273 TraceCheckUtils]: 32: Hoare triple {3402#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3402#true} is VALID [2018-11-23 12:16:48,162 INFO L273 TraceCheckUtils]: 33: Hoare triple {3402#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3402#true} is VALID [2018-11-23 12:16:48,162 INFO L273 TraceCheckUtils]: 34: Hoare triple {3402#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3402#true} is VALID [2018-11-23 12:16:48,162 INFO L273 TraceCheckUtils]: 35: Hoare triple {3402#true} assume !(~i~0 < 10); {3402#true} is VALID [2018-11-23 12:16:48,162 INFO L273 TraceCheckUtils]: 36: Hoare triple {3402#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3402#true} is VALID [2018-11-23 12:16:48,162 INFO L273 TraceCheckUtils]: 37: Hoare triple {3402#true} assume true; {3402#true} is VALID [2018-11-23 12:16:48,163 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {3402#true} {3403#false} #75#return; {3403#false} is VALID [2018-11-23 12:16:48,163 INFO L273 TraceCheckUtils]: 39: Hoare triple {3403#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); {3403#false} is VALID [2018-11-23 12:16:48,163 INFO L256 TraceCheckUtils]: 40: Hoare triple {3403#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {3402#true} is VALID [2018-11-23 12:16:48,163 INFO L273 TraceCheckUtils]: 41: Hoare triple {3402#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3402#true} is VALID [2018-11-23 12:16:48,163 INFO L273 TraceCheckUtils]: 42: Hoare triple {3402#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3402#true} is VALID [2018-11-23 12:16:48,163 INFO L273 TraceCheckUtils]: 43: Hoare triple {3402#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3402#true} is VALID [2018-11-23 12:16:48,164 INFO L273 TraceCheckUtils]: 44: Hoare triple {3402#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3402#true} is VALID [2018-11-23 12:16:48,164 INFO L273 TraceCheckUtils]: 45: Hoare triple {3402#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3402#true} is VALID [2018-11-23 12:16:48,164 INFO L273 TraceCheckUtils]: 46: Hoare triple {3402#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3402#true} is VALID [2018-11-23 12:16:48,164 INFO L273 TraceCheckUtils]: 47: Hoare triple {3402#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3402#true} is VALID [2018-11-23 12:16:48,164 INFO L273 TraceCheckUtils]: 48: Hoare triple {3402#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3402#true} is VALID [2018-11-23 12:16:48,164 INFO L273 TraceCheckUtils]: 49: Hoare triple {3402#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3402#true} is VALID [2018-11-23 12:16:48,165 INFO L273 TraceCheckUtils]: 50: Hoare triple {3402#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3402#true} is VALID [2018-11-23 12:16:48,165 INFO L273 TraceCheckUtils]: 51: Hoare triple {3402#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3402#true} is VALID [2018-11-23 12:16:48,165 INFO L273 TraceCheckUtils]: 52: Hoare triple {3402#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3402#true} is VALID [2018-11-23 12:16:48,165 INFO L273 TraceCheckUtils]: 53: Hoare triple {3402#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3402#true} is VALID [2018-11-23 12:16:48,165 INFO L273 TraceCheckUtils]: 54: Hoare triple {3402#true} assume !(~i~0 < 10); {3402#true} is VALID [2018-11-23 12:16:48,165 INFO L273 TraceCheckUtils]: 55: Hoare triple {3402#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3402#true} is VALID [2018-11-23 12:16:48,166 INFO L273 TraceCheckUtils]: 56: Hoare triple {3402#true} assume true; {3402#true} is VALID [2018-11-23 12:16:48,166 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {3402#true} {3403#false} #77#return; {3403#false} is VALID [2018-11-23 12:16:48,166 INFO L273 TraceCheckUtils]: 58: Hoare triple {3403#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; {3403#false} is VALID [2018-11-23 12:16:48,166 INFO L273 TraceCheckUtils]: 59: Hoare triple {3403#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3403#false} is VALID [2018-11-23 12:16:48,166 INFO L273 TraceCheckUtils]: 60: Hoare triple {3403#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3403#false} is VALID [2018-11-23 12:16:48,166 INFO L273 TraceCheckUtils]: 61: Hoare triple {3403#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3403#false} is VALID [2018-11-23 12:16:48,167 INFO L273 TraceCheckUtils]: 62: Hoare triple {3403#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3403#false} is VALID [2018-11-23 12:16:48,167 INFO L273 TraceCheckUtils]: 63: Hoare triple {3403#false} assume !(~i~2 < 9); {3403#false} is VALID [2018-11-23 12:16:48,167 INFO L273 TraceCheckUtils]: 64: Hoare triple {3403#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {3403#false} is VALID [2018-11-23 12:16:48,167 INFO L256 TraceCheckUtils]: 65: Hoare triple {3403#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {3402#true} is VALID [2018-11-23 12:16:48,167 INFO L273 TraceCheckUtils]: 66: Hoare triple {3402#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3402#true} is VALID [2018-11-23 12:16:48,167 INFO L273 TraceCheckUtils]: 67: Hoare triple {3402#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3402#true} is VALID [2018-11-23 12:16:48,168 INFO L273 TraceCheckUtils]: 68: Hoare triple {3402#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3402#true} is VALID [2018-11-23 12:16:48,168 INFO L273 TraceCheckUtils]: 69: Hoare triple {3402#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3402#true} is VALID [2018-11-23 12:16:48,168 INFO L273 TraceCheckUtils]: 70: Hoare triple {3402#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3402#true} is VALID [2018-11-23 12:16:48,168 INFO L273 TraceCheckUtils]: 71: Hoare triple {3402#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3402#true} is VALID [2018-11-23 12:16:48,168 INFO L273 TraceCheckUtils]: 72: Hoare triple {3402#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3402#true} is VALID [2018-11-23 12:16:48,168 INFO L273 TraceCheckUtils]: 73: Hoare triple {3402#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3402#true} is VALID [2018-11-23 12:16:48,169 INFO L273 TraceCheckUtils]: 74: Hoare triple {3402#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3402#true} is VALID [2018-11-23 12:16:48,169 INFO L273 TraceCheckUtils]: 75: Hoare triple {3402#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3402#true} is VALID [2018-11-23 12:16:48,169 INFO L273 TraceCheckUtils]: 76: Hoare triple {3402#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3402#true} is VALID [2018-11-23 12:16:48,169 INFO L273 TraceCheckUtils]: 77: Hoare triple {3402#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3402#true} is VALID [2018-11-23 12:16:48,169 INFO L273 TraceCheckUtils]: 78: Hoare triple {3402#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3402#true} is VALID [2018-11-23 12:16:48,169 INFO L273 TraceCheckUtils]: 79: Hoare triple {3402#true} assume !(~i~0 < 10); {3402#true} is VALID [2018-11-23 12:16:48,170 INFO L273 TraceCheckUtils]: 80: Hoare triple {3402#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3402#true} is VALID [2018-11-23 12:16:48,170 INFO L273 TraceCheckUtils]: 81: Hoare triple {3402#true} assume true; {3402#true} is VALID [2018-11-23 12:16:48,170 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {3402#true} {3403#false} #79#return; {3403#false} is VALID [2018-11-23 12:16:48,170 INFO L273 TraceCheckUtils]: 83: Hoare triple {3403#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {3403#false} is VALID [2018-11-23 12:16:48,170 INFO L273 TraceCheckUtils]: 84: Hoare triple {3403#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3403#false} is VALID [2018-11-23 12:16:48,170 INFO L273 TraceCheckUtils]: 85: Hoare triple {3403#false} assume !false; {3403#false} is VALID [2018-11-23 12:16:48,174 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 12:16:48,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:48,174 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:48,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:48,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:48,400 INFO L256 TraceCheckUtils]: 0: Hoare triple {3402#true} call ULTIMATE.init(); {3402#true} is VALID [2018-11-23 12:16:48,401 INFO L273 TraceCheckUtils]: 1: Hoare triple {3402#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3402#true} is VALID [2018-11-23 12:16:48,401 INFO L273 TraceCheckUtils]: 2: Hoare triple {3402#true} assume true; {3402#true} is VALID [2018-11-23 12:16:48,401 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3402#true} {3402#true} #71#return; {3402#true} is VALID [2018-11-23 12:16:48,402 INFO L256 TraceCheckUtils]: 4: Hoare triple {3402#true} call #t~ret14 := main(); {3402#true} is VALID [2018-11-23 12:16:48,403 INFO L273 TraceCheckUtils]: 5: Hoare triple {3402#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3430#(<= main_~i~1 0)} is VALID [2018-11-23 12:16:48,403 INFO L273 TraceCheckUtils]: 6: Hoare triple {3430#(<= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3430#(<= main_~i~1 0)} is VALID [2018-11-23 12:16:48,404 INFO L273 TraceCheckUtils]: 7: Hoare triple {3430#(<= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3405#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:48,404 INFO L273 TraceCheckUtils]: 8: Hoare triple {3405#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3405#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:48,405 INFO L273 TraceCheckUtils]: 9: Hoare triple {3405#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3406#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:48,405 INFO L273 TraceCheckUtils]: 10: Hoare triple {3406#(<= main_~i~1 2)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3406#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:48,406 INFO L273 TraceCheckUtils]: 11: Hoare triple {3406#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3407#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:48,407 INFO L273 TraceCheckUtils]: 12: Hoare triple {3407#(<= main_~i~1 3)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3407#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:48,407 INFO L273 TraceCheckUtils]: 13: Hoare triple {3407#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3408#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:48,408 INFO L273 TraceCheckUtils]: 14: Hoare triple {3408#(<= main_~i~1 4)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3408#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:48,409 INFO L273 TraceCheckUtils]: 15: Hoare triple {3408#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3409#(<= main_~i~1 5)} is VALID [2018-11-23 12:16:48,410 INFO L273 TraceCheckUtils]: 16: Hoare triple {3409#(<= main_~i~1 5)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3409#(<= main_~i~1 5)} is VALID [2018-11-23 12:16:48,410 INFO L273 TraceCheckUtils]: 17: Hoare triple {3409#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3410#(<= main_~i~1 6)} is VALID [2018-11-23 12:16:48,411 INFO L273 TraceCheckUtils]: 18: Hoare triple {3410#(<= main_~i~1 6)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3410#(<= main_~i~1 6)} is VALID [2018-11-23 12:16:48,412 INFO L273 TraceCheckUtils]: 19: Hoare triple {3410#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3411#(<= main_~i~1 7)} is VALID [2018-11-23 12:16:48,413 INFO L273 TraceCheckUtils]: 20: Hoare triple {3411#(<= main_~i~1 7)} assume !(~i~1 < 10); {3403#false} is VALID [2018-11-23 12:16:48,413 INFO L256 TraceCheckUtils]: 21: Hoare triple {3403#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {3403#false} is VALID [2018-11-23 12:16:48,413 INFO L273 TraceCheckUtils]: 22: Hoare triple {3403#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3403#false} is VALID [2018-11-23 12:16:48,413 INFO L273 TraceCheckUtils]: 23: Hoare triple {3403#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3403#false} is VALID [2018-11-23 12:16:48,414 INFO L273 TraceCheckUtils]: 24: Hoare triple {3403#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3403#false} is VALID [2018-11-23 12:16:48,414 INFO L273 TraceCheckUtils]: 25: Hoare triple {3403#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3403#false} is VALID [2018-11-23 12:16:48,414 INFO L273 TraceCheckUtils]: 26: Hoare triple {3403#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3403#false} is VALID [2018-11-23 12:16:48,415 INFO L273 TraceCheckUtils]: 27: Hoare triple {3403#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3403#false} is VALID [2018-11-23 12:16:48,415 INFO L273 TraceCheckUtils]: 28: Hoare triple {3403#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3403#false} is VALID [2018-11-23 12:16:48,415 INFO L273 TraceCheckUtils]: 29: Hoare triple {3403#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3403#false} is VALID [2018-11-23 12:16:48,415 INFO L273 TraceCheckUtils]: 30: Hoare triple {3403#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3403#false} is VALID [2018-11-23 12:16:48,416 INFO L273 TraceCheckUtils]: 31: Hoare triple {3403#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3403#false} is VALID [2018-11-23 12:16:48,416 INFO L273 TraceCheckUtils]: 32: Hoare triple {3403#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3403#false} is VALID [2018-11-23 12:16:48,416 INFO L273 TraceCheckUtils]: 33: Hoare triple {3403#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3403#false} is VALID [2018-11-23 12:16:48,416 INFO L273 TraceCheckUtils]: 34: Hoare triple {3403#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3403#false} is VALID [2018-11-23 12:16:48,417 INFO L273 TraceCheckUtils]: 35: Hoare triple {3403#false} assume !(~i~0 < 10); {3403#false} is VALID [2018-11-23 12:16:48,417 INFO L273 TraceCheckUtils]: 36: Hoare triple {3403#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3403#false} is VALID [2018-11-23 12:16:48,417 INFO L273 TraceCheckUtils]: 37: Hoare triple {3403#false} assume true; {3403#false} is VALID [2018-11-23 12:16:48,418 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {3403#false} {3403#false} #75#return; {3403#false} is VALID [2018-11-23 12:16:48,418 INFO L273 TraceCheckUtils]: 39: Hoare triple {3403#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); {3403#false} is VALID [2018-11-23 12:16:48,418 INFO L256 TraceCheckUtils]: 40: Hoare triple {3403#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {3403#false} is VALID [2018-11-23 12:16:48,418 INFO L273 TraceCheckUtils]: 41: Hoare triple {3403#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3403#false} is VALID [2018-11-23 12:16:48,419 INFO L273 TraceCheckUtils]: 42: Hoare triple {3403#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3403#false} is VALID [2018-11-23 12:16:48,419 INFO L273 TraceCheckUtils]: 43: Hoare triple {3403#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3403#false} is VALID [2018-11-23 12:16:48,419 INFO L273 TraceCheckUtils]: 44: Hoare triple {3403#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3403#false} is VALID [2018-11-23 12:16:48,419 INFO L273 TraceCheckUtils]: 45: Hoare triple {3403#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3403#false} is VALID [2018-11-23 12:16:48,419 INFO L273 TraceCheckUtils]: 46: Hoare triple {3403#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3403#false} is VALID [2018-11-23 12:16:48,419 INFO L273 TraceCheckUtils]: 47: Hoare triple {3403#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3403#false} is VALID [2018-11-23 12:16:48,419 INFO L273 TraceCheckUtils]: 48: Hoare triple {3403#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3403#false} is VALID [2018-11-23 12:16:48,420 INFO L273 TraceCheckUtils]: 49: Hoare triple {3403#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3403#false} is VALID [2018-11-23 12:16:48,420 INFO L273 TraceCheckUtils]: 50: Hoare triple {3403#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3403#false} is VALID [2018-11-23 12:16:48,420 INFO L273 TraceCheckUtils]: 51: Hoare triple {3403#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3403#false} is VALID [2018-11-23 12:16:48,420 INFO L273 TraceCheckUtils]: 52: Hoare triple {3403#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3403#false} is VALID [2018-11-23 12:16:48,420 INFO L273 TraceCheckUtils]: 53: Hoare triple {3403#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3403#false} is VALID [2018-11-23 12:16:48,420 INFO L273 TraceCheckUtils]: 54: Hoare triple {3403#false} assume !(~i~0 < 10); {3403#false} is VALID [2018-11-23 12:16:48,421 INFO L273 TraceCheckUtils]: 55: Hoare triple {3403#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3403#false} is VALID [2018-11-23 12:16:48,421 INFO L273 TraceCheckUtils]: 56: Hoare triple {3403#false} assume true; {3403#false} is VALID [2018-11-23 12:16:48,421 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {3403#false} {3403#false} #77#return; {3403#false} is VALID [2018-11-23 12:16:48,421 INFO L273 TraceCheckUtils]: 58: Hoare triple {3403#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; {3403#false} is VALID [2018-11-23 12:16:48,421 INFO L273 TraceCheckUtils]: 59: Hoare triple {3403#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3403#false} is VALID [2018-11-23 12:16:48,421 INFO L273 TraceCheckUtils]: 60: Hoare triple {3403#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3403#false} is VALID [2018-11-23 12:16:48,421 INFO L273 TraceCheckUtils]: 61: Hoare triple {3403#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3403#false} is VALID [2018-11-23 12:16:48,422 INFO L273 TraceCheckUtils]: 62: Hoare triple {3403#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3403#false} is VALID [2018-11-23 12:16:48,422 INFO L273 TraceCheckUtils]: 63: Hoare triple {3403#false} assume !(~i~2 < 9); {3403#false} is VALID [2018-11-23 12:16:48,422 INFO L273 TraceCheckUtils]: 64: Hoare triple {3403#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {3403#false} is VALID [2018-11-23 12:16:48,422 INFO L256 TraceCheckUtils]: 65: Hoare triple {3403#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {3403#false} is VALID [2018-11-23 12:16:48,422 INFO L273 TraceCheckUtils]: 66: Hoare triple {3403#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3403#false} is VALID [2018-11-23 12:16:48,422 INFO L273 TraceCheckUtils]: 67: Hoare triple {3403#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3403#false} is VALID [2018-11-23 12:16:48,423 INFO L273 TraceCheckUtils]: 68: Hoare triple {3403#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3403#false} is VALID [2018-11-23 12:16:48,423 INFO L273 TraceCheckUtils]: 69: Hoare triple {3403#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3403#false} is VALID [2018-11-23 12:16:48,423 INFO L273 TraceCheckUtils]: 70: Hoare triple {3403#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3403#false} is VALID [2018-11-23 12:16:48,423 INFO L273 TraceCheckUtils]: 71: Hoare triple {3403#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3403#false} is VALID [2018-11-23 12:16:48,423 INFO L273 TraceCheckUtils]: 72: Hoare triple {3403#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3403#false} is VALID [2018-11-23 12:16:48,423 INFO L273 TraceCheckUtils]: 73: Hoare triple {3403#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3403#false} is VALID [2018-11-23 12:16:48,423 INFO L273 TraceCheckUtils]: 74: Hoare triple {3403#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3403#false} is VALID [2018-11-23 12:16:48,424 INFO L273 TraceCheckUtils]: 75: Hoare triple {3403#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3403#false} is VALID [2018-11-23 12:16:48,424 INFO L273 TraceCheckUtils]: 76: Hoare triple {3403#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3403#false} is VALID [2018-11-23 12:16:48,424 INFO L273 TraceCheckUtils]: 77: Hoare triple {3403#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3403#false} is VALID [2018-11-23 12:16:48,424 INFO L273 TraceCheckUtils]: 78: Hoare triple {3403#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3403#false} is VALID [2018-11-23 12:16:48,424 INFO L273 TraceCheckUtils]: 79: Hoare triple {3403#false} assume !(~i~0 < 10); {3403#false} is VALID [2018-11-23 12:16:48,424 INFO L273 TraceCheckUtils]: 80: Hoare triple {3403#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3403#false} is VALID [2018-11-23 12:16:48,424 INFO L273 TraceCheckUtils]: 81: Hoare triple {3403#false} assume true; {3403#false} is VALID [2018-11-23 12:16:48,425 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {3403#false} {3403#false} #79#return; {3403#false} is VALID [2018-11-23 12:16:48,425 INFO L273 TraceCheckUtils]: 83: Hoare triple {3403#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {3403#false} is VALID [2018-11-23 12:16:48,425 INFO L273 TraceCheckUtils]: 84: Hoare triple {3403#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3403#false} is VALID [2018-11-23 12:16:48,425 INFO L273 TraceCheckUtils]: 85: Hoare triple {3403#false} assume !false; {3403#false} is VALID [2018-11-23 12:16:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 12:16:48,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:48,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:16:48,453 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2018-11-23 12:16:48,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:48,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:16:48,515 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:48,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:16:48,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:16:48,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:16:48,516 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 11 states. [2018-11-23 12:16:48,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:48,726 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2018-11-23 12:16:48,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:16:48,727 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2018-11-23 12:16:48,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:48,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:16:48,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2018-11-23 12:16:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:16:48,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2018-11-23 12:16:48,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 72 transitions. [2018-11-23 12:16:48,827 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:48,829 INFO L225 Difference]: With dead ends: 88 [2018-11-23 12:16:48,829 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 12:16:48,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:16:48,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 12:16:48,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-11-23 12:16:48,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:48,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 55 states. [2018-11-23 12:16:48,857 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 55 states. [2018-11-23 12:16:48,857 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 55 states. [2018-11-23 12:16:48,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:48,859 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-23 12:16:48,860 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-11-23 12:16:48,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:48,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:48,860 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 56 states. [2018-11-23 12:16:48,860 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 56 states. [2018-11-23 12:16:48,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:48,862 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-23 12:16:48,863 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-11-23 12:16:48,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:48,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:48,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:48,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:48,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:16:48,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-11-23 12:16:48,865 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 86 [2018-11-23 12:16:48,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:48,865 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-11-23 12:16:48,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:16:48,866 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-11-23 12:16:48,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-23 12:16:48,867 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:48,867 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 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:48,867 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:48,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:48,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1793036866, now seen corresponding path program 8 times [2018-11-23 12:16:48,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:48,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:48,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:48,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:48,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:49,091 INFO L256 TraceCheckUtils]: 0: Hoare triple {3987#true} call ULTIMATE.init(); {3987#true} is VALID [2018-11-23 12:16:49,092 INFO L273 TraceCheckUtils]: 1: Hoare triple {3987#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3987#true} is VALID [2018-11-23 12:16:49,092 INFO L273 TraceCheckUtils]: 2: Hoare triple {3987#true} assume true; {3987#true} is VALID [2018-11-23 12:16:49,092 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3987#true} {3987#true} #71#return; {3987#true} is VALID [2018-11-23 12:16:49,092 INFO L256 TraceCheckUtils]: 4: Hoare triple {3987#true} call #t~ret14 := main(); {3987#true} is VALID [2018-11-23 12:16:49,093 INFO L273 TraceCheckUtils]: 5: Hoare triple {3987#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3989#(= main_~i~1 0)} is VALID [2018-11-23 12:16:49,094 INFO L273 TraceCheckUtils]: 6: Hoare triple {3989#(= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3989#(= main_~i~1 0)} is VALID [2018-11-23 12:16:49,094 INFO L273 TraceCheckUtils]: 7: Hoare triple {3989#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3990#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:49,095 INFO L273 TraceCheckUtils]: 8: Hoare triple {3990#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3990#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:49,095 INFO L273 TraceCheckUtils]: 9: Hoare triple {3990#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3991#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:49,095 INFO L273 TraceCheckUtils]: 10: Hoare triple {3991#(<= main_~i~1 2)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3991#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:49,096 INFO L273 TraceCheckUtils]: 11: Hoare triple {3991#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3992#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:49,096 INFO L273 TraceCheckUtils]: 12: Hoare triple {3992#(<= main_~i~1 3)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3992#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:49,097 INFO L273 TraceCheckUtils]: 13: Hoare triple {3992#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3993#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:49,097 INFO L273 TraceCheckUtils]: 14: Hoare triple {3993#(<= main_~i~1 4)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3993#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:49,098 INFO L273 TraceCheckUtils]: 15: Hoare triple {3993#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3994#(<= main_~i~1 5)} is VALID [2018-11-23 12:16:49,099 INFO L273 TraceCheckUtils]: 16: Hoare triple {3994#(<= main_~i~1 5)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3994#(<= main_~i~1 5)} is VALID [2018-11-23 12:16:49,100 INFO L273 TraceCheckUtils]: 17: Hoare triple {3994#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3995#(<= main_~i~1 6)} is VALID [2018-11-23 12:16:49,100 INFO L273 TraceCheckUtils]: 18: Hoare triple {3995#(<= main_~i~1 6)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3995#(<= main_~i~1 6)} is VALID [2018-11-23 12:16:49,101 INFO L273 TraceCheckUtils]: 19: Hoare triple {3995#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3996#(<= main_~i~1 7)} is VALID [2018-11-23 12:16:49,101 INFO L273 TraceCheckUtils]: 20: Hoare triple {3996#(<= main_~i~1 7)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3996#(<= main_~i~1 7)} is VALID [2018-11-23 12:16:49,102 INFO L273 TraceCheckUtils]: 21: Hoare triple {3996#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3997#(<= main_~i~1 8)} is VALID [2018-11-23 12:16:49,103 INFO L273 TraceCheckUtils]: 22: Hoare triple {3997#(<= main_~i~1 8)} assume !(~i~1 < 10); {3988#false} is VALID [2018-11-23 12:16:49,103 INFO L256 TraceCheckUtils]: 23: Hoare triple {3988#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {3987#true} is VALID [2018-11-23 12:16:49,103 INFO L273 TraceCheckUtils]: 24: Hoare triple {3987#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3987#true} is VALID [2018-11-23 12:16:49,104 INFO L273 TraceCheckUtils]: 25: Hoare triple {3987#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3987#true} is VALID [2018-11-23 12:16:49,104 INFO L273 TraceCheckUtils]: 26: Hoare triple {3987#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3987#true} is VALID [2018-11-23 12:16:49,104 INFO L273 TraceCheckUtils]: 27: Hoare triple {3987#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3987#true} is VALID [2018-11-23 12:16:49,104 INFO L273 TraceCheckUtils]: 28: Hoare triple {3987#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3987#true} is VALID [2018-11-23 12:16:49,104 INFO L273 TraceCheckUtils]: 29: Hoare triple {3987#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3987#true} is VALID [2018-11-23 12:16:49,105 INFO L273 TraceCheckUtils]: 30: Hoare triple {3987#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3987#true} is VALID [2018-11-23 12:16:49,105 INFO L273 TraceCheckUtils]: 31: Hoare triple {3987#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3987#true} is VALID [2018-11-23 12:16:49,105 INFO L273 TraceCheckUtils]: 32: Hoare triple {3987#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3987#true} is VALID [2018-11-23 12:16:49,105 INFO L273 TraceCheckUtils]: 33: Hoare triple {3987#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3987#true} is VALID [2018-11-23 12:16:49,105 INFO L273 TraceCheckUtils]: 34: Hoare triple {3987#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3987#true} is VALID [2018-11-23 12:16:49,106 INFO L273 TraceCheckUtils]: 35: Hoare triple {3987#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3987#true} is VALID [2018-11-23 12:16:49,106 INFO L273 TraceCheckUtils]: 36: Hoare triple {3987#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3987#true} is VALID [2018-11-23 12:16:49,106 INFO L273 TraceCheckUtils]: 37: Hoare triple {3987#true} assume !(~i~0 < 10); {3987#true} is VALID [2018-11-23 12:16:49,106 INFO L273 TraceCheckUtils]: 38: Hoare triple {3987#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3987#true} is VALID [2018-11-23 12:16:49,107 INFO L273 TraceCheckUtils]: 39: Hoare triple {3987#true} assume true; {3987#true} is VALID [2018-11-23 12:16:49,107 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {3987#true} {3988#false} #75#return; {3988#false} is VALID [2018-11-23 12:16:49,107 INFO L273 TraceCheckUtils]: 41: Hoare triple {3988#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); {3988#false} is VALID [2018-11-23 12:16:49,107 INFO L256 TraceCheckUtils]: 42: Hoare triple {3988#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {3987#true} is VALID [2018-11-23 12:16:49,107 INFO L273 TraceCheckUtils]: 43: Hoare triple {3987#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3987#true} is VALID [2018-11-23 12:16:49,107 INFO L273 TraceCheckUtils]: 44: Hoare triple {3987#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3987#true} is VALID [2018-11-23 12:16:49,107 INFO L273 TraceCheckUtils]: 45: Hoare triple {3987#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3987#true} is VALID [2018-11-23 12:16:49,108 INFO L273 TraceCheckUtils]: 46: Hoare triple {3987#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3987#true} is VALID [2018-11-23 12:16:49,108 INFO L273 TraceCheckUtils]: 47: Hoare triple {3987#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3987#true} is VALID [2018-11-23 12:16:49,108 INFO L273 TraceCheckUtils]: 48: Hoare triple {3987#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3987#true} is VALID [2018-11-23 12:16:49,108 INFO L273 TraceCheckUtils]: 49: Hoare triple {3987#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3987#true} is VALID [2018-11-23 12:16:49,108 INFO L273 TraceCheckUtils]: 50: Hoare triple {3987#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3987#true} is VALID [2018-11-23 12:16:49,108 INFO L273 TraceCheckUtils]: 51: Hoare triple {3987#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3987#true} is VALID [2018-11-23 12:16:49,108 INFO L273 TraceCheckUtils]: 52: Hoare triple {3987#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3987#true} is VALID [2018-11-23 12:16:49,108 INFO L273 TraceCheckUtils]: 53: Hoare triple {3987#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3987#true} is VALID [2018-11-23 12:16:49,109 INFO L273 TraceCheckUtils]: 54: Hoare triple {3987#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3987#true} is VALID [2018-11-23 12:16:49,109 INFO L273 TraceCheckUtils]: 55: Hoare triple {3987#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3987#true} is VALID [2018-11-23 12:16:49,109 INFO L273 TraceCheckUtils]: 56: Hoare triple {3987#true} assume !(~i~0 < 10); {3987#true} is VALID [2018-11-23 12:16:49,109 INFO L273 TraceCheckUtils]: 57: Hoare triple {3987#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3987#true} is VALID [2018-11-23 12:16:49,109 INFO L273 TraceCheckUtils]: 58: Hoare triple {3987#true} assume true; {3987#true} is VALID [2018-11-23 12:16:49,109 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {3987#true} {3988#false} #77#return; {3988#false} is VALID [2018-11-23 12:16:49,109 INFO L273 TraceCheckUtils]: 60: Hoare triple {3988#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; {3988#false} is VALID [2018-11-23 12:16:49,110 INFO L273 TraceCheckUtils]: 61: Hoare triple {3988#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3988#false} is VALID [2018-11-23 12:16:49,110 INFO L273 TraceCheckUtils]: 62: Hoare triple {3988#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3988#false} is VALID [2018-11-23 12:16:49,110 INFO L273 TraceCheckUtils]: 63: Hoare triple {3988#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3988#false} is VALID [2018-11-23 12:16:49,110 INFO L273 TraceCheckUtils]: 64: Hoare triple {3988#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3988#false} is VALID [2018-11-23 12:16:49,110 INFO L273 TraceCheckUtils]: 65: Hoare triple {3988#false} assume !(~i~2 < 9); {3988#false} is VALID [2018-11-23 12:16:49,111 INFO L273 TraceCheckUtils]: 66: Hoare triple {3988#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {3988#false} is VALID [2018-11-23 12:16:49,111 INFO L256 TraceCheckUtils]: 67: Hoare triple {3988#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {3987#true} is VALID [2018-11-23 12:16:49,111 INFO L273 TraceCheckUtils]: 68: Hoare triple {3987#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3987#true} is VALID [2018-11-23 12:16:49,111 INFO L273 TraceCheckUtils]: 69: Hoare triple {3987#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3987#true} is VALID [2018-11-23 12:16:49,111 INFO L273 TraceCheckUtils]: 70: Hoare triple {3987#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3987#true} is VALID [2018-11-23 12:16:49,111 INFO L273 TraceCheckUtils]: 71: Hoare triple {3987#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3987#true} is VALID [2018-11-23 12:16:49,112 INFO L273 TraceCheckUtils]: 72: Hoare triple {3987#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3987#true} is VALID [2018-11-23 12:16:49,112 INFO L273 TraceCheckUtils]: 73: Hoare triple {3987#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3987#true} is VALID [2018-11-23 12:16:49,112 INFO L273 TraceCheckUtils]: 74: Hoare triple {3987#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3987#true} is VALID [2018-11-23 12:16:49,112 INFO L273 TraceCheckUtils]: 75: Hoare triple {3987#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3987#true} is VALID [2018-11-23 12:16:49,112 INFO L273 TraceCheckUtils]: 76: Hoare triple {3987#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3987#true} is VALID [2018-11-23 12:16:49,113 INFO L273 TraceCheckUtils]: 77: Hoare triple {3987#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3987#true} is VALID [2018-11-23 12:16:49,113 INFO L273 TraceCheckUtils]: 78: Hoare triple {3987#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3987#true} is VALID [2018-11-23 12:16:49,113 INFO L273 TraceCheckUtils]: 79: Hoare triple {3987#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3987#true} is VALID [2018-11-23 12:16:49,113 INFO L273 TraceCheckUtils]: 80: Hoare triple {3987#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3987#true} is VALID [2018-11-23 12:16:49,113 INFO L273 TraceCheckUtils]: 81: Hoare triple {3987#true} assume !(~i~0 < 10); {3987#true} is VALID [2018-11-23 12:16:49,113 INFO L273 TraceCheckUtils]: 82: Hoare triple {3987#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3987#true} is VALID [2018-11-23 12:16:49,114 INFO L273 TraceCheckUtils]: 83: Hoare triple {3987#true} assume true; {3987#true} is VALID [2018-11-23 12:16:49,114 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {3987#true} {3988#false} #79#return; {3988#false} is VALID [2018-11-23 12:16:49,114 INFO L273 TraceCheckUtils]: 85: Hoare triple {3988#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {3988#false} is VALID [2018-11-23 12:16:49,114 INFO L273 TraceCheckUtils]: 86: Hoare triple {3988#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3988#false} is VALID [2018-11-23 12:16:49,114 INFO L273 TraceCheckUtils]: 87: Hoare triple {3988#false} assume !false; {3988#false} is VALID [2018-11-23 12:16:49,118 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 12:16:49,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:49,119 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:49,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:16:49,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:16:49,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:49,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:49,392 INFO L256 TraceCheckUtils]: 0: Hoare triple {3987#true} call ULTIMATE.init(); {3987#true} is VALID [2018-11-23 12:16:49,392 INFO L273 TraceCheckUtils]: 1: Hoare triple {3987#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3987#true} is VALID [2018-11-23 12:16:49,392 INFO L273 TraceCheckUtils]: 2: Hoare triple {3987#true} assume true; {3987#true} is VALID [2018-11-23 12:16:49,393 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3987#true} {3987#true} #71#return; {3987#true} is VALID [2018-11-23 12:16:49,393 INFO L256 TraceCheckUtils]: 4: Hoare triple {3987#true} call #t~ret14 := main(); {3987#true} is VALID [2018-11-23 12:16:49,394 INFO L273 TraceCheckUtils]: 5: Hoare triple {3987#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4016#(<= main_~i~1 0)} is VALID [2018-11-23 12:16:49,394 INFO L273 TraceCheckUtils]: 6: Hoare triple {4016#(<= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4016#(<= main_~i~1 0)} is VALID [2018-11-23 12:16:49,395 INFO L273 TraceCheckUtils]: 7: Hoare triple {4016#(<= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3990#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:49,395 INFO L273 TraceCheckUtils]: 8: Hoare triple {3990#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3990#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:49,396 INFO L273 TraceCheckUtils]: 9: Hoare triple {3990#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3991#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:49,396 INFO L273 TraceCheckUtils]: 10: Hoare triple {3991#(<= main_~i~1 2)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3991#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:49,397 INFO L273 TraceCheckUtils]: 11: Hoare triple {3991#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3992#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:49,398 INFO L273 TraceCheckUtils]: 12: Hoare triple {3992#(<= main_~i~1 3)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3992#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:49,399 INFO L273 TraceCheckUtils]: 13: Hoare triple {3992#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3993#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:49,399 INFO L273 TraceCheckUtils]: 14: Hoare triple {3993#(<= main_~i~1 4)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3993#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:49,400 INFO L273 TraceCheckUtils]: 15: Hoare triple {3993#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3994#(<= main_~i~1 5)} is VALID [2018-11-23 12:16:49,401 INFO L273 TraceCheckUtils]: 16: Hoare triple {3994#(<= main_~i~1 5)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3994#(<= main_~i~1 5)} is VALID [2018-11-23 12:16:49,402 INFO L273 TraceCheckUtils]: 17: Hoare triple {3994#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3995#(<= main_~i~1 6)} is VALID [2018-11-23 12:16:49,402 INFO L273 TraceCheckUtils]: 18: Hoare triple {3995#(<= main_~i~1 6)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3995#(<= main_~i~1 6)} is VALID [2018-11-23 12:16:49,403 INFO L273 TraceCheckUtils]: 19: Hoare triple {3995#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3996#(<= main_~i~1 7)} is VALID [2018-11-23 12:16:49,404 INFO L273 TraceCheckUtils]: 20: Hoare triple {3996#(<= main_~i~1 7)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {3996#(<= main_~i~1 7)} is VALID [2018-11-23 12:16:49,405 INFO L273 TraceCheckUtils]: 21: Hoare triple {3996#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3997#(<= main_~i~1 8)} is VALID [2018-11-23 12:16:49,406 INFO L273 TraceCheckUtils]: 22: Hoare triple {3997#(<= main_~i~1 8)} assume !(~i~1 < 10); {3988#false} is VALID [2018-11-23 12:16:49,406 INFO L256 TraceCheckUtils]: 23: Hoare triple {3988#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {3988#false} is VALID [2018-11-23 12:16:49,406 INFO L273 TraceCheckUtils]: 24: Hoare triple {3988#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3988#false} is VALID [2018-11-23 12:16:49,406 INFO L273 TraceCheckUtils]: 25: Hoare triple {3988#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3988#false} is VALID [2018-11-23 12:16:49,407 INFO L273 TraceCheckUtils]: 26: Hoare triple {3988#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3988#false} is VALID [2018-11-23 12:16:49,407 INFO L273 TraceCheckUtils]: 27: Hoare triple {3988#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3988#false} is VALID [2018-11-23 12:16:49,407 INFO L273 TraceCheckUtils]: 28: Hoare triple {3988#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3988#false} is VALID [2018-11-23 12:16:49,407 INFO L273 TraceCheckUtils]: 29: Hoare triple {3988#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3988#false} is VALID [2018-11-23 12:16:49,408 INFO L273 TraceCheckUtils]: 30: Hoare triple {3988#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3988#false} is VALID [2018-11-23 12:16:49,408 INFO L273 TraceCheckUtils]: 31: Hoare triple {3988#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3988#false} is VALID [2018-11-23 12:16:49,408 INFO L273 TraceCheckUtils]: 32: Hoare triple {3988#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3988#false} is VALID [2018-11-23 12:16:49,408 INFO L273 TraceCheckUtils]: 33: Hoare triple {3988#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3988#false} is VALID [2018-11-23 12:16:49,409 INFO L273 TraceCheckUtils]: 34: Hoare triple {3988#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3988#false} is VALID [2018-11-23 12:16:49,409 INFO L273 TraceCheckUtils]: 35: Hoare triple {3988#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3988#false} is VALID [2018-11-23 12:16:49,409 INFO L273 TraceCheckUtils]: 36: Hoare triple {3988#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3988#false} is VALID [2018-11-23 12:16:49,409 INFO L273 TraceCheckUtils]: 37: Hoare triple {3988#false} assume !(~i~0 < 10); {3988#false} is VALID [2018-11-23 12:16:49,409 INFO L273 TraceCheckUtils]: 38: Hoare triple {3988#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3988#false} is VALID [2018-11-23 12:16:49,409 INFO L273 TraceCheckUtils]: 39: Hoare triple {3988#false} assume true; {3988#false} is VALID [2018-11-23 12:16:49,410 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {3988#false} {3988#false} #75#return; {3988#false} is VALID [2018-11-23 12:16:49,410 INFO L273 TraceCheckUtils]: 41: Hoare triple {3988#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); {3988#false} is VALID [2018-11-23 12:16:49,410 INFO L256 TraceCheckUtils]: 42: Hoare triple {3988#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {3988#false} is VALID [2018-11-23 12:16:49,410 INFO L273 TraceCheckUtils]: 43: Hoare triple {3988#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3988#false} is VALID [2018-11-23 12:16:49,410 INFO L273 TraceCheckUtils]: 44: Hoare triple {3988#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3988#false} is VALID [2018-11-23 12:16:49,410 INFO L273 TraceCheckUtils]: 45: Hoare triple {3988#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3988#false} is VALID [2018-11-23 12:16:49,411 INFO L273 TraceCheckUtils]: 46: Hoare triple {3988#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3988#false} is VALID [2018-11-23 12:16:49,411 INFO L273 TraceCheckUtils]: 47: Hoare triple {3988#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3988#false} is VALID [2018-11-23 12:16:49,411 INFO L273 TraceCheckUtils]: 48: Hoare triple {3988#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3988#false} is VALID [2018-11-23 12:16:49,411 INFO L273 TraceCheckUtils]: 49: Hoare triple {3988#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3988#false} is VALID [2018-11-23 12:16:49,411 INFO L273 TraceCheckUtils]: 50: Hoare triple {3988#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3988#false} is VALID [2018-11-23 12:16:49,411 INFO L273 TraceCheckUtils]: 51: Hoare triple {3988#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3988#false} is VALID [2018-11-23 12:16:49,411 INFO L273 TraceCheckUtils]: 52: Hoare triple {3988#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3988#false} is VALID [2018-11-23 12:16:49,412 INFO L273 TraceCheckUtils]: 53: Hoare triple {3988#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3988#false} is VALID [2018-11-23 12:16:49,412 INFO L273 TraceCheckUtils]: 54: Hoare triple {3988#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3988#false} is VALID [2018-11-23 12:16:49,412 INFO L273 TraceCheckUtils]: 55: Hoare triple {3988#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3988#false} is VALID [2018-11-23 12:16:49,412 INFO L273 TraceCheckUtils]: 56: Hoare triple {3988#false} assume !(~i~0 < 10); {3988#false} is VALID [2018-11-23 12:16:49,412 INFO L273 TraceCheckUtils]: 57: Hoare triple {3988#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3988#false} is VALID [2018-11-23 12:16:49,412 INFO L273 TraceCheckUtils]: 58: Hoare triple {3988#false} assume true; {3988#false} is VALID [2018-11-23 12:16:49,413 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {3988#false} {3988#false} #77#return; {3988#false} is VALID [2018-11-23 12:16:49,413 INFO L273 TraceCheckUtils]: 60: Hoare triple {3988#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; {3988#false} is VALID [2018-11-23 12:16:49,413 INFO L273 TraceCheckUtils]: 61: Hoare triple {3988#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3988#false} is VALID [2018-11-23 12:16:49,413 INFO L273 TraceCheckUtils]: 62: Hoare triple {3988#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3988#false} is VALID [2018-11-23 12:16:49,413 INFO L273 TraceCheckUtils]: 63: Hoare triple {3988#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {3988#false} is VALID [2018-11-23 12:16:49,413 INFO L273 TraceCheckUtils]: 64: Hoare triple {3988#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {3988#false} is VALID [2018-11-23 12:16:49,414 INFO L273 TraceCheckUtils]: 65: Hoare triple {3988#false} assume !(~i~2 < 9); {3988#false} is VALID [2018-11-23 12:16:49,414 INFO L273 TraceCheckUtils]: 66: Hoare triple {3988#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {3988#false} is VALID [2018-11-23 12:16:49,414 INFO L256 TraceCheckUtils]: 67: Hoare triple {3988#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {3988#false} is VALID [2018-11-23 12:16:49,414 INFO L273 TraceCheckUtils]: 68: Hoare triple {3988#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {3988#false} is VALID [2018-11-23 12:16:49,414 INFO L273 TraceCheckUtils]: 69: Hoare triple {3988#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3988#false} is VALID [2018-11-23 12:16:49,414 INFO L273 TraceCheckUtils]: 70: Hoare triple {3988#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3988#false} is VALID [2018-11-23 12:16:49,414 INFO L273 TraceCheckUtils]: 71: Hoare triple {3988#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3988#false} is VALID [2018-11-23 12:16:49,415 INFO L273 TraceCheckUtils]: 72: Hoare triple {3988#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3988#false} is VALID [2018-11-23 12:16:49,415 INFO L273 TraceCheckUtils]: 73: Hoare triple {3988#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3988#false} is VALID [2018-11-23 12:16:49,415 INFO L273 TraceCheckUtils]: 74: Hoare triple {3988#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3988#false} is VALID [2018-11-23 12:16:49,415 INFO L273 TraceCheckUtils]: 75: Hoare triple {3988#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3988#false} is VALID [2018-11-23 12:16:49,415 INFO L273 TraceCheckUtils]: 76: Hoare triple {3988#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3988#false} is VALID [2018-11-23 12:16:49,415 INFO L273 TraceCheckUtils]: 77: Hoare triple {3988#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3988#false} is VALID [2018-11-23 12:16:49,415 INFO L273 TraceCheckUtils]: 78: Hoare triple {3988#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {3988#false} is VALID [2018-11-23 12:16:49,416 INFO L273 TraceCheckUtils]: 79: Hoare triple {3988#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {3988#false} is VALID [2018-11-23 12:16:49,416 INFO L273 TraceCheckUtils]: 80: Hoare triple {3988#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3988#false} is VALID [2018-11-23 12:16:49,416 INFO L273 TraceCheckUtils]: 81: Hoare triple {3988#false} assume !(~i~0 < 10); {3988#false} is VALID [2018-11-23 12:16:49,416 INFO L273 TraceCheckUtils]: 82: Hoare triple {3988#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {3988#false} is VALID [2018-11-23 12:16:49,416 INFO L273 TraceCheckUtils]: 83: Hoare triple {3988#false} assume true; {3988#false} is VALID [2018-11-23 12:16:49,416 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {3988#false} {3988#false} #79#return; {3988#false} is VALID [2018-11-23 12:16:49,417 INFO L273 TraceCheckUtils]: 85: Hoare triple {3988#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {3988#false} is VALID [2018-11-23 12:16:49,417 INFO L273 TraceCheckUtils]: 86: Hoare triple {3988#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3988#false} is VALID [2018-11-23 12:16:49,417 INFO L273 TraceCheckUtils]: 87: Hoare triple {3988#false} assume !false; {3988#false} is VALID [2018-11-23 12:16:49,424 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 12:16:49,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:49,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:16:49,443 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 88 [2018-11-23 12:16:49,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:49,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:16:49,511 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,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:16:49,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:16:49,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:16:49,513 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 12 states. [2018-11-23 12:16:49,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:49,919 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2018-11-23 12:16:49,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:16:49,919 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 88 [2018-11-23 12:16:49,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:49,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:16:49,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 12:16:49,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:16:49,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 12:16:49,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 74 transitions. [2018-11-23 12:16:50,015 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:50,017 INFO L225 Difference]: With dead ends: 90 [2018-11-23 12:16:50,017 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 12:16:50,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:16:50,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 12:16:50,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-11-23 12:16:50,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:50,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 57 states. [2018-11-23 12:16:50,040 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 57 states. [2018-11-23 12:16:50,041 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 57 states. [2018-11-23 12:16:50,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:50,043 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-11-23 12:16:50,043 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-11-23 12:16:50,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:50,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:50,044 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 58 states. [2018-11-23 12:16:50,044 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 58 states. [2018-11-23 12:16:50,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:50,047 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-11-23 12:16:50,047 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-11-23 12:16:50,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:50,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:50,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:50,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:50,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:16:50,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2018-11-23 12:16:50,050 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 88 [2018-11-23 12:16:50,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:50,050 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-11-23 12:16:50,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:16:50,050 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-11-23 12:16:50,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 12:16:50,051 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:50,051 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 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:50,052 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:50,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:50,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1870143516, now seen corresponding path program 9 times [2018-11-23 12:16:50,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:50,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:50,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:50,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:50,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:50,403 INFO L256 TraceCheckUtils]: 0: Hoare triple {4589#true} call ULTIMATE.init(); {4589#true} is VALID [2018-11-23 12:16:50,403 INFO L273 TraceCheckUtils]: 1: Hoare triple {4589#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4589#true} is VALID [2018-11-23 12:16:50,404 INFO L273 TraceCheckUtils]: 2: Hoare triple {4589#true} assume true; {4589#true} is VALID [2018-11-23 12:16:50,404 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4589#true} {4589#true} #71#return; {4589#true} is VALID [2018-11-23 12:16:50,404 INFO L256 TraceCheckUtils]: 4: Hoare triple {4589#true} call #t~ret14 := main(); {4589#true} is VALID [2018-11-23 12:16:50,405 INFO L273 TraceCheckUtils]: 5: Hoare triple {4589#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4591#(= main_~i~1 0)} is VALID [2018-11-23 12:16:50,405 INFO L273 TraceCheckUtils]: 6: Hoare triple {4591#(= main_~i~1 0)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4591#(= main_~i~1 0)} is VALID [2018-11-23 12:16:50,406 INFO L273 TraceCheckUtils]: 7: Hoare triple {4591#(= main_~i~1 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4592#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:50,406 INFO L273 TraceCheckUtils]: 8: Hoare triple {4592#(<= main_~i~1 1)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4592#(<= main_~i~1 1)} is VALID [2018-11-23 12:16:50,407 INFO L273 TraceCheckUtils]: 9: Hoare triple {4592#(<= main_~i~1 1)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4593#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:50,407 INFO L273 TraceCheckUtils]: 10: Hoare triple {4593#(<= main_~i~1 2)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4593#(<= main_~i~1 2)} is VALID [2018-11-23 12:16:50,408 INFO L273 TraceCheckUtils]: 11: Hoare triple {4593#(<= main_~i~1 2)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4594#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:50,409 INFO L273 TraceCheckUtils]: 12: Hoare triple {4594#(<= main_~i~1 3)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4594#(<= main_~i~1 3)} is VALID [2018-11-23 12:16:50,409 INFO L273 TraceCheckUtils]: 13: Hoare triple {4594#(<= main_~i~1 3)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4595#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:50,410 INFO L273 TraceCheckUtils]: 14: Hoare triple {4595#(<= main_~i~1 4)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4595#(<= main_~i~1 4)} is VALID [2018-11-23 12:16:50,411 INFO L273 TraceCheckUtils]: 15: Hoare triple {4595#(<= main_~i~1 4)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4596#(<= main_~i~1 5)} is VALID [2018-11-23 12:16:50,411 INFO L273 TraceCheckUtils]: 16: Hoare triple {4596#(<= main_~i~1 5)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4596#(<= main_~i~1 5)} is VALID [2018-11-23 12:16:50,412 INFO L273 TraceCheckUtils]: 17: Hoare triple {4596#(<= main_~i~1 5)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4597#(<= main_~i~1 6)} is VALID [2018-11-23 12:16:50,413 INFO L273 TraceCheckUtils]: 18: Hoare triple {4597#(<= main_~i~1 6)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4597#(<= main_~i~1 6)} is VALID [2018-11-23 12:16:50,414 INFO L273 TraceCheckUtils]: 19: Hoare triple {4597#(<= main_~i~1 6)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4598#(<= main_~i~1 7)} is VALID [2018-11-23 12:16:50,414 INFO L273 TraceCheckUtils]: 20: Hoare triple {4598#(<= main_~i~1 7)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4598#(<= main_~i~1 7)} is VALID [2018-11-23 12:16:50,415 INFO L273 TraceCheckUtils]: 21: Hoare triple {4598#(<= main_~i~1 7)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4599#(<= main_~i~1 8)} is VALID [2018-11-23 12:16:50,416 INFO L273 TraceCheckUtils]: 22: Hoare triple {4599#(<= main_~i~1 8)} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4599#(<= main_~i~1 8)} is VALID [2018-11-23 12:16:50,417 INFO L273 TraceCheckUtils]: 23: Hoare triple {4599#(<= main_~i~1 8)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4600#(<= main_~i~1 9)} is VALID [2018-11-23 12:16:50,417 INFO L273 TraceCheckUtils]: 24: Hoare triple {4600#(<= main_~i~1 9)} assume !(~i~1 < 10); {4590#false} is VALID [2018-11-23 12:16:50,418 INFO L256 TraceCheckUtils]: 25: Hoare triple {4590#false} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {4589#true} is VALID [2018-11-23 12:16:50,418 INFO L273 TraceCheckUtils]: 26: Hoare triple {4589#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {4589#true} is VALID [2018-11-23 12:16:50,418 INFO L273 TraceCheckUtils]: 27: Hoare triple {4589#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4589#true} is VALID [2018-11-23 12:16:50,433 INFO L273 TraceCheckUtils]: 28: Hoare triple {4589#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4589#true} is VALID [2018-11-23 12:16:50,434 INFO L273 TraceCheckUtils]: 29: Hoare triple {4589#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4589#true} is VALID [2018-11-23 12:16:50,434 INFO L273 TraceCheckUtils]: 30: Hoare triple {4589#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4589#true} is VALID [2018-11-23 12:16:50,434 INFO L273 TraceCheckUtils]: 31: Hoare triple {4589#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4589#true} is VALID [2018-11-23 12:16:50,434 INFO L273 TraceCheckUtils]: 32: Hoare triple {4589#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4589#true} is VALID [2018-11-23 12:16:50,434 INFO L273 TraceCheckUtils]: 33: Hoare triple {4589#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4589#true} is VALID [2018-11-23 12:16:50,434 INFO L273 TraceCheckUtils]: 34: Hoare triple {4589#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4589#true} is VALID [2018-11-23 12:16:50,434 INFO L273 TraceCheckUtils]: 35: Hoare triple {4589#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4589#true} is VALID [2018-11-23 12:16:50,435 INFO L273 TraceCheckUtils]: 36: Hoare triple {4589#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4589#true} is VALID [2018-11-23 12:16:50,435 INFO L273 TraceCheckUtils]: 37: Hoare triple {4589#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4589#true} is VALID [2018-11-23 12:16:50,435 INFO L273 TraceCheckUtils]: 38: Hoare triple {4589#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4589#true} is VALID [2018-11-23 12:16:50,435 INFO L273 TraceCheckUtils]: 39: Hoare triple {4589#true} assume !(~i~0 < 10); {4589#true} is VALID [2018-11-23 12:16:50,435 INFO L273 TraceCheckUtils]: 40: Hoare triple {4589#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4589#true} is VALID [2018-11-23 12:16:50,436 INFO L273 TraceCheckUtils]: 41: Hoare triple {4589#true} assume true; {4589#true} is VALID [2018-11-23 12:16:50,436 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {4589#true} {4590#false} #75#return; {4590#false} is VALID [2018-11-23 12:16:50,436 INFO L273 TraceCheckUtils]: 43: Hoare triple {4590#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); {4590#false} is VALID [2018-11-23 12:16:50,437 INFO L256 TraceCheckUtils]: 44: Hoare triple {4590#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {4589#true} is VALID [2018-11-23 12:16:50,437 INFO L273 TraceCheckUtils]: 45: Hoare triple {4589#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {4589#true} is VALID [2018-11-23 12:16:50,437 INFO L273 TraceCheckUtils]: 46: Hoare triple {4589#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4589#true} is VALID [2018-11-23 12:16:50,437 INFO L273 TraceCheckUtils]: 47: Hoare triple {4589#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4589#true} is VALID [2018-11-23 12:16:50,437 INFO L273 TraceCheckUtils]: 48: Hoare triple {4589#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4589#true} is VALID [2018-11-23 12:16:50,437 INFO L273 TraceCheckUtils]: 49: Hoare triple {4589#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4589#true} is VALID [2018-11-23 12:16:50,437 INFO L273 TraceCheckUtils]: 50: Hoare triple {4589#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4589#true} is VALID [2018-11-23 12:16:50,438 INFO L273 TraceCheckUtils]: 51: Hoare triple {4589#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4589#true} is VALID [2018-11-23 12:16:50,438 INFO L273 TraceCheckUtils]: 52: Hoare triple {4589#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4589#true} is VALID [2018-11-23 12:16:50,438 INFO L273 TraceCheckUtils]: 53: Hoare triple {4589#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4589#true} is VALID [2018-11-23 12:16:50,438 INFO L273 TraceCheckUtils]: 54: Hoare triple {4589#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4589#true} is VALID [2018-11-23 12:16:50,438 INFO L273 TraceCheckUtils]: 55: Hoare triple {4589#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4589#true} is VALID [2018-11-23 12:16:50,438 INFO L273 TraceCheckUtils]: 56: Hoare triple {4589#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4589#true} is VALID [2018-11-23 12:16:50,438 INFO L273 TraceCheckUtils]: 57: Hoare triple {4589#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4589#true} is VALID [2018-11-23 12:16:50,438 INFO L273 TraceCheckUtils]: 58: Hoare triple {4589#true} assume !(~i~0 < 10); {4589#true} is VALID [2018-11-23 12:16:50,438 INFO L273 TraceCheckUtils]: 59: Hoare triple {4589#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4589#true} is VALID [2018-11-23 12:16:50,439 INFO L273 TraceCheckUtils]: 60: Hoare triple {4589#true} assume true; {4589#true} is VALID [2018-11-23 12:16:50,439 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {4589#true} {4590#false} #77#return; {4590#false} is VALID [2018-11-23 12:16:50,439 INFO L273 TraceCheckUtils]: 62: Hoare triple {4590#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; {4590#false} is VALID [2018-11-23 12:16:50,439 INFO L273 TraceCheckUtils]: 63: Hoare triple {4590#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4590#false} is VALID [2018-11-23 12:16:50,439 INFO L273 TraceCheckUtils]: 64: Hoare triple {4590#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {4590#false} is VALID [2018-11-23 12:16:50,439 INFO L273 TraceCheckUtils]: 65: Hoare triple {4590#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4590#false} is VALID [2018-11-23 12:16:50,440 INFO L273 TraceCheckUtils]: 66: Hoare triple {4590#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {4590#false} is VALID [2018-11-23 12:16:50,440 INFO L273 TraceCheckUtils]: 67: Hoare triple {4590#false} assume !(~i~2 < 9); {4590#false} is VALID [2018-11-23 12:16:50,440 INFO L273 TraceCheckUtils]: 68: Hoare triple {4590#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {4590#false} is VALID [2018-11-23 12:16:50,440 INFO L256 TraceCheckUtils]: 69: Hoare triple {4590#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {4589#true} is VALID [2018-11-23 12:16:50,440 INFO L273 TraceCheckUtils]: 70: Hoare triple {4589#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {4589#true} is VALID [2018-11-23 12:16:50,441 INFO L273 TraceCheckUtils]: 71: Hoare triple {4589#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4589#true} is VALID [2018-11-23 12:16:50,441 INFO L273 TraceCheckUtils]: 72: Hoare triple {4589#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4589#true} is VALID [2018-11-23 12:16:50,441 INFO L273 TraceCheckUtils]: 73: Hoare triple {4589#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4589#true} is VALID [2018-11-23 12:16:50,441 INFO L273 TraceCheckUtils]: 74: Hoare triple {4589#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4589#true} is VALID [2018-11-23 12:16:50,441 INFO L273 TraceCheckUtils]: 75: Hoare triple {4589#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4589#true} is VALID [2018-11-23 12:16:50,441 INFO L273 TraceCheckUtils]: 76: Hoare triple {4589#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4589#true} is VALID [2018-11-23 12:16:50,442 INFO L273 TraceCheckUtils]: 77: Hoare triple {4589#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4589#true} is VALID [2018-11-23 12:16:50,442 INFO L273 TraceCheckUtils]: 78: Hoare triple {4589#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4589#true} is VALID [2018-11-23 12:16:50,442 INFO L273 TraceCheckUtils]: 79: Hoare triple {4589#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4589#true} is VALID [2018-11-23 12:16:50,442 INFO L273 TraceCheckUtils]: 80: Hoare triple {4589#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4589#true} is VALID [2018-11-23 12:16:50,442 INFO L273 TraceCheckUtils]: 81: Hoare triple {4589#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4589#true} is VALID [2018-11-23 12:16:50,442 INFO L273 TraceCheckUtils]: 82: Hoare triple {4589#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4589#true} is VALID [2018-11-23 12:16:50,443 INFO L273 TraceCheckUtils]: 83: Hoare triple {4589#true} assume !(~i~0 < 10); {4589#true} is VALID [2018-11-23 12:16:50,443 INFO L273 TraceCheckUtils]: 84: Hoare triple {4589#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4589#true} is VALID [2018-11-23 12:16:50,443 INFO L273 TraceCheckUtils]: 85: Hoare triple {4589#true} assume true; {4589#true} is VALID [2018-11-23 12:16:50,443 INFO L268 TraceCheckUtils]: 86: Hoare quadruple {4589#true} {4590#false} #79#return; {4590#false} is VALID [2018-11-23 12:16:50,443 INFO L273 TraceCheckUtils]: 87: Hoare triple {4590#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {4590#false} is VALID [2018-11-23 12:16:50,443 INFO L273 TraceCheckUtils]: 88: Hoare triple {4590#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4590#false} is VALID [2018-11-23 12:16:50,444 INFO L273 TraceCheckUtils]: 89: Hoare triple {4590#false} assume !false; {4590#false} is VALID [2018-11-23 12:16:50,447 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-23 12:16:50,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:50,447 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:50,461 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:16:50,493 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:16:50,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:50,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:50,698 INFO L256 TraceCheckUtils]: 0: Hoare triple {4589#true} call ULTIMATE.init(); {4589#true} is VALID [2018-11-23 12:16:50,699 INFO L273 TraceCheckUtils]: 1: Hoare triple {4589#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4589#true} is VALID [2018-11-23 12:16:50,699 INFO L273 TraceCheckUtils]: 2: Hoare triple {4589#true} assume true; {4589#true} is VALID [2018-11-23 12:16:50,699 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4589#true} {4589#true} #71#return; {4589#true} is VALID [2018-11-23 12:16:50,699 INFO L256 TraceCheckUtils]: 4: Hoare triple {4589#true} call #t~ret14 := main(); {4589#true} is VALID [2018-11-23 12:16:50,699 INFO L273 TraceCheckUtils]: 5: Hoare triple {4589#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4589#true} is VALID [2018-11-23 12:16:50,700 INFO L273 TraceCheckUtils]: 6: Hoare triple {4589#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4589#true} is VALID [2018-11-23 12:16:50,700 INFO L273 TraceCheckUtils]: 7: Hoare triple {4589#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4589#true} is VALID [2018-11-23 12:16:50,700 INFO L273 TraceCheckUtils]: 8: Hoare triple {4589#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4589#true} is VALID [2018-11-23 12:16:50,700 INFO L273 TraceCheckUtils]: 9: Hoare triple {4589#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4589#true} is VALID [2018-11-23 12:16:50,700 INFO L273 TraceCheckUtils]: 10: Hoare triple {4589#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4589#true} is VALID [2018-11-23 12:16:50,700 INFO L273 TraceCheckUtils]: 11: Hoare triple {4589#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4589#true} is VALID [2018-11-23 12:16:50,701 INFO L273 TraceCheckUtils]: 12: Hoare triple {4589#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4589#true} is VALID [2018-11-23 12:16:50,701 INFO L273 TraceCheckUtils]: 13: Hoare triple {4589#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4589#true} is VALID [2018-11-23 12:16:50,701 INFO L273 TraceCheckUtils]: 14: Hoare triple {4589#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4589#true} is VALID [2018-11-23 12:16:50,701 INFO L273 TraceCheckUtils]: 15: Hoare triple {4589#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4589#true} is VALID [2018-11-23 12:16:50,701 INFO L273 TraceCheckUtils]: 16: Hoare triple {4589#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4589#true} is VALID [2018-11-23 12:16:50,701 INFO L273 TraceCheckUtils]: 17: Hoare triple {4589#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4589#true} is VALID [2018-11-23 12:16:50,701 INFO L273 TraceCheckUtils]: 18: Hoare triple {4589#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4589#true} is VALID [2018-11-23 12:16:50,701 INFO L273 TraceCheckUtils]: 19: Hoare triple {4589#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4589#true} is VALID [2018-11-23 12:16:50,702 INFO L273 TraceCheckUtils]: 20: Hoare triple {4589#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4589#true} is VALID [2018-11-23 12:16:50,702 INFO L273 TraceCheckUtils]: 21: Hoare triple {4589#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4589#true} is VALID [2018-11-23 12:16:50,702 INFO L273 TraceCheckUtils]: 22: Hoare triple {4589#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {4589#true} is VALID [2018-11-23 12:16:50,702 INFO L273 TraceCheckUtils]: 23: Hoare triple {4589#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4589#true} is VALID [2018-11-23 12:16:50,702 INFO L273 TraceCheckUtils]: 24: Hoare triple {4589#true} assume !(~i~1 < 10); {4589#true} is VALID [2018-11-23 12:16:50,702 INFO L256 TraceCheckUtils]: 25: Hoare triple {4589#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {4589#true} is VALID [2018-11-23 12:16:50,702 INFO L273 TraceCheckUtils]: 26: Hoare triple {4589#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {4589#true} is VALID [2018-11-23 12:16:50,703 INFO L273 TraceCheckUtils]: 27: Hoare triple {4589#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4589#true} is VALID [2018-11-23 12:16:50,703 INFO L273 TraceCheckUtils]: 28: Hoare triple {4589#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4589#true} is VALID [2018-11-23 12:16:50,703 INFO L273 TraceCheckUtils]: 29: Hoare triple {4589#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4589#true} is VALID [2018-11-23 12:16:50,703 INFO L273 TraceCheckUtils]: 30: Hoare triple {4589#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4589#true} is VALID [2018-11-23 12:16:50,703 INFO L273 TraceCheckUtils]: 31: Hoare triple {4589#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4589#true} is VALID [2018-11-23 12:16:50,703 INFO L273 TraceCheckUtils]: 32: Hoare triple {4589#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4589#true} is VALID [2018-11-23 12:16:50,704 INFO L273 TraceCheckUtils]: 33: Hoare triple {4589#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4589#true} is VALID [2018-11-23 12:16:50,704 INFO L273 TraceCheckUtils]: 34: Hoare triple {4589#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4589#true} is VALID [2018-11-23 12:16:50,704 INFO L273 TraceCheckUtils]: 35: Hoare triple {4589#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4589#true} is VALID [2018-11-23 12:16:50,704 INFO L273 TraceCheckUtils]: 36: Hoare triple {4589#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4589#true} is VALID [2018-11-23 12:16:50,704 INFO L273 TraceCheckUtils]: 37: Hoare triple {4589#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4589#true} is VALID [2018-11-23 12:16:50,705 INFO L273 TraceCheckUtils]: 38: Hoare triple {4589#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4589#true} is VALID [2018-11-23 12:16:50,705 INFO L273 TraceCheckUtils]: 39: Hoare triple {4589#true} assume !(~i~0 < 10); {4589#true} is VALID [2018-11-23 12:16:50,705 INFO L273 TraceCheckUtils]: 40: Hoare triple {4589#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4589#true} is VALID [2018-11-23 12:16:50,705 INFO L273 TraceCheckUtils]: 41: Hoare triple {4589#true} assume true; {4589#true} is VALID [2018-11-23 12:16:50,705 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {4589#true} {4589#true} #75#return; {4589#true} is VALID [2018-11-23 12:16:50,705 INFO L273 TraceCheckUtils]: 43: Hoare triple {4589#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); {4589#true} is VALID [2018-11-23 12:16:50,706 INFO L256 TraceCheckUtils]: 44: Hoare triple {4589#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {4589#true} is VALID [2018-11-23 12:16:50,706 INFO L273 TraceCheckUtils]: 45: Hoare triple {4589#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {4589#true} is VALID [2018-11-23 12:16:50,706 INFO L273 TraceCheckUtils]: 46: Hoare triple {4589#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4589#true} is VALID [2018-11-23 12:16:50,706 INFO L273 TraceCheckUtils]: 47: Hoare triple {4589#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4589#true} is VALID [2018-11-23 12:16:50,706 INFO L273 TraceCheckUtils]: 48: Hoare triple {4589#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4589#true} is VALID [2018-11-23 12:16:50,706 INFO L273 TraceCheckUtils]: 49: Hoare triple {4589#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4589#true} is VALID [2018-11-23 12:16:50,707 INFO L273 TraceCheckUtils]: 50: Hoare triple {4589#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4589#true} is VALID [2018-11-23 12:16:50,707 INFO L273 TraceCheckUtils]: 51: Hoare triple {4589#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4589#true} is VALID [2018-11-23 12:16:50,707 INFO L273 TraceCheckUtils]: 52: Hoare triple {4589#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4589#true} is VALID [2018-11-23 12:16:50,707 INFO L273 TraceCheckUtils]: 53: Hoare triple {4589#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4589#true} is VALID [2018-11-23 12:16:50,707 INFO L273 TraceCheckUtils]: 54: Hoare triple {4589#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4589#true} is VALID [2018-11-23 12:16:50,707 INFO L273 TraceCheckUtils]: 55: Hoare triple {4589#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4589#true} is VALID [2018-11-23 12:16:50,708 INFO L273 TraceCheckUtils]: 56: Hoare triple {4589#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4589#true} is VALID [2018-11-23 12:16:50,708 INFO L273 TraceCheckUtils]: 57: Hoare triple {4589#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4589#true} is VALID [2018-11-23 12:16:50,708 INFO L273 TraceCheckUtils]: 58: Hoare triple {4589#true} assume !(~i~0 < 10); {4589#true} is VALID [2018-11-23 12:16:50,708 INFO L273 TraceCheckUtils]: 59: Hoare triple {4589#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4589#true} is VALID [2018-11-23 12:16:50,708 INFO L273 TraceCheckUtils]: 60: Hoare triple {4589#true} assume true; {4589#true} is VALID [2018-11-23 12:16:50,708 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {4589#true} {4589#true} #77#return; {4589#true} is VALID [2018-11-23 12:16:50,721 INFO L273 TraceCheckUtils]: 62: Hoare triple {4589#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; {4790#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:50,721 INFO L273 TraceCheckUtils]: 63: Hoare triple {4790#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4790#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:50,722 INFO L273 TraceCheckUtils]: 64: Hoare triple {4790#(<= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {4797#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:50,722 INFO L273 TraceCheckUtils]: 65: Hoare triple {4797#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {4797#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:50,723 INFO L273 TraceCheckUtils]: 66: Hoare triple {4797#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {4804#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:50,723 INFO L273 TraceCheckUtils]: 67: Hoare triple {4804#(<= main_~i~2 2)} assume !(~i~2 < 9); {4590#false} is VALID [2018-11-23 12:16:50,723 INFO L273 TraceCheckUtils]: 68: Hoare triple {4590#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {4590#false} is VALID [2018-11-23 12:16:50,723 INFO L256 TraceCheckUtils]: 69: Hoare triple {4590#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {4590#false} is VALID [2018-11-23 12:16:50,724 INFO L273 TraceCheckUtils]: 70: Hoare triple {4590#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {4590#false} is VALID [2018-11-23 12:16:50,724 INFO L273 TraceCheckUtils]: 71: Hoare triple {4590#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4590#false} is VALID [2018-11-23 12:16:50,724 INFO L273 TraceCheckUtils]: 72: Hoare triple {4590#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4590#false} is VALID [2018-11-23 12:16:50,724 INFO L273 TraceCheckUtils]: 73: Hoare triple {4590#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4590#false} is VALID [2018-11-23 12:16:50,724 INFO L273 TraceCheckUtils]: 74: Hoare triple {4590#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4590#false} is VALID [2018-11-23 12:16:50,724 INFO L273 TraceCheckUtils]: 75: Hoare triple {4590#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4590#false} is VALID [2018-11-23 12:16:50,724 INFO L273 TraceCheckUtils]: 76: Hoare triple {4590#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4590#false} is VALID [2018-11-23 12:16:50,724 INFO L273 TraceCheckUtils]: 77: Hoare triple {4590#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4590#false} is VALID [2018-11-23 12:16:50,725 INFO L273 TraceCheckUtils]: 78: Hoare triple {4590#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4590#false} is VALID [2018-11-23 12:16:50,725 INFO L273 TraceCheckUtils]: 79: Hoare triple {4590#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4590#false} is VALID [2018-11-23 12:16:50,725 INFO L273 TraceCheckUtils]: 80: Hoare triple {4590#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {4590#false} is VALID [2018-11-23 12:16:50,725 INFO L273 TraceCheckUtils]: 81: Hoare triple {4590#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {4590#false} is VALID [2018-11-23 12:16:50,725 INFO L273 TraceCheckUtils]: 82: Hoare triple {4590#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4590#false} is VALID [2018-11-23 12:16:50,725 INFO L273 TraceCheckUtils]: 83: Hoare triple {4590#false} assume !(~i~0 < 10); {4590#false} is VALID [2018-11-23 12:16:50,725 INFO L273 TraceCheckUtils]: 84: Hoare triple {4590#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {4590#false} is VALID [2018-11-23 12:16:50,726 INFO L273 TraceCheckUtils]: 85: Hoare triple {4590#false} assume true; {4590#false} is VALID [2018-11-23 12:16:50,726 INFO L268 TraceCheckUtils]: 86: Hoare quadruple {4590#false} {4590#false} #79#return; {4590#false} is VALID [2018-11-23 12:16:50,726 INFO L273 TraceCheckUtils]: 87: Hoare triple {4590#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {4590#false} is VALID [2018-11-23 12:16:50,726 INFO L273 TraceCheckUtils]: 88: Hoare triple {4590#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4590#false} is VALID [2018-11-23 12:16:50,726 INFO L273 TraceCheckUtils]: 89: Hoare triple {4590#false} assume !false; {4590#false} is VALID [2018-11-23 12:16:50,729 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 122 proven. 4 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-11-23 12:16:50,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:50,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2018-11-23 12:16:50,749 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2018-11-23 12:16:50,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:50,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:16:50,817 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:16:50,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:16:50,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:16:50,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:16:50,819 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 15 states. [2018-11-23 12:16:51,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:51,213 INFO L93 Difference]: Finished difference Result 94 states and 111 transitions. [2018-11-23 12:16:51,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:16:51,213 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2018-11-23 12:16:51,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:51,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:16:51,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 82 transitions. [2018-11-23 12:16:51,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:16:51,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 82 transitions. [2018-11-23 12:16:51,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 82 transitions. [2018-11-23 12:16:51,379 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:16:51,382 INFO L225 Difference]: With dead ends: 94 [2018-11-23 12:16:51,382 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 12:16:51,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:16:51,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 12:16:51,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-11-23 12:16:51,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:51,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 61 states. [2018-11-23 12:16:51,429 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 61 states. [2018-11-23 12:16:51,429 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 61 states. [2018-11-23 12:16:51,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:51,431 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-23 12:16:51,431 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-11-23 12:16:51,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:51,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:51,432 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 62 states. [2018-11-23 12:16:51,432 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 62 states. [2018-11-23 12:16:51,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:51,434 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-23 12:16:51,434 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-11-23 12:16:51,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:51,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:51,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:51,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:51,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 12:16:51,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2018-11-23 12:16:51,437 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 90 [2018-11-23 12:16:51,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:51,437 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2018-11-23 12:16:51,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:16:51,437 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2018-11-23 12:16:51,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-23 12:16:51,438 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:51,438 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 10, 10, 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:16:51,439 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:51,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:51,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1573371196, now seen corresponding path program 10 times [2018-11-23 12:16:51,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:51,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:51,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:51,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:51,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:51,843 INFO L256 TraceCheckUtils]: 0: Hoare triple {5220#true} call ULTIMATE.init(); {5220#true} is VALID [2018-11-23 12:16:51,843 INFO L273 TraceCheckUtils]: 1: Hoare triple {5220#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5220#true} is VALID [2018-11-23 12:16:51,843 INFO L273 TraceCheckUtils]: 2: Hoare triple {5220#true} assume true; {5220#true} is VALID [2018-11-23 12:16:51,844 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5220#true} {5220#true} #71#return; {5220#true} is VALID [2018-11-23 12:16:51,844 INFO L256 TraceCheckUtils]: 4: Hoare triple {5220#true} call #t~ret14 := main(); {5220#true} is VALID [2018-11-23 12:16:51,844 INFO L273 TraceCheckUtils]: 5: Hoare triple {5220#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5220#true} is VALID [2018-11-23 12:16:51,844 INFO L273 TraceCheckUtils]: 6: Hoare triple {5220#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5220#true} is VALID [2018-11-23 12:16:51,844 INFO L273 TraceCheckUtils]: 7: Hoare triple {5220#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5220#true} is VALID [2018-11-23 12:16:51,844 INFO L273 TraceCheckUtils]: 8: Hoare triple {5220#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5220#true} is VALID [2018-11-23 12:16:51,844 INFO L273 TraceCheckUtils]: 9: Hoare triple {5220#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5220#true} is VALID [2018-11-23 12:16:51,844 INFO L273 TraceCheckUtils]: 10: Hoare triple {5220#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5220#true} is VALID [2018-11-23 12:16:51,845 INFO L273 TraceCheckUtils]: 11: Hoare triple {5220#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5220#true} is VALID [2018-11-23 12:16:51,845 INFO L273 TraceCheckUtils]: 12: Hoare triple {5220#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5220#true} is VALID [2018-11-23 12:16:51,845 INFO L273 TraceCheckUtils]: 13: Hoare triple {5220#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5220#true} is VALID [2018-11-23 12:16:51,845 INFO L273 TraceCheckUtils]: 14: Hoare triple {5220#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5220#true} is VALID [2018-11-23 12:16:51,845 INFO L273 TraceCheckUtils]: 15: Hoare triple {5220#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5220#true} is VALID [2018-11-23 12:16:51,845 INFO L273 TraceCheckUtils]: 16: Hoare triple {5220#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5220#true} is VALID [2018-11-23 12:16:51,845 INFO L273 TraceCheckUtils]: 17: Hoare triple {5220#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5220#true} is VALID [2018-11-23 12:16:51,845 INFO L273 TraceCheckUtils]: 18: Hoare triple {5220#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5220#true} is VALID [2018-11-23 12:16:51,846 INFO L273 TraceCheckUtils]: 19: Hoare triple {5220#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5220#true} is VALID [2018-11-23 12:16:51,846 INFO L273 TraceCheckUtils]: 20: Hoare triple {5220#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5220#true} is VALID [2018-11-23 12:16:51,846 INFO L273 TraceCheckUtils]: 21: Hoare triple {5220#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5220#true} is VALID [2018-11-23 12:16:51,846 INFO L273 TraceCheckUtils]: 22: Hoare triple {5220#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5220#true} is VALID [2018-11-23 12:16:51,846 INFO L273 TraceCheckUtils]: 23: Hoare triple {5220#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5220#true} is VALID [2018-11-23 12:16:51,846 INFO L273 TraceCheckUtils]: 24: Hoare triple {5220#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5220#true} is VALID [2018-11-23 12:16:51,846 INFO L273 TraceCheckUtils]: 25: Hoare triple {5220#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5220#true} is VALID [2018-11-23 12:16:51,846 INFO L273 TraceCheckUtils]: 26: Hoare triple {5220#true} assume !(~i~1 < 10); {5220#true} is VALID [2018-11-23 12:16:51,846 INFO L256 TraceCheckUtils]: 27: Hoare triple {5220#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {5220#true} is VALID [2018-11-23 12:16:51,847 INFO L273 TraceCheckUtils]: 28: Hoare triple {5220#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {5222#(= sep_~i~0 0)} is VALID [2018-11-23 12:16:51,847 INFO L273 TraceCheckUtils]: 29: Hoare triple {5222#(= sep_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5222#(= sep_~i~0 0)} is VALID [2018-11-23 12:16:51,847 INFO L273 TraceCheckUtils]: 30: Hoare triple {5222#(= 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; {5222#(= sep_~i~0 0)} is VALID [2018-11-23 12:16:51,848 INFO L273 TraceCheckUtils]: 31: Hoare triple {5222#(= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5223#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:51,848 INFO L273 TraceCheckUtils]: 32: Hoare triple {5223#(<= sep_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5223#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:51,849 INFO L273 TraceCheckUtils]: 33: Hoare triple {5223#(<= 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; {5223#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:51,849 INFO L273 TraceCheckUtils]: 34: Hoare triple {5223#(<= sep_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5224#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:51,849 INFO L273 TraceCheckUtils]: 35: Hoare triple {5224#(<= sep_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5224#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:51,850 INFO L273 TraceCheckUtils]: 36: Hoare triple {5224#(<= 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; {5224#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:51,850 INFO L273 TraceCheckUtils]: 37: Hoare triple {5224#(<= sep_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5225#(<= sep_~i~0 3)} is VALID [2018-11-23 12:16:51,850 INFO L273 TraceCheckUtils]: 38: Hoare triple {5225#(<= sep_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5225#(<= sep_~i~0 3)} is VALID [2018-11-23 12:16:51,851 INFO L273 TraceCheckUtils]: 39: Hoare triple {5225#(<= 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; {5225#(<= sep_~i~0 3)} is VALID [2018-11-23 12:16:51,852 INFO L273 TraceCheckUtils]: 40: Hoare triple {5225#(<= sep_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5226#(<= sep_~i~0 4)} is VALID [2018-11-23 12:16:51,852 INFO L273 TraceCheckUtils]: 41: Hoare triple {5226#(<= sep_~i~0 4)} assume !(~i~0 < 10); {5221#false} is VALID [2018-11-23 12:16:51,853 INFO L273 TraceCheckUtils]: 42: Hoare triple {5221#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5221#false} is VALID [2018-11-23 12:16:51,853 INFO L273 TraceCheckUtils]: 43: Hoare triple {5221#false} assume true; {5221#false} is VALID [2018-11-23 12:16:51,853 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {5221#false} {5220#true} #75#return; {5221#false} is VALID [2018-11-23 12:16:51,853 INFO L273 TraceCheckUtils]: 45: Hoare triple {5221#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); {5221#false} is VALID [2018-11-23 12:16:51,853 INFO L256 TraceCheckUtils]: 46: Hoare triple {5221#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {5220#true} is VALID [2018-11-23 12:16:51,854 INFO L273 TraceCheckUtils]: 47: Hoare triple {5220#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {5220#true} is VALID [2018-11-23 12:16:51,854 INFO L273 TraceCheckUtils]: 48: Hoare triple {5220#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5220#true} is VALID [2018-11-23 12:16:51,854 INFO L273 TraceCheckUtils]: 49: Hoare triple {5220#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5220#true} is VALID [2018-11-23 12:16:51,854 INFO L273 TraceCheckUtils]: 50: Hoare triple {5220#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5220#true} is VALID [2018-11-23 12:16:51,854 INFO L273 TraceCheckUtils]: 51: Hoare triple {5220#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5220#true} is VALID [2018-11-23 12:16:51,855 INFO L273 TraceCheckUtils]: 52: Hoare triple {5220#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5220#true} is VALID [2018-11-23 12:16:51,855 INFO L273 TraceCheckUtils]: 53: Hoare triple {5220#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5220#true} is VALID [2018-11-23 12:16:51,855 INFO L273 TraceCheckUtils]: 54: Hoare triple {5220#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5220#true} is VALID [2018-11-23 12:16:51,855 INFO L273 TraceCheckUtils]: 55: Hoare triple {5220#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5220#true} is VALID [2018-11-23 12:16:51,855 INFO L273 TraceCheckUtils]: 56: Hoare triple {5220#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5220#true} is VALID [2018-11-23 12:16:51,855 INFO L273 TraceCheckUtils]: 57: Hoare triple {5220#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5220#true} is VALID [2018-11-23 12:16:51,856 INFO L273 TraceCheckUtils]: 58: Hoare triple {5220#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5220#true} is VALID [2018-11-23 12:16:51,856 INFO L273 TraceCheckUtils]: 59: Hoare triple {5220#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5220#true} is VALID [2018-11-23 12:16:51,856 INFO L273 TraceCheckUtils]: 60: Hoare triple {5220#true} assume !(~i~0 < 10); {5220#true} is VALID [2018-11-23 12:16:51,856 INFO L273 TraceCheckUtils]: 61: Hoare triple {5220#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5220#true} is VALID [2018-11-23 12:16:51,856 INFO L273 TraceCheckUtils]: 62: Hoare triple {5220#true} assume true; {5220#true} is VALID [2018-11-23 12:16:51,856 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5220#true} {5221#false} #77#return; {5221#false} is VALID [2018-11-23 12:16:51,856 INFO L273 TraceCheckUtils]: 64: Hoare triple {5221#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; {5221#false} is VALID [2018-11-23 12:16:51,856 INFO L273 TraceCheckUtils]: 65: Hoare triple {5221#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {5221#false} is VALID [2018-11-23 12:16:51,857 INFO L273 TraceCheckUtils]: 66: Hoare triple {5221#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {5221#false} is VALID [2018-11-23 12:16:51,857 INFO L273 TraceCheckUtils]: 67: Hoare triple {5221#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {5221#false} is VALID [2018-11-23 12:16:51,857 INFO L273 TraceCheckUtils]: 68: Hoare triple {5221#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {5221#false} is VALID [2018-11-23 12:16:51,857 INFO L273 TraceCheckUtils]: 69: Hoare triple {5221#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {5221#false} is VALID [2018-11-23 12:16:51,857 INFO L273 TraceCheckUtils]: 70: Hoare triple {5221#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {5221#false} is VALID [2018-11-23 12:16:51,857 INFO L273 TraceCheckUtils]: 71: Hoare triple {5221#false} assume !(~i~2 < 9); {5221#false} is VALID [2018-11-23 12:16:51,857 INFO L273 TraceCheckUtils]: 72: Hoare triple {5221#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {5221#false} is VALID [2018-11-23 12:16:51,857 INFO L256 TraceCheckUtils]: 73: Hoare triple {5221#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {5220#true} is VALID [2018-11-23 12:16:51,858 INFO L273 TraceCheckUtils]: 74: Hoare triple {5220#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {5220#true} is VALID [2018-11-23 12:16:51,858 INFO L273 TraceCheckUtils]: 75: Hoare triple {5220#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5220#true} is VALID [2018-11-23 12:16:51,858 INFO L273 TraceCheckUtils]: 76: Hoare triple {5220#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5220#true} is VALID [2018-11-23 12:16:51,858 INFO L273 TraceCheckUtils]: 77: Hoare triple {5220#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5220#true} is VALID [2018-11-23 12:16:51,858 INFO L273 TraceCheckUtils]: 78: Hoare triple {5220#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5220#true} is VALID [2018-11-23 12:16:51,858 INFO L273 TraceCheckUtils]: 79: Hoare triple {5220#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5220#true} is VALID [2018-11-23 12:16:51,858 INFO L273 TraceCheckUtils]: 80: Hoare triple {5220#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5220#true} is VALID [2018-11-23 12:16:51,858 INFO L273 TraceCheckUtils]: 81: Hoare triple {5220#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5220#true} is VALID [2018-11-23 12:16:51,858 INFO L273 TraceCheckUtils]: 82: Hoare triple {5220#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5220#true} is VALID [2018-11-23 12:16:51,859 INFO L273 TraceCheckUtils]: 83: Hoare triple {5220#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5220#true} is VALID [2018-11-23 12:16:51,859 INFO L273 TraceCheckUtils]: 84: Hoare triple {5220#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5220#true} is VALID [2018-11-23 12:16:51,859 INFO L273 TraceCheckUtils]: 85: Hoare triple {5220#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5220#true} is VALID [2018-11-23 12:16:51,859 INFO L273 TraceCheckUtils]: 86: Hoare triple {5220#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5220#true} is VALID [2018-11-23 12:16:51,859 INFO L273 TraceCheckUtils]: 87: Hoare triple {5220#true} assume !(~i~0 < 10); {5220#true} is VALID [2018-11-23 12:16:51,859 INFO L273 TraceCheckUtils]: 88: Hoare triple {5220#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5220#true} is VALID [2018-11-23 12:16:51,859 INFO L273 TraceCheckUtils]: 89: Hoare triple {5220#true} assume true; {5220#true} is VALID [2018-11-23 12:16:51,859 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {5220#true} {5221#false} #79#return; {5221#false} is VALID [2018-11-23 12:16:51,860 INFO L273 TraceCheckUtils]: 91: Hoare triple {5221#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {5221#false} is VALID [2018-11-23 12:16:51,860 INFO L273 TraceCheckUtils]: 92: Hoare triple {5221#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {5221#false} is VALID [2018-11-23 12:16:51,860 INFO L273 TraceCheckUtils]: 93: Hoare triple {5221#false} assume !false; {5221#false} is VALID [2018-11-23 12:16:51,863 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-11-23 12:16:51,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:51,864 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:16:51,874 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:16:51,921 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:16:51,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:51,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:52,143 INFO L256 TraceCheckUtils]: 0: Hoare triple {5220#true} call ULTIMATE.init(); {5220#true} is VALID [2018-11-23 12:16:52,143 INFO L273 TraceCheckUtils]: 1: Hoare triple {5220#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5220#true} is VALID [2018-11-23 12:16:52,143 INFO L273 TraceCheckUtils]: 2: Hoare triple {5220#true} assume true; {5220#true} is VALID [2018-11-23 12:16:52,143 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5220#true} {5220#true} #71#return; {5220#true} is VALID [2018-11-23 12:16:52,144 INFO L256 TraceCheckUtils]: 4: Hoare triple {5220#true} call #t~ret14 := main(); {5220#true} is VALID [2018-11-23 12:16:52,144 INFO L273 TraceCheckUtils]: 5: Hoare triple {5220#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5220#true} is VALID [2018-11-23 12:16:52,144 INFO L273 TraceCheckUtils]: 6: Hoare triple {5220#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5220#true} is VALID [2018-11-23 12:16:52,144 INFO L273 TraceCheckUtils]: 7: Hoare triple {5220#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5220#true} is VALID [2018-11-23 12:16:52,145 INFO L273 TraceCheckUtils]: 8: Hoare triple {5220#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5220#true} is VALID [2018-11-23 12:16:52,145 INFO L273 TraceCheckUtils]: 9: Hoare triple {5220#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5220#true} is VALID [2018-11-23 12:16:52,145 INFO L273 TraceCheckUtils]: 10: Hoare triple {5220#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5220#true} is VALID [2018-11-23 12:16:52,145 INFO L273 TraceCheckUtils]: 11: Hoare triple {5220#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5220#true} is VALID [2018-11-23 12:16:52,145 INFO L273 TraceCheckUtils]: 12: Hoare triple {5220#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5220#true} is VALID [2018-11-23 12:16:52,145 INFO L273 TraceCheckUtils]: 13: Hoare triple {5220#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5220#true} is VALID [2018-11-23 12:16:52,145 INFO L273 TraceCheckUtils]: 14: Hoare triple {5220#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5220#true} is VALID [2018-11-23 12:16:52,145 INFO L273 TraceCheckUtils]: 15: Hoare triple {5220#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5220#true} is VALID [2018-11-23 12:16:52,146 INFO L273 TraceCheckUtils]: 16: Hoare triple {5220#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5220#true} is VALID [2018-11-23 12:16:52,146 INFO L273 TraceCheckUtils]: 17: Hoare triple {5220#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5220#true} is VALID [2018-11-23 12:16:52,146 INFO L273 TraceCheckUtils]: 18: Hoare triple {5220#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5220#true} is VALID [2018-11-23 12:16:52,146 INFO L273 TraceCheckUtils]: 19: Hoare triple {5220#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5220#true} is VALID [2018-11-23 12:16:52,146 INFO L273 TraceCheckUtils]: 20: Hoare triple {5220#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5220#true} is VALID [2018-11-23 12:16:52,146 INFO L273 TraceCheckUtils]: 21: Hoare triple {5220#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5220#true} is VALID [2018-11-23 12:16:52,146 INFO L273 TraceCheckUtils]: 22: Hoare triple {5220#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5220#true} is VALID [2018-11-23 12:16:52,146 INFO L273 TraceCheckUtils]: 23: Hoare triple {5220#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5220#true} is VALID [2018-11-23 12:16:52,147 INFO L273 TraceCheckUtils]: 24: Hoare triple {5220#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5220#true} is VALID [2018-11-23 12:16:52,147 INFO L273 TraceCheckUtils]: 25: Hoare triple {5220#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5220#true} is VALID [2018-11-23 12:16:52,147 INFO L273 TraceCheckUtils]: 26: Hoare triple {5220#true} assume !(~i~1 < 10); {5220#true} is VALID [2018-11-23 12:16:52,147 INFO L256 TraceCheckUtils]: 27: Hoare triple {5220#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {5220#true} is VALID [2018-11-23 12:16:52,147 INFO L273 TraceCheckUtils]: 28: Hoare triple {5220#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {5314#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:52,148 INFO L273 TraceCheckUtils]: 29: Hoare triple {5314#(<= sep_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5314#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:52,148 INFO L273 TraceCheckUtils]: 30: Hoare triple {5314#(<= 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; {5314#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:52,149 INFO L273 TraceCheckUtils]: 31: Hoare triple {5314#(<= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5223#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:52,149 INFO L273 TraceCheckUtils]: 32: Hoare triple {5223#(<= sep_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5223#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:52,149 INFO L273 TraceCheckUtils]: 33: Hoare triple {5223#(<= 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; {5223#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:52,150 INFO L273 TraceCheckUtils]: 34: Hoare triple {5223#(<= sep_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5224#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:52,150 INFO L273 TraceCheckUtils]: 35: Hoare triple {5224#(<= sep_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5224#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:52,151 INFO L273 TraceCheckUtils]: 36: Hoare triple {5224#(<= 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; {5224#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:52,152 INFO L273 TraceCheckUtils]: 37: Hoare triple {5224#(<= sep_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5225#(<= sep_~i~0 3)} is VALID [2018-11-23 12:16:52,152 INFO L273 TraceCheckUtils]: 38: Hoare triple {5225#(<= sep_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5225#(<= sep_~i~0 3)} is VALID [2018-11-23 12:16:52,153 INFO L273 TraceCheckUtils]: 39: Hoare triple {5225#(<= 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; {5225#(<= sep_~i~0 3)} is VALID [2018-11-23 12:16:52,154 INFO L273 TraceCheckUtils]: 40: Hoare triple {5225#(<= sep_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5226#(<= sep_~i~0 4)} is VALID [2018-11-23 12:16:52,154 INFO L273 TraceCheckUtils]: 41: Hoare triple {5226#(<= sep_~i~0 4)} assume !(~i~0 < 10); {5221#false} is VALID [2018-11-23 12:16:52,154 INFO L273 TraceCheckUtils]: 42: Hoare triple {5221#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5221#false} is VALID [2018-11-23 12:16:52,155 INFO L273 TraceCheckUtils]: 43: Hoare triple {5221#false} assume true; {5221#false} is VALID [2018-11-23 12:16:52,155 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {5221#false} {5220#true} #75#return; {5221#false} is VALID [2018-11-23 12:16:52,155 INFO L273 TraceCheckUtils]: 45: Hoare triple {5221#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); {5221#false} is VALID [2018-11-23 12:16:52,155 INFO L256 TraceCheckUtils]: 46: Hoare triple {5221#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {5221#false} is VALID [2018-11-23 12:16:52,156 INFO L273 TraceCheckUtils]: 47: Hoare triple {5221#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {5221#false} is VALID [2018-11-23 12:16:52,156 INFO L273 TraceCheckUtils]: 48: Hoare triple {5221#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5221#false} is VALID [2018-11-23 12:16:52,156 INFO L273 TraceCheckUtils]: 49: Hoare triple {5221#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5221#false} is VALID [2018-11-23 12:16:52,156 INFO L273 TraceCheckUtils]: 50: Hoare triple {5221#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5221#false} is VALID [2018-11-23 12:16:52,156 INFO L273 TraceCheckUtils]: 51: Hoare triple {5221#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5221#false} is VALID [2018-11-23 12:16:52,157 INFO L273 TraceCheckUtils]: 52: Hoare triple {5221#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5221#false} is VALID [2018-11-23 12:16:52,157 INFO L273 TraceCheckUtils]: 53: Hoare triple {5221#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5221#false} is VALID [2018-11-23 12:16:52,157 INFO L273 TraceCheckUtils]: 54: Hoare triple {5221#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5221#false} is VALID [2018-11-23 12:16:52,157 INFO L273 TraceCheckUtils]: 55: Hoare triple {5221#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5221#false} is VALID [2018-11-23 12:16:52,157 INFO L273 TraceCheckUtils]: 56: Hoare triple {5221#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5221#false} is VALID [2018-11-23 12:16:52,158 INFO L273 TraceCheckUtils]: 57: Hoare triple {5221#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5221#false} is VALID [2018-11-23 12:16:52,158 INFO L273 TraceCheckUtils]: 58: Hoare triple {5221#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5221#false} is VALID [2018-11-23 12:16:52,158 INFO L273 TraceCheckUtils]: 59: Hoare triple {5221#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5221#false} is VALID [2018-11-23 12:16:52,158 INFO L273 TraceCheckUtils]: 60: Hoare triple {5221#false} assume !(~i~0 < 10); {5221#false} is VALID [2018-11-23 12:16:52,158 INFO L273 TraceCheckUtils]: 61: Hoare triple {5221#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5221#false} is VALID [2018-11-23 12:16:52,159 INFO L273 TraceCheckUtils]: 62: Hoare triple {5221#false} assume true; {5221#false} is VALID [2018-11-23 12:16:52,159 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5221#false} {5221#false} #77#return; {5221#false} is VALID [2018-11-23 12:16:52,159 INFO L273 TraceCheckUtils]: 64: Hoare triple {5221#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; {5221#false} is VALID [2018-11-23 12:16:52,159 INFO L273 TraceCheckUtils]: 65: Hoare triple {5221#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {5221#false} is VALID [2018-11-23 12:16:52,159 INFO L273 TraceCheckUtils]: 66: Hoare triple {5221#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {5221#false} is VALID [2018-11-23 12:16:52,159 INFO L273 TraceCheckUtils]: 67: Hoare triple {5221#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {5221#false} is VALID [2018-11-23 12:16:52,159 INFO L273 TraceCheckUtils]: 68: Hoare triple {5221#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {5221#false} is VALID [2018-11-23 12:16:52,160 INFO L273 TraceCheckUtils]: 69: Hoare triple {5221#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {5221#false} is VALID [2018-11-23 12:16:52,160 INFO L273 TraceCheckUtils]: 70: Hoare triple {5221#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {5221#false} is VALID [2018-11-23 12:16:52,160 INFO L273 TraceCheckUtils]: 71: Hoare triple {5221#false} assume !(~i~2 < 9); {5221#false} is VALID [2018-11-23 12:16:52,160 INFO L273 TraceCheckUtils]: 72: Hoare triple {5221#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {5221#false} is VALID [2018-11-23 12:16:52,160 INFO L256 TraceCheckUtils]: 73: Hoare triple {5221#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {5221#false} is VALID [2018-11-23 12:16:52,160 INFO L273 TraceCheckUtils]: 74: Hoare triple {5221#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {5221#false} is VALID [2018-11-23 12:16:52,160 INFO L273 TraceCheckUtils]: 75: Hoare triple {5221#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5221#false} is VALID [2018-11-23 12:16:52,160 INFO L273 TraceCheckUtils]: 76: Hoare triple {5221#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5221#false} is VALID [2018-11-23 12:16:52,160 INFO L273 TraceCheckUtils]: 77: Hoare triple {5221#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5221#false} is VALID [2018-11-23 12:16:52,161 INFO L273 TraceCheckUtils]: 78: Hoare triple {5221#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5221#false} is VALID [2018-11-23 12:16:52,161 INFO L273 TraceCheckUtils]: 79: Hoare triple {5221#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5221#false} is VALID [2018-11-23 12:16:52,161 INFO L273 TraceCheckUtils]: 80: Hoare triple {5221#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5221#false} is VALID [2018-11-23 12:16:52,161 INFO L273 TraceCheckUtils]: 81: Hoare triple {5221#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5221#false} is VALID [2018-11-23 12:16:52,161 INFO L273 TraceCheckUtils]: 82: Hoare triple {5221#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5221#false} is VALID [2018-11-23 12:16:52,161 INFO L273 TraceCheckUtils]: 83: Hoare triple {5221#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5221#false} is VALID [2018-11-23 12:16:52,161 INFO L273 TraceCheckUtils]: 84: Hoare triple {5221#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5221#false} is VALID [2018-11-23 12:16:52,161 INFO L273 TraceCheckUtils]: 85: Hoare triple {5221#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5221#false} is VALID [2018-11-23 12:16:52,162 INFO L273 TraceCheckUtils]: 86: Hoare triple {5221#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5221#false} is VALID [2018-11-23 12:16:52,162 INFO L273 TraceCheckUtils]: 87: Hoare triple {5221#false} assume !(~i~0 < 10); {5221#false} is VALID [2018-11-23 12:16:52,162 INFO L273 TraceCheckUtils]: 88: Hoare triple {5221#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5221#false} is VALID [2018-11-23 12:16:52,162 INFO L273 TraceCheckUtils]: 89: Hoare triple {5221#false} assume true; {5221#false} is VALID [2018-11-23 12:16:52,162 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {5221#false} {5221#false} #79#return; {5221#false} is VALID [2018-11-23 12:16:52,162 INFO L273 TraceCheckUtils]: 91: Hoare triple {5221#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {5221#false} is VALID [2018-11-23 12:16:52,163 INFO L273 TraceCheckUtils]: 92: Hoare triple {5221#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {5221#false} is VALID [2018-11-23 12:16:52,163 INFO L273 TraceCheckUtils]: 93: Hoare triple {5221#false} assume !false; {5221#false} is VALID [2018-11-23 12:16:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 116 proven. 22 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-23 12:16:52,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:52,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:16:52,192 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-11-23 12:16:52,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:52,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:16:52,279 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:52,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:16:52,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:16:52,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:16:52,280 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand 8 states. [2018-11-23 12:16:52,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:52,473 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2018-11-23 12:16:52,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:16:52,473 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-11-23 12:16:52,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:52,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:16:52,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2018-11-23 12:16:52,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:16:52,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2018-11-23 12:16:52,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 77 transitions. [2018-11-23 12:16:53,119 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:16:53,120 INFO L225 Difference]: With dead ends: 99 [2018-11-23 12:16:53,120 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 12:16:53,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:16:53,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 12:16:53,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-11-23 12:16:53,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:53,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 64 states. [2018-11-23 12:16:53,202 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 64 states. [2018-11-23 12:16:53,202 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 64 states. [2018-11-23 12:16:53,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:53,205 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2018-11-23 12:16:53,205 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2018-11-23 12:16:53,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:53,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:53,206 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 66 states. [2018-11-23 12:16:53,206 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 66 states. [2018-11-23 12:16:53,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:53,207 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2018-11-23 12:16:53,208 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2018-11-23 12:16:53,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:53,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:53,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:53,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:53,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 12:16:53,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2018-11-23 12:16:53,210 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 94 [2018-11-23 12:16:53,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:53,211 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2018-11-23 12:16:53,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:16:53,211 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-11-23 12:16:53,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 12:16:53,212 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:53,212 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 10, 10, 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:16:53,212 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:53,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:53,213 INFO L82 PathProgramCache]: Analyzing trace with hash -2058184687, now seen corresponding path program 11 times [2018-11-23 12:16:53,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:53,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:53,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:53,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:53,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:54,352 INFO L256 TraceCheckUtils]: 0: Hoare triple {5874#true} call ULTIMATE.init(); {5874#true} is VALID [2018-11-23 12:16:54,353 INFO L273 TraceCheckUtils]: 1: Hoare triple {5874#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5874#true} is VALID [2018-11-23 12:16:54,353 INFO L273 TraceCheckUtils]: 2: Hoare triple {5874#true} assume true; {5874#true} is VALID [2018-11-23 12:16:54,353 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5874#true} {5874#true} #71#return; {5874#true} is VALID [2018-11-23 12:16:54,353 INFO L256 TraceCheckUtils]: 4: Hoare triple {5874#true} call #t~ret14 := main(); {5874#true} is VALID [2018-11-23 12:16:54,353 INFO L273 TraceCheckUtils]: 5: Hoare triple {5874#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5874#true} is VALID [2018-11-23 12:16:54,353 INFO L273 TraceCheckUtils]: 6: Hoare triple {5874#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5874#true} is VALID [2018-11-23 12:16:54,353 INFO L273 TraceCheckUtils]: 7: Hoare triple {5874#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5874#true} is VALID [2018-11-23 12:16:54,353 INFO L273 TraceCheckUtils]: 8: Hoare triple {5874#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5874#true} is VALID [2018-11-23 12:16:54,354 INFO L273 TraceCheckUtils]: 9: Hoare triple {5874#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5874#true} is VALID [2018-11-23 12:16:54,354 INFO L273 TraceCheckUtils]: 10: Hoare triple {5874#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5874#true} is VALID [2018-11-23 12:16:54,354 INFO L273 TraceCheckUtils]: 11: Hoare triple {5874#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5874#true} is VALID [2018-11-23 12:16:54,354 INFO L273 TraceCheckUtils]: 12: Hoare triple {5874#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5874#true} is VALID [2018-11-23 12:16:54,354 INFO L273 TraceCheckUtils]: 13: Hoare triple {5874#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5874#true} is VALID [2018-11-23 12:16:54,354 INFO L273 TraceCheckUtils]: 14: Hoare triple {5874#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5874#true} is VALID [2018-11-23 12:16:54,354 INFO L273 TraceCheckUtils]: 15: Hoare triple {5874#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5874#true} is VALID [2018-11-23 12:16:54,354 INFO L273 TraceCheckUtils]: 16: Hoare triple {5874#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5874#true} is VALID [2018-11-23 12:16:54,354 INFO L273 TraceCheckUtils]: 17: Hoare triple {5874#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5874#true} is VALID [2018-11-23 12:16:54,355 INFO L273 TraceCheckUtils]: 18: Hoare triple {5874#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5874#true} is VALID [2018-11-23 12:16:54,355 INFO L273 TraceCheckUtils]: 19: Hoare triple {5874#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5874#true} is VALID [2018-11-23 12:16:54,355 INFO L273 TraceCheckUtils]: 20: Hoare triple {5874#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5874#true} is VALID [2018-11-23 12:16:54,355 INFO L273 TraceCheckUtils]: 21: Hoare triple {5874#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5874#true} is VALID [2018-11-23 12:16:54,355 INFO L273 TraceCheckUtils]: 22: Hoare triple {5874#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5874#true} is VALID [2018-11-23 12:16:54,355 INFO L273 TraceCheckUtils]: 23: Hoare triple {5874#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5874#true} is VALID [2018-11-23 12:16:54,355 INFO L273 TraceCheckUtils]: 24: Hoare triple {5874#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5874#true} is VALID [2018-11-23 12:16:54,356 INFO L273 TraceCheckUtils]: 25: Hoare triple {5874#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5874#true} is VALID [2018-11-23 12:16:54,356 INFO L273 TraceCheckUtils]: 26: Hoare triple {5874#true} assume !(~i~1 < 10); {5874#true} is VALID [2018-11-23 12:16:54,356 INFO L256 TraceCheckUtils]: 27: Hoare triple {5874#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {5874#true} is VALID [2018-11-23 12:16:54,356 INFO L273 TraceCheckUtils]: 28: Hoare triple {5874#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {5876#(= sep_~i~0 0)} is VALID [2018-11-23 12:16:54,357 INFO L273 TraceCheckUtils]: 29: Hoare triple {5876#(= sep_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5876#(= sep_~i~0 0)} is VALID [2018-11-23 12:16:54,357 INFO L273 TraceCheckUtils]: 30: Hoare triple {5876#(= 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; {5876#(= sep_~i~0 0)} is VALID [2018-11-23 12:16:54,357 INFO L273 TraceCheckUtils]: 31: Hoare triple {5876#(= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5877#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:54,358 INFO L273 TraceCheckUtils]: 32: Hoare triple {5877#(<= sep_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5877#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:54,358 INFO L273 TraceCheckUtils]: 33: Hoare triple {5877#(<= 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; {5877#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:54,358 INFO L273 TraceCheckUtils]: 34: Hoare triple {5877#(<= sep_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5878#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:54,359 INFO L273 TraceCheckUtils]: 35: Hoare triple {5878#(<= sep_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5878#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:54,359 INFO L273 TraceCheckUtils]: 36: Hoare triple {5878#(<= 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; {5878#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:54,360 INFO L273 TraceCheckUtils]: 37: Hoare triple {5878#(<= sep_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5879#(<= sep_~i~0 3)} is VALID [2018-11-23 12:16:54,360 INFO L273 TraceCheckUtils]: 38: Hoare triple {5879#(<= sep_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5879#(<= sep_~i~0 3)} is VALID [2018-11-23 12:16:54,360 INFO L273 TraceCheckUtils]: 39: Hoare triple {5879#(<= 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; {5879#(<= sep_~i~0 3)} is VALID [2018-11-23 12:16:54,361 INFO L273 TraceCheckUtils]: 40: Hoare triple {5879#(<= sep_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5880#(<= sep_~i~0 4)} is VALID [2018-11-23 12:16:54,362 INFO L273 TraceCheckUtils]: 41: Hoare triple {5880#(<= sep_~i~0 4)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5880#(<= sep_~i~0 4)} is VALID [2018-11-23 12:16:54,362 INFO L273 TraceCheckUtils]: 42: Hoare triple {5880#(<= 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; {5880#(<= sep_~i~0 4)} is VALID [2018-11-23 12:16:54,363 INFO L273 TraceCheckUtils]: 43: Hoare triple {5880#(<= sep_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5881#(<= sep_~i~0 5)} is VALID [2018-11-23 12:16:54,363 INFO L273 TraceCheckUtils]: 44: Hoare triple {5881#(<= sep_~i~0 5)} assume !(~i~0 < 10); {5875#false} is VALID [2018-11-23 12:16:54,364 INFO L273 TraceCheckUtils]: 45: Hoare triple {5875#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5875#false} is VALID [2018-11-23 12:16:54,364 INFO L273 TraceCheckUtils]: 46: Hoare triple {5875#false} assume true; {5875#false} is VALID [2018-11-23 12:16:54,364 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {5875#false} {5874#true} #75#return; {5875#false} is VALID [2018-11-23 12:16:54,364 INFO L273 TraceCheckUtils]: 48: Hoare triple {5875#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); {5875#false} is VALID [2018-11-23 12:16:54,364 INFO L256 TraceCheckUtils]: 49: Hoare triple {5875#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {5874#true} is VALID [2018-11-23 12:16:54,365 INFO L273 TraceCheckUtils]: 50: Hoare triple {5874#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {5874#true} is VALID [2018-11-23 12:16:54,365 INFO L273 TraceCheckUtils]: 51: Hoare triple {5874#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5874#true} is VALID [2018-11-23 12:16:54,365 INFO L273 TraceCheckUtils]: 52: Hoare triple {5874#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5874#true} is VALID [2018-11-23 12:16:54,365 INFO L273 TraceCheckUtils]: 53: Hoare triple {5874#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#true} is VALID [2018-11-23 12:16:54,365 INFO L273 TraceCheckUtils]: 54: Hoare triple {5874#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5874#true} is VALID [2018-11-23 12:16:54,365 INFO L273 TraceCheckUtils]: 55: Hoare triple {5874#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5874#true} is VALID [2018-11-23 12:16:54,366 INFO L273 TraceCheckUtils]: 56: Hoare triple {5874#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#true} is VALID [2018-11-23 12:16:54,366 INFO L273 TraceCheckUtils]: 57: Hoare triple {5874#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5874#true} is VALID [2018-11-23 12:16:54,366 INFO L273 TraceCheckUtils]: 58: Hoare triple {5874#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5874#true} is VALID [2018-11-23 12:16:54,366 INFO L273 TraceCheckUtils]: 59: Hoare triple {5874#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#true} is VALID [2018-11-23 12:16:54,366 INFO L273 TraceCheckUtils]: 60: Hoare triple {5874#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5874#true} is VALID [2018-11-23 12:16:54,367 INFO L273 TraceCheckUtils]: 61: Hoare triple {5874#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5874#true} is VALID [2018-11-23 12:16:54,367 INFO L273 TraceCheckUtils]: 62: Hoare triple {5874#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#true} is VALID [2018-11-23 12:16:54,367 INFO L273 TraceCheckUtils]: 63: Hoare triple {5874#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5874#true} is VALID [2018-11-23 12:16:54,367 INFO L273 TraceCheckUtils]: 64: Hoare triple {5874#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5874#true} is VALID [2018-11-23 12:16:54,367 INFO L273 TraceCheckUtils]: 65: Hoare triple {5874#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#true} is VALID [2018-11-23 12:16:54,367 INFO L273 TraceCheckUtils]: 66: Hoare triple {5874#true} assume !(~i~0 < 10); {5874#true} is VALID [2018-11-23 12:16:54,367 INFO L273 TraceCheckUtils]: 67: Hoare triple {5874#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5874#true} is VALID [2018-11-23 12:16:54,368 INFO L273 TraceCheckUtils]: 68: Hoare triple {5874#true} assume true; {5874#true} is VALID [2018-11-23 12:16:54,368 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {5874#true} {5875#false} #77#return; {5875#false} is VALID [2018-11-23 12:16:54,368 INFO L273 TraceCheckUtils]: 70: Hoare triple {5875#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; {5875#false} is VALID [2018-11-23 12:16:54,368 INFO L273 TraceCheckUtils]: 71: Hoare triple {5875#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {5875#false} is VALID [2018-11-23 12:16:54,368 INFO L273 TraceCheckUtils]: 72: Hoare triple {5875#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {5875#false} is VALID [2018-11-23 12:16:54,368 INFO L273 TraceCheckUtils]: 73: Hoare triple {5875#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {5875#false} is VALID [2018-11-23 12:16:54,368 INFO L273 TraceCheckUtils]: 74: Hoare triple {5875#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {5875#false} is VALID [2018-11-23 12:16:54,368 INFO L273 TraceCheckUtils]: 75: Hoare triple {5875#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {5875#false} is VALID [2018-11-23 12:16:54,369 INFO L273 TraceCheckUtils]: 76: Hoare triple {5875#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {5875#false} is VALID [2018-11-23 12:16:54,369 INFO L273 TraceCheckUtils]: 77: Hoare triple {5875#false} assume !(~i~2 < 9); {5875#false} is VALID [2018-11-23 12:16:54,369 INFO L273 TraceCheckUtils]: 78: Hoare triple {5875#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {5875#false} is VALID [2018-11-23 12:16:54,369 INFO L256 TraceCheckUtils]: 79: Hoare triple {5875#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {5874#true} is VALID [2018-11-23 12:16:54,369 INFO L273 TraceCheckUtils]: 80: Hoare triple {5874#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {5874#true} is VALID [2018-11-23 12:16:54,369 INFO L273 TraceCheckUtils]: 81: Hoare triple {5874#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5874#true} is VALID [2018-11-23 12:16:54,369 INFO L273 TraceCheckUtils]: 82: Hoare triple {5874#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5874#true} is VALID [2018-11-23 12:16:54,369 INFO L273 TraceCheckUtils]: 83: Hoare triple {5874#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#true} is VALID [2018-11-23 12:16:54,369 INFO L273 TraceCheckUtils]: 84: Hoare triple {5874#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5874#true} is VALID [2018-11-23 12:16:54,370 INFO L273 TraceCheckUtils]: 85: Hoare triple {5874#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5874#true} is VALID [2018-11-23 12:16:54,370 INFO L273 TraceCheckUtils]: 86: Hoare triple {5874#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#true} is VALID [2018-11-23 12:16:54,370 INFO L273 TraceCheckUtils]: 87: Hoare triple {5874#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5874#true} is VALID [2018-11-23 12:16:54,370 INFO L273 TraceCheckUtils]: 88: Hoare triple {5874#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5874#true} is VALID [2018-11-23 12:16:54,370 INFO L273 TraceCheckUtils]: 89: Hoare triple {5874#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#true} is VALID [2018-11-23 12:16:54,370 INFO L273 TraceCheckUtils]: 90: Hoare triple {5874#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5874#true} is VALID [2018-11-23 12:16:54,370 INFO L273 TraceCheckUtils]: 91: Hoare triple {5874#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5874#true} is VALID [2018-11-23 12:16:54,370 INFO L273 TraceCheckUtils]: 92: Hoare triple {5874#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#true} is VALID [2018-11-23 12:16:54,370 INFO L273 TraceCheckUtils]: 93: Hoare triple {5874#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5874#true} is VALID [2018-11-23 12:16:54,371 INFO L273 TraceCheckUtils]: 94: Hoare triple {5874#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5874#true} is VALID [2018-11-23 12:16:54,371 INFO L273 TraceCheckUtils]: 95: Hoare triple {5874#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5874#true} is VALID [2018-11-23 12:16:54,371 INFO L273 TraceCheckUtils]: 96: Hoare triple {5874#true} assume !(~i~0 < 10); {5874#true} is VALID [2018-11-23 12:16:54,371 INFO L273 TraceCheckUtils]: 97: Hoare triple {5874#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5874#true} is VALID [2018-11-23 12:16:54,371 INFO L273 TraceCheckUtils]: 98: Hoare triple {5874#true} assume true; {5874#true} is VALID [2018-11-23 12:16:54,371 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {5874#true} {5875#false} #79#return; {5875#false} is VALID [2018-11-23 12:16:54,371 INFO L273 TraceCheckUtils]: 100: Hoare triple {5875#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {5875#false} is VALID [2018-11-23 12:16:54,371 INFO L273 TraceCheckUtils]: 101: Hoare triple {5875#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {5875#false} is VALID [2018-11-23 12:16:54,372 INFO L273 TraceCheckUtils]: 102: Hoare triple {5875#false} assume !false; {5875#false} is VALID [2018-11-23 12:16:54,376 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 213 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2018-11-23 12:16:54,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:54,376 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:16:54,384 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:16:54,590 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-23 12:16:54,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:54,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:54,721 INFO L256 TraceCheckUtils]: 0: Hoare triple {5874#true} call ULTIMATE.init(); {5874#true} is VALID [2018-11-23 12:16:54,722 INFO L273 TraceCheckUtils]: 1: Hoare triple {5874#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5874#true} is VALID [2018-11-23 12:16:54,722 INFO L273 TraceCheckUtils]: 2: Hoare triple {5874#true} assume true; {5874#true} is VALID [2018-11-23 12:16:54,722 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5874#true} {5874#true} #71#return; {5874#true} is VALID [2018-11-23 12:16:54,723 INFO L256 TraceCheckUtils]: 4: Hoare triple {5874#true} call #t~ret14 := main(); {5874#true} is VALID [2018-11-23 12:16:54,723 INFO L273 TraceCheckUtils]: 5: Hoare triple {5874#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5874#true} is VALID [2018-11-23 12:16:54,723 INFO L273 TraceCheckUtils]: 6: Hoare triple {5874#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5874#true} is VALID [2018-11-23 12:16:54,724 INFO L273 TraceCheckUtils]: 7: Hoare triple {5874#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5874#true} is VALID [2018-11-23 12:16:54,724 INFO L273 TraceCheckUtils]: 8: Hoare triple {5874#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5874#true} is VALID [2018-11-23 12:16:54,724 INFO L273 TraceCheckUtils]: 9: Hoare triple {5874#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5874#true} is VALID [2018-11-23 12:16:54,725 INFO L273 TraceCheckUtils]: 10: Hoare triple {5874#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5874#true} is VALID [2018-11-23 12:16:54,725 INFO L273 TraceCheckUtils]: 11: Hoare triple {5874#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5874#true} is VALID [2018-11-23 12:16:54,725 INFO L273 TraceCheckUtils]: 12: Hoare triple {5874#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5874#true} is VALID [2018-11-23 12:16:54,725 INFO L273 TraceCheckUtils]: 13: Hoare triple {5874#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5874#true} is VALID [2018-11-23 12:16:54,725 INFO L273 TraceCheckUtils]: 14: Hoare triple {5874#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5874#true} is VALID [2018-11-23 12:16:54,725 INFO L273 TraceCheckUtils]: 15: Hoare triple {5874#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5874#true} is VALID [2018-11-23 12:16:54,726 INFO L273 TraceCheckUtils]: 16: Hoare triple {5874#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5874#true} is VALID [2018-11-23 12:16:54,726 INFO L273 TraceCheckUtils]: 17: Hoare triple {5874#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5874#true} is VALID [2018-11-23 12:16:54,726 INFO L273 TraceCheckUtils]: 18: Hoare triple {5874#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5874#true} is VALID [2018-11-23 12:16:54,726 INFO L273 TraceCheckUtils]: 19: Hoare triple {5874#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5874#true} is VALID [2018-11-23 12:16:54,726 INFO L273 TraceCheckUtils]: 20: Hoare triple {5874#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5874#true} is VALID [2018-11-23 12:16:54,726 INFO L273 TraceCheckUtils]: 21: Hoare triple {5874#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5874#true} is VALID [2018-11-23 12:16:54,727 INFO L273 TraceCheckUtils]: 22: Hoare triple {5874#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5874#true} is VALID [2018-11-23 12:16:54,727 INFO L273 TraceCheckUtils]: 23: Hoare triple {5874#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5874#true} is VALID [2018-11-23 12:16:54,727 INFO L273 TraceCheckUtils]: 24: Hoare triple {5874#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {5874#true} is VALID [2018-11-23 12:16:54,727 INFO L273 TraceCheckUtils]: 25: Hoare triple {5874#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5874#true} is VALID [2018-11-23 12:16:54,727 INFO L273 TraceCheckUtils]: 26: Hoare triple {5874#true} assume !(~i~1 < 10); {5874#true} is VALID [2018-11-23 12:16:54,727 INFO L256 TraceCheckUtils]: 27: Hoare triple {5874#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {5874#true} is VALID [2018-11-23 12:16:54,732 INFO L273 TraceCheckUtils]: 28: Hoare triple {5874#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {5969#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:54,733 INFO L273 TraceCheckUtils]: 29: Hoare triple {5969#(<= sep_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5969#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:54,733 INFO L273 TraceCheckUtils]: 30: Hoare triple {5969#(<= 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; {5969#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:54,734 INFO L273 TraceCheckUtils]: 31: Hoare triple {5969#(<= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5877#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:54,734 INFO L273 TraceCheckUtils]: 32: Hoare triple {5877#(<= sep_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5877#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:54,734 INFO L273 TraceCheckUtils]: 33: Hoare triple {5877#(<= 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; {5877#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:54,735 INFO L273 TraceCheckUtils]: 34: Hoare triple {5877#(<= sep_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5878#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:54,735 INFO L273 TraceCheckUtils]: 35: Hoare triple {5878#(<= sep_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5878#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:54,735 INFO L273 TraceCheckUtils]: 36: Hoare triple {5878#(<= 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; {5878#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:54,736 INFO L273 TraceCheckUtils]: 37: Hoare triple {5878#(<= sep_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5879#(<= sep_~i~0 3)} is VALID [2018-11-23 12:16:54,736 INFO L273 TraceCheckUtils]: 38: Hoare triple {5879#(<= sep_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5879#(<= sep_~i~0 3)} is VALID [2018-11-23 12:16:54,737 INFO L273 TraceCheckUtils]: 39: Hoare triple {5879#(<= 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; {5879#(<= sep_~i~0 3)} is VALID [2018-11-23 12:16:54,738 INFO L273 TraceCheckUtils]: 40: Hoare triple {5879#(<= sep_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5880#(<= sep_~i~0 4)} is VALID [2018-11-23 12:16:54,738 INFO L273 TraceCheckUtils]: 41: Hoare triple {5880#(<= sep_~i~0 4)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5880#(<= sep_~i~0 4)} is VALID [2018-11-23 12:16:54,739 INFO L273 TraceCheckUtils]: 42: Hoare triple {5880#(<= 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; {5880#(<= sep_~i~0 4)} is VALID [2018-11-23 12:16:54,740 INFO L273 TraceCheckUtils]: 43: Hoare triple {5880#(<= sep_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5881#(<= sep_~i~0 5)} is VALID [2018-11-23 12:16:54,740 INFO L273 TraceCheckUtils]: 44: Hoare triple {5881#(<= sep_~i~0 5)} assume !(~i~0 < 10); {5875#false} is VALID [2018-11-23 12:16:54,740 INFO L273 TraceCheckUtils]: 45: Hoare triple {5875#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5875#false} is VALID [2018-11-23 12:16:54,741 INFO L273 TraceCheckUtils]: 46: Hoare triple {5875#false} assume true; {5875#false} is VALID [2018-11-23 12:16:54,741 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {5875#false} {5874#true} #75#return; {5875#false} is VALID [2018-11-23 12:16:54,741 INFO L273 TraceCheckUtils]: 48: Hoare triple {5875#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); {5875#false} is VALID [2018-11-23 12:16:54,741 INFO L256 TraceCheckUtils]: 49: Hoare triple {5875#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {5875#false} is VALID [2018-11-23 12:16:54,741 INFO L273 TraceCheckUtils]: 50: Hoare triple {5875#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {5875#false} is VALID [2018-11-23 12:16:54,742 INFO L273 TraceCheckUtils]: 51: Hoare triple {5875#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5875#false} is VALID [2018-11-23 12:16:54,742 INFO L273 TraceCheckUtils]: 52: Hoare triple {5875#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5875#false} is VALID [2018-11-23 12:16:54,742 INFO L273 TraceCheckUtils]: 53: Hoare triple {5875#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5875#false} is VALID [2018-11-23 12:16:54,742 INFO L273 TraceCheckUtils]: 54: Hoare triple {5875#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5875#false} is VALID [2018-11-23 12:16:54,742 INFO L273 TraceCheckUtils]: 55: Hoare triple {5875#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5875#false} is VALID [2018-11-23 12:16:54,743 INFO L273 TraceCheckUtils]: 56: Hoare triple {5875#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5875#false} is VALID [2018-11-23 12:16:54,743 INFO L273 TraceCheckUtils]: 57: Hoare triple {5875#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5875#false} is VALID [2018-11-23 12:16:54,743 INFO L273 TraceCheckUtils]: 58: Hoare triple {5875#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5875#false} is VALID [2018-11-23 12:16:54,743 INFO L273 TraceCheckUtils]: 59: Hoare triple {5875#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5875#false} is VALID [2018-11-23 12:16:54,743 INFO L273 TraceCheckUtils]: 60: Hoare triple {5875#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5875#false} is VALID [2018-11-23 12:16:54,743 INFO L273 TraceCheckUtils]: 61: Hoare triple {5875#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5875#false} is VALID [2018-11-23 12:16:54,743 INFO L273 TraceCheckUtils]: 62: Hoare triple {5875#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5875#false} is VALID [2018-11-23 12:16:54,743 INFO L273 TraceCheckUtils]: 63: Hoare triple {5875#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5875#false} is VALID [2018-11-23 12:16:54,744 INFO L273 TraceCheckUtils]: 64: Hoare triple {5875#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5875#false} is VALID [2018-11-23 12:16:54,744 INFO L273 TraceCheckUtils]: 65: Hoare triple {5875#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5875#false} is VALID [2018-11-23 12:16:54,744 INFO L273 TraceCheckUtils]: 66: Hoare triple {5875#false} assume !(~i~0 < 10); {5875#false} is VALID [2018-11-23 12:16:54,744 INFO L273 TraceCheckUtils]: 67: Hoare triple {5875#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5875#false} is VALID [2018-11-23 12:16:54,744 INFO L273 TraceCheckUtils]: 68: Hoare triple {5875#false} assume true; {5875#false} is VALID [2018-11-23 12:16:54,744 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {5875#false} {5875#false} #77#return; {5875#false} is VALID [2018-11-23 12:16:54,744 INFO L273 TraceCheckUtils]: 70: Hoare triple {5875#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; {5875#false} is VALID [2018-11-23 12:16:54,744 INFO L273 TraceCheckUtils]: 71: Hoare triple {5875#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {5875#false} is VALID [2018-11-23 12:16:54,745 INFO L273 TraceCheckUtils]: 72: Hoare triple {5875#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {5875#false} is VALID [2018-11-23 12:16:54,745 INFO L273 TraceCheckUtils]: 73: Hoare triple {5875#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {5875#false} is VALID [2018-11-23 12:16:54,745 INFO L273 TraceCheckUtils]: 74: Hoare triple {5875#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {5875#false} is VALID [2018-11-23 12:16:54,745 INFO L273 TraceCheckUtils]: 75: Hoare triple {5875#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {5875#false} is VALID [2018-11-23 12:16:54,745 INFO L273 TraceCheckUtils]: 76: Hoare triple {5875#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {5875#false} is VALID [2018-11-23 12:16:54,745 INFO L273 TraceCheckUtils]: 77: Hoare triple {5875#false} assume !(~i~2 < 9); {5875#false} is VALID [2018-11-23 12:16:54,745 INFO L273 TraceCheckUtils]: 78: Hoare triple {5875#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {5875#false} is VALID [2018-11-23 12:16:54,745 INFO L256 TraceCheckUtils]: 79: Hoare triple {5875#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {5875#false} is VALID [2018-11-23 12:16:54,745 INFO L273 TraceCheckUtils]: 80: Hoare triple {5875#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {5875#false} is VALID [2018-11-23 12:16:54,746 INFO L273 TraceCheckUtils]: 81: Hoare triple {5875#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5875#false} is VALID [2018-11-23 12:16:54,746 INFO L273 TraceCheckUtils]: 82: Hoare triple {5875#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5875#false} is VALID [2018-11-23 12:16:54,746 INFO L273 TraceCheckUtils]: 83: Hoare triple {5875#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5875#false} is VALID [2018-11-23 12:16:54,746 INFO L273 TraceCheckUtils]: 84: Hoare triple {5875#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5875#false} is VALID [2018-11-23 12:16:54,746 INFO L273 TraceCheckUtils]: 85: Hoare triple {5875#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5875#false} is VALID [2018-11-23 12:16:54,746 INFO L273 TraceCheckUtils]: 86: Hoare triple {5875#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5875#false} is VALID [2018-11-23 12:16:54,746 INFO L273 TraceCheckUtils]: 87: Hoare triple {5875#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5875#false} is VALID [2018-11-23 12:16:54,746 INFO L273 TraceCheckUtils]: 88: Hoare triple {5875#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5875#false} is VALID [2018-11-23 12:16:54,746 INFO L273 TraceCheckUtils]: 89: Hoare triple {5875#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5875#false} is VALID [2018-11-23 12:16:54,747 INFO L273 TraceCheckUtils]: 90: Hoare triple {5875#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5875#false} is VALID [2018-11-23 12:16:54,747 INFO L273 TraceCheckUtils]: 91: Hoare triple {5875#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5875#false} is VALID [2018-11-23 12:16:54,747 INFO L273 TraceCheckUtils]: 92: Hoare triple {5875#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5875#false} is VALID [2018-11-23 12:16:54,747 INFO L273 TraceCheckUtils]: 93: Hoare triple {5875#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {5875#false} is VALID [2018-11-23 12:16:54,747 INFO L273 TraceCheckUtils]: 94: Hoare triple {5875#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {5875#false} is VALID [2018-11-23 12:16:54,747 INFO L273 TraceCheckUtils]: 95: Hoare triple {5875#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5875#false} is VALID [2018-11-23 12:16:54,747 INFO L273 TraceCheckUtils]: 96: Hoare triple {5875#false} assume !(~i~0 < 10); {5875#false} is VALID [2018-11-23 12:16:54,747 INFO L273 TraceCheckUtils]: 97: Hoare triple {5875#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {5875#false} is VALID [2018-11-23 12:16:54,747 INFO L273 TraceCheckUtils]: 98: Hoare triple {5875#false} assume true; {5875#false} is VALID [2018-11-23 12:16:54,748 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {5875#false} {5875#false} #79#return; {5875#false} is VALID [2018-11-23 12:16:54,748 INFO L273 TraceCheckUtils]: 100: Hoare triple {5875#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {5875#false} is VALID [2018-11-23 12:16:54,748 INFO L273 TraceCheckUtils]: 101: Hoare triple {5875#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {5875#false} is VALID [2018-11-23 12:16:54,748 INFO L273 TraceCheckUtils]: 102: Hoare triple {5875#false} assume !false; {5875#false} is VALID [2018-11-23 12:16:54,752 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 174 proven. 35 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-11-23 12:16:54,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:54,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:16:54,772 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2018-11-23 12:16:54,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:54,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:16:54,848 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:54,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:16:54,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:16:54,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:16:54,850 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 9 states. [2018-11-23 12:16:55,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:55,200 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2018-11-23 12:16:55,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:16:55,200 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2018-11-23 12:16:55,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:55,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:16:55,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2018-11-23 12:16:55,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:16:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2018-11-23 12:16:55,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 81 transitions. [2018-11-23 12:16:55,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:55,285 INFO L225 Difference]: With dead ends: 105 [2018-11-23 12:16:55,285 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 12:16:55,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:16:55,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 12:16:55,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-23 12:16:55,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:55,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 67 states. [2018-11-23 12:16:55,759 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 67 states. [2018-11-23 12:16:55,760 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 67 states. [2018-11-23 12:16:55,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:55,762 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-11-23 12:16:55,762 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-11-23 12:16:55,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:55,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:55,763 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 69 states. [2018-11-23 12:16:55,763 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 69 states. [2018-11-23 12:16:55,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:55,765 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-11-23 12:16:55,765 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-11-23 12:16:55,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:55,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:55,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:55,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:55,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 12:16:55,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2018-11-23 12:16:55,768 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 103 [2018-11-23 12:16:55,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:55,768 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2018-11-23 12:16:55,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:16:55,768 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2018-11-23 12:16:55,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-23 12:16:55,769 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:55,769 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 10, 10, 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:16:55,770 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:55,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:55,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1611383708, now seen corresponding path program 12 times [2018-11-23 12:16:55,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:55,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:55,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:55,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:55,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:56,348 INFO L256 TraceCheckUtils]: 0: Hoare triple {6574#true} call ULTIMATE.init(); {6574#true} is VALID [2018-11-23 12:16:56,349 INFO L273 TraceCheckUtils]: 1: Hoare triple {6574#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6574#true} is VALID [2018-11-23 12:16:56,349 INFO L273 TraceCheckUtils]: 2: Hoare triple {6574#true} assume true; {6574#true} is VALID [2018-11-23 12:16:56,349 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6574#true} {6574#true} #71#return; {6574#true} is VALID [2018-11-23 12:16:56,349 INFO L256 TraceCheckUtils]: 4: Hoare triple {6574#true} call #t~ret14 := main(); {6574#true} is VALID [2018-11-23 12:16:56,349 INFO L273 TraceCheckUtils]: 5: Hoare triple {6574#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {6574#true} is VALID [2018-11-23 12:16:56,349 INFO L273 TraceCheckUtils]: 6: Hoare triple {6574#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6574#true} is VALID [2018-11-23 12:16:56,349 INFO L273 TraceCheckUtils]: 7: Hoare triple {6574#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6574#true} is VALID [2018-11-23 12:16:56,349 INFO L273 TraceCheckUtils]: 8: Hoare triple {6574#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6574#true} is VALID [2018-11-23 12:16:56,349 INFO L273 TraceCheckUtils]: 9: Hoare triple {6574#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6574#true} is VALID [2018-11-23 12:16:56,350 INFO L273 TraceCheckUtils]: 10: Hoare triple {6574#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6574#true} is VALID [2018-11-23 12:16:56,350 INFO L273 TraceCheckUtils]: 11: Hoare triple {6574#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6574#true} is VALID [2018-11-23 12:16:56,350 INFO L273 TraceCheckUtils]: 12: Hoare triple {6574#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6574#true} is VALID [2018-11-23 12:16:56,350 INFO L273 TraceCheckUtils]: 13: Hoare triple {6574#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6574#true} is VALID [2018-11-23 12:16:56,350 INFO L273 TraceCheckUtils]: 14: Hoare triple {6574#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6574#true} is VALID [2018-11-23 12:16:56,350 INFO L273 TraceCheckUtils]: 15: Hoare triple {6574#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6574#true} is VALID [2018-11-23 12:16:56,350 INFO L273 TraceCheckUtils]: 16: Hoare triple {6574#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6574#true} is VALID [2018-11-23 12:16:56,350 INFO L273 TraceCheckUtils]: 17: Hoare triple {6574#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6574#true} is VALID [2018-11-23 12:16:56,351 INFO L273 TraceCheckUtils]: 18: Hoare triple {6574#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6574#true} is VALID [2018-11-23 12:16:56,351 INFO L273 TraceCheckUtils]: 19: Hoare triple {6574#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6574#true} is VALID [2018-11-23 12:16:56,351 INFO L273 TraceCheckUtils]: 20: Hoare triple {6574#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6574#true} is VALID [2018-11-23 12:16:56,351 INFO L273 TraceCheckUtils]: 21: Hoare triple {6574#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6574#true} is VALID [2018-11-23 12:16:56,351 INFO L273 TraceCheckUtils]: 22: Hoare triple {6574#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6574#true} is VALID [2018-11-23 12:16:56,351 INFO L273 TraceCheckUtils]: 23: Hoare triple {6574#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6574#true} is VALID [2018-11-23 12:16:56,351 INFO L273 TraceCheckUtils]: 24: Hoare triple {6574#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6574#true} is VALID [2018-11-23 12:16:56,351 INFO L273 TraceCheckUtils]: 25: Hoare triple {6574#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6574#true} is VALID [2018-11-23 12:16:56,351 INFO L273 TraceCheckUtils]: 26: Hoare triple {6574#true} assume !(~i~1 < 10); {6574#true} is VALID [2018-11-23 12:16:56,352 INFO L256 TraceCheckUtils]: 27: Hoare triple {6574#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {6574#true} is VALID [2018-11-23 12:16:56,352 INFO L273 TraceCheckUtils]: 28: Hoare triple {6574#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {6576#(= sep_~i~0 0)} is VALID [2018-11-23 12:16:56,352 INFO L273 TraceCheckUtils]: 29: Hoare triple {6576#(= sep_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6576#(= sep_~i~0 0)} is VALID [2018-11-23 12:16:56,353 INFO L273 TraceCheckUtils]: 30: Hoare triple {6576#(= 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; {6576#(= sep_~i~0 0)} is VALID [2018-11-23 12:16:56,353 INFO L273 TraceCheckUtils]: 31: Hoare triple {6576#(= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6577#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:56,353 INFO L273 TraceCheckUtils]: 32: Hoare triple {6577#(<= sep_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6577#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:56,354 INFO L273 TraceCheckUtils]: 33: Hoare triple {6577#(<= 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; {6577#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:56,354 INFO L273 TraceCheckUtils]: 34: Hoare triple {6577#(<= sep_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6578#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:56,354 INFO L273 TraceCheckUtils]: 35: Hoare triple {6578#(<= sep_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6578#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:56,355 INFO L273 TraceCheckUtils]: 36: Hoare triple {6578#(<= 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; {6578#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:56,355 INFO L273 TraceCheckUtils]: 37: Hoare triple {6578#(<= sep_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6579#(<= sep_~i~0 3)} is VALID [2018-11-23 12:16:56,356 INFO L273 TraceCheckUtils]: 38: Hoare triple {6579#(<= sep_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6579#(<= sep_~i~0 3)} is VALID [2018-11-23 12:16:56,356 INFO L273 TraceCheckUtils]: 39: Hoare triple {6579#(<= 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; {6579#(<= sep_~i~0 3)} is VALID [2018-11-23 12:16:56,357 INFO L273 TraceCheckUtils]: 40: Hoare triple {6579#(<= sep_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6580#(<= sep_~i~0 4)} is VALID [2018-11-23 12:16:56,358 INFO L273 TraceCheckUtils]: 41: Hoare triple {6580#(<= sep_~i~0 4)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6580#(<= sep_~i~0 4)} is VALID [2018-11-23 12:16:56,358 INFO L273 TraceCheckUtils]: 42: Hoare triple {6580#(<= 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; {6580#(<= sep_~i~0 4)} is VALID [2018-11-23 12:16:56,359 INFO L273 TraceCheckUtils]: 43: Hoare triple {6580#(<= sep_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6581#(<= sep_~i~0 5)} is VALID [2018-11-23 12:16:56,359 INFO L273 TraceCheckUtils]: 44: Hoare triple {6581#(<= sep_~i~0 5)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6581#(<= sep_~i~0 5)} is VALID [2018-11-23 12:16:56,360 INFO L273 TraceCheckUtils]: 45: Hoare triple {6581#(<= 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; {6581#(<= sep_~i~0 5)} is VALID [2018-11-23 12:16:56,360 INFO L273 TraceCheckUtils]: 46: Hoare triple {6581#(<= sep_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6582#(<= sep_~i~0 6)} is VALID [2018-11-23 12:16:56,361 INFO L273 TraceCheckUtils]: 47: Hoare triple {6582#(<= sep_~i~0 6)} assume !(~i~0 < 10); {6575#false} is VALID [2018-11-23 12:16:56,361 INFO L273 TraceCheckUtils]: 48: Hoare triple {6575#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6575#false} is VALID [2018-11-23 12:16:56,361 INFO L273 TraceCheckUtils]: 49: Hoare triple {6575#false} assume true; {6575#false} is VALID [2018-11-23 12:16:56,362 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {6575#false} {6574#true} #75#return; {6575#false} is VALID [2018-11-23 12:16:56,362 INFO L273 TraceCheckUtils]: 51: Hoare triple {6575#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); {6575#false} is VALID [2018-11-23 12:16:56,362 INFO L256 TraceCheckUtils]: 52: Hoare triple {6575#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {6574#true} is VALID [2018-11-23 12:16:56,362 INFO L273 TraceCheckUtils]: 53: Hoare triple {6574#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {6574#true} is VALID [2018-11-23 12:16:56,362 INFO L273 TraceCheckUtils]: 54: Hoare triple {6574#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6574#true} is VALID [2018-11-23 12:16:56,363 INFO L273 TraceCheckUtils]: 55: Hoare triple {6574#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6574#true} is VALID [2018-11-23 12:16:56,363 INFO L273 TraceCheckUtils]: 56: Hoare triple {6574#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6574#true} is VALID [2018-11-23 12:16:56,363 INFO L273 TraceCheckUtils]: 57: Hoare triple {6574#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6574#true} is VALID [2018-11-23 12:16:56,363 INFO L273 TraceCheckUtils]: 58: Hoare triple {6574#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6574#true} is VALID [2018-11-23 12:16:56,363 INFO L273 TraceCheckUtils]: 59: Hoare triple {6574#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6574#true} is VALID [2018-11-23 12:16:56,364 INFO L273 TraceCheckUtils]: 60: Hoare triple {6574#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6574#true} is VALID [2018-11-23 12:16:56,364 INFO L273 TraceCheckUtils]: 61: Hoare triple {6574#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6574#true} is VALID [2018-11-23 12:16:56,364 INFO L273 TraceCheckUtils]: 62: Hoare triple {6574#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6574#true} is VALID [2018-11-23 12:16:56,364 INFO L273 TraceCheckUtils]: 63: Hoare triple {6574#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6574#true} is VALID [2018-11-23 12:16:56,364 INFO L273 TraceCheckUtils]: 64: Hoare triple {6574#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6574#true} is VALID [2018-11-23 12:16:56,365 INFO L273 TraceCheckUtils]: 65: Hoare triple {6574#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6574#true} is VALID [2018-11-23 12:16:56,365 INFO L273 TraceCheckUtils]: 66: Hoare triple {6574#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6574#true} is VALID [2018-11-23 12:16:56,365 INFO L273 TraceCheckUtils]: 67: Hoare triple {6574#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6574#true} is VALID [2018-11-23 12:16:56,365 INFO L273 TraceCheckUtils]: 68: Hoare triple {6574#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6574#true} is VALID [2018-11-23 12:16:56,365 INFO L273 TraceCheckUtils]: 69: Hoare triple {6574#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6574#true} is VALID [2018-11-23 12:16:56,365 INFO L273 TraceCheckUtils]: 70: Hoare triple {6574#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6574#true} is VALID [2018-11-23 12:16:56,366 INFO L273 TraceCheckUtils]: 71: Hoare triple {6574#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6574#true} is VALID [2018-11-23 12:16:56,366 INFO L273 TraceCheckUtils]: 72: Hoare triple {6574#true} assume !(~i~0 < 10); {6574#true} is VALID [2018-11-23 12:16:56,366 INFO L273 TraceCheckUtils]: 73: Hoare triple {6574#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6574#true} is VALID [2018-11-23 12:16:56,366 INFO L273 TraceCheckUtils]: 74: Hoare triple {6574#true} assume true; {6574#true} is VALID [2018-11-23 12:16:56,366 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {6574#true} {6575#false} #77#return; {6575#false} is VALID [2018-11-23 12:16:56,367 INFO L273 TraceCheckUtils]: 76: Hoare triple {6575#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; {6575#false} is VALID [2018-11-23 12:16:56,367 INFO L273 TraceCheckUtils]: 77: Hoare triple {6575#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {6575#false} is VALID [2018-11-23 12:16:56,367 INFO L273 TraceCheckUtils]: 78: Hoare triple {6575#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {6575#false} is VALID [2018-11-23 12:16:56,367 INFO L273 TraceCheckUtils]: 79: Hoare triple {6575#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {6575#false} is VALID [2018-11-23 12:16:56,367 INFO L273 TraceCheckUtils]: 80: Hoare triple {6575#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {6575#false} is VALID [2018-11-23 12:16:56,367 INFO L273 TraceCheckUtils]: 81: Hoare triple {6575#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {6575#false} is VALID [2018-11-23 12:16:56,367 INFO L273 TraceCheckUtils]: 82: Hoare triple {6575#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {6575#false} is VALID [2018-11-23 12:16:56,367 INFO L273 TraceCheckUtils]: 83: Hoare triple {6575#false} assume !(~i~2 < 9); {6575#false} is VALID [2018-11-23 12:16:56,368 INFO L273 TraceCheckUtils]: 84: Hoare triple {6575#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {6575#false} is VALID [2018-11-23 12:16:56,368 INFO L256 TraceCheckUtils]: 85: Hoare triple {6575#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {6574#true} is VALID [2018-11-23 12:16:56,368 INFO L273 TraceCheckUtils]: 86: Hoare triple {6574#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {6574#true} is VALID [2018-11-23 12:16:56,368 INFO L273 TraceCheckUtils]: 87: Hoare triple {6574#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6574#true} is VALID [2018-11-23 12:16:56,368 INFO L273 TraceCheckUtils]: 88: Hoare triple {6574#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6574#true} is VALID [2018-11-23 12:16:56,368 INFO L273 TraceCheckUtils]: 89: Hoare triple {6574#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6574#true} is VALID [2018-11-23 12:16:56,368 INFO L273 TraceCheckUtils]: 90: Hoare triple {6574#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6574#true} is VALID [2018-11-23 12:16:56,368 INFO L273 TraceCheckUtils]: 91: Hoare triple {6574#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6574#true} is VALID [2018-11-23 12:16:56,368 INFO L273 TraceCheckUtils]: 92: Hoare triple {6574#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6574#true} is VALID [2018-11-23 12:16:56,369 INFO L273 TraceCheckUtils]: 93: Hoare triple {6574#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6574#true} is VALID [2018-11-23 12:16:56,369 INFO L273 TraceCheckUtils]: 94: Hoare triple {6574#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6574#true} is VALID [2018-11-23 12:16:56,369 INFO L273 TraceCheckUtils]: 95: Hoare triple {6574#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6574#true} is VALID [2018-11-23 12:16:56,369 INFO L273 TraceCheckUtils]: 96: Hoare triple {6574#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6574#true} is VALID [2018-11-23 12:16:56,369 INFO L273 TraceCheckUtils]: 97: Hoare triple {6574#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6574#true} is VALID [2018-11-23 12:16:56,369 INFO L273 TraceCheckUtils]: 98: Hoare triple {6574#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6574#true} is VALID [2018-11-23 12:16:56,369 INFO L273 TraceCheckUtils]: 99: Hoare triple {6574#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6574#true} is VALID [2018-11-23 12:16:56,369 INFO L273 TraceCheckUtils]: 100: Hoare triple {6574#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6574#true} is VALID [2018-11-23 12:16:56,369 INFO L273 TraceCheckUtils]: 101: Hoare triple {6574#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6574#true} is VALID [2018-11-23 12:16:56,370 INFO L273 TraceCheckUtils]: 102: Hoare triple {6574#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6574#true} is VALID [2018-11-23 12:16:56,370 INFO L273 TraceCheckUtils]: 103: Hoare triple {6574#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6574#true} is VALID [2018-11-23 12:16:56,370 INFO L273 TraceCheckUtils]: 104: Hoare triple {6574#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6574#true} is VALID [2018-11-23 12:16:56,370 INFO L273 TraceCheckUtils]: 105: Hoare triple {6574#true} assume !(~i~0 < 10); {6574#true} is VALID [2018-11-23 12:16:56,370 INFO L273 TraceCheckUtils]: 106: Hoare triple {6574#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6574#true} is VALID [2018-11-23 12:16:56,370 INFO L273 TraceCheckUtils]: 107: Hoare triple {6574#true} assume true; {6574#true} is VALID [2018-11-23 12:16:56,370 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {6574#true} {6575#false} #79#return; {6575#false} is VALID [2018-11-23 12:16:56,370 INFO L273 TraceCheckUtils]: 109: Hoare triple {6575#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {6575#false} is VALID [2018-11-23 12:16:56,371 INFO L273 TraceCheckUtils]: 110: Hoare triple {6575#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {6575#false} is VALID [2018-11-23 12:16:56,371 INFO L273 TraceCheckUtils]: 111: Hoare triple {6575#false} assume !false; {6575#false} is VALID [2018-11-23 12:16:56,377 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 299 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-11-23 12:16:56,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:56,377 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:16:56,389 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:16:56,466 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-23 12:16:56,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:16:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:56,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:56,766 INFO L256 TraceCheckUtils]: 0: Hoare triple {6574#true} call ULTIMATE.init(); {6574#true} is VALID [2018-11-23 12:16:56,767 INFO L273 TraceCheckUtils]: 1: Hoare triple {6574#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6574#true} is VALID [2018-11-23 12:16:56,767 INFO L273 TraceCheckUtils]: 2: Hoare triple {6574#true} assume true; {6574#true} is VALID [2018-11-23 12:16:56,767 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6574#true} {6574#true} #71#return; {6574#true} is VALID [2018-11-23 12:16:56,767 INFO L256 TraceCheckUtils]: 4: Hoare triple {6574#true} call #t~ret14 := main(); {6574#true} is VALID [2018-11-23 12:16:56,767 INFO L273 TraceCheckUtils]: 5: Hoare triple {6574#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {6574#true} is VALID [2018-11-23 12:16:56,768 INFO L273 TraceCheckUtils]: 6: Hoare triple {6574#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6574#true} is VALID [2018-11-23 12:16:56,768 INFO L273 TraceCheckUtils]: 7: Hoare triple {6574#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6574#true} is VALID [2018-11-23 12:16:56,768 INFO L273 TraceCheckUtils]: 8: Hoare triple {6574#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6574#true} is VALID [2018-11-23 12:16:56,768 INFO L273 TraceCheckUtils]: 9: Hoare triple {6574#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6574#true} is VALID [2018-11-23 12:16:56,768 INFO L273 TraceCheckUtils]: 10: Hoare triple {6574#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6574#true} is VALID [2018-11-23 12:16:56,769 INFO L273 TraceCheckUtils]: 11: Hoare triple {6574#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6574#true} is VALID [2018-11-23 12:16:56,769 INFO L273 TraceCheckUtils]: 12: Hoare triple {6574#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6574#true} is VALID [2018-11-23 12:16:56,769 INFO L273 TraceCheckUtils]: 13: Hoare triple {6574#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6574#true} is VALID [2018-11-23 12:16:56,769 INFO L273 TraceCheckUtils]: 14: Hoare triple {6574#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6574#true} is VALID [2018-11-23 12:16:56,769 INFO L273 TraceCheckUtils]: 15: Hoare triple {6574#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6574#true} is VALID [2018-11-23 12:16:56,770 INFO L273 TraceCheckUtils]: 16: Hoare triple {6574#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6574#true} is VALID [2018-11-23 12:16:56,770 INFO L273 TraceCheckUtils]: 17: Hoare triple {6574#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6574#true} is VALID [2018-11-23 12:16:56,770 INFO L273 TraceCheckUtils]: 18: Hoare triple {6574#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6574#true} is VALID [2018-11-23 12:16:56,770 INFO L273 TraceCheckUtils]: 19: Hoare triple {6574#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6574#true} is VALID [2018-11-23 12:16:56,770 INFO L273 TraceCheckUtils]: 20: Hoare triple {6574#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6574#true} is VALID [2018-11-23 12:16:56,771 INFO L273 TraceCheckUtils]: 21: Hoare triple {6574#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6574#true} is VALID [2018-11-23 12:16:56,771 INFO L273 TraceCheckUtils]: 22: Hoare triple {6574#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6574#true} is VALID [2018-11-23 12:16:56,771 INFO L273 TraceCheckUtils]: 23: Hoare triple {6574#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6574#true} is VALID [2018-11-23 12:16:56,771 INFO L273 TraceCheckUtils]: 24: Hoare triple {6574#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {6574#true} is VALID [2018-11-23 12:16:56,771 INFO L273 TraceCheckUtils]: 25: Hoare triple {6574#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6574#true} is VALID [2018-11-23 12:16:56,771 INFO L273 TraceCheckUtils]: 26: Hoare triple {6574#true} assume !(~i~1 < 10); {6574#true} is VALID [2018-11-23 12:16:56,771 INFO L256 TraceCheckUtils]: 27: Hoare triple {6574#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {6574#true} is VALID [2018-11-23 12:16:56,771 INFO L273 TraceCheckUtils]: 28: Hoare triple {6574#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {6574#true} is VALID [2018-11-23 12:16:56,772 INFO L273 TraceCheckUtils]: 29: Hoare triple {6574#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6574#true} is VALID [2018-11-23 12:16:56,772 INFO L273 TraceCheckUtils]: 30: Hoare triple {6574#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6574#true} is VALID [2018-11-23 12:16:56,772 INFO L273 TraceCheckUtils]: 31: Hoare triple {6574#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6574#true} is VALID [2018-11-23 12:16:56,772 INFO L273 TraceCheckUtils]: 32: Hoare triple {6574#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6574#true} is VALID [2018-11-23 12:16:56,772 INFO L273 TraceCheckUtils]: 33: Hoare triple {6574#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6574#true} is VALID [2018-11-23 12:16:56,772 INFO L273 TraceCheckUtils]: 34: Hoare triple {6574#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6574#true} is VALID [2018-11-23 12:16:56,772 INFO L273 TraceCheckUtils]: 35: Hoare triple {6574#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6574#true} is VALID [2018-11-23 12:16:56,772 INFO L273 TraceCheckUtils]: 36: Hoare triple {6574#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6574#true} is VALID [2018-11-23 12:16:56,772 INFO L273 TraceCheckUtils]: 37: Hoare triple {6574#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6574#true} is VALID [2018-11-23 12:16:56,773 INFO L273 TraceCheckUtils]: 38: Hoare triple {6574#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6574#true} is VALID [2018-11-23 12:16:56,773 INFO L273 TraceCheckUtils]: 39: Hoare triple {6574#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6574#true} is VALID [2018-11-23 12:16:56,773 INFO L273 TraceCheckUtils]: 40: Hoare triple {6574#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6574#true} is VALID [2018-11-23 12:16:56,773 INFO L273 TraceCheckUtils]: 41: Hoare triple {6574#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6574#true} is VALID [2018-11-23 12:16:56,773 INFO L273 TraceCheckUtils]: 42: Hoare triple {6574#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6574#true} is VALID [2018-11-23 12:16:56,773 INFO L273 TraceCheckUtils]: 43: Hoare triple {6574#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6574#true} is VALID [2018-11-23 12:16:56,773 INFO L273 TraceCheckUtils]: 44: Hoare triple {6574#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6574#true} is VALID [2018-11-23 12:16:56,773 INFO L273 TraceCheckUtils]: 45: Hoare triple {6574#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6574#true} is VALID [2018-11-23 12:16:56,773 INFO L273 TraceCheckUtils]: 46: Hoare triple {6574#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6574#true} is VALID [2018-11-23 12:16:56,774 INFO L273 TraceCheckUtils]: 47: Hoare triple {6574#true} assume !(~i~0 < 10); {6574#true} is VALID [2018-11-23 12:16:56,774 INFO L273 TraceCheckUtils]: 48: Hoare triple {6574#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6574#true} is VALID [2018-11-23 12:16:56,774 INFO L273 TraceCheckUtils]: 49: Hoare triple {6574#true} assume true; {6574#true} is VALID [2018-11-23 12:16:56,774 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {6574#true} {6574#true} #75#return; {6574#true} is VALID [2018-11-23 12:16:56,774 INFO L273 TraceCheckUtils]: 51: Hoare triple {6574#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); {6574#true} is VALID [2018-11-23 12:16:56,774 INFO L256 TraceCheckUtils]: 52: Hoare triple {6574#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {6574#true} is VALID [2018-11-23 12:16:56,774 INFO L273 TraceCheckUtils]: 53: Hoare triple {6574#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {6574#true} is VALID [2018-11-23 12:16:56,774 INFO L273 TraceCheckUtils]: 54: Hoare triple {6574#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6574#true} is VALID [2018-11-23 12:16:56,775 INFO L273 TraceCheckUtils]: 55: Hoare triple {6574#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6574#true} is VALID [2018-11-23 12:16:56,775 INFO L273 TraceCheckUtils]: 56: Hoare triple {6574#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6574#true} is VALID [2018-11-23 12:16:56,775 INFO L273 TraceCheckUtils]: 57: Hoare triple {6574#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6574#true} is VALID [2018-11-23 12:16:56,775 INFO L273 TraceCheckUtils]: 58: Hoare triple {6574#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6574#true} is VALID [2018-11-23 12:16:56,775 INFO L273 TraceCheckUtils]: 59: Hoare triple {6574#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6574#true} is VALID [2018-11-23 12:16:56,775 INFO L273 TraceCheckUtils]: 60: Hoare triple {6574#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6574#true} is VALID [2018-11-23 12:16:56,775 INFO L273 TraceCheckUtils]: 61: Hoare triple {6574#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6574#true} is VALID [2018-11-23 12:16:56,775 INFO L273 TraceCheckUtils]: 62: Hoare triple {6574#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6574#true} is VALID [2018-11-23 12:16:56,775 INFO L273 TraceCheckUtils]: 63: Hoare triple {6574#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6574#true} is VALID [2018-11-23 12:16:56,776 INFO L273 TraceCheckUtils]: 64: Hoare triple {6574#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6574#true} is VALID [2018-11-23 12:16:56,776 INFO L273 TraceCheckUtils]: 65: Hoare triple {6574#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6574#true} is VALID [2018-11-23 12:16:56,776 INFO L273 TraceCheckUtils]: 66: Hoare triple {6574#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6574#true} is VALID [2018-11-23 12:16:56,776 INFO L273 TraceCheckUtils]: 67: Hoare triple {6574#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6574#true} is VALID [2018-11-23 12:16:56,776 INFO L273 TraceCheckUtils]: 68: Hoare triple {6574#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6574#true} is VALID [2018-11-23 12:16:56,776 INFO L273 TraceCheckUtils]: 69: Hoare triple {6574#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6574#true} is VALID [2018-11-23 12:16:56,776 INFO L273 TraceCheckUtils]: 70: Hoare triple {6574#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6574#true} is VALID [2018-11-23 12:16:56,776 INFO L273 TraceCheckUtils]: 71: Hoare triple {6574#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6574#true} is VALID [2018-11-23 12:16:56,777 INFO L273 TraceCheckUtils]: 72: Hoare triple {6574#true} assume !(~i~0 < 10); {6574#true} is VALID [2018-11-23 12:16:56,777 INFO L273 TraceCheckUtils]: 73: Hoare triple {6574#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6574#true} is VALID [2018-11-23 12:16:56,777 INFO L273 TraceCheckUtils]: 74: Hoare triple {6574#true} assume true; {6574#true} is VALID [2018-11-23 12:16:56,777 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {6574#true} {6574#true} #77#return; {6574#true} is VALID [2018-11-23 12:16:56,778 INFO L273 TraceCheckUtils]: 76: Hoare triple {6574#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; {6814#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:56,778 INFO L273 TraceCheckUtils]: 77: Hoare triple {6814#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {6814#(<= main_~i~2 0)} is VALID [2018-11-23 12:16:56,778 INFO L273 TraceCheckUtils]: 78: Hoare triple {6814#(<= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {6821#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:56,779 INFO L273 TraceCheckUtils]: 79: Hoare triple {6821#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {6821#(<= main_~i~2 1)} is VALID [2018-11-23 12:16:56,779 INFO L273 TraceCheckUtils]: 80: Hoare triple {6821#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {6828#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:56,780 INFO L273 TraceCheckUtils]: 81: Hoare triple {6828#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {6828#(<= main_~i~2 2)} is VALID [2018-11-23 12:16:56,780 INFO L273 TraceCheckUtils]: 82: Hoare triple {6828#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {6835#(<= main_~i~2 3)} is VALID [2018-11-23 12:16:56,780 INFO L273 TraceCheckUtils]: 83: Hoare triple {6835#(<= main_~i~2 3)} assume !(~i~2 < 9); {6575#false} is VALID [2018-11-23 12:16:56,781 INFO L273 TraceCheckUtils]: 84: Hoare triple {6575#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {6575#false} is VALID [2018-11-23 12:16:56,781 INFO L256 TraceCheckUtils]: 85: Hoare triple {6575#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {6575#false} is VALID [2018-11-23 12:16:56,781 INFO L273 TraceCheckUtils]: 86: Hoare triple {6575#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {6575#false} is VALID [2018-11-23 12:16:56,781 INFO L273 TraceCheckUtils]: 87: Hoare triple {6575#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6575#false} is VALID [2018-11-23 12:16:56,781 INFO L273 TraceCheckUtils]: 88: Hoare triple {6575#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6575#false} is VALID [2018-11-23 12:16:56,781 INFO L273 TraceCheckUtils]: 89: Hoare triple {6575#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6575#false} is VALID [2018-11-23 12:16:56,782 INFO L273 TraceCheckUtils]: 90: Hoare triple {6575#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6575#false} is VALID [2018-11-23 12:16:56,782 INFO L273 TraceCheckUtils]: 91: Hoare triple {6575#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6575#false} is VALID [2018-11-23 12:16:56,782 INFO L273 TraceCheckUtils]: 92: Hoare triple {6575#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6575#false} is VALID [2018-11-23 12:16:56,782 INFO L273 TraceCheckUtils]: 93: Hoare triple {6575#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6575#false} is VALID [2018-11-23 12:16:56,782 INFO L273 TraceCheckUtils]: 94: Hoare triple {6575#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6575#false} is VALID [2018-11-23 12:16:56,783 INFO L273 TraceCheckUtils]: 95: Hoare triple {6575#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6575#false} is VALID [2018-11-23 12:16:56,783 INFO L273 TraceCheckUtils]: 96: Hoare triple {6575#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6575#false} is VALID [2018-11-23 12:16:56,783 INFO L273 TraceCheckUtils]: 97: Hoare triple {6575#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6575#false} is VALID [2018-11-23 12:16:56,783 INFO L273 TraceCheckUtils]: 98: Hoare triple {6575#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6575#false} is VALID [2018-11-23 12:16:56,783 INFO L273 TraceCheckUtils]: 99: Hoare triple {6575#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6575#false} is VALID [2018-11-23 12:16:56,784 INFO L273 TraceCheckUtils]: 100: Hoare triple {6575#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6575#false} is VALID [2018-11-23 12:16:56,784 INFO L273 TraceCheckUtils]: 101: Hoare triple {6575#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6575#false} is VALID [2018-11-23 12:16:56,784 INFO L273 TraceCheckUtils]: 102: Hoare triple {6575#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {6575#false} is VALID [2018-11-23 12:16:56,784 INFO L273 TraceCheckUtils]: 103: Hoare triple {6575#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {6575#false} is VALID [2018-11-23 12:16:56,784 INFO L273 TraceCheckUtils]: 104: Hoare triple {6575#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6575#false} is VALID [2018-11-23 12:16:56,785 INFO L273 TraceCheckUtils]: 105: Hoare triple {6575#false} assume !(~i~0 < 10); {6575#false} is VALID [2018-11-23 12:16:56,785 INFO L273 TraceCheckUtils]: 106: Hoare triple {6575#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {6575#false} is VALID [2018-11-23 12:16:56,785 INFO L273 TraceCheckUtils]: 107: Hoare triple {6575#false} assume true; {6575#false} is VALID [2018-11-23 12:16:56,785 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {6575#false} {6575#false} #79#return; {6575#false} is VALID [2018-11-23 12:16:56,785 INFO L273 TraceCheckUtils]: 109: Hoare triple {6575#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {6575#false} is VALID [2018-11-23 12:16:56,785 INFO L273 TraceCheckUtils]: 110: Hoare triple {6575#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {6575#false} is VALID [2018-11-23 12:16:56,785 INFO L273 TraceCheckUtils]: 111: Hoare triple {6575#false} assume !false; {6575#false} is VALID [2018-11-23 12:16:56,790 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 250 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-23 12:16:56,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:56,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2018-11-23 12:16:56,810 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 112 [2018-11-23 12:16:56,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:56,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:16:56,873 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:56,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:16:56,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:16:56,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:16:56,874 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand 13 states. [2018-11-23 12:16:57,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:57,455 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2018-11-23 12:16:57,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:16:57,455 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 112 [2018-11-23 12:16:57,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:57,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:16:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 94 transitions. [2018-11-23 12:16:57,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:16:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 94 transitions. [2018-11-23 12:16:57,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 94 transitions. [2018-11-23 12:16:57,908 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:57,910 INFO L225 Difference]: With dead ends: 114 [2018-11-23 12:16:57,910 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 12:16:57,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:16:57,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 12:16:57,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-11-23 12:16:57,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:57,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 72 states. [2018-11-23 12:16:57,940 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 72 states. [2018-11-23 12:16:57,940 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 72 states. [2018-11-23 12:16:57,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:57,942 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2018-11-23 12:16:57,943 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2018-11-23 12:16:57,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:57,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:57,943 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 75 states. [2018-11-23 12:16:57,943 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 75 states. [2018-11-23 12:16:57,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:57,946 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2018-11-23 12:16:57,946 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2018-11-23 12:16:57,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:57,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:57,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:57,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:57,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 12:16:57,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2018-11-23 12:16:57,948 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 112 [2018-11-23 12:16:57,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:57,948 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2018-11-23 12:16:57,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:16:57,949 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2018-11-23 12:16:57,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-23 12:16:57,950 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:57,950 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 10, 10, 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:16:57,950 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:57,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:57,951 INFO L82 PathProgramCache]: Analyzing trace with hash 2115527283, now seen corresponding path program 13 times [2018-11-23 12:16:57,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:57,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:57,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:57,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:16:57,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:58,587 INFO L256 TraceCheckUtils]: 0: Hoare triple {7336#true} call ULTIMATE.init(); {7336#true} is VALID [2018-11-23 12:16:58,588 INFO L273 TraceCheckUtils]: 1: Hoare triple {7336#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7336#true} is VALID [2018-11-23 12:16:58,588 INFO L273 TraceCheckUtils]: 2: Hoare triple {7336#true} assume true; {7336#true} is VALID [2018-11-23 12:16:58,588 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7336#true} {7336#true} #71#return; {7336#true} is VALID [2018-11-23 12:16:58,588 INFO L256 TraceCheckUtils]: 4: Hoare triple {7336#true} call #t~ret14 := main(); {7336#true} is VALID [2018-11-23 12:16:58,588 INFO L273 TraceCheckUtils]: 5: Hoare triple {7336#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7336#true} is VALID [2018-11-23 12:16:58,589 INFO L273 TraceCheckUtils]: 6: Hoare triple {7336#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7336#true} is VALID [2018-11-23 12:16:58,589 INFO L273 TraceCheckUtils]: 7: Hoare triple {7336#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7336#true} is VALID [2018-11-23 12:16:58,589 INFO L273 TraceCheckUtils]: 8: Hoare triple {7336#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7336#true} is VALID [2018-11-23 12:16:58,589 INFO L273 TraceCheckUtils]: 9: Hoare triple {7336#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7336#true} is VALID [2018-11-23 12:16:58,589 INFO L273 TraceCheckUtils]: 10: Hoare triple {7336#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7336#true} is VALID [2018-11-23 12:16:58,589 INFO L273 TraceCheckUtils]: 11: Hoare triple {7336#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7336#true} is VALID [2018-11-23 12:16:58,589 INFO L273 TraceCheckUtils]: 12: Hoare triple {7336#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7336#true} is VALID [2018-11-23 12:16:58,589 INFO L273 TraceCheckUtils]: 13: Hoare triple {7336#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7336#true} is VALID [2018-11-23 12:16:58,589 INFO L273 TraceCheckUtils]: 14: Hoare triple {7336#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7336#true} is VALID [2018-11-23 12:16:58,590 INFO L273 TraceCheckUtils]: 15: Hoare triple {7336#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7336#true} is VALID [2018-11-23 12:16:58,590 INFO L273 TraceCheckUtils]: 16: Hoare triple {7336#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7336#true} is VALID [2018-11-23 12:16:58,590 INFO L273 TraceCheckUtils]: 17: Hoare triple {7336#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7336#true} is VALID [2018-11-23 12:16:58,590 INFO L273 TraceCheckUtils]: 18: Hoare triple {7336#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7336#true} is VALID [2018-11-23 12:16:58,590 INFO L273 TraceCheckUtils]: 19: Hoare triple {7336#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7336#true} is VALID [2018-11-23 12:16:58,590 INFO L273 TraceCheckUtils]: 20: Hoare triple {7336#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7336#true} is VALID [2018-11-23 12:16:58,590 INFO L273 TraceCheckUtils]: 21: Hoare triple {7336#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7336#true} is VALID [2018-11-23 12:16:58,590 INFO L273 TraceCheckUtils]: 22: Hoare triple {7336#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7336#true} is VALID [2018-11-23 12:16:58,591 INFO L273 TraceCheckUtils]: 23: Hoare triple {7336#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7336#true} is VALID [2018-11-23 12:16:58,591 INFO L273 TraceCheckUtils]: 24: Hoare triple {7336#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7336#true} is VALID [2018-11-23 12:16:58,591 INFO L273 TraceCheckUtils]: 25: Hoare triple {7336#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7336#true} is VALID [2018-11-23 12:16:58,591 INFO L273 TraceCheckUtils]: 26: Hoare triple {7336#true} assume !(~i~1 < 10); {7336#true} is VALID [2018-11-23 12:16:58,591 INFO L256 TraceCheckUtils]: 27: Hoare triple {7336#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {7336#true} is VALID [2018-11-23 12:16:58,591 INFO L273 TraceCheckUtils]: 28: Hoare triple {7336#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {7338#(= sep_~i~0 0)} is VALID [2018-11-23 12:16:58,592 INFO L273 TraceCheckUtils]: 29: Hoare triple {7338#(= sep_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7338#(= sep_~i~0 0)} is VALID [2018-11-23 12:16:58,592 INFO L273 TraceCheckUtils]: 30: Hoare triple {7338#(= 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; {7338#(= sep_~i~0 0)} is VALID [2018-11-23 12:16:58,592 INFO L273 TraceCheckUtils]: 31: Hoare triple {7338#(= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7339#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:58,593 INFO L273 TraceCheckUtils]: 32: Hoare triple {7339#(<= sep_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7339#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:58,593 INFO L273 TraceCheckUtils]: 33: Hoare triple {7339#(<= 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; {7339#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:58,594 INFO L273 TraceCheckUtils]: 34: Hoare triple {7339#(<= sep_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7340#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:58,594 INFO L273 TraceCheckUtils]: 35: Hoare triple {7340#(<= sep_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7340#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:58,594 INFO L273 TraceCheckUtils]: 36: Hoare triple {7340#(<= 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; {7340#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:58,595 INFO L273 TraceCheckUtils]: 37: Hoare triple {7340#(<= sep_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7341#(<= sep_~i~0 3)} is VALID [2018-11-23 12:16:58,595 INFO L273 TraceCheckUtils]: 38: Hoare triple {7341#(<= sep_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7341#(<= sep_~i~0 3)} is VALID [2018-11-23 12:16:58,595 INFO L273 TraceCheckUtils]: 39: Hoare triple {7341#(<= 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; {7341#(<= sep_~i~0 3)} is VALID [2018-11-23 12:16:58,596 INFO L273 TraceCheckUtils]: 40: Hoare triple {7341#(<= sep_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7342#(<= sep_~i~0 4)} is VALID [2018-11-23 12:16:58,597 INFO L273 TraceCheckUtils]: 41: Hoare triple {7342#(<= sep_~i~0 4)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7342#(<= sep_~i~0 4)} is VALID [2018-11-23 12:16:58,597 INFO L273 TraceCheckUtils]: 42: Hoare triple {7342#(<= 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; {7342#(<= sep_~i~0 4)} is VALID [2018-11-23 12:16:58,598 INFO L273 TraceCheckUtils]: 43: Hoare triple {7342#(<= sep_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7343#(<= sep_~i~0 5)} is VALID [2018-11-23 12:16:58,599 INFO L273 TraceCheckUtils]: 44: Hoare triple {7343#(<= sep_~i~0 5)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7343#(<= sep_~i~0 5)} is VALID [2018-11-23 12:16:58,599 INFO L273 TraceCheckUtils]: 45: Hoare triple {7343#(<= 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; {7343#(<= sep_~i~0 5)} is VALID [2018-11-23 12:16:58,600 INFO L273 TraceCheckUtils]: 46: Hoare triple {7343#(<= sep_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7344#(<= sep_~i~0 6)} is VALID [2018-11-23 12:16:58,600 INFO L273 TraceCheckUtils]: 47: Hoare triple {7344#(<= sep_~i~0 6)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7344#(<= sep_~i~0 6)} is VALID [2018-11-23 12:16:58,601 INFO L273 TraceCheckUtils]: 48: Hoare triple {7344#(<= 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; {7344#(<= sep_~i~0 6)} is VALID [2018-11-23 12:16:58,602 INFO L273 TraceCheckUtils]: 49: Hoare triple {7344#(<= sep_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7345#(<= sep_~i~0 7)} is VALID [2018-11-23 12:16:58,602 INFO L273 TraceCheckUtils]: 50: Hoare triple {7345#(<= sep_~i~0 7)} assume !(~i~0 < 10); {7337#false} is VALID [2018-11-23 12:16:58,603 INFO L273 TraceCheckUtils]: 51: Hoare triple {7337#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7337#false} is VALID [2018-11-23 12:16:58,603 INFO L273 TraceCheckUtils]: 52: Hoare triple {7337#false} assume true; {7337#false} is VALID [2018-11-23 12:16:58,603 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {7337#false} {7336#true} #75#return; {7337#false} is VALID [2018-11-23 12:16:58,603 INFO L273 TraceCheckUtils]: 54: Hoare triple {7337#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); {7337#false} is VALID [2018-11-23 12:16:58,603 INFO L256 TraceCheckUtils]: 55: Hoare triple {7337#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {7336#true} is VALID [2018-11-23 12:16:58,604 INFO L273 TraceCheckUtils]: 56: Hoare triple {7336#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {7336#true} is VALID [2018-11-23 12:16:58,604 INFO L273 TraceCheckUtils]: 57: Hoare triple {7336#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7336#true} is VALID [2018-11-23 12:16:58,604 INFO L273 TraceCheckUtils]: 58: Hoare triple {7336#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7336#true} is VALID [2018-11-23 12:16:58,604 INFO L273 TraceCheckUtils]: 59: Hoare triple {7336#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7336#true} is VALID [2018-11-23 12:16:58,604 INFO L273 TraceCheckUtils]: 60: Hoare triple {7336#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7336#true} is VALID [2018-11-23 12:16:58,605 INFO L273 TraceCheckUtils]: 61: Hoare triple {7336#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7336#true} is VALID [2018-11-23 12:16:58,605 INFO L273 TraceCheckUtils]: 62: Hoare triple {7336#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7336#true} is VALID [2018-11-23 12:16:58,605 INFO L273 TraceCheckUtils]: 63: Hoare triple {7336#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7336#true} is VALID [2018-11-23 12:16:58,605 INFO L273 TraceCheckUtils]: 64: Hoare triple {7336#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7336#true} is VALID [2018-11-23 12:16:58,605 INFO L273 TraceCheckUtils]: 65: Hoare triple {7336#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7336#true} is VALID [2018-11-23 12:16:58,606 INFO L273 TraceCheckUtils]: 66: Hoare triple {7336#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7336#true} is VALID [2018-11-23 12:16:58,606 INFO L273 TraceCheckUtils]: 67: Hoare triple {7336#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7336#true} is VALID [2018-11-23 12:16:58,606 INFO L273 TraceCheckUtils]: 68: Hoare triple {7336#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7336#true} is VALID [2018-11-23 12:16:58,606 INFO L273 TraceCheckUtils]: 69: Hoare triple {7336#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7336#true} is VALID [2018-11-23 12:16:58,607 INFO L273 TraceCheckUtils]: 70: Hoare triple {7336#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7336#true} is VALID [2018-11-23 12:16:58,607 INFO L273 TraceCheckUtils]: 71: Hoare triple {7336#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7336#true} is VALID [2018-11-23 12:16:58,607 INFO L273 TraceCheckUtils]: 72: Hoare triple {7336#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7336#true} is VALID [2018-11-23 12:16:58,607 INFO L273 TraceCheckUtils]: 73: Hoare triple {7336#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7336#true} is VALID [2018-11-23 12:16:58,607 INFO L273 TraceCheckUtils]: 74: Hoare triple {7336#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7336#true} is VALID [2018-11-23 12:16:58,608 INFO L273 TraceCheckUtils]: 75: Hoare triple {7336#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7336#true} is VALID [2018-11-23 12:16:58,608 INFO L273 TraceCheckUtils]: 76: Hoare triple {7336#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7336#true} is VALID [2018-11-23 12:16:58,608 INFO L273 TraceCheckUtils]: 77: Hoare triple {7336#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7336#true} is VALID [2018-11-23 12:16:58,608 INFO L273 TraceCheckUtils]: 78: Hoare triple {7336#true} assume !(~i~0 < 10); {7336#true} is VALID [2018-11-23 12:16:58,608 INFO L273 TraceCheckUtils]: 79: Hoare triple {7336#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7336#true} is VALID [2018-11-23 12:16:58,608 INFO L273 TraceCheckUtils]: 80: Hoare triple {7336#true} assume true; {7336#true} is VALID [2018-11-23 12:16:58,608 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {7336#true} {7337#false} #77#return; {7337#false} is VALID [2018-11-23 12:16:58,609 INFO L273 TraceCheckUtils]: 82: Hoare triple {7337#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; {7337#false} is VALID [2018-11-23 12:16:58,609 INFO L273 TraceCheckUtils]: 83: Hoare triple {7337#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7337#false} is VALID [2018-11-23 12:16:58,609 INFO L273 TraceCheckUtils]: 84: Hoare triple {7337#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7337#false} is VALID [2018-11-23 12:16:58,609 INFO L273 TraceCheckUtils]: 85: Hoare triple {7337#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7337#false} is VALID [2018-11-23 12:16:58,609 INFO L273 TraceCheckUtils]: 86: Hoare triple {7337#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7337#false} is VALID [2018-11-23 12:16:58,609 INFO L273 TraceCheckUtils]: 87: Hoare triple {7337#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7337#false} is VALID [2018-11-23 12:16:58,610 INFO L273 TraceCheckUtils]: 88: Hoare triple {7337#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7337#false} is VALID [2018-11-23 12:16:58,610 INFO L273 TraceCheckUtils]: 89: Hoare triple {7337#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7337#false} is VALID [2018-11-23 12:16:58,610 INFO L273 TraceCheckUtils]: 90: Hoare triple {7337#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7337#false} is VALID [2018-11-23 12:16:58,610 INFO L273 TraceCheckUtils]: 91: Hoare triple {7337#false} assume !(~i~2 < 9); {7337#false} is VALID [2018-11-23 12:16:58,610 INFO L273 TraceCheckUtils]: 92: Hoare triple {7337#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {7337#false} is VALID [2018-11-23 12:16:58,610 INFO L256 TraceCheckUtils]: 93: Hoare triple {7337#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {7336#true} is VALID [2018-11-23 12:16:58,610 INFO L273 TraceCheckUtils]: 94: Hoare triple {7336#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {7336#true} is VALID [2018-11-23 12:16:58,611 INFO L273 TraceCheckUtils]: 95: Hoare triple {7336#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7336#true} is VALID [2018-11-23 12:16:58,611 INFO L273 TraceCheckUtils]: 96: Hoare triple {7336#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7336#true} is VALID [2018-11-23 12:16:58,611 INFO L273 TraceCheckUtils]: 97: Hoare triple {7336#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7336#true} is VALID [2018-11-23 12:16:58,611 INFO L273 TraceCheckUtils]: 98: Hoare triple {7336#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7336#true} is VALID [2018-11-23 12:16:58,611 INFO L273 TraceCheckUtils]: 99: Hoare triple {7336#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7336#true} is VALID [2018-11-23 12:16:58,611 INFO L273 TraceCheckUtils]: 100: Hoare triple {7336#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7336#true} is VALID [2018-11-23 12:16:58,611 INFO L273 TraceCheckUtils]: 101: Hoare triple {7336#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7336#true} is VALID [2018-11-23 12:16:58,612 INFO L273 TraceCheckUtils]: 102: Hoare triple {7336#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7336#true} is VALID [2018-11-23 12:16:58,612 INFO L273 TraceCheckUtils]: 103: Hoare triple {7336#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7336#true} is VALID [2018-11-23 12:16:58,612 INFO L273 TraceCheckUtils]: 104: Hoare triple {7336#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7336#true} is VALID [2018-11-23 12:16:58,612 INFO L273 TraceCheckUtils]: 105: Hoare triple {7336#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7336#true} is VALID [2018-11-23 12:16:58,612 INFO L273 TraceCheckUtils]: 106: Hoare triple {7336#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7336#true} is VALID [2018-11-23 12:16:58,612 INFO L273 TraceCheckUtils]: 107: Hoare triple {7336#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7336#true} is VALID [2018-11-23 12:16:58,613 INFO L273 TraceCheckUtils]: 108: Hoare triple {7336#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7336#true} is VALID [2018-11-23 12:16:58,613 INFO L273 TraceCheckUtils]: 109: Hoare triple {7336#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7336#true} is VALID [2018-11-23 12:16:58,613 INFO L273 TraceCheckUtils]: 110: Hoare triple {7336#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7336#true} is VALID [2018-11-23 12:16:58,613 INFO L273 TraceCheckUtils]: 111: Hoare triple {7336#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7336#true} is VALID [2018-11-23 12:16:58,613 INFO L273 TraceCheckUtils]: 112: Hoare triple {7336#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7336#true} is VALID [2018-11-23 12:16:58,613 INFO L273 TraceCheckUtils]: 113: Hoare triple {7336#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7336#true} is VALID [2018-11-23 12:16:58,613 INFO L273 TraceCheckUtils]: 114: Hoare triple {7336#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7336#true} is VALID [2018-11-23 12:16:58,614 INFO L273 TraceCheckUtils]: 115: Hoare triple {7336#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7336#true} is VALID [2018-11-23 12:16:58,614 INFO L273 TraceCheckUtils]: 116: Hoare triple {7336#true} assume !(~i~0 < 10); {7336#true} is VALID [2018-11-23 12:16:58,614 INFO L273 TraceCheckUtils]: 117: Hoare triple {7336#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7336#true} is VALID [2018-11-23 12:16:58,614 INFO L273 TraceCheckUtils]: 118: Hoare triple {7336#true} assume true; {7336#true} is VALID [2018-11-23 12:16:58,614 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {7336#true} {7337#false} #79#return; {7337#false} is VALID [2018-11-23 12:16:58,614 INFO L273 TraceCheckUtils]: 120: Hoare triple {7337#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {7337#false} is VALID [2018-11-23 12:16:58,615 INFO L273 TraceCheckUtils]: 121: Hoare triple {7337#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {7337#false} is VALID [2018-11-23 12:16:58,615 INFO L273 TraceCheckUtils]: 122: Hoare triple {7337#false} assume !false; {7337#false} is VALID [2018-11-23 12:16:58,628 INFO L134 CoverageAnalysis]: Checked inductivity of 824 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2018-11-23 12:16:58,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:16:58,628 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:16:58,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:16:58,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:16:58,956 INFO L256 TraceCheckUtils]: 0: Hoare triple {7336#true} call ULTIMATE.init(); {7336#true} is VALID [2018-11-23 12:16:58,957 INFO L273 TraceCheckUtils]: 1: Hoare triple {7336#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7336#true} is VALID [2018-11-23 12:16:58,957 INFO L273 TraceCheckUtils]: 2: Hoare triple {7336#true} assume true; {7336#true} is VALID [2018-11-23 12:16:58,957 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7336#true} {7336#true} #71#return; {7336#true} is VALID [2018-11-23 12:16:58,958 INFO L256 TraceCheckUtils]: 4: Hoare triple {7336#true} call #t~ret14 := main(); {7336#true} is VALID [2018-11-23 12:16:58,958 INFO L273 TraceCheckUtils]: 5: Hoare triple {7336#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7336#true} is VALID [2018-11-23 12:16:58,958 INFO L273 TraceCheckUtils]: 6: Hoare triple {7336#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7336#true} is VALID [2018-11-23 12:16:58,958 INFO L273 TraceCheckUtils]: 7: Hoare triple {7336#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7336#true} is VALID [2018-11-23 12:16:58,958 INFO L273 TraceCheckUtils]: 8: Hoare triple {7336#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7336#true} is VALID [2018-11-23 12:16:58,959 INFO L273 TraceCheckUtils]: 9: Hoare triple {7336#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7336#true} is VALID [2018-11-23 12:16:58,959 INFO L273 TraceCheckUtils]: 10: Hoare triple {7336#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7336#true} is VALID [2018-11-23 12:16:58,959 INFO L273 TraceCheckUtils]: 11: Hoare triple {7336#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7336#true} is VALID [2018-11-23 12:16:58,959 INFO L273 TraceCheckUtils]: 12: Hoare triple {7336#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7336#true} is VALID [2018-11-23 12:16:58,959 INFO L273 TraceCheckUtils]: 13: Hoare triple {7336#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7336#true} is VALID [2018-11-23 12:16:58,959 INFO L273 TraceCheckUtils]: 14: Hoare triple {7336#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7336#true} is VALID [2018-11-23 12:16:58,960 INFO L273 TraceCheckUtils]: 15: Hoare triple {7336#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7336#true} is VALID [2018-11-23 12:16:58,960 INFO L273 TraceCheckUtils]: 16: Hoare triple {7336#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7336#true} is VALID [2018-11-23 12:16:58,960 INFO L273 TraceCheckUtils]: 17: Hoare triple {7336#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7336#true} is VALID [2018-11-23 12:16:58,960 INFO L273 TraceCheckUtils]: 18: Hoare triple {7336#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7336#true} is VALID [2018-11-23 12:16:58,960 INFO L273 TraceCheckUtils]: 19: Hoare triple {7336#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7336#true} is VALID [2018-11-23 12:16:58,960 INFO L273 TraceCheckUtils]: 20: Hoare triple {7336#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7336#true} is VALID [2018-11-23 12:16:58,961 INFO L273 TraceCheckUtils]: 21: Hoare triple {7336#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7336#true} is VALID [2018-11-23 12:16:58,961 INFO L273 TraceCheckUtils]: 22: Hoare triple {7336#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7336#true} is VALID [2018-11-23 12:16:58,961 INFO L273 TraceCheckUtils]: 23: Hoare triple {7336#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7336#true} is VALID [2018-11-23 12:16:58,961 INFO L273 TraceCheckUtils]: 24: Hoare triple {7336#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {7336#true} is VALID [2018-11-23 12:16:58,961 INFO L273 TraceCheckUtils]: 25: Hoare triple {7336#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7336#true} is VALID [2018-11-23 12:16:58,961 INFO L273 TraceCheckUtils]: 26: Hoare triple {7336#true} assume !(~i~1 < 10); {7336#true} is VALID [2018-11-23 12:16:58,961 INFO L256 TraceCheckUtils]: 27: Hoare triple {7336#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {7336#true} is VALID [2018-11-23 12:16:58,962 INFO L273 TraceCheckUtils]: 28: Hoare triple {7336#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {7433#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:58,962 INFO L273 TraceCheckUtils]: 29: Hoare triple {7433#(<= sep_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7433#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:58,963 INFO L273 TraceCheckUtils]: 30: Hoare triple {7433#(<= 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; {7433#(<= sep_~i~0 0)} is VALID [2018-11-23 12:16:58,963 INFO L273 TraceCheckUtils]: 31: Hoare triple {7433#(<= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7339#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:58,964 INFO L273 TraceCheckUtils]: 32: Hoare triple {7339#(<= sep_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7339#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:58,964 INFO L273 TraceCheckUtils]: 33: Hoare triple {7339#(<= 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; {7339#(<= sep_~i~0 1)} is VALID [2018-11-23 12:16:58,964 INFO L273 TraceCheckUtils]: 34: Hoare triple {7339#(<= sep_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7340#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:58,965 INFO L273 TraceCheckUtils]: 35: Hoare triple {7340#(<= sep_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7340#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:58,965 INFO L273 TraceCheckUtils]: 36: Hoare triple {7340#(<= 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; {7340#(<= sep_~i~0 2)} is VALID [2018-11-23 12:16:58,966 INFO L273 TraceCheckUtils]: 37: Hoare triple {7340#(<= sep_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7341#(<= sep_~i~0 3)} is VALID [2018-11-23 12:16:58,966 INFO L273 TraceCheckUtils]: 38: Hoare triple {7341#(<= sep_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7341#(<= sep_~i~0 3)} is VALID [2018-11-23 12:16:58,966 INFO L273 TraceCheckUtils]: 39: Hoare triple {7341#(<= 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; {7341#(<= sep_~i~0 3)} is VALID [2018-11-23 12:16:58,967 INFO L273 TraceCheckUtils]: 40: Hoare triple {7341#(<= sep_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7342#(<= sep_~i~0 4)} is VALID [2018-11-23 12:16:58,968 INFO L273 TraceCheckUtils]: 41: Hoare triple {7342#(<= sep_~i~0 4)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7342#(<= sep_~i~0 4)} is VALID [2018-11-23 12:16:58,968 INFO L273 TraceCheckUtils]: 42: Hoare triple {7342#(<= 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; {7342#(<= sep_~i~0 4)} is VALID [2018-11-23 12:16:58,969 INFO L273 TraceCheckUtils]: 43: Hoare triple {7342#(<= sep_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7343#(<= sep_~i~0 5)} is VALID [2018-11-23 12:16:58,970 INFO L273 TraceCheckUtils]: 44: Hoare triple {7343#(<= sep_~i~0 5)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7343#(<= sep_~i~0 5)} is VALID [2018-11-23 12:16:58,970 INFO L273 TraceCheckUtils]: 45: Hoare triple {7343#(<= 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; {7343#(<= sep_~i~0 5)} is VALID [2018-11-23 12:16:58,971 INFO L273 TraceCheckUtils]: 46: Hoare triple {7343#(<= sep_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7344#(<= sep_~i~0 6)} is VALID [2018-11-23 12:16:58,972 INFO L273 TraceCheckUtils]: 47: Hoare triple {7344#(<= sep_~i~0 6)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7344#(<= sep_~i~0 6)} is VALID [2018-11-23 12:16:58,972 INFO L273 TraceCheckUtils]: 48: Hoare triple {7344#(<= 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; {7344#(<= sep_~i~0 6)} is VALID [2018-11-23 12:16:58,973 INFO L273 TraceCheckUtils]: 49: Hoare triple {7344#(<= sep_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7345#(<= sep_~i~0 7)} is VALID [2018-11-23 12:16:58,974 INFO L273 TraceCheckUtils]: 50: Hoare triple {7345#(<= sep_~i~0 7)} assume !(~i~0 < 10); {7337#false} is VALID [2018-11-23 12:16:58,974 INFO L273 TraceCheckUtils]: 51: Hoare triple {7337#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7337#false} is VALID [2018-11-23 12:16:58,974 INFO L273 TraceCheckUtils]: 52: Hoare triple {7337#false} assume true; {7337#false} is VALID [2018-11-23 12:16:58,975 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {7337#false} {7336#true} #75#return; {7337#false} is VALID [2018-11-23 12:16:58,975 INFO L273 TraceCheckUtils]: 54: Hoare triple {7337#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); {7337#false} is VALID [2018-11-23 12:16:58,975 INFO L256 TraceCheckUtils]: 55: Hoare triple {7337#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {7337#false} is VALID [2018-11-23 12:16:58,975 INFO L273 TraceCheckUtils]: 56: Hoare triple {7337#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {7337#false} is VALID [2018-11-23 12:16:58,976 INFO L273 TraceCheckUtils]: 57: Hoare triple {7337#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7337#false} is VALID [2018-11-23 12:16:58,976 INFO L273 TraceCheckUtils]: 58: Hoare triple {7337#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7337#false} is VALID [2018-11-23 12:16:58,976 INFO L273 TraceCheckUtils]: 59: Hoare triple {7337#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7337#false} is VALID [2018-11-23 12:16:58,976 INFO L273 TraceCheckUtils]: 60: Hoare triple {7337#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7337#false} is VALID [2018-11-23 12:16:58,977 INFO L273 TraceCheckUtils]: 61: Hoare triple {7337#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7337#false} is VALID [2018-11-23 12:16:58,977 INFO L273 TraceCheckUtils]: 62: Hoare triple {7337#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7337#false} is VALID [2018-11-23 12:16:58,977 INFO L273 TraceCheckUtils]: 63: Hoare triple {7337#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7337#false} is VALID [2018-11-23 12:16:58,977 INFO L273 TraceCheckUtils]: 64: Hoare triple {7337#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7337#false} is VALID [2018-11-23 12:16:58,977 INFO L273 TraceCheckUtils]: 65: Hoare triple {7337#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7337#false} is VALID [2018-11-23 12:16:58,977 INFO L273 TraceCheckUtils]: 66: Hoare triple {7337#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7337#false} is VALID [2018-11-23 12:16:58,978 INFO L273 TraceCheckUtils]: 67: Hoare triple {7337#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7337#false} is VALID [2018-11-23 12:16:58,978 INFO L273 TraceCheckUtils]: 68: Hoare triple {7337#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7337#false} is VALID [2018-11-23 12:16:58,978 INFO L273 TraceCheckUtils]: 69: Hoare triple {7337#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7337#false} is VALID [2018-11-23 12:16:58,978 INFO L273 TraceCheckUtils]: 70: Hoare triple {7337#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7337#false} is VALID [2018-11-23 12:16:58,978 INFO L273 TraceCheckUtils]: 71: Hoare triple {7337#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7337#false} is VALID [2018-11-23 12:16:58,978 INFO L273 TraceCheckUtils]: 72: Hoare triple {7337#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7337#false} is VALID [2018-11-23 12:16:58,978 INFO L273 TraceCheckUtils]: 73: Hoare triple {7337#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7337#false} is VALID [2018-11-23 12:16:58,979 INFO L273 TraceCheckUtils]: 74: Hoare triple {7337#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7337#false} is VALID [2018-11-23 12:16:58,979 INFO L273 TraceCheckUtils]: 75: Hoare triple {7337#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7337#false} is VALID [2018-11-23 12:16:58,979 INFO L273 TraceCheckUtils]: 76: Hoare triple {7337#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7337#false} is VALID [2018-11-23 12:16:58,979 INFO L273 TraceCheckUtils]: 77: Hoare triple {7337#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7337#false} is VALID [2018-11-23 12:16:58,979 INFO L273 TraceCheckUtils]: 78: Hoare triple {7337#false} assume !(~i~0 < 10); {7337#false} is VALID [2018-11-23 12:16:58,979 INFO L273 TraceCheckUtils]: 79: Hoare triple {7337#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7337#false} is VALID [2018-11-23 12:16:58,979 INFO L273 TraceCheckUtils]: 80: Hoare triple {7337#false} assume true; {7337#false} is VALID [2018-11-23 12:16:58,980 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {7337#false} {7337#false} #77#return; {7337#false} is VALID [2018-11-23 12:16:58,980 INFO L273 TraceCheckUtils]: 82: Hoare triple {7337#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; {7337#false} is VALID [2018-11-23 12:16:58,980 INFO L273 TraceCheckUtils]: 83: Hoare triple {7337#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7337#false} is VALID [2018-11-23 12:16:58,980 INFO L273 TraceCheckUtils]: 84: Hoare triple {7337#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7337#false} is VALID [2018-11-23 12:16:58,980 INFO L273 TraceCheckUtils]: 85: Hoare triple {7337#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7337#false} is VALID [2018-11-23 12:16:58,980 INFO L273 TraceCheckUtils]: 86: Hoare triple {7337#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7337#false} is VALID [2018-11-23 12:16:58,980 INFO L273 TraceCheckUtils]: 87: Hoare triple {7337#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7337#false} is VALID [2018-11-23 12:16:58,981 INFO L273 TraceCheckUtils]: 88: Hoare triple {7337#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7337#false} is VALID [2018-11-23 12:16:58,981 INFO L273 TraceCheckUtils]: 89: Hoare triple {7337#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {7337#false} is VALID [2018-11-23 12:16:58,981 INFO L273 TraceCheckUtils]: 90: Hoare triple {7337#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {7337#false} is VALID [2018-11-23 12:16:58,981 INFO L273 TraceCheckUtils]: 91: Hoare triple {7337#false} assume !(~i~2 < 9); {7337#false} is VALID [2018-11-23 12:16:58,981 INFO L273 TraceCheckUtils]: 92: Hoare triple {7337#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {7337#false} is VALID [2018-11-23 12:16:58,981 INFO L256 TraceCheckUtils]: 93: Hoare triple {7337#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {7337#false} is VALID [2018-11-23 12:16:58,981 INFO L273 TraceCheckUtils]: 94: Hoare triple {7337#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {7337#false} is VALID [2018-11-23 12:16:58,982 INFO L273 TraceCheckUtils]: 95: Hoare triple {7337#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7337#false} is VALID [2018-11-23 12:16:58,982 INFO L273 TraceCheckUtils]: 96: Hoare triple {7337#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7337#false} is VALID [2018-11-23 12:16:58,982 INFO L273 TraceCheckUtils]: 97: Hoare triple {7337#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7337#false} is VALID [2018-11-23 12:16:58,982 INFO L273 TraceCheckUtils]: 98: Hoare triple {7337#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7337#false} is VALID [2018-11-23 12:16:58,982 INFO L273 TraceCheckUtils]: 99: Hoare triple {7337#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7337#false} is VALID [2018-11-23 12:16:58,982 INFO L273 TraceCheckUtils]: 100: Hoare triple {7337#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7337#false} is VALID [2018-11-23 12:16:58,983 INFO L273 TraceCheckUtils]: 101: Hoare triple {7337#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7337#false} is VALID [2018-11-23 12:16:58,983 INFO L273 TraceCheckUtils]: 102: Hoare triple {7337#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7337#false} is VALID [2018-11-23 12:16:58,983 INFO L273 TraceCheckUtils]: 103: Hoare triple {7337#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7337#false} is VALID [2018-11-23 12:16:58,983 INFO L273 TraceCheckUtils]: 104: Hoare triple {7337#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7337#false} is VALID [2018-11-23 12:16:58,983 INFO L273 TraceCheckUtils]: 105: Hoare triple {7337#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7337#false} is VALID [2018-11-23 12:16:58,983 INFO L273 TraceCheckUtils]: 106: Hoare triple {7337#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7337#false} is VALID [2018-11-23 12:16:58,983 INFO L273 TraceCheckUtils]: 107: Hoare triple {7337#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7337#false} is VALID [2018-11-23 12:16:58,984 INFO L273 TraceCheckUtils]: 108: Hoare triple {7337#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7337#false} is VALID [2018-11-23 12:16:58,984 INFO L273 TraceCheckUtils]: 109: Hoare triple {7337#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7337#false} is VALID [2018-11-23 12:16:58,984 INFO L273 TraceCheckUtils]: 110: Hoare triple {7337#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7337#false} is VALID [2018-11-23 12:16:58,984 INFO L273 TraceCheckUtils]: 111: Hoare triple {7337#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7337#false} is VALID [2018-11-23 12:16:58,984 INFO L273 TraceCheckUtils]: 112: Hoare triple {7337#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7337#false} is VALID [2018-11-23 12:16:58,984 INFO L273 TraceCheckUtils]: 113: Hoare triple {7337#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {7337#false} is VALID [2018-11-23 12:16:58,984 INFO L273 TraceCheckUtils]: 114: Hoare triple {7337#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {7337#false} is VALID [2018-11-23 12:16:58,985 INFO L273 TraceCheckUtils]: 115: Hoare triple {7337#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7337#false} is VALID [2018-11-23 12:16:58,985 INFO L273 TraceCheckUtils]: 116: Hoare triple {7337#false} assume !(~i~0 < 10); {7337#false} is VALID [2018-11-23 12:16:58,985 INFO L273 TraceCheckUtils]: 117: Hoare triple {7337#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {7337#false} is VALID [2018-11-23 12:16:58,985 INFO L273 TraceCheckUtils]: 118: Hoare triple {7337#false} assume true; {7337#false} is VALID [2018-11-23 12:16:58,985 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {7337#false} {7337#false} #79#return; {7337#false} is VALID [2018-11-23 12:16:58,985 INFO L273 TraceCheckUtils]: 120: Hoare triple {7337#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {7337#false} is VALID [2018-11-23 12:16:58,985 INFO L273 TraceCheckUtils]: 121: Hoare triple {7337#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {7337#false} is VALID [2018-11-23 12:16:58,986 INFO L273 TraceCheckUtils]: 122: Hoare triple {7337#false} assume !false; {7337#false} is VALID [2018-11-23 12:16:58,999 INFO L134 CoverageAnalysis]: Checked inductivity of 824 backedges. 326 proven. 70 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2018-11-23 12:16:59,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:16:59,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:16:59,019 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2018-11-23 12:16:59,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:16:59,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:16:59,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:16:59,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:16:59,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:16:59,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:16:59,128 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand 11 states. [2018-11-23 12:16:59,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:59,322 INFO L93 Difference]: Finished difference Result 121 states and 147 transitions. [2018-11-23 12:16:59,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:16:59,322 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2018-11-23 12:16:59,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:16:59,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:16:59,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 89 transitions. [2018-11-23 12:16:59,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:16:59,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 89 transitions. [2018-11-23 12:16:59,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 89 transitions. [2018-11-23 12:16:59,827 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:16:59,828 INFO L225 Difference]: With dead ends: 121 [2018-11-23 12:16:59,828 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 12:16:59,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:16:59,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 12:16:59,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-11-23 12:16:59,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:16:59,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 75 states. [2018-11-23 12:16:59,851 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 75 states. [2018-11-23 12:16:59,851 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 75 states. [2018-11-23 12:16:59,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:59,854 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2018-11-23 12:16:59,854 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2018-11-23 12:16:59,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:59,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:59,854 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 77 states. [2018-11-23 12:16:59,854 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 77 states. [2018-11-23 12:16:59,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:16:59,856 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2018-11-23 12:16:59,856 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2018-11-23 12:16:59,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:16:59,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:16:59,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:16:59,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:16:59,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 12:16:59,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2018-11-23 12:16:59,858 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 123 [2018-11-23 12:16:59,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:16:59,858 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2018-11-23 12:16:59,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:16:59,859 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2018-11-23 12:16:59,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-23 12:16:59,860 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:16:59,860 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 10, 10, 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:16:59,860 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:16:59,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:16:59,861 INFO L82 PathProgramCache]: Analyzing trace with hash -638066878, now seen corresponding path program 14 times [2018-11-23 12:16:59,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:16:59,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:16:59,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:59,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:16:59,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:16:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:00,071 INFO L256 TraceCheckUtils]: 0: Hoare triple {8147#true} call ULTIMATE.init(); {8147#true} is VALID [2018-11-23 12:17:00,071 INFO L273 TraceCheckUtils]: 1: Hoare triple {8147#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8147#true} is VALID [2018-11-23 12:17:00,071 INFO L273 TraceCheckUtils]: 2: Hoare triple {8147#true} assume true; {8147#true} is VALID [2018-11-23 12:17:00,071 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8147#true} {8147#true} #71#return; {8147#true} is VALID [2018-11-23 12:17:00,072 INFO L256 TraceCheckUtils]: 4: Hoare triple {8147#true} call #t~ret14 := main(); {8147#true} is VALID [2018-11-23 12:17:00,072 INFO L273 TraceCheckUtils]: 5: Hoare triple {8147#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {8147#true} is VALID [2018-11-23 12:17:00,072 INFO L273 TraceCheckUtils]: 6: Hoare triple {8147#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8147#true} is VALID [2018-11-23 12:17:00,072 INFO L273 TraceCheckUtils]: 7: Hoare triple {8147#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8147#true} is VALID [2018-11-23 12:17:00,073 INFO L273 TraceCheckUtils]: 8: Hoare triple {8147#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8147#true} is VALID [2018-11-23 12:17:00,073 INFO L273 TraceCheckUtils]: 9: Hoare triple {8147#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8147#true} is VALID [2018-11-23 12:17:00,073 INFO L273 TraceCheckUtils]: 10: Hoare triple {8147#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8147#true} is VALID [2018-11-23 12:17:00,073 INFO L273 TraceCheckUtils]: 11: Hoare triple {8147#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8147#true} is VALID [2018-11-23 12:17:00,073 INFO L273 TraceCheckUtils]: 12: Hoare triple {8147#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8147#true} is VALID [2018-11-23 12:17:00,073 INFO L273 TraceCheckUtils]: 13: Hoare triple {8147#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8147#true} is VALID [2018-11-23 12:17:00,073 INFO L273 TraceCheckUtils]: 14: Hoare triple {8147#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8147#true} is VALID [2018-11-23 12:17:00,073 INFO L273 TraceCheckUtils]: 15: Hoare triple {8147#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8147#true} is VALID [2018-11-23 12:17:00,074 INFO L273 TraceCheckUtils]: 16: Hoare triple {8147#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8147#true} is VALID [2018-11-23 12:17:00,074 INFO L273 TraceCheckUtils]: 17: Hoare triple {8147#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8147#true} is VALID [2018-11-23 12:17:00,074 INFO L273 TraceCheckUtils]: 18: Hoare triple {8147#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8147#true} is VALID [2018-11-23 12:17:00,074 INFO L273 TraceCheckUtils]: 19: Hoare triple {8147#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8147#true} is VALID [2018-11-23 12:17:00,074 INFO L273 TraceCheckUtils]: 20: Hoare triple {8147#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8147#true} is VALID [2018-11-23 12:17:00,074 INFO L273 TraceCheckUtils]: 21: Hoare triple {8147#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8147#true} is VALID [2018-11-23 12:17:00,074 INFO L273 TraceCheckUtils]: 22: Hoare triple {8147#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8147#true} is VALID [2018-11-23 12:17:00,074 INFO L273 TraceCheckUtils]: 23: Hoare triple {8147#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8147#true} is VALID [2018-11-23 12:17:00,074 INFO L273 TraceCheckUtils]: 24: Hoare triple {8147#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8147#true} is VALID [2018-11-23 12:17:00,075 INFO L273 TraceCheckUtils]: 25: Hoare triple {8147#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8147#true} is VALID [2018-11-23 12:17:00,075 INFO L273 TraceCheckUtils]: 26: Hoare triple {8147#true} assume !(~i~1 < 10); {8147#true} is VALID [2018-11-23 12:17:00,075 INFO L256 TraceCheckUtils]: 27: Hoare triple {8147#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {8147#true} is VALID [2018-11-23 12:17:00,075 INFO L273 TraceCheckUtils]: 28: Hoare triple {8147#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {8149#(= sep_~i~0 0)} is VALID [2018-11-23 12:17:00,075 INFO L273 TraceCheckUtils]: 29: Hoare triple {8149#(= sep_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8149#(= sep_~i~0 0)} is VALID [2018-11-23 12:17:00,076 INFO L273 TraceCheckUtils]: 30: Hoare triple {8149#(= 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; {8149#(= sep_~i~0 0)} is VALID [2018-11-23 12:17:00,076 INFO L273 TraceCheckUtils]: 31: Hoare triple {8149#(= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8150#(<= sep_~i~0 1)} is VALID [2018-11-23 12:17:00,077 INFO L273 TraceCheckUtils]: 32: Hoare triple {8150#(<= sep_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8150#(<= sep_~i~0 1)} is VALID [2018-11-23 12:17:00,077 INFO L273 TraceCheckUtils]: 33: Hoare triple {8150#(<= 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; {8150#(<= sep_~i~0 1)} is VALID [2018-11-23 12:17:00,077 INFO L273 TraceCheckUtils]: 34: Hoare triple {8150#(<= sep_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8151#(<= sep_~i~0 2)} is VALID [2018-11-23 12:17:00,078 INFO L273 TraceCheckUtils]: 35: Hoare triple {8151#(<= sep_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8151#(<= sep_~i~0 2)} is VALID [2018-11-23 12:17:00,078 INFO L273 TraceCheckUtils]: 36: Hoare triple {8151#(<= 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; {8151#(<= sep_~i~0 2)} is VALID [2018-11-23 12:17:00,078 INFO L273 TraceCheckUtils]: 37: Hoare triple {8151#(<= sep_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8152#(<= sep_~i~0 3)} is VALID [2018-11-23 12:17:00,079 INFO L273 TraceCheckUtils]: 38: Hoare triple {8152#(<= sep_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8152#(<= sep_~i~0 3)} is VALID [2018-11-23 12:17:00,079 INFO L273 TraceCheckUtils]: 39: Hoare triple {8152#(<= 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; {8152#(<= sep_~i~0 3)} is VALID [2018-11-23 12:17:00,080 INFO L273 TraceCheckUtils]: 40: Hoare triple {8152#(<= sep_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8153#(<= sep_~i~0 4)} is VALID [2018-11-23 12:17:00,081 INFO L273 TraceCheckUtils]: 41: Hoare triple {8153#(<= sep_~i~0 4)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8153#(<= sep_~i~0 4)} is VALID [2018-11-23 12:17:00,081 INFO L273 TraceCheckUtils]: 42: Hoare triple {8153#(<= 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; {8153#(<= sep_~i~0 4)} is VALID [2018-11-23 12:17:00,082 INFO L273 TraceCheckUtils]: 43: Hoare triple {8153#(<= sep_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8154#(<= sep_~i~0 5)} is VALID [2018-11-23 12:17:00,082 INFO L273 TraceCheckUtils]: 44: Hoare triple {8154#(<= sep_~i~0 5)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8154#(<= sep_~i~0 5)} is VALID [2018-11-23 12:17:00,083 INFO L273 TraceCheckUtils]: 45: Hoare triple {8154#(<= 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; {8154#(<= sep_~i~0 5)} is VALID [2018-11-23 12:17:00,084 INFO L273 TraceCheckUtils]: 46: Hoare triple {8154#(<= sep_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8155#(<= sep_~i~0 6)} is VALID [2018-11-23 12:17:00,084 INFO L273 TraceCheckUtils]: 47: Hoare triple {8155#(<= sep_~i~0 6)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8155#(<= sep_~i~0 6)} is VALID [2018-11-23 12:17:00,085 INFO L273 TraceCheckUtils]: 48: Hoare triple {8155#(<= 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; {8155#(<= sep_~i~0 6)} is VALID [2018-11-23 12:17:00,085 INFO L273 TraceCheckUtils]: 49: Hoare triple {8155#(<= sep_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8156#(<= sep_~i~0 7)} is VALID [2018-11-23 12:17:00,086 INFO L273 TraceCheckUtils]: 50: Hoare triple {8156#(<= sep_~i~0 7)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8156#(<= sep_~i~0 7)} is VALID [2018-11-23 12:17:00,086 INFO L273 TraceCheckUtils]: 51: Hoare triple {8156#(<= 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; {8156#(<= sep_~i~0 7)} is VALID [2018-11-23 12:17:00,087 INFO L273 TraceCheckUtils]: 52: Hoare triple {8156#(<= sep_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8157#(<= sep_~i~0 8)} is VALID [2018-11-23 12:17:00,088 INFO L273 TraceCheckUtils]: 53: Hoare triple {8157#(<= sep_~i~0 8)} assume !(~i~0 < 10); {8148#false} is VALID [2018-11-23 12:17:00,088 INFO L273 TraceCheckUtils]: 54: Hoare triple {8148#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8148#false} is VALID [2018-11-23 12:17:00,088 INFO L273 TraceCheckUtils]: 55: Hoare triple {8148#false} assume true; {8148#false} is VALID [2018-11-23 12:17:00,088 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {8148#false} {8147#true} #75#return; {8148#false} is VALID [2018-11-23 12:17:00,089 INFO L273 TraceCheckUtils]: 57: Hoare triple {8148#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); {8148#false} is VALID [2018-11-23 12:17:00,089 INFO L256 TraceCheckUtils]: 58: Hoare triple {8148#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {8147#true} is VALID [2018-11-23 12:17:00,089 INFO L273 TraceCheckUtils]: 59: Hoare triple {8147#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {8147#true} is VALID [2018-11-23 12:17:00,089 INFO L273 TraceCheckUtils]: 60: Hoare triple {8147#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8147#true} is VALID [2018-11-23 12:17:00,089 INFO L273 TraceCheckUtils]: 61: Hoare triple {8147#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8147#true} is VALID [2018-11-23 12:17:00,090 INFO L273 TraceCheckUtils]: 62: Hoare triple {8147#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8147#true} is VALID [2018-11-23 12:17:00,090 INFO L273 TraceCheckUtils]: 63: Hoare triple {8147#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8147#true} is VALID [2018-11-23 12:17:00,090 INFO L273 TraceCheckUtils]: 64: Hoare triple {8147#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8147#true} is VALID [2018-11-23 12:17:00,090 INFO L273 TraceCheckUtils]: 65: Hoare triple {8147#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8147#true} is VALID [2018-11-23 12:17:00,090 INFO L273 TraceCheckUtils]: 66: Hoare triple {8147#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8147#true} is VALID [2018-11-23 12:17:00,091 INFO L273 TraceCheckUtils]: 67: Hoare triple {8147#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8147#true} is VALID [2018-11-23 12:17:00,091 INFO L273 TraceCheckUtils]: 68: Hoare triple {8147#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8147#true} is VALID [2018-11-23 12:17:00,091 INFO L273 TraceCheckUtils]: 69: Hoare triple {8147#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8147#true} is VALID [2018-11-23 12:17:00,091 INFO L273 TraceCheckUtils]: 70: Hoare triple {8147#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8147#true} is VALID [2018-11-23 12:17:00,091 INFO L273 TraceCheckUtils]: 71: Hoare triple {8147#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8147#true} is VALID [2018-11-23 12:17:00,091 INFO L273 TraceCheckUtils]: 72: Hoare triple {8147#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8147#true} is VALID [2018-11-23 12:17:00,091 INFO L273 TraceCheckUtils]: 73: Hoare triple {8147#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8147#true} is VALID [2018-11-23 12:17:00,092 INFO L273 TraceCheckUtils]: 74: Hoare triple {8147#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8147#true} is VALID [2018-11-23 12:17:00,092 INFO L273 TraceCheckUtils]: 75: Hoare triple {8147#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8147#true} is VALID [2018-11-23 12:17:00,092 INFO L273 TraceCheckUtils]: 76: Hoare triple {8147#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8147#true} is VALID [2018-11-23 12:17:00,092 INFO L273 TraceCheckUtils]: 77: Hoare triple {8147#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8147#true} is VALID [2018-11-23 12:17:00,092 INFO L273 TraceCheckUtils]: 78: Hoare triple {8147#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8147#true} is VALID [2018-11-23 12:17:00,092 INFO L273 TraceCheckUtils]: 79: Hoare triple {8147#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8147#true} is VALID [2018-11-23 12:17:00,092 INFO L273 TraceCheckUtils]: 80: Hoare triple {8147#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8147#true} is VALID [2018-11-23 12:17:00,092 INFO L273 TraceCheckUtils]: 81: Hoare triple {8147#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8147#true} is VALID [2018-11-23 12:17:00,092 INFO L273 TraceCheckUtils]: 82: Hoare triple {8147#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8147#true} is VALID [2018-11-23 12:17:00,093 INFO L273 TraceCheckUtils]: 83: Hoare triple {8147#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8147#true} is VALID [2018-11-23 12:17:00,093 INFO L273 TraceCheckUtils]: 84: Hoare triple {8147#true} assume !(~i~0 < 10); {8147#true} is VALID [2018-11-23 12:17:00,093 INFO L273 TraceCheckUtils]: 85: Hoare triple {8147#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8147#true} is VALID [2018-11-23 12:17:00,093 INFO L273 TraceCheckUtils]: 86: Hoare triple {8147#true} assume true; {8147#true} is VALID [2018-11-23 12:17:00,093 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {8147#true} {8148#false} #77#return; {8148#false} is VALID [2018-11-23 12:17:00,093 INFO L273 TraceCheckUtils]: 88: Hoare triple {8148#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; {8148#false} is VALID [2018-11-23 12:17:00,093 INFO L273 TraceCheckUtils]: 89: Hoare triple {8148#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {8148#false} is VALID [2018-11-23 12:17:00,093 INFO L273 TraceCheckUtils]: 90: Hoare triple {8148#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {8148#false} is VALID [2018-11-23 12:17:00,093 INFO L273 TraceCheckUtils]: 91: Hoare triple {8148#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {8148#false} is VALID [2018-11-23 12:17:00,094 INFO L273 TraceCheckUtils]: 92: Hoare triple {8148#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {8148#false} is VALID [2018-11-23 12:17:00,094 INFO L273 TraceCheckUtils]: 93: Hoare triple {8148#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {8148#false} is VALID [2018-11-23 12:17:00,094 INFO L273 TraceCheckUtils]: 94: Hoare triple {8148#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {8148#false} is VALID [2018-11-23 12:17:00,094 INFO L273 TraceCheckUtils]: 95: Hoare triple {8148#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {8148#false} is VALID [2018-11-23 12:17:00,094 INFO L273 TraceCheckUtils]: 96: Hoare triple {8148#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {8148#false} is VALID [2018-11-23 12:17:00,094 INFO L273 TraceCheckUtils]: 97: Hoare triple {8148#false} assume !(~i~2 < 9); {8148#false} is VALID [2018-11-23 12:17:00,094 INFO L273 TraceCheckUtils]: 98: Hoare triple {8148#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {8148#false} is VALID [2018-11-23 12:17:00,094 INFO L256 TraceCheckUtils]: 99: Hoare triple {8148#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {8147#true} is VALID [2018-11-23 12:17:00,094 INFO L273 TraceCheckUtils]: 100: Hoare triple {8147#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {8147#true} is VALID [2018-11-23 12:17:00,095 INFO L273 TraceCheckUtils]: 101: Hoare triple {8147#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8147#true} is VALID [2018-11-23 12:17:00,095 INFO L273 TraceCheckUtils]: 102: Hoare triple {8147#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8147#true} is VALID [2018-11-23 12:17:00,095 INFO L273 TraceCheckUtils]: 103: Hoare triple {8147#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8147#true} is VALID [2018-11-23 12:17:00,095 INFO L273 TraceCheckUtils]: 104: Hoare triple {8147#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8147#true} is VALID [2018-11-23 12:17:00,095 INFO L273 TraceCheckUtils]: 105: Hoare triple {8147#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8147#true} is VALID [2018-11-23 12:17:00,095 INFO L273 TraceCheckUtils]: 106: Hoare triple {8147#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8147#true} is VALID [2018-11-23 12:17:00,095 INFO L273 TraceCheckUtils]: 107: Hoare triple {8147#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8147#true} is VALID [2018-11-23 12:17:00,095 INFO L273 TraceCheckUtils]: 108: Hoare triple {8147#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8147#true} is VALID [2018-11-23 12:17:00,096 INFO L273 TraceCheckUtils]: 109: Hoare triple {8147#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8147#true} is VALID [2018-11-23 12:17:00,096 INFO L273 TraceCheckUtils]: 110: Hoare triple {8147#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8147#true} is VALID [2018-11-23 12:17:00,096 INFO L273 TraceCheckUtils]: 111: Hoare triple {8147#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8147#true} is VALID [2018-11-23 12:17:00,096 INFO L273 TraceCheckUtils]: 112: Hoare triple {8147#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8147#true} is VALID [2018-11-23 12:17:00,096 INFO L273 TraceCheckUtils]: 113: Hoare triple {8147#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8147#true} is VALID [2018-11-23 12:17:00,096 INFO L273 TraceCheckUtils]: 114: Hoare triple {8147#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8147#true} is VALID [2018-11-23 12:17:00,096 INFO L273 TraceCheckUtils]: 115: Hoare triple {8147#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8147#true} is VALID [2018-11-23 12:17:00,096 INFO L273 TraceCheckUtils]: 116: Hoare triple {8147#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8147#true} is VALID [2018-11-23 12:17:00,096 INFO L273 TraceCheckUtils]: 117: Hoare triple {8147#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8147#true} is VALID [2018-11-23 12:17:00,097 INFO L273 TraceCheckUtils]: 118: Hoare triple {8147#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8147#true} is VALID [2018-11-23 12:17:00,097 INFO L273 TraceCheckUtils]: 119: Hoare triple {8147#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8147#true} is VALID [2018-11-23 12:17:00,097 INFO L273 TraceCheckUtils]: 120: Hoare triple {8147#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8147#true} is VALID [2018-11-23 12:17:00,097 INFO L273 TraceCheckUtils]: 121: Hoare triple {8147#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8147#true} is VALID [2018-11-23 12:17:00,097 INFO L273 TraceCheckUtils]: 122: Hoare triple {8147#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8147#true} is VALID [2018-11-23 12:17:00,097 INFO L273 TraceCheckUtils]: 123: Hoare triple {8147#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8147#true} is VALID [2018-11-23 12:17:00,097 INFO L273 TraceCheckUtils]: 124: Hoare triple {8147#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8147#true} is VALID [2018-11-23 12:17:00,097 INFO L273 TraceCheckUtils]: 125: Hoare triple {8147#true} assume !(~i~0 < 10); {8147#true} is VALID [2018-11-23 12:17:00,097 INFO L273 TraceCheckUtils]: 126: Hoare triple {8147#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8147#true} is VALID [2018-11-23 12:17:00,098 INFO L273 TraceCheckUtils]: 127: Hoare triple {8147#true} assume true; {8147#true} is VALID [2018-11-23 12:17:00,098 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {8147#true} {8148#false} #79#return; {8148#false} is VALID [2018-11-23 12:17:00,098 INFO L273 TraceCheckUtils]: 129: Hoare triple {8148#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {8148#false} is VALID [2018-11-23 12:17:00,098 INFO L273 TraceCheckUtils]: 130: Hoare triple {8148#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {8148#false} is VALID [2018-11-23 12:17:00,098 INFO L273 TraceCheckUtils]: 131: Hoare triple {8148#false} assume !false; {8148#false} is VALID [2018-11-23 12:17:00,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 0 proven. 516 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2018-11-23 12:17:00,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:00,105 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:00,113 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:17:00,192 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:17:00,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:00,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:00,449 INFO L256 TraceCheckUtils]: 0: Hoare triple {8147#true} call ULTIMATE.init(); {8147#true} is VALID [2018-11-23 12:17:00,449 INFO L273 TraceCheckUtils]: 1: Hoare triple {8147#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8147#true} is VALID [2018-11-23 12:17:00,449 INFO L273 TraceCheckUtils]: 2: Hoare triple {8147#true} assume true; {8147#true} is VALID [2018-11-23 12:17:00,449 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8147#true} {8147#true} #71#return; {8147#true} is VALID [2018-11-23 12:17:00,450 INFO L256 TraceCheckUtils]: 4: Hoare triple {8147#true} call #t~ret14 := main(); {8147#true} is VALID [2018-11-23 12:17:00,450 INFO L273 TraceCheckUtils]: 5: Hoare triple {8147#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {8147#true} is VALID [2018-11-23 12:17:00,450 INFO L273 TraceCheckUtils]: 6: Hoare triple {8147#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8147#true} is VALID [2018-11-23 12:17:00,450 INFO L273 TraceCheckUtils]: 7: Hoare triple {8147#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8147#true} is VALID [2018-11-23 12:17:00,450 INFO L273 TraceCheckUtils]: 8: Hoare triple {8147#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8147#true} is VALID [2018-11-23 12:17:00,451 INFO L273 TraceCheckUtils]: 9: Hoare triple {8147#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8147#true} is VALID [2018-11-23 12:17:00,451 INFO L273 TraceCheckUtils]: 10: Hoare triple {8147#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8147#true} is VALID [2018-11-23 12:17:00,451 INFO L273 TraceCheckUtils]: 11: Hoare triple {8147#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8147#true} is VALID [2018-11-23 12:17:00,451 INFO L273 TraceCheckUtils]: 12: Hoare triple {8147#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8147#true} is VALID [2018-11-23 12:17:00,451 INFO L273 TraceCheckUtils]: 13: Hoare triple {8147#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8147#true} is VALID [2018-11-23 12:17:00,451 INFO L273 TraceCheckUtils]: 14: Hoare triple {8147#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8147#true} is VALID [2018-11-23 12:17:00,451 INFO L273 TraceCheckUtils]: 15: Hoare triple {8147#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8147#true} is VALID [2018-11-23 12:17:00,451 INFO L273 TraceCheckUtils]: 16: Hoare triple {8147#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8147#true} is VALID [2018-11-23 12:17:00,452 INFO L273 TraceCheckUtils]: 17: Hoare triple {8147#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8147#true} is VALID [2018-11-23 12:17:00,452 INFO L273 TraceCheckUtils]: 18: Hoare triple {8147#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8147#true} is VALID [2018-11-23 12:17:00,452 INFO L273 TraceCheckUtils]: 19: Hoare triple {8147#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8147#true} is VALID [2018-11-23 12:17:00,452 INFO L273 TraceCheckUtils]: 20: Hoare triple {8147#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8147#true} is VALID [2018-11-23 12:17:00,452 INFO L273 TraceCheckUtils]: 21: Hoare triple {8147#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8147#true} is VALID [2018-11-23 12:17:00,452 INFO L273 TraceCheckUtils]: 22: Hoare triple {8147#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8147#true} is VALID [2018-11-23 12:17:00,452 INFO L273 TraceCheckUtils]: 23: Hoare triple {8147#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8147#true} is VALID [2018-11-23 12:17:00,452 INFO L273 TraceCheckUtils]: 24: Hoare triple {8147#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {8147#true} is VALID [2018-11-23 12:17:00,452 INFO L273 TraceCheckUtils]: 25: Hoare triple {8147#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8147#true} is VALID [2018-11-23 12:17:00,453 INFO L273 TraceCheckUtils]: 26: Hoare triple {8147#true} assume !(~i~1 < 10); {8147#true} is VALID [2018-11-23 12:17:00,453 INFO L256 TraceCheckUtils]: 27: Hoare triple {8147#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {8147#true} is VALID [2018-11-23 12:17:00,453 INFO L273 TraceCheckUtils]: 28: Hoare triple {8147#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {8245#(<= sep_~i~0 0)} is VALID [2018-11-23 12:17:00,454 INFO L273 TraceCheckUtils]: 29: Hoare triple {8245#(<= sep_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8245#(<= sep_~i~0 0)} is VALID [2018-11-23 12:17:00,454 INFO L273 TraceCheckUtils]: 30: Hoare triple {8245#(<= 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; {8245#(<= sep_~i~0 0)} is VALID [2018-11-23 12:17:00,454 INFO L273 TraceCheckUtils]: 31: Hoare triple {8245#(<= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8150#(<= sep_~i~0 1)} is VALID [2018-11-23 12:17:00,455 INFO L273 TraceCheckUtils]: 32: Hoare triple {8150#(<= sep_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8150#(<= sep_~i~0 1)} is VALID [2018-11-23 12:17:00,455 INFO L273 TraceCheckUtils]: 33: Hoare triple {8150#(<= 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; {8150#(<= sep_~i~0 1)} is VALID [2018-11-23 12:17:00,456 INFO L273 TraceCheckUtils]: 34: Hoare triple {8150#(<= sep_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8151#(<= sep_~i~0 2)} is VALID [2018-11-23 12:17:00,456 INFO L273 TraceCheckUtils]: 35: Hoare triple {8151#(<= sep_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8151#(<= sep_~i~0 2)} is VALID [2018-11-23 12:17:00,457 INFO L273 TraceCheckUtils]: 36: Hoare triple {8151#(<= 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; {8151#(<= sep_~i~0 2)} is VALID [2018-11-23 12:17:00,457 INFO L273 TraceCheckUtils]: 37: Hoare triple {8151#(<= sep_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8152#(<= sep_~i~0 3)} is VALID [2018-11-23 12:17:00,458 INFO L273 TraceCheckUtils]: 38: Hoare triple {8152#(<= sep_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8152#(<= sep_~i~0 3)} is VALID [2018-11-23 12:17:00,458 INFO L273 TraceCheckUtils]: 39: Hoare triple {8152#(<= 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; {8152#(<= sep_~i~0 3)} is VALID [2018-11-23 12:17:00,459 INFO L273 TraceCheckUtils]: 40: Hoare triple {8152#(<= sep_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8153#(<= sep_~i~0 4)} is VALID [2018-11-23 12:17:00,460 INFO L273 TraceCheckUtils]: 41: Hoare triple {8153#(<= sep_~i~0 4)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8153#(<= sep_~i~0 4)} is VALID [2018-11-23 12:17:00,460 INFO L273 TraceCheckUtils]: 42: Hoare triple {8153#(<= 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; {8153#(<= sep_~i~0 4)} is VALID [2018-11-23 12:17:00,461 INFO L273 TraceCheckUtils]: 43: Hoare triple {8153#(<= sep_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8154#(<= sep_~i~0 5)} is VALID [2018-11-23 12:17:00,461 INFO L273 TraceCheckUtils]: 44: Hoare triple {8154#(<= sep_~i~0 5)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8154#(<= sep_~i~0 5)} is VALID [2018-11-23 12:17:00,462 INFO L273 TraceCheckUtils]: 45: Hoare triple {8154#(<= 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; {8154#(<= sep_~i~0 5)} is VALID [2018-11-23 12:17:00,463 INFO L273 TraceCheckUtils]: 46: Hoare triple {8154#(<= sep_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8155#(<= sep_~i~0 6)} is VALID [2018-11-23 12:17:00,463 INFO L273 TraceCheckUtils]: 47: Hoare triple {8155#(<= sep_~i~0 6)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8155#(<= sep_~i~0 6)} is VALID [2018-11-23 12:17:00,464 INFO L273 TraceCheckUtils]: 48: Hoare triple {8155#(<= 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; {8155#(<= sep_~i~0 6)} is VALID [2018-11-23 12:17:00,465 INFO L273 TraceCheckUtils]: 49: Hoare triple {8155#(<= sep_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8156#(<= sep_~i~0 7)} is VALID [2018-11-23 12:17:00,465 INFO L273 TraceCheckUtils]: 50: Hoare triple {8156#(<= sep_~i~0 7)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8156#(<= sep_~i~0 7)} is VALID [2018-11-23 12:17:00,466 INFO L273 TraceCheckUtils]: 51: Hoare triple {8156#(<= 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; {8156#(<= sep_~i~0 7)} is VALID [2018-11-23 12:17:00,466 INFO L273 TraceCheckUtils]: 52: Hoare triple {8156#(<= sep_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8157#(<= sep_~i~0 8)} is VALID [2018-11-23 12:17:00,467 INFO L273 TraceCheckUtils]: 53: Hoare triple {8157#(<= sep_~i~0 8)} assume !(~i~0 < 10); {8148#false} is VALID [2018-11-23 12:17:00,467 INFO L273 TraceCheckUtils]: 54: Hoare triple {8148#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8148#false} is VALID [2018-11-23 12:17:00,468 INFO L273 TraceCheckUtils]: 55: Hoare triple {8148#false} assume true; {8148#false} is VALID [2018-11-23 12:17:00,468 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {8148#false} {8147#true} #75#return; {8148#false} is VALID [2018-11-23 12:17:00,468 INFO L273 TraceCheckUtils]: 57: Hoare triple {8148#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); {8148#false} is VALID [2018-11-23 12:17:00,468 INFO L256 TraceCheckUtils]: 58: Hoare triple {8148#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {8148#false} is VALID [2018-11-23 12:17:00,468 INFO L273 TraceCheckUtils]: 59: Hoare triple {8148#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {8148#false} is VALID [2018-11-23 12:17:00,469 INFO L273 TraceCheckUtils]: 60: Hoare triple {8148#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8148#false} is VALID [2018-11-23 12:17:00,469 INFO L273 TraceCheckUtils]: 61: Hoare triple {8148#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8148#false} is VALID [2018-11-23 12:17:00,469 INFO L273 TraceCheckUtils]: 62: Hoare triple {8148#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8148#false} is VALID [2018-11-23 12:17:00,469 INFO L273 TraceCheckUtils]: 63: Hoare triple {8148#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8148#false} is VALID [2018-11-23 12:17:00,469 INFO L273 TraceCheckUtils]: 64: Hoare triple {8148#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8148#false} is VALID [2018-11-23 12:17:00,470 INFO L273 TraceCheckUtils]: 65: Hoare triple {8148#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8148#false} is VALID [2018-11-23 12:17:00,470 INFO L273 TraceCheckUtils]: 66: Hoare triple {8148#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8148#false} is VALID [2018-11-23 12:17:00,470 INFO L273 TraceCheckUtils]: 67: Hoare triple {8148#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8148#false} is VALID [2018-11-23 12:17:00,470 INFO L273 TraceCheckUtils]: 68: Hoare triple {8148#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8148#false} is VALID [2018-11-23 12:17:00,470 INFO L273 TraceCheckUtils]: 69: Hoare triple {8148#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8148#false} is VALID [2018-11-23 12:17:00,471 INFO L273 TraceCheckUtils]: 70: Hoare triple {8148#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8148#false} is VALID [2018-11-23 12:17:00,471 INFO L273 TraceCheckUtils]: 71: Hoare triple {8148#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8148#false} is VALID [2018-11-23 12:17:00,471 INFO L273 TraceCheckUtils]: 72: Hoare triple {8148#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8148#false} is VALID [2018-11-23 12:17:00,471 INFO L273 TraceCheckUtils]: 73: Hoare triple {8148#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8148#false} is VALID [2018-11-23 12:17:00,471 INFO L273 TraceCheckUtils]: 74: Hoare triple {8148#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8148#false} is VALID [2018-11-23 12:17:00,472 INFO L273 TraceCheckUtils]: 75: Hoare triple {8148#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8148#false} is VALID [2018-11-23 12:17:00,472 INFO L273 TraceCheckUtils]: 76: Hoare triple {8148#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8148#false} is VALID [2018-11-23 12:17:00,472 INFO L273 TraceCheckUtils]: 77: Hoare triple {8148#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8148#false} is VALID [2018-11-23 12:17:00,472 INFO L273 TraceCheckUtils]: 78: Hoare triple {8148#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8148#false} is VALID [2018-11-23 12:17:00,472 INFO L273 TraceCheckUtils]: 79: Hoare triple {8148#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8148#false} is VALID [2018-11-23 12:17:00,472 INFO L273 TraceCheckUtils]: 80: Hoare triple {8148#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8148#false} is VALID [2018-11-23 12:17:00,472 INFO L273 TraceCheckUtils]: 81: Hoare triple {8148#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8148#false} is VALID [2018-11-23 12:17:00,472 INFO L273 TraceCheckUtils]: 82: Hoare triple {8148#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8148#false} is VALID [2018-11-23 12:17:00,472 INFO L273 TraceCheckUtils]: 83: Hoare triple {8148#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8148#false} is VALID [2018-11-23 12:17:00,473 INFO L273 TraceCheckUtils]: 84: Hoare triple {8148#false} assume !(~i~0 < 10); {8148#false} is VALID [2018-11-23 12:17:00,473 INFO L273 TraceCheckUtils]: 85: Hoare triple {8148#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8148#false} is VALID [2018-11-23 12:17:00,473 INFO L273 TraceCheckUtils]: 86: Hoare triple {8148#false} assume true; {8148#false} is VALID [2018-11-23 12:17:00,473 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {8148#false} {8148#false} #77#return; {8148#false} is VALID [2018-11-23 12:17:00,473 INFO L273 TraceCheckUtils]: 88: Hoare triple {8148#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; {8148#false} is VALID [2018-11-23 12:17:00,473 INFO L273 TraceCheckUtils]: 89: Hoare triple {8148#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {8148#false} is VALID [2018-11-23 12:17:00,473 INFO L273 TraceCheckUtils]: 90: Hoare triple {8148#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {8148#false} is VALID [2018-11-23 12:17:00,473 INFO L273 TraceCheckUtils]: 91: Hoare triple {8148#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {8148#false} is VALID [2018-11-23 12:17:00,473 INFO L273 TraceCheckUtils]: 92: Hoare triple {8148#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {8148#false} is VALID [2018-11-23 12:17:00,474 INFO L273 TraceCheckUtils]: 93: Hoare triple {8148#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {8148#false} is VALID [2018-11-23 12:17:00,474 INFO L273 TraceCheckUtils]: 94: Hoare triple {8148#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {8148#false} is VALID [2018-11-23 12:17:00,474 INFO L273 TraceCheckUtils]: 95: Hoare triple {8148#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {8148#false} is VALID [2018-11-23 12:17:00,474 INFO L273 TraceCheckUtils]: 96: Hoare triple {8148#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {8148#false} is VALID [2018-11-23 12:17:00,474 INFO L273 TraceCheckUtils]: 97: Hoare triple {8148#false} assume !(~i~2 < 9); {8148#false} is VALID [2018-11-23 12:17:00,474 INFO L273 TraceCheckUtils]: 98: Hoare triple {8148#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {8148#false} is VALID [2018-11-23 12:17:00,474 INFO L256 TraceCheckUtils]: 99: Hoare triple {8148#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {8148#false} is VALID [2018-11-23 12:17:00,474 INFO L273 TraceCheckUtils]: 100: Hoare triple {8148#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {8148#false} is VALID [2018-11-23 12:17:00,475 INFO L273 TraceCheckUtils]: 101: Hoare triple {8148#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8148#false} is VALID [2018-11-23 12:17:00,475 INFO L273 TraceCheckUtils]: 102: Hoare triple {8148#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8148#false} is VALID [2018-11-23 12:17:00,475 INFO L273 TraceCheckUtils]: 103: Hoare triple {8148#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8148#false} is VALID [2018-11-23 12:17:00,475 INFO L273 TraceCheckUtils]: 104: Hoare triple {8148#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8148#false} is VALID [2018-11-23 12:17:00,475 INFO L273 TraceCheckUtils]: 105: Hoare triple {8148#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8148#false} is VALID [2018-11-23 12:17:00,475 INFO L273 TraceCheckUtils]: 106: Hoare triple {8148#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8148#false} is VALID [2018-11-23 12:17:00,475 INFO L273 TraceCheckUtils]: 107: Hoare triple {8148#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8148#false} is VALID [2018-11-23 12:17:00,475 INFO L273 TraceCheckUtils]: 108: Hoare triple {8148#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8148#false} is VALID [2018-11-23 12:17:00,475 INFO L273 TraceCheckUtils]: 109: Hoare triple {8148#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8148#false} is VALID [2018-11-23 12:17:00,476 INFO L273 TraceCheckUtils]: 110: Hoare triple {8148#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8148#false} is VALID [2018-11-23 12:17:00,476 INFO L273 TraceCheckUtils]: 111: Hoare triple {8148#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8148#false} is VALID [2018-11-23 12:17:00,476 INFO L273 TraceCheckUtils]: 112: Hoare triple {8148#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8148#false} is VALID [2018-11-23 12:17:00,476 INFO L273 TraceCheckUtils]: 113: Hoare triple {8148#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8148#false} is VALID [2018-11-23 12:17:00,476 INFO L273 TraceCheckUtils]: 114: Hoare triple {8148#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8148#false} is VALID [2018-11-23 12:17:00,476 INFO L273 TraceCheckUtils]: 115: Hoare triple {8148#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8148#false} is VALID [2018-11-23 12:17:00,476 INFO L273 TraceCheckUtils]: 116: Hoare triple {8148#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8148#false} is VALID [2018-11-23 12:17:00,476 INFO L273 TraceCheckUtils]: 117: Hoare triple {8148#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8148#false} is VALID [2018-11-23 12:17:00,476 INFO L273 TraceCheckUtils]: 118: Hoare triple {8148#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8148#false} is VALID [2018-11-23 12:17:00,477 INFO L273 TraceCheckUtils]: 119: Hoare triple {8148#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8148#false} is VALID [2018-11-23 12:17:00,477 INFO L273 TraceCheckUtils]: 120: Hoare triple {8148#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8148#false} is VALID [2018-11-23 12:17:00,477 INFO L273 TraceCheckUtils]: 121: Hoare triple {8148#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8148#false} is VALID [2018-11-23 12:17:00,477 INFO L273 TraceCheckUtils]: 122: Hoare triple {8148#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {8148#false} is VALID [2018-11-23 12:17:00,477 INFO L273 TraceCheckUtils]: 123: Hoare triple {8148#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {8148#false} is VALID [2018-11-23 12:17:00,477 INFO L273 TraceCheckUtils]: 124: Hoare triple {8148#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {8148#false} is VALID [2018-11-23 12:17:00,477 INFO L273 TraceCheckUtils]: 125: Hoare triple {8148#false} assume !(~i~0 < 10); {8148#false} is VALID [2018-11-23 12:17:00,477 INFO L273 TraceCheckUtils]: 126: Hoare triple {8148#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {8148#false} is VALID [2018-11-23 12:17:00,477 INFO L273 TraceCheckUtils]: 127: Hoare triple {8148#false} assume true; {8148#false} is VALID [2018-11-23 12:17:00,478 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {8148#false} {8148#false} #79#return; {8148#false} is VALID [2018-11-23 12:17:00,478 INFO L273 TraceCheckUtils]: 129: Hoare triple {8148#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {8148#false} is VALID [2018-11-23 12:17:00,478 INFO L273 TraceCheckUtils]: 130: Hoare triple {8148#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {8148#false} is VALID [2018-11-23 12:17:00,478 INFO L273 TraceCheckUtils]: 131: Hoare triple {8148#false} assume !false; {8148#false} is VALID [2018-11-23 12:17:00,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 420 proven. 92 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2018-11-23 12:17:00,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:00,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:17:00,505 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 132 [2018-11-23 12:17:00,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:00,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:17:00,575 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:17:00,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:17:00,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:17:00,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:17:00,576 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 12 states. [2018-11-23 12:17:01,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:01,119 INFO L93 Difference]: Finished difference Result 127 states and 155 transitions. [2018-11-23 12:17:01,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:17:01,119 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 132 [2018-11-23 12:17:01,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:01,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:17:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 93 transitions. [2018-11-23 12:17:01,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:17:01,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 93 transitions. [2018-11-23 12:17:01,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 93 transitions. [2018-11-23 12:17:01,220 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:01,222 INFO L225 Difference]: With dead ends: 127 [2018-11-23 12:17:01,222 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 12:17:01,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:17:01,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 12:17:01,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-11-23 12:17:01,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:01,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 78 states. [2018-11-23 12:17:01,255 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 78 states. [2018-11-23 12:17:01,255 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 78 states. [2018-11-23 12:17:01,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:01,257 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-11-23 12:17:01,257 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2018-11-23 12:17:01,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:01,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:01,258 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 80 states. [2018-11-23 12:17:01,258 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 80 states. [2018-11-23 12:17:01,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:01,260 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-11-23 12:17:01,260 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2018-11-23 12:17:01,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:01,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:01,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:01,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:01,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 12:17:01,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2018-11-23 12:17:01,262 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 132 [2018-11-23 12:17:01,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:01,263 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2018-11-23 12:17:01,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:17:01,263 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2018-11-23 12:17:01,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-23 12:17:01,264 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:01,264 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 10, 10, 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:01,264 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:01,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:01,265 INFO L82 PathProgramCache]: Analyzing trace with hash -720039853, now seen corresponding path program 15 times [2018-11-23 12:17:01,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:01,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:01,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:01,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:01,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:01,508 INFO L256 TraceCheckUtils]: 0: Hoare triple {9004#true} call ULTIMATE.init(); {9004#true} is VALID [2018-11-23 12:17:01,509 INFO L273 TraceCheckUtils]: 1: Hoare triple {9004#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9004#true} is VALID [2018-11-23 12:17:01,509 INFO L273 TraceCheckUtils]: 2: Hoare triple {9004#true} assume true; {9004#true} is VALID [2018-11-23 12:17:01,509 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9004#true} {9004#true} #71#return; {9004#true} is VALID [2018-11-23 12:17:01,509 INFO L256 TraceCheckUtils]: 4: Hoare triple {9004#true} call #t~ret14 := main(); {9004#true} is VALID [2018-11-23 12:17:01,509 INFO L273 TraceCheckUtils]: 5: Hoare triple {9004#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9004#true} is VALID [2018-11-23 12:17:01,510 INFO L273 TraceCheckUtils]: 6: Hoare triple {9004#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9004#true} is VALID [2018-11-23 12:17:01,510 INFO L273 TraceCheckUtils]: 7: Hoare triple {9004#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9004#true} is VALID [2018-11-23 12:17:01,510 INFO L273 TraceCheckUtils]: 8: Hoare triple {9004#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9004#true} is VALID [2018-11-23 12:17:01,510 INFO L273 TraceCheckUtils]: 9: Hoare triple {9004#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9004#true} is VALID [2018-11-23 12:17:01,510 INFO L273 TraceCheckUtils]: 10: Hoare triple {9004#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9004#true} is VALID [2018-11-23 12:17:01,511 INFO L273 TraceCheckUtils]: 11: Hoare triple {9004#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9004#true} is VALID [2018-11-23 12:17:01,511 INFO L273 TraceCheckUtils]: 12: Hoare triple {9004#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9004#true} is VALID [2018-11-23 12:17:01,511 INFO L273 TraceCheckUtils]: 13: Hoare triple {9004#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9004#true} is VALID [2018-11-23 12:17:01,511 INFO L273 TraceCheckUtils]: 14: Hoare triple {9004#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9004#true} is VALID [2018-11-23 12:17:01,511 INFO L273 TraceCheckUtils]: 15: Hoare triple {9004#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9004#true} is VALID [2018-11-23 12:17:01,511 INFO L273 TraceCheckUtils]: 16: Hoare triple {9004#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9004#true} is VALID [2018-11-23 12:17:01,511 INFO L273 TraceCheckUtils]: 17: Hoare triple {9004#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9004#true} is VALID [2018-11-23 12:17:01,511 INFO L273 TraceCheckUtils]: 18: Hoare triple {9004#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9004#true} is VALID [2018-11-23 12:17:01,512 INFO L273 TraceCheckUtils]: 19: Hoare triple {9004#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9004#true} is VALID [2018-11-23 12:17:01,512 INFO L273 TraceCheckUtils]: 20: Hoare triple {9004#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9004#true} is VALID [2018-11-23 12:17:01,512 INFO L273 TraceCheckUtils]: 21: Hoare triple {9004#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9004#true} is VALID [2018-11-23 12:17:01,512 INFO L273 TraceCheckUtils]: 22: Hoare triple {9004#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9004#true} is VALID [2018-11-23 12:17:01,512 INFO L273 TraceCheckUtils]: 23: Hoare triple {9004#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9004#true} is VALID [2018-11-23 12:17:01,512 INFO L273 TraceCheckUtils]: 24: Hoare triple {9004#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9004#true} is VALID [2018-11-23 12:17:01,512 INFO L273 TraceCheckUtils]: 25: Hoare triple {9004#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9004#true} is VALID [2018-11-23 12:17:01,512 INFO L273 TraceCheckUtils]: 26: Hoare triple {9004#true} assume !(~i~1 < 10); {9004#true} is VALID [2018-11-23 12:17:01,512 INFO L256 TraceCheckUtils]: 27: Hoare triple {9004#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {9004#true} is VALID [2018-11-23 12:17:01,513 INFO L273 TraceCheckUtils]: 28: Hoare triple {9004#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {9006#(= sep_~i~0 0)} is VALID [2018-11-23 12:17:01,513 INFO L273 TraceCheckUtils]: 29: Hoare triple {9006#(= sep_~i~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9006#(= sep_~i~0 0)} is VALID [2018-11-23 12:17:01,513 INFO L273 TraceCheckUtils]: 30: Hoare triple {9006#(= 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; {9006#(= sep_~i~0 0)} is VALID [2018-11-23 12:17:01,514 INFO L273 TraceCheckUtils]: 31: Hoare triple {9006#(= sep_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9007#(<= sep_~i~0 1)} is VALID [2018-11-23 12:17:01,514 INFO L273 TraceCheckUtils]: 32: Hoare triple {9007#(<= sep_~i~0 1)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9007#(<= sep_~i~0 1)} is VALID [2018-11-23 12:17:01,515 INFO L273 TraceCheckUtils]: 33: Hoare triple {9007#(<= 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; {9007#(<= sep_~i~0 1)} is VALID [2018-11-23 12:17:01,515 INFO L273 TraceCheckUtils]: 34: Hoare triple {9007#(<= sep_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9008#(<= sep_~i~0 2)} is VALID [2018-11-23 12:17:01,515 INFO L273 TraceCheckUtils]: 35: Hoare triple {9008#(<= sep_~i~0 2)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9008#(<= sep_~i~0 2)} is VALID [2018-11-23 12:17:01,516 INFO L273 TraceCheckUtils]: 36: Hoare triple {9008#(<= 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; {9008#(<= sep_~i~0 2)} is VALID [2018-11-23 12:17:01,516 INFO L273 TraceCheckUtils]: 37: Hoare triple {9008#(<= sep_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9009#(<= sep_~i~0 3)} is VALID [2018-11-23 12:17:01,516 INFO L273 TraceCheckUtils]: 38: Hoare triple {9009#(<= sep_~i~0 3)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9009#(<= sep_~i~0 3)} is VALID [2018-11-23 12:17:01,517 INFO L273 TraceCheckUtils]: 39: Hoare triple {9009#(<= 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; {9009#(<= sep_~i~0 3)} is VALID [2018-11-23 12:17:01,518 INFO L273 TraceCheckUtils]: 40: Hoare triple {9009#(<= sep_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9010#(<= sep_~i~0 4)} is VALID [2018-11-23 12:17:01,518 INFO L273 TraceCheckUtils]: 41: Hoare triple {9010#(<= sep_~i~0 4)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9010#(<= sep_~i~0 4)} is VALID [2018-11-23 12:17:01,519 INFO L273 TraceCheckUtils]: 42: Hoare triple {9010#(<= 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; {9010#(<= sep_~i~0 4)} is VALID [2018-11-23 12:17:01,519 INFO L273 TraceCheckUtils]: 43: Hoare triple {9010#(<= sep_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9011#(<= sep_~i~0 5)} is VALID [2018-11-23 12:17:01,520 INFO L273 TraceCheckUtils]: 44: Hoare triple {9011#(<= sep_~i~0 5)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9011#(<= sep_~i~0 5)} is VALID [2018-11-23 12:17:01,520 INFO L273 TraceCheckUtils]: 45: Hoare triple {9011#(<= 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; {9011#(<= sep_~i~0 5)} is VALID [2018-11-23 12:17:01,521 INFO L273 TraceCheckUtils]: 46: Hoare triple {9011#(<= sep_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9012#(<= sep_~i~0 6)} is VALID [2018-11-23 12:17:01,522 INFO L273 TraceCheckUtils]: 47: Hoare triple {9012#(<= sep_~i~0 6)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9012#(<= sep_~i~0 6)} is VALID [2018-11-23 12:17:01,522 INFO L273 TraceCheckUtils]: 48: Hoare triple {9012#(<= 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; {9012#(<= sep_~i~0 6)} is VALID [2018-11-23 12:17:01,523 INFO L273 TraceCheckUtils]: 49: Hoare triple {9012#(<= sep_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9013#(<= sep_~i~0 7)} is VALID [2018-11-23 12:17:01,523 INFO L273 TraceCheckUtils]: 50: Hoare triple {9013#(<= sep_~i~0 7)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9013#(<= sep_~i~0 7)} is VALID [2018-11-23 12:17:01,524 INFO L273 TraceCheckUtils]: 51: Hoare triple {9013#(<= 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; {9013#(<= sep_~i~0 7)} is VALID [2018-11-23 12:17:01,525 INFO L273 TraceCheckUtils]: 52: Hoare triple {9013#(<= sep_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9014#(<= sep_~i~0 8)} is VALID [2018-11-23 12:17:01,525 INFO L273 TraceCheckUtils]: 53: Hoare triple {9014#(<= sep_~i~0 8)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9014#(<= sep_~i~0 8)} is VALID [2018-11-23 12:17:01,526 INFO L273 TraceCheckUtils]: 54: Hoare triple {9014#(<= 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; {9014#(<= sep_~i~0 8)} is VALID [2018-11-23 12:17:01,527 INFO L273 TraceCheckUtils]: 55: Hoare triple {9014#(<= sep_~i~0 8)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9015#(<= sep_~i~0 9)} is VALID [2018-11-23 12:17:01,527 INFO L273 TraceCheckUtils]: 56: Hoare triple {9015#(<= sep_~i~0 9)} assume !(~i~0 < 10); {9005#false} is VALID [2018-11-23 12:17:01,527 INFO L273 TraceCheckUtils]: 57: Hoare triple {9005#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9005#false} is VALID [2018-11-23 12:17:01,528 INFO L273 TraceCheckUtils]: 58: Hoare triple {9005#false} assume true; {9005#false} is VALID [2018-11-23 12:17:01,528 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {9005#false} {9004#true} #75#return; {9005#false} is VALID [2018-11-23 12:17:01,528 INFO L273 TraceCheckUtils]: 60: Hoare triple {9005#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); {9005#false} is VALID [2018-11-23 12:17:01,528 INFO L256 TraceCheckUtils]: 61: Hoare triple {9005#false} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {9004#true} is VALID [2018-11-23 12:17:01,528 INFO L273 TraceCheckUtils]: 62: Hoare triple {9004#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {9004#true} is VALID [2018-11-23 12:17:01,529 INFO L273 TraceCheckUtils]: 63: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,529 INFO L273 TraceCheckUtils]: 64: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,529 INFO L273 TraceCheckUtils]: 65: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,529 INFO L273 TraceCheckUtils]: 66: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,529 INFO L273 TraceCheckUtils]: 67: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,530 INFO L273 TraceCheckUtils]: 68: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,530 INFO L273 TraceCheckUtils]: 69: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,530 INFO L273 TraceCheckUtils]: 70: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,530 INFO L273 TraceCheckUtils]: 71: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,530 INFO L273 TraceCheckUtils]: 72: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,531 INFO L273 TraceCheckUtils]: 73: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,531 INFO L273 TraceCheckUtils]: 74: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,531 INFO L273 TraceCheckUtils]: 75: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,531 INFO L273 TraceCheckUtils]: 76: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,531 INFO L273 TraceCheckUtils]: 77: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,532 INFO L273 TraceCheckUtils]: 78: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,532 INFO L273 TraceCheckUtils]: 79: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,532 INFO L273 TraceCheckUtils]: 80: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,532 INFO L273 TraceCheckUtils]: 81: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,532 INFO L273 TraceCheckUtils]: 82: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,532 INFO L273 TraceCheckUtils]: 83: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,532 INFO L273 TraceCheckUtils]: 84: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,532 INFO L273 TraceCheckUtils]: 85: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,533 INFO L273 TraceCheckUtils]: 86: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,533 INFO L273 TraceCheckUtils]: 87: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,533 INFO L273 TraceCheckUtils]: 88: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,533 INFO L273 TraceCheckUtils]: 89: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,533 INFO L273 TraceCheckUtils]: 90: Hoare triple {9004#true} assume !(~i~0 < 10); {9004#true} is VALID [2018-11-23 12:17:01,533 INFO L273 TraceCheckUtils]: 91: Hoare triple {9004#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9004#true} is VALID [2018-11-23 12:17:01,533 INFO L273 TraceCheckUtils]: 92: Hoare triple {9004#true} assume true; {9004#true} is VALID [2018-11-23 12:17:01,533 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {9004#true} {9005#false} #77#return; {9005#false} is VALID [2018-11-23 12:17:01,533 INFO L273 TraceCheckUtils]: 94: Hoare triple {9005#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; {9005#false} is VALID [2018-11-23 12:17:01,534 INFO L273 TraceCheckUtils]: 95: Hoare triple {9005#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9005#false} is VALID [2018-11-23 12:17:01,534 INFO L273 TraceCheckUtils]: 96: Hoare triple {9005#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9005#false} is VALID [2018-11-23 12:17:01,534 INFO L273 TraceCheckUtils]: 97: Hoare triple {9005#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9005#false} is VALID [2018-11-23 12:17:01,534 INFO L273 TraceCheckUtils]: 98: Hoare triple {9005#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9005#false} is VALID [2018-11-23 12:17:01,534 INFO L273 TraceCheckUtils]: 99: Hoare triple {9005#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9005#false} is VALID [2018-11-23 12:17:01,534 INFO L273 TraceCheckUtils]: 100: Hoare triple {9005#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9005#false} is VALID [2018-11-23 12:17:01,535 INFO L273 TraceCheckUtils]: 101: Hoare triple {9005#false} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9005#false} is VALID [2018-11-23 12:17:01,535 INFO L273 TraceCheckUtils]: 102: Hoare triple {9005#false} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9005#false} is VALID [2018-11-23 12:17:01,535 INFO L273 TraceCheckUtils]: 103: Hoare triple {9005#false} assume !(~i~2 < 9); {9005#false} is VALID [2018-11-23 12:17:01,535 INFO L273 TraceCheckUtils]: 104: Hoare triple {9005#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {9005#false} is VALID [2018-11-23 12:17:01,535 INFO L256 TraceCheckUtils]: 105: Hoare triple {9005#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {9004#true} is VALID [2018-11-23 12:17:01,536 INFO L273 TraceCheckUtils]: 106: Hoare triple {9004#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {9004#true} is VALID [2018-11-23 12:17:01,536 INFO L273 TraceCheckUtils]: 107: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,536 INFO L273 TraceCheckUtils]: 108: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,536 INFO L273 TraceCheckUtils]: 109: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,536 INFO L273 TraceCheckUtils]: 110: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,536 INFO L273 TraceCheckUtils]: 111: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,537 INFO L273 TraceCheckUtils]: 112: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,537 INFO L273 TraceCheckUtils]: 113: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,537 INFO L273 TraceCheckUtils]: 114: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,537 INFO L273 TraceCheckUtils]: 115: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,537 INFO L273 TraceCheckUtils]: 116: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,537 INFO L273 TraceCheckUtils]: 117: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,538 INFO L273 TraceCheckUtils]: 118: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,538 INFO L273 TraceCheckUtils]: 119: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,538 INFO L273 TraceCheckUtils]: 120: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,538 INFO L273 TraceCheckUtils]: 121: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,538 INFO L273 TraceCheckUtils]: 122: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,538 INFO L273 TraceCheckUtils]: 123: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,539 INFO L273 TraceCheckUtils]: 124: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,539 INFO L273 TraceCheckUtils]: 125: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,539 INFO L273 TraceCheckUtils]: 126: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,539 INFO L273 TraceCheckUtils]: 127: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,539 INFO L273 TraceCheckUtils]: 128: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,539 INFO L273 TraceCheckUtils]: 129: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,540 INFO L273 TraceCheckUtils]: 130: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,540 INFO L273 TraceCheckUtils]: 131: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,540 INFO L273 TraceCheckUtils]: 132: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,540 INFO L273 TraceCheckUtils]: 133: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,540 INFO L273 TraceCheckUtils]: 134: Hoare triple {9004#true} assume !(~i~0 < 10); {9004#true} is VALID [2018-11-23 12:17:01,540 INFO L273 TraceCheckUtils]: 135: Hoare triple {9004#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9004#true} is VALID [2018-11-23 12:17:01,541 INFO L273 TraceCheckUtils]: 136: Hoare triple {9004#true} assume true; {9004#true} is VALID [2018-11-23 12:17:01,541 INFO L268 TraceCheckUtils]: 137: Hoare quadruple {9004#true} {9005#false} #79#return; {9005#false} is VALID [2018-11-23 12:17:01,541 INFO L273 TraceCheckUtils]: 138: Hoare triple {9005#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {9005#false} is VALID [2018-11-23 12:17:01,541 INFO L273 TraceCheckUtils]: 139: Hoare triple {9005#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {9005#false} is VALID [2018-11-23 12:17:01,541 INFO L273 TraceCheckUtils]: 140: Hoare triple {9005#false} assume !false; {9005#false} is VALID [2018-11-23 12:17:01,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 647 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2018-11-23 12:17:01,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:01,552 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:01,568 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:17:01,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:17:01,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:01,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:01,824 INFO L256 TraceCheckUtils]: 0: Hoare triple {9004#true} call ULTIMATE.init(); {9004#true} is VALID [2018-11-23 12:17:01,824 INFO L273 TraceCheckUtils]: 1: Hoare triple {9004#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9004#true} is VALID [2018-11-23 12:17:01,824 INFO L273 TraceCheckUtils]: 2: Hoare triple {9004#true} assume true; {9004#true} is VALID [2018-11-23 12:17:01,825 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9004#true} {9004#true} #71#return; {9004#true} is VALID [2018-11-23 12:17:01,825 INFO L256 TraceCheckUtils]: 4: Hoare triple {9004#true} call #t~ret14 := main(); {9004#true} is VALID [2018-11-23 12:17:01,825 INFO L273 TraceCheckUtils]: 5: Hoare triple {9004#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9004#true} is VALID [2018-11-23 12:17:01,825 INFO L273 TraceCheckUtils]: 6: Hoare triple {9004#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9004#true} is VALID [2018-11-23 12:17:01,825 INFO L273 TraceCheckUtils]: 7: Hoare triple {9004#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9004#true} is VALID [2018-11-23 12:17:01,826 INFO L273 TraceCheckUtils]: 8: Hoare triple {9004#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9004#true} is VALID [2018-11-23 12:17:01,826 INFO L273 TraceCheckUtils]: 9: Hoare triple {9004#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9004#true} is VALID [2018-11-23 12:17:01,826 INFO L273 TraceCheckUtils]: 10: Hoare triple {9004#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9004#true} is VALID [2018-11-23 12:17:01,826 INFO L273 TraceCheckUtils]: 11: Hoare triple {9004#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9004#true} is VALID [2018-11-23 12:17:01,826 INFO L273 TraceCheckUtils]: 12: Hoare triple {9004#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9004#true} is VALID [2018-11-23 12:17:01,827 INFO L273 TraceCheckUtils]: 13: Hoare triple {9004#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9004#true} is VALID [2018-11-23 12:17:01,827 INFO L273 TraceCheckUtils]: 14: Hoare triple {9004#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9004#true} is VALID [2018-11-23 12:17:01,827 INFO L273 TraceCheckUtils]: 15: Hoare triple {9004#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9004#true} is VALID [2018-11-23 12:17:01,827 INFO L273 TraceCheckUtils]: 16: Hoare triple {9004#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9004#true} is VALID [2018-11-23 12:17:01,827 INFO L273 TraceCheckUtils]: 17: Hoare triple {9004#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9004#true} is VALID [2018-11-23 12:17:01,827 INFO L273 TraceCheckUtils]: 18: Hoare triple {9004#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9004#true} is VALID [2018-11-23 12:17:01,827 INFO L273 TraceCheckUtils]: 19: Hoare triple {9004#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9004#true} is VALID [2018-11-23 12:17:01,828 INFO L273 TraceCheckUtils]: 20: Hoare triple {9004#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9004#true} is VALID [2018-11-23 12:17:01,828 INFO L273 TraceCheckUtils]: 21: Hoare triple {9004#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9004#true} is VALID [2018-11-23 12:17:01,828 INFO L273 TraceCheckUtils]: 22: Hoare triple {9004#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9004#true} is VALID [2018-11-23 12:17:01,828 INFO L273 TraceCheckUtils]: 23: Hoare triple {9004#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9004#true} is VALID [2018-11-23 12:17:01,828 INFO L273 TraceCheckUtils]: 24: Hoare triple {9004#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9004#true} is VALID [2018-11-23 12:17:01,828 INFO L273 TraceCheckUtils]: 25: Hoare triple {9004#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9004#true} is VALID [2018-11-23 12:17:01,828 INFO L273 TraceCheckUtils]: 26: Hoare triple {9004#true} assume !(~i~1 < 10); {9004#true} is VALID [2018-11-23 12:17:01,828 INFO L256 TraceCheckUtils]: 27: Hoare triple {9004#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {9004#true} is VALID [2018-11-23 12:17:01,828 INFO L273 TraceCheckUtils]: 28: Hoare triple {9004#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {9004#true} is VALID [2018-11-23 12:17:01,829 INFO L273 TraceCheckUtils]: 29: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,829 INFO L273 TraceCheckUtils]: 30: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,829 INFO L273 TraceCheckUtils]: 31: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,829 INFO L273 TraceCheckUtils]: 32: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,829 INFO L273 TraceCheckUtils]: 33: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,829 INFO L273 TraceCheckUtils]: 34: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,829 INFO L273 TraceCheckUtils]: 35: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,829 INFO L273 TraceCheckUtils]: 36: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,829 INFO L273 TraceCheckUtils]: 37: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,830 INFO L273 TraceCheckUtils]: 38: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,830 INFO L273 TraceCheckUtils]: 39: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,830 INFO L273 TraceCheckUtils]: 40: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,830 INFO L273 TraceCheckUtils]: 41: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,830 INFO L273 TraceCheckUtils]: 42: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,830 INFO L273 TraceCheckUtils]: 43: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,830 INFO L273 TraceCheckUtils]: 44: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,830 INFO L273 TraceCheckUtils]: 45: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,831 INFO L273 TraceCheckUtils]: 46: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,831 INFO L273 TraceCheckUtils]: 47: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,831 INFO L273 TraceCheckUtils]: 48: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,831 INFO L273 TraceCheckUtils]: 49: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,831 INFO L273 TraceCheckUtils]: 50: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,831 INFO L273 TraceCheckUtils]: 51: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,831 INFO L273 TraceCheckUtils]: 52: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,831 INFO L273 TraceCheckUtils]: 53: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,831 INFO L273 TraceCheckUtils]: 54: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,832 INFO L273 TraceCheckUtils]: 55: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,832 INFO L273 TraceCheckUtils]: 56: Hoare triple {9004#true} assume !(~i~0 < 10); {9004#true} is VALID [2018-11-23 12:17:01,832 INFO L273 TraceCheckUtils]: 57: Hoare triple {9004#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9004#true} is VALID [2018-11-23 12:17:01,832 INFO L273 TraceCheckUtils]: 58: Hoare triple {9004#true} assume true; {9004#true} is VALID [2018-11-23 12:17:01,832 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {9004#true} {9004#true} #75#return; {9004#true} is VALID [2018-11-23 12:17:01,832 INFO L273 TraceCheckUtils]: 60: Hoare triple {9004#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); {9004#true} is VALID [2018-11-23 12:17:01,832 INFO L256 TraceCheckUtils]: 61: Hoare triple {9004#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {9004#true} is VALID [2018-11-23 12:17:01,832 INFO L273 TraceCheckUtils]: 62: Hoare triple {9004#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {9004#true} is VALID [2018-11-23 12:17:01,833 INFO L273 TraceCheckUtils]: 63: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,833 INFO L273 TraceCheckUtils]: 64: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,833 INFO L273 TraceCheckUtils]: 65: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,833 INFO L273 TraceCheckUtils]: 66: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,833 INFO L273 TraceCheckUtils]: 67: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,833 INFO L273 TraceCheckUtils]: 68: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,833 INFO L273 TraceCheckUtils]: 69: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,833 INFO L273 TraceCheckUtils]: 70: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,833 INFO L273 TraceCheckUtils]: 71: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,834 INFO L273 TraceCheckUtils]: 72: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,834 INFO L273 TraceCheckUtils]: 73: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,834 INFO L273 TraceCheckUtils]: 74: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,834 INFO L273 TraceCheckUtils]: 75: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,834 INFO L273 TraceCheckUtils]: 76: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,834 INFO L273 TraceCheckUtils]: 77: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,835 INFO L273 TraceCheckUtils]: 78: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,835 INFO L273 TraceCheckUtils]: 79: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,835 INFO L273 TraceCheckUtils]: 80: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,835 INFO L273 TraceCheckUtils]: 81: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,835 INFO L273 TraceCheckUtils]: 82: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,835 INFO L273 TraceCheckUtils]: 83: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,836 INFO L273 TraceCheckUtils]: 84: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,836 INFO L273 TraceCheckUtils]: 85: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,836 INFO L273 TraceCheckUtils]: 86: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,836 INFO L273 TraceCheckUtils]: 87: Hoare triple {9004#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9004#true} is VALID [2018-11-23 12:17:01,836 INFO L273 TraceCheckUtils]: 88: Hoare triple {9004#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9004#true} is VALID [2018-11-23 12:17:01,836 INFO L273 TraceCheckUtils]: 89: Hoare triple {9004#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9004#true} is VALID [2018-11-23 12:17:01,837 INFO L273 TraceCheckUtils]: 90: Hoare triple {9004#true} assume !(~i~0 < 10); {9004#true} is VALID [2018-11-23 12:17:01,837 INFO L273 TraceCheckUtils]: 91: Hoare triple {9004#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9004#true} is VALID [2018-11-23 12:17:01,837 INFO L273 TraceCheckUtils]: 92: Hoare triple {9004#true} assume true; {9004#true} is VALID [2018-11-23 12:17:01,837 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {9004#true} {9004#true} #77#return; {9004#true} is VALID [2018-11-23 12:17:01,838 INFO L273 TraceCheckUtils]: 94: Hoare triple {9004#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; {9301#(<= main_~i~2 0)} is VALID [2018-11-23 12:17:01,839 INFO L273 TraceCheckUtils]: 95: Hoare triple {9301#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9301#(<= main_~i~2 0)} is VALID [2018-11-23 12:17:01,840 INFO L273 TraceCheckUtils]: 96: Hoare triple {9301#(<= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9308#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:01,840 INFO L273 TraceCheckUtils]: 97: Hoare triple {9308#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9308#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:01,843 INFO L273 TraceCheckUtils]: 98: Hoare triple {9308#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9315#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:01,843 INFO L273 TraceCheckUtils]: 99: Hoare triple {9315#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9315#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:01,843 INFO L273 TraceCheckUtils]: 100: Hoare triple {9315#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9322#(<= main_~i~2 3)} is VALID [2018-11-23 12:17:01,844 INFO L273 TraceCheckUtils]: 101: Hoare triple {9322#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9322#(<= main_~i~2 3)} is VALID [2018-11-23 12:17:01,844 INFO L273 TraceCheckUtils]: 102: Hoare triple {9322#(<= main_~i~2 3)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9329#(<= main_~i~2 4)} is VALID [2018-11-23 12:17:01,845 INFO L273 TraceCheckUtils]: 103: Hoare triple {9329#(<= main_~i~2 4)} assume !(~i~2 < 9); {9005#false} is VALID [2018-11-23 12:17:01,845 INFO L273 TraceCheckUtils]: 104: Hoare triple {9005#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {9005#false} is VALID [2018-11-23 12:17:01,845 INFO L256 TraceCheckUtils]: 105: Hoare triple {9005#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {9005#false} is VALID [2018-11-23 12:17:01,845 INFO L273 TraceCheckUtils]: 106: Hoare triple {9005#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {9005#false} is VALID [2018-11-23 12:17:01,845 INFO L273 TraceCheckUtils]: 107: Hoare triple {9005#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9005#false} is VALID [2018-11-23 12:17:01,845 INFO L273 TraceCheckUtils]: 108: Hoare triple {9005#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9005#false} is VALID [2018-11-23 12:17:01,845 INFO L273 TraceCheckUtils]: 109: Hoare triple {9005#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9005#false} is VALID [2018-11-23 12:17:01,845 INFO L273 TraceCheckUtils]: 110: Hoare triple {9005#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9005#false} is VALID [2018-11-23 12:17:01,846 INFO L273 TraceCheckUtils]: 111: Hoare triple {9005#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9005#false} is VALID [2018-11-23 12:17:01,846 INFO L273 TraceCheckUtils]: 112: Hoare triple {9005#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9005#false} is VALID [2018-11-23 12:17:01,846 INFO L273 TraceCheckUtils]: 113: Hoare triple {9005#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9005#false} is VALID [2018-11-23 12:17:01,846 INFO L273 TraceCheckUtils]: 114: Hoare triple {9005#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9005#false} is VALID [2018-11-23 12:17:01,846 INFO L273 TraceCheckUtils]: 115: Hoare triple {9005#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9005#false} is VALID [2018-11-23 12:17:01,846 INFO L273 TraceCheckUtils]: 116: Hoare triple {9005#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9005#false} is VALID [2018-11-23 12:17:01,846 INFO L273 TraceCheckUtils]: 117: Hoare triple {9005#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9005#false} is VALID [2018-11-23 12:17:01,846 INFO L273 TraceCheckUtils]: 118: Hoare triple {9005#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9005#false} is VALID [2018-11-23 12:17:01,846 INFO L273 TraceCheckUtils]: 119: Hoare triple {9005#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9005#false} is VALID [2018-11-23 12:17:01,847 INFO L273 TraceCheckUtils]: 120: Hoare triple {9005#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9005#false} is VALID [2018-11-23 12:17:01,847 INFO L273 TraceCheckUtils]: 121: Hoare triple {9005#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9005#false} is VALID [2018-11-23 12:17:01,847 INFO L273 TraceCheckUtils]: 122: Hoare triple {9005#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9005#false} is VALID [2018-11-23 12:17:01,847 INFO L273 TraceCheckUtils]: 123: Hoare triple {9005#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9005#false} is VALID [2018-11-23 12:17:01,847 INFO L273 TraceCheckUtils]: 124: Hoare triple {9005#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9005#false} is VALID [2018-11-23 12:17:01,847 INFO L273 TraceCheckUtils]: 125: Hoare triple {9005#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9005#false} is VALID [2018-11-23 12:17:01,847 INFO L273 TraceCheckUtils]: 126: Hoare triple {9005#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9005#false} is VALID [2018-11-23 12:17:01,847 INFO L273 TraceCheckUtils]: 127: Hoare triple {9005#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9005#false} is VALID [2018-11-23 12:17:01,848 INFO L273 TraceCheckUtils]: 128: Hoare triple {9005#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9005#false} is VALID [2018-11-23 12:17:01,848 INFO L273 TraceCheckUtils]: 129: Hoare triple {9005#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9005#false} is VALID [2018-11-23 12:17:01,848 INFO L273 TraceCheckUtils]: 130: Hoare triple {9005#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9005#false} is VALID [2018-11-23 12:17:01,848 INFO L273 TraceCheckUtils]: 131: Hoare triple {9005#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9005#false} is VALID [2018-11-23 12:17:01,848 INFO L273 TraceCheckUtils]: 132: Hoare triple {9005#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9005#false} is VALID [2018-11-23 12:17:01,849 INFO L273 TraceCheckUtils]: 133: Hoare triple {9005#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9005#false} is VALID [2018-11-23 12:17:01,849 INFO L273 TraceCheckUtils]: 134: Hoare triple {9005#false} assume !(~i~0 < 10); {9005#false} is VALID [2018-11-23 12:17:01,849 INFO L273 TraceCheckUtils]: 135: Hoare triple {9005#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9005#false} is VALID [2018-11-23 12:17:01,849 INFO L273 TraceCheckUtils]: 136: Hoare triple {9005#false} assume true; {9005#false} is VALID [2018-11-23 12:17:01,849 INFO L268 TraceCheckUtils]: 137: Hoare quadruple {9005#false} {9005#false} #79#return; {9005#false} is VALID [2018-11-23 12:17:01,849 INFO L273 TraceCheckUtils]: 138: Hoare triple {9005#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {9005#false} is VALID [2018-11-23 12:17:01,850 INFO L273 TraceCheckUtils]: 139: Hoare triple {9005#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {9005#false} is VALID [2018-11-23 12:17:01,850 INFO L273 TraceCheckUtils]: 140: Hoare triple {9005#false} assume !false; {9005#false} is VALID [2018-11-23 12:17:01,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 532 proven. 16 refuted. 0 times theorem prover too weak. 717 trivial. 0 not checked. [2018-11-23 12:17:01,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:01,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2018-11-23 12:17:01,876 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 141 [2018-11-23 12:17:01,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:01,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:17:01,959 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:01,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:17:01,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:17:01,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:17:01,961 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand 17 states. [2018-11-23 12:17:02,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:02,758 INFO L93 Difference]: Finished difference Result 134 states and 164 transitions. [2018-11-23 12:17:02,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:17:02,758 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 141 [2018-11-23 12:17:02,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:02,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:17:02,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 105 transitions. [2018-11-23 12:17:02,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:17:02,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 105 transitions. [2018-11-23 12:17:02,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 105 transitions. [2018-11-23 12:17:02,910 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:02,912 INFO L225 Difference]: With dead ends: 134 [2018-11-23 12:17:02,912 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 12:17:02,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:17:02,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 12:17:02,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-11-23 12:17:02,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:02,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 83 states. [2018-11-23 12:17:02,941 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 83 states. [2018-11-23 12:17:02,941 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 83 states. [2018-11-23 12:17:02,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:02,944 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2018-11-23 12:17:02,944 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2018-11-23 12:17:02,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:02,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:02,945 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 84 states. [2018-11-23 12:17:02,945 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 84 states. [2018-11-23 12:17:02,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:02,947 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2018-11-23 12:17:02,947 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2018-11-23 12:17:02,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:02,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:02,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:02,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:02,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 12:17:02,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2018-11-23 12:17:02,950 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 141 [2018-11-23 12:17:02,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:02,950 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2018-11-23 12:17:02,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:17:02,951 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2018-11-23 12:17:02,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-23 12:17:02,952 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:02,952 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 10, 10, 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:02,952 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:02,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:02,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1444910496, now seen corresponding path program 16 times [2018-11-23 12:17:02,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:02,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:02,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:02,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:02,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:03,662 INFO L256 TraceCheckUtils]: 0: Hoare triple {9918#true} call ULTIMATE.init(); {9918#true} is VALID [2018-11-23 12:17:03,662 INFO L273 TraceCheckUtils]: 1: Hoare triple {9918#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9918#true} is VALID [2018-11-23 12:17:03,663 INFO L273 TraceCheckUtils]: 2: Hoare triple {9918#true} assume true; {9918#true} is VALID [2018-11-23 12:17:03,663 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9918#true} {9918#true} #71#return; {9918#true} is VALID [2018-11-23 12:17:03,663 INFO L256 TraceCheckUtils]: 4: Hoare triple {9918#true} call #t~ret14 := main(); {9918#true} is VALID [2018-11-23 12:17:03,663 INFO L273 TraceCheckUtils]: 5: Hoare triple {9918#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9918#true} is VALID [2018-11-23 12:17:03,663 INFO L273 TraceCheckUtils]: 6: Hoare triple {9918#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9918#true} is VALID [2018-11-23 12:17:03,663 INFO L273 TraceCheckUtils]: 7: Hoare triple {9918#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9918#true} is VALID [2018-11-23 12:17:03,663 INFO L273 TraceCheckUtils]: 8: Hoare triple {9918#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9918#true} is VALID [2018-11-23 12:17:03,663 INFO L273 TraceCheckUtils]: 9: Hoare triple {9918#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9918#true} is VALID [2018-11-23 12:17:03,663 INFO L273 TraceCheckUtils]: 10: Hoare triple {9918#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9918#true} is VALID [2018-11-23 12:17:03,664 INFO L273 TraceCheckUtils]: 11: Hoare triple {9918#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9918#true} is VALID [2018-11-23 12:17:03,664 INFO L273 TraceCheckUtils]: 12: Hoare triple {9918#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9918#true} is VALID [2018-11-23 12:17:03,664 INFO L273 TraceCheckUtils]: 13: Hoare triple {9918#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9918#true} is VALID [2018-11-23 12:17:03,664 INFO L273 TraceCheckUtils]: 14: Hoare triple {9918#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9918#true} is VALID [2018-11-23 12:17:03,664 INFO L273 TraceCheckUtils]: 15: Hoare triple {9918#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9918#true} is VALID [2018-11-23 12:17:03,664 INFO L273 TraceCheckUtils]: 16: Hoare triple {9918#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9918#true} is VALID [2018-11-23 12:17:03,664 INFO L273 TraceCheckUtils]: 17: Hoare triple {9918#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9918#true} is VALID [2018-11-23 12:17:03,664 INFO L273 TraceCheckUtils]: 18: Hoare triple {9918#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9918#true} is VALID [2018-11-23 12:17:03,664 INFO L273 TraceCheckUtils]: 19: Hoare triple {9918#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9918#true} is VALID [2018-11-23 12:17:03,665 INFO L273 TraceCheckUtils]: 20: Hoare triple {9918#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9918#true} is VALID [2018-11-23 12:17:03,665 INFO L273 TraceCheckUtils]: 21: Hoare triple {9918#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9918#true} is VALID [2018-11-23 12:17:03,665 INFO L273 TraceCheckUtils]: 22: Hoare triple {9918#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9918#true} is VALID [2018-11-23 12:17:03,665 INFO L273 TraceCheckUtils]: 23: Hoare triple {9918#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9918#true} is VALID [2018-11-23 12:17:03,665 INFO L273 TraceCheckUtils]: 24: Hoare triple {9918#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9918#true} is VALID [2018-11-23 12:17:03,665 INFO L273 TraceCheckUtils]: 25: Hoare triple {9918#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9918#true} is VALID [2018-11-23 12:17:03,665 INFO L273 TraceCheckUtils]: 26: Hoare triple {9918#true} assume !(~i~1 < 10); {9918#true} is VALID [2018-11-23 12:17:03,665 INFO L256 TraceCheckUtils]: 27: Hoare triple {9918#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {9918#true} is VALID [2018-11-23 12:17:03,666 INFO L273 TraceCheckUtils]: 28: Hoare triple {9918#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {9918#true} is VALID [2018-11-23 12:17:03,666 INFO L273 TraceCheckUtils]: 29: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,666 INFO L273 TraceCheckUtils]: 30: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,666 INFO L273 TraceCheckUtils]: 31: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,666 INFO L273 TraceCheckUtils]: 32: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,666 INFO L273 TraceCheckUtils]: 33: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,666 INFO L273 TraceCheckUtils]: 34: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,666 INFO L273 TraceCheckUtils]: 35: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,666 INFO L273 TraceCheckUtils]: 36: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,667 INFO L273 TraceCheckUtils]: 37: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,667 INFO L273 TraceCheckUtils]: 38: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,667 INFO L273 TraceCheckUtils]: 39: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,667 INFO L273 TraceCheckUtils]: 40: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,667 INFO L273 TraceCheckUtils]: 41: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,667 INFO L273 TraceCheckUtils]: 42: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,667 INFO L273 TraceCheckUtils]: 43: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,667 INFO L273 TraceCheckUtils]: 44: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,667 INFO L273 TraceCheckUtils]: 45: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,668 INFO L273 TraceCheckUtils]: 46: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,668 INFO L273 TraceCheckUtils]: 47: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,668 INFO L273 TraceCheckUtils]: 48: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,668 INFO L273 TraceCheckUtils]: 49: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,668 INFO L273 TraceCheckUtils]: 50: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,668 INFO L273 TraceCheckUtils]: 51: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,668 INFO L273 TraceCheckUtils]: 52: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,668 INFO L273 TraceCheckUtils]: 53: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,668 INFO L273 TraceCheckUtils]: 54: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,669 INFO L273 TraceCheckUtils]: 55: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,669 INFO L273 TraceCheckUtils]: 56: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,669 INFO L273 TraceCheckUtils]: 57: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,669 INFO L273 TraceCheckUtils]: 58: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,669 INFO L273 TraceCheckUtils]: 59: Hoare triple {9918#true} assume !(~i~0 < 10); {9918#true} is VALID [2018-11-23 12:17:03,669 INFO L273 TraceCheckUtils]: 60: Hoare triple {9918#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9918#true} is VALID [2018-11-23 12:17:03,669 INFO L273 TraceCheckUtils]: 61: Hoare triple {9918#true} assume true; {9918#true} is VALID [2018-11-23 12:17:03,669 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {9918#true} {9918#true} #75#return; {9918#true} is VALID [2018-11-23 12:17:03,669 INFO L273 TraceCheckUtils]: 63: Hoare triple {9918#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); {9918#true} is VALID [2018-11-23 12:17:03,670 INFO L256 TraceCheckUtils]: 64: Hoare triple {9918#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {9918#true} is VALID [2018-11-23 12:17:03,670 INFO L273 TraceCheckUtils]: 65: Hoare triple {9918#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {9918#true} is VALID [2018-11-23 12:17:03,670 INFO L273 TraceCheckUtils]: 66: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,670 INFO L273 TraceCheckUtils]: 67: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,670 INFO L273 TraceCheckUtils]: 68: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,670 INFO L273 TraceCheckUtils]: 69: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,670 INFO L273 TraceCheckUtils]: 70: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,670 INFO L273 TraceCheckUtils]: 71: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,670 INFO L273 TraceCheckUtils]: 72: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,671 INFO L273 TraceCheckUtils]: 73: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,671 INFO L273 TraceCheckUtils]: 74: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,671 INFO L273 TraceCheckUtils]: 75: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,671 INFO L273 TraceCheckUtils]: 76: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,671 INFO L273 TraceCheckUtils]: 77: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,671 INFO L273 TraceCheckUtils]: 78: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,671 INFO L273 TraceCheckUtils]: 79: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,671 INFO L273 TraceCheckUtils]: 80: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,671 INFO L273 TraceCheckUtils]: 81: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,672 INFO L273 TraceCheckUtils]: 82: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,672 INFO L273 TraceCheckUtils]: 83: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,672 INFO L273 TraceCheckUtils]: 84: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,672 INFO L273 TraceCheckUtils]: 85: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,672 INFO L273 TraceCheckUtils]: 86: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,672 INFO L273 TraceCheckUtils]: 87: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,672 INFO L273 TraceCheckUtils]: 88: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,672 INFO L273 TraceCheckUtils]: 89: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,672 INFO L273 TraceCheckUtils]: 90: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,673 INFO L273 TraceCheckUtils]: 91: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,673 INFO L273 TraceCheckUtils]: 92: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,673 INFO L273 TraceCheckUtils]: 93: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,673 INFO L273 TraceCheckUtils]: 94: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,673 INFO L273 TraceCheckUtils]: 95: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,673 INFO L273 TraceCheckUtils]: 96: Hoare triple {9918#true} assume !(~i~0 < 10); {9918#true} is VALID [2018-11-23 12:17:03,673 INFO L273 TraceCheckUtils]: 97: Hoare triple {9918#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9918#true} is VALID [2018-11-23 12:17:03,673 INFO L273 TraceCheckUtils]: 98: Hoare triple {9918#true} assume true; {9918#true} is VALID [2018-11-23 12:17:03,673 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {9918#true} {9918#true} #77#return; {9918#true} is VALID [2018-11-23 12:17:03,676 INFO L273 TraceCheckUtils]: 100: Hoare triple {9918#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; {9920#(= main_~i~2 0)} is VALID [2018-11-23 12:17:03,676 INFO L273 TraceCheckUtils]: 101: Hoare triple {9920#(= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9920#(= main_~i~2 0)} is VALID [2018-11-23 12:17:03,678 INFO L273 TraceCheckUtils]: 102: Hoare triple {9920#(= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9921#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:03,678 INFO L273 TraceCheckUtils]: 103: Hoare triple {9921#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9921#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:03,681 INFO L273 TraceCheckUtils]: 104: Hoare triple {9921#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9922#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:03,681 INFO L273 TraceCheckUtils]: 105: Hoare triple {9922#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9922#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:03,684 INFO L273 TraceCheckUtils]: 106: Hoare triple {9922#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9923#(<= main_~i~2 3)} is VALID [2018-11-23 12:17:03,684 INFO L273 TraceCheckUtils]: 107: Hoare triple {9923#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9923#(<= main_~i~2 3)} is VALID [2018-11-23 12:17:03,686 INFO L273 TraceCheckUtils]: 108: Hoare triple {9923#(<= main_~i~2 3)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9924#(<= main_~i~2 4)} is VALID [2018-11-23 12:17:03,686 INFO L273 TraceCheckUtils]: 109: Hoare triple {9924#(<= main_~i~2 4)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9924#(<= main_~i~2 4)} is VALID [2018-11-23 12:17:03,688 INFO L273 TraceCheckUtils]: 110: Hoare triple {9924#(<= main_~i~2 4)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9925#(<= main_~i~2 5)} is VALID [2018-11-23 12:17:03,688 INFO L273 TraceCheckUtils]: 111: Hoare triple {9925#(<= main_~i~2 5)} assume !(~i~2 < 9); {9919#false} is VALID [2018-11-23 12:17:03,688 INFO L273 TraceCheckUtils]: 112: Hoare triple {9919#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {9919#false} is VALID [2018-11-23 12:17:03,688 INFO L256 TraceCheckUtils]: 113: Hoare triple {9919#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {9918#true} is VALID [2018-11-23 12:17:03,688 INFO L273 TraceCheckUtils]: 114: Hoare triple {9918#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {9918#true} is VALID [2018-11-23 12:17:03,689 INFO L273 TraceCheckUtils]: 115: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,689 INFO L273 TraceCheckUtils]: 116: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,689 INFO L273 TraceCheckUtils]: 117: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,689 INFO L273 TraceCheckUtils]: 118: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,689 INFO L273 TraceCheckUtils]: 119: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,689 INFO L273 TraceCheckUtils]: 120: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,689 INFO L273 TraceCheckUtils]: 121: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,689 INFO L273 TraceCheckUtils]: 122: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,689 INFO L273 TraceCheckUtils]: 123: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,690 INFO L273 TraceCheckUtils]: 124: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,690 INFO L273 TraceCheckUtils]: 125: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,690 INFO L273 TraceCheckUtils]: 126: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,690 INFO L273 TraceCheckUtils]: 127: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,690 INFO L273 TraceCheckUtils]: 128: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,690 INFO L273 TraceCheckUtils]: 129: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,690 INFO L273 TraceCheckUtils]: 130: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,690 INFO L273 TraceCheckUtils]: 131: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,690 INFO L273 TraceCheckUtils]: 132: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,691 INFO L273 TraceCheckUtils]: 133: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,691 INFO L273 TraceCheckUtils]: 134: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,691 INFO L273 TraceCheckUtils]: 135: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,691 INFO L273 TraceCheckUtils]: 136: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,691 INFO L273 TraceCheckUtils]: 137: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,691 INFO L273 TraceCheckUtils]: 138: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,691 INFO L273 TraceCheckUtils]: 139: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,691 INFO L273 TraceCheckUtils]: 140: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,692 INFO L273 TraceCheckUtils]: 141: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,692 INFO L273 TraceCheckUtils]: 142: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,692 INFO L273 TraceCheckUtils]: 143: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,692 INFO L273 TraceCheckUtils]: 144: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,692 INFO L273 TraceCheckUtils]: 145: Hoare triple {9918#true} assume !(~i~0 < 10); {9918#true} is VALID [2018-11-23 12:17:03,692 INFO L273 TraceCheckUtils]: 146: Hoare triple {9918#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9918#true} is VALID [2018-11-23 12:17:03,692 INFO L273 TraceCheckUtils]: 147: Hoare triple {9918#true} assume true; {9918#true} is VALID [2018-11-23 12:17:03,692 INFO L268 TraceCheckUtils]: 148: Hoare quadruple {9918#true} {9919#false} #79#return; {9919#false} is VALID [2018-11-23 12:17:03,692 INFO L273 TraceCheckUtils]: 149: Hoare triple {9919#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {9919#false} is VALID [2018-11-23 12:17:03,693 INFO L273 TraceCheckUtils]: 150: Hoare triple {9919#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {9919#false} is VALID [2018-11-23 12:17:03,693 INFO L273 TraceCheckUtils]: 151: Hoare triple {9919#false} assume !false; {9919#false} is VALID [2018-11-23 12:17:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1535 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2018-11-23 12:17:03,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:03,701 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:03,711 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:17:03,804 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:17:03,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:03,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:03,994 INFO L256 TraceCheckUtils]: 0: Hoare triple {9918#true} call ULTIMATE.init(); {9918#true} is VALID [2018-11-23 12:17:03,994 INFO L273 TraceCheckUtils]: 1: Hoare triple {9918#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9918#true} is VALID [2018-11-23 12:17:03,995 INFO L273 TraceCheckUtils]: 2: Hoare triple {9918#true} assume true; {9918#true} is VALID [2018-11-23 12:17:03,995 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9918#true} {9918#true} #71#return; {9918#true} is VALID [2018-11-23 12:17:03,995 INFO L256 TraceCheckUtils]: 4: Hoare triple {9918#true} call #t~ret14 := main(); {9918#true} is VALID [2018-11-23 12:17:03,995 INFO L273 TraceCheckUtils]: 5: Hoare triple {9918#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9918#true} is VALID [2018-11-23 12:17:03,995 INFO L273 TraceCheckUtils]: 6: Hoare triple {9918#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9918#true} is VALID [2018-11-23 12:17:03,996 INFO L273 TraceCheckUtils]: 7: Hoare triple {9918#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9918#true} is VALID [2018-11-23 12:17:03,996 INFO L273 TraceCheckUtils]: 8: Hoare triple {9918#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9918#true} is VALID [2018-11-23 12:17:03,996 INFO L273 TraceCheckUtils]: 9: Hoare triple {9918#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9918#true} is VALID [2018-11-23 12:17:03,996 INFO L273 TraceCheckUtils]: 10: Hoare triple {9918#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9918#true} is VALID [2018-11-23 12:17:03,996 INFO L273 TraceCheckUtils]: 11: Hoare triple {9918#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9918#true} is VALID [2018-11-23 12:17:03,997 INFO L273 TraceCheckUtils]: 12: Hoare triple {9918#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9918#true} is VALID [2018-11-23 12:17:03,997 INFO L273 TraceCheckUtils]: 13: Hoare triple {9918#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9918#true} is VALID [2018-11-23 12:17:03,997 INFO L273 TraceCheckUtils]: 14: Hoare triple {9918#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9918#true} is VALID [2018-11-23 12:17:03,997 INFO L273 TraceCheckUtils]: 15: Hoare triple {9918#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9918#true} is VALID [2018-11-23 12:17:03,997 INFO L273 TraceCheckUtils]: 16: Hoare triple {9918#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9918#true} is VALID [2018-11-23 12:17:03,997 INFO L273 TraceCheckUtils]: 17: Hoare triple {9918#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9918#true} is VALID [2018-11-23 12:17:03,998 INFO L273 TraceCheckUtils]: 18: Hoare triple {9918#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9918#true} is VALID [2018-11-23 12:17:03,998 INFO L273 TraceCheckUtils]: 19: Hoare triple {9918#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9918#true} is VALID [2018-11-23 12:17:03,998 INFO L273 TraceCheckUtils]: 20: Hoare triple {9918#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9918#true} is VALID [2018-11-23 12:17:03,998 INFO L273 TraceCheckUtils]: 21: Hoare triple {9918#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9918#true} is VALID [2018-11-23 12:17:03,998 INFO L273 TraceCheckUtils]: 22: Hoare triple {9918#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9918#true} is VALID [2018-11-23 12:17:03,998 INFO L273 TraceCheckUtils]: 23: Hoare triple {9918#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9918#true} is VALID [2018-11-23 12:17:03,999 INFO L273 TraceCheckUtils]: 24: Hoare triple {9918#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {9918#true} is VALID [2018-11-23 12:17:03,999 INFO L273 TraceCheckUtils]: 25: Hoare triple {9918#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9918#true} is VALID [2018-11-23 12:17:03,999 INFO L273 TraceCheckUtils]: 26: Hoare triple {9918#true} assume !(~i~1 < 10); {9918#true} is VALID [2018-11-23 12:17:03,999 INFO L256 TraceCheckUtils]: 27: Hoare triple {9918#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {9918#true} is VALID [2018-11-23 12:17:03,999 INFO L273 TraceCheckUtils]: 28: Hoare triple {9918#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {9918#true} is VALID [2018-11-23 12:17:03,999 INFO L273 TraceCheckUtils]: 29: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:03,999 INFO L273 TraceCheckUtils]: 30: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:03,999 INFO L273 TraceCheckUtils]: 31: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:03,999 INFO L273 TraceCheckUtils]: 32: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:04,000 INFO L273 TraceCheckUtils]: 33: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:04,000 INFO L273 TraceCheckUtils]: 34: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:04,000 INFO L273 TraceCheckUtils]: 35: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:04,000 INFO L273 TraceCheckUtils]: 36: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:04,000 INFO L273 TraceCheckUtils]: 37: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:04,000 INFO L273 TraceCheckUtils]: 38: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:04,000 INFO L273 TraceCheckUtils]: 39: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:04,000 INFO L273 TraceCheckUtils]: 40: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:04,000 INFO L273 TraceCheckUtils]: 41: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:04,001 INFO L273 TraceCheckUtils]: 42: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:04,001 INFO L273 TraceCheckUtils]: 43: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:04,001 INFO L273 TraceCheckUtils]: 44: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:04,001 INFO L273 TraceCheckUtils]: 45: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:04,001 INFO L273 TraceCheckUtils]: 46: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:04,001 INFO L273 TraceCheckUtils]: 47: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:04,001 INFO L273 TraceCheckUtils]: 48: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:04,001 INFO L273 TraceCheckUtils]: 49: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:04,001 INFO L273 TraceCheckUtils]: 50: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:04,002 INFO L273 TraceCheckUtils]: 51: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:04,002 INFO L273 TraceCheckUtils]: 52: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:04,002 INFO L273 TraceCheckUtils]: 53: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:04,002 INFO L273 TraceCheckUtils]: 54: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:04,002 INFO L273 TraceCheckUtils]: 55: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:04,002 INFO L273 TraceCheckUtils]: 56: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:04,002 INFO L273 TraceCheckUtils]: 57: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:04,002 INFO L273 TraceCheckUtils]: 58: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:04,003 INFO L273 TraceCheckUtils]: 59: Hoare triple {9918#true} assume !(~i~0 < 10); {9918#true} is VALID [2018-11-23 12:17:04,003 INFO L273 TraceCheckUtils]: 60: Hoare triple {9918#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9918#true} is VALID [2018-11-23 12:17:04,003 INFO L273 TraceCheckUtils]: 61: Hoare triple {9918#true} assume true; {9918#true} is VALID [2018-11-23 12:17:04,003 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {9918#true} {9918#true} #75#return; {9918#true} is VALID [2018-11-23 12:17:04,003 INFO L273 TraceCheckUtils]: 63: Hoare triple {9918#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); {9918#true} is VALID [2018-11-23 12:17:04,003 INFO L256 TraceCheckUtils]: 64: Hoare triple {9918#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {9918#true} is VALID [2018-11-23 12:17:04,003 INFO L273 TraceCheckUtils]: 65: Hoare triple {9918#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {9918#true} is VALID [2018-11-23 12:17:04,003 INFO L273 TraceCheckUtils]: 66: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:04,003 INFO L273 TraceCheckUtils]: 67: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:04,004 INFO L273 TraceCheckUtils]: 68: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:04,004 INFO L273 TraceCheckUtils]: 69: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:04,004 INFO L273 TraceCheckUtils]: 70: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:04,004 INFO L273 TraceCheckUtils]: 71: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:04,004 INFO L273 TraceCheckUtils]: 72: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:04,004 INFO L273 TraceCheckUtils]: 73: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:04,004 INFO L273 TraceCheckUtils]: 74: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:04,004 INFO L273 TraceCheckUtils]: 75: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:04,004 INFO L273 TraceCheckUtils]: 76: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:04,005 INFO L273 TraceCheckUtils]: 77: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:04,005 INFO L273 TraceCheckUtils]: 78: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:04,005 INFO L273 TraceCheckUtils]: 79: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:04,005 INFO L273 TraceCheckUtils]: 80: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:04,005 INFO L273 TraceCheckUtils]: 81: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:04,005 INFO L273 TraceCheckUtils]: 82: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:04,005 INFO L273 TraceCheckUtils]: 83: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:04,005 INFO L273 TraceCheckUtils]: 84: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:04,005 INFO L273 TraceCheckUtils]: 85: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:04,006 INFO L273 TraceCheckUtils]: 86: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:04,006 INFO L273 TraceCheckUtils]: 87: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:04,006 INFO L273 TraceCheckUtils]: 88: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:04,006 INFO L273 TraceCheckUtils]: 89: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:04,006 INFO L273 TraceCheckUtils]: 90: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:04,006 INFO L273 TraceCheckUtils]: 91: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:04,006 INFO L273 TraceCheckUtils]: 92: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:04,006 INFO L273 TraceCheckUtils]: 93: Hoare triple {9918#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9918#true} is VALID [2018-11-23 12:17:04,006 INFO L273 TraceCheckUtils]: 94: Hoare triple {9918#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9918#true} is VALID [2018-11-23 12:17:04,007 INFO L273 TraceCheckUtils]: 95: Hoare triple {9918#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9918#true} is VALID [2018-11-23 12:17:04,007 INFO L273 TraceCheckUtils]: 96: Hoare triple {9918#true} assume !(~i~0 < 10); {9918#true} is VALID [2018-11-23 12:17:04,007 INFO L273 TraceCheckUtils]: 97: Hoare triple {9918#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9918#true} is VALID [2018-11-23 12:17:04,007 INFO L273 TraceCheckUtils]: 98: Hoare triple {9918#true} assume true; {9918#true} is VALID [2018-11-23 12:17:04,007 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {9918#true} {9918#true} #77#return; {9918#true} is VALID [2018-11-23 12:17:04,008 INFO L273 TraceCheckUtils]: 100: Hoare triple {9918#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; {10229#(<= main_~i~2 0)} is VALID [2018-11-23 12:17:04,008 INFO L273 TraceCheckUtils]: 101: Hoare triple {10229#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10229#(<= main_~i~2 0)} is VALID [2018-11-23 12:17:04,008 INFO L273 TraceCheckUtils]: 102: Hoare triple {10229#(<= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9921#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:04,009 INFO L273 TraceCheckUtils]: 103: Hoare triple {9921#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9921#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:04,009 INFO L273 TraceCheckUtils]: 104: Hoare triple {9921#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9922#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:04,009 INFO L273 TraceCheckUtils]: 105: Hoare triple {9922#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9922#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:04,010 INFO L273 TraceCheckUtils]: 106: Hoare triple {9922#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9923#(<= main_~i~2 3)} is VALID [2018-11-23 12:17:04,010 INFO L273 TraceCheckUtils]: 107: Hoare triple {9923#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9923#(<= main_~i~2 3)} is VALID [2018-11-23 12:17:04,011 INFO L273 TraceCheckUtils]: 108: Hoare triple {9923#(<= main_~i~2 3)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9924#(<= main_~i~2 4)} is VALID [2018-11-23 12:17:04,011 INFO L273 TraceCheckUtils]: 109: Hoare triple {9924#(<= main_~i~2 4)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {9924#(<= main_~i~2 4)} is VALID [2018-11-23 12:17:04,012 INFO L273 TraceCheckUtils]: 110: Hoare triple {9924#(<= main_~i~2 4)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {9925#(<= main_~i~2 5)} is VALID [2018-11-23 12:17:04,012 INFO L273 TraceCheckUtils]: 111: Hoare triple {9925#(<= main_~i~2 5)} assume !(~i~2 < 9); {9919#false} is VALID [2018-11-23 12:17:04,012 INFO L273 TraceCheckUtils]: 112: Hoare triple {9919#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {9919#false} is VALID [2018-11-23 12:17:04,013 INFO L256 TraceCheckUtils]: 113: Hoare triple {9919#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {9919#false} is VALID [2018-11-23 12:17:04,013 INFO L273 TraceCheckUtils]: 114: Hoare triple {9919#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {9919#false} is VALID [2018-11-23 12:17:04,013 INFO L273 TraceCheckUtils]: 115: Hoare triple {9919#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9919#false} is VALID [2018-11-23 12:17:04,013 INFO L273 TraceCheckUtils]: 116: Hoare triple {9919#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9919#false} is VALID [2018-11-23 12:17:04,013 INFO L273 TraceCheckUtils]: 117: Hoare triple {9919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9919#false} is VALID [2018-11-23 12:17:04,014 INFO L273 TraceCheckUtils]: 118: Hoare triple {9919#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9919#false} is VALID [2018-11-23 12:17:04,014 INFO L273 TraceCheckUtils]: 119: Hoare triple {9919#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9919#false} is VALID [2018-11-23 12:17:04,014 INFO L273 TraceCheckUtils]: 120: Hoare triple {9919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9919#false} is VALID [2018-11-23 12:17:04,014 INFO L273 TraceCheckUtils]: 121: Hoare triple {9919#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9919#false} is VALID [2018-11-23 12:17:04,014 INFO L273 TraceCheckUtils]: 122: Hoare triple {9919#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9919#false} is VALID [2018-11-23 12:17:04,014 INFO L273 TraceCheckUtils]: 123: Hoare triple {9919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9919#false} is VALID [2018-11-23 12:17:04,015 INFO L273 TraceCheckUtils]: 124: Hoare triple {9919#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9919#false} is VALID [2018-11-23 12:17:04,015 INFO L273 TraceCheckUtils]: 125: Hoare triple {9919#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9919#false} is VALID [2018-11-23 12:17:04,015 INFO L273 TraceCheckUtils]: 126: Hoare triple {9919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9919#false} is VALID [2018-11-23 12:17:04,015 INFO L273 TraceCheckUtils]: 127: Hoare triple {9919#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9919#false} is VALID [2018-11-23 12:17:04,015 INFO L273 TraceCheckUtils]: 128: Hoare triple {9919#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9919#false} is VALID [2018-11-23 12:17:04,015 INFO L273 TraceCheckUtils]: 129: Hoare triple {9919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9919#false} is VALID [2018-11-23 12:17:04,016 INFO L273 TraceCheckUtils]: 130: Hoare triple {9919#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9919#false} is VALID [2018-11-23 12:17:04,016 INFO L273 TraceCheckUtils]: 131: Hoare triple {9919#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9919#false} is VALID [2018-11-23 12:17:04,016 INFO L273 TraceCheckUtils]: 132: Hoare triple {9919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9919#false} is VALID [2018-11-23 12:17:04,016 INFO L273 TraceCheckUtils]: 133: Hoare triple {9919#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9919#false} is VALID [2018-11-23 12:17:04,016 INFO L273 TraceCheckUtils]: 134: Hoare triple {9919#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9919#false} is VALID [2018-11-23 12:17:04,016 INFO L273 TraceCheckUtils]: 135: Hoare triple {9919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9919#false} is VALID [2018-11-23 12:17:04,016 INFO L273 TraceCheckUtils]: 136: Hoare triple {9919#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9919#false} is VALID [2018-11-23 12:17:04,016 INFO L273 TraceCheckUtils]: 137: Hoare triple {9919#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9919#false} is VALID [2018-11-23 12:17:04,016 INFO L273 TraceCheckUtils]: 138: Hoare triple {9919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9919#false} is VALID [2018-11-23 12:17:04,017 INFO L273 TraceCheckUtils]: 139: Hoare triple {9919#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9919#false} is VALID [2018-11-23 12:17:04,017 INFO L273 TraceCheckUtils]: 140: Hoare triple {9919#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9919#false} is VALID [2018-11-23 12:17:04,017 INFO L273 TraceCheckUtils]: 141: Hoare triple {9919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9919#false} is VALID [2018-11-23 12:17:04,017 INFO L273 TraceCheckUtils]: 142: Hoare triple {9919#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {9919#false} is VALID [2018-11-23 12:17:04,017 INFO L273 TraceCheckUtils]: 143: Hoare triple {9919#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {9919#false} is VALID [2018-11-23 12:17:04,017 INFO L273 TraceCheckUtils]: 144: Hoare triple {9919#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9919#false} is VALID [2018-11-23 12:17:04,017 INFO L273 TraceCheckUtils]: 145: Hoare triple {9919#false} assume !(~i~0 < 10); {9919#false} is VALID [2018-11-23 12:17:04,017 INFO L273 TraceCheckUtils]: 146: Hoare triple {9919#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {9919#false} is VALID [2018-11-23 12:17:04,017 INFO L273 TraceCheckUtils]: 147: Hoare triple {9919#false} assume true; {9919#false} is VALID [2018-11-23 12:17:04,018 INFO L268 TraceCheckUtils]: 148: Hoare quadruple {9919#false} {9919#false} #79#return; {9919#false} is VALID [2018-11-23 12:17:04,018 INFO L273 TraceCheckUtils]: 149: Hoare triple {9919#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {9919#false} is VALID [2018-11-23 12:17:04,018 INFO L273 TraceCheckUtils]: 150: Hoare triple {9919#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {9919#false} is VALID [2018-11-23 12:17:04,018 INFO L273 TraceCheckUtils]: 151: Hoare triple {9919#false} assume !false; {9919#false} is VALID [2018-11-23 12:17:04,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1535 backedges. 650 proven. 25 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2018-11-23 12:17:04,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:04,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:17:04,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 152 [2018-11-23 12:17:04,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:04,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:17:04,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:04,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:17:04,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:17:04,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:17:04,093 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand 9 states. [2018-11-23 12:17:04,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:04,315 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2018-11-23 12:17:04,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:17:04,315 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 152 [2018-11-23 12:17:04,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:04,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:17:04,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2018-11-23 12:17:04,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:17:04,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2018-11-23 12:17:04,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 59 transitions. [2018-11-23 12:17:04,382 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:17:04,383 INFO L225 Difference]: With dead ends: 127 [2018-11-23 12:17:04,384 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 12:17:04,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:17:04,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 12:17:04,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-11-23 12:17:04,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:04,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 85 states. [2018-11-23 12:17:04,422 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 85 states. [2018-11-23 12:17:04,422 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 85 states. [2018-11-23 12:17:04,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:04,424 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2018-11-23 12:17:04,424 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2018-11-23 12:17:04,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:04,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:04,424 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 86 states. [2018-11-23 12:17:04,424 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 86 states. [2018-11-23 12:17:04,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:04,426 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2018-11-23 12:17:04,426 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2018-11-23 12:17:04,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:04,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:04,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:04,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 12:17:04,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2018-11-23 12:17:04,428 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 152 [2018-11-23 12:17:04,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:04,428 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2018-11-23 12:17:04,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:17:04,428 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2018-11-23 12:17:04,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-23 12:17:04,429 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:04,430 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 10, 10, 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:04,430 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:04,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:04,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1810174302, now seen corresponding path program 17 times [2018-11-23 12:17:04,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:04,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:04,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:04,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:04,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:04,606 INFO L256 TraceCheckUtils]: 0: Hoare triple {10853#true} call ULTIMATE.init(); {10853#true} is VALID [2018-11-23 12:17:04,607 INFO L273 TraceCheckUtils]: 1: Hoare triple {10853#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10853#true} is VALID [2018-11-23 12:17:04,607 INFO L273 TraceCheckUtils]: 2: Hoare triple {10853#true} assume true; {10853#true} is VALID [2018-11-23 12:17:04,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10853#true} {10853#true} #71#return; {10853#true} is VALID [2018-11-23 12:17:04,607 INFO L256 TraceCheckUtils]: 4: Hoare triple {10853#true} call #t~ret14 := main(); {10853#true} is VALID [2018-11-23 12:17:04,608 INFO L273 TraceCheckUtils]: 5: Hoare triple {10853#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10853#true} is VALID [2018-11-23 12:17:04,608 INFO L273 TraceCheckUtils]: 6: Hoare triple {10853#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10853#true} is VALID [2018-11-23 12:17:04,608 INFO L273 TraceCheckUtils]: 7: Hoare triple {10853#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10853#true} is VALID [2018-11-23 12:17:04,608 INFO L273 TraceCheckUtils]: 8: Hoare triple {10853#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10853#true} is VALID [2018-11-23 12:17:04,608 INFO L273 TraceCheckUtils]: 9: Hoare triple {10853#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10853#true} is VALID [2018-11-23 12:17:04,609 INFO L273 TraceCheckUtils]: 10: Hoare triple {10853#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10853#true} is VALID [2018-11-23 12:17:04,609 INFO L273 TraceCheckUtils]: 11: Hoare triple {10853#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10853#true} is VALID [2018-11-23 12:17:04,609 INFO L273 TraceCheckUtils]: 12: Hoare triple {10853#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10853#true} is VALID [2018-11-23 12:17:04,609 INFO L273 TraceCheckUtils]: 13: Hoare triple {10853#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10853#true} is VALID [2018-11-23 12:17:04,609 INFO L273 TraceCheckUtils]: 14: Hoare triple {10853#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10853#true} is VALID [2018-11-23 12:17:04,609 INFO L273 TraceCheckUtils]: 15: Hoare triple {10853#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10853#true} is VALID [2018-11-23 12:17:04,610 INFO L273 TraceCheckUtils]: 16: Hoare triple {10853#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10853#true} is VALID [2018-11-23 12:17:04,610 INFO L273 TraceCheckUtils]: 17: Hoare triple {10853#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10853#true} is VALID [2018-11-23 12:17:04,610 INFO L273 TraceCheckUtils]: 18: Hoare triple {10853#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10853#true} is VALID [2018-11-23 12:17:04,610 INFO L273 TraceCheckUtils]: 19: Hoare triple {10853#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10853#true} is VALID [2018-11-23 12:17:04,610 INFO L273 TraceCheckUtils]: 20: Hoare triple {10853#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10853#true} is VALID [2018-11-23 12:17:04,610 INFO L273 TraceCheckUtils]: 21: Hoare triple {10853#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10853#true} is VALID [2018-11-23 12:17:04,610 INFO L273 TraceCheckUtils]: 22: Hoare triple {10853#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10853#true} is VALID [2018-11-23 12:17:04,610 INFO L273 TraceCheckUtils]: 23: Hoare triple {10853#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10853#true} is VALID [2018-11-23 12:17:04,610 INFO L273 TraceCheckUtils]: 24: Hoare triple {10853#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10853#true} is VALID [2018-11-23 12:17:04,611 INFO L273 TraceCheckUtils]: 25: Hoare triple {10853#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10853#true} is VALID [2018-11-23 12:17:04,611 INFO L273 TraceCheckUtils]: 26: Hoare triple {10853#true} assume !(~i~1 < 10); {10853#true} is VALID [2018-11-23 12:17:04,611 INFO L256 TraceCheckUtils]: 27: Hoare triple {10853#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {10853#true} is VALID [2018-11-23 12:17:04,611 INFO L273 TraceCheckUtils]: 28: Hoare triple {10853#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {10853#true} is VALID [2018-11-23 12:17:04,611 INFO L273 TraceCheckUtils]: 29: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,611 INFO L273 TraceCheckUtils]: 30: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,611 INFO L273 TraceCheckUtils]: 31: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,611 INFO L273 TraceCheckUtils]: 32: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,611 INFO L273 TraceCheckUtils]: 33: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,612 INFO L273 TraceCheckUtils]: 34: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,612 INFO L273 TraceCheckUtils]: 35: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,612 INFO L273 TraceCheckUtils]: 36: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,612 INFO L273 TraceCheckUtils]: 37: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,612 INFO L273 TraceCheckUtils]: 38: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,612 INFO L273 TraceCheckUtils]: 39: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,612 INFO L273 TraceCheckUtils]: 40: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,612 INFO L273 TraceCheckUtils]: 41: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,612 INFO L273 TraceCheckUtils]: 42: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,613 INFO L273 TraceCheckUtils]: 43: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,613 INFO L273 TraceCheckUtils]: 44: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,613 INFO L273 TraceCheckUtils]: 45: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,613 INFO L273 TraceCheckUtils]: 46: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,613 INFO L273 TraceCheckUtils]: 47: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,613 INFO L273 TraceCheckUtils]: 48: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,613 INFO L273 TraceCheckUtils]: 49: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,613 INFO L273 TraceCheckUtils]: 50: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,614 INFO L273 TraceCheckUtils]: 51: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,614 INFO L273 TraceCheckUtils]: 52: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,614 INFO L273 TraceCheckUtils]: 53: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,614 INFO L273 TraceCheckUtils]: 54: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,614 INFO L273 TraceCheckUtils]: 55: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,614 INFO L273 TraceCheckUtils]: 56: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,614 INFO L273 TraceCheckUtils]: 57: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,614 INFO L273 TraceCheckUtils]: 58: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,614 INFO L273 TraceCheckUtils]: 59: Hoare triple {10853#true} assume !(~i~0 < 10); {10853#true} is VALID [2018-11-23 12:17:04,615 INFO L273 TraceCheckUtils]: 60: Hoare triple {10853#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10853#true} is VALID [2018-11-23 12:17:04,615 INFO L273 TraceCheckUtils]: 61: Hoare triple {10853#true} assume true; {10853#true} is VALID [2018-11-23 12:17:04,615 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {10853#true} {10853#true} #75#return; {10853#true} is VALID [2018-11-23 12:17:04,615 INFO L273 TraceCheckUtils]: 63: Hoare triple {10853#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); {10853#true} is VALID [2018-11-23 12:17:04,615 INFO L256 TraceCheckUtils]: 64: Hoare triple {10853#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {10853#true} is VALID [2018-11-23 12:17:04,615 INFO L273 TraceCheckUtils]: 65: Hoare triple {10853#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {10853#true} is VALID [2018-11-23 12:17:04,615 INFO L273 TraceCheckUtils]: 66: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,615 INFO L273 TraceCheckUtils]: 67: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,615 INFO L273 TraceCheckUtils]: 68: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,616 INFO L273 TraceCheckUtils]: 69: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,616 INFO L273 TraceCheckUtils]: 70: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,616 INFO L273 TraceCheckUtils]: 71: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,616 INFO L273 TraceCheckUtils]: 72: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,616 INFO L273 TraceCheckUtils]: 73: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,616 INFO L273 TraceCheckUtils]: 74: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,616 INFO L273 TraceCheckUtils]: 75: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,616 INFO L273 TraceCheckUtils]: 76: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,616 INFO L273 TraceCheckUtils]: 77: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,616 INFO L273 TraceCheckUtils]: 78: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,617 INFO L273 TraceCheckUtils]: 79: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,617 INFO L273 TraceCheckUtils]: 80: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,617 INFO L273 TraceCheckUtils]: 81: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,617 INFO L273 TraceCheckUtils]: 82: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,617 INFO L273 TraceCheckUtils]: 83: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,617 INFO L273 TraceCheckUtils]: 84: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,617 INFO L273 TraceCheckUtils]: 85: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,617 INFO L273 TraceCheckUtils]: 86: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,617 INFO L273 TraceCheckUtils]: 87: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,618 INFO L273 TraceCheckUtils]: 88: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,618 INFO L273 TraceCheckUtils]: 89: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,618 INFO L273 TraceCheckUtils]: 90: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,618 INFO L273 TraceCheckUtils]: 91: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,618 INFO L273 TraceCheckUtils]: 92: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,618 INFO L273 TraceCheckUtils]: 93: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,618 INFO L273 TraceCheckUtils]: 94: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,618 INFO L273 TraceCheckUtils]: 95: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,618 INFO L273 TraceCheckUtils]: 96: Hoare triple {10853#true} assume !(~i~0 < 10); {10853#true} is VALID [2018-11-23 12:17:04,618 INFO L273 TraceCheckUtils]: 97: Hoare triple {10853#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10853#true} is VALID [2018-11-23 12:17:04,619 INFO L273 TraceCheckUtils]: 98: Hoare triple {10853#true} assume true; {10853#true} is VALID [2018-11-23 12:17:04,619 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {10853#true} {10853#true} #77#return; {10853#true} is VALID [2018-11-23 12:17:04,619 INFO L273 TraceCheckUtils]: 100: Hoare triple {10853#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; {10855#(= main_~i~2 0)} is VALID [2018-11-23 12:17:04,619 INFO L273 TraceCheckUtils]: 101: Hoare triple {10855#(= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10855#(= main_~i~2 0)} is VALID [2018-11-23 12:17:04,620 INFO L273 TraceCheckUtils]: 102: Hoare triple {10855#(= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10856#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:04,620 INFO L273 TraceCheckUtils]: 103: Hoare triple {10856#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10856#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:04,620 INFO L273 TraceCheckUtils]: 104: Hoare triple {10856#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10857#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:04,621 INFO L273 TraceCheckUtils]: 105: Hoare triple {10857#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10857#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:04,621 INFO L273 TraceCheckUtils]: 106: Hoare triple {10857#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10858#(<= main_~i~2 3)} is VALID [2018-11-23 12:17:04,622 INFO L273 TraceCheckUtils]: 107: Hoare triple {10858#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10858#(<= main_~i~2 3)} is VALID [2018-11-23 12:17:04,622 INFO L273 TraceCheckUtils]: 108: Hoare triple {10858#(<= main_~i~2 3)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10859#(<= main_~i~2 4)} is VALID [2018-11-23 12:17:04,622 INFO L273 TraceCheckUtils]: 109: Hoare triple {10859#(<= main_~i~2 4)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10859#(<= main_~i~2 4)} is VALID [2018-11-23 12:17:04,623 INFO L273 TraceCheckUtils]: 110: Hoare triple {10859#(<= main_~i~2 4)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10860#(<= main_~i~2 5)} is VALID [2018-11-23 12:17:04,623 INFO L273 TraceCheckUtils]: 111: Hoare triple {10860#(<= main_~i~2 5)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10860#(<= main_~i~2 5)} is VALID [2018-11-23 12:17:04,624 INFO L273 TraceCheckUtils]: 112: Hoare triple {10860#(<= main_~i~2 5)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10861#(<= main_~i~2 6)} is VALID [2018-11-23 12:17:04,625 INFO L273 TraceCheckUtils]: 113: Hoare triple {10861#(<= main_~i~2 6)} assume !(~i~2 < 9); {10854#false} is VALID [2018-11-23 12:17:04,625 INFO L273 TraceCheckUtils]: 114: Hoare triple {10854#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {10854#false} is VALID [2018-11-23 12:17:04,625 INFO L256 TraceCheckUtils]: 115: Hoare triple {10854#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {10853#true} is VALID [2018-11-23 12:17:04,625 INFO L273 TraceCheckUtils]: 116: Hoare triple {10853#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {10853#true} is VALID [2018-11-23 12:17:04,626 INFO L273 TraceCheckUtils]: 117: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,626 INFO L273 TraceCheckUtils]: 118: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,626 INFO L273 TraceCheckUtils]: 119: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,626 INFO L273 TraceCheckUtils]: 120: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,626 INFO L273 TraceCheckUtils]: 121: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,626 INFO L273 TraceCheckUtils]: 122: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,627 INFO L273 TraceCheckUtils]: 123: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,627 INFO L273 TraceCheckUtils]: 124: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,627 INFO L273 TraceCheckUtils]: 125: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,627 INFO L273 TraceCheckUtils]: 126: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,627 INFO L273 TraceCheckUtils]: 127: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,628 INFO L273 TraceCheckUtils]: 128: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,628 INFO L273 TraceCheckUtils]: 129: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,628 INFO L273 TraceCheckUtils]: 130: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,628 INFO L273 TraceCheckUtils]: 131: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,628 INFO L273 TraceCheckUtils]: 132: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,628 INFO L273 TraceCheckUtils]: 133: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,629 INFO L273 TraceCheckUtils]: 134: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,629 INFO L273 TraceCheckUtils]: 135: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,629 INFO L273 TraceCheckUtils]: 136: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,629 INFO L273 TraceCheckUtils]: 137: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,629 INFO L273 TraceCheckUtils]: 138: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,630 INFO L273 TraceCheckUtils]: 139: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,630 INFO L273 TraceCheckUtils]: 140: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,630 INFO L273 TraceCheckUtils]: 141: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,630 INFO L273 TraceCheckUtils]: 142: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,630 INFO L273 TraceCheckUtils]: 143: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,630 INFO L273 TraceCheckUtils]: 144: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:04,630 INFO L273 TraceCheckUtils]: 145: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:04,630 INFO L273 TraceCheckUtils]: 146: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:04,630 INFO L273 TraceCheckUtils]: 147: Hoare triple {10853#true} assume !(~i~0 < 10); {10853#true} is VALID [2018-11-23 12:17:04,631 INFO L273 TraceCheckUtils]: 148: Hoare triple {10853#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10853#true} is VALID [2018-11-23 12:17:04,631 INFO L273 TraceCheckUtils]: 149: Hoare triple {10853#true} assume true; {10853#true} is VALID [2018-11-23 12:17:04,631 INFO L268 TraceCheckUtils]: 150: Hoare quadruple {10853#true} {10854#false} #79#return; {10854#false} is VALID [2018-11-23 12:17:04,631 INFO L273 TraceCheckUtils]: 151: Hoare triple {10854#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {10854#false} is VALID [2018-11-23 12:17:04,631 INFO L273 TraceCheckUtils]: 152: Hoare triple {10854#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {10854#false} is VALID [2018-11-23 12:17:04,631 INFO L273 TraceCheckUtils]: 153: Hoare triple {10854#false} assume !false; {10854#false} is VALID [2018-11-23 12:17:04,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1546 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2018-11-23 12:17:04,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:04,640 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:04,650 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:17:05,452 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2018-11-23 12:17:05,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:05,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:05,640 INFO L256 TraceCheckUtils]: 0: Hoare triple {10853#true} call ULTIMATE.init(); {10853#true} is VALID [2018-11-23 12:17:05,640 INFO L273 TraceCheckUtils]: 1: Hoare triple {10853#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10853#true} is VALID [2018-11-23 12:17:05,640 INFO L273 TraceCheckUtils]: 2: Hoare triple {10853#true} assume true; {10853#true} is VALID [2018-11-23 12:17:05,640 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10853#true} {10853#true} #71#return; {10853#true} is VALID [2018-11-23 12:17:05,640 INFO L256 TraceCheckUtils]: 4: Hoare triple {10853#true} call #t~ret14 := main(); {10853#true} is VALID [2018-11-23 12:17:05,641 INFO L273 TraceCheckUtils]: 5: Hoare triple {10853#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10853#true} is VALID [2018-11-23 12:17:05,641 INFO L273 TraceCheckUtils]: 6: Hoare triple {10853#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10853#true} is VALID [2018-11-23 12:17:05,641 INFO L273 TraceCheckUtils]: 7: Hoare triple {10853#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10853#true} is VALID [2018-11-23 12:17:05,641 INFO L273 TraceCheckUtils]: 8: Hoare triple {10853#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10853#true} is VALID [2018-11-23 12:17:05,641 INFO L273 TraceCheckUtils]: 9: Hoare triple {10853#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10853#true} is VALID [2018-11-23 12:17:05,642 INFO L273 TraceCheckUtils]: 10: Hoare triple {10853#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10853#true} is VALID [2018-11-23 12:17:05,642 INFO L273 TraceCheckUtils]: 11: Hoare triple {10853#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10853#true} is VALID [2018-11-23 12:17:05,642 INFO L273 TraceCheckUtils]: 12: Hoare triple {10853#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10853#true} is VALID [2018-11-23 12:17:05,642 INFO L273 TraceCheckUtils]: 13: Hoare triple {10853#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10853#true} is VALID [2018-11-23 12:17:05,642 INFO L273 TraceCheckUtils]: 14: Hoare triple {10853#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10853#true} is VALID [2018-11-23 12:17:05,643 INFO L273 TraceCheckUtils]: 15: Hoare triple {10853#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10853#true} is VALID [2018-11-23 12:17:05,643 INFO L273 TraceCheckUtils]: 16: Hoare triple {10853#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10853#true} is VALID [2018-11-23 12:17:05,643 INFO L273 TraceCheckUtils]: 17: Hoare triple {10853#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10853#true} is VALID [2018-11-23 12:17:05,643 INFO L273 TraceCheckUtils]: 18: Hoare triple {10853#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10853#true} is VALID [2018-11-23 12:17:05,643 INFO L273 TraceCheckUtils]: 19: Hoare triple {10853#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10853#true} is VALID [2018-11-23 12:17:05,643 INFO L273 TraceCheckUtils]: 20: Hoare triple {10853#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10853#true} is VALID [2018-11-23 12:17:05,643 INFO L273 TraceCheckUtils]: 21: Hoare triple {10853#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10853#true} is VALID [2018-11-23 12:17:05,643 INFO L273 TraceCheckUtils]: 22: Hoare triple {10853#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10853#true} is VALID [2018-11-23 12:17:05,643 INFO L273 TraceCheckUtils]: 23: Hoare triple {10853#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10853#true} is VALID [2018-11-23 12:17:05,644 INFO L273 TraceCheckUtils]: 24: Hoare triple {10853#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {10853#true} is VALID [2018-11-23 12:17:05,644 INFO L273 TraceCheckUtils]: 25: Hoare triple {10853#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10853#true} is VALID [2018-11-23 12:17:05,644 INFO L273 TraceCheckUtils]: 26: Hoare triple {10853#true} assume !(~i~1 < 10); {10853#true} is VALID [2018-11-23 12:17:05,644 INFO L256 TraceCheckUtils]: 27: Hoare triple {10853#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {10853#true} is VALID [2018-11-23 12:17:05,644 INFO L273 TraceCheckUtils]: 28: Hoare triple {10853#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {10853#true} is VALID [2018-11-23 12:17:05,644 INFO L273 TraceCheckUtils]: 29: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:05,644 INFO L273 TraceCheckUtils]: 30: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:05,644 INFO L273 TraceCheckUtils]: 31: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:05,644 INFO L273 TraceCheckUtils]: 32: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:05,645 INFO L273 TraceCheckUtils]: 33: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:05,645 INFO L273 TraceCheckUtils]: 34: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:05,645 INFO L273 TraceCheckUtils]: 35: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:05,645 INFO L273 TraceCheckUtils]: 36: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:05,645 INFO L273 TraceCheckUtils]: 37: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:05,645 INFO L273 TraceCheckUtils]: 38: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:05,645 INFO L273 TraceCheckUtils]: 39: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:05,645 INFO L273 TraceCheckUtils]: 40: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:05,645 INFO L273 TraceCheckUtils]: 41: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:05,646 INFO L273 TraceCheckUtils]: 42: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:05,646 INFO L273 TraceCheckUtils]: 43: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:05,646 INFO L273 TraceCheckUtils]: 44: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:05,646 INFO L273 TraceCheckUtils]: 45: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:05,646 INFO L273 TraceCheckUtils]: 46: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:05,646 INFO L273 TraceCheckUtils]: 47: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:05,646 INFO L273 TraceCheckUtils]: 48: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:05,646 INFO L273 TraceCheckUtils]: 49: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:05,646 INFO L273 TraceCheckUtils]: 50: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:05,647 INFO L273 TraceCheckUtils]: 51: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:05,647 INFO L273 TraceCheckUtils]: 52: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:05,647 INFO L273 TraceCheckUtils]: 53: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:05,647 INFO L273 TraceCheckUtils]: 54: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:05,647 INFO L273 TraceCheckUtils]: 55: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:05,647 INFO L273 TraceCheckUtils]: 56: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:05,647 INFO L273 TraceCheckUtils]: 57: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:05,647 INFO L273 TraceCheckUtils]: 58: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:05,648 INFO L273 TraceCheckUtils]: 59: Hoare triple {10853#true} assume !(~i~0 < 10); {10853#true} is VALID [2018-11-23 12:17:05,648 INFO L273 TraceCheckUtils]: 60: Hoare triple {10853#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10853#true} is VALID [2018-11-23 12:17:05,648 INFO L273 TraceCheckUtils]: 61: Hoare triple {10853#true} assume true; {10853#true} is VALID [2018-11-23 12:17:05,648 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {10853#true} {10853#true} #75#return; {10853#true} is VALID [2018-11-23 12:17:05,648 INFO L273 TraceCheckUtils]: 63: Hoare triple {10853#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); {10853#true} is VALID [2018-11-23 12:17:05,648 INFO L256 TraceCheckUtils]: 64: Hoare triple {10853#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {10853#true} is VALID [2018-11-23 12:17:05,649 INFO L273 TraceCheckUtils]: 65: Hoare triple {10853#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {10853#true} is VALID [2018-11-23 12:17:05,649 INFO L273 TraceCheckUtils]: 66: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:05,649 INFO L273 TraceCheckUtils]: 67: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:05,649 INFO L273 TraceCheckUtils]: 68: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:05,649 INFO L273 TraceCheckUtils]: 69: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:05,650 INFO L273 TraceCheckUtils]: 70: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:05,650 INFO L273 TraceCheckUtils]: 71: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:05,650 INFO L273 TraceCheckUtils]: 72: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:05,650 INFO L273 TraceCheckUtils]: 73: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:05,650 INFO L273 TraceCheckUtils]: 74: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:05,650 INFO L273 TraceCheckUtils]: 75: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:05,651 INFO L273 TraceCheckUtils]: 76: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:05,651 INFO L273 TraceCheckUtils]: 77: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:05,651 INFO L273 TraceCheckUtils]: 78: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:05,651 INFO L273 TraceCheckUtils]: 79: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:05,651 INFO L273 TraceCheckUtils]: 80: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:05,651 INFO L273 TraceCheckUtils]: 81: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:05,652 INFO L273 TraceCheckUtils]: 82: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:05,652 INFO L273 TraceCheckUtils]: 83: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:05,652 INFO L273 TraceCheckUtils]: 84: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:05,652 INFO L273 TraceCheckUtils]: 85: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:05,652 INFO L273 TraceCheckUtils]: 86: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:05,652 INFO L273 TraceCheckUtils]: 87: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:05,653 INFO L273 TraceCheckUtils]: 88: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:05,653 INFO L273 TraceCheckUtils]: 89: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:05,653 INFO L273 TraceCheckUtils]: 90: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:05,653 INFO L273 TraceCheckUtils]: 91: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:05,653 INFO L273 TraceCheckUtils]: 92: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:05,653 INFO L273 TraceCheckUtils]: 93: Hoare triple {10853#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10853#true} is VALID [2018-11-23 12:17:05,654 INFO L273 TraceCheckUtils]: 94: Hoare triple {10853#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10853#true} is VALID [2018-11-23 12:17:05,654 INFO L273 TraceCheckUtils]: 95: Hoare triple {10853#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10853#true} is VALID [2018-11-23 12:17:05,654 INFO L273 TraceCheckUtils]: 96: Hoare triple {10853#true} assume !(~i~0 < 10); {10853#true} is VALID [2018-11-23 12:17:05,654 INFO L273 TraceCheckUtils]: 97: Hoare triple {10853#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10853#true} is VALID [2018-11-23 12:17:05,654 INFO L273 TraceCheckUtils]: 98: Hoare triple {10853#true} assume true; {10853#true} is VALID [2018-11-23 12:17:05,654 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {10853#true} {10853#true} #77#return; {10853#true} is VALID [2018-11-23 12:17:05,676 INFO L273 TraceCheckUtils]: 100: Hoare triple {10853#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; {11165#(<= main_~i~2 0)} is VALID [2018-11-23 12:17:05,689 INFO L273 TraceCheckUtils]: 101: Hoare triple {11165#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11165#(<= main_~i~2 0)} is VALID [2018-11-23 12:17:05,692 INFO L273 TraceCheckUtils]: 102: Hoare triple {11165#(<= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10856#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:05,693 INFO L273 TraceCheckUtils]: 103: Hoare triple {10856#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10856#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:05,693 INFO L273 TraceCheckUtils]: 104: Hoare triple {10856#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10857#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:05,695 INFO L273 TraceCheckUtils]: 105: Hoare triple {10857#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10857#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:05,695 INFO L273 TraceCheckUtils]: 106: Hoare triple {10857#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10858#(<= main_~i~2 3)} is VALID [2018-11-23 12:17:05,698 INFO L273 TraceCheckUtils]: 107: Hoare triple {10858#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10858#(<= main_~i~2 3)} is VALID [2018-11-23 12:17:05,698 INFO L273 TraceCheckUtils]: 108: Hoare triple {10858#(<= main_~i~2 3)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10859#(<= main_~i~2 4)} is VALID [2018-11-23 12:17:05,700 INFO L273 TraceCheckUtils]: 109: Hoare triple {10859#(<= main_~i~2 4)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10859#(<= main_~i~2 4)} is VALID [2018-11-23 12:17:05,700 INFO L273 TraceCheckUtils]: 110: Hoare triple {10859#(<= main_~i~2 4)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10860#(<= main_~i~2 5)} is VALID [2018-11-23 12:17:05,700 INFO L273 TraceCheckUtils]: 111: Hoare triple {10860#(<= main_~i~2 5)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {10860#(<= main_~i~2 5)} is VALID [2018-11-23 12:17:05,701 INFO L273 TraceCheckUtils]: 112: Hoare triple {10860#(<= main_~i~2 5)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {10861#(<= main_~i~2 6)} is VALID [2018-11-23 12:17:05,701 INFO L273 TraceCheckUtils]: 113: Hoare triple {10861#(<= main_~i~2 6)} assume !(~i~2 < 9); {10854#false} is VALID [2018-11-23 12:17:05,701 INFO L273 TraceCheckUtils]: 114: Hoare triple {10854#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {10854#false} is VALID [2018-11-23 12:17:05,702 INFO L256 TraceCheckUtils]: 115: Hoare triple {10854#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {10854#false} is VALID [2018-11-23 12:17:05,702 INFO L273 TraceCheckUtils]: 116: Hoare triple {10854#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {10854#false} is VALID [2018-11-23 12:17:05,702 INFO L273 TraceCheckUtils]: 117: Hoare triple {10854#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10854#false} is VALID [2018-11-23 12:17:05,702 INFO L273 TraceCheckUtils]: 118: Hoare triple {10854#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10854#false} is VALID [2018-11-23 12:17:05,702 INFO L273 TraceCheckUtils]: 119: Hoare triple {10854#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10854#false} is VALID [2018-11-23 12:17:05,702 INFO L273 TraceCheckUtils]: 120: Hoare triple {10854#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10854#false} is VALID [2018-11-23 12:17:05,702 INFO L273 TraceCheckUtils]: 121: Hoare triple {10854#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10854#false} is VALID [2018-11-23 12:17:05,702 INFO L273 TraceCheckUtils]: 122: Hoare triple {10854#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10854#false} is VALID [2018-11-23 12:17:05,702 INFO L273 TraceCheckUtils]: 123: Hoare triple {10854#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10854#false} is VALID [2018-11-23 12:17:05,703 INFO L273 TraceCheckUtils]: 124: Hoare triple {10854#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10854#false} is VALID [2018-11-23 12:17:05,703 INFO L273 TraceCheckUtils]: 125: Hoare triple {10854#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10854#false} is VALID [2018-11-23 12:17:05,703 INFO L273 TraceCheckUtils]: 126: Hoare triple {10854#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10854#false} is VALID [2018-11-23 12:17:05,703 INFO L273 TraceCheckUtils]: 127: Hoare triple {10854#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10854#false} is VALID [2018-11-23 12:17:05,703 INFO L273 TraceCheckUtils]: 128: Hoare triple {10854#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10854#false} is VALID [2018-11-23 12:17:05,704 INFO L273 TraceCheckUtils]: 129: Hoare triple {10854#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10854#false} is VALID [2018-11-23 12:17:05,704 INFO L273 TraceCheckUtils]: 130: Hoare triple {10854#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10854#false} is VALID [2018-11-23 12:17:05,704 INFO L273 TraceCheckUtils]: 131: Hoare triple {10854#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10854#false} is VALID [2018-11-23 12:17:05,704 INFO L273 TraceCheckUtils]: 132: Hoare triple {10854#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10854#false} is VALID [2018-11-23 12:17:05,704 INFO L273 TraceCheckUtils]: 133: Hoare triple {10854#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10854#false} is VALID [2018-11-23 12:17:05,705 INFO L273 TraceCheckUtils]: 134: Hoare triple {10854#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10854#false} is VALID [2018-11-23 12:17:05,705 INFO L273 TraceCheckUtils]: 135: Hoare triple {10854#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10854#false} is VALID [2018-11-23 12:17:05,705 INFO L273 TraceCheckUtils]: 136: Hoare triple {10854#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10854#false} is VALID [2018-11-23 12:17:05,705 INFO L273 TraceCheckUtils]: 137: Hoare triple {10854#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10854#false} is VALID [2018-11-23 12:17:05,705 INFO L273 TraceCheckUtils]: 138: Hoare triple {10854#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10854#false} is VALID [2018-11-23 12:17:05,705 INFO L273 TraceCheckUtils]: 139: Hoare triple {10854#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10854#false} is VALID [2018-11-23 12:17:05,705 INFO L273 TraceCheckUtils]: 140: Hoare triple {10854#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10854#false} is VALID [2018-11-23 12:17:05,705 INFO L273 TraceCheckUtils]: 141: Hoare triple {10854#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10854#false} is VALID [2018-11-23 12:17:05,705 INFO L273 TraceCheckUtils]: 142: Hoare triple {10854#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10854#false} is VALID [2018-11-23 12:17:05,706 INFO L273 TraceCheckUtils]: 143: Hoare triple {10854#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10854#false} is VALID [2018-11-23 12:17:05,706 INFO L273 TraceCheckUtils]: 144: Hoare triple {10854#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {10854#false} is VALID [2018-11-23 12:17:05,706 INFO L273 TraceCheckUtils]: 145: Hoare triple {10854#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {10854#false} is VALID [2018-11-23 12:17:05,706 INFO L273 TraceCheckUtils]: 146: Hoare triple {10854#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10854#false} is VALID [2018-11-23 12:17:05,706 INFO L273 TraceCheckUtils]: 147: Hoare triple {10854#false} assume !(~i~0 < 10); {10854#false} is VALID [2018-11-23 12:17:05,706 INFO L273 TraceCheckUtils]: 148: Hoare triple {10854#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {10854#false} is VALID [2018-11-23 12:17:05,706 INFO L273 TraceCheckUtils]: 149: Hoare triple {10854#false} assume true; {10854#false} is VALID [2018-11-23 12:17:05,706 INFO L268 TraceCheckUtils]: 150: Hoare quadruple {10854#false} {10854#false} #79#return; {10854#false} is VALID [2018-11-23 12:17:05,706 INFO L273 TraceCheckUtils]: 151: Hoare triple {10854#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {10854#false} is VALID [2018-11-23 12:17:05,707 INFO L273 TraceCheckUtils]: 152: Hoare triple {10854#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {10854#false} is VALID [2018-11-23 12:17:05,707 INFO L273 TraceCheckUtils]: 153: Hoare triple {10854#false} assume !false; {10854#false} is VALID [2018-11-23 12:17:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1546 backedges. 650 proven. 36 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2018-11-23 12:17:05,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:05,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:17:05,737 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2018-11-23 12:17:05,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:05,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:17:05,789 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:17:05,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:17:05,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:17:05,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:17:05,790 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand 10 states. [2018-11-23 12:17:06,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:06,167 INFO L93 Difference]: Finished difference Result 129 states and 154 transitions. [2018-11-23 12:17:06,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:17:06,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2018-11-23 12:17:06,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:06,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:17:06,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2018-11-23 12:17:06,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:17:06,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2018-11-23 12:17:06,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 61 transitions. [2018-11-23 12:17:06,267 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:17:06,269 INFO L225 Difference]: With dead ends: 129 [2018-11-23 12:17:06,269 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 12:17:06,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:17:06,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 12:17:06,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-11-23 12:17:06,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:06,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 87 states. [2018-11-23 12:17:06,294 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 87 states. [2018-11-23 12:17:06,294 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 87 states. [2018-11-23 12:17:06,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:06,296 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2018-11-23 12:17:06,297 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2018-11-23 12:17:06,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:06,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:06,297 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 88 states. [2018-11-23 12:17:06,298 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 88 states. [2018-11-23 12:17:06,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:06,299 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2018-11-23 12:17:06,299 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2018-11-23 12:17:06,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:06,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:06,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:06,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:06,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 12:17:06,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2018-11-23 12:17:06,302 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 154 [2018-11-23 12:17:06,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:06,302 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2018-11-23 12:17:06,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:17:06,303 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2018-11-23 12:17:06,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-23 12:17:06,304 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:06,304 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 10, 10, 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:06,304 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:06,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:06,305 INFO L82 PathProgramCache]: Analyzing trace with hash 641373596, now seen corresponding path program 18 times [2018-11-23 12:17:06,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:06,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:06,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:06,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:06,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:06,504 INFO L256 TraceCheckUtils]: 0: Hoare triple {11805#true} call ULTIMATE.init(); {11805#true} is VALID [2018-11-23 12:17:06,504 INFO L273 TraceCheckUtils]: 1: Hoare triple {11805#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11805#true} is VALID [2018-11-23 12:17:06,504 INFO L273 TraceCheckUtils]: 2: Hoare triple {11805#true} assume true; {11805#true} is VALID [2018-11-23 12:17:06,504 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11805#true} {11805#true} #71#return; {11805#true} is VALID [2018-11-23 12:17:06,504 INFO L256 TraceCheckUtils]: 4: Hoare triple {11805#true} call #t~ret14 := main(); {11805#true} is VALID [2018-11-23 12:17:06,504 INFO L273 TraceCheckUtils]: 5: Hoare triple {11805#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {11805#true} is VALID [2018-11-23 12:17:06,505 INFO L273 TraceCheckUtils]: 6: Hoare triple {11805#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11805#true} is VALID [2018-11-23 12:17:06,505 INFO L273 TraceCheckUtils]: 7: Hoare triple {11805#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11805#true} is VALID [2018-11-23 12:17:06,505 INFO L273 TraceCheckUtils]: 8: Hoare triple {11805#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11805#true} is VALID [2018-11-23 12:17:06,505 INFO L273 TraceCheckUtils]: 9: Hoare triple {11805#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11805#true} is VALID [2018-11-23 12:17:06,505 INFO L273 TraceCheckUtils]: 10: Hoare triple {11805#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11805#true} is VALID [2018-11-23 12:17:06,505 INFO L273 TraceCheckUtils]: 11: Hoare triple {11805#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11805#true} is VALID [2018-11-23 12:17:06,505 INFO L273 TraceCheckUtils]: 12: Hoare triple {11805#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11805#true} is VALID [2018-11-23 12:17:06,505 INFO L273 TraceCheckUtils]: 13: Hoare triple {11805#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11805#true} is VALID [2018-11-23 12:17:06,505 INFO L273 TraceCheckUtils]: 14: Hoare triple {11805#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11805#true} is VALID [2018-11-23 12:17:06,506 INFO L273 TraceCheckUtils]: 15: Hoare triple {11805#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11805#true} is VALID [2018-11-23 12:17:06,506 INFO L273 TraceCheckUtils]: 16: Hoare triple {11805#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11805#true} is VALID [2018-11-23 12:17:06,506 INFO L273 TraceCheckUtils]: 17: Hoare triple {11805#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11805#true} is VALID [2018-11-23 12:17:06,506 INFO L273 TraceCheckUtils]: 18: Hoare triple {11805#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11805#true} is VALID [2018-11-23 12:17:06,506 INFO L273 TraceCheckUtils]: 19: Hoare triple {11805#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11805#true} is VALID [2018-11-23 12:17:06,506 INFO L273 TraceCheckUtils]: 20: Hoare triple {11805#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11805#true} is VALID [2018-11-23 12:17:06,506 INFO L273 TraceCheckUtils]: 21: Hoare triple {11805#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11805#true} is VALID [2018-11-23 12:17:06,506 INFO L273 TraceCheckUtils]: 22: Hoare triple {11805#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11805#true} is VALID [2018-11-23 12:17:06,506 INFO L273 TraceCheckUtils]: 23: Hoare triple {11805#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11805#true} is VALID [2018-11-23 12:17:06,507 INFO L273 TraceCheckUtils]: 24: Hoare triple {11805#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11805#true} is VALID [2018-11-23 12:17:06,507 INFO L273 TraceCheckUtils]: 25: Hoare triple {11805#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11805#true} is VALID [2018-11-23 12:17:06,507 INFO L273 TraceCheckUtils]: 26: Hoare triple {11805#true} assume !(~i~1 < 10); {11805#true} is VALID [2018-11-23 12:17:06,507 INFO L256 TraceCheckUtils]: 27: Hoare triple {11805#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {11805#true} is VALID [2018-11-23 12:17:06,507 INFO L273 TraceCheckUtils]: 28: Hoare triple {11805#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {11805#true} is VALID [2018-11-23 12:17:06,507 INFO L273 TraceCheckUtils]: 29: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,507 INFO L273 TraceCheckUtils]: 30: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,507 INFO L273 TraceCheckUtils]: 31: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,507 INFO L273 TraceCheckUtils]: 32: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,508 INFO L273 TraceCheckUtils]: 33: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,508 INFO L273 TraceCheckUtils]: 34: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,508 INFO L273 TraceCheckUtils]: 35: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,508 INFO L273 TraceCheckUtils]: 36: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,508 INFO L273 TraceCheckUtils]: 37: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,508 INFO L273 TraceCheckUtils]: 38: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,508 INFO L273 TraceCheckUtils]: 39: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,508 INFO L273 TraceCheckUtils]: 40: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,508 INFO L273 TraceCheckUtils]: 41: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,509 INFO L273 TraceCheckUtils]: 42: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,509 INFO L273 TraceCheckUtils]: 43: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,509 INFO L273 TraceCheckUtils]: 44: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,509 INFO L273 TraceCheckUtils]: 45: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,509 INFO L273 TraceCheckUtils]: 46: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,509 INFO L273 TraceCheckUtils]: 47: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,509 INFO L273 TraceCheckUtils]: 48: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,509 INFO L273 TraceCheckUtils]: 49: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,509 INFO L273 TraceCheckUtils]: 50: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,510 INFO L273 TraceCheckUtils]: 51: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,510 INFO L273 TraceCheckUtils]: 52: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,510 INFO L273 TraceCheckUtils]: 53: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,510 INFO L273 TraceCheckUtils]: 54: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,510 INFO L273 TraceCheckUtils]: 55: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,510 INFO L273 TraceCheckUtils]: 56: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,510 INFO L273 TraceCheckUtils]: 57: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,510 INFO L273 TraceCheckUtils]: 58: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,510 INFO L273 TraceCheckUtils]: 59: Hoare triple {11805#true} assume !(~i~0 < 10); {11805#true} is VALID [2018-11-23 12:17:06,511 INFO L273 TraceCheckUtils]: 60: Hoare triple {11805#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11805#true} is VALID [2018-11-23 12:17:06,511 INFO L273 TraceCheckUtils]: 61: Hoare triple {11805#true} assume true; {11805#true} is VALID [2018-11-23 12:17:06,511 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {11805#true} {11805#true} #75#return; {11805#true} is VALID [2018-11-23 12:17:06,511 INFO L273 TraceCheckUtils]: 63: Hoare triple {11805#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); {11805#true} is VALID [2018-11-23 12:17:06,511 INFO L256 TraceCheckUtils]: 64: Hoare triple {11805#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {11805#true} is VALID [2018-11-23 12:17:06,511 INFO L273 TraceCheckUtils]: 65: Hoare triple {11805#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {11805#true} is VALID [2018-11-23 12:17:06,511 INFO L273 TraceCheckUtils]: 66: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,511 INFO L273 TraceCheckUtils]: 67: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,511 INFO L273 TraceCheckUtils]: 68: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,512 INFO L273 TraceCheckUtils]: 69: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,512 INFO L273 TraceCheckUtils]: 70: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,512 INFO L273 TraceCheckUtils]: 71: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,512 INFO L273 TraceCheckUtils]: 72: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,512 INFO L273 TraceCheckUtils]: 73: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,512 INFO L273 TraceCheckUtils]: 74: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,512 INFO L273 TraceCheckUtils]: 75: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,512 INFO L273 TraceCheckUtils]: 76: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,513 INFO L273 TraceCheckUtils]: 77: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,513 INFO L273 TraceCheckUtils]: 78: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,513 INFO L273 TraceCheckUtils]: 79: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,513 INFO L273 TraceCheckUtils]: 80: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,513 INFO L273 TraceCheckUtils]: 81: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,513 INFO L273 TraceCheckUtils]: 82: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,513 INFO L273 TraceCheckUtils]: 83: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,513 INFO L273 TraceCheckUtils]: 84: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,514 INFO L273 TraceCheckUtils]: 85: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,514 INFO L273 TraceCheckUtils]: 86: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,514 INFO L273 TraceCheckUtils]: 87: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,514 INFO L273 TraceCheckUtils]: 88: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,514 INFO L273 TraceCheckUtils]: 89: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,514 INFO L273 TraceCheckUtils]: 90: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,515 INFO L273 TraceCheckUtils]: 91: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,515 INFO L273 TraceCheckUtils]: 92: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,515 INFO L273 TraceCheckUtils]: 93: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,515 INFO L273 TraceCheckUtils]: 94: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,515 INFO L273 TraceCheckUtils]: 95: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,515 INFO L273 TraceCheckUtils]: 96: Hoare triple {11805#true} assume !(~i~0 < 10); {11805#true} is VALID [2018-11-23 12:17:06,516 INFO L273 TraceCheckUtils]: 97: Hoare triple {11805#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11805#true} is VALID [2018-11-23 12:17:06,516 INFO L273 TraceCheckUtils]: 98: Hoare triple {11805#true} assume true; {11805#true} is VALID [2018-11-23 12:17:06,516 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {11805#true} {11805#true} #77#return; {11805#true} is VALID [2018-11-23 12:17:06,530 INFO L273 TraceCheckUtils]: 100: Hoare triple {11805#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; {11807#(= main_~i~2 0)} is VALID [2018-11-23 12:17:06,539 INFO L273 TraceCheckUtils]: 101: Hoare triple {11807#(= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11807#(= main_~i~2 0)} is VALID [2018-11-23 12:17:06,552 INFO L273 TraceCheckUtils]: 102: Hoare triple {11807#(= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11808#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:06,561 INFO L273 TraceCheckUtils]: 103: Hoare triple {11808#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11808#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:06,574 INFO L273 TraceCheckUtils]: 104: Hoare triple {11808#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11809#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:06,590 INFO L273 TraceCheckUtils]: 105: Hoare triple {11809#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11809#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:06,599 INFO L273 TraceCheckUtils]: 106: Hoare triple {11809#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11810#(<= main_~i~2 3)} is VALID [2018-11-23 12:17:06,612 INFO L273 TraceCheckUtils]: 107: Hoare triple {11810#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11810#(<= main_~i~2 3)} is VALID [2018-11-23 12:17:06,621 INFO L273 TraceCheckUtils]: 108: Hoare triple {11810#(<= main_~i~2 3)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11811#(<= main_~i~2 4)} is VALID [2018-11-23 12:17:06,635 INFO L273 TraceCheckUtils]: 109: Hoare triple {11811#(<= main_~i~2 4)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11811#(<= main_~i~2 4)} is VALID [2018-11-23 12:17:06,650 INFO L273 TraceCheckUtils]: 110: Hoare triple {11811#(<= main_~i~2 4)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11812#(<= main_~i~2 5)} is VALID [2018-11-23 12:17:06,659 INFO L273 TraceCheckUtils]: 111: Hoare triple {11812#(<= main_~i~2 5)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11812#(<= main_~i~2 5)} is VALID [2018-11-23 12:17:06,671 INFO L273 TraceCheckUtils]: 112: Hoare triple {11812#(<= main_~i~2 5)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11813#(<= main_~i~2 6)} is VALID [2018-11-23 12:17:06,684 INFO L273 TraceCheckUtils]: 113: Hoare triple {11813#(<= main_~i~2 6)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11813#(<= main_~i~2 6)} is VALID [2018-11-23 12:17:06,697 INFO L273 TraceCheckUtils]: 114: Hoare triple {11813#(<= main_~i~2 6)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11814#(<= main_~i~2 7)} is VALID [2018-11-23 12:17:06,714 INFO L273 TraceCheckUtils]: 115: Hoare triple {11814#(<= main_~i~2 7)} assume !(~i~2 < 9); {11806#false} is VALID [2018-11-23 12:17:06,714 INFO L273 TraceCheckUtils]: 116: Hoare triple {11806#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {11806#false} is VALID [2018-11-23 12:17:06,714 INFO L256 TraceCheckUtils]: 117: Hoare triple {11806#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {11805#true} is VALID [2018-11-23 12:17:06,715 INFO L273 TraceCheckUtils]: 118: Hoare triple {11805#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {11805#true} is VALID [2018-11-23 12:17:06,715 INFO L273 TraceCheckUtils]: 119: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,715 INFO L273 TraceCheckUtils]: 120: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,715 INFO L273 TraceCheckUtils]: 121: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,715 INFO L273 TraceCheckUtils]: 122: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,715 INFO L273 TraceCheckUtils]: 123: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,716 INFO L273 TraceCheckUtils]: 124: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,716 INFO L273 TraceCheckUtils]: 125: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,716 INFO L273 TraceCheckUtils]: 126: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,716 INFO L273 TraceCheckUtils]: 127: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,716 INFO L273 TraceCheckUtils]: 128: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,716 INFO L273 TraceCheckUtils]: 129: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,716 INFO L273 TraceCheckUtils]: 130: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,717 INFO L273 TraceCheckUtils]: 131: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,717 INFO L273 TraceCheckUtils]: 132: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,717 INFO L273 TraceCheckUtils]: 133: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,717 INFO L273 TraceCheckUtils]: 134: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,717 INFO L273 TraceCheckUtils]: 135: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,717 INFO L273 TraceCheckUtils]: 136: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,718 INFO L273 TraceCheckUtils]: 137: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,718 INFO L273 TraceCheckUtils]: 138: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,718 INFO L273 TraceCheckUtils]: 139: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,718 INFO L273 TraceCheckUtils]: 140: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,718 INFO L273 TraceCheckUtils]: 141: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,718 INFO L273 TraceCheckUtils]: 142: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,718 INFO L273 TraceCheckUtils]: 143: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,719 INFO L273 TraceCheckUtils]: 144: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,719 INFO L273 TraceCheckUtils]: 145: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,719 INFO L273 TraceCheckUtils]: 146: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:06,719 INFO L273 TraceCheckUtils]: 147: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:06,719 INFO L273 TraceCheckUtils]: 148: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:06,719 INFO L273 TraceCheckUtils]: 149: Hoare triple {11805#true} assume !(~i~0 < 10); {11805#true} is VALID [2018-11-23 12:17:06,720 INFO L273 TraceCheckUtils]: 150: Hoare triple {11805#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11805#true} is VALID [2018-11-23 12:17:06,720 INFO L273 TraceCheckUtils]: 151: Hoare triple {11805#true} assume true; {11805#true} is VALID [2018-11-23 12:17:06,720 INFO L268 TraceCheckUtils]: 152: Hoare quadruple {11805#true} {11806#false} #79#return; {11806#false} is VALID [2018-11-23 12:17:06,720 INFO L273 TraceCheckUtils]: 153: Hoare triple {11806#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {11806#false} is VALID [2018-11-23 12:17:06,720 INFO L273 TraceCheckUtils]: 154: Hoare triple {11806#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {11806#false} is VALID [2018-11-23 12:17:06,720 INFO L273 TraceCheckUtils]: 155: Hoare triple {11806#false} assume !false; {11806#false} is VALID [2018-11-23 12:17:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2018-11-23 12:17:06,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:06,734 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:06,752 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:17:07,102 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2018-11-23 12:17:07,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:07,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:07,286 INFO L256 TraceCheckUtils]: 0: Hoare triple {11805#true} call ULTIMATE.init(); {11805#true} is VALID [2018-11-23 12:17:07,287 INFO L273 TraceCheckUtils]: 1: Hoare triple {11805#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11805#true} is VALID [2018-11-23 12:17:07,287 INFO L273 TraceCheckUtils]: 2: Hoare triple {11805#true} assume true; {11805#true} is VALID [2018-11-23 12:17:07,287 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11805#true} {11805#true} #71#return; {11805#true} is VALID [2018-11-23 12:17:07,287 INFO L256 TraceCheckUtils]: 4: Hoare triple {11805#true} call #t~ret14 := main(); {11805#true} is VALID [2018-11-23 12:17:07,287 INFO L273 TraceCheckUtils]: 5: Hoare triple {11805#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {11805#true} is VALID [2018-11-23 12:17:07,288 INFO L273 TraceCheckUtils]: 6: Hoare triple {11805#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11805#true} is VALID [2018-11-23 12:17:07,288 INFO L273 TraceCheckUtils]: 7: Hoare triple {11805#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11805#true} is VALID [2018-11-23 12:17:07,288 INFO L273 TraceCheckUtils]: 8: Hoare triple {11805#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11805#true} is VALID [2018-11-23 12:17:07,288 INFO L273 TraceCheckUtils]: 9: Hoare triple {11805#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11805#true} is VALID [2018-11-23 12:17:07,288 INFO L273 TraceCheckUtils]: 10: Hoare triple {11805#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11805#true} is VALID [2018-11-23 12:17:07,289 INFO L273 TraceCheckUtils]: 11: Hoare triple {11805#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11805#true} is VALID [2018-11-23 12:17:07,289 INFO L273 TraceCheckUtils]: 12: Hoare triple {11805#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11805#true} is VALID [2018-11-23 12:17:07,289 INFO L273 TraceCheckUtils]: 13: Hoare triple {11805#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11805#true} is VALID [2018-11-23 12:17:07,289 INFO L273 TraceCheckUtils]: 14: Hoare triple {11805#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11805#true} is VALID [2018-11-23 12:17:07,289 INFO L273 TraceCheckUtils]: 15: Hoare triple {11805#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11805#true} is VALID [2018-11-23 12:17:07,289 INFO L273 TraceCheckUtils]: 16: Hoare triple {11805#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11805#true} is VALID [2018-11-23 12:17:07,289 INFO L273 TraceCheckUtils]: 17: Hoare triple {11805#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11805#true} is VALID [2018-11-23 12:17:07,289 INFO L273 TraceCheckUtils]: 18: Hoare triple {11805#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11805#true} is VALID [2018-11-23 12:17:07,289 INFO L273 TraceCheckUtils]: 19: Hoare triple {11805#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11805#true} is VALID [2018-11-23 12:17:07,290 INFO L273 TraceCheckUtils]: 20: Hoare triple {11805#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11805#true} is VALID [2018-11-23 12:17:07,290 INFO L273 TraceCheckUtils]: 21: Hoare triple {11805#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11805#true} is VALID [2018-11-23 12:17:07,290 INFO L273 TraceCheckUtils]: 22: Hoare triple {11805#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11805#true} is VALID [2018-11-23 12:17:07,290 INFO L273 TraceCheckUtils]: 23: Hoare triple {11805#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11805#true} is VALID [2018-11-23 12:17:07,290 INFO L273 TraceCheckUtils]: 24: Hoare triple {11805#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {11805#true} is VALID [2018-11-23 12:17:07,290 INFO L273 TraceCheckUtils]: 25: Hoare triple {11805#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11805#true} is VALID [2018-11-23 12:17:07,290 INFO L273 TraceCheckUtils]: 26: Hoare triple {11805#true} assume !(~i~1 < 10); {11805#true} is VALID [2018-11-23 12:17:07,290 INFO L256 TraceCheckUtils]: 27: Hoare triple {11805#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {11805#true} is VALID [2018-11-23 12:17:07,290 INFO L273 TraceCheckUtils]: 28: Hoare triple {11805#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {11805#true} is VALID [2018-11-23 12:17:07,290 INFO L273 TraceCheckUtils]: 29: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:07,291 INFO L273 TraceCheckUtils]: 30: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:07,291 INFO L273 TraceCheckUtils]: 31: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:07,291 INFO L273 TraceCheckUtils]: 32: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:07,291 INFO L273 TraceCheckUtils]: 33: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:07,291 INFO L273 TraceCheckUtils]: 34: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:07,291 INFO L273 TraceCheckUtils]: 35: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:07,291 INFO L273 TraceCheckUtils]: 36: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:07,291 INFO L273 TraceCheckUtils]: 37: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:07,291 INFO L273 TraceCheckUtils]: 38: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:07,292 INFO L273 TraceCheckUtils]: 39: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:07,292 INFO L273 TraceCheckUtils]: 40: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:07,292 INFO L273 TraceCheckUtils]: 41: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:07,292 INFO L273 TraceCheckUtils]: 42: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:07,292 INFO L273 TraceCheckUtils]: 43: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:07,292 INFO L273 TraceCheckUtils]: 44: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:07,292 INFO L273 TraceCheckUtils]: 45: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:07,292 INFO L273 TraceCheckUtils]: 46: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:07,292 INFO L273 TraceCheckUtils]: 47: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:07,293 INFO L273 TraceCheckUtils]: 48: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:07,293 INFO L273 TraceCheckUtils]: 49: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:07,293 INFO L273 TraceCheckUtils]: 50: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:07,293 INFO L273 TraceCheckUtils]: 51: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:07,293 INFO L273 TraceCheckUtils]: 52: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:07,293 INFO L273 TraceCheckUtils]: 53: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:07,293 INFO L273 TraceCheckUtils]: 54: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:07,293 INFO L273 TraceCheckUtils]: 55: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:07,293 INFO L273 TraceCheckUtils]: 56: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:07,293 INFO L273 TraceCheckUtils]: 57: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:07,294 INFO L273 TraceCheckUtils]: 58: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:07,294 INFO L273 TraceCheckUtils]: 59: Hoare triple {11805#true} assume !(~i~0 < 10); {11805#true} is VALID [2018-11-23 12:17:07,294 INFO L273 TraceCheckUtils]: 60: Hoare triple {11805#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11805#true} is VALID [2018-11-23 12:17:07,294 INFO L273 TraceCheckUtils]: 61: Hoare triple {11805#true} assume true; {11805#true} is VALID [2018-11-23 12:17:07,294 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {11805#true} {11805#true} #75#return; {11805#true} is VALID [2018-11-23 12:17:07,294 INFO L273 TraceCheckUtils]: 63: Hoare triple {11805#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); {11805#true} is VALID [2018-11-23 12:17:07,294 INFO L256 TraceCheckUtils]: 64: Hoare triple {11805#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {11805#true} is VALID [2018-11-23 12:17:07,294 INFO L273 TraceCheckUtils]: 65: Hoare triple {11805#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {11805#true} is VALID [2018-11-23 12:17:07,294 INFO L273 TraceCheckUtils]: 66: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:07,295 INFO L273 TraceCheckUtils]: 67: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:07,295 INFO L273 TraceCheckUtils]: 68: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:07,295 INFO L273 TraceCheckUtils]: 69: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:07,295 INFO L273 TraceCheckUtils]: 70: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:07,295 INFO L273 TraceCheckUtils]: 71: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:07,295 INFO L273 TraceCheckUtils]: 72: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:07,296 INFO L273 TraceCheckUtils]: 73: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:07,296 INFO L273 TraceCheckUtils]: 74: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:07,296 INFO L273 TraceCheckUtils]: 75: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:07,296 INFO L273 TraceCheckUtils]: 76: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:07,296 INFO L273 TraceCheckUtils]: 77: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:07,296 INFO L273 TraceCheckUtils]: 78: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:07,297 INFO L273 TraceCheckUtils]: 79: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:07,297 INFO L273 TraceCheckUtils]: 80: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:07,297 INFO L273 TraceCheckUtils]: 81: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:07,297 INFO L273 TraceCheckUtils]: 82: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:07,297 INFO L273 TraceCheckUtils]: 83: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:07,297 INFO L273 TraceCheckUtils]: 84: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:07,298 INFO L273 TraceCheckUtils]: 85: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:07,298 INFO L273 TraceCheckUtils]: 86: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:07,298 INFO L273 TraceCheckUtils]: 87: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:07,298 INFO L273 TraceCheckUtils]: 88: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:07,298 INFO L273 TraceCheckUtils]: 89: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:07,298 INFO L273 TraceCheckUtils]: 90: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:07,299 INFO L273 TraceCheckUtils]: 91: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:07,299 INFO L273 TraceCheckUtils]: 92: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:07,299 INFO L273 TraceCheckUtils]: 93: Hoare triple {11805#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11805#true} is VALID [2018-11-23 12:17:07,299 INFO L273 TraceCheckUtils]: 94: Hoare triple {11805#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11805#true} is VALID [2018-11-23 12:17:07,299 INFO L273 TraceCheckUtils]: 95: Hoare triple {11805#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11805#true} is VALID [2018-11-23 12:17:07,299 INFO L273 TraceCheckUtils]: 96: Hoare triple {11805#true} assume !(~i~0 < 10); {11805#true} is VALID [2018-11-23 12:17:07,300 INFO L273 TraceCheckUtils]: 97: Hoare triple {11805#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11805#true} is VALID [2018-11-23 12:17:07,300 INFO L273 TraceCheckUtils]: 98: Hoare triple {11805#true} assume true; {11805#true} is VALID [2018-11-23 12:17:07,300 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {11805#true} {11805#true} #77#return; {11805#true} is VALID [2018-11-23 12:17:07,313 INFO L273 TraceCheckUtils]: 100: Hoare triple {11805#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; {12118#(<= main_~i~2 0)} is VALID [2018-11-23 12:17:07,322 INFO L273 TraceCheckUtils]: 101: Hoare triple {12118#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12118#(<= main_~i~2 0)} is VALID [2018-11-23 12:17:07,335 INFO L273 TraceCheckUtils]: 102: Hoare triple {12118#(<= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11808#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:07,344 INFO L273 TraceCheckUtils]: 103: Hoare triple {11808#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11808#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:07,345 INFO L273 TraceCheckUtils]: 104: Hoare triple {11808#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11809#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:07,348 INFO L273 TraceCheckUtils]: 105: Hoare triple {11809#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11809#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:07,348 INFO L273 TraceCheckUtils]: 106: Hoare triple {11809#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11810#(<= main_~i~2 3)} is VALID [2018-11-23 12:17:07,351 INFO L273 TraceCheckUtils]: 107: Hoare triple {11810#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11810#(<= main_~i~2 3)} is VALID [2018-11-23 12:17:07,351 INFO L273 TraceCheckUtils]: 108: Hoare triple {11810#(<= main_~i~2 3)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11811#(<= main_~i~2 4)} is VALID [2018-11-23 12:17:07,353 INFO L273 TraceCheckUtils]: 109: Hoare triple {11811#(<= main_~i~2 4)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11811#(<= main_~i~2 4)} is VALID [2018-11-23 12:17:07,353 INFO L273 TraceCheckUtils]: 110: Hoare triple {11811#(<= main_~i~2 4)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11812#(<= main_~i~2 5)} is VALID [2018-11-23 12:17:07,355 INFO L273 TraceCheckUtils]: 111: Hoare triple {11812#(<= main_~i~2 5)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11812#(<= main_~i~2 5)} is VALID [2018-11-23 12:17:07,355 INFO L273 TraceCheckUtils]: 112: Hoare triple {11812#(<= main_~i~2 5)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11813#(<= main_~i~2 6)} is VALID [2018-11-23 12:17:07,355 INFO L273 TraceCheckUtils]: 113: Hoare triple {11813#(<= main_~i~2 6)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {11813#(<= main_~i~2 6)} is VALID [2018-11-23 12:17:07,356 INFO L273 TraceCheckUtils]: 114: Hoare triple {11813#(<= main_~i~2 6)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {11814#(<= main_~i~2 7)} is VALID [2018-11-23 12:17:07,356 INFO L273 TraceCheckUtils]: 115: Hoare triple {11814#(<= main_~i~2 7)} assume !(~i~2 < 9); {11806#false} is VALID [2018-11-23 12:17:07,356 INFO L273 TraceCheckUtils]: 116: Hoare triple {11806#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {11806#false} is VALID [2018-11-23 12:17:07,356 INFO L256 TraceCheckUtils]: 117: Hoare triple {11806#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {11806#false} is VALID [2018-11-23 12:17:07,357 INFO L273 TraceCheckUtils]: 118: Hoare triple {11806#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {11806#false} is VALID [2018-11-23 12:17:07,357 INFO L273 TraceCheckUtils]: 119: Hoare triple {11806#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11806#false} is VALID [2018-11-23 12:17:07,357 INFO L273 TraceCheckUtils]: 120: Hoare triple {11806#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11806#false} is VALID [2018-11-23 12:17:07,357 INFO L273 TraceCheckUtils]: 121: Hoare triple {11806#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11806#false} is VALID [2018-11-23 12:17:07,357 INFO L273 TraceCheckUtils]: 122: Hoare triple {11806#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11806#false} is VALID [2018-11-23 12:17:07,357 INFO L273 TraceCheckUtils]: 123: Hoare triple {11806#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11806#false} is VALID [2018-11-23 12:17:07,357 INFO L273 TraceCheckUtils]: 124: Hoare triple {11806#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11806#false} is VALID [2018-11-23 12:17:07,357 INFO L273 TraceCheckUtils]: 125: Hoare triple {11806#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11806#false} is VALID [2018-11-23 12:17:07,357 INFO L273 TraceCheckUtils]: 126: Hoare triple {11806#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11806#false} is VALID [2018-11-23 12:17:07,358 INFO L273 TraceCheckUtils]: 127: Hoare triple {11806#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11806#false} is VALID [2018-11-23 12:17:07,358 INFO L273 TraceCheckUtils]: 128: Hoare triple {11806#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11806#false} is VALID [2018-11-23 12:17:07,358 INFO L273 TraceCheckUtils]: 129: Hoare triple {11806#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11806#false} is VALID [2018-11-23 12:17:07,358 INFO L273 TraceCheckUtils]: 130: Hoare triple {11806#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11806#false} is VALID [2018-11-23 12:17:07,358 INFO L273 TraceCheckUtils]: 131: Hoare triple {11806#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11806#false} is VALID [2018-11-23 12:17:07,358 INFO L273 TraceCheckUtils]: 132: Hoare triple {11806#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11806#false} is VALID [2018-11-23 12:17:07,358 INFO L273 TraceCheckUtils]: 133: Hoare triple {11806#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11806#false} is VALID [2018-11-23 12:17:07,358 INFO L273 TraceCheckUtils]: 134: Hoare triple {11806#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11806#false} is VALID [2018-11-23 12:17:07,358 INFO L273 TraceCheckUtils]: 135: Hoare triple {11806#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11806#false} is VALID [2018-11-23 12:17:07,358 INFO L273 TraceCheckUtils]: 136: Hoare triple {11806#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11806#false} is VALID [2018-11-23 12:17:07,359 INFO L273 TraceCheckUtils]: 137: Hoare triple {11806#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11806#false} is VALID [2018-11-23 12:17:07,359 INFO L273 TraceCheckUtils]: 138: Hoare triple {11806#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11806#false} is VALID [2018-11-23 12:17:07,359 INFO L273 TraceCheckUtils]: 139: Hoare triple {11806#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11806#false} is VALID [2018-11-23 12:17:07,359 INFO L273 TraceCheckUtils]: 140: Hoare triple {11806#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11806#false} is VALID [2018-11-23 12:17:07,359 INFO L273 TraceCheckUtils]: 141: Hoare triple {11806#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11806#false} is VALID [2018-11-23 12:17:07,359 INFO L273 TraceCheckUtils]: 142: Hoare triple {11806#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11806#false} is VALID [2018-11-23 12:17:07,359 INFO L273 TraceCheckUtils]: 143: Hoare triple {11806#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11806#false} is VALID [2018-11-23 12:17:07,359 INFO L273 TraceCheckUtils]: 144: Hoare triple {11806#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11806#false} is VALID [2018-11-23 12:17:07,359 INFO L273 TraceCheckUtils]: 145: Hoare triple {11806#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11806#false} is VALID [2018-11-23 12:17:07,360 INFO L273 TraceCheckUtils]: 146: Hoare triple {11806#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {11806#false} is VALID [2018-11-23 12:17:07,360 INFO L273 TraceCheckUtils]: 147: Hoare triple {11806#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {11806#false} is VALID [2018-11-23 12:17:07,360 INFO L273 TraceCheckUtils]: 148: Hoare triple {11806#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {11806#false} is VALID [2018-11-23 12:17:07,360 INFO L273 TraceCheckUtils]: 149: Hoare triple {11806#false} assume !(~i~0 < 10); {11806#false} is VALID [2018-11-23 12:17:07,360 INFO L273 TraceCheckUtils]: 150: Hoare triple {11806#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {11806#false} is VALID [2018-11-23 12:17:07,360 INFO L273 TraceCheckUtils]: 151: Hoare triple {11806#false} assume true; {11806#false} is VALID [2018-11-23 12:17:07,360 INFO L268 TraceCheckUtils]: 152: Hoare quadruple {11806#false} {11806#false} #79#return; {11806#false} is VALID [2018-11-23 12:17:07,361 INFO L273 TraceCheckUtils]: 153: Hoare triple {11806#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {11806#false} is VALID [2018-11-23 12:17:07,361 INFO L273 TraceCheckUtils]: 154: Hoare triple {11806#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {11806#false} is VALID [2018-11-23 12:17:07,361 INFO L273 TraceCheckUtils]: 155: Hoare triple {11806#false} assume !false; {11806#false} is VALID [2018-11-23 12:17:07,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 650 proven. 49 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2018-11-23 12:17:07,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:07,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:17:07,392 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 156 [2018-11-23 12:17:07,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:07,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:17:07,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:07,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:17:07,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:17:07,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:17:07,525 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand 11 states. [2018-11-23 12:17:07,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:07,779 INFO L93 Difference]: Finished difference Result 131 states and 156 transitions. [2018-11-23 12:17:07,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:17:07,779 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 156 [2018-11-23 12:17:07,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:07,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:17:07,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2018-11-23 12:17:07,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:17:07,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2018-11-23 12:17:07,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 63 transitions. [2018-11-23 12:17:07,838 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:17:07,840 INFO L225 Difference]: With dead ends: 131 [2018-11-23 12:17:07,840 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 12:17:07,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 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:17:07,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 12:17:07,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-23 12:17:07,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:07,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 89 states. [2018-11-23 12:17:07,869 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 89 states. [2018-11-23 12:17:07,870 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 89 states. [2018-11-23 12:17:07,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:07,872 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2018-11-23 12:17:07,872 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2018-11-23 12:17:07,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:07,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:07,873 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 90 states. [2018-11-23 12:17:07,873 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 90 states. [2018-11-23 12:17:07,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:07,875 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2018-11-23 12:17:07,875 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2018-11-23 12:17:07,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:07,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:07,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:07,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:07,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 12:17:07,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2018-11-23 12:17:07,878 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 156 [2018-11-23 12:17:07,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:07,878 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2018-11-23 12:17:07,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:17:07,878 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2018-11-23 12:17:07,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-23 12:17:07,879 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:07,879 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 10, 10, 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:17:07,880 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:07,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:07,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1589640614, now seen corresponding path program 19 times [2018-11-23 12:17:07,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:07,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:07,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:07,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:07,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:08,266 INFO L256 TraceCheckUtils]: 0: Hoare triple {12774#true} call ULTIMATE.init(); {12774#true} is VALID [2018-11-23 12:17:08,266 INFO L273 TraceCheckUtils]: 1: Hoare triple {12774#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12774#true} is VALID [2018-11-23 12:17:08,266 INFO L273 TraceCheckUtils]: 2: Hoare triple {12774#true} assume true; {12774#true} is VALID [2018-11-23 12:17:08,267 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12774#true} {12774#true} #71#return; {12774#true} is VALID [2018-11-23 12:17:08,267 INFO L256 TraceCheckUtils]: 4: Hoare triple {12774#true} call #t~ret14 := main(); {12774#true} is VALID [2018-11-23 12:17:08,267 INFO L273 TraceCheckUtils]: 5: Hoare triple {12774#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {12774#true} is VALID [2018-11-23 12:17:08,267 INFO L273 TraceCheckUtils]: 6: Hoare triple {12774#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12774#true} is VALID [2018-11-23 12:17:08,267 INFO L273 TraceCheckUtils]: 7: Hoare triple {12774#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12774#true} is VALID [2018-11-23 12:17:08,267 INFO L273 TraceCheckUtils]: 8: Hoare triple {12774#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12774#true} is VALID [2018-11-23 12:17:08,267 INFO L273 TraceCheckUtils]: 9: Hoare triple {12774#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12774#true} is VALID [2018-11-23 12:17:08,267 INFO L273 TraceCheckUtils]: 10: Hoare triple {12774#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12774#true} is VALID [2018-11-23 12:17:08,267 INFO L273 TraceCheckUtils]: 11: Hoare triple {12774#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12774#true} is VALID [2018-11-23 12:17:08,268 INFO L273 TraceCheckUtils]: 12: Hoare triple {12774#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12774#true} is VALID [2018-11-23 12:17:08,268 INFO L273 TraceCheckUtils]: 13: Hoare triple {12774#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12774#true} is VALID [2018-11-23 12:17:08,268 INFO L273 TraceCheckUtils]: 14: Hoare triple {12774#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12774#true} is VALID [2018-11-23 12:17:08,268 INFO L273 TraceCheckUtils]: 15: Hoare triple {12774#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12774#true} is VALID [2018-11-23 12:17:08,268 INFO L273 TraceCheckUtils]: 16: Hoare triple {12774#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12774#true} is VALID [2018-11-23 12:17:08,268 INFO L273 TraceCheckUtils]: 17: Hoare triple {12774#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12774#true} is VALID [2018-11-23 12:17:08,268 INFO L273 TraceCheckUtils]: 18: Hoare triple {12774#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12774#true} is VALID [2018-11-23 12:17:08,268 INFO L273 TraceCheckUtils]: 19: Hoare triple {12774#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12774#true} is VALID [2018-11-23 12:17:08,269 INFO L273 TraceCheckUtils]: 20: Hoare triple {12774#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12774#true} is VALID [2018-11-23 12:17:08,269 INFO L273 TraceCheckUtils]: 21: Hoare triple {12774#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12774#true} is VALID [2018-11-23 12:17:08,269 INFO L273 TraceCheckUtils]: 22: Hoare triple {12774#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12774#true} is VALID [2018-11-23 12:17:08,269 INFO L273 TraceCheckUtils]: 23: Hoare triple {12774#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12774#true} is VALID [2018-11-23 12:17:08,269 INFO L273 TraceCheckUtils]: 24: Hoare triple {12774#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12774#true} is VALID [2018-11-23 12:17:08,269 INFO L273 TraceCheckUtils]: 25: Hoare triple {12774#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12774#true} is VALID [2018-11-23 12:17:08,270 INFO L273 TraceCheckUtils]: 26: Hoare triple {12774#true} assume !(~i~1 < 10); {12774#true} is VALID [2018-11-23 12:17:08,270 INFO L256 TraceCheckUtils]: 27: Hoare triple {12774#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {12774#true} is VALID [2018-11-23 12:17:08,270 INFO L273 TraceCheckUtils]: 28: Hoare triple {12774#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {12774#true} is VALID [2018-11-23 12:17:08,270 INFO L273 TraceCheckUtils]: 29: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,270 INFO L273 TraceCheckUtils]: 30: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,271 INFO L273 TraceCheckUtils]: 31: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,271 INFO L273 TraceCheckUtils]: 32: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,271 INFO L273 TraceCheckUtils]: 33: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,271 INFO L273 TraceCheckUtils]: 34: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,271 INFO L273 TraceCheckUtils]: 35: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,271 INFO L273 TraceCheckUtils]: 36: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,272 INFO L273 TraceCheckUtils]: 37: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,272 INFO L273 TraceCheckUtils]: 38: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,272 INFO L273 TraceCheckUtils]: 39: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,272 INFO L273 TraceCheckUtils]: 40: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,272 INFO L273 TraceCheckUtils]: 41: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,272 INFO L273 TraceCheckUtils]: 42: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,272 INFO L273 TraceCheckUtils]: 43: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,272 INFO L273 TraceCheckUtils]: 44: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,272 INFO L273 TraceCheckUtils]: 45: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,273 INFO L273 TraceCheckUtils]: 46: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,273 INFO L273 TraceCheckUtils]: 47: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,273 INFO L273 TraceCheckUtils]: 48: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,273 INFO L273 TraceCheckUtils]: 49: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,273 INFO L273 TraceCheckUtils]: 50: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,273 INFO L273 TraceCheckUtils]: 51: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,273 INFO L273 TraceCheckUtils]: 52: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,273 INFO L273 TraceCheckUtils]: 53: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,273 INFO L273 TraceCheckUtils]: 54: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,274 INFO L273 TraceCheckUtils]: 55: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,274 INFO L273 TraceCheckUtils]: 56: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,274 INFO L273 TraceCheckUtils]: 57: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,274 INFO L273 TraceCheckUtils]: 58: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,274 INFO L273 TraceCheckUtils]: 59: Hoare triple {12774#true} assume !(~i~0 < 10); {12774#true} is VALID [2018-11-23 12:17:08,274 INFO L273 TraceCheckUtils]: 60: Hoare triple {12774#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12774#true} is VALID [2018-11-23 12:17:08,274 INFO L273 TraceCheckUtils]: 61: Hoare triple {12774#true} assume true; {12774#true} is VALID [2018-11-23 12:17:08,274 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {12774#true} {12774#true} #75#return; {12774#true} is VALID [2018-11-23 12:17:08,274 INFO L273 TraceCheckUtils]: 63: Hoare triple {12774#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); {12774#true} is VALID [2018-11-23 12:17:08,274 INFO L256 TraceCheckUtils]: 64: Hoare triple {12774#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {12774#true} is VALID [2018-11-23 12:17:08,275 INFO L273 TraceCheckUtils]: 65: Hoare triple {12774#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {12774#true} is VALID [2018-11-23 12:17:08,275 INFO L273 TraceCheckUtils]: 66: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,275 INFO L273 TraceCheckUtils]: 67: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,275 INFO L273 TraceCheckUtils]: 68: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,275 INFO L273 TraceCheckUtils]: 69: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,275 INFO L273 TraceCheckUtils]: 70: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,275 INFO L273 TraceCheckUtils]: 71: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,275 INFO L273 TraceCheckUtils]: 72: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,275 INFO L273 TraceCheckUtils]: 73: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,276 INFO L273 TraceCheckUtils]: 74: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,276 INFO L273 TraceCheckUtils]: 75: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,276 INFO L273 TraceCheckUtils]: 76: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,276 INFO L273 TraceCheckUtils]: 77: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,276 INFO L273 TraceCheckUtils]: 78: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,276 INFO L273 TraceCheckUtils]: 79: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,276 INFO L273 TraceCheckUtils]: 80: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,276 INFO L273 TraceCheckUtils]: 81: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,277 INFO L273 TraceCheckUtils]: 82: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,277 INFO L273 TraceCheckUtils]: 83: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,277 INFO L273 TraceCheckUtils]: 84: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,277 INFO L273 TraceCheckUtils]: 85: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,277 INFO L273 TraceCheckUtils]: 86: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,277 INFO L273 TraceCheckUtils]: 87: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,277 INFO L273 TraceCheckUtils]: 88: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,278 INFO L273 TraceCheckUtils]: 89: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,278 INFO L273 TraceCheckUtils]: 90: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,278 INFO L273 TraceCheckUtils]: 91: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,278 INFO L273 TraceCheckUtils]: 92: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,278 INFO L273 TraceCheckUtils]: 93: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,278 INFO L273 TraceCheckUtils]: 94: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,279 INFO L273 TraceCheckUtils]: 95: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,279 INFO L273 TraceCheckUtils]: 96: Hoare triple {12774#true} assume !(~i~0 < 10); {12774#true} is VALID [2018-11-23 12:17:08,279 INFO L273 TraceCheckUtils]: 97: Hoare triple {12774#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12774#true} is VALID [2018-11-23 12:17:08,279 INFO L273 TraceCheckUtils]: 98: Hoare triple {12774#true} assume true; {12774#true} is VALID [2018-11-23 12:17:08,279 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {12774#true} {12774#true} #77#return; {12774#true} is VALID [2018-11-23 12:17:08,281 INFO L273 TraceCheckUtils]: 100: Hoare triple {12774#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; {12776#(= main_~i~2 0)} is VALID [2018-11-23 12:17:08,283 INFO L273 TraceCheckUtils]: 101: Hoare triple {12776#(= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12776#(= main_~i~2 0)} is VALID [2018-11-23 12:17:08,283 INFO L273 TraceCheckUtils]: 102: Hoare triple {12776#(= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12777#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:08,286 INFO L273 TraceCheckUtils]: 103: Hoare triple {12777#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12777#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:08,286 INFO L273 TraceCheckUtils]: 104: Hoare triple {12777#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12778#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:08,289 INFO L273 TraceCheckUtils]: 105: Hoare triple {12778#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12778#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:08,289 INFO L273 TraceCheckUtils]: 106: Hoare triple {12778#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12779#(<= main_~i~2 3)} is VALID [2018-11-23 12:17:08,291 INFO L273 TraceCheckUtils]: 107: Hoare triple {12779#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12779#(<= main_~i~2 3)} is VALID [2018-11-23 12:17:08,291 INFO L273 TraceCheckUtils]: 108: Hoare triple {12779#(<= main_~i~2 3)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12780#(<= main_~i~2 4)} is VALID [2018-11-23 12:17:08,294 INFO L273 TraceCheckUtils]: 109: Hoare triple {12780#(<= main_~i~2 4)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12780#(<= main_~i~2 4)} is VALID [2018-11-23 12:17:08,294 INFO L273 TraceCheckUtils]: 110: Hoare triple {12780#(<= main_~i~2 4)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12781#(<= main_~i~2 5)} is VALID [2018-11-23 12:17:08,297 INFO L273 TraceCheckUtils]: 111: Hoare triple {12781#(<= main_~i~2 5)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12781#(<= main_~i~2 5)} is VALID [2018-11-23 12:17:08,297 INFO L273 TraceCheckUtils]: 112: Hoare triple {12781#(<= main_~i~2 5)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12782#(<= main_~i~2 6)} is VALID [2018-11-23 12:17:08,300 INFO L273 TraceCheckUtils]: 113: Hoare triple {12782#(<= main_~i~2 6)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12782#(<= main_~i~2 6)} is VALID [2018-11-23 12:17:08,302 INFO L273 TraceCheckUtils]: 114: Hoare triple {12782#(<= main_~i~2 6)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12783#(<= main_~i~2 7)} is VALID [2018-11-23 12:17:08,302 INFO L273 TraceCheckUtils]: 115: Hoare triple {12783#(<= main_~i~2 7)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12783#(<= main_~i~2 7)} is VALID [2018-11-23 12:17:08,304 INFO L273 TraceCheckUtils]: 116: Hoare triple {12783#(<= main_~i~2 7)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12784#(<= main_~i~2 8)} is VALID [2018-11-23 12:17:08,304 INFO L273 TraceCheckUtils]: 117: Hoare triple {12784#(<= main_~i~2 8)} assume !(~i~2 < 9); {12775#false} is VALID [2018-11-23 12:17:08,304 INFO L273 TraceCheckUtils]: 118: Hoare triple {12775#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {12775#false} is VALID [2018-11-23 12:17:08,304 INFO L256 TraceCheckUtils]: 119: Hoare triple {12775#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {12774#true} is VALID [2018-11-23 12:17:08,304 INFO L273 TraceCheckUtils]: 120: Hoare triple {12774#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {12774#true} is VALID [2018-11-23 12:17:08,305 INFO L273 TraceCheckUtils]: 121: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,305 INFO L273 TraceCheckUtils]: 122: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,305 INFO L273 TraceCheckUtils]: 123: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,305 INFO L273 TraceCheckUtils]: 124: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,305 INFO L273 TraceCheckUtils]: 125: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,305 INFO L273 TraceCheckUtils]: 126: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,305 INFO L273 TraceCheckUtils]: 127: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,305 INFO L273 TraceCheckUtils]: 128: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,305 INFO L273 TraceCheckUtils]: 129: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,305 INFO L273 TraceCheckUtils]: 130: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,306 INFO L273 TraceCheckUtils]: 131: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,306 INFO L273 TraceCheckUtils]: 132: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,306 INFO L273 TraceCheckUtils]: 133: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,306 INFO L273 TraceCheckUtils]: 134: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,306 INFO L273 TraceCheckUtils]: 135: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,306 INFO L273 TraceCheckUtils]: 136: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,306 INFO L273 TraceCheckUtils]: 137: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,306 INFO L273 TraceCheckUtils]: 138: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,306 INFO L273 TraceCheckUtils]: 139: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,307 INFO L273 TraceCheckUtils]: 140: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,307 INFO L273 TraceCheckUtils]: 141: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,307 INFO L273 TraceCheckUtils]: 142: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,307 INFO L273 TraceCheckUtils]: 143: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,307 INFO L273 TraceCheckUtils]: 144: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,307 INFO L273 TraceCheckUtils]: 145: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,307 INFO L273 TraceCheckUtils]: 146: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,307 INFO L273 TraceCheckUtils]: 147: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,307 INFO L273 TraceCheckUtils]: 148: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,307 INFO L273 TraceCheckUtils]: 149: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,308 INFO L273 TraceCheckUtils]: 150: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,308 INFO L273 TraceCheckUtils]: 151: Hoare triple {12774#true} assume !(~i~0 < 10); {12774#true} is VALID [2018-11-23 12:17:08,308 INFO L273 TraceCheckUtils]: 152: Hoare triple {12774#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12774#true} is VALID [2018-11-23 12:17:08,308 INFO L273 TraceCheckUtils]: 153: Hoare triple {12774#true} assume true; {12774#true} is VALID [2018-11-23 12:17:08,308 INFO L268 TraceCheckUtils]: 154: Hoare quadruple {12774#true} {12775#false} #79#return; {12775#false} is VALID [2018-11-23 12:17:08,308 INFO L273 TraceCheckUtils]: 155: Hoare triple {12775#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {12775#false} is VALID [2018-11-23 12:17:08,308 INFO L273 TraceCheckUtils]: 156: Hoare triple {12775#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {12775#false} is VALID [2018-11-23 12:17:08,308 INFO L273 TraceCheckUtils]: 157: Hoare triple {12775#false} assume !false; {12775#false} is VALID [2018-11-23 12:17:08,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1574 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2018-11-23 12:17:08,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:08,318 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:08,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:17:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:08,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:08,754 INFO L256 TraceCheckUtils]: 0: Hoare triple {12774#true} call ULTIMATE.init(); {12774#true} is VALID [2018-11-23 12:17:08,755 INFO L273 TraceCheckUtils]: 1: Hoare triple {12774#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12774#true} is VALID [2018-11-23 12:17:08,755 INFO L273 TraceCheckUtils]: 2: Hoare triple {12774#true} assume true; {12774#true} is VALID [2018-11-23 12:17:08,755 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12774#true} {12774#true} #71#return; {12774#true} is VALID [2018-11-23 12:17:08,756 INFO L256 TraceCheckUtils]: 4: Hoare triple {12774#true} call #t~ret14 := main(); {12774#true} is VALID [2018-11-23 12:17:08,756 INFO L273 TraceCheckUtils]: 5: Hoare triple {12774#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {12774#true} is VALID [2018-11-23 12:17:08,756 INFO L273 TraceCheckUtils]: 6: Hoare triple {12774#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12774#true} is VALID [2018-11-23 12:17:08,756 INFO L273 TraceCheckUtils]: 7: Hoare triple {12774#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12774#true} is VALID [2018-11-23 12:17:08,757 INFO L273 TraceCheckUtils]: 8: Hoare triple {12774#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12774#true} is VALID [2018-11-23 12:17:08,757 INFO L273 TraceCheckUtils]: 9: Hoare triple {12774#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12774#true} is VALID [2018-11-23 12:17:08,757 INFO L273 TraceCheckUtils]: 10: Hoare triple {12774#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12774#true} is VALID [2018-11-23 12:17:08,758 INFO L273 TraceCheckUtils]: 11: Hoare triple {12774#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12774#true} is VALID [2018-11-23 12:17:08,758 INFO L273 TraceCheckUtils]: 12: Hoare triple {12774#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12774#true} is VALID [2018-11-23 12:17:08,758 INFO L273 TraceCheckUtils]: 13: Hoare triple {12774#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12774#true} is VALID [2018-11-23 12:17:08,758 INFO L273 TraceCheckUtils]: 14: Hoare triple {12774#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12774#true} is VALID [2018-11-23 12:17:08,758 INFO L273 TraceCheckUtils]: 15: Hoare triple {12774#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12774#true} is VALID [2018-11-23 12:17:08,759 INFO L273 TraceCheckUtils]: 16: Hoare triple {12774#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12774#true} is VALID [2018-11-23 12:17:08,759 INFO L273 TraceCheckUtils]: 17: Hoare triple {12774#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12774#true} is VALID [2018-11-23 12:17:08,759 INFO L273 TraceCheckUtils]: 18: Hoare triple {12774#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12774#true} is VALID [2018-11-23 12:17:08,759 INFO L273 TraceCheckUtils]: 19: Hoare triple {12774#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12774#true} is VALID [2018-11-23 12:17:08,759 INFO L273 TraceCheckUtils]: 20: Hoare triple {12774#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12774#true} is VALID [2018-11-23 12:17:08,759 INFO L273 TraceCheckUtils]: 21: Hoare triple {12774#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12774#true} is VALID [2018-11-23 12:17:08,760 INFO L273 TraceCheckUtils]: 22: Hoare triple {12774#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12774#true} is VALID [2018-11-23 12:17:08,760 INFO L273 TraceCheckUtils]: 23: Hoare triple {12774#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12774#true} is VALID [2018-11-23 12:17:08,760 INFO L273 TraceCheckUtils]: 24: Hoare triple {12774#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {12774#true} is VALID [2018-11-23 12:17:08,760 INFO L273 TraceCheckUtils]: 25: Hoare triple {12774#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12774#true} is VALID [2018-11-23 12:17:08,760 INFO L273 TraceCheckUtils]: 26: Hoare triple {12774#true} assume !(~i~1 < 10); {12774#true} is VALID [2018-11-23 12:17:08,760 INFO L256 TraceCheckUtils]: 27: Hoare triple {12774#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {12774#true} is VALID [2018-11-23 12:17:08,760 INFO L273 TraceCheckUtils]: 28: Hoare triple {12774#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {12774#true} is VALID [2018-11-23 12:17:08,761 INFO L273 TraceCheckUtils]: 29: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,761 INFO L273 TraceCheckUtils]: 30: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,761 INFO L273 TraceCheckUtils]: 31: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,761 INFO L273 TraceCheckUtils]: 32: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,761 INFO L273 TraceCheckUtils]: 33: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,761 INFO L273 TraceCheckUtils]: 34: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,761 INFO L273 TraceCheckUtils]: 35: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,762 INFO L273 TraceCheckUtils]: 36: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,762 INFO L273 TraceCheckUtils]: 37: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,762 INFO L273 TraceCheckUtils]: 38: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,762 INFO L273 TraceCheckUtils]: 39: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,762 INFO L273 TraceCheckUtils]: 40: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,762 INFO L273 TraceCheckUtils]: 41: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,763 INFO L273 TraceCheckUtils]: 42: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,763 INFO L273 TraceCheckUtils]: 43: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,763 INFO L273 TraceCheckUtils]: 44: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,763 INFO L273 TraceCheckUtils]: 45: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,763 INFO L273 TraceCheckUtils]: 46: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,763 INFO L273 TraceCheckUtils]: 47: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,763 INFO L273 TraceCheckUtils]: 48: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,764 INFO L273 TraceCheckUtils]: 49: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,764 INFO L273 TraceCheckUtils]: 50: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,764 INFO L273 TraceCheckUtils]: 51: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,764 INFO L273 TraceCheckUtils]: 52: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,764 INFO L273 TraceCheckUtils]: 53: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,764 INFO L273 TraceCheckUtils]: 54: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,764 INFO L273 TraceCheckUtils]: 55: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,765 INFO L273 TraceCheckUtils]: 56: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,765 INFO L273 TraceCheckUtils]: 57: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,765 INFO L273 TraceCheckUtils]: 58: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,765 INFO L273 TraceCheckUtils]: 59: Hoare triple {12774#true} assume !(~i~0 < 10); {12774#true} is VALID [2018-11-23 12:17:08,765 INFO L273 TraceCheckUtils]: 60: Hoare triple {12774#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12774#true} is VALID [2018-11-23 12:17:08,765 INFO L273 TraceCheckUtils]: 61: Hoare triple {12774#true} assume true; {12774#true} is VALID [2018-11-23 12:17:08,766 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {12774#true} {12774#true} #75#return; {12774#true} is VALID [2018-11-23 12:17:08,766 INFO L273 TraceCheckUtils]: 63: Hoare triple {12774#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); {12774#true} is VALID [2018-11-23 12:17:08,766 INFO L256 TraceCheckUtils]: 64: Hoare triple {12774#true} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {12774#true} is VALID [2018-11-23 12:17:08,766 INFO L273 TraceCheckUtils]: 65: Hoare triple {12774#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {12774#true} is VALID [2018-11-23 12:17:08,766 INFO L273 TraceCheckUtils]: 66: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,766 INFO L273 TraceCheckUtils]: 67: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,767 INFO L273 TraceCheckUtils]: 68: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,767 INFO L273 TraceCheckUtils]: 69: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,767 INFO L273 TraceCheckUtils]: 70: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,767 INFO L273 TraceCheckUtils]: 71: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,767 INFO L273 TraceCheckUtils]: 72: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,767 INFO L273 TraceCheckUtils]: 73: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,767 INFO L273 TraceCheckUtils]: 74: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,768 INFO L273 TraceCheckUtils]: 75: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,768 INFO L273 TraceCheckUtils]: 76: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,768 INFO L273 TraceCheckUtils]: 77: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,768 INFO L273 TraceCheckUtils]: 78: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,768 INFO L273 TraceCheckUtils]: 79: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,768 INFO L273 TraceCheckUtils]: 80: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,769 INFO L273 TraceCheckUtils]: 81: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,769 INFO L273 TraceCheckUtils]: 82: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,769 INFO L273 TraceCheckUtils]: 83: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,769 INFO L273 TraceCheckUtils]: 84: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,769 INFO L273 TraceCheckUtils]: 85: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,769 INFO L273 TraceCheckUtils]: 86: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,769 INFO L273 TraceCheckUtils]: 87: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,770 INFO L273 TraceCheckUtils]: 88: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,770 INFO L273 TraceCheckUtils]: 89: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,770 INFO L273 TraceCheckUtils]: 90: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,770 INFO L273 TraceCheckUtils]: 91: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,770 INFO L273 TraceCheckUtils]: 92: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,770 INFO L273 TraceCheckUtils]: 93: Hoare triple {12774#true} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12774#true} is VALID [2018-11-23 12:17:08,771 INFO L273 TraceCheckUtils]: 94: Hoare triple {12774#true} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12774#true} is VALID [2018-11-23 12:17:08,771 INFO L273 TraceCheckUtils]: 95: Hoare triple {12774#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12774#true} is VALID [2018-11-23 12:17:08,771 INFO L273 TraceCheckUtils]: 96: Hoare triple {12774#true} assume !(~i~0 < 10); {12774#true} is VALID [2018-11-23 12:17:08,771 INFO L273 TraceCheckUtils]: 97: Hoare triple {12774#true} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12774#true} is VALID [2018-11-23 12:17:08,771 INFO L273 TraceCheckUtils]: 98: Hoare triple {12774#true} assume true; {12774#true} is VALID [2018-11-23 12:17:08,771 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {12774#true} {12774#true} #77#return; {12774#true} is VALID [2018-11-23 12:17:08,784 INFO L273 TraceCheckUtils]: 100: Hoare triple {12774#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; {13088#(<= main_~i~2 0)} is VALID [2018-11-23 12:17:08,785 INFO L273 TraceCheckUtils]: 101: Hoare triple {13088#(<= main_~i~2 0)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13088#(<= main_~i~2 0)} is VALID [2018-11-23 12:17:08,785 INFO L273 TraceCheckUtils]: 102: Hoare triple {13088#(<= main_~i~2 0)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12777#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:08,790 INFO L273 TraceCheckUtils]: 103: Hoare triple {12777#(<= main_~i~2 1)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12777#(<= main_~i~2 1)} is VALID [2018-11-23 12:17:08,790 INFO L273 TraceCheckUtils]: 104: Hoare triple {12777#(<= main_~i~2 1)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12778#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:08,791 INFO L273 TraceCheckUtils]: 105: Hoare triple {12778#(<= main_~i~2 2)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12778#(<= main_~i~2 2)} is VALID [2018-11-23 12:17:08,791 INFO L273 TraceCheckUtils]: 106: Hoare triple {12778#(<= main_~i~2 2)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12779#(<= main_~i~2 3)} is VALID [2018-11-23 12:17:08,791 INFO L273 TraceCheckUtils]: 107: Hoare triple {12779#(<= main_~i~2 3)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12779#(<= main_~i~2 3)} is VALID [2018-11-23 12:17:08,792 INFO L273 TraceCheckUtils]: 108: Hoare triple {12779#(<= main_~i~2 3)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12780#(<= main_~i~2 4)} is VALID [2018-11-23 12:17:08,792 INFO L273 TraceCheckUtils]: 109: Hoare triple {12780#(<= main_~i~2 4)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12780#(<= main_~i~2 4)} is VALID [2018-11-23 12:17:08,792 INFO L273 TraceCheckUtils]: 110: Hoare triple {12780#(<= main_~i~2 4)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12781#(<= main_~i~2 5)} is VALID [2018-11-23 12:17:08,793 INFO L273 TraceCheckUtils]: 111: Hoare triple {12781#(<= main_~i~2 5)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12781#(<= main_~i~2 5)} is VALID [2018-11-23 12:17:08,793 INFO L273 TraceCheckUtils]: 112: Hoare triple {12781#(<= main_~i~2 5)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12782#(<= main_~i~2 6)} is VALID [2018-11-23 12:17:08,795 INFO L273 TraceCheckUtils]: 113: Hoare triple {12782#(<= main_~i~2 6)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12782#(<= main_~i~2 6)} is VALID [2018-11-23 12:17:08,795 INFO L273 TraceCheckUtils]: 114: Hoare triple {12782#(<= main_~i~2 6)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12783#(<= main_~i~2 7)} is VALID [2018-11-23 12:17:08,796 INFO L273 TraceCheckUtils]: 115: Hoare triple {12783#(<= main_~i~2 7)} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {12783#(<= main_~i~2 7)} is VALID [2018-11-23 12:17:08,796 INFO L273 TraceCheckUtils]: 116: Hoare triple {12783#(<= main_~i~2 7)} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {12784#(<= main_~i~2 8)} is VALID [2018-11-23 12:17:08,797 INFO L273 TraceCheckUtils]: 117: Hoare triple {12784#(<= main_~i~2 8)} assume !(~i~2 < 9); {12775#false} is VALID [2018-11-23 12:17:08,797 INFO L273 TraceCheckUtils]: 118: Hoare triple {12775#false} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {12775#false} is VALID [2018-11-23 12:17:08,797 INFO L256 TraceCheckUtils]: 119: Hoare triple {12775#false} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {12775#false} is VALID [2018-11-23 12:17:08,797 INFO L273 TraceCheckUtils]: 120: Hoare triple {12775#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {12775#false} is VALID [2018-11-23 12:17:08,797 INFO L273 TraceCheckUtils]: 121: Hoare triple {12775#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12775#false} is VALID [2018-11-23 12:17:08,797 INFO L273 TraceCheckUtils]: 122: Hoare triple {12775#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12775#false} is VALID [2018-11-23 12:17:08,797 INFO L273 TraceCheckUtils]: 123: Hoare triple {12775#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12775#false} is VALID [2018-11-23 12:17:08,797 INFO L273 TraceCheckUtils]: 124: Hoare triple {12775#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12775#false} is VALID [2018-11-23 12:17:08,797 INFO L273 TraceCheckUtils]: 125: Hoare triple {12775#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12775#false} is VALID [2018-11-23 12:17:08,798 INFO L273 TraceCheckUtils]: 126: Hoare triple {12775#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12775#false} is VALID [2018-11-23 12:17:08,798 INFO L273 TraceCheckUtils]: 127: Hoare triple {12775#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12775#false} is VALID [2018-11-23 12:17:08,798 INFO L273 TraceCheckUtils]: 128: Hoare triple {12775#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12775#false} is VALID [2018-11-23 12:17:08,798 INFO L273 TraceCheckUtils]: 129: Hoare triple {12775#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12775#false} is VALID [2018-11-23 12:17:08,798 INFO L273 TraceCheckUtils]: 130: Hoare triple {12775#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12775#false} is VALID [2018-11-23 12:17:08,798 INFO L273 TraceCheckUtils]: 131: Hoare triple {12775#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12775#false} is VALID [2018-11-23 12:17:08,798 INFO L273 TraceCheckUtils]: 132: Hoare triple {12775#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12775#false} is VALID [2018-11-23 12:17:08,798 INFO L273 TraceCheckUtils]: 133: Hoare triple {12775#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12775#false} is VALID [2018-11-23 12:17:08,798 INFO L273 TraceCheckUtils]: 134: Hoare triple {12775#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12775#false} is VALID [2018-11-23 12:17:08,798 INFO L273 TraceCheckUtils]: 135: Hoare triple {12775#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12775#false} is VALID [2018-11-23 12:17:08,799 INFO L273 TraceCheckUtils]: 136: Hoare triple {12775#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12775#false} is VALID [2018-11-23 12:17:08,799 INFO L273 TraceCheckUtils]: 137: Hoare triple {12775#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12775#false} is VALID [2018-11-23 12:17:08,799 INFO L273 TraceCheckUtils]: 138: Hoare triple {12775#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12775#false} is VALID [2018-11-23 12:17:08,799 INFO L273 TraceCheckUtils]: 139: Hoare triple {12775#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12775#false} is VALID [2018-11-23 12:17:08,799 INFO L273 TraceCheckUtils]: 140: Hoare triple {12775#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12775#false} is VALID [2018-11-23 12:17:08,799 INFO L273 TraceCheckUtils]: 141: Hoare triple {12775#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12775#false} is VALID [2018-11-23 12:17:08,799 INFO L273 TraceCheckUtils]: 142: Hoare triple {12775#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12775#false} is VALID [2018-11-23 12:17:08,799 INFO L273 TraceCheckUtils]: 143: Hoare triple {12775#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12775#false} is VALID [2018-11-23 12:17:08,799 INFO L273 TraceCheckUtils]: 144: Hoare triple {12775#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12775#false} is VALID [2018-11-23 12:17:08,800 INFO L273 TraceCheckUtils]: 145: Hoare triple {12775#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12775#false} is VALID [2018-11-23 12:17:08,800 INFO L273 TraceCheckUtils]: 146: Hoare triple {12775#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12775#false} is VALID [2018-11-23 12:17:08,800 INFO L273 TraceCheckUtils]: 147: Hoare triple {12775#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12775#false} is VALID [2018-11-23 12:17:08,800 INFO L273 TraceCheckUtils]: 148: Hoare triple {12775#false} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {12775#false} is VALID [2018-11-23 12:17:08,800 INFO L273 TraceCheckUtils]: 149: Hoare triple {12775#false} assume 0 == (if #t~mem1 < 0 && 0 != #t~mem1 % 2 then #t~mem1 % 2 - 2 else #t~mem1 % 2);havoc #t~mem1;#t~post2 := ~ret~0;~ret~0 := 1 + #t~post2;havoc #t~post2; {12775#false} is VALID [2018-11-23 12:17:08,800 INFO L273 TraceCheckUtils]: 150: Hoare triple {12775#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {12775#false} is VALID [2018-11-23 12:17:08,800 INFO L273 TraceCheckUtils]: 151: Hoare triple {12775#false} assume !(~i~0 < 10); {12775#false} is VALID [2018-11-23 12:17:08,800 INFO L273 TraceCheckUtils]: 152: Hoare triple {12775#false} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {12775#false} is VALID [2018-11-23 12:17:08,800 INFO L273 TraceCheckUtils]: 153: Hoare triple {12775#false} assume true; {12775#false} is VALID [2018-11-23 12:17:08,800 INFO L268 TraceCheckUtils]: 154: Hoare quadruple {12775#false} {12775#false} #79#return; {12775#false} is VALID [2018-11-23 12:17:08,801 INFO L273 TraceCheckUtils]: 155: Hoare triple {12775#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {12775#false} is VALID [2018-11-23 12:17:08,801 INFO L273 TraceCheckUtils]: 156: Hoare triple {12775#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {12775#false} is VALID [2018-11-23 12:17:08,801 INFO L273 TraceCheckUtils]: 157: Hoare triple {12775#false} assume !false; {12775#false} is VALID [2018-11-23 12:17:08,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1574 backedges. 650 proven. 64 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2018-11-23 12:17:08,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:08,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:17:08,836 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 158 [2018-11-23 12:17:08,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:08,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:17:08,898 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:08,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:17:08,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:17:08,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:17:08,899 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand 12 states. [2018-11-23 12:17:09,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:09,032 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2018-11-23 12:17:09,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:17:09,032 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 158 [2018-11-23 12:17:09,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:09,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:17:09,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2018-11-23 12:17:09,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:17:09,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2018-11-23 12:17:09,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2018-11-23 12:17:09,157 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:17:09,160 INFO L225 Difference]: With dead ends: 132 [2018-11-23 12:17:09,161 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 12:17:09,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:17:09,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 12:17:09,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-11-23 12:17:09,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:09,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 91 states. [2018-11-23 12:17:09,190 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2018-11-23 12:17:09,190 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2018-11-23 12:17:09,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:09,192 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2018-11-23 12:17:09,192 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2018-11-23 12:17:09,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:09,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:09,193 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2018-11-23 12:17:09,193 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2018-11-23 12:17:09,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:09,195 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2018-11-23 12:17:09,195 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2018-11-23 12:17:09,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:09,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:09,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:09,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:09,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 12:17:09,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2018-11-23 12:17:09,198 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 158 [2018-11-23 12:17:09,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:09,198 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2018-11-23 12:17:09,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:17:09,198 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2018-11-23 12:17:09,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-23 12:17:09,199 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:09,200 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 10, 10, 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:17:09,200 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:09,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:09,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1889351576, now seen corresponding path program 20 times [2018-11-23 12:17:09,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:09,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:09,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:09,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:17:09,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:11,409 INFO L256 TraceCheckUtils]: 0: Hoare triple {13757#true} call ULTIMATE.init(); {13757#true} is VALID [2018-11-23 12:17:11,410 INFO L273 TraceCheckUtils]: 1: Hoare triple {13757#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13757#true} is VALID [2018-11-23 12:17:11,410 INFO L273 TraceCheckUtils]: 2: Hoare triple {13757#true} assume true; {13757#true} is VALID [2018-11-23 12:17:11,410 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13757#true} {13757#true} #71#return; {13757#true} is VALID [2018-11-23 12:17:11,410 INFO L256 TraceCheckUtils]: 4: Hoare triple {13757#true} call #t~ret14 := main(); {13757#true} is VALID [2018-11-23 12:17:11,410 INFO L273 TraceCheckUtils]: 5: Hoare triple {13757#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {13757#true} is VALID [2018-11-23 12:17:11,410 INFO L273 TraceCheckUtils]: 6: Hoare triple {13757#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13757#true} is VALID [2018-11-23 12:17:11,410 INFO L273 TraceCheckUtils]: 7: Hoare triple {13757#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13757#true} is VALID [2018-11-23 12:17:11,410 INFO L273 TraceCheckUtils]: 8: Hoare triple {13757#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13757#true} is VALID [2018-11-23 12:17:11,411 INFO L273 TraceCheckUtils]: 9: Hoare triple {13757#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13757#true} is VALID [2018-11-23 12:17:11,411 INFO L273 TraceCheckUtils]: 10: Hoare triple {13757#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13757#true} is VALID [2018-11-23 12:17:11,411 INFO L273 TraceCheckUtils]: 11: Hoare triple {13757#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13757#true} is VALID [2018-11-23 12:17:11,411 INFO L273 TraceCheckUtils]: 12: Hoare triple {13757#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13757#true} is VALID [2018-11-23 12:17:11,411 INFO L273 TraceCheckUtils]: 13: Hoare triple {13757#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13757#true} is VALID [2018-11-23 12:17:11,411 INFO L273 TraceCheckUtils]: 14: Hoare triple {13757#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13757#true} is VALID [2018-11-23 12:17:11,411 INFO L273 TraceCheckUtils]: 15: Hoare triple {13757#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13757#true} is VALID [2018-11-23 12:17:11,411 INFO L273 TraceCheckUtils]: 16: Hoare triple {13757#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13757#true} is VALID [2018-11-23 12:17:11,412 INFO L273 TraceCheckUtils]: 17: Hoare triple {13757#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13757#true} is VALID [2018-11-23 12:17:11,412 INFO L273 TraceCheckUtils]: 18: Hoare triple {13757#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13757#true} is VALID [2018-11-23 12:17:11,412 INFO L273 TraceCheckUtils]: 19: Hoare triple {13757#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13757#true} is VALID [2018-11-23 12:17:11,412 INFO L273 TraceCheckUtils]: 20: Hoare triple {13757#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13757#true} is VALID [2018-11-23 12:17:11,412 INFO L273 TraceCheckUtils]: 21: Hoare triple {13757#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13757#true} is VALID [2018-11-23 12:17:11,413 INFO L273 TraceCheckUtils]: 22: Hoare triple {13757#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13757#true} is VALID [2018-11-23 12:17:11,413 INFO L273 TraceCheckUtils]: 23: Hoare triple {13757#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13757#true} is VALID [2018-11-23 12:17:11,413 INFO L273 TraceCheckUtils]: 24: Hoare triple {13757#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13757#true} is VALID [2018-11-23 12:17:11,413 INFO L273 TraceCheckUtils]: 25: Hoare triple {13757#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13757#true} is VALID [2018-11-23 12:17:11,413 INFO L273 TraceCheckUtils]: 26: Hoare triple {13757#true} assume !(~i~1 < 10); {13757#true} is VALID [2018-11-23 12:17:11,413 INFO L256 TraceCheckUtils]: 27: Hoare triple {13757#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {13757#true} is VALID [2018-11-23 12:17:11,414 INFO L273 TraceCheckUtils]: 28: Hoare triple {13757#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {13759#(= sep_~ret~0 0)} is VALID [2018-11-23 12:17:11,414 INFO L273 TraceCheckUtils]: 29: Hoare triple {13759#(= sep_~ret~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13759#(= sep_~ret~0 0)} is VALID [2018-11-23 12:17:11,415 INFO L273 TraceCheckUtils]: 30: Hoare triple {13759#(= sep_~ret~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; {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:17:11,415 INFO L273 TraceCheckUtils]: 31: Hoare triple {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:17:11,415 INFO L273 TraceCheckUtils]: 32: Hoare triple {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:17:11,416 INFO L273 TraceCheckUtils]: 33: Hoare triple {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~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; {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:17:11,416 INFO L273 TraceCheckUtils]: 34: Hoare triple {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:17:11,417 INFO L273 TraceCheckUtils]: 35: Hoare triple {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:17:11,418 INFO L273 TraceCheckUtils]: 36: Hoare triple {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~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; {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:17:11,418 INFO L273 TraceCheckUtils]: 37: Hoare triple {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:17:11,419 INFO L273 TraceCheckUtils]: 38: Hoare triple {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:17:11,420 INFO L273 TraceCheckUtils]: 39: Hoare triple {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~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; {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:17:11,421 INFO L273 TraceCheckUtils]: 40: Hoare triple {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:17:11,422 INFO L273 TraceCheckUtils]: 41: Hoare triple {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:17:11,423 INFO L273 TraceCheckUtils]: 42: Hoare triple {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~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; {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:17:11,423 INFO L273 TraceCheckUtils]: 43: Hoare triple {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:17:11,424 INFO L273 TraceCheckUtils]: 44: Hoare triple {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:17:11,425 INFO L273 TraceCheckUtils]: 45: Hoare triple {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~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; {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~0))} is VALID [2018-11-23 12:17:11,426 INFO L273 TraceCheckUtils]: 46: Hoare triple {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~0))} is VALID [2018-11-23 12:17:11,426 INFO L273 TraceCheckUtils]: 47: Hoare triple {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~0))} is VALID [2018-11-23 12:17:11,427 INFO L273 TraceCheckUtils]: 48: Hoare triple {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~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; {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~0 7))} is VALID [2018-11-23 12:17:11,428 INFO L273 TraceCheckUtils]: 49: Hoare triple {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~0 7))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~0 7))} is VALID [2018-11-23 12:17:11,429 INFO L273 TraceCheckUtils]: 50: Hoare triple {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~0 7))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~0 7))} is VALID [2018-11-23 12:17:11,430 INFO L273 TraceCheckUtils]: 51: Hoare triple {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~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; {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~0 8))} is VALID [2018-11-23 12:17:11,430 INFO L273 TraceCheckUtils]: 52: Hoare triple {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~0 8))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~0 8))} is VALID [2018-11-23 12:17:11,431 INFO L273 TraceCheckUtils]: 53: Hoare triple {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~0 8))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~0 8))} is VALID [2018-11-23 12:17:11,432 INFO L273 TraceCheckUtils]: 54: Hoare triple {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~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; {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~0))} is VALID [2018-11-23 12:17:11,433 INFO L273 TraceCheckUtils]: 55: Hoare triple {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~0))} is VALID [2018-11-23 12:17:11,433 INFO L273 TraceCheckUtils]: 56: Hoare triple {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~0))} is VALID [2018-11-23 12:17:11,434 INFO L273 TraceCheckUtils]: 57: Hoare triple {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~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; {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} is VALID [2018-11-23 12:17:11,435 INFO L273 TraceCheckUtils]: 58: Hoare triple {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} is VALID [2018-11-23 12:17:11,436 INFO L273 TraceCheckUtils]: 59: Hoare triple {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} assume !(~i~0 < 10); {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} is VALID [2018-11-23 12:17:11,438 INFO L273 TraceCheckUtils]: 60: Hoare triple {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {13770#(and (<= |sep_#res| 10) (<= 10 |sep_#res|))} is VALID [2018-11-23 12:17:11,438 INFO L273 TraceCheckUtils]: 61: Hoare triple {13770#(and (<= |sep_#res| 10) (<= 10 |sep_#res|))} assume true; {13770#(and (<= |sep_#res| 10) (<= 10 |sep_#res|))} is VALID [2018-11-23 12:17:11,440 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {13770#(and (<= |sep_#res| 10) (<= 10 |sep_#res|))} {13757#true} #75#return; {13771#(= |main_#t~ret6| 10)} is VALID [2018-11-23 12:17:11,441 INFO L273 TraceCheckUtils]: 63: Hoare triple {13771#(= |main_#t~ret6| 10)} 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); {13772#(= main_~ret~1 10)} is VALID [2018-11-23 12:17:11,441 INFO L256 TraceCheckUtils]: 64: Hoare triple {13772#(= main_~ret~1 10)} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {13757#true} is VALID [2018-11-23 12:17:11,441 INFO L273 TraceCheckUtils]: 65: Hoare triple {13757#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {13759#(= sep_~ret~0 0)} is VALID [2018-11-23 12:17:11,442 INFO L273 TraceCheckUtils]: 66: Hoare triple {13759#(= sep_~ret~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13759#(= sep_~ret~0 0)} is VALID [2018-11-23 12:17:11,443 INFO L273 TraceCheckUtils]: 67: Hoare triple {13759#(= sep_~ret~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; {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:17:11,443 INFO L273 TraceCheckUtils]: 68: Hoare triple {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:17:11,444 INFO L273 TraceCheckUtils]: 69: Hoare triple {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:17:11,445 INFO L273 TraceCheckUtils]: 70: Hoare triple {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~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; {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:17:11,446 INFO L273 TraceCheckUtils]: 71: Hoare triple {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:17:11,446 INFO L273 TraceCheckUtils]: 72: Hoare triple {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:17:11,447 INFO L273 TraceCheckUtils]: 73: Hoare triple {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~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; {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:17:11,448 INFO L273 TraceCheckUtils]: 74: Hoare triple {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:17:11,449 INFO L273 TraceCheckUtils]: 75: Hoare triple {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:17:11,450 INFO L273 TraceCheckUtils]: 76: Hoare triple {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~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; {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:17:11,451 INFO L273 TraceCheckUtils]: 77: Hoare triple {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:17:11,451 INFO L273 TraceCheckUtils]: 78: Hoare triple {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:17:11,452 INFO L273 TraceCheckUtils]: 79: Hoare triple {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~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; {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:17:11,453 INFO L273 TraceCheckUtils]: 80: Hoare triple {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:17:11,454 INFO L273 TraceCheckUtils]: 81: Hoare triple {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:17:11,455 INFO L273 TraceCheckUtils]: 82: Hoare triple {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~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; {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~0))} is VALID [2018-11-23 12:17:11,455 INFO L273 TraceCheckUtils]: 83: Hoare triple {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~0))} is VALID [2018-11-23 12:17:11,456 INFO L273 TraceCheckUtils]: 84: Hoare triple {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~0))} is VALID [2018-11-23 12:17:11,457 INFO L273 TraceCheckUtils]: 85: Hoare triple {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~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; {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~0 7))} is VALID [2018-11-23 12:17:11,458 INFO L273 TraceCheckUtils]: 86: Hoare triple {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~0 7))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~0 7))} is VALID [2018-11-23 12:17:11,458 INFO L273 TraceCheckUtils]: 87: Hoare triple {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~0 7))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~0 7))} is VALID [2018-11-23 12:17:11,459 INFO L273 TraceCheckUtils]: 88: Hoare triple {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~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; {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~0 8))} is VALID [2018-11-23 12:17:11,460 INFO L273 TraceCheckUtils]: 89: Hoare triple {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~0 8))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~0 8))} is VALID [2018-11-23 12:17:11,461 INFO L273 TraceCheckUtils]: 90: Hoare triple {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~0 8))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~0 8))} is VALID [2018-11-23 12:17:11,462 INFO L273 TraceCheckUtils]: 91: Hoare triple {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~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; {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~0))} is VALID [2018-11-23 12:17:11,463 INFO L273 TraceCheckUtils]: 92: Hoare triple {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~0))} is VALID [2018-11-23 12:17:11,463 INFO L273 TraceCheckUtils]: 93: Hoare triple {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~0))} is VALID [2018-11-23 12:17:11,464 INFO L273 TraceCheckUtils]: 94: Hoare triple {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~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; {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} is VALID [2018-11-23 12:17:11,465 INFO L273 TraceCheckUtils]: 95: Hoare triple {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} is VALID [2018-11-23 12:17:11,466 INFO L273 TraceCheckUtils]: 96: Hoare triple {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} assume !(~i~0 < 10); {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} is VALID [2018-11-23 12:17:11,467 INFO L273 TraceCheckUtils]: 97: Hoare triple {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {13770#(and (<= |sep_#res| 10) (<= 10 |sep_#res|))} is VALID [2018-11-23 12:17:11,468 INFO L273 TraceCheckUtils]: 98: Hoare triple {13770#(and (<= |sep_#res| 10) (<= 10 |sep_#res|))} assume true; {13770#(and (<= |sep_#res| 10) (<= 10 |sep_#res|))} is VALID [2018-11-23 12:17:11,470 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {13770#(and (<= |sep_#res| 10) (<= 10 |sep_#res|))} {13772#(= main_~ret~1 10)} #77#return; {13773#(and (= main_~ret~1 10) (= main_~ret~1 |main_#t~ret9|))} is VALID [2018-11-23 12:17:11,471 INFO L273 TraceCheckUtils]: 100: Hoare triple {13773#(and (= main_~ret~1 10) (= main_~ret~1 |main_#t~ret9|))} 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; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:11,471 INFO L273 TraceCheckUtils]: 101: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:11,472 INFO L273 TraceCheckUtils]: 102: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:11,473 INFO L273 TraceCheckUtils]: 103: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:11,474 INFO L273 TraceCheckUtils]: 104: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:11,474 INFO L273 TraceCheckUtils]: 105: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:11,475 INFO L273 TraceCheckUtils]: 106: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:11,476 INFO L273 TraceCheckUtils]: 107: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:11,476 INFO L273 TraceCheckUtils]: 108: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:11,477 INFO L273 TraceCheckUtils]: 109: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:11,478 INFO L273 TraceCheckUtils]: 110: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:11,479 INFO L273 TraceCheckUtils]: 111: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:11,479 INFO L273 TraceCheckUtils]: 112: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:11,480 INFO L273 TraceCheckUtils]: 113: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:11,481 INFO L273 TraceCheckUtils]: 114: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:11,482 INFO L273 TraceCheckUtils]: 115: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:11,482 INFO L273 TraceCheckUtils]: 116: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:11,483 INFO L273 TraceCheckUtils]: 117: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:11,484 INFO L273 TraceCheckUtils]: 118: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:11,484 INFO L273 TraceCheckUtils]: 119: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} assume !(~i~2 < 9); {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:11,485 INFO L273 TraceCheckUtils]: 120: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:11,485 INFO L256 TraceCheckUtils]: 121: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {13757#true} is VALID [2018-11-23 12:17:11,486 INFO L273 TraceCheckUtils]: 122: Hoare triple {13757#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {13759#(= sep_~ret~0 0)} is VALID [2018-11-23 12:17:11,486 INFO L273 TraceCheckUtils]: 123: Hoare triple {13759#(= sep_~ret~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13759#(= sep_~ret~0 0)} is VALID [2018-11-23 12:17:11,487 INFO L273 TraceCheckUtils]: 124: Hoare triple {13759#(= sep_~ret~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; {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:17:11,488 INFO L273 TraceCheckUtils]: 125: Hoare triple {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:17:11,489 INFO L273 TraceCheckUtils]: 126: Hoare triple {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:17:11,490 INFO L273 TraceCheckUtils]: 127: Hoare triple {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~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; {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:17:11,490 INFO L273 TraceCheckUtils]: 128: Hoare triple {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:17:11,491 INFO L273 TraceCheckUtils]: 129: Hoare triple {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:17:11,492 INFO L273 TraceCheckUtils]: 130: Hoare triple {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~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; {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:17:11,493 INFO L273 TraceCheckUtils]: 131: Hoare triple {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:17:11,493 INFO L273 TraceCheckUtils]: 132: Hoare triple {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:17:11,494 INFO L273 TraceCheckUtils]: 133: Hoare triple {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~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; {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:17:11,495 INFO L273 TraceCheckUtils]: 134: Hoare triple {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:17:11,496 INFO L273 TraceCheckUtils]: 135: Hoare triple {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:17:11,497 INFO L273 TraceCheckUtils]: 136: Hoare triple {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~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; {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:17:11,498 INFO L273 TraceCheckUtils]: 137: Hoare triple {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:17:11,498 INFO L273 TraceCheckUtils]: 138: Hoare triple {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:17:11,499 INFO L273 TraceCheckUtils]: 139: Hoare triple {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~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; {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~0))} is VALID [2018-11-23 12:17:11,500 INFO L273 TraceCheckUtils]: 140: Hoare triple {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~0))} is VALID [2018-11-23 12:17:11,501 INFO L273 TraceCheckUtils]: 141: Hoare triple {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~0))} is VALID [2018-11-23 12:17:11,502 INFO L273 TraceCheckUtils]: 142: Hoare triple {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~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; {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~0 7))} is VALID [2018-11-23 12:17:11,502 INFO L273 TraceCheckUtils]: 143: Hoare triple {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~0 7))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~0 7))} is VALID [2018-11-23 12:17:11,503 INFO L273 TraceCheckUtils]: 144: Hoare triple {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~0 7))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~0 7))} is VALID [2018-11-23 12:17:11,504 INFO L273 TraceCheckUtils]: 145: Hoare triple {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~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; {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~0 8))} is VALID [2018-11-23 12:17:11,505 INFO L273 TraceCheckUtils]: 146: Hoare triple {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~0 8))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~0 8))} is VALID [2018-11-23 12:17:11,506 INFO L273 TraceCheckUtils]: 147: Hoare triple {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~0 8))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~0 8))} is VALID [2018-11-23 12:17:11,507 INFO L273 TraceCheckUtils]: 148: Hoare triple {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~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; {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~0))} is VALID [2018-11-23 12:17:11,507 INFO L273 TraceCheckUtils]: 149: Hoare triple {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~0))} is VALID [2018-11-23 12:17:11,508 INFO L273 TraceCheckUtils]: 150: Hoare triple {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~0))} is VALID [2018-11-23 12:17:11,509 INFO L273 TraceCheckUtils]: 151: Hoare triple {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~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; {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} is VALID [2018-11-23 12:17:11,510 INFO L273 TraceCheckUtils]: 152: Hoare triple {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} is VALID [2018-11-23 12:17:11,510 INFO L273 TraceCheckUtils]: 153: Hoare triple {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} assume !(~i~0 < 10); {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} is VALID [2018-11-23 12:17:11,512 INFO L273 TraceCheckUtils]: 154: Hoare triple {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {13770#(and (<= |sep_#res| 10) (<= 10 |sep_#res|))} is VALID [2018-11-23 12:17:11,513 INFO L273 TraceCheckUtils]: 155: Hoare triple {13770#(and (<= |sep_#res| 10) (<= 10 |sep_#res|))} assume true; {13770#(and (<= |sep_#res| 10) (<= 10 |sep_#res|))} is VALID [2018-11-23 12:17:11,514 INFO L268 TraceCheckUtils]: 156: Hoare quadruple {13770#(and (<= |sep_#res| 10) (<= 10 |sep_#res|))} {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} #79#return; {13775#(and (= main_~ret2~0 main_~ret~1) (= main_~ret~1 |main_#t~ret13|))} is VALID [2018-11-23 12:17:11,515 INFO L273 TraceCheckUtils]: 157: Hoare triple {13775#(and (= main_~ret2~0 main_~ret~1) (= main_~ret~1 |main_#t~ret13|))} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {13776#(and (= main_~ret5~0 main_~ret~1) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:11,516 INFO L273 TraceCheckUtils]: 158: Hoare triple {13776#(and (= main_~ret5~0 main_~ret~1) (= main_~ret2~0 main_~ret~1))} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {13758#false} is VALID [2018-11-23 12:17:11,516 INFO L273 TraceCheckUtils]: 159: Hoare triple {13758#false} assume !false; {13758#false} is VALID [2018-11-23 12:17:11,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1591 backedges. 0 proven. 1305 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-11-23 12:17:11,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:17:11,557 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:11,565 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:17:11,651 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:17:11,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:17:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:11,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:17:14,309 INFO L256 TraceCheckUtils]: 0: Hoare triple {13757#true} call ULTIMATE.init(); {13757#true} is VALID [2018-11-23 12:17:14,309 INFO L273 TraceCheckUtils]: 1: Hoare triple {13757#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13757#true} is VALID [2018-11-23 12:17:14,309 INFO L273 TraceCheckUtils]: 2: Hoare triple {13757#true} assume true; {13757#true} is VALID [2018-11-23 12:17:14,309 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13757#true} {13757#true} #71#return; {13757#true} is VALID [2018-11-23 12:17:14,310 INFO L256 TraceCheckUtils]: 4: Hoare triple {13757#true} call #t~ret14 := main(); {13757#true} is VALID [2018-11-23 12:17:14,310 INFO L273 TraceCheckUtils]: 5: Hoare triple {13757#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(40);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {13757#true} is VALID [2018-11-23 12:17:14,310 INFO L273 TraceCheckUtils]: 6: Hoare triple {13757#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13757#true} is VALID [2018-11-23 12:17:14,310 INFO L273 TraceCheckUtils]: 7: Hoare triple {13757#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13757#true} is VALID [2018-11-23 12:17:14,310 INFO L273 TraceCheckUtils]: 8: Hoare triple {13757#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13757#true} is VALID [2018-11-23 12:17:14,310 INFO L273 TraceCheckUtils]: 9: Hoare triple {13757#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13757#true} is VALID [2018-11-23 12:17:14,310 INFO L273 TraceCheckUtils]: 10: Hoare triple {13757#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13757#true} is VALID [2018-11-23 12:17:14,310 INFO L273 TraceCheckUtils]: 11: Hoare triple {13757#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13757#true} is VALID [2018-11-23 12:17:14,310 INFO L273 TraceCheckUtils]: 12: Hoare triple {13757#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13757#true} is VALID [2018-11-23 12:17:14,311 INFO L273 TraceCheckUtils]: 13: Hoare triple {13757#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13757#true} is VALID [2018-11-23 12:17:14,311 INFO L273 TraceCheckUtils]: 14: Hoare triple {13757#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13757#true} is VALID [2018-11-23 12:17:14,311 INFO L273 TraceCheckUtils]: 15: Hoare triple {13757#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13757#true} is VALID [2018-11-23 12:17:14,311 INFO L273 TraceCheckUtils]: 16: Hoare triple {13757#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13757#true} is VALID [2018-11-23 12:17:14,311 INFO L273 TraceCheckUtils]: 17: Hoare triple {13757#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13757#true} is VALID [2018-11-23 12:17:14,311 INFO L273 TraceCheckUtils]: 18: Hoare triple {13757#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13757#true} is VALID [2018-11-23 12:17:14,311 INFO L273 TraceCheckUtils]: 19: Hoare triple {13757#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13757#true} is VALID [2018-11-23 12:17:14,312 INFO L273 TraceCheckUtils]: 20: Hoare triple {13757#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13757#true} is VALID [2018-11-23 12:17:14,312 INFO L273 TraceCheckUtils]: 21: Hoare triple {13757#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13757#true} is VALID [2018-11-23 12:17:14,312 INFO L273 TraceCheckUtils]: 22: Hoare triple {13757#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13757#true} is VALID [2018-11-23 12:17:14,312 INFO L273 TraceCheckUtils]: 23: Hoare triple {13757#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13757#true} is VALID [2018-11-23 12:17:14,312 INFO L273 TraceCheckUtils]: 24: Hoare triple {13757#true} assume !!(~i~1 < 10);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet5; {13757#true} is VALID [2018-11-23 12:17:14,313 INFO L273 TraceCheckUtils]: 25: Hoare triple {13757#true} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13757#true} is VALID [2018-11-23 12:17:14,313 INFO L273 TraceCheckUtils]: 26: Hoare triple {13757#true} assume !(~i~1 < 10); {13757#true} is VALID [2018-11-23 12:17:14,313 INFO L256 TraceCheckUtils]: 27: Hoare triple {13757#true} call #t~ret6 := sep(~#x~0.base, ~#x~0.offset); {13757#true} is VALID [2018-11-23 12:17:14,313 INFO L273 TraceCheckUtils]: 28: Hoare triple {13757#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {13759#(= sep_~ret~0 0)} is VALID [2018-11-23 12:17:14,313 INFO L273 TraceCheckUtils]: 29: Hoare triple {13759#(= sep_~ret~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13759#(= sep_~ret~0 0)} is VALID [2018-11-23 12:17:14,314 INFO L273 TraceCheckUtils]: 30: Hoare triple {13759#(= sep_~ret~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; {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:17:14,314 INFO L273 TraceCheckUtils]: 31: Hoare triple {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:17:14,315 INFO L273 TraceCheckUtils]: 32: Hoare triple {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:17:14,315 INFO L273 TraceCheckUtils]: 33: Hoare triple {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~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; {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:17:14,316 INFO L273 TraceCheckUtils]: 34: Hoare triple {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:17:14,316 INFO L273 TraceCheckUtils]: 35: Hoare triple {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:17:14,317 INFO L273 TraceCheckUtils]: 36: Hoare triple {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~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; {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:17:14,317 INFO L273 TraceCheckUtils]: 37: Hoare triple {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:17:14,318 INFO L273 TraceCheckUtils]: 38: Hoare triple {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:17:14,318 INFO L273 TraceCheckUtils]: 39: Hoare triple {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~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; {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:17:14,319 INFO L273 TraceCheckUtils]: 40: Hoare triple {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:17:14,320 INFO L273 TraceCheckUtils]: 41: Hoare triple {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:17:14,321 INFO L273 TraceCheckUtils]: 42: Hoare triple {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~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; {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:17:14,321 INFO L273 TraceCheckUtils]: 43: Hoare triple {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:17:14,322 INFO L273 TraceCheckUtils]: 44: Hoare triple {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:17:14,323 INFO L273 TraceCheckUtils]: 45: Hoare triple {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~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; {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~0))} is VALID [2018-11-23 12:17:14,324 INFO L273 TraceCheckUtils]: 46: Hoare triple {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~0))} is VALID [2018-11-23 12:17:14,324 INFO L273 TraceCheckUtils]: 47: Hoare triple {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~0))} is VALID [2018-11-23 12:17:14,325 INFO L273 TraceCheckUtils]: 48: Hoare triple {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~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; {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~0 7))} is VALID [2018-11-23 12:17:14,326 INFO L273 TraceCheckUtils]: 49: Hoare triple {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~0 7))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~0 7))} is VALID [2018-11-23 12:17:14,326 INFO L273 TraceCheckUtils]: 50: Hoare triple {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~0 7))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~0 7))} is VALID [2018-11-23 12:17:14,327 INFO L273 TraceCheckUtils]: 51: Hoare triple {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~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; {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~0 8))} is VALID [2018-11-23 12:17:14,328 INFO L273 TraceCheckUtils]: 52: Hoare triple {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~0 8))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~0 8))} is VALID [2018-11-23 12:17:14,329 INFO L273 TraceCheckUtils]: 53: Hoare triple {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~0 8))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~0 8))} is VALID [2018-11-23 12:17:14,330 INFO L273 TraceCheckUtils]: 54: Hoare triple {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~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; {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~0))} is VALID [2018-11-23 12:17:14,330 INFO L273 TraceCheckUtils]: 55: Hoare triple {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~0))} is VALID [2018-11-23 12:17:14,331 INFO L273 TraceCheckUtils]: 56: Hoare triple {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~0))} is VALID [2018-11-23 12:17:14,332 INFO L273 TraceCheckUtils]: 57: Hoare triple {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~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; {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} is VALID [2018-11-23 12:17:14,332 INFO L273 TraceCheckUtils]: 58: Hoare triple {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} is VALID [2018-11-23 12:17:14,333 INFO L273 TraceCheckUtils]: 59: Hoare triple {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} assume !(~i~0 < 10); {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} is VALID [2018-11-23 12:17:14,335 INFO L273 TraceCheckUtils]: 60: Hoare triple {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {13770#(and (<= |sep_#res| 10) (<= 10 |sep_#res|))} is VALID [2018-11-23 12:17:14,335 INFO L273 TraceCheckUtils]: 61: Hoare triple {13770#(and (<= |sep_#res| 10) (<= 10 |sep_#res|))} assume true; {13770#(and (<= |sep_#res| 10) (<= 10 |sep_#res|))} is VALID [2018-11-23 12:17:14,337 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {13770#(and (<= |sep_#res| 10) (<= 10 |sep_#res|))} {13757#true} #75#return; {13771#(= |main_#t~ret6| 10)} is VALID [2018-11-23 12:17:14,337 INFO L273 TraceCheckUtils]: 63: Hoare triple {13771#(= |main_#t~ret6| 10)} 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); {13772#(= main_~ret~1 10)} is VALID [2018-11-23 12:17:14,337 INFO L256 TraceCheckUtils]: 64: Hoare triple {13772#(= main_~ret~1 10)} call #t~ret9 := sep(~#x~0.base, ~#x~0.offset); {13757#true} is VALID [2018-11-23 12:17:14,338 INFO L273 TraceCheckUtils]: 65: Hoare triple {13757#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {13759#(= sep_~ret~0 0)} is VALID [2018-11-23 12:17:14,338 INFO L273 TraceCheckUtils]: 66: Hoare triple {13759#(= sep_~ret~0 0)} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13759#(= sep_~ret~0 0)} is VALID [2018-11-23 12:17:14,338 INFO L273 TraceCheckUtils]: 67: Hoare triple {13759#(= sep_~ret~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; {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:17:14,339 INFO L273 TraceCheckUtils]: 68: Hoare triple {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:17:14,339 INFO L273 TraceCheckUtils]: 69: Hoare triple {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~0 1))} is VALID [2018-11-23 12:17:14,340 INFO L273 TraceCheckUtils]: 70: Hoare triple {13760#(and (<= 1 sep_~ret~0) (<= sep_~ret~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; {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:17:14,341 INFO L273 TraceCheckUtils]: 71: Hoare triple {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:17:14,342 INFO L273 TraceCheckUtils]: 72: Hoare triple {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~0))} is VALID [2018-11-23 12:17:14,343 INFO L273 TraceCheckUtils]: 73: Hoare triple {13761#(and (<= sep_~ret~0 2) (<= 2 sep_~ret~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; {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:17:14,343 INFO L273 TraceCheckUtils]: 74: Hoare triple {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:17:14,344 INFO L273 TraceCheckUtils]: 75: Hoare triple {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~0))} is VALID [2018-11-23 12:17:14,345 INFO L273 TraceCheckUtils]: 76: Hoare triple {13762#(and (<= sep_~ret~0 3) (<= 3 sep_~ret~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; {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:17:14,345 INFO L273 TraceCheckUtils]: 77: Hoare triple {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:17:14,346 INFO L273 TraceCheckUtils]: 78: Hoare triple {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~0))} is VALID [2018-11-23 12:17:14,347 INFO L273 TraceCheckUtils]: 79: Hoare triple {13763#(and (<= sep_~ret~0 4) (<= 4 sep_~ret~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; {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:17:14,348 INFO L273 TraceCheckUtils]: 80: Hoare triple {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:17:14,348 INFO L273 TraceCheckUtils]: 81: Hoare triple {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~0))} is VALID [2018-11-23 12:17:14,349 INFO L273 TraceCheckUtils]: 82: Hoare triple {13764#(and (<= sep_~ret~0 5) (<= 5 sep_~ret~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; {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~0))} is VALID [2018-11-23 12:17:14,350 INFO L273 TraceCheckUtils]: 83: Hoare triple {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~0))} is VALID [2018-11-23 12:17:14,351 INFO L273 TraceCheckUtils]: 84: Hoare triple {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~0))} is VALID [2018-11-23 12:17:14,352 INFO L273 TraceCheckUtils]: 85: Hoare triple {13765#(and (<= sep_~ret~0 6) (<= 6 sep_~ret~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; {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~0 7))} is VALID [2018-11-23 12:17:14,352 INFO L273 TraceCheckUtils]: 86: Hoare triple {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~0 7))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~0 7))} is VALID [2018-11-23 12:17:14,353 INFO L273 TraceCheckUtils]: 87: Hoare triple {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~0 7))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~0 7))} is VALID [2018-11-23 12:17:14,354 INFO L273 TraceCheckUtils]: 88: Hoare triple {13766#(and (<= 7 sep_~ret~0) (<= sep_~ret~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; {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~0 8))} is VALID [2018-11-23 12:17:14,354 INFO L273 TraceCheckUtils]: 89: Hoare triple {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~0 8))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~0 8))} is VALID [2018-11-23 12:17:14,355 INFO L273 TraceCheckUtils]: 90: Hoare triple {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~0 8))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~0 8))} is VALID [2018-11-23 12:17:14,356 INFO L273 TraceCheckUtils]: 91: Hoare triple {13767#(and (<= 8 sep_~ret~0) (<= sep_~ret~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; {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~0))} is VALID [2018-11-23 12:17:14,357 INFO L273 TraceCheckUtils]: 92: Hoare triple {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~0))} is VALID [2018-11-23 12:17:14,357 INFO L273 TraceCheckUtils]: 93: Hoare triple {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~0))} is VALID [2018-11-23 12:17:14,358 INFO L273 TraceCheckUtils]: 94: Hoare triple {13768#(and (<= sep_~ret~0 9) (<= 9 sep_~ret~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; {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} is VALID [2018-11-23 12:17:14,359 INFO L273 TraceCheckUtils]: 95: Hoare triple {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} is VALID [2018-11-23 12:17:14,359 INFO L273 TraceCheckUtils]: 96: Hoare triple {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} assume !(~i~0 < 10); {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} is VALID [2018-11-23 12:17:14,361 INFO L273 TraceCheckUtils]: 97: Hoare triple {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {13770#(and (<= |sep_#res| 10) (<= 10 |sep_#res|))} is VALID [2018-11-23 12:17:14,362 INFO L273 TraceCheckUtils]: 98: Hoare triple {13770#(and (<= |sep_#res| 10) (<= 10 |sep_#res|))} assume true; {13770#(and (<= |sep_#res| 10) (<= 10 |sep_#res|))} is VALID [2018-11-23 12:17:14,363 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {13770#(and (<= |sep_#res| 10) (<= 10 |sep_#res|))} {13772#(= main_~ret~1 10)} #77#return; {13773#(and (= main_~ret~1 10) (= main_~ret~1 |main_#t~ret9|))} is VALID [2018-11-23 12:17:14,363 INFO L273 TraceCheckUtils]: 100: Hoare triple {13773#(and (= main_~ret~1 10) (= main_~ret~1 |main_#t~ret9|))} 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; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:14,364 INFO L273 TraceCheckUtils]: 101: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:14,364 INFO L273 TraceCheckUtils]: 102: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:14,365 INFO L273 TraceCheckUtils]: 103: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:14,365 INFO L273 TraceCheckUtils]: 104: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:14,366 INFO L273 TraceCheckUtils]: 105: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:14,367 INFO L273 TraceCheckUtils]: 106: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:14,368 INFO L273 TraceCheckUtils]: 107: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:14,368 INFO L273 TraceCheckUtils]: 108: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:14,369 INFO L273 TraceCheckUtils]: 109: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:14,370 INFO L273 TraceCheckUtils]: 110: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:14,370 INFO L273 TraceCheckUtils]: 111: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:14,371 INFO L273 TraceCheckUtils]: 112: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:14,372 INFO L273 TraceCheckUtils]: 113: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:14,372 INFO L273 TraceCheckUtils]: 114: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:14,373 INFO L273 TraceCheckUtils]: 115: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:14,374 INFO L273 TraceCheckUtils]: 116: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:14,375 INFO L273 TraceCheckUtils]: 117: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} assume !!(~i~2 < 9);call #t~mem12 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem12, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem12; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:14,375 INFO L273 TraceCheckUtils]: 118: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} #t~post11 := ~i~2;~i~2 := 1 + #t~post11;havoc #t~post11; {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:14,376 INFO L273 TraceCheckUtils]: 119: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} assume !(~i~2 < 9); {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:14,376 INFO L273 TraceCheckUtils]: 120: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} call write~int(~temp~0, ~#x~0.base, 36 + ~#x~0.offset, 4); {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} is VALID [2018-11-23 12:17:14,377 INFO L256 TraceCheckUtils]: 121: Hoare triple {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} call #t~ret13 := sep(~#x~0.base, ~#x~0.offset); {13757#true} is VALID [2018-11-23 12:17:14,397 INFO L273 TraceCheckUtils]: 122: Hoare triple {13757#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;~ret~0 := 0;~i~0 := 0; {14146#(and (= 0 sep_~i~0) (= 0 sep_~ret~0))} is VALID [2018-11-23 12:17:14,413 INFO L273 TraceCheckUtils]: 123: Hoare triple {14146#(and (= 0 sep_~i~0) (= 0 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14146#(and (= 0 sep_~i~0) (= 0 sep_~ret~0))} is VALID [2018-11-23 12:17:14,422 INFO L273 TraceCheckUtils]: 124: Hoare triple {14146#(and (= 0 sep_~i~0) (= 0 sep_~ret~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; {14153#(and (= 0 sep_~i~0) (= 1 sep_~ret~0))} is VALID [2018-11-23 12:17:14,437 INFO L273 TraceCheckUtils]: 125: Hoare triple {14153#(and (= 0 sep_~i~0) (= 1 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14157#(and (= 1 sep_~i~0) (= 1 sep_~ret~0))} is VALID [2018-11-23 12:17:14,446 INFO L273 TraceCheckUtils]: 126: Hoare triple {14157#(and (= 1 sep_~i~0) (= 1 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14157#(and (= 1 sep_~i~0) (= 1 sep_~ret~0))} is VALID [2018-11-23 12:17:14,461 INFO L273 TraceCheckUtils]: 127: Hoare triple {14157#(and (= 1 sep_~i~0) (= 1 sep_~ret~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; {14164#(and (= 2 sep_~ret~0) (= 1 sep_~i~0))} is VALID [2018-11-23 12:17:14,470 INFO L273 TraceCheckUtils]: 128: Hoare triple {14164#(and (= 2 sep_~ret~0) (= 1 sep_~i~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14168#(and (= 2 sep_~ret~0) (= 2 sep_~i~0))} is VALID [2018-11-23 12:17:14,482 INFO L273 TraceCheckUtils]: 129: Hoare triple {14168#(and (= 2 sep_~ret~0) (= 2 sep_~i~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14168#(and (= 2 sep_~ret~0) (= 2 sep_~i~0))} is VALID [2018-11-23 12:17:14,495 INFO L273 TraceCheckUtils]: 130: Hoare triple {14168#(and (= 2 sep_~ret~0) (= 2 sep_~i~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; {14175#(and (= 2 sep_~i~0) (= 3 sep_~ret~0))} is VALID [2018-11-23 12:17:14,512 INFO L273 TraceCheckUtils]: 131: Hoare triple {14175#(and (= 2 sep_~i~0) (= 3 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14179#(and (= 3 sep_~i~0) (= 3 sep_~ret~0))} is VALID [2018-11-23 12:17:14,521 INFO L273 TraceCheckUtils]: 132: Hoare triple {14179#(and (= 3 sep_~i~0) (= 3 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14179#(and (= 3 sep_~i~0) (= 3 sep_~ret~0))} is VALID [2018-11-23 12:17:14,534 INFO L273 TraceCheckUtils]: 133: Hoare triple {14179#(and (= 3 sep_~i~0) (= 3 sep_~ret~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; {14186#(and (= 4 sep_~ret~0) (= 3 sep_~i~0))} is VALID [2018-11-23 12:17:14,542 INFO L273 TraceCheckUtils]: 134: Hoare triple {14186#(and (= 4 sep_~ret~0) (= 3 sep_~i~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14190#(and (= 4 sep_~ret~0) (= 4 sep_~i~0))} is VALID [2018-11-23 12:17:14,555 INFO L273 TraceCheckUtils]: 135: Hoare triple {14190#(and (= 4 sep_~ret~0) (= 4 sep_~i~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14190#(and (= 4 sep_~ret~0) (= 4 sep_~i~0))} is VALID [2018-11-23 12:17:14,568 INFO L273 TraceCheckUtils]: 136: Hoare triple {14190#(and (= 4 sep_~ret~0) (= 4 sep_~i~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; {14197#(and (= 5 sep_~ret~0) (= 4 sep_~i~0))} is VALID [2018-11-23 12:17:14,582 INFO L273 TraceCheckUtils]: 137: Hoare triple {14197#(and (= 5 sep_~ret~0) (= 4 sep_~i~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14201#(and (= 5 sep_~i~0) (= 5 sep_~ret~0))} is VALID [2018-11-23 12:17:14,591 INFO L273 TraceCheckUtils]: 138: Hoare triple {14201#(and (= 5 sep_~i~0) (= 5 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14201#(and (= 5 sep_~i~0) (= 5 sep_~ret~0))} is VALID [2018-11-23 12:17:14,603 INFO L273 TraceCheckUtils]: 139: Hoare triple {14201#(and (= 5 sep_~i~0) (= 5 sep_~ret~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; {14208#(and (= 5 sep_~i~0) (= 6 sep_~ret~0))} is VALID [2018-11-23 12:17:14,616 INFO L273 TraceCheckUtils]: 140: Hoare triple {14208#(and (= 5 sep_~i~0) (= 6 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14212#(and (= 6 sep_~i~0) (= 6 sep_~ret~0))} is VALID [2018-11-23 12:17:14,628 INFO L273 TraceCheckUtils]: 141: Hoare triple {14212#(and (= 6 sep_~i~0) (= 6 sep_~ret~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14212#(and (= 6 sep_~i~0) (= 6 sep_~ret~0))} is VALID [2018-11-23 12:17:14,647 INFO L273 TraceCheckUtils]: 142: Hoare triple {14212#(and (= 6 sep_~i~0) (= 6 sep_~ret~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; {14219#(and (= 7 sep_~ret~0) (= 6 sep_~i~0))} is VALID [2018-11-23 12:17:14,655 INFO L273 TraceCheckUtils]: 143: Hoare triple {14219#(and (= 7 sep_~ret~0) (= 6 sep_~i~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14223#(and (= 7 sep_~ret~0) (= 7 sep_~i~0))} is VALID [2018-11-23 12:17:14,668 INFO L273 TraceCheckUtils]: 144: Hoare triple {14223#(and (= 7 sep_~ret~0) (= 7 sep_~i~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14223#(and (= 7 sep_~ret~0) (= 7 sep_~i~0))} is VALID [2018-11-23 12:17:14,681 INFO L273 TraceCheckUtils]: 145: Hoare triple {14223#(and (= 7 sep_~ret~0) (= 7 sep_~i~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; {14230#(and (= 8 sep_~ret~0) (= 7 sep_~i~0))} is VALID [2018-11-23 12:17:14,693 INFO L273 TraceCheckUtils]: 146: Hoare triple {14230#(and (= 8 sep_~ret~0) (= 7 sep_~i~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14234#(and (= 8 sep_~ret~0) (= 8 sep_~i~0))} is VALID [2018-11-23 12:17:14,711 INFO L273 TraceCheckUtils]: 147: Hoare triple {14234#(and (= 8 sep_~ret~0) (= 8 sep_~i~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14234#(and (= 8 sep_~ret~0) (= 8 sep_~i~0))} is VALID [2018-11-23 12:17:14,720 INFO L273 TraceCheckUtils]: 148: Hoare triple {14234#(and (= 8 sep_~ret~0) (= 8 sep_~i~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; {14241#(and (= 9 sep_~ret~0) (= 8 sep_~i~0))} is VALID [2018-11-23 12:17:14,732 INFO L273 TraceCheckUtils]: 149: Hoare triple {14241#(and (= 9 sep_~ret~0) (= 8 sep_~i~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {14245#(and (= 9 sep_~ret~0) (= 9 sep_~i~0))} is VALID [2018-11-23 12:17:14,745 INFO L273 TraceCheckUtils]: 150: Hoare triple {14245#(and (= 9 sep_~ret~0) (= 9 sep_~i~0))} assume !!(~i~0 < 10);call #t~mem1 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4); {14245#(and (= 9 sep_~ret~0) (= 9 sep_~i~0))} is VALID [2018-11-23 12:17:14,757 INFO L273 TraceCheckUtils]: 151: Hoare triple {14245#(and (= 9 sep_~ret~0) (= 9 sep_~i~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; {14252#(and (= 9 sep_~i~0) (= 10 sep_~ret~0))} is VALID [2018-11-23 12:17:14,772 INFO L273 TraceCheckUtils]: 152: Hoare triple {14252#(and (= 9 sep_~i~0) (= 10 sep_~ret~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} is VALID [2018-11-23 12:17:14,781 INFO L273 TraceCheckUtils]: 153: Hoare triple {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} assume !(~i~0 < 10); {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} is VALID [2018-11-23 12:17:14,795 INFO L273 TraceCheckUtils]: 154: Hoare triple {13769#(and (<= 10 sep_~ret~0) (<= sep_~ret~0 10))} #res := (if ~ret~0 % 4294967296 <= 2147483647 then ~ret~0 % 4294967296 else ~ret~0 % 4294967296 - 4294967296); {13770#(and (<= |sep_#res| 10) (<= 10 |sep_#res|))} is VALID [2018-11-23 12:17:14,804 INFO L273 TraceCheckUtils]: 155: Hoare triple {13770#(and (<= |sep_#res| 10) (<= 10 |sep_#res|))} assume true; {13770#(and (<= |sep_#res| 10) (<= 10 |sep_#res|))} is VALID [2018-11-23 12:17:14,817 INFO L268 TraceCheckUtils]: 156: Hoare quadruple {13770#(and (<= |sep_#res| 10) (<= 10 |sep_#res|))} {13774#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1))} #79#return; {14268#(and (= main_~ret~1 10) (<= 10 |main_#t~ret13|) (= main_~ret2~0 main_~ret~1) (<= |main_#t~ret13| 10))} is VALID [2018-11-23 12:17:14,829 INFO L273 TraceCheckUtils]: 157: Hoare triple {14268#(and (= main_~ret~1 10) (<= 10 |main_#t~ret13|) (= main_~ret2~0 main_~ret~1) (<= |main_#t~ret13| 10))} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;~ret5~0 := #t~ret13;havoc #t~ret13; {14272#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1) (<= main_~ret5~0 10) (<= 10 main_~ret5~0))} is VALID [2018-11-23 12:17:14,842 INFO L273 TraceCheckUtils]: 158: Hoare triple {14272#(and (= main_~ret~1 10) (= main_~ret2~0 main_~ret~1) (<= main_~ret5~0 10) (<= 10 main_~ret5~0))} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {13758#false} is VALID [2018-11-23 12:17:14,842 INFO L273 TraceCheckUtils]: 159: Hoare triple {13758#false} assume !false; {13758#false} is VALID [2018-11-23 12:17:14,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1591 backedges. 60 proven. 1305 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-11-23 12:17:14,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:17:14,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 40] total 42 [2018-11-23 12:17:14,918 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2018-11-23 12:17:14,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:17:14,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:17:15,046 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:15,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:17:15,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:17:15,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1613, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:17:15,048 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand 42 states. [2018-11-23 12:17:23,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:23,836 INFO L93 Difference]: Finished difference Result 299 states and 417 transitions. [2018-11-23 12:17:23,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:17:23,836 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2018-11-23 12:17:23,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:17:23,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:17:23,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 241 transitions. [2018-11-23 12:17:23,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:17:23,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 241 transitions. [2018-11-23 12:17:23,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 241 transitions. [2018-11-23 12:17:24,486 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:17:24,513 INFO L225 Difference]: With dead ends: 299 [2018-11-23 12:17:24,514 INFO L226 Difference]: Without dead ends: 295 [2018-11-23 12:17:24,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 150 SyntacticMatches, 13 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=113, Invalid=1693, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:17:24,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-11-23 12:17:24,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 233. [2018-11-23 12:17:24,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:17:24,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 295 states. Second operand 233 states. [2018-11-23 12:17:24,926 INFO L74 IsIncluded]: Start isIncluded. First operand 295 states. Second operand 233 states. [2018-11-23 12:17:24,926 INFO L87 Difference]: Start difference. First operand 295 states. Second operand 233 states. [2018-11-23 12:17:24,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:24,941 INFO L93 Difference]: Finished difference Result 295 states and 413 transitions. [2018-11-23 12:17:24,941 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 413 transitions. [2018-11-23 12:17:24,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:24,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:24,944 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand 295 states. [2018-11-23 12:17:24,944 INFO L87 Difference]: Start difference. First operand 233 states. Second operand 295 states. [2018-11-23 12:17:24,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:17:24,959 INFO L93 Difference]: Finished difference Result 295 states and 413 transitions. [2018-11-23 12:17:24,959 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 413 transitions. [2018-11-23 12:17:24,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:17:24,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:17:24,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:17:24,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:17:24,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-23 12:17:24,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 299 transitions. [2018-11-23 12:17:24,970 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 299 transitions. Word has length 160 [2018-11-23 12:17:24,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:17:24,971 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 299 transitions. [2018-11-23 12:17:24,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:17:24,971 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 299 transitions. [2018-11-23 12:17:24,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-23 12:17:24,973 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:17:24,973 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 10, 10, 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, 1] [2018-11-23 12:17:24,973 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:17:24,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:17:24,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1725557350, now seen corresponding path program 1 times [2018-11-23 12:17:24,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:17:24,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:17:24,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:24,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:17:24,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:17:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:17:29,937 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: must not be argument of unary minus + at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:115) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 12:17:29,943 INFO L168 Benchmark]: Toolchain (without parser) took 55918.59 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -809.8 MB). Peak memory consumption was 453.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:17:29,945 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:17:29,945 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:17:29,946 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.85 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:17:29,946 INFO L168 Benchmark]: Boogie Preprocessor took 37.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:17:29,946 INFO L168 Benchmark]: RCFGBuilder took 1014.72 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 704.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -739.9 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:17:29,947 INFO L168 Benchmark]: TraceAbstraction took 54501.99 ms. Allocated memory was 2.2 GB in the beginning and 2.8 GB in the end (delta: 558.9 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -80.4 MB). Peak memory consumption was 478.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:17:29,950 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 330.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 27.85 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1014.72 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 704.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -739.9 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 54501.99 ms. Allocated memory was 2.2 GB in the beginning and 2.8 GB in the end (delta: 558.9 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -80.4 MB). Peak memory consumption was 478.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: must not be argument of unary minus + de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: must not be argument of unary minus +: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:115) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...